On October 16, 2026, two AI models — one at OpenAI, one at Anthropic — independently found the same impossible result. Ten days later, both labs published it. The claim: a deterministic algorithm that counts the solutions to 3-SAT in subexponential time, refuting the Exponential Time Hypothesis (ETH), a conjecture that has anchored fine-grained complexity theory for a quarter century. One paper is credited to an author named "Claude." The other was formalized in the Lean proof checker the day after it was found. And, by Anthropic's own appendix, no person is known to have checked the full proof.
This post explains what was claimed, how the two algorithms work, why the result changes theory but nothing practical — and why the most interesting part is not the theorem, but the provenance line.
The ELI5 version
Imagine a puzzle: 100 light switches, and a list of rules like "switch 3 ON, or switch 7 OFF, or switch 12 ON." Find a setting that satisfies every rule.…