Skip to main content
Back to the connections

Follow a result back to its evidence.

Choose a result, inspect its assumptions, then run the calculation that supports it. Each check answers a specific question. The original status and the scope of that answer stay attached.

Start with the E₈ construction.

The first module builds the lattice explicitly. It checks the glue, constructs its 240 roots and tests the lattice basis. You can read the source before running it.

Question
Does the explicit construction give the even, unimodular E₈ lattice?
What is tested
Shared ℤ₄ discriminant data; glue norms 5/4 + 3/4 = 2; 240 roots of squared length 2; an integral, even basis with determinant 1.
Read the Python source

Python runs in your browser using Pyodide. The first run downloads the runtime. Its output appears in the existing verification viewer, including any failure and the local reproduction command.

This is a mathematical lattice check. Identifying that lattice with a physical system requires additional arguments and retains its own status.

Find the source behind a check.

The dated Python suite record includes four shards on each of Python 3.11 and 3.12. Read the job logs for the recorded run. The entries below describe what the modules check and link to their evidence.

Open the 6 November 2026 Python suite run

Search all 707 registered Python modules by subject, filename, claim or source section. This catalogue records source presence and links. It does not report a new execution or a passing result for every module.

707 matching modules · showing 81–100

Koide attractor splitting

v82_koide_attractor_splitting.py · frontier

Read the registered purpose, outcome and evidence links

Koide attractor FORCED, not postulated: the branch-preserving map fixing q=2,5 is unique, and its multiplier (2/3)⁶ = the established transfer gap λ₂ (v54/56) ⇒ 3 Koide postulates → 1; + splitting trichotomy disc 81/49/40 (clean split is non-generic)

Read the original Python source

E8net holomorphic uniqueness

v83_e8net_holomorphic_uniqueness.py · frontier

Read the registered purpose, outcome and evidence links

closes red-team Target A residual 1: #primaries=det(Cartan) ⇒ holomorphy (E8 det 1) is necessary AND sufficient — (D8)₁=SO(16)₁ shares c=8 but has 4 primaries; E8 the unique even-unimodular rank-8 lattice (mass=1/|W(E8)|). A drops 3→2 residuals; + Target B reduced to the half-spinor midpoint K=(g−1)/2

Read the original Python source

Frozen registry

v84_frozen_registry.py · registry

Read the registered purpose, outcome and evidence links

blind-prediction registry FROZEN 2026-06-09: every dimensionless prediction of record at 25 digits, re-derived from the two axioms each run (formula↔value lock); exactly ONE θ₁₂ prediction of record = 1/3−φ₀/2 = 0.306747, variants typed as derived (look-elsewhere machine-excluded); r/n_s only as N★ bands

Read the original Python source
Linked claims

Master cover

v85_master_cover.py · registry

Read the registered purpose, outcome and evidence links

Master-Cover Theorem: GL(2) covariance ⇒ exactly ONE anchor-block double cover up to Möbius reparametrisation (disc = N_fam⁴·det G²); the −8/3 = −rank E₈/N_fam rung = carrier − one transport period; μ₄ is NOT a 4:1 cover (honest negative); branch trace fixes only the scalaron scale

Read the original Python source
Linked claims

Nstar reheating

v86_nstar_reheating.py · registry

Read the registered purpose, outcome and evidence links

N★ from the theory's own scalaron mass + standard reheating: Γ=128 GeV, T_reh=9.6×10⁹ GeV, N★(0.05/Mpc)=51.4 ⇒ n_s=0.9611, r=0.0045 [P] — recorded honestly: A_s coherence disfavours the slow Higgs channel (−11.4σ); the frozen band [50,60] stays the surface of record

Read the original Python source
Linked claims

Bulk uniqueness reduction

v87_bulk_uniqueness_reduction.py · registry

Read the registered purpose, outcome and evidence links

red-team Target A = ONE residual: holomorphy ⇒ unique 2D bulk (LR/KLM/BKLR); machine contrast: SO(16)₁ admits SIX modular invariants (incl. both E₈-extension pairings) ⇒ non-holomorphic c=8 bulk is multiply ambiguous

Read the original Python source
Linked claims

Cp phase audit

v88_cp_phase_audit.py · registry

Read the registered purpose, outcome and evidence links

Target D follow-up: frozen δ=π/3+3λ² survives at +0.98σ vs γ_PDG; audit (not promoted): data sit 0.07° from the alternative π/3+2λ² — decision at σ_γ ≤ 0.96° (LHCb/Belle II); J-inversion flagged magnitude-contaminated

Read the original Python source
Linked claims

Carrier index lemma

v89_carrier_index_lemma.py · registry

Read the registered purpose, outcome and evidence links

Carrier Index Lemma: KLM μ_A=[B:A]²μ_B ⇒ Jones index [(E₈)₁:(D₅)₁×(A₃)₁] = 4 = |μ₄| — the glue-group order IS the inclusion index; all three glue sectors are h=1 currents (248=45+15+64+64+60); holomorphy FOLLOWS from μ-additivity 16/4²=1 ⇒ Gate A ⇔ an index computation

Read the original Python source
Linked claims

Conical defect chain

v90_conical_defect_chain.py · registry

Read the registered purpose, outcome and evidence links

Fursaev–Solodukhin factor DERIVED, not imported: smoothed-cone Gauss–Bonnet ∫K = 2π(1−α) exactly (smoothing-independent), codim-2 lift 4π(1−α)A, replica ⇒ S = 4πkA; with k=c₃/2: S = A/4 ⇔ c₃ = 1/(8π) (sympy-solved, unique). The Seam–Horizon residual is isolated to one step: seam determinant ⇒ EH form

Read the original Python source
Linked claims

Spine tetrahedron

v91_spine_tetrahedron.py · registry

Read the registered purpose, outcome and evidence links

Spine tetrahedron {2,3,4,5} = {e₃(a), p₀(a), e₁(a), e₂(a)}: edges {6,8,10,12,15,20}, faces {24,30,40,60}, volume 120 = |R⁺(E₈)| = 5!; 240 = |μ₄|·|E(K₄)|·|E(K₅)| with K₆ negative control; dual cuts typed as tautological presentation; sub-grammar honestly incomplete (7,16,41,48,240,248 outside)

Read the original Python source
Linked claims

Glue uniqueness

v92_glue_uniqueness.py · registry

Read the registered purpose, outcome and evidence links

Glue uniqueness: exhaustive classification of the carrier discriminant form (Z₄×Z₄, q=(5x²+3y²)/8) — exactly two Lagrangian glues (the two chiralities, swapped by spinor conjugation = sheet Z₂) and exactly one halfway extension whose induced form IS the D₈ form: tower carrier(μ=16) → SO(16)₁(μ=4) → E₈₁(μ=1), nothing else; Gate A = the bare index statement. Now also Lean-formalised (GlueUniqueness.lean, AUDIT: PASS)

Read the original Python source
Linked claims

Koide relaxation toy

v93_koide_relaxation_toy.py · registry

Read the registered purpose, outcome and evidence links

Koide relaxation toy (P2 narrowed): basin lemma — every physical Koide configuration lies in the attractor basin (Q∈[1/3,1] → q∈[1,3]: attractor in, repeller out); exact contraction rate (2/3)⁶ along the physical trajectory; source at ρ = −φ₀/24 (one seed quantum before the branch point); honest negatives: pole ≠ integer F-steps from source (t=2.84 ⇒ continuous generator missing), φ₀/24 stays [P]

Read the original Python source
Linked claims

Sheet diamond

v94_sheet_diamond.py · registry

Read the registered purpose, outcome and evidence links

Sheet diamond: R, K, L, F are four points of ONE surface M(s,t) = R+Q·diag(s,t,t) (mass pencil = the cut (1+x,x−1); diagonal cut reproduces v85's non-square disc 153 — built-in negative control); winding line det B = 2·det for ALL s with the s=6 triple lock; cofactor normal (5,−9,6) selects generation 1; quark-ratio integers canonicalised as left/right Plücker norms of K (11, 26); reality threshold corrected to s*≈2.83; spine-quotient firewall rejected (16/7, 7/6, 5/6, 8/7 counterexamples)

Read the original Python source

Centered diamond

v95_centered_diamond.py · registry

Read the registered purpose, outcome and evidence links

Centered flavor diamond: one center + two axes — Q = U+V, R/L = C∓U (winding = pure family charge, Spec U = {3,0,0}), K/F = C∓V (sheet, Spec V = {0,1,2} = the cusp class); center: det C = 14, SNF (1,1,14), ΣC = 31 = 2^g−1 (the IR gap-bound numerator), Pl_R(C) = 7·(2,3,1) on the same ray as Pl_R(L) = 10·(2,3,1); the G₂ reading stays audit-typed, not promoted

Read the original Python source
Linked claims

Branch kernel selection

v96_branch_kernel_selection.py · registry

Read the registered purpose, outcome and evidence links

Branch-kernel selection (P1 unblocked): at each branch point the anchor block is RANK 1 with canonical integer kernels (Koide: w=(2,2,−7), v=(2,2,−3); carrier: w = the democratic vector 1, v=(1,1,−6)); collapse lemma — rank 1 forces P(x₀)·w ⊥ span{1,a} ⇒ ∝(−1,1,0): up = −down (the deck-odd pair), LEPTON pairing = 0 (leptons sit ON the ramification; Koide is leptonic); sector zero ladder: lepton zeros = the two branch points, up = −3/2 doubly (the v85 GL(2) rung), down = 0 (=K) and −9/5; anchor-placement controls (2,1,1)/(1,2,1)

Read the original Python source
Linked claims

Sheet conjugation bridge

v97_sheet_conjugation_bridge.py · registry

Read the registered purpose, outcome and evidence links

Sheet-conjugation bridge (P1 → one [P]): the cusp negation (0 fixed, 1/3↔2/3 on the Q₊ eigenspaces) has a UNIQUE anchor-compatible integer realisation T_A=[[0,1,0],[1,0,0],[2,−2,1]] (det −1; the two alternative pairings rejected); a = e₂+e₃ — the anchor IS the conjugation-symmetric vector; T_A = −1 on R³/span{1,a} exactly like σ₁₂ (one deck action); ⟨T_A,Σ⟩ = the v69 D₄; sheet-index lemma: generation-μ₄ vs homology-μ₄ intertwiner dets always EVEN, min |det| = 2 = |Z₂|; remaining [P]: Q₊ grading = A₃ discriminant grading

Read the original Python source
Linked claims

Discriminant dictionary

v98_discriminant_dictionary.py · registry

Read the registered purpose, outcome and evidence links

Discriminant dictionary DERIVED (P1 closed modulo GATE.QGEO): the generation space carries an INTEGER μ₄ — G = T_A·Σ acts on the cusp basis as G·e₁=−e₁, G·e₃=e₂, G·e₂=−e₃ (the v69 B₁⊕E decomposition realised integrally); the cusp-0 line IS the self-conjugate Z₄-class-2 line, the swapped cusp pair IS the conjugate class pair {1,3}; T_A G T_A⁻¹ = G⁻¹ (conjugation k→−k), q(1)=q(3)=3/8 equal, q(2)=1/2 fixed; reflection classes = glue-swap (det −1) vs glue-fix (det +1) parities ⇒ P1 carries NO separate [P] — the residual folds into the one existing Q-geometry gate

Read the original Python source
Linked claims

Koide flow time

v99_koide_flow_time.py · registry

Read the registered purpose, outcome and evidence links

Koide flow time (P2 sharpened; corrects the ROBUSTNESS of v93's negative (i)): canonical generator dq/dt = (Δ/N_fam)(q−2)(q−5) = (Δ/N_fam)·det B(q), time-1 map = the v82 Möbius F (e^−Δ = (2/3)⁶ exact) [I]; the non-integrality of t = 2.84 is DATA-FRAGILE — Q crosses 2/3 at +0.43σ(m_τ), t passes every integer ≥ 3 within +0.5σ [N]; conditional steps (registry untouched): n=2 excluded (−2.9σ), n=3 = N_fam steps ⇒ m_τ = 1776.9427 MeV (+0.14σ), decision at σ(m_τ) ~ 0.01 MeV (Belle II) [P]; ln(46080) scale reading destroyed by negative controls (look-elsewhere firewall)

Read the original Python source
Linked claims

Numerology null mc

v100_numerology_null_mc.py · registry

Read the registered purpose, outcome and evidence links

Numerology null test (look-elsewhere corrected) [N]: exact census of the FULL declared formula grammar (provably containing every scored TFPT formula) over the 13 scored frozen-registry observables with conservative data windows ⇒ joint formula-fishing probability ∏pᵢ = 10⁻²⁵·⁸, robust to budget/window variation; 2×200k Monte-Carlo pseudo-theories reach at most 5/13 hits vs TFPT 13/13; power controls: φ₀ ±1%/10% collapses TFPT's own scorecard to 9/6, data shuffle to mean 1.2; all 94 500 F_U(1) variants root-solved — exactly ONE hits the 4×10⁻⁸ CODATA window ⇒ total ≤ 10⁻³⁰·⁷ (~102 bits), CONDITIONAL on the declared grammar (a null-model rejection, never 'certainty'); complementary to the v84 freeze

Read the original Python source
Linked claims

Different evidence answers different questions.

A numerical calculation, a formal theorem and an experimental comparison carry different kinds of information. Follow the source appropriate to the claim.

Python calculations
Inspect the algorithm, its inputs and its negative controls. Run a browser compatible module here, or use the repository for the complete environment.Browse Python sources
Formal mathematics
Read the actual Lean statement and its assumptions. The carrier formalization has a defined mathematical scope.Inspect the Lean formalization
Independent implementation
The Wolfram implementation checks algebraic results through a separate computational path. The recorded runs report 116/116 base checks and 623/623 extension checks. This is distinct from external experimental replication.Read the Wolfram implementation
Physical comparison
Read each prediction with its freeze, conditions and failure criterion. A passing mathematical check does not decide the experimental comparison.Open the prediction register

What Lean proves and what it assumes.

The public source registry indexes 69 Lean files and 908 declarations. The declarations include definitions, interfaces and theorems. Each theorem has its own hypotheses.

Carrier rank
The Pascal carrier equation has the unique solution g = 5.Read the Lean statements
Hypercharge
The specified 3+2 carrier has the stated diagonal charges, zero trace and carrier polynomial.Read the Lean statements
Finite lattice glue
The isotropic glue for the stated discriminant form is unique up to sheet exchange. The carrier index arithmetic is exact.Read the Lean statements
Finite code structure
The Hamming code properties are checked on the explicit finite code.Read the Lean statements
Conditional clock theorem
Mark locality implies clock invariance in the given model. The physical seam must still be shown to satisfy mark locality.Read the Lean statements
Conditional continuum interface
The reduction uses named scaling limit and identification hypotheses. Its Lean statement records those inputs.Read the Lean statements

The CI core checks theorem signatures and declared axiom dependencies. Named seam assumptions remain explicit in the corresponding proofs. The physical identification of the original interacting source, full 3+1D dynamics and quantum gravity have separate requirements.

Run the same check on your machine.

From a checkout of the repository, install its Python requirements and run the first lattice module. The complete suite is a separate step.

Set up the repository

git clone https://github.com/sthamann/topological-fixed-point-theory.git
cd tfpt
python3 -m venv .venv
.venv/bin/pip install -r requirements.txt

Check the E₈ lattice

.venv/bin/python verification/v1_e8_glue.py

Read the individual checks and the final pass or fail result.

Run the registered suite

cd verification
../.venv/bin/python run_all.py

The full suite uses the dependencies and source context documented in the repository.

Repository setup and maintenance instructions

Read the current claim beside its source.

The research snapshot dated 2026-11-09 includes the active ledger, reviewed findings and registered scripts. It records source coverage and stated scope; it is not a new execution of every proof or calculation.

Trace the dependencies.

Select a node to inspect its inputs, outputs, scope and verification scripts. Browser compatible checks open the same verification viewer; native certificates provide their local command.

Explore the complete dependency graph

Keep the detailed research in reach.

The script index, figures and detailed research interfaces remain available below. This older technical overview preserves its original statements; use the current result inventory to follow later scope corrections.

Open the script index, figures and research details