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
- Jeffrey Emanuel builds a Claude Code Skill to port Rust projects to Bend 2 — doodlestein · 2026-09-23
- Dev builds playable Game Boy Color with Claude Opus 5.5 that runs Super Mario — chrisfirst · 2026-09-23
- Open-source Unreal Agent claims 39% cheaper than Codex+Astra on Terminal-Bench 4.0 — Hesamation · 2026-09-23
- Skip the Claude Code client: use its tokens or Agent SDK to own the environment — repligate · 2026-09-23
- No Image Model Needed: Claude Writes Per-Pixel Python Code to Paint — repligate · 2026-09-23
- Sergey Karayev: stop being a 'meat proxy' between your AI agents — sergeykarayev · 2026-09-23