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 learned proteins, not just papers about them
- Anthropic bought a biotech with one full-time employee
- A perfect refusal score isn’t a safer model, Anthropic says
- Anthropic touts 94.2% true positives; curl rejected 19 of 34
- Anthropic’s IPO filing says a key safety threshold is met
- 1,000 Claude agents redid the Fermat proof in 28.7 hours
Comments
No comments yet. Be the first.
Join the conversation
Sign in to leave a comment. It appears after moderation.

