Themata.AI
Follow coverage
Themata.AI
OpenAILLMsAI researchMathematical proofs

Report · techcrunch.com

Frontier AI labs say their models refuted the Exponential Time Hypothesis. What does that mean?

Frontier AI labs say their models refuted the Exponential Time Hypothesis. What does that mean? | TechCrunch

techcrunch.com

Source published October 27, 2026

Summary: 2 min read

🔥🔥🔥🔥🔥

0/100

Summary

OpenAI released proposed solutions to three major mathematics and science problems, including a claimed refutation of the Exponential Time Hypothesis, or ETH. Anthropic mathematician Levent Alpöge questioned whether OpenAI’s solutions drew on existing work, and Anthropic later released its own claimed ETH refutation. MIT computer scientist Ryan Williams, UC San Diego’s Russell Impagliazzo, and Ramamohan Paturi—who first published ETH in 1999—are helping organize an expert response and have called publicly for feedback. ETH holds that a class of hard logic problems requires exponentially increasing time to solve as the number of variables grows. It supports the widespread intuition that P differs from NP: solutions to certain problems may be quick to verify but not quick to find. OpenAI and Anthropic claim their models produced sub-exponential algorithms for such problems. If the claims withstand review, they would invalidate ETH and could increase the perceived plausibility of P equaling NP, though Williams said OpenAI’s algorithm is unlikely to be the best possible one. Williams said papers that rely on ETH may need reassessment. He also raised possible cryptographic consequences; OpenAI science lead Dan Roberts told him the lab had checked for effects on cryptographic systems and was reasonably confident the result did not make any insecure. Computer scientists have asked OpenAI to share the proof publicly and fund a conference to evaluate its implications.

Key Takeaways

  • OpenAI and Anthropic each released claimed refutations of the Exponential Time Hypothesis, a computational-complexity assumption introduced by Russell Impagliazzo and Ramamohan Paturi in 1999.
  • ETH states that certain satisfiability-style problems require exponentially more computation as their number of variables increases, even under the fastest algorithms.
  • The labs claim to have found sub-exponential algorithms for the relevant problems; expert validation is still being organized.
  • If ETH is disproved, research that assumes it may need revision and computer scientists may assign more plausibility to P equaling NP.
  • OpenAI reportedly assessed potential cryptographic effects and was reasonably confident its claimed result did not break cryptographic systems.
Read original article

Coverage & discussions

RSS · TechCrunch AI · techcrunch.com

Frontier AI labs say their models refuted the Exponential Time Hypothesis. What does that mean? ↗

Related Articles

AI cracks a 27-year-old pillar of computer science, OpenAI and Anthropic claim

AI cracks a 27-year-old pillar of computer science, OpenAI and Anthropic claim

Oct 30, 2026

Why the Legendary Erdős Problems Are Falling to AI | Quanta Magazine

Why Erdős Problems Are Falling to AI

Aug 5, 2026

The AI Revolution in Math Has Arrived | Quanta Magazine

The AI revolution in math has arrived

Apr 13, 2026

Some thoughts about Anthropic’s new cryptanalysis results

Some thoughts about Anthropic's new cryptanalysis results

Jul 29, 2026

OpenAI just scooped mathematicians’ work on another million-dollar problem

OpenAI just scooped human researchers on a million-dollar quantum math problem

Oct 27, 2026