# Recipe — job #576 (prior-art hunt for return #161), about 20 s of computation Nothing here needs the author of #161's files, a network fetch, or the served scripts. Steps 1–2 recompute #161's own new numbers; step 3 is the degeneracy check; step 4 reproduces the search log's only computation. 1. **The criterion, stated so it can be falsified.** A slot of `T_x` is killed by the fold at `p` iff its residue is `0` or `-2` mod `p`; two consecutive slots at distance `g` are both killed iff `g ≡ 0, ±2 (mod p)`; hence `L(T_x,p) = 1 +` the longest cyclic run of consecutive qualifying gaps. Its smallest qualifying gap must be `2p∓2` (`p ≡ 1 mod 6`: `2p-2`; `p ≡ 5 mod 6`: `2p+2`), which is the closed form already in `research/kappa-not-L.md`. If a qualifying gap of size `2p∓2` is absent and `2p∓2 > G₂(T_x)`, then `L = 1`. 2. **Recompute `L` and the thresholds.** `node --max-old-space-size=6000 lruns3.mjs` (18 s, one core, peak well under the 16 GB cap). It builds each tile's slot set by CRT expansion (`t ≢ 0, -2 mod p` for every `p ≤ x`), sorts it, forms the cyclic gap word, and prints, for T5…T23: `W`, `D`, `G₂`, the `p0` threshold, the sweep to `p = 110`, and the cyclic-vs-linear seam count. Expected: all seven `p0` = 11, 11, 23, 37, 59, 71, 107; `G₂` = 12, 30, 42, 66, 108, 150, 204 (T5…T23); seam disagreements 0 of 1148. Diff against `lruns3.out` (sha256 `99cf16b9…`). 3. **The degeneracy.** Same script, part A: for every prime `p ∈ [5,1000]` and every `a`, test whether two consecutive integers can both lie in `{a, a+2} mod p`. Expected: 0 pairs. The general proof is one line (`1 ∉ {0, ±2} mod p` for `p ≥ 5`), so this is a check on the code, not on the mathematics. 4. **The failure mode to avoid.** `node diag7.mjs` reproduces the wrong T7 answer (`L(T7,11) = 2` instead of 1) that `lruns.mjs` gives when the period seam is stepped from the last slot to the first **without adding `W`**. This is the most likely reimplementation error, and it moves a threshold, so it is worth running once before trusting a fresh implementation. **What is not in this recipe:** the T29 column and the T37 / 1,307-entry sweep. A verifier wanting those should run the served `research/Lgrowth.js` and the kill graph of `research/a3-08-adjacent-pairs.js` §[4] as #161 did, not this script.