GoKawiilAI agents design and Lean-verify new shortest-path algorithm beating published bounds
Ten Claude Opus 5.5 agents were tasked with finding a faster exact shortest-path algorithm for directed graphs with non-negative real weights and proving it correct in the Lean theorem prover. Over roughly 15 hours and 733 messages, the agents produced an algorithm called C-HD, which its creators say formally improves on previously published complexity bounds, including Dijkstra's algorithm and two recent 2025 and 2026 papers.
GoKawiil's interpretation of the reporting above, not reported fact.
If the formal verification holds up to scrutiny, this would mark a concrete case of AI agents contributing an original, rigorously checked advance to a long-studied area of theoretical computer science rather than just replicating known results. It also demonstrates a workflow where multiple AI agents collaborate and use formal proof tools like Lean to guard against subtle errors in algorithmic claims, which could suggest a template for AI-assisted research in other technical domains.
- Ten Claude Opus 5.5 agents were set the task of beating known shortest-path algorithm bounds.
- The agents produced C-HD, a new algorithm with a Lean-verified correctness and complexity proof, in about 15 hours.
- The result reportedly improves on Dijkstra's algorithm and two more recent 2025/2026 papers for certain graph parameter ranges.
Introduction to Algorithms (CLRS textbook) — If graph algorithms like Dijkstra's and shortest-path proofs fascinate you, this is the definitive reference covering the theory behind them in depth. It's the classic textbook that computer scientists and engineers turn to for rigorous algorithm analysis, including priority queues and graph traversal techniques discussed in this article.
See Introduction to Algorithms (CLRS textbook) on Amazon → Affiliate link — we may earn a commission on purchases, at no extra cost to you. Product picked by AI based on this article; it is not a tested recommendation.Source: vals.ai, 2026-09-22
Published there as: “A Faster Shortest Path Algorithm”
Read the original report → The summary and analysis above are GoKawiil's own, written from reporting by the source above. Facts and quotes belong to the original publisher.