AI Radar
Support
LiveUpdated 2026-11-06 16:05 UTC

A Faster Shortest Path Algorithm

A Faster Shortest Path Algorithm — How Claude Opus 5.5 agents developed C-HD, a shortest-path algorithm with a Lean proof.…

A Faster Shortest Path Algorithm is How Claude Opus 5.5 agents developed C-HD, a shortest-path algorithm with a Lean proof. Explore the result, assumptions and verification.. It is ranked #8053 on the AI Radar, in Frontier models, first seen 36 days ago and shared in 12 posts (133k views).

Visit vals.ai

A Faster Shortest Path Algorithm | Vals AI Research A Faster Shortest Path Algorithm We asked ten Claude Opus 5.5 agents to find 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. Geby Jaff • 09/20/2026 Problem Shortest paths is a very simple problem. There is a graph of vertices and (possibly directed) edges that connect them. Each edge has a real number weight. Starting from some vertex, for every other vertex in the graph you want to find the minimum total weight of a path, or report that it is unreachable. In the version I considered, the…

Alternatives to A Faster Shortest Path Algorithm

A Faster Shortest Path Algorithm in numbers

FAQ

What is A Faster Shortest Path Algorithm?

How Claude Opus 5.5 agents developed C-HD, a shortest-path algorithm with a Lean proof. Explore the result, assumptions and verification. It was first shared on X 36 days ago and is ranked #8053 on the AI Radar.

Is A Faster Shortest Path Algorithm free?

Pricing is not stated on the page we read.

Who shared A Faster Shortest Path Algorithm?

10 accounts on X, including @miladvadood, in 12 posts totalling 133k views.

Every post is read and classified by AGK Intelligence: what it is, which market it belongs to, and whether the link is a real tool. 65.6k posts from 5k X accounts over the last 14 days, 10.4k tools, 19 markets. New posts are collected several times an hour and the full ranking is recomputed every hour — last update 2026-11-06 16:05 UTC. Full method.