{
  "tm": "1RB0RF_1RC1LB_1LD1RE_1LB0LD_1RF0RC_1RA---",
  "label": "W5-2",
  "status": "CRYPTID_CANDIDATE",
  "stage": "observe",
  "updated": "2026-10-14",
  "confidence": "med",
  "reason": "Observe done. The mechanism is understood: these are SOC_2_5_v1.v TM10's macro rules, every TM10 lemma except ROv3_0/ROv3_1 compiles for this string, and the rules were re-validated on the TM. From blank every cycle is LOv, RC1_Ov_0, an R4 chain, RC4_Ov_0, giving an explicit map (L,x) -> (L',x') on the left-overflow configurations cfgL(L,0,2x+1). The run leaves this cycle only if every 1-bit of x is at an odd position. Then the chain empties and TM10's ROv3 (A reads 1) comes up, and with A1 = 0RF that can halt: the TM10-invariant configuration cfgL(8,0,17) halts at step 10,189,718, so TM10's P is not an invariant here. All 20,000 cycles computed (L to 172,193) stay normal, and the even-position 1-bits grow about 0.36 per cycle, so heuristically it never halts. But the condition is about the binary digits of an exponentially growing orbit, and no invariant is known: ground rule 6. The scout's near-port premise is wrong, because ROv3_0/ROv3_1 are false here, not just unproved.",
  "siblings": [],
  "sibling_note": "No other start or mirror of this table is on the 740 or 778 lists (starts B..F checked by canon), and it is a singleton in the 1590 equivalence file. Upstream proves A1-variants of the table (SOC_2_5_v1.v TM8/9/10/11/12/14/15/18/19, A1 in {1RD,1LB,0LB,1LE,0RE,1LA,0LE,1LC,0RC}), but none with A1 = 0RF.",
  "holdout_line_740": 409,
  "holdout_line_778": 436,
  "upstream": "Nearest proof: SOC_2_5_v1.v Module TM10 (1RB0LB_..., A1 = 0LB), a hand proof with cfgL/cfgR/cfgR1/cfgR3/cfgR4 and invariant P. Both orbits avoid R3 in 20,000 macro events, but TM10's proof covers R3 because TM10's ROv3 lemmas hold there. No claim in data/discord or data/sheet (sheet: Shift-overflow counter, no status).",
  "priority_call_answered": "Cryptid-like: halting needs some cycle's x to have all 1-bits at odd positions. Park it, or fund one 2 h stage to formalize the reduction in Rocq ('no cycle empties the chain -> ~halts tm c0') and search for a digit invariant?",
  "parked": "Dennis 2026-10-14: park"
}