Framework irreducible
v352_framework_irreducible.py · core
Read the original description and evidence links
The framework reduction -- the deepest answer to 'the inputs are not axioms, they are back-determined'. [E] P2 (g_car=5) FORCED three ways (v6): rank-fill, Coxeter-match (g_car=max prime of h(E8)=30), Pascal. [E] P1 (c3=1/(8pi)) FORCED: c3 is the boundary Gauss-Bonnet coefficient (v216/v342), the 8 over-determined four ways (8=rank E8=h(D5)=phi(30)=det R, v54/v6); only pi is non-forced (the boundary transcendental). [E] the E8 hull is forced (unique even unimodular rank-8, v83/v154). [E] so the ONLY irreducibles are the FRAMEWORK (a discrete reflection-positive boundary with a finite Clifford carrier) + pi -- the precise content of 'the inputs are not axioms'. [O] the framework is the META-AXIOM (not math-reducible, the foundational stance, tested by its consequences not proved). TFPT's true input is ONE framework + pi.
Read the original Python source- Linked claims