10 Claude Opus 5.5 agents find faster shortest-path algorithm, prove it in Lean in 15 hours
ctjlewis · x · 2026-09-23
ValsAI tasked ten Claude Opus 5.5 agents with devising a faster shortest-path algorithm and proving it in Lean. Within 15 hours they produced C-HD: a formally verified improvement over the published bounds — a striking demonstration of agents autonomously combining algorithm discovery with machine-checked mathematical proof.
More from coding & agent
- User automates entire video clipping workflow with Nous Research's Hermes agent — Teknium · 2026-11-12
- As models improve, writing good evals gets harder and more important — amankhan · 2026-11-12
- Autonomous agent edits just 1,024 weights to lift Qwen3.5 0.8B from 7.4% to 37.4% on MATH-500 — VictorSanh · 2026-11-12
- Free AI game jam in SF Nov 14–15 with teams from Anthropic, Google, Meshy, OpenAI — chrisfirst · 2026-11-12
- Omarchy 4.6 lets you share local AI models across your tailnet, says DHH — alexcovo_eth · 2026-11-12
- Coding harnesses hand shell access to inference providers — 4-step gateway mitigation — shensi · 2026-11-12