The Exponential Time Hypothesis is a bet about how hard some problems really are. It says a classic puzzle called 3-SAT, which asks whether a set of true-or-false conditions can all be met at once, can’t be solved much faster than trying an enormous number of options. Russell Impagliazzo and Ramamohan Paturi of UC San Diego proposed it in 1999 with Francis Zane, and it sits close to the famous P versus NP problem.
Researchers have used it as a foundation in fields like graph theory, databases, computational biology and computational geometry. Many papers say, in effect, “this task can’t get faster, assuming ETH is true.” If ETH is false, those limits loosen, and some problems might one day be solved far more efficiently than experts thought.
OpenAI itself is cautious on that point. The company says the result reopens questions about how much faster these tasks could go, but that turning the theory into practical gains will take a lot more research.