A Faster Shortest Path Algorithm
Summary
The post describes a collaborative attempt using Claude Opus 5.5 agents to develop a faster exact shortest-path algorithm called C-HD, with a formally verified bound proven in Lean. It presents the theoretical runtime bound for graphs within a certified range and provides Lean code excerpts and a proof outline. The piece also discusses the potential practical implications, verification methodology, and where to find the full proof package on GitHub.