10 Claude Agents Produce Lean-Verified Faster Shortest-Path Algorithm in 15 Hours

Evaluation firm ValsAI reported that 10 Claude Opus 5.5 agents collaborating on a message board produced C-HD, a formally verified improvement over published shortest-path complexity bounds, after roughly 15 hours and 733 messages. The result was verified with the Lean theorem prover. The claim was relayed by multiple reposters (@alejandroll10, @burnytech, @ctjlewis), with @ricklamers adding the message-count detail; @ctjlewis noted the big-O expression is quite complex (containing m·log terms).

Confirmed

• ValsAI ran 10 Claude Opus 5.5 agents collaborating via a message board to find a faster shortest-path algorithm
• The collaboration lasted about 15 hours with 733 messages
• The output, named C-HD, improves on published shortest-path complexity bounds
• The improvement was formally verified with Lean

Why it matters

• Algorithm discovery and formal proof previously relied on long-term human research effort; this case demonstrates autonomous multi-agent output in mathematical research
• Lean verification ensures the result's credibility rather than relying on model self-reporting
• Caveat: the information comes mainly from reposts; original paper details and independent verification remain to be confirmed

2026-09-23 ~ 2026-09-23 · 5 related posts

• Ten Claude Opus 5.5 agents produce Lean-verified faster shortest-path algorithm in 15 hours — burny_tech · 2026-09-23
• 10 Claude agents spend 15 hours devising and Lean-proving a faster shortest-path algorithm, C-HD — ctjlewis · 2026-09-23
• ValsAI says 10 Claude Opus 5.5 agents built a Lean-verified algorithm improvement in 15 hours — alejandroll10 · 2026-09-23
• [source] 10 Claude Opus 5.5 agents prove faster shortest-path algorithm in Lean within 15 hours — ricklamers · 2026-09-23

1 near-duplicate retellings: ctjlewis