OpenAI’s recent claim that its models have refuted the Exponential Time Hypothesis (ETH) has ignited a flurry of excitement and skepticism across the scientific community. By presenting algorithms that allegedly solve ETH‑related puzzles in sub‑exponential time, the lab is challenging a cornerstone assumption that has guided computational complexity research for decades.
Lab Release Strategy
- Mathematicians received the proofs via GitHub, ensuring open access to the raw data.
- Computer scientists formed a working group, requested public sharing of the proofs, and secured conference funding to facilitate discussion.
- Physicists are coordinating a separate release plan to evaluate the impact on their field.
Community and Academic Response
| Aspect | Details |
|---|---|
| OpenAI’s Approach | Structured, discipline‑specific release; invites collaboration. |
| Anthropic’s Counter‑Refutation | Released its own ETH refutation shortly after OpenAI’s announcement. |
| Academic Critique | MIT Professor Ryan Williams labeled earlier proof dumps a “DDOS attack on mathematicians” but now collaborates to guide the field. |
| Community Sentiment | Mixed: thrill over potential breakthroughs, dismay over methodological concerns. |
Implications for Computational Complexity
The ETH, a subset of the broader P vs NP debate, posits that certain problems require exponentially more time as variables increase. If OpenAI’s models truly deliver sub‑exponential solutions, this could undermine the ETH and, by extension, reshape our understanding of P = NP. While experts like Williams caution that the algorithms may not represent the optimal solution, the very possibility forces a reevaluation of long‑held intuitions about tractability, cryptographic security, and the foundational assumptions embedded in countless research papers.