# OpenAI and Anthropic models independently break the Exponential Time Hypothesis for 3-SAT

> Original title: Exponential Time Hypothesis (ETH), a 27-year-old conjecture in complexity theory, just fell.

- Source: Deedy
- Published: 2026-10-27T10:30:24.000Z
- Bad Influence: https://badinfluence.news/items/jo6j6ynbp4u7lpo89s00m1h4n
- Original: https://x.com/deedydas/status/2115028333356548605

## Summary

Deedy says OpenAI and Anthropic models independently solved 3-SAT with the same 2^(n/√log n) bound on October 16, undermining the 27-year-old Exponential Time Hypothesis. The author states the result does not prove P = NP but is faster than expected. The attached image shows papers titled The Exponential Time Hypothesis Is False from OpenAI and A 2^(n/√log n) Time Algorithm for 3-SAT from Anthropic.

## Post

Exponential Time Hypothesis (ETH), a 27-year-old conjecture in complexity theory, just fell.

On Oct 16, OpenAI and Anthropic models independently solved 3-SAT with the same 2^(n/√log n) bound. Not P = NP, but faster than anyone thought possible.

We live in extraordinary times.

![](https://badinfluence.news/api/img-proxy?u=https%3A%2F%2Fpbs.twimg.com%2Fmedia%2FHVoW-X0aIAA1YKF.jpg&mode=thumb&exp=1793404800&sig=339fdf61eda50337)