{
  "scope": "Exact finite comparison of the alternating-segment transport with the abstract one-carry scheduler. The transport stores only finite level summaries; exact words are retained in a separate reference model. Immutable tuples model full persistence. Catenable sequence operations are abstract Python tuple/list operations, so this is not a bounded-record catenable implementation, scaffold, undo construction, proof-assistant formalization, or unbounded proof.",
  "smallest_overlap": {
    "before_shifts": [
      "new-1",
      "new-2",
      "old-3"
    ],
    "observed_by_three_shifts": [
      "new-1",
      "new-2",
      "old-3"
    ]
  },
  "exhaustive_forward": {
    "trace_depth": 13,
    "distinct_version_states": 16487,
    "transitions_checked": 24885,
    "maximum_markers": 2,
    "transition_case_pairs": [
      [
        "advance",
        "append_no_carry"
      ],
      [
        "advance",
        "shift"
      ],
      [
        "advance",
        "start_marker"
      ],
      [
        "idle",
        "append_empty"
      ],
      [
        "idle",
        "append_no_carry"
      ],
      [
        "idle",
        "shift"
      ],
      [
        "idle",
        "start_marker"
      ],
      [
        "stop",
        "append_no_carry"
      ],
      [
        "stop",
        "shift"
      ],
      [
        "stop",
        "start_marker"
      ]
    ]
  },
  "seeded_random_forward": {
    "seed": 20260930,
    "traces": 2000,
    "depth": 120,
    "transitions_checked": 240000,
    "maximum_markers": 2
  },
  "branching_persistence": {
    "seed": 20260930,
    "operations": 250000,
    "retained_versions": 5000,
    "maximum_markers": 2
  },
  "proof_status": "The segment-dominance invariant and transport theorem are written proofs. These finite checks corroborate their transition cases only."
}