Cr discrete corners
v571_cr_discrete_corners.py · frontier
Read the original description and evidence links
FTR.CRDISC.01: the preregistered cross-ratio check (self-code review Priority 4 / v566 S9), executed on its DISCRETE half — the four solver corners are the in-repo Sheet-Diamond kernels J,K,C,F = M(1,t), t = −2..1 (v224, dets (2,4,14,32)), and the corpus's one canonical declared solver reading, the Koide anchor response ℓ(M) = aᵀM·1 (v183), reads (26, 35, 44, 53) on them: CR = 4/3 EXACTLY, and the fit-free reconstruction forces y_F = 53 from (26,35,44) alone — the Koide numerator is Möbius-determined by the three upstream corners (new exact cross-corner identity); honesty theorem: ℓ is affine on the path (step 9 = N²fam) and every linear functional passes — the check separates linear from nonlinear exports; negative controls with teeth: determinants fail at 28/25 as preregistered, the dominant eigenvalue fails at 1.3222; the DISCRETE half only — the continuous solver states stay open exactly as CONTRACT.F.01 fences them (9 checks, <1 s)
Read the original Python source- Linked claims