
A subexponential k-SAT counter ends ETH and the lower bounds built on it
OpenAI published a preprint giving a deterministic algorithm that exactly counts the satisfying assignments of a k-CNF in (n+m)^{O_k(1)} 2^{O_k(n log log n / log n)} time and polynomial space, which refutes the Exponential Time Hypothesis, SETH, Gap-ETH, NSETH and #ETH. A Lean formalization in the repository proves a weaker exponent of n (log log n)^2 / sqrt(log n) for canonically encoded inputs, and a verification group led by Russell Impagliazzo, Ramamohan Paturi and Ryan Williams has not yet reported. The result voids the premise of thousands of conditional lower bounds in fine-grained and parameterized complexity while leaving P versus NP, CircuitSAT and practical SAT solving untouched, since 2^{n/log n} remains superpolynomial.