Repository navigation
Releases
A 192-state Busy Beaver bound for Peano arithmetic
For the literal 192-state New Foundations machine, Peano arithmetic proves that nonhalting implies the consistency of PA. By Gödel’s second incompleteness theorem, consistent PA cannot prove that this machine runs forever.
The proof package gives the numerical result from NF consistency. The Holmes–Wilshaw consistency proof supplies this premise in ZFC, so in the usual set-theoretic metatheory PA proves no numerical upper bound on BB(192). The paper also gives a separate argument from Mac Lane consistency.
The PDF gives the mathematical argument. The review bundle contains the Lean sources, the literal machine and verification materials. The PA-internal theorem is PA192.PhysicalModel.Frozen.internal_consistency in FrozenConsistency.lean.
Original 192-state machine · Holmes and Wilshaw, NF is Consistent
A 201-state Busy Beaver bound for Zermelo set theory
Let H mean that the released 201-state machine halts on blank tape. The note proves on paper that PA proves ¬H → Con(Z), where Z is Zermelo set theory with Infinity and full Separation, without Choice or Replacement. Hence consistent Z cannot prove that this machine runs forever. The set-theoretic input for this implication is Proposition 17.6 of Choice and Consistency Strength in NF and NFU, research draft v15.
The upper construction and the additional written consistency comparisons in v15 give actual nonhalting in ZF and a 201-state Busy Beaver bound for both Z and NF with Rosser’s full Axiom of Counting.
Verification. A new Lean theorem identifies halting of the literal table with acceptance of a numerical derivation by its ten-row proof checker. The model construction and the numeral-embedding lemmas were also checked in Lean. The object-theory transfer is proved in the paper. The verification ZIP includes the Lean sources, replay commands, the upper-construction supplement, and a reproducible false halt for the tested 200-state edit.
Browse the proof sources on GitHub
Lean verification supplement
The literal 201-state machine halts exactly when its eight first-order chart axioms, with equality, prove a contradiction. Lean derives the translation of Rosser’s full Axiom of Counting from those axioms. The finite table checks now replay in the kernel. The halting equivalence and model extraction use only propext, Classical.choice, and Quot.sound.
The supplement also fixes the arithmetic sentence Con(Z), transports even nonstandard Z-refutation witnesses into the extracted model’s Frege arithmetic, and checks soundness for internally coded proofs with cut and full Separation. It constructs the first powerset stage and its successor.
Status of the Zermelo bound. The theorem Counting201PA.PA_transfer_of_three_hypotheses derives the exact PA implication from three explicit hypotheses. Formalizing them still requires (1) realizing arbitrary internally ranked refutations on the literal tape, (2) assembling the stages as one represented rank hierarchy, and (3) translating arithmetic Z-refutations into the model’s internal sequent calculus. The complete implication remains a paper result. The source, audit reports and replay commands are in Counting201_formal_supplement.zip under Assets.
New Foundations: 192-state countdown machine and Lean verification
The supplied 192-state binary machine halts on a blank tape exactly when first-order NF proves a contradiction. The archive contains the literal table, the Lean 4.35.0 sources, the original set-theory development, the informal proof, offline certificates and their reproduction instructions.
SHA-256 of NF192_countdown_Lean_proof.zip is 3320b48765554127f118849d3350e9b7334ddcd94e5a3a154c11fbcea02978e3.
C₀: 198-state machines, proofs and complete checkpoint
C₀ research package, 11 November 2026.
Includes both 198-state machine tables, proof reports, the complete verified checkpoint, reverse-interpretation sources, verification receipts and checksums.
See the package README for theorem statements, assumptions, proof status and reproduction instructions. The four PDF/ZIP downloads are attached below; machine tables and verification receipts are in the repository.
Verify downloaded files against SHA256SUMS.