Claude Mythos solves the Erdős Discrepancy Problem
Anthropic’s Claude Mythos model has solved the Erdős Discrepancy Problem, an open question in combinatorial geometry since 1946. This comes after OpenAI claimed a solution.
Engineer Sholto Douglas said Mythos found a simple, elegant proof using a system of isolated Claude Code agents. They autonomously developed solution paths, shared results, and peer-reviewed each other’s findings.
Mathematician Daniel Litt described Mythos’ proof as slightly less rigorous than OpenAI’s, but still valid. Anthropic has published the proof generated with Opus 4.7.
Up next
Claude creates the safest society in AI simulation
In Emergence AI’s simulation, Claude created a crime-free society. In contrast, the Grok-managed world went extinct within four days due to internal conflicts. This experiment highlights the difference in base safety settings between models, which will become critical as they gain autonomy.
Related stories
- Claude memory: say what it’s for, let dreaming fix notes
- Tübingen researchers want AI to propose many models
- Claude Fable 5 tripled Opus 4.6’s EVE Online trading gains
- Scientists use Claude least where they say it matters most
- METR clocks Anthropic benchmark gains at 1.9x old pace
- Claude mapped the first prokaryotic vault structure
Comments
No comments yet. Be the first.
Join the conversation
Sign in to leave a comment. It appears after moderation.