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.
Related stories
- Claude does nine loops, one past the N=4 physics record
- WHO Africa and CEPI turn to Claude in an Ebola outbreak
- Claude found a CRISPR-like puzzle hidden in phage DNA
- Anthropic's 225 bug finds, one attack in the wild
- Claude Fable knocked 20 bits off most popular hashes
- Anthropic's new wet lab puts Claude in charge of robots
Comments
No comments yet. Be the first.
Join the conversation
Sign in with Google to leave a comment. Your name and avatar come from your Google profile, and the comment appears after moderation.
