Refacto AI

Industry story

OpenAI and Anthropic models claim to refute Exponential Time Hypothesis

evals gpu-supply security

Two AI labs racing to out-publish each other on a civilization-scale math result is not a good sign for the result. OpenAI claimed to refute the Exponential Time Hypothesis, a foundational assumption that certain logic puzzles grow exponentially harder as they scale; Anthropic followed hours later with its own version, after one of its mathematicians called OpenAI's work derivative. MIT professor Ryan Williams, who is organizing peer review alongside the UC San Diego researchers who first posed ETH, described parts of OpenAI's proof as "alien-looking," which is not a compliment. The cybersecurity question, whether any encryption is now breakable, got asked only after publication, and OpenAI science lead Dan Roberts's answer, "no known breaks," is scoped and careful, not reassuring.

Analysis

Showing the shorter version.

OpenAI published a proof claiming to overturn the Exponential Time Hypothesis (ETH), a decades-old assumption that certain logic problems grow exponentially harder as they scale. Anthropic followed hours later with its own proof, after one of its mathematicians publicly called OpenAI's work derivative. If either holds, it cracks the door to P = NP, which would mean the hardness assumptions underneath RSA and elliptic-curve encryption are shakier than the entire internet's security model currently assumes.

Neither proof has been peer-reviewed. MIT professor Ryan Williams, who is organizing the review alongside the UC San Diego researchers who originally posed ETH, described parts of OpenAI's proof as "alien-looking." That is not praise. It means the people most qualified to check this work cannot yet reconstruct the reasoning chain.

The safety failure is the most concrete thing here. If a model genuinely found a path to P = NP, the first call should have gone to cryptographers, standards bodies, and governments, not to a tech reporter. Both labs skipped coordinated disclosure entirely. Williams had to ask OpenAI science lead Dan Roberts after publication whether any encryption was now breakable. Roberts said no known breaks, which is a scoped, careful answer. It is not reassuring. Both labs have spent years promising their safety commitments cover exactly this kind of civilization-scale result. This week, the competitive race won.

Two rivals announcing the same decades-defying result within hours, both under competitive pressure, neither peer-reviewed, with sections experts cannot follow, is the pattern of a race, not a discovery. ETH has survived serious attack for decades. Unreadable proofs usually hide errors, not breakthroughs.

For operators: do not touch your crypto stack. The gap between "theoretically possible" and a working exploit on public-key crypto has historically been years to decades. The real planning risk is softer. Every security team that recently deprioritized post-quantum migration now has a reason to keep it funded, because the headline has already seeded uncertainty even if the proof collapses.

On the compute side, verification will burn real cluster time at multiple labs whether or not either result survives. That cost is immediate. The longer tail is that a real ETH collapse would say algorithmic cleverness can substitute for raw compute on a class of problems nobody has priced that way, which has implications for how the industry thinks about hardware scaling. But that question waits entirely on the math holding up.

Prediction: Williams's review group, working with the original UC San Diego ETH authors, will not have publicly confirmed either proof as correct and community-verified by 2027-05-02. The reviewers will have found a gap, or still be working through the sections nobody can currently follow. ETH's track record and the base rate for bold refutations of long-standing assumptions argue strongly in that direction. Medium confidence.

Also covered this issue

Comments