Structured summary selection before coding-agent reruns
Repository-scale coding agents now justify a separate trajectory compression layer between rollout generation and final patch selection. The evidence is specific: Scaling Test-Time Compute for Agentic Coding replaces full traces with short structured summaries, then uses Recursive Tournament Voting and summary-based refinement. On SWE-Bench Verified, the full pipeline lifts Claude-4.5-Opus from 70.94% to 77.60%. On Terminal-Bench v2.0, it lifts Claude-4.5-Opus from 46.95% to 59.09% and Claude-4.5-Sonnet from 40.62% to 56.82%. The paper also reports that refinement with selected summaries can cut average agent steps by about half while improving pass@1.
That points to a buildable product change for teams already running multiple coding-agent attempts on the same ticket: store each run as a compact diagnosis-and-fix summary, rank summaries before ranking patches, and feed the best few summaries into a clean retry in a reset environment. The user is the engineering org that already pays for parallel attempts and wants better pass rates without simply increasing sample count. A cheap validation check is to run this layer on a fixed internal bug set with the current agent, compare patch success and average steps against plain best-of-N sampling, and inspect whether summary quality predicts final success strongly enough to justify the extra orchestration.