C-HD: AI-Discovered Shortest-Path Algorithm
Vals AI
@ValsAI · 23.3K followersTen Claude Opus 5.5 agents collaborated for 15 hours to devise C-HD, a new shortest-path algorithm that formally beats published bounds — then proved it correct in Lean. The visualization shows a weighted grid where each cell carries a directional arrow, with the optimal C-HD route traced in dark green from origin circle to destination pin. It's a genuine research artifact: a machine-discovered, machine-verified improvement over decades of human-authored graph theory.
- Ten agents running in parallel produced a formally verified algorithm improvement in just 15 hours
- The Lean proof means the result is mathematically guaranteed, not just empirically tested
- C-HD improves on published complexity bounds for shortest-path — a result that eluded human researchers
“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.”
Similar builds
Life-Size LEGO Microduck — 1,113 Parts, 237 Steps
@victormustar
♥ 8.7K · 1.4M views
Claude Opus 5.5 Paints Like the Masters
@jkeatn
♥ 5K · 816.5K views
Three Gadgets Designed End-to-End by Fable 5.2
@claudeai
♥ 3.9K · 590.2K views
Agent Office — Walk Around & Manage AI Coders
@webdevcody
♥ 3.8K · 485.8K views
Mars-to-Earth Radio Delay Narrative
@AndrewOnXYZ
♥ 3.1K · 380.4K views
Floor Plan to Walkable 3D Home
@everestchris6
♥ 3.2K · 219K views
The Biggest Scam — A Wordless Visual Essay
@ivanainai
♥ 2.6K · 434K views
San Francisco Rebuilt in Unreal Engine
@MatthewBerman
♥ 2.2K · 371.8K views