{
 "tm": "1RB0RA_1LC0LF_1LE0LD_1LB---_1RA1LB_0LB0RC",
 "status": "STUCK",
 "stage": "tight",
 "updated": "2026-10-11",
 "reason": "Parked by the agreed hard stop of the funded stage 'tight' (2026-10-11): the leading-spacer recovery lemma is not proved. Proved in the stage (informally, on validated unit rules): a closed form TF of when a leading-spacer eat word keeps a t (one bit pattern per layout; exact on all 265,642 words to 13 units and 103,000 long random or constructed words), the exact word it produces (bin(C_0) t^a inc(W)[a:]), that the next eat never reaches the surviving t, and that the first unit to reach the new v = 110 unit is a C run, never the B carry. Open: the head after that C-meets-v event (no unit rule; observed real = shadow plus a head) and a bound on how many eats the head survives (observed 1-3, 0 halts in every test). Not a cryptid: tightness is an explicit congruence on the layout and halting never depends on the bits. No further stages.",
 "funded": {
  "option": "tight",
  "date": "2026-10-11"
 },
 "confidence": "med",
 "priority_call_answered": "With #29's generic size lemma proved and only the leading-spacer recovery left (true on all 265,642 test words, unproved), fund one last ~2 h stage on it with a hard stop, or park #29 as STUCK now?"
}