Measuring Claude Code MCP Stack: Cache Friendliness vs. Byte Savings, and a 2-Line Fix for Prompt Cache

When optimizing a Claude Code MCP stack, it's easy to focus on one metric: byte savings. But Greg Shevchenko's new analysis shows that a single-axis benchmark can recommend a system that's strictly worse in production. The missing axis: cache friendliness, i.e., whether the same input produces byte-identical bytes across runs so Anthropic's prompt cache hits.
Shevchenko's biggest byte-saver—a retrieval MCP that cut context 60–70%—was actually defeating the 5-minute TTL prompt cache on every call. Two runs of the same query produced different bytes because rg --files-with-matches output order leaked through a Map insertion sequence into the final context. The fix was two lines: sort the rg hits before slicing, and sort the Map entries by path. After the change, byte savings remained unchanged, but cache_friendly_score went from ~0% to 100%.
What the Harness Measures
Shevchenko released an open-source benchmark harness (stdlib-only Python, offline) that measures:
- Mean ratio + CV across N≥5 runs per fixture → byte-saving axis
- Unique MD5 count == 1 check → cache-friendliness axis (0–100%)
- 12-anti-pattern audit on tool definitions (DSA reference)
Any compressor as (str) -> str can be plugged in. The harness uses cluster-bootstrap CIs, Wilson CIs, preregistration, and real-data Cohen's κ.
Public Alternatives Surveyed
Shevchenko surveyed public docs for: Cursor codebase index, Sourcegraph Cody, Aider repo-map, Microsoft LLMLingua/LLMLingua-2, Firecrawl/Jina Reader, RouteLLM/Martian (as of May 2026). None disclosed cache-friendliness metrics.
Limitations
He hypothesized that the prep layer triggers more downstream cache hits on subsequent turns, but it didn't reach significance (Welch p=0.32, Cohen's d≈0.18, N=137). Two-judge Cohen's κ on the corpus was 0.5955 (moderate, below 0.7 threshold), with 4 of 5 disagreements on one ambiguous task—fixing the spec would push κ to ~0.83.
The harness is MIT-licensed. If you're running a Claude Code MCP stack, measuring cache_friendly_score is now a concrete, actionable step.
📖 Read the full source: r/ClaudeAI
👀 See Also

Exploiting LLM Hidden Agency Signal (Â) for Better Tool Calling
A developer discovered that LLMs have a linearly separable hidden state direction called  that predicts tool calls with AUC > 0.94. Using this signal to force tool calls improved Qwen3-1.7B performance from 26.7% to 85% (+58% gain) and reduced no-tool failures from 43% to 2.6%.

Memento v1.0: Persistent Memory MCP Server for Claude Code with 17 Tools
Memento v1.0 is a persistent memory MCP server for Claude Code that ships with 17 tools, hybrid search, contradiction detection, and a visual memory graph. It runs locally with no cloud dependencies and supports multiple IDEs including Claude Code, Cursor, Windsurf, and OpenCode.

OpenClaw users report planning and review bottlenecks with AI agents
OpenClaw users describe planning and review workflows as 'MS-DOS-like' despite effective code generation, citing manual intervention, document fragmentation, and loss of reasoning during agent collaboration. Some are experimenting with agent-native document editors like comment.io and Proof by Every.

Send OpenClaw Agents as Meeting Participants with Voice, Chat, and Screen Share
A new skill lets OpenClaw agents join Google Meet, Teams, and Zoom as full participants with voice (STT/TTS), chat, video avatar, and screen sharing.