{
 "tm": "1RB0RA_1RC1RF_1LD0LC_1RA1LE_1RA0LC_---0RD",
 "bucket_reason": "Stuck after f3_first: the overflow bursts open an unbounded tower of throttle levels, and some inputs the deeper levels can receive make zone T halt. A priority call is needed.",
 "question": "Park R8, spend one research stage on the tower (the safe input language of a level plus a burst-timing lemma), or flag it as a cryptid candidate?",
 "options": [
  {
   "id": "park",
   "label": "Park",
   "consequence": "No spend. It keeps a conditional proof.md that covers m < ~236. The far-future tower and the open timing question are written up in notes.md."
  },
  {
   "id": "tower_stage",
   "label": "One research stage (2 h) on the tower",
   "consequence": "Compute the safe input language of one level as a finite automaton over the throttle head plus the BR word. Then try to show that level-1 burst timing never feeds a deeper level a B^1 to B^3 burst with a short gap. This is likely to end STUCK, because the timing is pseudo-random."
  },
  {
   "id": "cryptid_flag",
   "label": "Flag as a cryptid candidate and stop",
   "consequence": "Record R8 as probviously non-halting: the unsafe inputs need timing coincidences of about 2^-m per epoch. Formal proof work stops."
  }
 ],
 "recommended": "park",
 "rationale": [
  "BR is an exact M-type word; its gliders build K = 3 levels without end (33/33).",
  "Zone T halts on B^1 or B^3 bursts with short gaps, and deeper levels can get B^3.",
  "Excluding that needs control of pseudo-random burst timing (about 2^-m per epoch)."
 ],
 "evidence": [
  {
   "kind": "figure",
   "text": "Fig 3: the m = 14 creep. The glider leaves the middle as five B visits; a BR glider does the same at the far end and builds a new level.",
   "href": "img/creep_special_1.487e8.png"
  },
  {
   "kind": "fact",
   "text": "B^j A^n with j up to 991,164: 0 halts in 300 runs; 48 runs built a second level with K = 3.",
   "href": "data/f3/bigburst_small_e_seed11.jsonl"
  },
  {
   "kind": "fact",
   "text": "Zone T halts: T(RP; 34) on B3 A4 B3 B3 A6 B3 A4 B3 (2/200 for B^3, 15/200 for B^1).",
   "href": "data/f3/multiburst_bs.txt"
  },
  {
   "kind": "link",
   "text": "notes.md, section 'Funded stage (2026-10-10, f3_first)'",
   "href": "notes.md"
  }
 ],
 "effort_if_yes": "tower_stage: one 2 h stage of light native compute (finite-automaton search plus simulations). park and cryptid_flag: none.",
 "updated": "2026-10-11",
 "answer": {
  "option": "park",
  "note": "Dennis: apply recommendations (2026-10-12)",
  "date": "2026-10-12"
 }
}