Fork experiment (T=3) - Preregistered protocol v7

START HERE (read order / canonical artefacts): 1) Front Door notes (falsifiers & theorem/lemma map): DOI 10.5281/zenodo.18075645 2) Fork paper (Hard CNC + certified overlap + T=3 fork): DOI 10.5281/zenodo.18075546 3) Gravity paper (PAW / BR‑PAW + anomaly witness): DOI 10.5281/zenodo.18075607 4) Runner bundle (prereg mechanics + 30‑sec demo): DOI 10.5281/zenodo.18075677 Integrity rule (PAW/BR‑PAW): A null PAW result (no observed loop defect) does NOT, by itself, upper‑bound the worst‑case anomaly norm ||A||∞. PAW is soundness‑only in this direction; null‑result upper bounds require explicitly justified restricted norms (e.g., BR‑PAW with a physically motivated support/ensemble/code restriction) as stated in preregistered assumptions and budgets. Reference implementation for the CNC T=3 locked fork preregistration and the PAW/BR‑PAW inference pipeline. What it does: - Accepts preregistered inputs (including either externally supplied ε upper bound or tomography sufficient statistics + shot counts). - Produces preregistered bounds in two modes: (i) Bernstein/empirical‑Bernstein tightener; (ii) confidence‑region + SDP option (with preregistered solver tolerances and deterministic fallback). Included: - CNC_T3_Prereg_v7_bundle.zip - CNC_Release_Manifest_sha256_v2.txt Quick demo: - The bundle contains a one‑screen DEMO.md and a demo_simulation.py that generates synthetic data and runs the pipeline. Expected qualitative outcomes: signal run should be conclusive and reject Hard CNC; the two “bad” inputs should be inconclusive.