Swarm of Agents
A runnable miniature of a multi-agent swarm, on the cap set problem.
| My role | Builder |
|---|---|
| Started | 2026 |
| Status | Public repository |
| Field | AI & mathematics |
| Website | github.com/renan-devil/swarmofagents |
Swarm of Agents is a small, runnable model of the multi-agent strategy reportedly used in September 2026 to produce a Navier–Stokes blow-up proof, applied to a mathematics problem whose answers a program can check exactly: the cap set problem in F₃ⁿ, the largest set of points with no three on a line.
Groups of explorer agents propose constructions, consolidators merge the best ones, and a verifier checks every proposal exactly, so nothing unproven is kept. Offline heuristics reach the proven maximum of 45 in dimension five in a few minutes; with a Claude API key, the explorers become model calls that write constructions as code. The repository includes the write-ups on why the problem was chosen and how the architecture works.
Milestones
- 2026 — Published as a public repository.