We asked ten Claude Opus 5.5 agents to devise 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.
Readers added context
C-HD's formally verified bound improves priors only in a narrow sparse density range (m ≤ n⌊⌊log₂ n⌋^{3/4}⌋) as an asymptotic guarantee with enormous constants and no practical speedup demonstrated. vals.ai/blogs/faster-s…github.com/spicylemonade/…