# UK Data: GB road traffic counts (DfT) > Great Britain road traffic counts from the DfT: count points, vehicles per day by type, hourly - name: uk.co.reliness/uk-roads-traffic - version: 1.5.0 - connection class: R0 (autonomous) - trust: 82/100 flags: no-repository - quality: 91/100 (strong) - owner: not claimed - descriptor: https://api.protogrid.dev/v1/servers/uk.co.reliness%2Fuk-roads-traffic - tools: https://api.protogrid.dev/v1/servers/uk.co.reliness%2Fuk-roads-traffic/tools **An agent can connect right now, no human step.** Remote endpoint, no authentication, reachable on the last probe. ## Connection (mcpServers) ```json { "mcpServers": { "uk-roads-traffic": { "type": "http", "url": "https://ukdata.reliness.co.uk/mcp/uk-roads-traffic", "headers": { "Authorization": "Bearer ${UK_ROADS_TRAFFIC_TOKEN}" } } } } ``` Placeholders to fill: `${UK_ROADS_TRAFFIC_TOKEN}`. ## Trust - hygiene: 80 - liveness: 99 - freshness: 100 - provenance: 55 - drivers: +dns-namespace +website +reachable +uptime-97% +updated-7d-ago -no-repository - Derived from observable signals (official registry feed and our own credential-free probes); no code audit performed. ## Quality 91/100 (strong) ### protocol: 75 (weight 25) - warn `protocol.modern`: newest supported version is 2025-11-25; 2026-07-28 not supported, older versions are deprecated until 2027-07-28 - n/a `protocol.stateless`: only applies to 2026-07-28 servers - pass `protocol.transport`: streamable HTTP - n/a `protocol.list_ttl`: only applies to 2026-07-28 servers ### authorization: n/a (weight 15) - n/a `auth.prm`, `auth.as_metadata`, `auth.cimd`: no remote uses OAuth - n/a `auth.secret_in_url`: no templated URL ### tool hygiene: 100 (weight 30) - pass `tools.descriptions`: every tool has a description - pass `tools.description_length`: descriptions are concise - pass `tools.schemas`: every tool has an object input schema - pass `tools.annotations`: 6 of 6 tools declare readOnlyHint or destructiveHint - pass `tools.directory_hints`: every tool declares readOnlyHint, destructiveHint, idempotentHint and openWorldHint - pass `tools.token_cost`: about 1,438 tokens to load every tool - pass `tools.api_dump`: tools are not a one-to-one API dump - pass `tools.hidden_text`: no hidden text in tool names, descriptions, schemas or annotations ### stability: 100 (weight 15) - pass `stability.changes`: no tool changes in 30 days - pass `stability.rug_pull`: no tool changed its meaning under the same name - pass `stability.new_links`: no tool change named a new site ### dependencies: n/a (weight 15) - n/a `deps.known_vulns`, `deps.mcp_sdk_version`, `deps.resolvable`: no npm or PyPI package - tools: 6, about 1,438 tokens to load them all - tool set hash: 91ad3bf6bb2b1067a5a7b8b48f995fa3 - badge: [![protogrid quality](https://protogrid.dev/badge/uk.co.reliness/uk-roads-traffic.svg)](https://protogrid.dev/servers/uk.co.reliness/uk-roads-traffic) - Checks run on what our credential-free, read-only probes observe; tools are never called and no code audit is performed. ### Tool changes _No tool definition changes recorded._ ## Remotes - https://ukdata.reliness.co.uk/mcp/uk-roads-traffic (streamable-http, auth none, reachable true, uptime30d 0.9655172) ## Packages _none_ ## Tools (6) - `local_authority_traffic_totals`: Gives the total distance driven on all roads in one GB council area each year, in million vehicle miles (and vehicle km), for all motor vehicles and for cars and taxis, plus the area's road length, newest year first. Answers "how much traffic is there in Leeds and is it growing" for council officers, net-zero and carbon plans, and consultants comparing areas. Minor-road traffic is a DfT estimate; this endpoint does not split vans, HGVs or buses (use region_traffic_by_vehicle_type for that at region level). (cost: 1 credit) - `region_traffic_by_vehicle_type`: Gives annual traffic in one GB region (English regions, Scotland or Wales) by vehicle type, in million vehicle miles: cars and taxis, vans, HGVs, buses and coaches, motorcycles and pedal cycles, plus road length, newest year first. Useful for market sizing (for example van or HGV traffic for fleet services), journalism and coursework. Regional totals only; for a single council use local_authority_traffic_totals, and for one road use road_traffic_flow_at_point. (cost: 1 credit) - `road_traffic_flow_at_point`: Gives average annual daily flow (AADF) at one DfT count point: the average number of vehicles passing per day over a year, both directions together, split into cars and taxis, vans, HGVs, buses, motorbikes and pedal cycles, newest year first. Answers "how many cars pass this site a day" and "is traffic on this road rising" for shop, billboard, EV charger or planning work. Some years are estimated by DfT rather than counted, and each row says which; it does not cover live traffic or congestion. (cost: 1 credit) - `road_traffic_hourly_counts`: Returns the hour-by-hour manual traffic counts DfT recorded at one count point on its survey day, by direction of travel, with each direction's busiest hour and 12-hour total. Answers peak-hour questions such as "how busy is this road at 8am" for transport consultants and planning statements. Counts cover one weekday between 07:00 and 19:00 in the survey year, not averages or night-time, and many points are only surveyed every few years. (cost: 1 credit) - `traffic_local_authority_find`: Finds the DfT local authority id, ONS code and region for a council from its name (partial names work, e.g. "Leeds", "Bristol", "Kingston"), or from an ONS code such as E08000035. Use it before local_authority_traffic_totals or traffic_count_points_in_council. Covers Great Britain councils as DfT lists them, including some former councils kept for older years; it is not a postcode lookup. (cost: 1 credit) - `traffic_regions_list`: Lists the 11 Great Britain regions DfT uses for traffic statistics (the nine English regions, Scotland and Wales) with their DfT region ids, ONS codes and country. Use it to get the region_id for region_traffic_by_vehicle_type. Northern Ireland is not covered by DfT road traffic statistics. (cost: 1 credit)