OpenAI claims a disproof of the Exponential Time Hypothesis
OpenAI says its AI system found a disproof of the Exponential Time Hypothesis (ETH), a widely used assumption in theoretical computer science. Computer scientist Russell Impagliazzo called the claim “very shocking news.”

Key takeaways · 4
- 01
OpenAI says its system proved ETH false and released the writeup and Lean proof publicly.
- 02
The paper describes a deterministic, subexponential-time algorithm that uses polynomial space to count satisfying assignments of a k-CNF.
- 03
The result is not a solution to the broader P-versus-NP problem, and researchers say it has no immediate practical applications.
- 04
If the claims hold up, researchers may need to revisit work that relies on ETH or a stronger version.
What OpenAI says it found
OpenAI announced three discoveries spanning mathematics, computer science and physics, including its claim that an AI system disproved ETH.[1] The company says the system found the natural-language disproof on Oct. 16, 2026, and that the result was formalized in Lean the following day.[1] OpenAI says the result was subsequently verified in Lean and that it released both the AI-generated writeup and a Lean proof in a public GitHub repository.[1]
The algorithm and its reach
The paper describes a deterministic algorithm that counts satisfying assignments of a k-CNF in subexponential time and polynomial space.[3] ETH has been widely believed and used in hundreds of papers to derive conditional computational-hardness results.[1] OpenAI says the refutation reopens questions about how much faster these tasks could become and may help guide the search for better algorithms.[1] The claim does not solve the broader P-versus-NP problem.[4] That distinction matters: the reported result challenges a central assumption used for conditional results, rather than resolving a broader question about the limits of computation.
Potential applications remain theoretical
The article describes possible future uses—including computers cracking encryption and designing medicines by optimizing proteins—as theoretical scenarios.[2] Impagliazzo said a fast algorithm for solving Sudoku could be used to design optimal circuits.[2] Ryan Williams said the result has no immediate practical applications, and the article notes that realizing the potential of a theoretical result can take years or decades of engineering.[2] A separate report says improved algorithms could affect cryptographic systems that rely on certain key sizes.[5] These possibilities should not be read as evidence that current encryption has been broken or that the algorithm is ready for practical use.
Verification and research follow-through
OpenAI says a group led by Russell Impagliazzo, Ramamohan Paturi and Ryan Williams will verify and shepherd the work, and that it agreed to fund a conference on the result’s implications.[1] Science reported that neither OpenAI’s nor Anthropic’s proof had yet been fully confirmed by a human.[4] Anthropic announced an ETH refutation shortly after OpenAI’s announcement.[2] Science also reported that Anthropic counted more than 800 papers relying on ETH or a stronger version; Williams said researchers would need to revisit such work if the AI labs’ claims hold up.[4][5] The evidence also calls for making all raw results data public to facilitate independent verification.[1]
For professionals who rely on computational-hardness assumptions, the key issue is not an immediate change in encryption or engineering practice, but whether the proofs withstand scrutiny. If they do, research built on ETH may need to be revisited; the reported algorithm’s practical consequences remain uncertain.
Why it matters
Bring this to your team — one session a day, built for your industry.
kju.ai is built for teams: daily sessions, team analytics, and rollout support for your organization.
For teamsHow this developed
8 November 2026
OpenAI claims a disproof of the Exponential Time Hypothesis
Sources
- Working with academic communities to build scientific understanding | OpenAIopenai.com
- How A.I. Just Blew Up a Key Tenet of Computer Science – DNYUZdnyuz.com
- THE EXPONENTIAL TIME HYPOTHESIS IS FALSEraw.githubusercontent.com
- AI cracks a 27-year-old pillar of computer science, OpenAI and Anthropic claim | Science | AAASscience.org
- Frontier AI labs say their models refuted the Exponential Time Hypothesis. What does that mean? | TechCrunchtechcrunch.com