{
 "tm": "1RB0RF_1RC0LD_1RD0RA_1LE0LC_1LB0LE_0RC---",
 "label": "B-4",
 "status": "STUCK",
 "stage": "observe",
 "confidence": "low",
 "updated": "2026-10-13",
 "reason": "Parked at observe (BEC sweep, cap 1 h). Micro rules are clean: counter pass P0/P1 (0^inf <D (011)^a (010001)^b x (010001)^c -> a+1, b+2^a, c-2^a while c >= 2^a; 80/80) and overflow O (c < 2^a -> 0^inf J (011)^(2b+2c) C>, |J| = 3a+4; 24/24). The macro level is residue-driven: each overflow leaves the counter's binary residue in a junk word J that the next cycle re-reads, and J decides whether the cycle is ordinary (n -> n+9..75) or a spurt (n -> 2n+12..24). Plateaus of 1, 1, 9, 3, 31 cycles; spurts at 1.1e7, 3.0e7, 3.3e8, 9.9e8, 1.88e10; no halt to 2e10. Not flagged as cryptid (residue map not formalized).",
 "family_note": "No 740-list siblings. eqv_1590 lines 650-652: same table from starts B and C (Eqv_v2.v tm definitions), not on the 740 list.",
 "next_goal": "Characterise J: decode the junk word as the binary digits of r = (c0 + 2^a0) mod 2^A and test whether the next cycle's (a0, k, n' - n) and the spurt are a closed function of (r, A) on all ~50 observed cycles; park for good if not."
}