Hacker News
Vals AI says ten Opus 5.5 agents found a Lean-verified shortest-path algorithm that beats Dijkstra's bound in 15 hours
In a September 20 post, Vals AI says ten Claude Opus 5.5 agents exchanged 733 messages over 15 hours and produced C-HD, a formally verified algorithm. On graphs where m ≈ n·log^(3/4) n it runs in O(n·log^(11/12) n) against Dijkstra's O(n log n). The post itself says the gain is only about 1.78x at n = 2^1000 and is 'not a measured speedup'. The top HN replies call it a theoretical bound improvement with no practical speedup. One commenter notes the post predates Opus 5.5's public release. Single source: treat it as a demo of multi-agent Lean proving, not a usable algorithm.
↳ Follow the thread