Vals AI publishes an AI-devised shortest-path algorithm with a narrow proved advantage
Researcher Geby Jaff directed ten Claude agents to produce C-HD and a Lean proof; its runtime claim applies to a limited range of graphs.
By RuntimeWire Staff · Published
Primary source: Vals AI
Why it matters
Vals has published a checkable artifact from an AI research task rather than only reporting an agent score. The Lean proof supports a narrow asymptotic claim; practical speed and novelty still require separate scrutiny.
Rayan Krishnan (@RayanKrishnan) and Langston Nashold (@langstonnashold) built Vals AI to measure what AI systems can do. On September 20th, Vals published a different kind of test: researcher Geby Jaff said ten Claude Opus 5.5 agents had devised a shortest-path algorithm and produced a Lean proof of its correctness and runtime bound in about 15 hours.…