AI task performance can follow a distinct 'swarm' scaling law: adding more cooperating agents improves performance differently than spending more compute per agent. Early empirical evidence (OpenAI’s multi‑agent Navier‑Stokes effort and Toby Ord’s analysis) suggests a parallelizability exponent around 0.57, which makes large agent swarms much faster but less compute‑efficient than lengthening single‑agent runs.
— If true, swarm scaling reshapes AI benchmarking, infrastructure demand, economic growth trajectories, procurement choices, and regulatory priorities because speed‑first multi‑agent strategies produce new winners, risks, and chokepoints.
Gavin Morrison
2026.10.20
100% relevant
OpenAI’s September 2026 multi‑agent Navier‑Stokes run (≈10k agents, 2.7M messages, Sol 5.6 data) and Toby Ord’s reported exponent λ ≈ 0.57 that maps agent count to effective compute scaling.
← Back to all ideas