Built . It shows the files as they were then (ages and “working now” follow your clock).
tools/rebuild_pages.sh rebuilds the site within 5 minutes of a change; by hand: python3 -B tools/site.py.Machines / 740 line 465
1RB1LD_1RC0RC_1LD0RE_0LB0LA_0RF1LA_---1RC
Where it stands
Skipped
User accepted the recommendation to defer this family behind stronger initial leads on 2026-10-14.
Observe
Deepen
Informal proof
Rocq
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.
bbchallenge-defaultStart blankRows steps 0 → 10,000, top to bottomWindow cells −200..199, left to rightColors 1 0 or unvisited
Overview
In one sentence
A simple right-edge extension is separated by irregular returns; no complete word model is known.
- Status
- Skippeddeferred · updated 2026-10-14T10:06:30.232473-07:00Parked · User accepted the recommendation to defer this family behind stronger initial leads on 2026-10-14.idle since Oct 14 10:08 · status.json 2026-10-14T10:06:30.232473-07:00
- Class
- Bouncer + Chaotic Edgeours: sheet Bouncer + Chaotic Edge ≠ ours Bouncer with unresolved word dynamics · low confidence
- On the list
- line 422 of
BB6_holdouts_663.txt· historical 740 line 465 · observe.json rank #465
Your calls on file 2
- next
- Retain evidence; no further research scheduled for this family.
- decision.json · answered 2026-10-14: defer
- Defer line 465 behind line 282, or fund a 30-minute return-model study? Decisions →
Mechanism
How it works: 3 notes
- The visited span expands mainly right after an early two-sided transient. The last left record in the two-million-step log is -496 at step 706,160; the left visited bound is still -496 at one billion. This is finite evidence, not proof that the left edge can never move again.
- A 21-step finite local window explains 518 observed right-edge extensions. The intervening returns remain unexplained.
- E0 writes 0 and moves right into F. The cell reached must be 1 to avoid F0; preservation is unproved.
Figures for Checkpoint A
Time increases downward. Compare the expanding right boundary with the opposite boundary.
bbchallenge-exploreStart blankRows every 1000 stepsWindow cells -496..1042, 1 px = 0.5 cellsColors 1 0 or unvisited A B C D E F
Rows: from 0 through 2,000,000; each sampled row is 2 pixels high · Window: two raster pixels per cell
Rules (1/1 validated)exact tape rewrites the proof will formalize, each re-checked by simulation
| rule | from ⟶ to | cases | steps | checked |
|---|---|---|---|---|
| 21-step finite window | state C, head 0; cells -5..0: 001100 ⟶ state C, head 1; same cells: 111010 | One exact finite input; all reads stay inside the specified window. No global closure claim. | 21 | ✓1/1 |
Compressed historynone yet: the tape compressed to a skeleton with growing exponents
—
Template comparisontemplate: unknown · the nearest solved proof, what carries over, and the transitions that differ
| 0 | 1 | |
|---|---|---|
| A | 1RB | 1LD |
| B | 1RC | 0RC |
| C | 1LD | 0RE |
| D | 0LB | 0LA |
| E | 0RF | 1LA |
| F | --- | 1RC |
- file
- —
- module
- —
- machine
- —
- diff
- —
- note
- No complete configuration family or reusable proof template has been identified.
Proof strategy & riskshow the formal proof will go · 3 risks to watch
If prioritized, seek a closed finite description of the evolving word and its return map. Then assess whether it protects F0; no proof work has started.
- ▲One billion direct steps and finite local windows establish only finite behavior, not nonhalting.
- ▲The local windows do not cover every return or establish closure of the whole-tape family.
- ▲Possible chaotic-edge behavior is unresolved; no pseudo-random arithmetic map has been extracted.
Stats & provenance109 steps simulated · 30,011 cells · the status in full · files
- simulated
- 109 steps
- tape
- 30,011 cells · 19,605 nonzeros
- growth
- Visited span grows mainly right in the sampled blank-tape run.
- status now
- User accepted the recommendation to defer this family behind stronger initial leads on 2026-10-14. (status.json, 2026-10-14T10:06:30.232473-07:00)
- observer's note
- Initial observation complete; low mechanism confidence. Lower priority of these two: sampled 12-bit-factor diversity grows from 523 to 1,146, and the accelerated run discovers no rules. There is a simple 21-step right-edge extension, but the return that enables the next extension is irregular and unexplained.
- files
- observe.json · notes.md · status.json
Proof & checks
No proof work yet.
Files
machines/<tm>/: 6 entries · raw notes, status, scripts, images
| name | size | changed |
|---|---|---|
| notes.md ↓ | 5.7 KB | 2026-10-14 10:06 |
| status.json ↓ | 771 B | 2026-10-14 10:06 |
| observe.json ↓ | 10 KB | 2026-10-14 10:08 |
| decision.json ↓ | 1.5 KB | 2026-10-14 10:06 |
| img/ | 2 items | 2026-10-13 18:24 |
| work/ | 8 items | 2026-10-13 18:24 |
status.json in full
{
"tm": "1RB1LD_1RC0RC_1LD0RE_0LB0LA_0RF1LA_---1RC",
"status": "SKIPPED",
"stage": "deferred",
"updated": "2026-10-14T10:06:30.232473-07:00",
"confidence": "low",
"owner": "astra",
"holdout_line": 465,
"outcome": "unresolved",
"direct_steps": 1000000000,
"proof_status": "none",
"possible_chaotic_edge": true,
"confirmed_cryptid": false,
"rank_within_282_465": 2,
"reason": "User accepted the recommendation to defer this family behind stronger initial leads on 2026-10-14.",
"next": "Retain evidence; no further research scheduled for this family.",
"observation_complete": true,
"proof_started": false,
"formal_checker_run": false,
"updated_utc": "2026-10-14T17:06:30.232473+00:00",
"next_action": "Deferred by user decision."
}observe.json contract (tools/README-card.md):
1 contract warning
- diagrams: 1 (want 3-5)