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.

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.

1 matching module · showing 1–1

Clear filters

E8 network attractor

v298_e8_network_attractor.py · frontier

Read the original description and evidence links

E8 as a network attractor — a computational-substrate (Wolfram-program) reading of the (2,3,5)/McKay hull, on the v219 bedrock; an HONEST audit of the 'TFPT as hypergraph' idea, not a derivation. [E] the E8 Kac marks (1,2,3,4,5,6,4,2,3) are the UNIQUE attractor of the minimal lazy graph update m←(A+2I)/4·m on the affine-E8/(2,3,5) McKay graph (converges from any positive start; A·m=2m, top eigenvalue 2). [E] the spherical McKay tower terminates at E8 (2T→E6 h12, 2O→E7 h18, 2I→E8 h30=2·3·5). [E] the E-cascade is nested-subgraph coarse-graining (|roots| 240→126→72→40→20). [C] Wolfram-bridge reading: 'E8 is the universal attractor of a minimal (2,3,5) network' at the Coxeter-skeleton level. [O] the deep question (a minimal hypergraph REWRITE whose attractor is the FULL TFPT structure) stays open; NEG: φ₀=(4/3)c₃=1/(6π) is the analytic seed not an edge fraction, recovery is a 1-D Möbius fixed point not a rewrite.

Read the original Python source

Linked claims: E8.NETWORK.01
Paper sections: Source section 1 Source section 2 Source section 3 Source section 4 Source section 5

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 603/603 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

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/tfpt.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-02 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.

Find a result and its premises Download the ledger Inspect snapshot coverage

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