Hardest Fermat lemma spawned a 2,418-task tree across ~750 agents, 10 levels deep
RLanceMartin · x · 2026-11-10
Lance Martin details how the 1,000-agent team handled the largest statement in the Fermat proof: the agents set up a task tree spanning 750 agents, growing whenever a piece proved too hard for a single agent — ultimately reaching 2,418 tasks up to 10 levels deep.
A showcase of dynamic problem decomposition without external planning.
More from coding & agent
- Prompting tip: describe the problem, not your solution, for better agent grilling — mattpocockuk · 2026-11-10
- The One-Person Million-Dollar AI Agency: An Agent-Stack Blueprint With the Math — boringmarketer · 2026-11-10
- Developer natively manages 25-30 parallel agent sessions on macOS with Rex — jonathan_wilke · 2026-11-10
- Pi Dash orchestrates 10 Muse Code agents with Muse Ember, rewriting 178K lines in a day — AIatMeta · 2026-11-10
- Fable 5.2 builds a voxel destruction engine from a single prompt, runs on a MacBook — mattshumer_ · 2026-11-10
- Microsoft Foundry extension for azd hits GA, agent config lives in azure.yaml — WirelessLife · 2026-11-10