OpenAI says its models have refuted the Exponential Time Hypothesis
A machine-written paper gives a deterministic algorithm that counts the satisfying assignments of any k-CNF formula in subexponential time and polynomial space. A Lean formalisation of a slightly weaker bound is public, and the original proposers of the hypothesis will lead the review.
Full story