🔍 Read the full analysis: A Guide To OpenAI’s AI Claim About The Exponential Time Hypothesis on ThorstenMeyerAI.com
Get the latest gadgets delivered free with Prime
- Fast, free delivery on millions of items
- Prime Video, Amazon Music and more included
- Member-only deals all year
TL;DR
OpenAI says an unreleased internal AI model produced a proof that refutes the Exponential Time Hypothesis, a long-standing assumption about the difficulty of solving 3-SAT. Lean checked a formalized version with a weaker runtime bound than the preprint’s sharpest claim; independent experts have not yet completed their review. The result does not resolve P vs. NP or show that practical computing will become faster soon.
The result concerns k-SAT, a family of problems that asks whether truth values can be assigned to variables so that every rule in a formula is satisfied. OpenAI’s preprint claims a deterministic algorithm that exactly counts solutions for any fixed clause size in subexponential time and polynomial memory. For 3-SAT, that would contradict ETH, which says no algorithm can solve the problem in subexponential time.
OpenAI says its system 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. The source report counted 3,977 files and about 710,000 lines in the public Lean code; the formal statement itself is much shorter. Lean is software that checks whether a formal proof follows from its specified definitions and rules.
There is a material qualification: the formalization checks a slightly weaker bound than the strongest runtime bound stated in the preprint. The source report says the sharpest bound has not been covered by the Lean proof. The preprint also claims to refute the Strong Exponential Time Hypothesis and three related hypotheses, but those claims, like the broader result, remain subject to outside examination.
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 the ETH Claim Would Change
If experts validate the result, it would overturn a widely used assumption in theoretical computer science about the limits of algorithms for hard problems. ETH has served as a basis for proving that many computational tasks cannot be solved substantially faster than existing approaches, so its refutation could prompt researchers to revisit results that rely on it.
The immediate significance is also methodological. OpenAI is presenting an AI-generated mathematical result alongside a machine-checked formalization, while an outside group examines the work. That process could offer a model for testing future AI research claims—but only if independent researchers can verify both the mathematics and the formal proof’s scope.
The claimed speed-up is not a practical shortcut for ordinary computing. The reported algorithm runs in roughly 2 to the power of n divided by the square root of log n, which remains far slower than any polynomial-time algorithm. OpenAI has said practical improvements would require significant further research. Nothing in the announcement means computers will suddenly solve everyday hard problems faster.
Products Worth Considering
Sonos Era 100 SL Compact Microphone-Free Speaker, Black
Samsung 27-Inch Odyssey QD-OLED G8 4K 240Hz Gaming Monitor
Logitech MX Mechanical Wireless Illuminated Keyboard, Tactile Quiet, Graphite
As an affiliate, we earn on qualifying purchases.
From SAT Algorithms to ETH
In k-SAT, each rule contains at most k variables or their negations, and the task is to find an assignment that satisfies every rule. With n variables, trying all possible assignments takes 2ⁿ combinations. Researchers have developed faster methods, but these still take exponential time. ETH, proposed by Russell Impagliazzo, Ramamohan Paturi and Francis Zane in 2001, asserts that 3-SAT cannot be solved in subexponential time.
ETH is stronger than the familiar P vs. NP question, which asks whether every problem whose answer can be checked efficiently can also be solved efficiently. A refutation of ETH would not settle P vs. NP: the claimed algorithm is still superpolynomial, and the Clay Mathematics Institute continues to list P vs. NP as unsolved. The source material also notes that views on ETH have not been unanimous; computer scientist Scott Aaronson wrote in a 2017 survey that there was no field-wide consensus that it is true.
The announcement is part of a wider OpenAI research release. The company said on October 26 that it was releasing three AI-associated results, in mathematics, computer science and physics, with different outside groups guiding their handling. The source report notes that an earlier release of more than 700 manuscripts led to corrections: repository records showed three papers withdrawn over a sign error and 14 revised. That history makes the distinction between a paper’s claim and its checked proof particularly relevant.
What the Formal Proof Covers
The central open question is whether independent experts will validate the argument. OpenAI said an external group led by Russell Impagliazzo, Ramamohan Paturi and Ryan Williams would examine the computer-science result. Impagliazzo and Paturi were among ETH’s original authors. The source material does not report a completed review or an expert verdict.
The scope of the Lean check also needs careful attention. It verifies the formalized statement, but the source report says that statement has a weaker runtime bound than the preprint’s sharpest one. It is not clear from the available material whether the stronger bound can be formalized, whether reviewers will find errors or gaps, or how the claimed consequences for SETH and related hypotheses will fare under review.
OpenAI’s account of how the result was produced and released is the company’s own description. The available source does not provide a complete independent reconstruction of the model’s work, nor does it establish practical applications. The article’s reported code-file and line counts are an independent count by the source author, not a formal measure of proof correctness.
Independent Review and Formalization
The next major milestone is the outside group’s examination of the preprint and Lean materials. That review should clarify whether the proof is mathematically sound, whether the formalization captures the result as stated, and what conclusions can be drawn from the gap between the checked bound and the paper’s strongest bound.
Researchers will also need time to assess which results based on ETH, SETH or related assumptions require reconsideration. Any such changes depend on the proof surviving scrutiny; the announcement alone does not establish that existing complexity results or practical algorithms have changed. OpenAI has also agreed to fund a conference on the result, according to the source material, but no date or program is provided.
Key Questions
What is the Exponential Time Hypothesis?
ETH says that 3-SAT cannot be solved in subexponential time: broadly, it holds that the problem requires time exponential in the number of variables, up to a fixed positive constant in the exponent.
What exactly does OpenAI claim its AI proved?
OpenAI’s preprint claims a deterministic, subexponential-time algorithm for exactly counting solutions to k-SAT when k is fixed. For 3-SAT, that would refute ETH. The result has not yet received independent expert approval.
Has Lean verified the full claim?
Not according to the source report. Lean checked a formalized result with a weaker runtime bound than the sharpest bound in the preprint. The strongest stated bound is not covered by the formalization described there.
Does this solve P vs. NP?
No. Refuting ETH would not resolve P vs. NP. The claimed algorithm remains slower than polynomial time, and P vs. NP remains an open problem.
Will this make computers faster soon?
There is no evidence of an immediate practical speed-up. The algorithm described remains superpolynomial, and OpenAI said practical improvements would require significant further research.
Source: ThorstenMeyerAI.com
