Fetching from the wire…
01
02
03
04
05
06
07
08
Public story · 2026-08-04 · high
Delaying cache compaction until the agent's next query exists recovers most of the accuracy lost by an 80% cut, new research finds.
Why now: The finding lands in the August 4 briefing, at the point where compaction research is starting to grapple with agents that don't know their next query ahead of time.
Cache compaction hurts AI agent accuracy when it happens too early, per the arXiv paper testing it on two agent benchmarks.
That matters for anyone running multi-turn agents: coding assistants, search agents, anything that keeps a growing context window across turns. Trimming that cache to save memory can quietly cut into how well the agent answers its next question. Most compaction research doesn't test for that failure mode.
Nearly all existing compaction work scores against a future query that's already known ahead of time, a setup borrowed from offline benchmarks. Agents don't get that luxury. They generate their next query as they go, so there's no fixed target to compact against until that query actually exists.
The study tested two compaction methods, token eviction and attention matching, across several proxy-query sources on the BrowseComp-Plus and WideSearch benchmarks. Compacting a turn right after it happened often hurt accuracy under both methods. Waiting until the agent's own next query existed, then using that real query as the proxy, recovered most of the lost accuracy.
Token eviction, the plainer of the two methods, held up better than attention matching when the proxy query was a poor match. It preserved most of the accuracy even after cutting the cache by 80%.
For anyone building agent loops with long context windows, that points to a specific fix. Skip the fixed compaction schedule. Trim once the next tool call or query exists.
Each link below shares sources, entities, or timing with this story.
SOL benchmarked against BrowseComp / Same source domain / Shared topic / Tension
Linked by a graph relationship (SOL benchmarked against BrowseComp); reported by the same outlet (arxiv.org); overlapping topics (against, agent).
Shared entities / Same source domain / Earlier coverage
Both cover BrowseComp, WideSearch; reported by the same outlet (arxiv.org); earlier BrowseComp coverage from 2026-07-25.
Both cover Nearly, Token; reported by the same outlet (arxiv.org); earlier Nearly coverage from 2026-07-10.
Shared entity: Nearly / Same source domain / Shared topic / Earlier coverage
Both cover Nearly; reported by the same outlet (arxiv.org); overlapping topics (against, agent).
Shared entity: Token / Same source domain / Shared topic / Earlier coverage
Both cover Token; reported by the same outlet (arxiv.org); overlapping topics (agent, token).
Both cover Token; reported by the same outlet (arxiv.org); overlapping topics (attention, cache).
Claude Haiku benchmarked against BrowseComp / Shared topic / Tension
Linked by a graph relationship (Claude Haiku benchmarked against BrowseComp); overlapping topics (against, agent); pushes against this story (against).
Shared entity: Token / Shared topic / Earlier coverage / Tension
Both cover Token; overlapping topics (agent, token); earlier Token coverage from 2026-06-01.