cert-machine · report · generated from the records

The ten minimum universal sets of MacMahon cubes: a classification decided twice

On 1 November 2026 Jason Davies published a proof, developed with OpenAI’s GPT-6 Astra and written in Lean, that exactly ten collections of twelve MacMahon cubes can build every one of the thirty cubes as a 2×2×2 model. It settles two conjectures of Johnson and Roldán from 2024. The result and the proof are his. With Claude (Anthropic’s AI model), I checked his release three ways that share no code with each other: my own program rebuilt all 300 of his released constructions, two independent proof checkers accepted his ten Lean theorems, and two exhaustive searches, a reader’s and mine, found the same ten sets and no other collection of twelve cubes or fewer.

the 30 cubes, each named by two letters A a B b C c D d E e F f filled: one set of 12, ABC | DEF hollow: the other 18 cubes the 10 sets of 12: every split of six letters into two triples A B C D E F ABC | DEF A B C D E F ABD | CEF A B C D E F ABE | CDF A B C D E F ABF | CDE A B C D E F ACD | BEF A B C D E F ACE | BDF A B C D E F ACF | BDE A B C D E F ADE | BCF A B C D E F ADF | BCE A B C D E F AEF | BCD 10 sets × 30 cubes to build = 300 constructions, 300 rebuilt
the 30 cubes, each named by two letters A a B b C c D d E e F f filled: one set of 12, ABC | DEF hollow: the other 18 cubes the 10 sets of 12: six letters, two triples A B C D E F ABC | DEF A B C D E F ABD | CEF A B C D E F ABE | CDF A B C D E F ABF | CDE A B C D E F ACD | BEF A B C D E F ACE | BDF A B C D E F ACF | BDE A B C D E F ADE | BCF A B C D E F ADF | BCE A B C D E F AEF | BCD 10 sets × 30 cubes to build = 300 constructions, 300 rebuilt
The claim, drawn. A MacMahon cube has six colours, one on each side; there are 30 of them, and Conway’s table names each by two different letters from A to F. Split the six letters into two triples and take the cubes whose two letters fall in the same triple: a set of 12. There are 10 splits, so 10 sets. Davies’s theorem says these 10, and no other collection of 12 cubes or fewer, can build every one of the 30 cubes. The sets drawn are the ones in his released file.Records: certs/macmahon-witnesses.json · sha256 4627cdbad9d0; corpus/macmahon/results/universal_witnesses.json · sha256 18ded406ca9aThe build refuses this figure if a released set is not a split of the six letters into two triples, the sets are not 10 different ones, or a released construction is not rebuilt.
released constructions rebuilt
300 of 300
by my own program, with its own rotations and corner positions
Lean theorems accepted
10 of 10
by two kernels: Lean’s own and nanoda
collections of 12 cubes or fewer that work
10
found by two searches that share no code; none smaller
planted errors caught
9 of 9
on all three routes

The result and the proof are Jason Davies’s; his disclosure says GPT-6 Astra (OpenAI) developed the argument, the code, the Lean proofs and the manuscript under his direction. The conjectures are Inga Johnson and Erika Roldán’s. This page checks his release; it is not new mathematics. The checks are mine, run with Claude (Anthropic’s AI model), which wrote the programs under my direction.

read this first

What is still open

the claim

Thirty cubes, twelve at a time

Paint the six sides of a cube with six colours, one each. Up to turning the cube in the hand there are 30 ways, mirror images counted apart: the MacMahon cubes. A collection of cubes is universal if, for every one of the 30, eight cubes of the collection can be stacked into a 2×2×2 block whose outside is that cube, twice as large; the hidden sides need not match.

Kazuya Haraguchi showed that a universal collection needs at least 12 cubes and gave one of that size. In 2024 Inga Johnson and Erika Roldán conjectured that exactly 10 sets of 12 different cubes are universal (their Conjectures 4 and 8), and described them: the two-triple splits drawn above. Davies’s theorem is that the conjecture is right, and stays right when a collection may hold the same cube more than once: no collection with a repeat reaches the minimum.

1 · my own program

All 300 released constructions, rebuilt

2 · two kernels

His 10 Lean theorems, accepted by two independent checkers

  • What was run. On a machine hosted by GitHub (.github/workflows/macmahon-kernel.yml, run 41729708954), with Claude writing the workflow under my direction: his repository at the commit the Palomar registry names, built with its own Lean 4.35.0 and Mathlib 4.35.0. Then Comparator 4.35.0, in the configuration his repository ships, with one change: nanoda, a kernel written in Rust apart from Lean, switched on beside Lean’s own.
  • What Comparator checks. That each of the 10 theorems proved is exactly the one stated in a separate file that imports only Mathlib, so a proof cannot quietly change what it proves; that only the three standard axioms are used; and that the proofs replay.
  • What came back. Both kernels accept all 10. A report of the axioms, printed from a file of mine, names nothing beyond propext, Classical.choice, Quot.sound; one theorem needs propext alone. The library’s cache took 116 s, the build 207 s and the comparison 347 s. CERTIFIED
  • One declared change to nanoda. Its working memory per thread (the stack) was raised to 1 GiB. Nothing else in it was touched.
  • The statement, read. With Claude, I read the Lean statement file against the paper’s main theorem, sentence by sentence. It matches: a collection counts copies, so repeats are in the statement; a construction needs eight distinct physical cubes; only the outside sides are constrained; all 30 cubes must be built. This is a reading, kept apart from what the kernels decided.
The 10 theorems and their axioms
  • minimum_size · Classical.choice, Quot.sound, propext
  • physical_minimum · Classical.choice, Quot.sound, propext
  • physical_exactly_ten · Classical.choice, Quot.sound, propext
  • physical_iff_two_triangles · Classical.choice, Quot.sound, propext
  • physical_minimum_has_no_repeats · Classical.choice, Quot.sound, propext
  • proper_rotation_iff · Classical.choice, Quot.sound, propext
  • exposed_face_rule · propext
  • face_colours_valid · Classical.choice, Quot.sound, propext
  • face_assignment_coverage · Classical.choice, Quot.sound, propext
  • face_assignment_unique · Classical.choice, Quot.sound, propext
The reading, in 6 points

Challenge.lean (imports only Mathlib) read against the paper's Theorem 1 ("The minimum size of a universal collection is twelve. Exactly ten labelled collections attain that size, even when repeated varieties are permitted. Each unordered partition of the six labels into triples gives one; these are all; none has repeats.") — a reading, not a decision.

  • 1. An Inventory is Pair → ℕ: multiplicities allowed, so "repeated varieties permitted" is in the statement; DiagonalZero removes the thirty diagonal non-varieties; total is the collection size.
  • 2. PhysicalBuilds a t asks for an INJECTION of the eight slots into the stock (eight distinct physical copies) with a rotation each, and FaceFits constrains only the three exposed faces of each slot: "exteriors only, internal faces free" as the paper says.
  • 3. PhysicalUniversal quantifies over every ordered pair i ≠ j: all thirty varieties, each labelled by Conway's tableau; "labelled" (colours fixed, no quotient by colour permutations) is the statement's own frame, as the paper's Theorem 1 says.
  • 4. minimum_size (IsLeast … 12) and physical_minimum are the first sentence; physical_exactly_ten (Nat.card = 10) the second; physical_iff_two_triangles the third (twoTriangles s for a 3-subset s); physical_minimum_has_no_repeats the last.
  • 5. The five auxiliary theorems (proper_rotation_iff, exposed_face_rule, face_colours_valid, face_assignment_coverage, face_assignment_unique) certify the tables the statement rests on: the 24 rotations are exactly the proper ones, the slots expose the outward faces, and the faceColours table lists every six-distinct-colour colouring exactly once up to rotation — the same facts certs/macmahon-witnesses.json decided independently (T1).
  • 6. Not in the Lean statement: the physical cubes themselves (the model is the discrete one the paper declares: six face directions, signed-axis permutations of determinant +1). The paper says so; this is the one step a reader takes on the paper's word.
3 · two searches

No other collection of twelve, and none of 11: searched twice

4 · planted errors

What would have caught a wrong result

who did what

Each step is a separate job

check it yourself

How to re-run it

contact

Write to Carlos

Sent by Web3Forms to Carlos’s inbox; nothing stored here.

Or write to carlos@carlostoledo.co, or open the public pilot form on GitHub.