# OpenAI and Anthropic Claim AI Disproved a 27-Year-Old Conjecture

- URL: https://usa-24.com/exponential-time-hypothesis-ai-disproof/
- Publisher: USA 24
- Section: Artificial Intelligence (AI)
- Published: 2026-11-01T15:01:12.650Z
- Updated: 2026-11-01T15:01:12.655Z
- Topics: Exponential Time Hypothesis, OpenAI, Anthropic, AI Math Proofs, Computer Science Research

> OpenAI says its internal models refuted a 27-year-old computer science conjecture, and Anthropic claims a parallel result. Independent experts are now checking both.

## Key takeaways

- OpenAI announced on October 26, 2026 that its internal AI models had refuted the exponential time hypothesis, a conjecture about how quickly computers can solve certain logic problems.
- OpenAI's paper, titled “The Exponential Time Hypothesis is false,” describes a deterministic algorithm, and OpenAI published the write-up and formal proof on GitHub.
- Anthropic posted a separate claimed refutation credited to “Claude (Anthropic)”, and both labs date their discovery to October 16.
- Russell Impagliazzo, Ramamohan Paturi and MIT's Ryan Williams will lead an independent review, and no peer-reviewed paper exists yet.
- The claimed result does not prove that P equals NP, and BeInCrypto reports it poses no direct threat to the cryptography securing Bitcoin and Ethereum.

OpenAI says its internal AI models have disproved the exponential time hypothesis, a computer science conjecture that researchers have leaned on for about 27 years. The company announced the result on Monday, October 26, 2026, and an Anthropic model has been credited with a parallel claim. Neither result has been peer reviewed, and independent experts are now checking both.

The hypothesis is a long-standing guess about how quickly computers can solve certain logic problems. It holds that some of those puzzles cannot be solved quickly by any computer program. According to the [Washington Times](https://www.washingtontimes.com/news/2026/oct/27/openai-says-model-refuted-exponential-time-hypothesis/), hundreds of papers depend on it, so a disproof would reach well beyond one lab. If the claim survives review, a working assumption that shapes how theorists think about the limits of computation would need rewriting.

## What OpenAI and Anthropic say they found

OpenAI said on October 26 that its internal models had refuted the hypothesis, proved several mathematical conjectures and produced existence proofs for quantum field theories, according to [Quartz](https://qz.com/openai-ai-discoveries-math-computer-science-physics-102726). The company says its AI found a “natural language disproof” on Oct. 16. It formalized the result in Lean on Oct. 17, as [Unite.ai](https://www.unite.ai/openai-says-its-models-produced-three-proofs-in-math-cs-and-physics/) reported.

The write-up is titled “The Exponential Time Hypothesis is false.” It describes a deterministic algorithm that exactly counts satisfying assignments of fixed-width CNF formulas in subexponential time and polynomial space, according to [Technology.org](https://www.technology.org/2026/10/28/openai-exponential-time-hypothesis-disproof-lean-kakeya/). In plain terms, the algorithm counts how many ways a logic formula can be made true, and it does so in subexponential time. The formulas must have fixed width, which makes the scope of the result a central question for reviewers.

Anthropic's claim arrived hours after OpenAI's announcement. A paper credited to “Claude (Anthropic)” says an internal Claude research model found the core algorithm without human input on Oct. 16, the same discovery date OpenAI reports. [FourWeekMBA](https://fourweekmba.com/ai-openai-says-its-ai-refuted-the-exponential-time-hypothesis/) dates the Anthropic paper to October 26. Two labs reporting the same discovery day is one of the open questions, and the sources have not reconciled the two accounts.

The claims also include a companion result. [Forklog](https://forklog.com/en/openai-says-its-ai-refuted-the-exponential-time-hypothesis/) reports that an AI output dated October 18 proved the local smoothing conjecture, and that the proof was formalized in Lean on October 19.

OpenAI has an earlier episode on a far bigger prize. Nearly seven weeks before the October 26 announcement, the company floated an AI-generated proposed solution to the Navier-Stokes problem, according to [R&D World](https://www.rdworldonline.com/openai-ai-refuted-exponential-time-hypothesis-math-physics-proofs/). OpenAI now says it claims no scientific credit for this discovery, a stance that follows that earlier dispute, as [BeInCrypto](https://beincrypto.com/openai-exponential-time-hypothesis-p-vs-np/) reports.

## Why this is not a P versus NP result

The short answer to whether AI has solved P versus NP is no, based on what has been claimed so far. P versus NP asks whether every problem whose answer can be checked quickly can also be solved quickly. The exponential time hypothesis is a narrower question, and OpenAI's reported result concerns that narrower question. [MindStudio](https://www.mindstudio.ai/blog/exponential-time-hypothesis-disproven) reports that OpenAI's own president has said P probably still does not equal NP.

The distinction matters for the stakes. According to the Washington Times, if the hypothesis is false, some problems in fields such as graph theory, databases and computational biology may have faster solutions than experts assumed. OpenAI said finding them will take significant further research.

For algorithm designers, the near-term effect would be to reopen lines of work that the assumption had closed off. Graduate students who built thesis projects around hardness results would need to check which conclusions survive. Those are slow, specific consequences, not overnight ones.

## Who is checking the claims

Russell Impagliazzo and Ramamohan Paturi will lead an independent review of the claim, with MIT's Ryan Williams, according to Technology.org. FourWeekMBA places Impagliazzo and Paturi at UC San Diego. The review is still pending, and no peer-reviewed paper has been published.

Alex Iosevich, a mathematics professor at the University of Rochester, called the result a “historic development,” as Quartz reported. Praise from outside experts is not the same as verification, and the review will decide which claims hold.

Lean checks whether a formal proof is valid. It cannot tell whether the formal statement says what the paper claims, and that judgment falls to human experts. OpenAI published the write-up and the formal proof on GitHub, and it has agreed to make all raw data public, according to the Washington Times.

In a statement quoted by the Washington Times, OpenAI said, “our system has recently proved that the [hypothesis] is false.” The company has not said which internal model produced the results, and that detail remains undisclosed.

The announcement also landed the same week as the GPT-6.1 Terra launch on October 26, per Technology.org, so the science story competed with a product launch for attention. OpenAI has taken a gated approach before. Its [GPT-6 Rosalind biology model](https://usa-24.com/gpt-6-rosalind-trusted-access-biology/) opened only to approved customers.

## Does the claim threaten Bitcoin and encryption?

Not directly, according to the analysis so far. BeInCrypto reports that the result does not prove P equals NP, the larger question behind modern encryption, and that the algorithm poses no direct threat to the cryptography securing Bitcoin (BTC) and Ethereum.

The gap between a narrower complexity claim and a break in deployed cryptography is wide. Encryption and blockchain signatures depend on specific assumptions, and a claim that is still under review does not change them on its own. Readers searching for whether AI math proofs affect bitcoin encryption can take that answer for now.

No consumer action is required. Readers who want to follow the story can take three steps:

- Wait for the independent review led by Impagliazzo, Paturi and Williams before treating the claim as settled.
- Check whether the Lean formal statement matches the natural-language claim in the paper.
- Watch for a peer-reviewed publication, which does not yet exist.

## What to watch next

The next signals are the reviewers' verdict, whether OpenAI names the internal model behind its result, and whether the two October 16 discovery dates reconcile. Investor attention is also split, as USA 24 has tracked in its coverage of [Big Tech's $3 trillion AI spending pledges](https://usa-24.com/big-tech-ai-spending-3-trillion/).

If the review confirms both the algorithm and the Lean statement, expect a wave of papers testing which downstream results depended on the old assumption. If reviewers find a gap between the formal statement and the paper, the claim shrinks to something narrower. Either outcome will show how far AI-generated proofs can be trusted before humans have checked them.

## Frequently asked questions

### What is the exponential time hypothesis?

It is a long-standing conjecture in computer science holding that some logic puzzles cannot be solved quickly by any computer program. The Washington Times reports that hundreds of papers rely on it. OpenAI says its models disproved it, but that claim has not been independently confirmed.

### Has AI solved P versus NP?

No, based on the claims so far. The reported result concerns the narrower exponential time hypothesis, not P versus NP. MindStudio reports that OpenAI's own president has said P probably still does not equal NP.

### Does the OpenAI result affect bitcoin or encryption?

BeInCrypto reports that the result does not prove P equals NP and poses no direct threat to the cryptography securing Bitcoin and Ethereum. Consumers do not need to take any action.

### Has the exponential time hypothesis disproof been peer reviewed?

Not yet. Russell Impagliazzo and Ramamohan Paturi will lead an independent review with MIT's Ryan Williams. OpenAI has published its write-up and formal proof on GitHub, but no peer-reviewed paper exists.

### Which AI model produced the result?

OpenAI has not said which internal model produced its result. Anthropic credits an internal Claude research model with a separate claimed refutation, and the two labs both date their discovery to October 16.

## Sources

1. [Did AI just solve a 30-year-old computer science puzzle? Experts are checking](https://www.washingtontimes.com/news/2026/oct/27/openai-says-model-refuted-exponential-time-hypothesis/)
2. [OpenAI says AI refuted the Exponential Time Hypothesis](https://www.rdworldonline.com/openai-ai-refuted-exponential-time-hypothesis-math-physics-proofs/)
3. [OpenAI says its AI refuted the Exponential Time Hypothesis](https://forklog.com/en/openai-says-its-ai-refuted-the-exponential-time-hypothesis/)
4. [OpenAI said its AI cracked major problems in math, computing, and physics](https://qz.com/openai-ai-discoveries-math-computer-science-physics-102726)
5. [OpenAI Says Its Models Produced Three Proofs in Math, CS, and Physics](https://www.unite.ai/openai-says-its-models-produced-three-proofs-in-math-cs-and-physics/)
6. [OpenAI Claims Exponential Time Hypothesis Is False](https://www.technology.org/2026/10/28/openai-exponential-time-hypothesis-disproof-lean-kakeya/)
7. [OpenAI Says Its AI Refuted the Exponential Time Hypothesis](https://fourweekmba.com/ai-openai-says-its-ai-refuted-the-exponential-time-hypothesis/)
8. [OpenAI Says Its AI Refuted the Exponential Time Hypothesis. Is Bitcoin Safe?](https://beincrypto.com/openai-exponential-time-hypothesis-p-vs-np/)
9. [AI Just Disproved the Exponential Time Hypothesis. Here's Why It Matters](https://www.mindstudio.ai/blog/exponential-time-hypothesis-disproven)
10. [OpenAI Launches GPT-6.1 Terra at $1 per Million Input Tokens](https://www.technology.org/2026/10/27/openai-gpt-6-1-terra-computer-use-pricing-terminal-bench/)