Reproduce the experiment
Run the bounded search and the independent Python checkers, then compare the mathematical results with the recorded evidence.
Get the commands ↗WORK / FINITE CONGRUENCE GRAPH CRITERION
We searched colored graphs on 1–4 vertices for eight target lattices using the finite graph criterion from OpenAI Math, family 206. Method: exhaustive enumeration and a separate implementation that replayed every candidate and checked the recorded results.
Explore the congruence atlas Open the graph explorer ↓01 / Explore a construction
Choose a lattice. Each color names one of its elements; the graph’s vertices are the points on which the recovered algebra acts.
Solid edges have colors at or below this element. Dashed edges are excluded.
Changing controls explores recorded data. It does not rerun the exhaustive search or check a Lean proof in your browser.
02 / The bounded experiment
The search recorded 143,685 candidate colorings, 217 witnesses and 22 classes under vertex relabeling with lattice colors fixed. A witness satisfies all five conditions of the finite graph criterion. These counts describe colored graphs, not the Atlas's 313 labeled grouping families, 39 relabeling classes or 22 abstract order shapes.
M4 has no witness within the tested bound of four points. Larger carriers remain outside this experiment. Operation minima fix the saved carrier and exact relations.
03 / Follow the evidence
Run the bounded search and the independent Python checkers, then compare the mathematical results with the recorded evidence.
Get the commands ↗Concrete N5/B3 proofs and targeted upstream modules compiled and passed bundled kernel replay. Read the exact versions, axioms, and scope.
Read the verification record ↗Eight specified lattices, at most four carrier points. The original upstream theorem passed its official comparator. The full OpenAI math corpus remains outside this validation.
Read the claim ledger ↗The formal correspondence between the Python connectivity implementation and the upstream Lean predicate remains unproved. This is an independent companion project, with no affiliation or endorsement implied.
Download explorer data and source hashes ↓