{
  "tm": "1RB1RC_1LC1LE_1RD0RA_1LB0RA_0LD1LF_1LD---",
  "bucket_reason": "Cryptid-protocol stop: proof.md revision 2 fixed the two major gaps, but O1 (no inductive invariant) hinges on a far-end race decided by history-dependent parities.",
  "question": "W7-1 (lines 75/597/265/179): park it as cryptid-like, or fund a bounded 2 h halting search with the exact fast map toward 10^1000 steps?",
  "options": [
    {
      "id": "halt-search",
      "label": "Bounded halting search (2 h)",
      "consequence": "Run the four starts with the exact fast map as far as 2 h allows (target 10^1000), and extend the map to the far-end exits (gap-4 walls) if needed. If a start reaches the halting pattern + 0 +, report it as a halting-kill candidate. No Rocq work."
    },
    {
      "id": "park",
      "label": "Park as cryptid-like",
      "consequence": "Keep the 15 proved rules, the counter calculus and the evidence. No further work until someone has a far-end lemma idea."
    },
    {
      "id": "invariant",
      "label": "Another invariant attempt",
      "consequence": "Spend a proof stage on a J* with a far-end clause. Low odds: 24 of 300 perturbations of the real 10^13 configuration leave the rule set at the far end, as late as 10^85 steps."
    }
  ],
  "recommended": "halt-search",
  "rationale": [
    "No outside case to 1e100 on the four starts, but perturbed copies fail at the far end (~0.2 % per episode).",
    "Some failures halt (+ 0 +); the exact fast map reaches 1e100 in ~2 s, so a halting search is cheap."
  ],
  "evidence": [
    {
      "kind": "fact",
      "text": "proof.md revision 2, section 6.4: far-end race; 24/300 perturbations of line 75 at 1e13 leave the rule set (22 at the far end, 3 at the halting + 0 +), between 1e14 and 1e85 steps.",
      "href": "proof.md"
    },
    {
      "kind": "fact",
      "text": "check_proof.py PASS (A-I): 15 rules, climb automaton, both C6 branches; fast map = plain map to 1e11; no outside case to 1e100 on all four starts.",
      "href": "data/check_proof.out"
    },
    {
      "kind": "fact",
      "text": "The race (check_proof.py section C): 1 + 0 | 0 | 23 | 86 | 300 | L stays inside the rules for L = 1201 but meets (o4) for L = 1200; the far region's direction decides.",
      "href": "data/check_proof.out"
    }
  ],
  "effort_if_yes": "At most 2 h wall time, 2 processes, nice 10; output: a far-end history per start and, if found, the exact halting configuration.",
  "updated": "2026-10-14",
  "answer": {
    "option": "halt-search",
    "note": "",
    "date": "2026-10-16"
  }
}