Duke and Princeton paper: 10 small parallel agent teams beat best-of-N and one giant team

rohanpaul_ai · x · 2026-11-11

A Duke/Princeton/Modal Labs/NYU paper finds that at equal compute, running many small parallel agent teams beats both best-of-N sampling and one giant team.

Method: With a verifier that scores every attempt, split a 100-agent budget into 10 teams of 10 that share a discussion forum, then keep the best team's result.

Key results:

Takeaway: if a verifier can score your agents' work, split the budget into several small note-sharing teams and keep the best answer. Code: github.com/modal-projects/parallel-agent-teams-scaling.

Related event: Duke/Princeton Paper: Parallel Small Agent Teams Scale Test-Time Compute Better(2 posts)→

Original post →

More from coding & agent

coding & agent channel →