Fetching from the wire…
Public story · 2026-08-04 · high
Half of all description changes in the registry land on new arrivals with no drift history to rank against, per arXiv 2608.00997.
Why now: The registry passed 18,966 servers in the paper's reconstruction, big enough that a flat 5% re-audit budget is a real operational tradeoff, not a hypothetical one.
An 89-day reconstruction of the MCP registry found that ranking servers by drift history catches only 10% of the servers that rewrite their descriptions, per arXiv 2608.00997.
That's the catch rate at a top-5% re-audit budget, the size a registry can realistically run. Miss the other 90%, and a server can rewrite its description into something malicious after approval, with no history-based check flagging it.
History-based ranking isn't worthless. It buys roughly 4x lift over random checks. But two facts cap how far that lift reaches: only 8.6% of servers in the registry ever rewrite a description at all. Close to half of the rewrites that do happen land on new arrivals, servers with no drift history for a ranking to read.
The registry's growth compounds the problem. It grew from 3,510 to 18,966 servers over the study's window, putting more risk in servers too young to have any history.
The paper's proposed fix is content-binding: tie trust to a hash of the current description, and re-audit the moment that hash changes. Back that with a periodic sweep sized to catch the servers a ranking system can't reach.
This isn't really a ranking-algorithm problem. It's the assumption that trust accrues with history in a registry adding servers faster than any of them can build one. Watch whether the registry adopts hash-triggered re-audits, or keeps tuning a reputation score that structurally can't reach half its risk.
Each link below shares sources, entities, or timing with this story.
Claude uses MCP / Shared entity: MCP / Same source domain / Shared topic / Earlier coverage / Tension
Linked by a graph relationship (Claude uses MCP); both cover MCP; reported by the same outlet (arxiv.org).
Cursor uses MCP / Shared entity: MCP / Same source domain / Shared topic / Earlier coverage
Linked by a graph relationship (Cursor uses MCP); both cover MCP; reported by the same outlet (arxiv.org).
OpenAI supports MCP / Shared entity: MCP / Same source domain / Earlier coverage / Tension
Linked by a graph relationship (OpenAI supports MCP); both cover MCP; reported by the same outlet (arxiv.org).
Claude Code uses MCP / Shared entity: MCP / Shared topic / Earlier coverage / Tension
Linked by a graph relationship (Claude Code uses MCP); both cover MCP; overlapping topics (budget, server).
Microsoft supports MCP / Shared entity: MCP / Shared topic / Earlier coverage / Tension
Linked by a graph relationship (Microsoft supports MCP); both cover MCP; overlapping topics (description, server).
Claude uses MCP / Shared entities / Earlier coverage
Linked by a graph relationship (Claude uses MCP); both cover Content, MCP; earlier Content coverage from 2026-07-15.
MCP deprecates Roots / Shared entity: MCP / Shared topic / Earlier coverage
Linked by a graph relationship (MCP deprecates Roots); both cover MCP; overlapping topics (chang, server).
Cursor uses MCP / Shared entity: MCP / Same source domain / Earlier coverage
Linked by a graph relationship (Cursor uses MCP); both cover MCP; reported by the same outlet (arxiv.org).