Imagine a world where the hardest problems in computer science suddenly become a little bit easier. For decades, researchers have leaned on the Exponential Time Hypothesis (ETH) as a fundamental truth—the idea that certain problems, like 3-SAT, simply cannot be solved faster than exponential time. But a new claim from OpenAI suggests that the foundation of computational complexity might have just shifted.
A Crack in the Foundation
OpenAI has released a preprint claiming to have refuted the ETH. Specifically, the paper suggests that 3-SAT on n variables can be solved in roughly $\exp(n / (\log n)^{1/2+o(1)})$ time. While this isn't a magic bullet that solves P vs NP overnight, it is a 'subexponential' breakthrough. If true, it means the ceiling we thought existed for algorithm efficiency is actually a window.
Why This Matters for the Real World
Why should anyone outside of a PhD seminar care? Because ETH is the bedrock for proving that many other problems are 'hard.' If ETH is false, the ripple effect is massive. It could redefine how we approach everything from cryptography to network optimization and logistics. Experts examining the result note that if the claim holds, it fundamentally changes our understanding of computer science.
AI as the New Mathematician
What's perhaps more shocking than the result is the method. This discovery, alongside claims regarding the Kakeya conjecture and Yang-Mills existence, suggests AI is moving beyond pattern recognition and into the realm of formal mathematical discovery. We are entering an era where AI doesn't just code the software—it rewrites the theoretical laws the software obeys.
Sources
Media
