🔍 Read the full analysis: What OpenAI’s AI Announcement Actually Establishes About The ETH on ThorstenMeyerAI.com
Get business pricing on tech for your team
- Business-only prices and quantity discounts
- Tax-exempt purchasing
- Multiple users, one account, clear invoices
TL;DR
OpenAI says an unreleased AI model produced a proof that would refute the Exponential Time Hypothesis, a longstanding assumption about the difficulty of solving certain logic problems. A Lean formalization checks a slightly weaker runtime bound than the preprint’s sharpest claim, and independent expert review has not yet been completed. The result does not resolve P vs. NP or show that practical computing will become faster.
OpenAI said on October 26 that an unreleased internal AI model had produced a proof refuting the Exponential Time Hypothesis (ETH), a major assumption in theoretical computer science about how quickly certain logic problems can be solved. The company released a preprint and a Lean formalization, but independent expert review is still pending, and the formalization checks a weaker runtime bound than the paper’s sharpest claim.
The result concerns k-SAT, a family of problems asking whether truth values can be assigned to variables so that every logical rule is satisfied. The preprint claims a deterministic algorithm can exactly count solutions for any fixed clause size in subexponential time and polynomial memory. For 3-SAT, that would contradict ETH, which says the problem requires exponential time in the number of variables. The authors also say the result refutes the stronger Strong Exponential Time Hypothesis and three related hypotheses.
OpenAI says its model found the disproof on October 16, and that the Lean formalization followed the next day. The preprint is dated October 17 and was revised October 25. Lean is software for checking mathematical proofs against formal rules. The source report counted 3,977 files and about 710,000 lines in the released formalization; the formal statement itself is much shorter. The formal check supports a slightly weaker bound than the preprint’s strongest runtime result.
The proof has not yet been independently endorsed by specialists. According to OpenAI’s announcement, an external group led by Russell Impagliazzo, Ramamohan Paturi and Ryan Williams will examine the computer-science work. Impagliazzo and Paturi were among the original authors of ETH. OpenAI says the group requested public release of the preprint and code, and that it will fund a conference on the result.
THREE RESULTS, THREE RELEASE STRATEGIES
What OpenAI released, what Lean checked, who reviews it
Dates and the physics status are OpenAI's own account. Lean-checked means a machine verified the proof, not that experts have accepted it.
Local smoothing, so Kakeya too
- AI output
- 18 Oct 2026
- Lean
- 19 Oct 2026 · strict ranges
- Public
- AI write-up + Lean proof
- Review
- No group: researchers organize themselves
The Exponential Time Hypothesis is false
- AI output
- 16 Oct 2026
- Lean
- 17 Oct 2026 · weaker bound
- Public
- 67-page preprint + Lean proof
- Review
- Impagliazzo, Paturi (UC San Diego), Williams (MIT)
QCD exists; pure Yang–Mills as sub-result
- AI output
- 9 Sep (Yang–Mills), 18 Sep (QCD)
- Lean
- Yang–Mills existence, 16 Oct (OpenAI)
- Public
- No: the group holds the AI materials back
- Review
- Gross, Douglas, Jaffe, Klebanov, Nekrasov
Before this release
The repository the results sit in
- 6 Oct: more than 700 AI-generated manuscripts published
- 7 Oct: 3 withdrawals after a sign error; 14 other manuscripts revised
- About 42% of top-line results formalized in Lean (repository’s own figure)
- OpenAI calls the manuscripts “raw research data”, not polished papers
Sources: OpenAI, 26 Oct 2026 · Lean note 378 · Lean note 079 · repository history. Status chips: our assessment.
Powered by Thorsten Meyer AI
What an ETH Refutation Would Change
If the central claim survives review, it would overturn a widely used assumption about the limits of algorithms for satisfiability problems. Researchers have relied on ETH to establish that many computational tasks cannot be solved substantially faster than exponential time. A valid refutation could require those conditional hardness results to be revisited, though it would not automatically invalidate every result that uses ETH: implications depend on each paper’s proof and assumptions.
The claimed runtime is described in the source report as roughly 2^(n / √log n). That is subexponential, but still grows far faster than any polynomial-time bound. OpenAI itself says practical improvements would require significant further research. The announcement does not show that everyday software, commercial optimization, or current computers will suddenly solve hard instances quickly.
The development also puts attention on a research process in which an AI system proposes a result and proof-checking software verifies a formalized version. A machine check can catch errors within the encoded statement and formal system; it does not by itself establish that the formalization captures every claim in the paper or that the result’s consequences are correctly described. Human scrutiny remains central, especially because the sharpest bound is not covered by the formalization.
Products Worth Considering
Amazon Kindle Paperwhite Signature Edition (12th Generation, 2024), 32 GB, Metallic Black
Apple iPad Air (2025) 13‑inch Wi‑Fi 256 GB – Space Gray (M3 chip)
Logitech MX Mechanical Wireless Illuminated Keyboard, Tactile Quiet, Graphite
As an affiliate, we earn on qualifying purchases.
The Hypothesis Behind the Claim
ETH was formulated in work by Impagliazzo, Paturi and Francis Zane in 2001. It holds that 3-SAT cannot be solved in time 2^(c·n) for any fixed positive constant c, where n is the number of variables. Researchers have improved on trying every possible assignment by reducing the exponential base, but ETH says the exponential character cannot be eliminated.
ETH is stronger than the famous P vs. NP question. P vs. NP asks whether every problem whose proposed solution can be checked efficiently can also be solved efficiently; it remains open. Refuting ETH would reject a particular stronger assumption about 3-SAT, not prove that P equals NP. The source report notes that computer scientist Scott Aaronson described ETH as an ambitious strengthening of P ≠ NP, while also writing that there was no consensus in the field that ETH is true.
This announcement is part of a wider OpenAI research release. The company said it had three results: the ETH work, a mathematical proof concerning local smoothing, and a physics result concerning quantum chromodynamics and a proposed completion of the Standard Model. The source report also says OpenAI published more than 700 AI-generated manuscripts on October 6; repository records later showed three withdrawn over a sign error and revisions to 14 others. That history is relevant to why formal checking and outside review matter, but does not determine whether this proof is correct.
What Review Has Yet to Establish
The main unresolved issue is whether the proof is correct and whether its formalized version fully supports the preprint’s headline claim. The source material says the Lean check covers a weaker runtime bound than the paper’s sharpest result, so the two should not be treated as identical. Independent reviewers have not yet signed off.
It is also not clear from the available account when the external group will finish its examination, what review procedures it will use, or whether its conclusions will be published alongside revisions. OpenAI’s description of the process, including the model’s discovery dates and the collaborators’ arrangements, is the company’s account. The practical consequences of the claimed algorithm are also uncertain; no immediate application or performance improvement is established.
Independent Review and Formal Checks
The external group led by Impagliazzo, Paturi and Williams is expected to examine the computer-science result. The public preprint and Lean code give researchers material to inspect, while the planned conference could provide a forum for discussion. Key milestones will be whether reviewers validate the proof, whether the formalization is expanded to cover the paper’s strongest runtime bound, and whether the preprint changes in response to scrutiny.
Until those checks are complete, the careful description is that OpenAI has announced a claimed refutation of ETH, supported by a machine-checked formalization of a weaker bound. It is not yet an independently reviewed resolution of the hypothesis, and it leaves P vs. NP open.
Key Questions
Has OpenAI proved that P equals NP?
No. The announced result concerns ETH, a stronger assumption about the running time of 3-SAT algorithms. P vs. NP remains open.
What does the claimed ETH refutation say?
The preprint claims a deterministic algorithm can exactly count solutions to fixed-k SAT formulas in subexponential time, which would contradict ETH for 3-SAT if the proof is valid.
Has the proof been independently verified?
Not yet, according to the source material. Lean has checked a formalization with a slightly weaker runtime bound, while an outside group is expected to examine the broader result.
Will the result make computers faster now?
No immediate practical improvement is established. The claimed algorithm is still slower than any polynomial-time algorithm, and OpenAI says practical gains would require further research.
Why does the Lean formalization matter?
Lean checks a proof encoded in a formal system, helping identify errors in that formalized argument. It does not replace expert review of whether the formalization matches the paper’s full claim or how the result should be interpreted.
Source: ThorstenMeyerAI.com
