Busy Beaver Explorer / holdouts / 1RB1RA_1LC0RD_1LD1LB_1LE0LF_0RA---_0LB0LE
What is known about 1RB1RA_1LC0RD_1LD1LB_1LE0LF_0RA---_0LB0LE
1RB1RA_1LC0RD_1LD1LB_1LE0LF_0RA---_0LB0LE
Decided: it haltsProved in this repository, checked by Coq on busycoq's own definitions of a machine and of halting (there is no Lean proof of the whole run). The ledger below says what each part rests on.
This six-state, two-symbol Turing machine, one of the holdouts of the BB(6) search, halts when started on a blank tape. The halt is a Coq theorem on busycoq's definitions. This page lists what has been established about it, sorted by what each result rests on.
Status as of 18 November 2026.
In short
It halts, proved in Coq (theorem halt : halts tm c0 on busycoq's definitions, no axioms). With E and F exchanged its table is 1RB1RA_1LC0RD_1LD1LB_1RA0LE_0LB0LF_0RA--- except for D0, where a detour (1LE, then 0RA and 1RA) ends where that table's single step ends, or halts if the cell to the left holds a 1. So every halt of that table is a halt of this machine. That table, started in A, is DeepMind's fast engine of busycoq PR 93 changed for one transition (as for 1RB0LC_1RC1RA_1LD0RE_1LA1LD_0RA0RF_0LD---, the same table started in B), and it reaches a halting configuration after 350,227 engine steps, on a tape of about 23562 cells.
What it does. The run is understood as a process on a list of blocks: each round halves the number of blocks of every size and moves them up one size. That description comes from simulation; Lean proves only the sweep rules the rounds are built from. The sister machine 1RB1RA_1LC0RD_1LD1LB_1LE0LF_0RA---_0LB0LF behaves the same way.
Other proofs and outside reports
Proved in Coq
The proof: halt : halts tm c0, stated on busycoq's own definitions of a Turing machine and of halting, in holdouts/1RB1RA_1LC0RD_1LD1LB_1LE0LF_0RA---_0LB0LE/coq. Coq 8.18.0 compiles it and Print Assumptions reports no axioms; the build log is next to the files. The lemma detour reduces it to the T4 table started in A; the rest is the proof of 1RB0LC_1RC1RA_1LD0RE_1LA1LD_0RA0RF_0LD--- (DeepMind's busycoq pull request 93 engine changed for T4) started in A, whose run of 350,227 engine steps is one evaluation. The generator is tools/coq/t4engine/proof/mkA.py.
Community label
In the community's BB(6) tracker the machine's class is Chaotic Bell Class 1. These are labels read off the run by others, not results.
What each result rests on
kernel Proved in Lean, kernel-checked
The halting configurations
The machine stops exactly when it reads the symbol of a halting transition (E1); the generated statement covers every configuration.
step_none_iff, lean/Blank.lean
No halt in the first 10,000 steps
The list simulator of the shared library, proved to agree with the machine's semantics, runs 10,000 steps from blank tape without a halt, evaluated by Lean's kernel.
blank_runs_kernel, lean/Blank.lean
8 sweep rules, for all n
The head crosses a run of n copies of a short word (10, 110, 100, 011, ...) in one go, for all n and any tape around it; for example L (110)n 1 1 B> 0 R becomes L B> 1 1 (100)n 1 R in 5n + 2 steps.
lean/Rules.lean (generated by py/gen_rules.py)
The machine halts (Coq, on busycoq's definitions)
halt : halts tm c0, with busycoq's TM, halts and c0 and tm this machine's table. detour: for every configuration and every n, if T4 (1RB1RA_1LC0RD_1LD1LB_1RA0LE_0LB0LF_0RA---) halts from it in n steps, this machine halts from it with E and F exchanged. The rest is the proof of 1RB0LC_1RC1RA_1LD0RE_1LA1LD_0RA0RF_0LD--- (DeepMind's PR 93 engine with the four rules that pass through F0 changed), started in A instead of B: 350,227 engine steps to F on a 1, one evaluation checked by Coq's kernel (run_ok). Print Assumptions halt: closed under the global context. Coq 8.18.0.
halt, detour, holdouts/1RB1RA_1LC0RD_1LD1LB_1LE0LF_0RA---_0LB0LE/coq/H181655.v (generated by tools/coq/t4engine/proof/mkA.py)
native Proved in Lean with native_decide
No halt in the first 107 steps
The same run, evaluated by compiled code.
blank_runs_native, lean/Blank.lean
trusted Computed, not proved
No halt in the first 109 steps
The C simulator tools/c/triage.c runs 109 steps without a halt; at the end 35,915 cells have been visited and 18,041 of them hold a 1.
holdouts/triage.json
Rounds and block lists
A C run of 109 steps reaches the left end in state E 28 times (counting only events at least 106 steps apart). Each time the tape is a list of blocks of 1s separated by 00; almost all blocks have length 6m + 1 and stand in runs of equal blocks, longest blocks on the left.
c/blocks.c
Counts halve each round
From one round end to the next, the number of blocks of length 6m + 1 becomes about half (within a few blocks) the number of blocks of length 6(m − 1) + 1 before; a new run of blocks 1 appears on the right, alternately about 2,000 to 4,000 and about 200 to 450 long in the last rounds. A few irregular blocks sit at the boundaries of the runs.
c/blocks.c
heuristic Evidence only
Growth shape: exp/sqrt
Left of the start, the visited part of the tape grows like the logarithm of the step count: each new cell costs a roughly constant factor more time, the signature of a counter or of a Collatz-like map whose values are written on the tape (fitted exponent 0.071). Right of the start it grows like the square root of the step count, the signature of a head sweeping back and forth across the whole tape and adding a cell or a few at the end of each sweep (a bouncer-like shape) (fitted exponent 0.505).
tools/py/bbtools/triage.py
A marker sweeping left
Between round ends the head goes back and forth across most of the tape; the point where it turns moves left a few cells per trip while each trip adds a few cells on the right. This is why the right side grows like the square root of the step count and the left side, which only grows at round ends, like its logarithm.
No halt in the first 6.64×1014 steps of an accelerated run
Observed, not proved: the accelerated simulator rsim.py ran 6.64×1014 steps from blank tape without reaching a halting transition. Its tape, state and head position were equal to those of a plain C simulator at 6 checkpoints, the last at 1.02×1010 steps. Of these steps, the part after the last checkpoint rests on the simulator alone, including 13,093 trip-level jumps: a jump applies many identical round trips at once after seeing the same tape shape recur with constant count changes, which is validated against direct simulation but not proved.
holdouts/1RB0LC_1RC1RA_1LD0RE_1LA1LD_0RA1RF_0LC---/py/rsim.py, holdouts/1RB0LC_1RC1RA_1LD0RE_1LA1LD_0RA1RF_0LC---/py/rsim_screen.py, holdouts/1RB0LC_1RC1RA_1LD0RE_1LA1LD_0RA1RF_0LC---/data/rsim_screen.json
open Open
Nothing yet.
Check it yourself
. /etc/profile.d/lean.sh # after scripts/setup-lean.sh
holdouts/1RB1RA_1LC0RD_1LD1LB_1LE0LF_0RA---_0LB0LE/lean/check.sh
gcc -O2 -I tools/c -o blocks holdouts/1RB1RA_1LC0RD_1LD1LB_1LE0LF_0RA---_0LB0LE/c/blocks.c && ./blocks 1RB1RA_1LC0RD_1LD1LB_1LE0LF_0RA---_0LB0LE 1000000000 L E 2 1000000
sh holdouts/1RB1RA_1LC0RD_1LD1LB_1LE0LF_0RA---_0LB0LE/coq/build.sh /path/to/busycoq # the Coq proof; a checkout of busycoq's BB6 branch; 45 minutes or more
sh tools/coq/t4engine/proof/build.sh /path/to/busycoq fast # regenerate H155900.v and H181655.v from PR 93's file (fast: final runs admitted)