Engine 1 — discrete closure
From the five-slot carrier: the D₅ half-spinor, the family geometry A₃ = ℙ¹∖μ₄, the μ₄ glue to E₈, and the Standard-Model packet — N_fam = 3, Ω_adm = 48, b₁ = 41/10, and the residue matrix R with det 8.
Two axioms, one discrete compiler, the Standard Model.
The entry document for the TFPT 5.4 set. It does not introduce new physics — it is the reading guide. Its purpose is to state what TFPT claims, what it does not claim, how the compiler closure is organized, and where each load-bearing argument is isolated in the document set — every claim graded and resolving to a single machine-checked ledger.
The two axioms {c₃ = 1/(8π), g_car = 5}. Everything else — the gauge group, the constants, the scale grammar — is a consequence.
The compiler closure, the two-engine picture, the dependency DAG, the proof ledger, and the live experimental tests — stated in one place.
No new physics. The load-bearing derivations — the E₈ glue, the SM packet, the masses, the gravity sector — live in the companion documents.
Fails as a guide if it misstates the dependency order, if a status marker disagrees with the ledger, or if a claim is promoted past the grade its companion document carries.
The introduction makes two things explicit: what TFPT does claim at the compiler level, and what it explicitly does not promote past its grade. The split is what makes the falsification surface auditable.
Everything is generated from the seam constant and the five-slot carrier. They are not even independent: both are elementary symmetric polynomials of the single anchor a = (1,1,2), so the inputs collapse to the anchor plus the lone continuous primitive π.
Read from the two axioms, the theory factorises into exactly two engines — a discrete closure from g_car and a boundary dressing from c₃ — and the bootstrap loop that feeds the E₈ closure back to fix the inputs.
Engine 1 — discrete closure
From the five-slot carrier: the D₅ half-spinor, the family geometry A₃ = ℙ¹∖μ₄, the μ₄ glue to E₈, and the Standard-Model packet — N_fam = 3, Ω_adm = 48, b₁ = 41/10, and the residue matrix R with det 8.
Engine 2 — boundary dressing
From the seam constant: the seed u = φ₀, the electromagnetic fixed point α⁻¹, the Einstein normaliser ξ, and the exponential scale grammar 1 : 5 : 10 that gives v_EW, H₀ and Λ. Gravity is this engine's geometry channel.
The bootstrap loop
The E₈ closure feeds back as an internal consistency check: g_car = 5 is forced three ways (rank-fill, Coxeter-match, integer-glue), and the 8 in c₃ equals rank E₈ = h(D₅) = φ(30) — recovered independently. The bootstrap overdetermines the discrete core; only π stays irreducible.
Every layer of the dependency DAG carries its own grade — exact identity, lattice theorem, numerical fixed point, conditional, or open. The single source of truth is the machine-checked status ledger; if the text and the ledger ever disagree, the ledger wins.
The reviewer path is the architecture, the two axioms, the E₈ glue and the α fixed point (Doc 1), the Standard Model (Doc 2), the E₈ audit and bootstrap (Doc 3), the honest frontier (Doc 4), and the adversarial Red Team audit (Doc 5). Appendix H (horizon), the Origin Theory synthesis, the research contracts, and the safeguards discipline sit alongside.
The two axioms, the derivation map, and the D₅ × A₃ → E₈ construction
The φ₀-ladder, flavor from parabolic transport, and the worked closures
The seven E₈ slices as an audit raster, the cascade spine, the Möbius loop — and the thirty-one-step celestial/twistor route with the measure chain derived
η_B, the Higgs quartic, m_p/m_e, Koide, dark matter and quantum gravity — honest status
Targets A–E, the QFT round (F) and the seam round (G): attacking the load-bearing reductions at their weakest transitions
One seam constant c₃ = 1/(8π) as the universal horizon thermal code
The seam as a horizon, the cyclic compiler hull, and the parameter-free attractor
v_geo · G_net · F_transfer — the live residual as numbered contracts
The verification discipline — every mechanism that defends a load-bearing claim against chance, fitting and over-reading
The dependency order of the four core documents is rigid (1 → 2 → 3 → 4), with the Red Team audit (Doc 5) on top. The recommended reading order starts from the introduction and adds the four companions — Appendix H, the Origin Theory synthesis, the research contracts, and the safeguards discipline — without breaking the chain.
TFPT’s vocabulary comes from discrete mathematics and computer science; a phenomenologist looks for Lagrangians and RG flows. This Rosetta maps each TFPT term onto the orthodox concept it plays the role of — a reading aid, not a new claim.
| TFPT term | Standard QFT / mathematical reading |
|---|---|
| Compiler | A deterministic boundary → IR map (a fixed renormalization-group endpoint read off by projection), not a parameter fit. ‘Compiles’ = evaluates the unique fixed point. |
| Seam | The reflection-positive boundary / holographic screen — a Wilsonian UV boundary CFT (chiral conformal net) whose data the bulk reads off. |
| Carrier (D₅ ⊕ A₃) | The boundary field content / chiral algebra: 16 free Majorana fermions, c = 8 = 5 + 3 (a free-fermion conformal net). |
| μ₄ glue / deck | An orbifold deck transformation / simple-current (ℤ₄) extension — the standard ‘gauge a discrete symmetry’ / extension operation on a CFT. |
| Clock | The Coxeter monodromy element of W(A₃) = S₄ (order h(A₃) = 4) — the orbifold rotation generating the ℤ₄. |
| Audit hull (E₈) | An anomaly / consistency lattice — the even unimodular ‘checksum’ that the carrier must embed into. NOT a 4D gauge group (so Coleman–Mandula / Distler–Garibaldi do not apply). |
| Readout / projection | An observable extracted as an index or intersection number — the value of an operator after projecting onto the physical sector (a Wilson-line/operator VEV). |
| Microcode | The integer charge / index labels (hypercharges, Dynkin indices, Plücker coordinates) — the discrete, RG-invariant quantum numbers. |
| Plücker readout | A topological intersection / Schubert index on a Grassmannian — a discrete, scheme-independent number (e.g. cᵤ/c_d = 55/117). |
| Gap (2/3)⁶ | The spectral gap of the boundary transfer operator = the RG-irrelevance rate of the leading deformation (a Perron–Frobenius subleading eigenvalue). |
| Anchor a = (1,1,2) | The minimal generating datum — the role a renormalization scheme’s defining numbers play; its symmetric functions are (|μ₄|, g_car, |ℤ₂|) = (4,5,2). |
| F_transfer | The typed RG / threshold-matching functor: compiler source data → physical pole observable, now a runnable solver suite (Koide source→pole v371, η_B Boltzmann v372, axion relic v373, m_p/m_e via QCD/EW v374), each a typed [C] bridge with a kill test, folded into a prediction-observatory CI (v375). |
| v_geo | The one dimensionful renormalization condition — a unit choice. After setting ℏ = c = 1 a single scale must still be fixed by hand; the No-Unit Theorem proves a dimensionless compiler cannot produce it. |
| SEAM.EQUIV.01 (keystone) | The keystone, now closed modulo cited theorems (not solved): the raw reflection-positive seam state IS the holomorphic (E₈)₁ net at τ=i. The target is pinned at every computable level by an explicit lattice model (v367/v368) and the S3 stack (v376–v379, ground-state witnesses v489/v490), Lean-pinned (FORM.SEAM.MMST.01) to the published MMST/Adamo theorems; the residual is the cited continuum scaling-limit existence only (v336; extension leg on the peer-reviewed crossed-product package, realisation at invariant level, v469; stays [O]). The role Einstein’s ‘c = const’ plays — TFPT’s one irreducible structural postulate; its conformal-deck face QGEO.SYM.01 is a corollary. |
The one honest layer a physicist will scrutinise is F_transfer: the discrete kernel and the dimensionless readouts are exact, while the continuous transport that drives the source data to the physical pole is the external transfer layer — now a typed, runnable solver suite (v371–v375), explicitly [C], never sold as a derivation.
The introduction is the entry document of the TFPT 5.4 set. It states the compiler closure, the two-engine picture, the dependency DAG, the proof ledger, and the live experimental tests — with every claim graded and resolving to the ledger.