Skip to main content
Document 0 of the TFPT 5.4 setReading guide
TFPT 5.42026-07-283.02 MBSHA-256 09bbba9fe7d5
Paper 0Reading guide

Topological Fixed-Point Theory (TFPT) — A Discrete Compiler for the Constants of Physics

Reading guide, status assessment, and the dependency DAG

The entry document. From two axioms — the seam constant c₃ = 1/(8π) (P1) and the carrier rank g_car = 5 (P2) — TFPT constructs a discrete compiler for the Standard-Model skeleton (gauge group, three families, hypercharges, the flavor matrix), with E₈ (D₅ ⊕ A₃ + μ₄ ⇒ E₈) as the consistency checksum. The algebraic core is machine-checkable and the dimensionless constants follow as fixed points; physical readouts (scales, masses, inflation, gravity, cosmological transfers) run through explicitly named, status-typed bridges (v_geo, G_net, F_transfer), not as free outputs. This note is the reading guide: the architecture, the predictions, the dependency DAG, and the single proof ledger.

Inputs
  • The two axioms {c₃, g_car}; everything else is a consequence.
Contribution
  • States the compiler closure, the two-engine picture, the dependency DAG, the proof ledger, and the live experimental tests in one place.
Not claimed here
  • No new physics is introduced here — the introduction is a map. Load-bearing derivations live in the companion documents.
Falsification surface
  • Fails as a guide if the dependency order is misstated, if a status marker disagrees with the ledger, or if a claim is promoted past the grade the companion document carries.
Highlights
Axioms2c₃ = 1/(8π) and g_car = 5 — the rest is a consequence
CompilerZ₃₀ = 2·3·5Coxeter–cyclotomic generator behind every sector
Free primitiveπThe one genuinely irreducible continuous number
Documents9Introduction + 5 core papers + Appendix H + Origin Theory + contracts

Key formulas

  • Compiler closure
    {c3,gcar}D5A3+μ4E8\{c_3, g_{\mathrm{car}}\} \Rightarrow D_5 \oplus A_3 + \mu_4 \Rightarrow E_8
    Two axioms build the E₈ audit hull; the SM is read off by projection.
  • Bootstrap loop
    E8 closuregcar=5,  8=rankE8E_8\text{ closure} \Rightarrow g_{\mathrm{car}}{=}5,\ \ 8 = \operatorname{rank}E_8
    Inputs and output are mutually locked — only π stays irreducible.
  • Reduction in one line
    247pages2 inputs+1 machine247\,\text{pages} \rightsquigarrow \text{2 inputs} + \text{1 machine}
    The number of independent structural assumptions drops to two.

Two inputs, one machine

Two numbers go in — a boundary number 1/(8π) and a five-slot carrier — and the discrete Standard-Model core, the dimensionless constants and several scale readouts come out. The dashed loop is the point: the machine reproduces the very two numbers it started from, so the discrete core is overdetermined rather than fitted.

{c3,gcar}    D5A3  μ4  E8    (SM, constants, scale grammar)\{c_3, g_{\mathrm{car}}\} \;\Rightarrow\; D_5 \oplus A_3 \xrightarrow{\;\mu_4\;} E_8 \;\Rightarrow\; (\text{SM},\ \text{constants},\ \text{scale grammar})

The master story is two engines

Read from the two axioms, the theory factorises into exactly two engines: a discrete closure (from g_car = 5) that builds E₈ and the SM packet, and a boundary dressing (from c₃) that produces the seed, α⁻¹ and the scale grammar. Gravity is not a third block — it is the geometry channel of Engine 2.

Engine 1: gcar=5E8(Nfam,Ωadm,b1,R)\text{Engine 1: } g_{\mathrm{car}}{=}5 \to E_8 \to (N_{\mathrm{fam}}, \Omega_{\mathrm{adm}}, b_1, R)
Engine 2: c3=18π(u=φ0,α1,ξ,Λ,H0)\text{Engine 2: } c_3{=}\tfrac{1}{8\pi} \to (u{=}\varphi_0, \alpha^{-1}, \xi, \Lambda, H_0)

The compact status formula

TFPT 5.4 closes the discrete compiler, the algebraic SM readout, the EM fixed point, the admissible gapped IR sector and the R + R² spectral-action shadow. It does not yet certify a strict physical TOE end-to-end (the seam keystone is closed only modulo a cited published theorem). The live residual is three named interfaces: one dimensionful scale anchor v_geo [O], the metric-sector inclusion G_net (route split 2026-07-22: MMST route SEAM.EQUIV.MMST.01 [C] closed modulo cited theorems, twistor route SEAM.EQUIV.TWISTOR.01 [O], parent SEAM.EQUIV.01 [O] as an unconditional claim), and the typed runnable transfer suite F_transfer (v371–v375). The keystone's 128-spinor extension leg is now re-founded on the peer-reviewed crossed-product package (v469, Longo–Rehren/Böckenhauer/KLM), with the realisation input reduced to invariant level — SEAM.EQUIV.01 stays [O]. The historical labels (U_wall)/(G_metric)/(F_frontier) are kept only for ledger continuity.

compilerclosed  admissible IR physicsconditional (RP, gap)  strict physical TOEopen\underbrace{\text{compiler}}_{\text{closed}}\ \Big|\ \underbrace{\text{admissible IR physics}}_{\text{conditional (RP, gap)}}\ \Big|\ \underbrace{\text{strict physical TOE}}_{\text{open}}
Rest=vgeoGnetFtransfer\text{Rest} = v_{\mathrm{geo}} \oplus G_{\mathrm{net}} \oplus F_{\mathrm{transfer}}

The anchor: one number a = (1,1,2)

The two axioms are not even independent: they are the elementary symmetric polynomials of the single parabolic anchor a = (1,1,2), and its power sums generate the big Lie data directly. The inputs collapse to the anchor plus the lone continuous primitive π. And a is itself half-forced: three positive integers summing to 4 admit exactly one partition, {1,1,2}, so g_car = e₂ = 5 and |Z₂| = e₃ = 2 are arithmetic corollaries of the four marks given the weight typing — machine-checked with all negative controls (v491, sharpening v53); the residual is the weight-typing postulate, and P2 stays the declared axiom. The typing itself is now hardened (v499): given the four marks, rank 3, the cusp class and unitarity (U), the Deligne canonical extension of the flavor connection has deg E = −4 (residue traces) and Mehta–Seshadri stability forces h⁰(E) = 0, so integrality (Birkhoff–Grothendieck), positivity and the sum 4 are theorems — the residual shrinks to the module identification plus (U), both [C]; and that module-identification rest is now ONE residual with the QGEO modulus rest (the order-4 clock = the Coxeter/cusp-class carrier datum; v503, QGEO.EMERGE.LIGHT.01, no marker moves). That common residual is itself reduced to ONE alignment bit — the collar deck central in the mark-D₄; the clock's ORDER is fermionically forced, U² = (−1)^F exactly (v506, SEAM.CLOCK.RIGIDITY.01, markers unchanged) — and the bit is no tautology: the deck's CLASS is derived (every mark-free collar deck is a half-period translation of the seam double), only its POSITION stays the [C] input (v507, SEAM.BIT.ORIGIN.01, markers unchanged). The freedom theorems (v510, SEAM.BIT.FREEDOM.01) type that position half as TOPOLOGY — the covering deck is free on the seam circle, the edge class is excluded — so the bit reduces to the square-modulus datum τ = i alone; and the flag-transitivity web (v512, SEAM.TAU.FLAG.01) gives that datum its sharp DISCRETE form: bare mark-transitivity is automatic for every free-circle configuration (the pair-exchanging V₄; no local jet sees the side bit), while FLAG transitivity (marks AND their two sides indistinguishable, V₄ → D₄) ⟺ τ = i — a 13-fold exact equivalence web whose negation is concretely measurable (odd-doublet split (2/π)ln cot(δ/2) ≠ 0); free OS positivity is since documented as the EIGHTH side-blind test (v521): the bit is not derivable from free RP/Θ existence and remains genuine discrete input. The bit has since survived TEN side-blind derivation attacks on that scoreboard — free RP/Θ (the eighth, v521), the exhausted Wick-computable free-plus-twist state class (the ninth, v525) and the first genuinely interacting seam toy (the tenth, v529) — and is now physically DEFINED as the twist-class choice: facets #14/#15 extend the web to 15 exact equivalences (both directions each), the flip-axis fraction is a gauge-robust order parameter (O = 1/2 at m = 4, 0 elsewhere), and its η holonomy is in principle interferometrically readable (v528, SEAM.BIT.TWISTCLASS.01; the bit remains formal input — a definition replaces no derivation, no marker moves). Since the straddle round there is also the first POSITIVE selection datum (v534, SEAM.STRADDLE.CONE.01): reflection positivity, imposed on the interacting mark family, keeps exactly ONE member alive — δ = π/2 with positive coupling, the same member that carries the twist-class order parameter (toy-level evidence for a dynamical origin, not a derivation, no marker moves). The consolidated reduction state (2026-07-23): the compiler's dimensionless inputs reduce to four marks (derived from P1-side topology), one discrete symmetry-lift bit — the twist-class choice (flag transitivity ⟺ τ = i; equivalently the clock / the CM-fixed half-period / the non-split extension class on the free seam circle) — and π — a reduction state, not an abolition of the axiom.

e1(a)=4=μ4,e2(a)=5=gcar,e3(a)=2=Z2e_1(a)=4=|\mu_4|,\quad e_2(a)=5=g_{\mathrm{car}},\quad e_3(a)=2=|\mathbb{Z}_2|
c3=12e1(a)π=18π,R(E8)=p1p2p3=240c_3 = \frac{1}{2\,e_1(a)\,\pi} = \frac{1}{8\pi}, \qquad |R(E_8)| = p_1 p_2 p_3 = 240

TFPT in the light of algorithmic physics

The compiler framing sits in the Zuse–Schmidhuber–Wolfram lineage — physics as the output of a short computation. TFPT shares three instincts with it: minimal description length as the selection principle (no load-bearing free number, only π), deterministic resource-bounded generation (a chain of exact identities in about a second, not a search over models — the spirit of Schmidhuber's Speed Prior), and compressibility as the aesthetic (choosing E₈ is choosing the icosahedron, the shortest-to-describe object). It diverges on three points: TFPT forces one program instead of a measure over all universes, its description language is algebraic (Lie/lattice/VOA) rather than Turing bit-strings, and — the load-bearing difference — it is falsifiable, freezing dated kill-tested predictions where the algorithmic-TOE lineage stays metaphysics. This is positioning, not a new claim: it moves no status marker.

shortest programKolmogorov / Solomonoff prior;TFPT=one forced fixed point\text{shortest program} \Rightarrow \text{Kolmogorov / Solomonoff prior};\quad \text{TFPT} = \text{one forced fixed point}
T(2,3,r): detCartan=3,2,1,0,1  (E6,E7,E8,E^8,E10)T(2,3,r):\ \det\mathrm{Cartan} = 3,2,1,0,-1\ \ (E_6, E_7, E_8, \hat{E}_8, E_{10})

Key formulas at a glance

  • Compiler closure
    {c3,gcar}D5A3+μ4E8\{c_3, g_{\mathrm{car}}\} \Rightarrow D_5 \oplus A_3 + \mu_4 \Rightarrow E_8

    Two axioms build the E₈ audit hull; the SM is read off by projection.

  • Bootstrap loop
    E8 closuregcar=5,  8=rankE8E_8\text{ closure} \Rightarrow g_{\mathrm{car}}{=}5,\ \ 8 = \operatorname{rank}E_8

    Inputs and output are mutually locked — only π stays irreducible.

  • Reduction in one line
    247pages2 inputs+1 machine247\,\text{pages} \rightsquigarrow \text{2 inputs} + \text{1 machine}

    The number of independent structural assumptions drops to two.

Cite this document

A reproducible citation pack: the BibTeX entry plus the verifiable release facts. The PDF SHA-256 pins the exact bytes; the source and ledger are public.

BibTeX
@misc{tfpt_introduction_2026,
  title        = {Topological Fixed-Point Theory (TFPT) — A Discrete Compiler for the Constants of Physics},
  author       = {Hamann, Stefan and Rizzo, Alessandro},
  year         = {2026},
  howpublished = {\url{https://www.fixpoint-theory.com/papers/introduction}},
  url          = {https://www.fixpoint-theory.com/papers/introduction.pdf},
  note         = {TFPT 5.4, 2026-07-28, PDF SHA-256 09bbba9f86e60c53c16d6dad84c64bfdccccd2bcc38d3d0cd413436ef98de7d5}
}
Authors
Stefan Hamann, Alessandro Rizzo
Version
TFPT 5.4
Date
2026-07-28
Claim status
Reading guide
PDF SHA-256
09bbba9f86e60c53c16d6dad84c64bfdccccd2bcc38d3d0cd413436ef98de7d5