HLV-DS-SPEC-001R Implementation Freeze v0.1.0 freezes the deterministic executable recovery implementation for the prospective HLV-DS-SPEC-001R carrier spectral-specificity test. The controlling recovery protocol is: Krūger, M. (2026). HLV-DS-SPEC-001R: Prospective Recovery of the Native 6D-to-3D Carrier Spectral-Specificity Gate After Q-Control Capacity Stop — Pre-Execution Protocol Freeze v0.1.0. Zenodo. DOI: 10.5281/zenodo.22162097. The recovery protocol follows the first locked HLV-DS-SPEC-001 execution, archived at DOI 10.5281/zenodo.22161966, which terminated with the frozen machine verdict: DSSPEC001_INCONCLUSIVE_CONTROL_CAPACITY_OR_NUMERICAL because the Q-control generator produced only 15 of the required 31 structurally admissible controls within the original frozen ceiling of 512 candidate seeds. The parent run stopped under the frozen feature firewall before any target/control QSPEC or RRESP spectral signature, target-control distance, spectral-band gate, family score, or overall spectral-specificity PASS/FAIL was evaluated. The sole load-bearing recovery change implemented in HLV-DS-SPEC-001R is: Q candidate-search ceiling: 512 -> 4096. The Q generator itself, deterministic candidate ordering, structural acceptance rules, source-cell capacity matching, connectedness requirement, target carrier, graph Laplacian, spectral normalization, QSPEC and RRESP definitions, null families, control counts, scoring rules, leave-one-out procedure, margin threshold, spectral-band rule, numerical audits, feature firewall, W and IRR capacity rules, and physical claim boundaries remain unchanged. A mandatory continuity gate is implemented before the extended Q search is permitted. The recovery engine must reproduce the complete archived 31-control R family and the exact sequence of 15 archived Q controls obtained from the original candidate prefix 0..511. The archived sparse incidence matrices are compared structurally before any Q candidate with offset >= 512 may be accepted. No target or control spectrum is computed during this continuity gate. Only if the continuity gate passes may the Q candidate sequence continue prospectively through offsets 512..4095 until either the first 31 admissible Q controls have been obtained or the frozen 4096-candidate ceiling is exhausted. As in the parent implementation, the complete structurally accepted R/Q/W/IRR control bank must be generated, written, canonicalized, and SHA-256 hash-fixed before any target or control QSPEC/RRESP calculation is permitted. The implementation retains the parent finite-carrier spectral definitions: L0 = B1 B1^T with scale-quotiented active eigenvalues, a 64-component QSPEC empirical quantile signature, and a 129-component dimensionless Lorentzian-regularized RRESP signature with fixed gamma = 1/64. The confirmatory decision rules remain unchanged. For each null family and each signature, the target distance must exceed the strict maximum leave-one-out control distance, satisfy the frozen margin threshold >= 1.50, and exceed the corresponding maximum leave-one-out distance in at least two of three prospectively defined spectral sub-bands. A family passes only if both QSPEC and RRESP pass, and overall PASS requires all four R/Q/W/IRR families to pass. This implementation freeze was prepared and technically validated before any HLV-DS-SPEC-001R scientific target/control spectral execution. Validation was restricted to implementation-level checks including syntax/compile tests, synthetic graph-spectrum tests, independent QSPEC/RRESP formula checks, scorer tests, R-rewiring checks, capacity-matching checks, IRR basis-alignment checks, package-integrity verification, and synthetic sparse-matrix continuity-comparator tests. No HLV-DS-SPEC-001R target/control spectrum, QSPEC/RRESP distance, family score, sub-band result, or scientific machine verdict was computed or inspected during preparation of this implementation freeze. The package contains the deterministic recovery engine, the exact One-Click Locked Colab notebook, machine-readable implementation specification, controlling recovery protocol, parent implementation archive, parent locked inconclusive result archive, locked DG-001 target archive, source provenance, technical validation materials, and SHA-256 manifests. After public archival of this exact implementation freeze, the next permitted action is one unchanged execution of the frozen One-Click Colab. A later PASS would establish only finite scale-quotiented graph-spectral specificity of the frozen carrier against the declared R/Q/W/IRR null ensemble. It would not establish dark matter, physical extra dimensions, Kaluza-Klein states, dark photons, particles, an absolute mass or energy scale, stress-energy, electromagnetic invisibility, gravity, halo dynamics, cosmology, or observational validation. A later FAIL would reject only the tested graph-spectral specificity route under the frozen null ensemble. Controlling provenance: Corrected parent protocol: DOI 10.5281/zenodo.22160655 Parent implementation freeze: DOI 10.5281/zenodo.22161422 Parent locked inconclusive result: DOI 10.5281/zenodo.22161966 Recovery protocol freeze: DOI 10.5281/zenodo.22162097
HLV-DS-SPEC-001R Implementation Freeze v0.1.0 freezes the deterministic executable recovery implementation for the prospective HLV-DS-SPEC-001R carrier spectral-specificity test. The controlling recovery protocol is: Krūger, M. (2026). HLV-DS-SPEC-001R: Prospective Recovery of the Native 6D-to-3D Carrier Spectral-Specificity Gate After Q-Control Capacity Stop — Pre-Execution Protocol Freeze v0.1.0. Zenodo. DOI: 10.5281/zenodo.22162097. The recovery protocol follows the first locked HLV-DS-SPEC-001 execution, archived at DOI 10.5281/zenodo.22161966, which terminated with the frozen machine verdict: DSSPEC001_INCONCLUSIVE_CONTROL_CAPACITY_OR_NUMERICAL because the Q-control generator produced only 15 of the required 31 structurally admissible controls within the original frozen ceiling of 512 candidate seeds. The parent run stopped under the frozen feature firewall before any target/control QSPEC or RRESP spectral signature, target-control distance, spectral-band gate, family score, or overall spectral-specificity PASS/FAIL was evaluated. The sole load-bearing recovery change implemented in HLV-DS-SPEC-001R is: Q candidate-search ceiling: 512 -> 4096. The Q generator itself, deterministic candidate ordering, structural acceptance rules, source-cell capacity matching, connectedness requirement, target carrier, graph Laplacian, spectral normalization, QSPEC and RRESP definitions, null families, control counts, scoring rules, leave-one-out procedure, margin threshold, spectral-band rule, numerical audits, feature firewall, W and IRR capacity rules, and physical claim boundaries remain unchanged. A mandatory continuity gate is implemented before the extended Q search is permitted. The recovery engine must reproduce the complete archived 31-control R family and the exact sequence of 15 archived Q controls obtained from the original candidate prefix 0..511. The archived sparse incidence matrices are compared structurally before any Q candidate with offset >= 512 may be accepted. No target or control spectrum is computed during this continuity gate. Only if the continuity gate passes may the Q candidate sequence continue prospectively through offsets 512..4095 until either the first 31 admissible Q controls have been obtained or the frozen 4096-candidate ceiling is exhausted. As in the parent implementation, the complete structurally accepted R/Q/W/IRR control bank must be generated, written, canonicalized, and SHA-256 hash-fixed before any target or control QSPEC/RRESP calculation is permitted. The implementation retains the parent finite-carrier spectral definitions: L0 = B1 B1^T with scale-quotiented active eigenvalues, a 64-component QSPEC empirical quantile signature, and a 129-component dimensionless Lorentzian-regularized RRESP signature with fixed gamma = 1/64. The confirmatory decision rules remain unchanged. For each null family and each signature, the target distance must exceed the strict maximum leave-one-out control distance, satisfy the frozen margin threshold >= 1.50, and exceed the corresponding maximum leave-one-out distance in at least two of three prospectively defined spectral sub-bands. A family passes only if both QSPEC and RRESP pass, and overall PASS requires all four R/Q/W/IRR families to pass. This implementation freeze was prepared and technically validated before any HLV-DS-SPEC-001R scientific target/control spectral execution. Validation was restricted to implementation-level checks including syntax/compile tests, synthetic graph-spectrum tests, independent QSPEC/RRESP formula checks, scorer tests, R-rewiring checks, capacity-matching checks, IRR basis-alignment checks, package-integrity verification, and synthetic sparse-matrix continuity-comparator tests. No HLV-DS-SPEC-001R target/control spectrum, QSPEC/RRESP distance, family score, sub-band result, or scientific machine verdict was computed or inspected during preparation of this implementation freeze. The package contains the deterministic recovery engine, the exact One-Click Locked Colab notebook, machine-readable implementation specification, controlling recovery protocol, parent implementation archive, parent locked inconclusive result archive, locked DG-001 target archive, source provenance, technical validation materials, and SHA-256 manifests. After public archival of this exact implementation freeze, the next permitted action is one unchanged execution of the frozen One-Click Colab. A later PASS would establish only finite scale-quotiented graph-spectral specificity of the frozen carrier against the declared R/Q/W/IRR null ensemble. It would not establish dark matter, physical extra dimensions, Kaluza-Klein states, dark photons, particles, an absolute mass or energy scale, stress-energy, electromagnetic invisibility, gravity, halo dynamics, cosmology, or observational validation. A later FAIL would reject only the tested graph-spectral specificity route under the frozen null ensemble. Controlling provenance: Corrected parent protocol: DOI 10.5281/zenodo.22160655 Parent implementation freeze: DOI 10.5281/zenodo.22161422 Parent locked inconclusive result: DOI 10.5281/zenodo.22161966 Recovery protocol freeze: DOI 10.5281/zenodo.22162097
This record freezes the analytical and computer-assisted successor protocol to the HLV Golden Gauge Forge finite-family study. Previous work established an exact golden 6→3 cut-and-project carrier fingerprint, a nested bounded-locality exhaustion, maximum vertex degree 12, maximum edge–face incidence 10, volume-independent positive HLV coefficient bounds, and a strictly positive physical-sector gap for every fixed finite connected complex satisfying the declared hypotheses. A preregistered exact Z3 finite-family study successfully constructed the controlled carrier sequence but did not support the frozen positive volume-uniform-gap candidate. This negative result motivates a locality-based analytical programme rather than further unrestricted enlargement of finite matrices. The primary system is a fixed-lattice Z3 gauge Hamiltonian on a declared class of finite oriented two-complexes with uniformly bounded vertex degree, face incidence, interaction range, and positive electric and magnetic coefficients. The protocol freezes a sequential theorem programme consisting of: an explicit volume-uniform gap for the electric product-state backbone; derivation of system-size-independent locality and interaction constants; a strong-coupling perturbative stability theorem with a volume-independent spectral gap; exponential clustering of spatially separated gauge-invariant observables; a van-Hove/Følner theorem for the canonical HLV origin-connected exhaustion; and, only if these gates are closed, construction of a fixed-cutoff thermodynamic-limit state. The computer-assisted component freezes an eight-radius geometry audit, graph-boundary layers of thickness one to three, radius-two rooted patch-frequency diagnostics, exact local norm and interaction-overlap calculations, a global exact-diagonalization cap at cycle rank 10, independent numerical verification, and complete deterministic replay. HLV carrier specificity is tested against matched controls consisting of uniform weights on the same complex, 50 exact histogram-preserving type-stratified weight permutations, 12 deterministic internal-window phason shifts, and three rational Fibonacci-slope periodic approximants. The protocol explicitly forbids replacing a local perturbation estimate by the global magnetic operator norm, which grows with system size and cannot establish a bulk spectral gap. It also keeps the thermodynamic limit, representation-cutoff removal, and continuum lattice-spacing limit strictly separate. A positive result under this protocol would establish, at most, a fixed-Z3, fixed-lattice strong-coupling theorem for a class of aperiodic bounded-locality gauge complexes and a separate finite test of whether the HLV geometric assignment produces effects not reproduced by matched controls. It would not establish full SU(3) dynamics, representation-cutoff removal, a continuum Yang–Mills theory, or the Yang–Mills existence and mass-gap problem.
Erase the apparent carrier. Recover the qubit from its halo. Then ask a different clock. This preregistration separates an ordinary quantum-memory qualification from a distinct timing test. Test A evolves a logical qubit through a frozen local channel, physically resets its original carrier, and asks whether a finite surrounding window can recover it. Test B asks whether that independently reconstructed channel fidelity controls a separate timing-covariance frontier. Test A: where is the recoverable channel? Ri(ω)=∣0⟩⟨0∣i⊗Triω,Qdel=2Favg(Ndel,id)−1,Fedel=41+3Qdel. Target-only and every smaller halo subwindow remain optimized counterfactuals. A physical reset, sham reset, hidden-record injection, boundary ladder, and complete terminal record are required before the recovery layer qualifies. Test B: does the memory verifier intertwine with an independent timing projector? W†MeW=Palign,ηT=Tr(ρPalign),UT⋆=inf2detΣTΩ. On the certified canonical branch, the sealed QTT target is ηT=Fedel,UT⋆=1−Fedel. No complement coefficient is fitted. Five fidelity corridors, a radius/depth ladder, one-third untouched holdouts, topology twins, full covariance, global five-sigma decisions, at least 95% planned power, and transfer to a second record technology are frozen before data. The external computation is a feasibility anchor, not the timing target An, Cao, and Cui report carrier-deletion recovery in a local kicked-Ising memory. Their result qualifies the plausibility of Test A. Their reported Q=0.516 is explicitly forbidden from constructing Test B. The public source archive lacks the exact arrays and scripts, so exact replication remains pending. Five terminal outcomes INELIGIBLE_NO_THEORY_VERDICT REGISTERED_QTT_CONSEQUENCE_FALSIFIED QTT_CANDIDATE QUALIFIED_OTHER_OR_CROSS_CHANNEL_ANOMALY AMBIGUOUS_OR_UNDERPOWERED Any failed eligibility gate terminates without a theory verdict. A positive result requires the full multirung shape, not one selected point. An off-target anomaly is preserved rather than discarded or used as a post-hoc rescue. Immutable protocol seal eb0640b25c1d0bde56cacc7f25d9ce4304594833e4aa937ed50293a1faafc849 This is a separate sealed extension. It changes no target, threshold, classifier, protocol hash, or file in the parent test under concept DOI 10.5281/zenodo.21902885. Public anchors Completed-record fan-out and timing-access framework Observation as Access Quantum Traction Theory: Main Book External finite-window recovery paper The PDF is the default preview. The reconstruction archive contains the sealed JSON, classifier, eighteen-gate and raw-terminal templates, Stage-0 handoff, verifier, external audit, adversarial review, metadata, and checksums.
This record deposits the frozen scientific protocol for a standalone Return Theory (RT) Sector Connection in constrained quantum cosmology. The declared hosts are a spatially flat FLRW universe sourced by a free massless scalar field, quantized in matched Wheeler–DeWitt and solvable loop quantum cosmology (sLQC) forms. The protocol keeps four structures distinct: the host constraint and physical inner product; the assignment of probabilities through consistent or decoherent histories; explicit memory dilations producing accessible and validated records; and the representation reference and reconstruction map used to form an observer image. It thereby provides a typed implementation of observer, relational clock, record order, reference, access, validation, and reconstruction without modifying either host dynamics. The frozen design addresses three central non-definitional questions: whether a time-symmetric sLQC geometry combined with different physical memory-readiness conditions produces different admitted observer images; whether an observer can construct a globally usable volume reference across the resolved bounce from its own admitted branch records; and how a declared relational monitoring channel changes the sLQC bounce-history probability relative to the unmonitored host, including null, ordinary, and Zeno-like outcomes. Results are classified at four distinct levels: host/constraint, history/decoherence, record/access, and image/reference. The package contains the complete human-readable protocol, machine-readable scientific freeze card, frozen state families, instruments, clock windows, volume bins, thresholds, Wheeler–DeWitt/sLQC matching rules, numerical tolerances, risk and source ledgers, engineering-pilot contract and results, deterministic consistency audits, validators, and the external execution gate. In the Chimera implementation, sLQC remains the host: the exact sLQC difference operator is used on the inner lattice, while the large-volume Wheeler–DeWitt tail serves as a bounded-error numerical approximation. This record reports no authoritative scientific outcome. Its purpose is to establish a public and independently verifiable timestamp for all scientific choices before authoritative execution. Authoritative frozen archive: RT_Constrained_Quantum_Cosmology_Sector_Frozen_0.2.1.zip SHA-256: 250f8ee99ac7188568e363616f8f9649583eb70157f19840e6af727992c839d0 Authoritative execution is permitted only after publication of this timestamped record and creation of a later atomic execution-start record.
This record contains a manuscript and supporting reproducibility materials for “Ledger-Valid Recovery Diagnostics for Quantum Computing: A Prespecified Sequential Audit for Claim-Limited Recovery Validation.” The paper proposes a methodological validation framework for quantum-computing recovery claims. Its central claim is that endpoint recovery success is necessary but not sufficient for a strong recovery claim when calibration failure, false-carrier acceptance, postselection artifacts, leakage, sentinel blindness, or hidden discard can carry failure modes out of view. The manuscript introduces a prespecified S0–S4 ledger audit that converts familiar diagnostic ingredients—label calibration, candidate recovery, false-carrier challenge tests, postselection/leakage accounting, and sentinel observability—into an ordered, claim-limiting taxonomy. A supportive recovery claim is permitted only when all required gates pass; otherwise, the first failed stage determines a lower claim ceiling and an interpretable failure class. The evaluation is based on synthetic endpoint-level validation suites rather than circuit-level simulation or hardware data. These suites test the behavior of the decision architecture under clean support, degraded observability, false-carrier artifacts, postselection/leakage artifacts, sentinel-blind cases, correlated artifacts, and adversarial overlap. The results show a strong specificity/sensitivity tradeoff: the full ledger protocol sharply reduces synthetic non-support supportive-call rates relative to endpoint-only reporting, but with substantial loss of mechanism-positive support sensitivity. The paper explicitly treats this as a conservative claim-validity architecture, not as a new quantum error-correcting code, new physical observable, hardware speedup, or proof of improved device performance. The supporting materials document the final synthetic validation protocol, endpoint definitions, decision-bound implementation, direction-aware threshold sensitivity analysis, latent-threshold eligibility analysis, mechanism-negative/latent-eligible boundary cases, and figure/table traceability. The archive is intended to support review of the manuscript’s aggregate numerical claims and methodological provenance. Hardware implementation, independent simulator validation, and full raw-event-ledger reproduction are identified as future extensions. Suggested keywords: quantum computing; quantum error correction; validation methodology; recovery diagnostics; leakage; postselection; benchmarking; synthetic validation; decision architecture; reproducibility.
Version 2: pre-registration addendum for Phase D Outcome of the registered gate (G0) The G0 gate failed for every dataset, window family and null. No twin built from independent error mechanisms with circuit-local supports reproduces the bulk of the window-count distributions in the public data from Google Willow, Google Sycamore or Rigetti. For larger codes the twin cannot even be simulated. As the protocol requires, hypotheses H1–H3 are therefore not tested. This version adds pre-registration addendum 1. It fixes the analyses run instead, before either touches the test halves: • Model-free certificate (T3), on the test halves. It covers every registered configuration that has a circuit (the Google archives and Rigetti D6e). Windows are whole-patch windows of 1 and of 5 rounds, separated by one unused round, and the disjointness of their fault-location sets is checked from each circuit. Each stratum (archive, code family, code distance, window family) gets a premise curve ε_lo(k) on the grid k = c·j, j = 1–16, with Bonferroni correction at family-wise α = 0.05.• Threshold values for the certificate. ε* = 7.4 × 10⁻⁴ (Fowler, PRL 109, 180502, 2012) is the primary value; 2.73 × 10⁻⁵ (Aliferis, Gottesman and Preskill, QIC 6, 97, 2006) is a sensitivity check. Certificates against ε* are computed for surface-code strata only. Repetition-code, colour-code and stability strata get premise curves only.• Bursts. The primary analysis uses all windows; a secondary one excludes the windows flagged by the frozen burst classifier. B1/B2 event rates are reported descriptively.• Cat-qubit case study (exploratory). The model-based premise meter is applied to the AWS cat-qubit (D4) distance-3 configurations whose twin was simulable in G0. It reports R(k) intervals and k_cert, with the H1 reading (consistent if R_hi ≤ 3 for all k ≤ k_cert). It is labelled exploratory because D4's own G0 verdict is a fail. Status of the data when version 2 was created G0, which uses only the bulk bins, has run on the test halves. Its stored histograms include tail bins, but no tail statistic has been computed or examined. Both new analyses were dry-run on fit halves as pipeline checks. One choice was made after that dry run, and it is recorded in the addendum: ε* certificates were limited to surface-code strata, and strata were split by code family. The dry run had shown repetition-code and stability strata crossing ε* at k = c, i.e. at their base error rate, where Fowler's surface-code theorem does not apply. The model-based certification horizon is not computed, because it needs a twin tail. Files added in version 2 • phaseD_addendum.json: the machine-readable addendum. SHA-256: a458bcb40aa474d94a882a563a38a1a152d7bfb4404df9299f99fb020ab78834• ADDENDUM.md: the readable version of the addendum.• qpremise_code_phaseD_ade59b0.zip: the code that will run. The addendum's code_sha256 (794122ae1557c009664127e1c2e6b109781d5a71efcc566bc637b991c0403ab6) can be recomputed from it as the SHA-256 over the files matching qpremise/**/*.py, phaseD/scripts/*.py and phaseC/scripts/run_g0.py, taken in path order: each file's relative path, then its bytes with LF line endings.• SHA256SUMS_addendum.txt: checksums of the three files above. The version 1 files are unchanged. The original registration text follows. ──────────────────────────── Version 1 registration (2026-10-01) What this registers The analysis protocol of the premise meter. It tests whether public quantum-error-correction syndrome data agree with an independent-noise "twin" fitted to the same data. It also measures how far each dataset can certify the local-stochastic premise of the threshold theorem. Every analysis choice is fixed in frozen_protocol.json:• configuration eligibility, and the pre-registered subset in g0_selection.json;• the interleaved fit/test split;• the window families;• twin construction: candidate mechanisms from each circuit, an exact parity-moment fit, and a signed quasi-probability simulation with local weights;• the G0 gate decision rule;• the burst classifiers B1 and B2 with their validation targets;• the excess-tail-ratio interval and the certification-horizon conditions;• the model-free certificate's window rule. qpremise_code_at_freeze_79dbf14.zip holds the analysis code at the freeze. The protocol's code_sha256 can be recomputed from it: the SHA-256 over every qpremise/**/*.py file in path order, each file's relative path followed by its bytes with LF line endings. Hypotheses analysed after this registration (on test halves only) H1. After removing windows flagged by the frozen burst classifier, the excess tail ratio R(k) = P_obs(K ≥ k) / P_twin(K ≥ k) has an upper 95% confidence bound ≤ 3 for all k ≤ k_cert. Failure: a lower bound > 3 that replicates on the held-out half. H2. Including burst windows, R(k) > 10 for k ≥ k_b in at least one dataset, and a burst-mixture model fitted to the flagged windows predicts the published repetition-code error floor within a factor of 10. H3. The empirical horizon (power ≥ 0.8 at α = 0.05 against a factor-5 excess) agrees with the exact binomial computation within ±1. At least one dataset certifies k ≥ 10 in whole-patch windows. These are evaluated only on (dataset, window family) pairs that pass the G0 gate under both the stationary (N1) and drift-aware (N5) twins. The model-free certificate (T3) does not depend on the twin. Its threshold ε* is fixed before any certificate is computed. Timing and what had been seen Frozen 2026-10-01 17:31 IST (git commit 79dbf14). Before the freeze, only fit halves had been analysed. The G0 gate (bulk of the window-count distributions only; decision rule frozen) began on the test halves minutes after the freeze. When this record was created, no tail statistic (R(k), H1–H3, burst rates, certificates) had been computed from the test halves, and their tail bins had not been examined. The planned cloud-hardware contrast experiment (H4, H5) is not part of this registration and will be registered separately before any hardware run. Full details are in PREREGISTRATION.md. Protocol SHA-256: 5f7458cfdbe0e203fd9e2bf5d579703509c8374bae53096c37f8f1530540707a
After an experiment runs, exactly two decisions could still be made by a person: does this outcome exclude the theory's declared region, or did an auxiliary — source, tap, detector, calibration — fail, voiding the run instead; and who is licensed to say so. Any protocol that leaves either decision open after data exist has left a seat for a post-hoc refutation authority — the Global Falsifier, the imagined adjudicator who owns the modus tollens. Paper 44 of this sequence closed its photonic tapped-switch probe F_A at pre-registration-grade design ("the IV gate itself remains future laboratory work"); Paper 48 froze the shared adjudication layer as a handover template, typing everything design-specific as named pre-data slots behind a failable acceptance gate. What stands between that design and a laboratory's first shot is a single object: a completed, gate-passing handover instance. This paper — the forty-ninth in the sequence, centre panel of its Execution Program (Papers 48-50) — builds that object, the reference instance H_A, at the executable level the template promised. Delivered: the delta specification from the cited apparatus class (the Goswami-type photonic quantum switch) to 44's tapped configuration, component by component against the frozen budget rows; the schema completion with field-level primitives for every field, extensions add-only and partition-admissible; the frozen analysis pipeline in algorithmic normal form — IV gate, measured-calibration transfer, estimators, and the leaf router implementing 48's tap rows verbatim, under a language-independent rounding convention so floating-point artifacts cannot flip a frozen boundary direction — with the reference implementation shipped as a hash-anchored code appendix (deposited companion file) behind a declared production-scoring boundary; the concrete exclusion rule list with its veto-impact report and a frozen post-exclusion N rule disposing shortfall, surplus, and stopping at once; the S1-S4 blinding runbook; and the mock-data challenge, executed in three parts — a deterministic core exhaustive over every router branch and both tie directions, an adversarial set generated through a recorded, deposited exchange by a party in the auditor role that did not implement the scoring code, and a public-beacon-seeded bulk for totality and determinism. All three parts pass; the routing tables are generated by executing the shipped implementation and are typed non-evidence in the sentence that reports them. The acceptance gate is then run condition by condition on the deposited pair. One finding is published along the way: 48's coverage condition, read literally, would force every per-design instance to claim all seven leaves; the pre-committed completion evaluates coverage over the design's assigned leaf subset plus the shared non-execution leaf — an annotation to 48, never a retro-edit. The verdict is InstanceStatus_A = reference-complete, with an empty instance gap register: every gate condition passes, and what remains is ownership — acceptance transfers when a laboratory signs, auditor-reproducibly, over the instance plus its re-gated extensions; reference-complete never shortens to accepted, and an immutable core guarantees that no admissible extension can change what a null excludes, who may say so, or how boundary cases route. Displayed at the close is the channel's frozen exclusion content — the carve a future null already names, [1.7e-1, 2.1] at the conservative corner — beside the pre-priced Duhem escape map. Nothing is carved, scored, or measured; no band or feasibility verdict moves; the data paper 49-D stays reserved behind its unlock conditions. What retires is the interpretive seat: refutation content as a public, frozen, executable object — falsifiability without a Falsifier.