Morning Edition · Sunday, November 1, 2026Published at 1:20 AM EST · New York
The claimed disproof passed a Lean formalization within a day, while Anthropic's separate report of 17 Claude-designed scorpion-toxin binders demonstrates binding but no neutralization.

On October 26 OpenAI said its internal reasoning models had produced three theoretical results in mathematics, theoretical computer science and mathematical physics. The most consequential is a claimed refutation of the Exponential Time Hypothesis (ETH), the 1999 conjecture that 3-SAT, a satisfiability problem central to computational complexity theory, has no subexponential-time algorithm. According to Washington Times reporting, the paper gives a deterministic algorithm that counts all satisfying assignments in subexponential time. The model produced a natural-language disproof on October 16, and the result was formalized in the Lean proof-checking language on October 17. OpenAI also reported a natural-language proof of Sogge's local smoothing conjecture in every spatial dimension of at least two.
The verification group includes two of the hypothesis's originators, Russell Impagliazzo and Ramamohan Paturi of UC San Diego, along with Ryan Williams of MIT. Paturi said his first reaction was surprise. StudyFinds notes that until the reviewers report, the Lean check is the only independent test the result has passed. Reviewers still need to confirm that the Lean statement matches the classical conjecture. The caution has a recent basis. On October 6 OpenAI released 722 manuscripts claiming partial results on problems including the Riemann hypothesis, and mathematicians objected to their validity and exposition. OpenAI later withdrew three of them.
Anthropic's result is narrower and comes with experimental data. An internal Claude research model worked largely autonomously for 64 hours across 12 protein design tools. It generated 318,484 minibinder candidates and computationally screened 553,052 protein-toxin pairs against five neurotoxins from scorpions found in Mexico, Brazil, North Africa and the Middle East, according to Interesting Engineering. Of 211 designs tested in the lab, 17 bound their targets, an 8% hit rate. Two binders against the toxin Cn2 reached single-digit nanomolar affinity, meaning they bound it tightly. Anthropic is releasing all 211 designs with their predicted structures and assay results. It explicitly does not claim an antivenom and ran no in-vitro or in-vivo neutralization tests.
Both reports come from the labs themselves, not from independent reproduction. The binder data can be checked now because Anthropic released the full set. The ETH claim cannot be settled until the named reviewers finish.
Part of a tracked trend
AI Moves Into Autonomous Scientific Discovery and Clinical Care
Over the next 3-9 months, AI systems move beyond text tasks into running real scientific experiments and managing clinical care, backed by peer-reviewed and benchmarked evidence of chemist- and physician-level performance.
Start a discussion in Townsquare.
More from this edition
If the refutation holds, OpenAI gains a research credential that no benchmark score provides, and it would gain that credential just as Anthropic's listing sets public valuations for frontier labs that OpenAI will be compared against.
The announcement is real, but Impagliazzo, Paturi and Williams wrote that their involvement "should not be taken as certification", and the public Lean scope note covers exact counting for fixed-width formulas and does not verify the manuscript's sharper running-time bound. The result therefore depends on whether the formal statement matches the standard hypothesis.
An open-source-intelligence read of how likely this story is true with its real nuance, not a judgment of any outlet. It assesses the claim, weighing independent and adversarial reporting. How we label confidence.
What this means
If the refutation holds, the conditional lower bounds that fine-grained complexity theory has built on the Exponential Time Hypothesis lose their foundation, and OpenAI gains a claim to a research-level discovery that no benchmark score can provide. That claim arrives just as Anthropic's IPO is setting public valuations for the sector. Both labs gain fundraising and recruiting value from these announcements, which is why what each lab announces and what outside reviewers have verified need to be tracked as separate facts. The closest precedent is Vinay Deolalikar's 2010 manuscript claiming to resolve P versus NP, which outside reviewers found to contain errors within weeks. This claim differs in two ways: it has a machine-checked formalization, and named reviewers have publicly agreed to check it, both of which increase the chance the proof withstands scrutiny without settling whether it is correct. The more likely outcome within weeks to a few months is that the Impagliazzo, Paturi and Williams group reports either a mismatch between the Lean formalization and the standard hypothesis, or a confirmed algorithm. Whether the formal statement matches the standard Exponential Time Hypothesis is what will decide the outcome. A confirmed algorithm would turn AI-assisted mathematical discovery from a marketing claim into a demonstrated capability. On the binder side, the next milestone to watch is neutralization testing, and a failure there would show that a binding hit rate alone overstates progress toward a therapeutic.
What to watch
Observations to monitor, not financial advice.
Synthesized from: OpenAI · Washington Times · StudyFinds · Unite.AI · Wikipedia · Anthropic Research · Let's Data Science · Interesting Engineering
Comments
0No comments yet.