Busy Beaver Explorer / holdouts / 1RB1RD_1LC0RE_1LD1LC_1RA0LB_0RD0RF_0LC---
What is known about 1RB1RD_1LC0RE_1LD1LC_1RA0LB_0RD0RF_0LC---
1RB1RD_1LC0RE_1LD1LC_1RA0LB_0RD0RF_0LC---
Decided by an outside Rocq proof: it haltsA Rocq proof in busycoq pull request 100 (open, not yet reviewed by the maintainer) was compiled here, on busycoq's own definitions, with no axioms beyond Coq's own. It is their proof, not one written in this repository; the ledger below says what this repository checked on its own.
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 19 November 2026.
In short
Decided by an outside Rocq proof: it halts. Busycoq pull request 100 (valu42, 2026-11-18) proves this in Rocq, and we compiled it here with Coq 8.20.1 on busycoq's BB6 branch: it uses no axioms (Print Assumptions), and its transition table is this machine. It reuses this repository's Coq port of DeepMind's PR 93 engine (built for 1RB0LC_1RC1RA_1LD0RE_1LA1LD_0RA0RF_0LD---), started from a renamed state, and runs it to the halt. It is their proof, on busycoq's definitions of a machine and of halting, and busycoq's maintainer has not yet reviewed it. Everything else on this page is what this repository found on its own, which by itself leaves the question open.
It halts, proved in Coq (theorem halt : halts tm c0 on busycoq's definitions, no axioms). Mirrored and with its states renamed, its table is 1RB1RA_1LC0RD_1LD1LB_1RA0LE_0LB0LF_0RA--- started in state C, one transition away from the table DeepMind proved halting in busycoq PR 93. DeepMind's fast engine, changed for that transition as for 1RB0LC_1RC1RA_1LD0RE_1LA1LD_0RA0RF_0LD--- (the same table started in B), reaches a halting configuration from state C after 427,055 engine steps, on a tape of about 24360 cells.
What it does. Before the halt the machine runs a layered counter: a growing prefix (110)^k is turned, at each reset, into runs of groups of sizes 4, 7, 10, 13, … with large multiplicities, which the following sweeps use up. That description comes from simulation; the halt does not depend on it.
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/1RB1RD_1LC0RE_1LD1LC_1RA0LB_0RD0RF_0LC---/coq. Coq 8.18.0 compiles it and Print Assumptions reports no axioms; the build log is next to the files. The proof of 1RB0LC_1RC1RA_1LD0RE_1LA1LD_0RA0RF_0LD--- (DeepMind's busycoq pull request 93 engine changed for T4) with the table, the state map and the start (C) changed; the proved engine's run from blank tape, 427,055 engine steps, is one evaluation of about 4 hours. The generator is tools/coq/t4engine/proof/mkC.py.
An outside Rocq proof, compiled here: it halts
busycoq pull request 100 (valu42, 2026-11-18) contains a Rocq proof that this machine halts (verify/M_1RB1RD_1LC0RE_1LD1LC_1RA0LB_0RD0RF_0LCHHH.v). The pull request is open: not merged and not reviewed by the maintainer. We compiled the file on busycoq's BB6 branch (commit 33209bc) with Coq 8.20.1 on 19 November 2026, in 15528 s: the theorem halt : halts tm c0 is stated on busycoq's own definitions of a machine and of halting, Print Assumptions reports no axioms, and the file's transition table is this machine. It is their proof, not one written in this repository. The verdict on this page rests on this proof.
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 (F1); 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
The four rules where it departs from DeepMind's halting sibling
For every tape on either side and every count, the four macro rules of DeepMind's engine for 1RB1RD_1LC0RE_1LD1LC_1RA0LB_0RD0RF_0RD--- that pass through F0 hold here in a changed form: each ends in state D with 11 more on the right instead of in state A (collision, collide, finish and defect: 10, 39, 2b+9 and 8m+39 steps).
t4_collision, t4_collide, t4_finishP, t4_defect0, lean/T4Rules.lean
It halts: DeepMind's engine, changed for this table, proved in Coq
The engine of busycoq PR 93, with the four rules that pass through F0 changed and every lemma built on them redone (the proof of 1RB0LC_1RC1RA_1LD0RE_1LA1LD_0RA0RF_0LD---, retargeted to this table and start C), reaches a halting configuration from blank tape after 427,055 engine steps, on a tape of about 24360 cells. Coq 8.18.0 checks the run in one evaluation (about 4 hours); Print Assumptions halt: closed under the global context.
halt, coq/H127983.v; generator tools/coq/t4engine/proof/mkC.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 39,716 cells have been visited and 22,109 of them hold a 1.
holdouts/triage.json
Related holdouts
The same table as 1RB0LE_1RC1RB_1LD0RA_1LA1LC_0LC0LF_0RB--- up to renaming and mirroring, started in another state; no common configuration in the first 107 steps of each. The same table as 1RB0LC_1RC1RA_1LD0RE_1LA1LD_0RA0RF_0LD--- up to renaming, started in another state; no common configuration in the first 107 steps of each.
holdouts/related.json, written by holdouts/related.py compute (tools/c/cfgmatch.c, tools/c/lockstep.c)
heuristic Evidence only
Growth shape: exp/sqrt
Left of the start, the visited part of the tape 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.5). Right of the start it 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.1).
tools/py/bbtools/triage.py
Prefix, groups and resets
At each visit of the left end in state B the tape is B> 00 (110)^k (10)^a₁ 1 (10)^a₂ 1 …. Between resets k grows by 2 a visit and the sweeps merge the groups into runs of sizes 4, 7, 10, 13, …; at a reset the prefix becomes about k/2 groups of size 4. Large and small resets alternate (k = 909, 37, 1670, 220, 2591, 397, 3185 between steps 3.6·107 and 5.3·108). Observed in simulation, not proved.
c/sim.c, c/resets.py
No halt in the first 1.48×1014 steps of an accelerated run
Observed, not proved: the accelerated simulator rsim.py ran 1.48×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.00×1010 steps. Of these steps, the part after the last checkpoint rests on the simulator alone, including 12,476 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/1RB1RD_1LC0RE_1LD1LC_1RA0LB_0RD0RF_0LC---/lean/check.sh
gcc -O2 -o sim holdouts/1RB1RD_1LC0RE_1LD1LC_1RA0LB_0RD0RF_0LC---/c/sim.c && ./sim 1RB1RD_1LC0RE_1LD1LC_1RA0LB_0RD0RF_0LC--- 600000000 1 | python3 holdouts/1RB1RD_1LC0RE_1LD1LC_1RA0LB_0RD0RF_0LC---/c/resets.py
sh holdouts/1RB1RD_1LC0RE_1LD1LC_1RA0LB_0RD0RF_0LC---/coq/build.sh /path/to/busycoq # the Coq proof; a checkout of busycoq's BB6 branch; 1 to 4 hours