A new arXiv paper challenges the assumption that compressing file reads saves money in multi-turn coding agents. Instrumenting a production gateway between agents like Claude Code and models like GPT-5, the authors decompose token bills into three levers. Controlled A/B tests reveal that tool-schema filtering, content compression, and history summarization save costs at fundamentally different rates.
- Aggressive compression preserves quality but doesn't guarantee lower bills in real sessions.
- Token savings vary significantly across filtering, compression, and summarization strategies.
- Instrumenting production gateways reveals the true cost attribution of each lever.
- Tool-schema filtering and content compression operate at different efficiency rates.