AIHacker Newsabout 2 hours ago
AI Agents Prove Faster Shortest Path Algorithm
8 min read
Ten Claude Opus 5.5 agents, given a message board and 15 hours, produced C-HD, a formally verified shortest-path algorithm that improves on Dijkstra's O(m + n log n) bound in a certified density range. The Lean proof shows O(n log^{11/12} n) along m ≈ n log^{3/4} n, but no large-graph benchmarks were run.
Level
Hype check
Tap to vote and see what everyone thinks.
