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 / #35
1RB0LF_1LC0LA_---1RD_1RF1RE_1LF1RD_1LB0RE
Where it stands
Parked at the observation
Parked 2026-10-10 with #13 (auto-applied recommendation): its chaotic edge is cell for cell #13's edge lemma (E'). Observe done. Bulk (1101101101)^n, wall, sweeps, 7-bounce junction H_0..H_6 and the edge visit are exact and validated; non-halting reduces to the chaotic edge map Z -> Phi(Z), which is cell for cell #13's edge (parked 2026-10-10). No non-halting argument for the edge, so confidence low and proof work waits for Dennis (decision.json, recommended: park_with_13).
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
Exact period-10 bouncer and 7-bounce junction; every 7th bounce stirs a chaotic edge Z, the same edge as #13.
- Status
- Parkedobserving · updated 2026-10-10Not blocking · Stuck at the observing stage. Answer Q1–Q3 whenever; a “no” redirects the work.idle since Oct 10 13:58 · status.json 2026-10-10
- Class
- Bouncer + Chaotic Edgeours: Bouncer + Chaotic Edge (sheet) · ours adds: period-10 bulk on a left wall, 7-bounce junction, chaotic edge identical to #13's · low confidence
- On the list
- line 481 of
BB6_holdouts_663.txt· historical 740 line 533
Your calls on file 3
- priority call (answered)
- Same chaotic edge as #13 (parked): park #35 with it, or fund one shared edge-language stage for the family?
- parked
- Parked 2026-10-10 with #13 (auto-applied recommendation): its chaotic edge is cell for cell #13's edge lemma (E').
- decision.json · answered 2026-10-10: park_with_13
- #35's chaotic edge is cell for cell #13's parked edge: park #35 with #13, or fund a shared stage on that edge? Decisions →
Mechanism
How it works: 3 notes
- Bulk 0^inf <A 0 (1101101101)^n on a left wall, rebuilt one cell further left each bounce (62n steps); a fixed junction cycles through 7 exact words H_0..H_6 and the bulk gains one block per 7 bounces.
- 6 of 7 bounces never touch the edge Z; the 7th applies an edge map Z -> Phi(Z) independent of n (2077/2077 matches with the 1e9 run). Phi is chaotic: |Z| 143-563 over 5e6 visits (~5e15 steps), no repeat, no halt.
- Z is cell for cell #13's tail (#13 tail at bounce c-6 = fixed 58-cell word + our Z at bounce c, 1,952/1,952 visits). Halting needs 0 0 0 E> 0; 38,720 near misses 1 0 0 E> 0, all in the edge. Bounces 0-300 (period-5 junction) are plain simulation.
Figures for Checkpoint A
Compare the smooth left boundary with the ragged right side; the grey stripe band between them is the bulk.
bbchallenge-defaultStart blankRows every step; 99,999 steps squeezed into 500 rowsWindow cells -200..199, 1 px = 1 cellColors 1 0 or unvisited head after a move R/L
Rows: site bilinear view
One row per new leftmost or rightmost cell. Compare the left boundary with the right boundary and its noisy band.
bbchallenge-defaultStart blankRows left/right recordsWindow cells -1342..1085, 1 px = 1 cellColors 1 0 or unvisited head moving R/L
Rows: (one row per new leftmost or rightmost cell), 2,428 rows to step 10,000,000
The frame follows the junction. Left: bulk and junction columns. Right: the edge band and its sawtooth right end.
customStart blankRows every 28 bouncesWindow cells -60..539, 1 px = 1 cellColors 1 0 right of the visited span
Rows: (every 4th edge visit), bounces 315..14,819 of the 1e9-step run, 519 rows, each taken at a left record · Window: cells counted from the junction frame, which moves 12 cells right per row (3 per edge visit)
More figures (2)Fig 4–5: One bounce, cell by cell · Seven bounces including one edge visit
Fig 4 · One bounce, cell by cell
Top: right sweep over 4 bulk blocks to the junction. Then the slow zigzag left sweep back to the wall.
bbchallenge-exploreStart constructed: 0∞ <A 0 (1101101101)4 H_0 Z 0∞Rows every step, 262 steps (exactly one bounce)Window cells -2..107, 1 px = 0.33 cellsColors 0 1
Start: H_0 = junction word, Z = real edge at bounce 14,806; exact tape in work/cyc7_config.txt · Window: 3 px per cell · Colors: head coloured by state: A red, B orange, C blue, D green, E magenta, F cyan
Fig 5 · Seven bounces including one edge visit
Six short bounces turn at the junction; the seventh walks far into the edge and back in many small sweeps.
bbchallenge-defaultStart constructed: 0∞ <A 0 (1101101101)4 H_0 Z 0∞Rows every 5 stepsWindow cells -6..441, 1 px = 1 cellColors 1 0 or unvisited head after a move R/L
Start: same tape as the one-bounce figure · Rows: steps 0..12,731 (exactly 7 bounces), 2,547 rows
Rules (6/7 validated)exact tape rewrites the proof will formalize, each re-checked by simulation
| rule | from ⟶ to | cases | steps | checked |
|---|---|---|---|---|
| left wall | 0∞ <A 0 r ⟶ 0∞ 1 1 E> r | any r (here r = (1101101101)^n ...) | 4 | ✓80/80 |
| right sweep | E> (1101101101)n ⟶ (1011110110)n E> | any context | 12n | ✓80/80 |
| left sweep | (0111101101)n <A ⟶ <A (0110110111)n | any context; = the bulk shifted one cell left | 50n | ✓80/80 |
| junction bounces k=0..5 | 0∞ <A 0 (1101101101)n H_k Z ⟶ 0∞ <A 0 (1101101101)n+[k=4] H_(k+1) Z | Z arbitrary and never read; H_0..H_6 listed in notes.md | 62n + c_k, c = 13, 433, 55, 49, 73, 13 | ✓360/360 |
| edge visit (k=6) | 0∞ <A 0 (1101101101)n H_6 Z ⟶ 0∞ <A 0 (1101101101)n H_0 Phi(Z) | Phi independent of n: run at n=3 reproduces every edge visit of the 1e9 run; Phi has no closed form (chaotic) | 62n + O(|Z|^2) (2,017-20,283 beyond 62n) | ✓2077/2077 |
| 7-bounce cycle | 0∞ <A 0 (1101101101)n H_0 Z ⟶ 0∞ <A 0 (1101101101)n+1 H_0 Phi(Z) | holds at every edge visit from bounce 301 (step ~7.3e5) to 14,840 (1e9); junction frame +3 cells per cycle | 434n + O(|Z|^2) | ✓2078/2078 |
| halt pattern | 0 0 0 E> 0 ⟶ halt | the only route seen near halting: 38,720 near misses 1 0 0 E> 0 to 1e9, all in the edge; the A1 route (000 1 <A) never comes close | 4 (E0 F0 B0 C0) | –untested |
Compressed historythe tape as 0∞ <A 0 (1101101101)n H_6 Z 0∞ (taken at each edge visit; H_6 = 1101111001100111011001001001111011001001101101110100110) at 40 moments: where the rules are read off
0∞ <A 0 (1101101101)n H_6 Z 0∞ (taken at each edge visit; H_6 = 1101111001100111011001001001111011001001101101110100110)
| step | bounce | n | |Z| | hi | Z (first 24 cells) |
|---|---|---|---|---|---|
| 729,466 | 308 | 60 | 257 | 605 | 1.1·1023 |
| 3,020,898 | 686 | 114 | 365 | 875 | 1.1·1023 |
| 6,576,090 | 1,064 | 168 | 323 | 995 | 1.1·1023 |
| 11,405,298 | 1,442 | 222 | 341 | 1,175 | 1.1·1023 |
| 17,462,466 | 1,820 | 276 | 239 | 1,235 | 1·1022 |
| 24,816,524 | 2,198 | 330 | 287 | 1,445 | 1·1022 |
| 33,444,528 | 2,576 | 384 | 365 | 1,685 | 1·1022 |
| 43,313,850 | 2,954 | 438 | 323 | 1,805 | 1·1022 |
| 54,458,684 | 3,332 | 492 | 281 | 1,925 | 1·1022 |
| 66,873,238 | 3,710 | 546 | 299 | 2,105 | 1·1022 |
| 80,557,620 | 4,088 | 600 | 317 | 2,285 | 1.1·1023 |
| 95,483,288 | 4,466 | 654 | 305 | 2,435 | 1.1·1023 |
| 111,690,606 | 4,844 | 708 | 323 | 2,615 | 1.1·1023 |
| 129,179,068 | 5,222 | 762 | 311 | 2,765 | 1·1022 |
| 147,908,296 | 5,600 | 816 | 329 | 2,945 | 1.1·1023 |
| 167,908,692 | 5,978 | 870 | 257 | 3,035 | 1.1·1023 |
| 189,177,386 | 6,356 | 924 | 245 | 3,185 | 1.1·1023 |
| 211,719,686 | 6,734 | 978 | 293 | 3,395 | 1·1022 |
| 235,514,884 | 7,112 | 1,032 | 281 | 3,545 | 1·1022 |
| 260,598,926 | 7,490 | 1,086 | 389 | 3,815 | 1·1022 |
| 286,940,082 | 7,868 | 1,140 | 347 | 3,935 | 1·1022 |
| 314,547,672 | 8,246 | 1,194 | 335 | 4,085 | 1.1·1023 |
| 343,423,278 | 8,624 | 1,248 | 383 | 4,295 | 1.11·1023 |
| 373,552,978 | 9,002 | 1,302 | 311 | 4,385 | 1.11·1023 |
| 404,940,108 | 9,380 | 1,356 | 299 | 4,535 | 1·1022 |
| 437,614,780 | 9,758 | 1,410 | 347 | 4,745 | 1.11·1023 |
| 471,517,260 | 10,136 | 1,464 | 245 | 4,805 | 1.11·1023 |
| 506,701,484 | 10,514 | 1,518 | 293 | 5,015 | 1.11·1023 |
| 543,183,624 | 10,892 | 1,572 | 401 | 5,285 | 1·1022 |
| 580,912,938 | 11,270 | 1,626 | 329 | 5,375 | 1·1022 |
| 619,916,142 | 11,648 | 1,680 | 317 | 5,525 | 1.1·1023 |
| 660,183,558 | 12,026 | 1,734 | 305 | 5,675 | 1.1·1023 |
| 701,695,204 | 12,404 | 1,788 | 323 | 5,855 | 1.1·1023 |
| 744,498,486 | 12,782 | 1,842 | 371 | 6,065 | 1.1·1023 |
| 788,565,954 | 13,160 | 1,896 | 329 | 6,185 | 1.1·1023 |
| 833,889,620 | 13,538 | 1,950 | 377 | 6,395 | 1.1·1023 |
| 880,484,548 | 13,916 | 2,004 | 365 | 6,545 | 1.11·1023 |
| 928,342,454 | 14,294 | 2,058 | 323 | 6,665 | 1.1·1023 |
| 977,450,652 | 14,672 | 2,112 | 341 | 6,845 | 1.1·1023 |
| 999,689,080 | 14,840 | 2,136 | 329 | 6,905 | 1.1·1023 |
bouncelast 14,840nlast 2,136|Z|last 329hilast 6,905Z (first 24 cells)last 1.1·1023Template comparisonBouncer_v3.v TM1: partly applies · the nearest solved proof, what carries over, and the transitions that differ
| 0 | 1 | |
|---|---|---|
| A | 1RB | 0LF |
| B | 1LC | 0LA |
| C | --- | 1RD |
| D | 1RF | 1RE |
| E | 1LF | 1RD |
| F | 1LB | 0RE |
- file
Bouncer_v3.v:44- module
TM1- machine
1LB1RA_0RA0RC_---1RD_1RE1RB_1LF0LE_0RD0LE(9 transitions apart)- diff
class template, not a near neighbour (same skeleton as #13's comparison)- note
- Shape carries over: left wall via sideRLs_wall, everything else as the right side, k-bounce BigStep (ours k=7, theirs 128). TM1's RInc is a native symbolic check of RC i -> RC (1+i), which needs the edge to be eventually periodic in i; ours is chaotic, so RInc has no analogue. InfiniteRect_v1.v needs eventually periodic crossing streams per column, which the edge never reaches. A closed-language certificate (CTLCertv1.v / CTL62 solve_cert) is the only formal route seen.
Proof strategy & riskshow the formal proof will go · 3 risks to watch
Same reduction as #13: wall + bulk sweeps (ind, 12n and 50n) + 6 exact junction bounces reduce non-halting to the edge map Z -> Phi(Z). That edge is #13's edge, so any closed language found for #13 transfers here (and likely to #34, #36, R6). No such language is known.
- ▲The edge lemma is the whole problem and is the one #13 was parked on (SFT_k refuted k<=36, n-gram CPS fails n<=26 there).
- ▲|Z| is bounded only empirically (143-563 over 5e6 edge visits); a long transient could still reach 0 0 0 E> 0.
- ▲Proving the six junction bounces and Phi's n-independence in Rocq needs LongN/InfiniteRect-style side plumbing (15-30 KB).
Stats & provenance109 steps simulated · 21,748 cells · the status in full · files
- simulated
- 109 steps
- tape
- 21,748 cells · 15,177 nonzeros
- growth
- lo ~ -0.47 sqrt(t), hi ~ +0.22 sqrt(t) at 1e9; edge map run 5e6 visits (~5e15 machine steps), |Z| 143-563, no repeat, no halt
- status now
- Parked 2026-10-10 with #13 (auto-applied recommendation): its chaotic edge is cell for cell #13's edge lemma (E'). Observe done. Bulk (1101101101)^n, wall, sweeps, 7-bounce junction H_0..H_6 and the edge visit are exact and validated; non-halting reduces to the chaotic edge map Z -> Phi(Z), which is cell for cell #13's edge (parked 2026-10-10). No non-halting argument for the edge, so confidence low and proof work waits for Dennis (decision.json, recommended: park_with_13). (status.json, 2026-10-10)
- observer's note
- Bouncer, junction and edge visit found and validated; the chaotic edge is identical to #13's (parked), not arithmetic, so not a cryptid. No non-halting argument for the edge: confidence low, proof work waits for Dennis.
- files
- observe.json · notes.md · status.json
Proof & checks
No proof work yet.
Files
machines/<tm>/: 7 entries · raw notes, status, scripts, images
| name | size | changed |
|---|---|---|
| notes.md ↓ | 7.5 KB | 2026-10-10 13:58 |
| status.json ↓ | 1.0 KB | 2026-10-10 13:58 |
| observe.json ↓ | 15 KB | 2026-10-10 13:42 |
| decision.json ↓ | 2.7 KB | 2026-10-10 13:58 |
| img/ | 6 items | 2026-10-10 13:41 |
| scripts/ | 11 items | 2026-10-10 13:41 |
| work/ | 8 items | 2026-10-10 13:41 |
status.json in full
{
"tm": "1RB0LF_1LC0LA_---1RD_1RF1RE_1LF1RD_1LB0RE",
"status": "STUCK",
"stage": "observe",
"confidence": "low",
"updated": "2026-10-10",
"reason": "Parked 2026-10-10 with #13 (auto-applied recommendation): its chaotic edge is cell for cell #13's edge lemma (E'). Observe done. Bulk (1101101101)^n, wall, sweeps, 7-bounce junction H_0..H_6 and the edge visit are exact and validated; non-halting reduces to the chaotic edge map Z -> Phi(Z), which is cell for cell #13's edge (parked 2026-10-10). No non-halting argument for the edge, so confidence low and proof work waits for Dennis (decision.json, recommended: park_with_13).",
"related": [
"1RB0LE_1LC1RD_1LA0RB_1RC1RB_1LF0LC_---0RC (#13, same edge, parked)",
"1RB1RF_1LC0RF_1LE0LD_1RC0LB_---1RA_1LB1RA (#36, near-twin)"
],
"priority_call_answered": "Same chaotic edge as #13 (parked): park #35 with it, or fund one shared edge-language stage for the family?",
"parked": "Parked 2026-10-10 with #13 (auto-applied recommendation): its chaotic edge is cell for cell #13's edge lemma (E')."
}