Sumanth 提议加强对上下文压缩机制的测量

Compacting aggressively changes the cost calculus for long-running agents: short state summaries can outperform full transcripts on both accuracy and spend, since late-token generation runs up to 7x pricier. Builders running multi-step coding or tool-use agents can test end-of-conversation compaction before paying for million-token runs. The gains were measured on Claude Opus 4.5, so teams using other frontier models should verify the effect on their own stacks.

elvis@omarsar011 sourcesSource

Idle compaction quietly solves a real cost problem: long sessions that sat untouched were losing their prompt cache and forcing full reprocessing on the next message. Teams running self-hosted runners or managed deployments get the most out of this release, from drain-time controls to attribution-header toggles behind a Claude apps gateway. Admins should review the new managed-settings hooks before rolling it out.

官方一手Claude Code: GitHub Releases@ashwin-ant11 sourcesSource

Compression damages run-to-run reliability before it makes tasks unsolvable, so single-run evals will miss the problem — repeated-run consistency is the metric to watch. Builders of long-horizon agent systems can use PAIR's replay-and-compare approach to pinpoint which compression events break their workflows. The paper's benchmarks, AppWorld and tau-Bench Retail, offer concrete testbeds for comparing compression prompts.

DAIR.AI@dair_aiSource

The counterintuitive takeaway is that a compaction policy tuned to minimise tokens can raise total latency and cost, since extra model calls eat the savings. Agent builders should measure latency and cost per model before adopting a policy, rather than copying one that worked elsewhere. The paper is on arXiv (2609.32961) with a companion Chat-with-Paper tool at academy.dair.ai.

elvis@omarsar0Source