Claude Mythos reportedly solves OpenAI's landmark Erdős problem with a "cute, simple proof"
Quick Answer
Anthropic's Claude Mythos has reportedly solved the 1946 Erdős unit-distance conjecture with a 'cute, simple proof' shortly after OpenAI's disproof.
Quick Take
Anthropic's Claude Mythos has reportedly solved the 1946 Erdős unit-distance conjecture with a 'cute, simple proof' shortly after OpenAI's disproof. This achievement highlights the potential of AI in mathematical discoveries, as noted by engineer Sholto Douglas.
Key Points
- Claude Mythos solved the Erdős unit-distance conjecture after OpenAI's recent disproof.
- The solution was described as a 'cute, simple proof' by engineer Sholto Douglas.
- This development indicates a significant 'serious overhang' in AI-driven mathematical discoveries.
- The conjecture was originally proposed in 1946, showcasing AI's evolving capabilities.
Article Excerpt
From source RSS / original summaryShortly after OpenAI disproved Erdős' unit-distance conjecture, Anthropic shows Claude Mythos can solve the problem too - "over the weekend. " Engineer Sholto Douglas says Mythos cracked the 1946 conjecture with a "cute, simple proof," a sign of "serious overhang" in AI-driven math discoveries. The article Claude Mythos reportedly solves OpenAI's landmark Erdős problem with a "cute, simple proof" appeared first on The Decoder.
Want this in your inbox every morning?
Daily brief at your local 8am — bilingual EN/中文, free.
More from The Decoder
See more →
An AI model programmed nonstop for 19 days on a single MirrorCode task that cost $2,600 to run
Epoch AI's MirrorCode benchmark reveals Claude Opus 4.7 as the leader with a 56% solve rate, reconstructing a 16,000-line toolkit in 14 hours. Despite this, all models tested struggle with the most complex tasks, highlighting limitations in current AI capabilities. The single task consumed $2,600 over 19 days, raising questions about cost-effectiveness in AI development.
