Fetching from the wire…
Public story · 2026-09-26 · high
IterSynth-8B averages 50.7 across five benchmarks, and the split also works as a prompt pattern without retraining.
Why now: The paper is new enough on arXiv that no one outside the authors has tested whether the prompt-only version holds up.
IterSynth splits deep-search agents into a Planner and a Synthesizer. The two share one evolving summary, and that summary, not the growing search history, is the only state the agent keeps.
That's a problem every long multi-step search agent hits. Tool results pile up until they crowd out the model's own reasoning. IterSynth-8B averages 50.7 across five long-horizon benchmarks including BrowseComp, 4.2% above the strongest prior agent at 8B or smaller, according to the IterSynth paper.
IterSynth-8B is trained with a method the authors call Role-Decoupled Policy Optimization.
The authors say the same Planner/Synthesizer split works as a prompting pattern on an existing model, with no retraining required. Anyone running a long search agent can test the two-role structure without touching weights.
The paper doesn't say how the split holds up past 8B. It also doesn't say whether the shared summary starts losing detail on tasks longer than the five benchmarks tested. The 4.2% gap is an average across all five, not a single best case.
Each link below shares sources, entities, or timing with this story.
ArcticSwarm separates evidence gathering from evidence integration: subagents publish to a shared board, but gated isolation lets selected search tasks keep their own prior so parallel agents stop converging on an early candidate before alternatives are tested. On full BrowseC...
The paper names it inertia bias: once an agent has produced a query, plan or intermediate conclusion, it judges the consequences of that action less objectively (arXiv 2608.23045). The IBIS benchmark isolates the effect by holding search observations fixed while varying whethe...
BAAI's AREX (24 authors, 124 upvotes on HF Daily Papers) alternates between gathering evidence and drafting provisional answers, then audits those answers constraint-by-constraint. The distinguishing mechanism is a learned autonomous context-update tool that compresses growing...
Nearly all cache-compaction research assumes a static context where future queries are known offline, which agents never have. Comparing token eviction against attention matching across proxy-query sources on BrowseComp-Plus and WideSearch, compacting a turn immediately often...
The K3 repo's tables put it ahead on SWE-Marathon (42.0 vs 35.0 for Fable 5 and 39.0 for GPT-5.6 Sol), BrowseComp (91.2 vs 88.0 and 90.4), MCPMark-Verified (94.5 vs 87.4 and 92.9), AutomationBench (30.8), and SpreadsheetBench 2 (34.8). It trails on HLE-Full (43.5/56.0 vs 53.3/...
June leaderboards increasingly score a weighted blend of Terminal-Bench 2.0, BrowseComp, and OSWorld-Verified instead of SWE-bench alone, with BenchLM weighting "agentic" browse-and-do workflows at 22%, its highest single category. When you evaluate a tool, the headline chat o...
MindPattern daily
One email a day at 7 AM. Sources and a take on every story. Unsubscribe anytime.