FQFT Series Computational Companion

Reproducible Prediction Framework, Execution Protocol & Numerical Verification Suite for Papers I–X

Spine Position

Research Root · FQFT Frontier · Computational Companion & Numerical Protocol

Institutional Authority: Global Institute of Logic & Cybernetics (GILC)
Parent Framework: Fractal Quantum Field Theory (FQFT)
Corpus Layer: Computational Provenance & Code Replication

---

1. Public Provenance Record

The reproducible computational companion to the FQFT Papers I–X series is archived and versioned for independent verification:

• Record Title: FQFT Series Computational Companion: Reproducible Prediction Framework for Papers I–X
• Archival Repository: Zenodo Public Record (Record ID: 20488566)
• Public URL: https://zenodo.org/records/20488566
• Status: Sovereign public provenance record (P1 NUMERICAL_BENCHMARK)
• Metadata Lock: Maintained under FQFT DOI Locking Protocol

---

2. Reproducibility Protocol

1. Input Parameters

Symbol	Value	Role	Source	Boundary
q	5	Ramanujan graph degree used by the FQFT computation spine.	FQFT prediction card / Paper I	Paper-internal input. Requires independent mathematical and physical review.
D*H	27.6 ± 0.3	Dimensional fixed point used throughout the FQFT v2.0 series.	FQFT Paper I / prediction card	Paper-internal fixed-point value derived from stated inputs; not externally validated.
ΛUV	MPl	Planck-scale UV boundary condition.	FQFT prediction card	Model assumption / scale choice requiring review.
gR	0.267	Coupling parameter used in the prediction framework.	FQFT prediction card	Paper-internal input.
yt	1	Top Yukawa treated as spectral unit in the FQFT computation.	FQFT Paper I / prediction card	Normalization convention requiring review.

2. Required Artifacts

Artifact	Type	Function	Status / Link	Boundary
FQFT Series Computational Companion	zenodo-record	Public Zenodo record for the reproducible prediction framework for Papers I–X.	External Link	Public provenance record; DOI and metadata require manual verification if Zenodo access is rate-limited.
FQFT Paper I Zenodo Record	zenodo-record	Kernel paper route for assumptions, action, fixed point, spectral bands, and falsifiable prediction spine.	External Link	Public paper record; not peer-review acceptance.
FQFT Prediction Ledger Zenodo Record	zenodo-record	Prediction table and experimental forecast overview.	External Link	Forecast ledger; not external validation.
fqft compute v2.py	code	Local computation script referenced by the FQFT prediction card and computational companion.	pending-local-file	Do not claim reproducibility until exact script and runtime are present locally and verified.

3. Reproduction Steps

1. Verify Paper I assumptions and notation.
2. Verify the computational companion Zenodo record.
3. Obtain exact computation script and version.
4. Confirm input parameter table.
5. Run script in a clean environment.
6. Compare generated outputs to prediction ledger.
7. Record mismatches.
8. Route mathematical claims to Formalization Targets.
9. Route experimental claims to Falsifiability Matrix.

4. Expected Outputs

Output	Description	Route	Review Need	Boundary
Prediction Table	Neutrino ordering, θ13, Higgs triple coupling, axion mass, dark matter cross-section, CKM/PMNS comparisons, Yukawa hierarchy.	Link	Independent reproduction of each number and sensitivity analysis against assumptions.	Paper-internal prediction output; not [REDACTED: UNBOUNDED CLAIM].
Falsifiability Matrix	Classification of predictions by near-term tests, medium-term tests, existing comparisons, and formalization targets.	Link	External review of test conditions and defeat criteria.	Review routing layer; not validation.
Paper I Kernel Claims	FQFT action, dimensional beta-function, fixed point, standard QFT recovery route, spectral mass formula, generation claim.	Link	Formal mathematical review and proof-dependency mapping.	Theoretical kernel and formalization target.

5. Review Boundary

This protocol supports reproducibility attempts and review. It does not claim that the outputs are independently validated or experimentally confirmed.

---

3. Computational Verification Targets

A rigorous replication protocol must independently execute and verify the following 8 computational checkpoints:

Checkpoint	Target Property	Verification Method	Epistemic Invariant
CP-01	Input Parameter Definitions	Exact symbolic extraction from mathematical definitions.	Zero hardcoded empirical fudge factors.
CP-02	Dimensional Fixed-Point Convergence	Iterative numerical fixed-point solver on renormalization flow.	Numerical stability across initial seeds.
CP-03	Spectral-Band Assignments	Laplacian eigenvalue decomposition on Cayley graph substrates.	Symmetry-preserving spectrum $\lambda ({\mathrm{\Delta }}_5)$.
CP-04	Prediction Table Generation	Automated pipeline output against Prediction Ledger.	Strict agreement with calibrated tables.
CP-05	Numerical Sensitivity & Robustness	Perturbation analysis $\delta p/p$ across parameter space.	Robustness against discrete grid choices.
CP-06	Degrees of Freedom Accounting	Verification of parameter constraints ($N_{\text{eff}}=0$).	Zero unconstrained tunable parameters.
CP-07	Versioning & Environment Lock	Containerized / locked dependencies and seeds.	Bit-for-bit deterministic reproduction.
CP-08	Mismatch & Anomaly Reporting	Pre-registered diff report against empirical limits.	Unfiltered reporting of tensions.

---

4. Epistemic Claim Boundary

Claim Boundary

Computational reproducibility ensures that the reported numerical values and curves follow deterministically from the declared mathematical models and assumptions. It provides a direct route for independent scientific inspection, but does not imply empirical confirmation, physical validity, or peer-review acceptance of the underlying physical postulates.

---

5. Canonical Continuations

Destination	Scope & Focus	Primary Route
FQFT Paper I	Core equations, field Lagrangian, and spectral geometry	Open Kernel Route
Prediction Ledger	7-tier prediction taxonomy and empirical ledger	Open Prediction Ledger
Falsifiability Matrix	Failure criteria and adversarial null tests	Open Falsifiability Matrix
Artifact Map	Full inventory of scripts, notebooks, and datasets	Open Artifact Map
DOI Locking Protocol	Metadata requirements and public record verification	Open Locking Protocol

Corpus Route Continuity

FQFT Paper Series

Previous Layer fqft falsifiability matrix

Next Routefqft artifact map

Grounding

Source GraphReview Gateway

The public corpus is organized as a spine, not as a loose archive. Continuity does not establish proof completion, peer review, or accepted physics.