# OpenAI says its AI disproved the Exponential Time Hypothesis; computer scientists will check the proof

Source: Searchable (https://searchable.pk/news/science/openai-says-its-ai-disproved-the-exponential-time-hypothesis-computer-scientists)
Type: News article
Author: Searchable Editorial
Published: 27 Oct 2026
Updated: 27 Oct 2026
Retrieved: 27 Oct 2026

> OpenAI has released three claimed breakthroughs in maths, computer science and physics. One, if it holds, would overturn a basic assumption about how hard some problems are.

**OpenAI says its models have produced three "major" results in mathematics, computer science and physics**, including a claimed proof that the **Exponential Time Hypothesis is false**, [The Verge reported](https://www.theverge.com/ai-artificial-intelligence/1019143/openai-eth-kaseya-science-math-physics) on Monday. The material has been posted to GitHub. None of it has yet been peer reviewed, and the claims should be treated as claims until experts have checked them.

## The three results

| Field | What OpenAI claims | Who checks it |
|---|---|---|
| Computer science | A deterministic algorithm that counts the solutions of fixed-width CNF formulas in subexponential time; for 3-SAT this would refute the Exponential Time Hypothesis | A working group led by Russell Impagliazzo, Ramamohan Paturi and Ryan Williams |
| Mathematics | A proof of Sogge's local smoothing conjecture for the wave equation in every dimension from two, which would also settle the Kakeya maximal and dimension conjectures | Released as raw model output for researchers to work through |
| Physics | A third result guided by outside experts | External "shepherds" |

## Why the computer science claim is so big

The Exponential Time Hypothesis, put forward by Impagliazzo and Paturi in 1999, says that some problems, such as 3-SAT (deciding whether a set of logical conditions can all be true at once), cannot be solved much faster than by checking an exponential number of possibilities. A great deal of theoretical computer science is built on it as an assumption. If it is false, many "this cannot be done quickly" results would need rethinking. It would not, on its own, break internet encryption or settle the famous P versus NP question.

That two of the scientists who proposed the hypothesis are now leading the review is significant: they are the people best placed to find a flaw.

## A new way of releasing results

This is OpenAI's second big release in a month, after it put out hundreds of manuscripts on 6 October claiming solutions to open maths problems. This time it says outside experts asked to see the computer science and physics work first. A panel of maths advisers, AGMAI, said the day before that AI companies should not give selected researchers early access, citing unequal access and borrowed reputation.

## For students in Pakistan

Theoretical computer science is taught at FAST, NUST, LUMS and COMSATS, and results like this are exactly what final-year and MS students can follow as they are checked in public. Working out a CGPA for an MS application? Try our [CGPA calculator](/tools/education/cgpa-calculator).

## Frequently asked questions

**What is the Exponential Time Hypothesis?**

It is the assumption, proposed in 1999 by Impagliazzo and Paturi, that problems such as 3-SAT cannot be solved in subexponential time. OpenAI now claims an AI-produced proof that it is false, which is being reviewed.

## Sources

- OpenAI announces three big science discoveries and a new way to work with academics (The Verge): https://www.theverge.com/ai-artificial-intelligence/1019143/openai-eth-kaseya-science-math-physics

How to cite: "OpenAI says its AI disproved the Exponential Time Hypothesis; computer scientists will check the proof", Searchable, 27 Oct 2026, https://searchable.pk/news/science/openai-says-its-ai-disproved-the-exponential-time-hypothesis-computer-scientists