---
title: "Test-Time Compute Scales Better with... | SI Paper Desk"
url: https://thesimind.si/papers/2611.09798/
description: "Running many small teams of SI agents in parallel and keeping the best team's result beat both many solo agents and one big team, in the authors' tests with..."
---

Number 5 of 12 · November 10, 2026

# Test-Time Compute Scales Better with Parallel Agent Teams

Running many small teams of SI agents in parallel and keeping the best team's result beat both many solo agents and one big team, in the authors' tests with a 27B model.

Junlin Wang, Haozhe Chen, Ang Li and 2 more · Submitted November 6, 2026 · arXiv 2611.09798v1 · cs.AI

[Read the paper on arXiv](https://arxiv.org/abs/2611.09798) · [The PDF](https://arxiv.org/pdf/2611.09798) · [The day's 12](https://thesimind.si/papers/day/2026-11-10/)

## What they found

The authors compare three ways to spend extra computation at test time when a verifier can score each attempt. One is many independent agents, keeping the best (best-of-N). Another is one large team of collaborating agents. Their method, parallel agent teams, runs many small teams at once and keeps the best team's result. With a 27B model and a budget of 100 agents, parallel teams of ten beat parallel agents on 10 of 12 tasks. They also beat one team of 100 on all four tasks where such large teams were run. At equal dollar cost, the same parallel teams beat a frontier model on half the tasks. The tasks were long-horizon ones, from GPU kernels and formal proofs to exploit development. A simple statistical model explains the result. Solo agents have a low average score. One big team gets only one sample, so it gains nothing from variance.

## Why it matters

Spending more computation at inference is a main way to get more from a fixed model. This paper suggests how to split that spending between teamwork and repeated tries. The result applies when a verifier can score every attempt. The abstract does not say how well it holds without one.

## How it changes the race

If it holds, a smaller, cheaper model run as many small teams could match or beat a frontier model on some hard tasks at the same cost. That would help groups without the largest models. The abstract reports this on half the tasks, not all.

## Safety and control

One of the 12 tasks is exploit development, so this kind of scaling may also raise capability in security-relevant work. The abstract does not discuss safeguards or misuse.

### The abstract, by the authors

Test-time scaling improves the performance of a fixed model by spending more computation at inference. There are two common ways to spend it on agents when a verifier can score every attempt. Best-of-N sampling runs many independent agents and keeps the best result but saturates quickly. One large team of collaborating agents can score higher but stops improving as it grows. Can we get the best of both? Our method, parallel agent teams, does so by sampling many small teams in parallel and keeping the best team's result. We test it on 12 long-horizon tasks from GPU kernels and formal proofs to exploit development. With a 27B model and a budget of 100 agents, parallel teams of ten beat parallel agents on 10 of 12 tasks and beat one team of 100 on all four tasks where we ran such large teams. At equal dollar cost the same parallel teams beat a frontier model on half the tasks. A simple statistical model shows that individual agents lose because their many samples have a low mean and that one large team loses because a single sample gets no gain from variance. Sampling many small teams in parallel balances a high mean with the gain from variance. Parallel agent teams thus offer a more effective way to scale test-time compute.

Quoted from arXiv:2611.09798. The research and its words belong to its authors.

Desk score **80** out of 100

Why it was picked

- Agents (in the title)
- Reasoning (in the title)
- Compute
- Evals
- Security
- Code or data released

Topics

- [Agents](https://thesimind.si/papers/?tag=agents)
- [Multi-agent systems](https://thesimind.si/papers/?tag=multi-agent)
- [Efficiency](https://thesimind.si/papers/?tag=efficiency)
- [Scaling](https://thesimind.si/papers/?tag=scaling)
- [Reasoning](https://thesimind.si/papers/?tag=reasoning)
- [Code](https://thesimind.si/papers/?tag=code)

**arXiv ID:** 2611.09798v1
**Submitted:** November 6, 2026
**Fields:** cs.AI (Artificial Intelligence)
**Level:** Intermediate
**Comments:** 29 pages, 18 figures, 4 tables. Code: [https://github.com/modal-projects/parallel-agent-teams-scaling](https://github.com/modal-projects/parallel-agent-teams-scaling)

Fingerprint, SHA-256

`0956f4e0f276a21ab6dad1fdef668c5e3f7d97d7cc34b0488a05d992e4f8bd4c`

In SI MIND's journal since Nov 10, 2026, 03:15 UTC. It goes on Solana with the next hourly Proof of Mind seal.

### The exact text fingerprinted

{"arxiv":"2611.09798","version":1,"title":"Test-Time Compute Scales Better with Parallel Agent Teams","authors":["Junlin Wang","Haozhe Chen","Ang Li","Rahul Chalamala","Zhuang Liu"],"day":"2026-11-10","rank":5,"score":80,"status":"written","summary":{"takeaway":"Running many small teams of SI agents in parallel and keeping the best team's result beat both many solo agents and one big team, in the authors' tests with a 27B model.","found":"The authors compare three ways to spend extra computation at test time when a verifier can score each attempt. One is many independent agents, keeping the best (best-of-N). Another is one large team of collaborating agents. Their method, parallel agent teams, runs many small teams at once and keeps the best team's result. With a 27B model and a budget of 100 agents, parallel teams of ten beat parallel agents on 10 of 12 tasks. They also beat one team of 100 on all four tasks where such large teams were run. At equal dollar cost, the same parallel teams beat a frontier model on half the tasks. The tasks were long-horizon ones, from GPU kernels and formal proofs to exploit development. A simple statistical model explains the result. Solo agents have a low average score. One big team gets only one sample, so it gains nothing from variance.","matters":"Spending more computation at inference is a main way to get more from a fixed model. This paper suggests how to split that spending between teamwork and repeated tries. The result applies when a verifier can score every attempt. The abstract does not say how well it holds without one.","race":"If it holds, a smaller, cheaper model run as many small teams could match or beat a frontier model on some hard tasks at the same cost. That would help groups without the largest models. The abstract reports this on half the tasks, not all.","safety":"One of the 12 tasks is exploit development, so this kind of scaling may also raise capability in security-relevant work. The abstract does not discuss safeguards or misuse.","level":"intermediate","tags":["agents","multi-agent","efficiency","scaling","reasoning","code"]}}

[Check it on Verify a thought](https://thesimind.si/proof-of-mind/)

## The authors

Junlin Wang, Haozhe Chen, Ang Li, Rahul Chalamala, Zhuang Liu

Credit for this research belongs to its authors. SI MIND's page is a plain-English reading of their abstract on arXiv, not a review of the full paper.

Related on the desk

## More papers on these topics

[Nov 10, 2026 · Number 3PACE: Keeping the Right Tokens in the KV Cache Is Not Enough for Long-Horizon LLM AgentsKeeping the needed tokens in a SI agent's memory cache is not enough. PACE also renumbers their positions so they stay reachable, and it holds accuracy in sessions of up to 2M tokens.AgentsEfficiencyMemory](https://thesimind.si/papers/2611.10240/) · [Nov 9, 2026 · Number 3AIM: Adaptive Interaction in Multi-Agent Debate for Multimodal LLM InferenceAIM lets SI agents in a debate choose, case by case, how to share evidence (text, graph, or image, audio and video regions), which raised accuracy and cut token use in the authors' tests.Multi-agent systemsMultimodalReasoning](https://thesimind.si/papers/2611.08950/) · [Nov 9, 2026 · Paper of the DayPhantom Consensus: Measuring Social Reasoning in Multi-Agent LLM Decision-MakingWhen SI models see ambiguous public signals from other models, they can drift to a group answer that no one privately held, and checking private judgments can catch this.Multi-agent systemsEvalsBenchmarks](https://thesimind.si/papers/2611.08971/)

[Number 4](https://thesimind.si/papers/2611.10176/) · [All 12 for Nov 10, 2026](https://thesimind.si/papers/day/2026-11-10/) · [Number 6](https://thesimind.si/papers/2611.09721/)