A Faster Shortest Path Algorithm

Ten Claude Opus 5.5 agents collaboratively developed C-HD, a new shortest-path algorithm that achieves improved time complexity bounds and was formally verified using the Lean proof tool. The algorithm outperforms Dijkstra's classical approach in certain parameter ranges by efficiently handling local search through bounded exploration and careful edge management, with certified performance up to a specific graph size threshold.