10 Claude agents spend 15 hours devising and Lean-proving a faster shortest-path algorithm, C-HD

ctjlewis · x · 2026-09-23

ValsAI tasked ten Claude Opus 5.5 agents with devising a faster shortest-path algorithm and proving it in Lean. Within 15 hours they produced C-HD, a formally verified improvement over published bounds, with an intricate big-O expression. The sharer quips: "you're not ready for the big-O notation on this one."

Related event: 10 Claude Agents Produce Lean-Verified Faster Shortest-Path Algorithm in 15 Hours(5 posts)→

Original post →

More from Models

Models channel →