Two AI proofs of critical percolation, checked against a statement written independently from the textbook

In August and September 2026, Anthropic (J. Leder with Claude) and OpenAI released Lean 4 proofs that Bernoulli bond percolation on Z^d has no infinite cluster at the critical probability, θ(p_c) = 0, a question open in dimensions 3 to 10. The proofs are theirs. Before reading either, I wrote the statement in Lean from Grimmett's Percolation (2nd ed., §1.3–1.4), with Mathlib only and encoded differently from both (edges as unordered pairs at ℓ¹ distance one, the product measure by Measure.infinitePi, p_c as Grimmett's supremum), and checked, with Claude, that both proofs prove it: Anthropic's for every d ≥ 2 and OpenAI's for d = 3, each by a Lean bridge (299 and 306 lines; the monotonicity of θ in OpenAI's case proved by us). Both bridges are accepted by Lean's kernel and by nanoda with the independent statement as the Comparator challenge, and leanchecker --fresh replays both environments; Anthropic's development replays as shipped; planted false statements, one of them proved false in Lean in the same environment, are refused by both bridges; θ(0) = 0 and θ(1) = 1 are proved in the independent encoding, so the statement is not vacuous. What stays open: the two bridges run on two Lean versions, so that the statement means the same in both is a reading, not a kernel check; neither lab's informal paper is checked. Rules were sealed before each stage and results after, with a public registry and Bitcoin anchors. Files: the report (PDF) and the records, every file pinned by its hash.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-12
DOI
https://doi.org/10.5281/zenodo.24168178
Primary Topic
Logic, programming, and type systems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Two AI proofs of critical percolation, checked against a statement written independently from the textbook

Carlos Toledo
Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
preprint

Two AI proofs of critical percolation, checked against a statement written independently from the textbook

Carlos Toledo
preprint en

Abstract

In August and September 2026, Anthropic (J. Leder with Claude) and OpenAI released Lean 4 proofs that Bernoulli bond percolation on Z^d has no infinite cluster at the critical probability, θ(p_c) = 0, a question open in dimensions 3 to 10. The proofs are theirs. Before reading either, I wrote the statement in Lean from Grimmett's Percolation (2nd ed., §1.3–1.4), with Mathlib only and encoded differently from both (edges as unordered pairs at ℓ¹ distance one, the product measure by Measure.infinitePi, p_c as Grimmett's supremum), and checked, with Claude, that both proofs prove it: Anthropic's for every d ≥ 2 and OpenAI's for d = 3, each by a Lean bridge (299 and 306 lines; the monotonicity of θ in OpenAI's case proved by us). Both bridges are accepted by Lean's kernel and by nanoda with the independent statement as the Comparator challenge, and leanchecker --fresh replays both environments; Anthropic's development replays as shipped; planted false statements, one of them proved false in Lean in the same environment, are refused by both bridges; θ(0) = 0 and θ(1) = 1 are proved in the independent encoding, so the statement is not vacuous. What stays open: the two bridges run on two Lean versions, so that the statement means the same in both is a reading, not a kernel check; neither lab's informal paper is checked. Rules were sealed before each stage and results after, with a public registry and Bitcoin anchors. Files: the report (PDF) and the records, every file pinned by its hash.

Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon