🔍 Read the full analysis: The Exponential Time Hypothesis After OpenAI’s AI Announcement on ThorstenMeyerAI.com
Get hardware and tech essentials 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 internal AI model produced a proof that refutes the Exponential Time Hypothesis, a long-standing conjecture about the time needed to solve certain SAT problems. The proof has been checked with Lean, but independent review is pending, and the result does not resolve P versus NP or promise near-term practical speedups.
OpenAI said on October 26 that an unreleased internal AI model had produced a proof refuting the Exponential Time Hypothesis (ETH), a central conjecture about the difficulty of solving certain Boolean logic problems. The company released a preprint and a Lean formalization, but the result has not yet been independently reviewed; the formalized statement also covers a weaker runtime bound than the sharpest claim in the paper.
The preprint claims a deterministic algorithm can exactly count solutions to any k-SAT formula, for fixed k, in subexponential time and polynomial memory. For 3-SAT, that would contradict ETH, which says solving the problem requires time that remains exponential 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 system found the disproof on October 16, with the Lean formalization following on October 17. The preprint is dated October 17 and was revised October 25. The source report describes the public formalization as roughly 3,977 files and 710,000 lines. Lean checks the logic of a formal statement, but the source says that statement establishes a weaker runtime bound than the paper’s sharpest result.
An external group led by Russell Impagliazzo, Ramamohan Paturi and Ryan Williams is to examine the computer-science work. Impagliazzo and Paturi helped formulate ETH. OpenAI says it asked outside researchers to guide how its three announced research results should be released; the computer-science preprint and code are public, while the physics materials are being held back at the request of their stewards.
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 paper’s central claim survives review, it would overturn a widely used assumption about the limits of exact algorithms. Researchers use ETH and related hypotheses to show that many computational problems are unlikely to have substantially faster solutions. A valid refutation would require those results to be reconsidered where they depend on ETH, changing the theoretical map of what may be computable efficiently.
The announcement also tests a possible research process: an AI system generates a mathematical result, a proof assistant checks a formal statement, and human specialists assess whether the result is sound and meaningful. Formal verification is not the same as independent expert review. The distinction matters because the published paper’s strongest runtime claim is not fully represented by the formalized bound described in the source.
OpenAI cautions that practical improvements would require significant further research. The claimed algorithm remains slower than any polynomial-time algorithm, and the source’s arithmetic suggests its advantage over exponential-time approaches grows very slowly with problem size. The announcement is a theoretical development, not evidence that ordinary software or commercial systems will become faster now.
Products Worth Considering
Trezor Safe 5 Crypto Hardware Wallet with Color Touchscreen, Black Graphite
LG UltraGear 45GX900A-B 45-Inch Curved OLED Gaming Monitor
Ledger Stax Crypto Wallet with Touchscreen
As an affiliate, we earn on qualifying purchases.
The Hypothesis Behind the Claim
In k-SAT, each rule specifies a condition involving at most k variables, and the task is to determine whether assignments of true or false can satisfy all the rules. With n variables, a direct search could examine 2ⁿ assignments. Researchers have developed faster algorithms, but ETH says the exponential dependence cannot be eliminated for 3-SAT: its running time must remain at least 2 raised to a positive constant times n.
Russell Impagliazzo, Ramamohan Paturi and Francis Zane introduced ETH in 2001. It is stronger than the question of whether P equals NP. P versus NP remains an open problem, and refuting ETH would not settle it. The source notes that existing SAT algorithms have reduced the base of the exponential over time, without removing the exponential form.
This announcement follows a broader OpenAI release of AI-produced research materials on October 6. According to the source report, the repository later withdrew three manuscripts after a sign error and revised fourteen others. That history makes the distinction between an AI-generated result, a machine-checked proof and expert scrutiny directly relevant to assessing this new claim.
Review and Runtime Claims Pending
The proof has not yet received independent expert sign-off. The external group is expected to examine it, but the source does not report a completed review, a verdict or a publication in a peer-reviewed venue. A Lean check establishes that the encoded formal proof follows the rules of the system; it does not by itself confirm that the formalization captures every claim in the paper.
In particular, the reported Lean statement is weaker than the paper’s sharpest runtime bound. The source does not provide enough detail to reconcile the gap or establish whether the strongest claimed result can be formalized in the same way. Until specialists complete their examination, the broad claim that ETH has been refuted remains an OpenAI-reported result awaiting scrutiny.
The source also notes disagreement over how widely ETH is believed. Its role in many hardness results does not mean every researcher accepts it as true. No practical performance gains, implementation details or timetable for applications are established by the announcement.
Independent Examination Comes Next
The next milestone is the external group’s examination of the preprint and Lean code. Its members include researchers connected to ETH’s original formulation, but no review schedule or findings are given in the source. Readers should distinguish any later expert assessment of the paper from the machine check already reported.
OpenAI says it has agreed to fund a conference on the result. Further work would need to clarify the relationship between the paper’s strongest runtime bound and the weaker formalized statement, and to determine whether the proposed algorithm can inform practical methods. For now, the claim is public, the formalization is available, and independent verification remains outstanding.
Key Questions
What is the Exponential Time Hypothesis?
ETH is the conjecture that solving 3-SAT requires time exponential in the number of variables. It is used in theoretical computer science to support lower-bound claims about the difficulty of many problems.
Does the announcement solve P versus NP?
No. Refuting ETH would overturn a stronger hypothesis about computational difficulty, but P versus NP remains open.
Has the proof been independently verified?
Not yet, according to the source. OpenAI released a Lean formalization, and an external group is expected to examine the work. The source says the Lean statement also covers a weaker runtime bound than the paper’s sharpest claim.
Will this make software or computers faster now?
There is no evidence of an immediate practical speedup. The claimed algorithm is still slower than any polynomial-time algorithm, and OpenAI says practical improvements would require significant further research.
What does Lean checking establish?
Lean can check that a formal proof follows from its encoded definitions and rules. That does not replace expert review of whether the formal statement matches the paper’s full claim or whether the result has practical consequences.
Source: ThorstenMeyerAI.com
