{
 "tm": "1RB1RC_1LC1LE_1RD0RA_1LB0RA_0LD1LF_1LD---",
 "label": "W7-1",
 "status": "STUCK",
 "stage": "informal_proof",
 "updated": "2026-10-14",
 "confidence": "high on the proved parts (15 rules, counter calculus C1-C6 with the climb automaton, openings, SP, LE); open lemma O1 is a far-end race that looks pseudo-random",
 "holdout_line_740": 75,
 "reason": "proof.md revision 2 (after the skeptic review of revision 1). Fixed: both major gaps (PLUS-MERGE-1 now handled by a general merged-state lemma C3, a two-mode climb automaton C5 and both reflection branches C6; far-end 0+ rules FAR-0-PLUS-EVEN/ODD added and J3 relaxed) and all minor gaps (scaled budget f*2^u, SP smaller copy, 15 rules, (o1) wording, C1 statement, Reduction wording, (o5) count). Open, fatal: O1, no inductive invariant. J has five one-step exits and halting members (2 + 1 # 2 halts after 186 steps). New: the far end decides halting by a race whose outcome depends on history-dependent counter parities; 24 of 300 perturbations of line 75's 1e13 configuration leave the rule set between 1e14 and 1e85 steps, 22 of them at the far end (3 reach the halting + 0 +). The four real orbits meet no outside case to 1e100 (check_proof.py section I) and 1e150 (work/rev2/far.py). Cryptid-protocol stop; decision.json filed.",
 "siblings": [
  "1RB0LD_1RC1RE_1LA0LD_1LB1LC_0RA1RF_1RA---",
  "1RB0RE_1LC0RE_1LA1LD_0LB1LF_1RC1RA_1LB---",
  "1RB1RE_1LC0LD_1RA0LD_1LA1LB_0RC1RF_1RC---"
 ],
 "sibling_note": "Same table from other starts: 179 = start D (mirrored), 265 = start C, 597 = start B (mirrored); no folders created for them. At 1e10 all four have the same token list except the first field (75: 20, 597: 24, 265: 46, 179: 44); 75 and 265 share every event to 2.367e14.",
 "upstream": "No upstream proof of this table (Astra equivalence inventory 2026-10-14: none). Class file Sk1Machines.v (ccz181078/mxdys) does not contain it.",
 "next": "Waiting on Dennis (decision.json). If halt-search: run work/rev2/fastmap.py-style exact map for the four starts as far as 2 h allows, extend it to the far-end exits (gap-4 walls) if one is reached, and report any + 0 + as a halting-kill candidate.",
 "proof": "proof.md (revision 2, STUCK: O1); check_proof.py (PASS, sections A-I); data/check_proof.out; work/rev2/ (fast map, perturbation and far-end evidence); data/abstract_runs.md",
 "open_lemma": "O1: an inductive J* => J on the orbit from K(c). It needs budget clauses B1-B4 in counter terms (section 6.3) and a far-end clause certifying the safe order in every far-end window (section 6.4), which perturbation evidence shows is not a threshold condition.",
 "cryptid_flag": "far-end race (proof.md section 6.4): pseudo-random parity bits decide each far-end window",
 "decision": "decision.json (halt-search recommended: bounded exact fast-map run of the four starts toward 1e1000)"
}