We asked ten Claude Opus 5.5 agents to devise a faster shortest-path algorithm and prove it in Lean. Within 15 hours, they produced C-HD: a formally verified improvement over the published bounds.
Science
Ten agents found a faster shortest-path algorithm, proved in Lean
Vals AI set ten Claude Opus 5.5 agents loose on the shortest-path problem. Within 15 hours they produced C-HD, an algorithm with a formally verified improvement over the published bounds.
3.4Klikes
246reposts
1.2Ksaves
1.4Mviews
- Made with
- Claude Opus 5.5, Lean
- Posted
