Geby Jaff

Vals publishes a buildable Lean proof for the shortest-path algorithm its ten agents wrote

Ten Claude Opus 5.5 agents produced the algorithm and a machine-checked proof of its runtime bound in about 15 hours. The theorem covers sparse directed graphs, and the margin over Dijkstra grows as the twelfth root of log n.