Computer scienceMachine-checked

OpenAI model claims the Exponential Time Hypothesis is false

OpenAI · Internal reasoning model

The hypothesis says 3-SAT cannot be solved in sub-exponential time, and a large part of complexity theory is built on it. OpenAI says its model wrote a disproof on October 16 that was checked in Lean the next day. The paper and the formal proof are public.

Still openOutside experts are still working out whether the formal statement matches the claim and what the algorithm means in practice.

Machine-checked. A formal proof compiles in a proof assistant such as Lean. People have not yet confirmed that it proves what the announcement says. How entries are graded

AI Discovery Ledger Weekly

One email every Friday, about a three-minute read: the week's lead result, the grades that moved up or down, what else was logged, and what is still open.

Unsubscribe from any issue. Prefer a feed reader? Follow by RSS.