{
  "tm": "1RB1LD_1RC0RC_1LD0RE_0LB0LA_0RF1LA_---1RC",
  "holdout_line": 465,
  "updated_utc": "2026-10-14T01:25:06.013917+00:00",
  "stage": "initial_observation_complete",
  "proof_status": "unproved",
  "halting_status": "unknown",
  "observed_nonhalting_through": 1000000000,
  "engine": "existing tools/sim/tmsim C core",
  "end": {
    "step": 1000000000,
    "state": "D",
    "dir": "L",
    "pos": 12638,
    "lo": -496,
    "hi": 29514,
    "nonzeros": 19605,
    "halted": false
  },
  "mechanism_confidence": "low",
  "possible_chaotic_edge": true,
  "confirmed_cryptid": false,
  "no_arithmetic_return_map_extracted": true,
  "observed_behavior": "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.",
  "ranking_within_pair": 2,
  "ranking_reason": "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.",
  "qsim": {
    "ev": "end",
    "reason": "max_loops",
    "loops": 30000,
    "step": 60427,
    "steps_exact": true,
    "nonzeros": 208,
    "rules": 0,
    "rules_by_level": {},
    "collatz_rules": 0,
    "failed_proofs": 0,
    "macro_moves": 27170,
    "chain_moves": 2830,
    "rule_moves": 0,
    "block_size": 1,
    "seconds": 0.881
  },
  "independent_1e6_crosscheck": {
    "matches_C_snapshot": true,
    "transition_counts": {
      "A0": 108349,
      "B0": 80625,
      "C0": 155104,
      "D1": 84962,
      "A1": 55401,
      "D0": 125543,
      "C1": 105179,
      "E1": 78788,
      "B1": 153267,
      "E0": 26391,
      "F1": 26391
    },
    "F_neighborhoods_distinct": 134,
    "F_neighborhoods_top20": [
      [
        "1010001111011",
        3010
      ],
      [
        "1010001110101",
        2467
      ],
      [
        "0110001110101",
        1876
      ],
      [
        "0110001111011",
        1824
      ],
      [
        "1010001110111",
        1131
      ],
      [
        "1110001011101",
        1005
      ],
      [
        "0110001101011",
        767
      ],
      [
        "0001001011110",
        672
      ],
      [
        "1010001111101",
        661
      ],
      [
        "1010001111111",
        648
      ],
      [
        "1010001101011",
        623
      ],
      [
        "1110001011110",
        621
      ],
      [
        "1010001011111",
        559
      ],
      [
        "1010001011101",
        418
      ],
      [
        "0001001011101",
        418
      ],
      [
        "1010001111110",
        408
      ],
      [
        "1010001110000",
        300
      ],
      [
        "0011001110111",
        290
      ],
      [
        "1011001111111",
        287
      ],
      [
        "1110001011010",
        253
      ]
    ],
    "first_F_entries": [
      {
        "step": 77,
        "pos": 1,
        "word": "1010001110000",
        "head_offset": 6,
        "read": 1
      },
      {
        "step": 196,
        "pos": -6,
        "word": "1010001111110",
        "head_offset": 6,
        "read": 1
      },
      {
        "step": 207,
        "pos": 1,
        "word": "1010001011100",
        "head_offset": 6,
        "read": 1
      },
      {
        "step": 349,
        "pos": -13,
        "word": "1010001111110",
        "head_offset": 6,
        "read": 1
      },
      {
        "step": 360,
        "pos": -6,
        "word": "1010001011111",
        "head_offset": 6,
        "read": 1
      },
      {
        "step": 411,
        "pos": -1,
        "word": "1010001111011",
        "head_offset": 6,
        "read": 1
      },
      {
        "step": 418,
        "pos": 4,
        "word": "0110001110000",
        "head_offset": 6,
        "read": 1
      },
      {
        "step": 501,
        "pos": -7,
        "word": "1111001011101",
        "head_offset": 6,
        "read": 1
      },
      {
        "step": 603,
        "pos": -15,
        "word": "1010001111101",
        "head_offset": 6,
        "read": 1
      },
      {
        "step": 626,
        "pos": -12,
        "word": "0011001111111",
        "head_offset": 6,
        "read": 1
      },
      {
        "step": 711,
        "pos": -17,
        "word": "1010001101010",
        "head_offset": 6,
        "read": 1
      },
      {
        "step": 714,
        "pos": -14,
        "word": "0001001010111",
        "head_offset": 6,
        "read": 1
      }
    ],
    "head_offset": 6
  },
  "samples": [
    {
      "step": 1000000,
      "state": "A",
      "dir": "L",
      "pos": 404,
      "lo": -496,
      "hi": 608,
      "span": 1105,
      "ones": 670,
      "one_run_histogram": {
        "1": 145,
        "2": 72,
        "3": 69,
        "4": 31,
        "5": 10
      },
      "distinct_12mers": 523,
      "dp_k12_chars": 880
    },
    {
      "step": 10000000,
      "state": "D",
      "dir": "L",
      "pos": 1412,
      "lo": -496,
      "hi": 2664,
      "span": 3161,
      "ones": 1973,
      "one_run_histogram": {
        "1": 381,
        "2": 196,
        "3": 200,
        "4": 119,
        "5": 22,
        "6": 1,
        "8": 1
      },
      "distinct_12mers": 652,
      "dp_k12_chars": 2277
    },
    {
      "step": 100000000,
      "state": "B",
      "dir": "L",
      "pos": 7968,
      "lo": -496,
      "hi": 8970,
      "span": 9467,
      "ones": 5413,
      "one_run_histogram": {
        "1": 1061,
        "2": 688,
        "3": 728,
        "4": 123,
        "5": 49,
        "6": 2,
        "7": 1,
        "8": 3,
        "12": 1
      },
      "distinct_12mers": 878,
      "dp_k12_chars": 6830
    },
    {
      "step": 1000000000,
      "state": "D",
      "dir": "L",
      "pos": 12638,
      "lo": -496,
      "hi": 29514,
      "span": 30011,
      "ones": 19605,
      "one_run_histogram": {
        "1": 3574,
        "2": 1529,
        "3": 1817,
        "4": 1588,
        "5": 182,
        "6": 25,
        "7": 3,
        "8": 7,
        "10": 1,
        "11": 1,
        "12": 1
      },
      "distinct_12mers": 1146,
      "dp_k12_chars": 20922
    }
  ],
  "local_window_runs": [
    {
      "state_before": "C",
      "state_after": "C",
      "head_before": 0,
      "head_after": 1,
      "window_start": -5,
      "word_before": "001100",
      "word_after": "111010",
      "steps": 21,
      "observed_record_gaps": 518,
      "reads_stay_inside_window": true
    }
  ],
  "diagram": {
    "path": "img/space-time-labeled.svg",
    "sampling": "every 1000 steps through 2,000,000",
    "cols": [
      -496,
      1042
    ]
  },
  "preflight": "astra/bouncer-triage/preflight.json (root supplied; current open PRs, saved sheet/Discord, exact conjugacies checked)",
  "next": "Priority decision before funding a word-transducer/return-map investigation. No invariant or Coq proof attempted.",
  "rank": 465,
  "class_sheet": "Bouncer + Chaotic Edge",
  "class_guess": "Bouncer with unresolved word dynamics",
  "confidence": "low",
  "summary": "A simple right-edge extension is separated by irregular returns; no complete word model is known.",
  "mechanism": [
    "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."
  ],
  "diagrams": [
    {
      "mode": "every:1000",
      "png": "img/every-1000-through-2e6.png",
      "html": null,
      "steps": 2000000,
      "caption": "Sampled sweeps and the expanding visited span",
      "title": "First two million steps",
      "why": "Time increases downward. Compare the expanding right boundary with the opposite boundary.",
      "primary": true,
      "start": "blank",
      "rows": "every 1000 steps, from 0 through 2000000; each sampled row is 2 pixels high",
      "window": "cells -496..1042, 1 px = 0.5 cells; two raster pixels per cell",
      "legend": "white = 1, slate = 0 or unvisited, red = A, orange = B, blue = C, green = D, magenta = E, cyan = F",
      "style": "bbchallenge-explore"
    }
  ],
  "history": null,
  "rules": [
    {
      "name": "21-step finite window",
      "from": "state C, head 0; cells -5..0: 001100",
      "to": "state C, head 1; same cells: 111010",
      "steps": "21",
      "cases": "One exact finite input; all reads stay inside the specified window. No global closure claim.",
      "validated": {
        "instances": 1,
        "passed": 1
      },
      "source": "manual"
    }
  ],
  "template": {
    "file": null,
    "module": null,
    "machine": null,
    "diff": null,
    "applies": "unknown",
    "note": "No complete configuration family or reusable proof template has been identified."
  },
  "strategy": "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.",
  "risks": [
    "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."
  ],
  "discord_check": null,
  "stats": {
    "simulated_steps": 1000000000,
    "cells": 30011,
    "nonzeros": 19605,
    "growth": "Visited span grows mainly right in the sampled blank-tape run."
  },
  "status": "CHECKPOINT_A",
  "status_reason": "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.",
  "checkpoint_questions": [
    {
      "text": "Prioritize a bounded word-transducer/return-map investigation, or leave this candidate at observation?",
      "figs": [
        0
      ],
      "kind": "decision",
      "answer": "defer",
      "note": "Follow your recommendations for the 5",
      "date": "2026-10-14"
    }
  ]
}