OpenAI claims AI-generated algorithm overturns the Exponential Time Hypothesis

OpenAI announced on October 26 that its AI produced a deterministic algorithm that exactly counts solutions to fixed-width CNF formulas in subexponential time, which would refute the Exponential Time Hypothesis. The manuscripts and Lean formalizations are public, and ETH originators Russell Impagliazzo and Ramamohan Paturi with MIT's Ryan Williams are organizing an examination, stressing it is not a certification.

• Algorithm counts solutions to fixed-width CNF formulas in subexponential time
• For clauses with at most three literals, this would refute ETH
• Impagliazzo, Paturi and Williams coordinate review but do not certify the claim
• Separate claims cover local smoothing and Yang–Mills quantum field theory