A second Reddit post spread today about OpenAI's claims. This one zooms in on computer logic. OpenAI's AI says it beat a rule called the Exponential Time Hypothesis, or ETH. ETH says some logic puzzles always take a very long time to solve on any computer.
The puzzle type is called 3-SAT. It asks if a long logic statement can ever be made true. OpenAI's AI built a faster way to solve it. The new way still takes a long time. It just takes less time than ETH said it would. A bigger question, P versus NP, stays open either way.
This claim follows another big one from weeks ago. Anthropic's Claude already beat two related rules, called 3SUM and APSP. That paper came out in early October. Both labs now use the same proof-checking tool, called Lean. Lean checks each logic step in a proof on its own.
The Reddit post pulled 12 comments on r/OpenAI today. A separate Hacker News thread, built around the same proof file, climbed much higher. It reached 431 points and 165 comments.
Coders on the site Codeforces reacted hard too. Some said years of theory built on ETH now need a second look. Others pushed back. They said old results stay useful even after a sharper proof replaces them.
The stakes reach past one math contest. Hundreds of computer science papers lean on ETH to argue that some shortcuts are impossible. If OpenAI's proof holds up, each paper needs a fresh look at its own claim. Outside reviewers now check the work by hand, line by line. Two of them first proposed ETH itself, years ago. Readers may wait several weeks for a clear, final answer.