10 Claude agents spend 15 hours devising and Lean-proving a faster shortest-path algorithm, C-HD
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 published bounds, with an intricate big-O expression. The sharer quips: "you're not ready for the big-O notation on this one."
More from Models
- OpenAI Boosts GPT-6 Prompt Caching, Input Tokens Now Up to 90% Cheaper — OpenAIDevs · 2026-09-23
- Rumor that Opus 5.5 was distilled from a larger teacher model sparks debate — BLUECOW009 · 2026-09-23
- Anthropic's Claude Opus 5.5 system card adopts external evaluation-awareness framework — maksym_andr · 2026-09-23
- GPT-6 Terra Spotted Listed in Hermes — Official Integration or Placeholder? — eugenetel · 2026-09-23
- Claude's Reset Button Now Live on Web and Desktop, Mobile Still Pending — edwinarbus · 2026-09-23
- World #2 Chess GM Hikaru Praises Muse for Voluntarily Flagging Its Own Errors — alexandr_wang · 2026-09-23