tools/rebuild_pages.sh rebuilds the site within 5 minutes of a change; by hand: python3 -B tools/site.py.1RB0LD_0RC---_0LD0RF_1LE1LD_0LA0RD_0RB1RA
Where it stands
Parked at the informal proof
Funded proof stage 3 (Dennis: fund_clock, 2026-10-14; counter clock) done, parked by its stop rule: the shape set does not close. (1) Digit bookkeeping made faithful: the counter is two digit blocks H sep L in different alignments (eating rules 001 <A 011 and 000 <D shift the low block); writer marks (cells marked by the left-moving E/D/A step that wrote them) replace positional marks; guided replay of the orbit (scripts/ctl_replay3.py) from step 1,128,893 to 21,129,033 (125 overflows, odd burst O(7)) stays inside the shapes with at most 40 non-digit cells in the counter region (stage 2: unbounded drift).
Read the full status
(2) Counter floor as the clock: S = at least Q+1 digits, split S = S000 | S001 | exact Q+1-digit words, so counters cannot be eaten away and short ones are exact (overflow within 2^(Q+1) increments, < K counter steps per phase). (3) Closure (scripts/ctl_explore3.py, K = 64, Q = 2): 3.5 M shapes, not closed, 0 halting steps; skeletons level off at 949-950 from 1.6 M to 3.5 M (stage 2: steady growth), but exact counts (two carry runs, the run behind the wall, field lower bounds, each up to K) keep the set growing. K = 16/32, Q = 3 and a digit-run cap of 3 do not close either. Step check 9,000 random concrete steps, 0 failures. Next: decision.json (park, recommended, or a stage 4 with a compiled explorer).

About this picture
The standard picture (bbchallenge.org's Default view): each row is the whole tape at one step, time runs downward, and the head's path draws the pattern.
Waiting on you: Park 693 + twins (recommended) or fund stage 4 (compiled explorer, K = 64 to ~1e8 shapes)? See decision.json.
See the question →Overview
Needs you
In one sentence
No summary yet: no observe.json, and status.json gives no relation.
- Status
- Parkedproof · updated 2026-10-14Waiting on you · Park 693 + twins (recommended) or fund stage 4 (compiled explorer, K = 64 to ~1e8 shapes)? See decision.json.idle since Oct 14 14:15 (47 h ago) · status.json 2026-10-14
- Informal proof
- proof.mdconditional; see Proof for what is still open
- Class
- Bell eats counter
- On the list
- line 620 of
BB6_holdouts_663.txt· historical 740 line 693
Your calls on file 7
- priority call (open)
- Park 693 + twins (recommended) or fund stage 4 (compiled explorer, K = 64 to ~1e8 shapes)? See decision.json.
- parked
- Dennis 2026-10-14: park after 3 stages (catch-up law, CTL closure, counter clock); twins 528/310/548 parked with it
- funded
- option: fund_clock · date: 2026-10-14
- 2026-10-14 · fund
- Fund one proof stage for an abstract proof of 693 that also covers its time-rescaled twins 528, 310 and 548, or park all four? (fund 693)
- 2026-10-14 · fund_clock
- Park 693 and its twins 528, 310, 548, or fund a third stage that fixes the explorer's digit bookkeeping and adds a counter clock?
- 2026-10-14 · fund_closure
- Fund a second proof stage for 693 by the closed-tape-language route (symbolic shape closure, no catch-up arithmetic), or park 693 and its twins 528, 310, 548?
- 2026-10-14 · park
- Park 693 and its twins 528, 310, 548, or fund a fourth stage that ports the stage-3 explorer to compiled code and runs the closure to about 10^8 shapes?
Mechanism
Proof & checks
- proof.md · the informal proof
Files
machines/<tm>/: 6 entries · raw notes, status, scripts, images
| name | size | changed |
|---|---|---|
| notes.md ↓ | 28 KB | 2026-10-14 13:53 |
| proof.md ↓ | 31 KB | 2026-10-14 13:50 |
| status.json ↓ | 2.3 KB | 2026-10-14 14:15 |
| decisions/ | 4 items | 2026-10-14 14:15 |
| scripts/ | 19 items | 2026-10-14 13:21 |
| work/ | 22 items | 2026-10-14 13:53 |
status.json in full
{
"tm": "1RB0LD_0RC---_0LD0RF_1LE1LD_0LA0RD_0RB1RA",
"label": "693",
"status": "STUCK",
"stage": "proof",
"updated": "2026-10-14",
"reason": "Funded proof stage 3 (Dennis: fund_clock, 2026-10-14; counter clock) done, parked by its stop rule: the shape set does not close. (1) Digit bookkeeping made faithful: the counter is two digit blocks H sep L in different alignments (eating rules 001 <D -> <A 011 and 000 <D shift the low block); writer marks (cells marked by the left-moving E/D/A step that wrote them) replace positional marks; guided replay of the orbit (scripts/ctl_replay3.py) from step 1,128,893 to 21,129,033 (125 overflows, odd burst O(7)) stays inside the shapes with at most 40 non-digit cells in the counter region (stage 2: unbounded drift). (2) Counter floor as the clock: S = at least Q+1 digits, split S = S000 | S001 | exact Q+1-digit words, so counters cannot be eaten away and short ones are exact (overflow within 2^(Q+1) increments, < K counter steps per phase). (3) Closure (scripts/ctl_explore3.py, K = 64, Q = 2): 3.5 M shapes, not closed, 0 halting steps; skeletons level off at 949-950 from 1.6 M to 3.5 M (stage 2: steady growth), but exact counts (two carry runs, the run behind the wall, field lower bounds, each up to K) keep the set growing. K = 16/32, Q = 3 and a digit-run cap of 3 do not close either. Step check 9,000 random concrete steps, 0 failures. Next: decision.json (park, recommended, or a stage 4 with a compiled explorer).",
"confidence": "med",
"priority_call": "Park 693 + twins (recommended) or fund stage 4 (compiled explorer, K = 64 to ~1e8 shapes)? See decision.json.",
"twins": [
"1RB0LF_1LC0RE_0LD1LC_1LA---_0RB1RA_1LC1LF",
"1RB0LF_1LC0RE_0LD1LC_1LA---_0RB1RA_0LE1LF",
"1RB0LF_1LC0RD_1LA1LC_---0RE_0RB1RA_1LC1LF"
],
"funded": {
"option": "fund_clock",
"date": "2026-10-14"
},
"outcome": "parked: stage-3 shape set (faithful bookkeeping + counter floor) does not close in 3.5 M shapes; skeletons level off, exact counts keep growing; no verified CTL decider works",
"proof_md": "working version (parked); section 8 = stage 2, section 9 = stage 3; scripts/check_proof.py --ctl --ctl3: C1-C11 pass 2026-10-14",
"parked": "Dennis 2026-10-14: park after 3 stages (catch-up law, CTL closure, counter clock); twins 528/310/548 parked with it"
}