OpenAI says AI system refuted the Exponential Time Hypothesis
OpenAI says its AI system produced a result refuting the Exponential Time Hypothesis (ETH), a longstanding conjecture in computational complexity. The claim could affect research that uses ETH to establish conditional limits on computation, but it does not make every such paper invalid.

Key takeaways · 4
- 01
OpenAI says its AI system produced a result refuting ETH, a conjecture about computational complexity.
- 02
The company says the natural-language disproof was found on October 16, 2026, and formalized in Lean the following day.
- 03
OpenAI released the natural-language write-up and Lean proof in a public GitHub repository.
- 04
The result does not by itself invalidate every ETH-dependent paper or prove P equals NP.
What OpenAI announced
OpenAI says its AI system produced a result refuting ETH, which concerns the computational complexity of Boolean formula satisfiability, a problem related to P versus NP.[1] The company says the system found a natural-language disproof on October 16, 2026, then formalized it in Lean the next day.[1] OpenAI says the result was verified in Lean and that it released both the natural-language write-up and Lean proof in a public GitHub repository.[1] The company’s preprint is dated October 25, 2026.[2] The central claim is a theoretical result; OpenAI says substantial further work is needed to find algorithms and turn theoretical advances into practical improvements.[1]
Why researchers are paying attention
ETH has been used in hundreds of papers to derive conditional computational hardness results.[1] OpenAI says the conjecture is relevant across graph theory, computational biology, databases and computational geometry.[1] That makes the result a reason for researchers to check which conclusions in their work depend on ETH, rather than assume that all such results have failed.[1][3] The distinction matters: a refutation of ETH does not by itself prove P equals NP, and the reported finding does not directly break existing cryptography.[3][5] The practical consequences will depend on further examination and research.[1]
Review is still part of the story
OpenAI says the result will be examined by a group led by Russell Impagliazzo and Ramamohan Paturi of UC San Diego and Ryan Williams of MIT.[1] The company says the group asked for the underlying research materials to be made public and for OpenAI to fund a conference on the result’s implications.[1] OpenAI also says participants in its external collaborations are unpaid, act independently and retain ownership of their conclusions.[1] Separately, WIRED reported that researchers had not independently verified or fully understood the AI-generated proofs at the time of its report.[4] That distinction is important: Lean verification is reported, but independent review and understanding remain part of assessing what the result means.[1][4]
For researchers and technical teams, the immediate task is to identify conclusions that rely on ETH and assess them as the result is examined. The headline should not be read as saying that all ETH-dependent work is invalid: the evidence says the result does not invalidate every paper, while its broader implications remain under review.
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
31 October 2026
OpenAI says AI system refuted the Exponential Time Hypothesis
Sources
- Working with academic communities to build scientific understanding | OpenAIopenai.com
- math/preprints/The-Exponential-Time-Hypothesis-is-False-October-25-2026/README.md at main · openai/math · GitHubgithub.com
- 'Half of My Paper Does Not Work': AI Just Hit Computer Science...ibtimes.sg
- An AI Breakthrough Has Made Decades of Computer Science Research ‘Irrelevant’ | WIREDwired.com
- Computer scientists warn AI made decades of research irrelevant - GEEKSPINgeekspin.co