What we know

Frontier AI labs claim their models have refuted the Exponential Time Hypothesis (ETH), a key assumption in computational complexity theory that suggests certain problems cannot be solved faster than exponential time. This claim challenges long-held beliefs about the limits of algorithmic efficiency. MIT computer scientists involved with OpenAI have been tasked with explaining this discovery, highlighting its significance in the field.

Why it matters

ETH underpins much of theoretical computer science, influencing how researchers understand problem difficulty and computational limits. If ETH is indeed refuted, it could revolutionize cryptography, optimization, and algorithm design by enabling faster solutions to problems previously thought intractable. Such a breakthrough would reshape the foundations of complexity theory and impact numerous practical applications.

What is still unknown

No independent verification or peer-reviewed evidence has been published to confirm the claim. Details about the models’ accuracy, the specific computational problems addressed, and the range of programming languages or platforms supported remain unclear. There is also no information on when or if these findings will be broadly released or subjected to wider scientific scrutiny.