Team-of-N Agents Beats Single Agent by 10-100x Tokens, Sparking Baseline Debate

On September 22, Dimitris Papailiopoulos, author of a multi-agent collaboration paper, kicked off a debate that became the day's focal discussion on agent scaling. On MNIST, his team-of-N vs. single-agent curves suggest a single best agent needs 10-100x the token budget to match the team; ablations further show that on some problems N agents running in parallel for 1x time beat one agent running for Nx time — making multi-agent compute-optimal, not just faster. generatormanai then challenged the methodology, and several researchers added experiments and explanations.

Confirmed

• DimitrisPapail showed MNIST team-of-N vs. single-agent best-of-N curves, inferring a single agent needs 10-100x tokens to match team performance.
• Ablation data he shared shows that on some problems, N agents in parallel for 1x time beat one agent running Nx time — parallel agents are compute-optimal for some problems.
• He added that in another project, periodically clearing an agent's context while keeping only a summary document of "what happened so far" also beat the best single agent.
• jonghoh cited ARC-AGI-3 ablations: with sufficient compute, single agents with larger token budgets plateau faster than same-budget best-of-N, meaning team-style multi-agent scales better under equal total compute.
• ShangyinT summarized converging observations: best-of-N@T under equal compute far outperforms serial best-of-1.
• DimitrisPapail offered a cautious mechanism: models become "narrow-sighted" on a single very long context (NT), while injecting entropy across multiple API calls may help — stressing this is an unscientific hunch.

Unconfirmed

• generatormanai's methodological objection remains unresolved: the correct serial baseline for team-of-N at budget T should be a single agent with budget NT (best-of-1@NT), not best-of-N; no correction appears in the material.
• No evidence yet on whether the MNIST findings generalize to complex real-world tasks.

Why it matters

• If the 10-100x efficiency advantage and parallel compute-optimality hold broadly, it directly shapes agent architecture choices: prefer teams over giant single contexts under equal compute.
• Periodic context clearing plus a summary document is a cheap, immediately applicable engineering trick aligned with long-context attention degradation.
• The baseline dispute warns the community: multi-agent papers lacking a best-of-1@NT baseline may overstate efficiency gains.

2026-09-22 ~ 2026-09-22 · 8 related posts

Full story(2 episodes)→

• Episode 1: Test-Time Communication: Team-of-5 Agents Matches Best-of-33(2026-09-21, 25 posts)
• Episode 2: Team-of-N Agents Beats Single Agent by 10-100x Tokens, Sparking Baseline Debate(2026-09-22, 8 posts)

• [source] Debate: correct serial baseline for team-of-N is best-of-1 at N*T budget — generatorman_ai · 2026-09-22
• ARC-AGI-3 Ablation: Single Agent With More Budget Plateaus Faster Than Team-of-N — jon_ghoh · 2026-09-22
• [source] MNIST Curves Suggest a Single Agent Needs 10-100x Budget to Match a Team of Agents — DimitrisPapail · 2026-09-22
• Multi-agent vs serial debate: best agent needs 10-100x tokens to match team — generatorman_ai · 2026-09-22
• Why multi-agent wins: Papail suggests entropy injection across API calls helps — DimitrisPapail · 2026-09-22
• [source] Multi-agent paper authors: periodically flushing context and keeping a summary doc helps a lot — DimitrisPapail · 2026-09-22
• Multi-agent scaling can be compute-optimal: N parallel agents beat one agent run N-times longer — DimitrisPapail · 2026-09-22
• Parallel beats serial at equal budget: best-of-N@T far outperforms best-of-1@N*T — ShangyinT · 2026-09-22