CNC Fork Experiment (T=3): First Hardware Run Forensics and a Certifiable Follow-up Test (T=2)

Dale James Raymond

Published Jan 8, 2026• 0 citations

Abstract

This report records and interprets the first real-device execution of the preregistered CNC T=3 two-clock fork experiment (runner v7) and specifies a certifiable follow-up protocol in the T=2 binary-clock setting. First, we note a certified overlap set I_cert where the clocks are demonstrably aligned well enough to talk about a common tick. Second, the runner certifies a lower bound delta' on the standard-QM disagreement that should be present in that overlap set. At that point, the question is not philosophical. It is a specific experimental question: does the observed disagreement survive after the non-invasive correction, or does it collapse toward zero? Run metadata (from locked runner output): run_id: cnc_t3_20260105T133840Z backend: ibm_fez UTC timestamp: 2026-01-05T13:40:11Z key outputs: D_bar = 0.213982, nu = 0.162114, epsilon_inv = 0.109279 decision: inconclusive (fails nu and epsilon_inv gates) Raw run artefacts and outputs are archived by Morgan Cameron on Zenodo: DOI: 10.5281/zenodo.18177156 This report is a forensic note and planning document.

DOI: 10.5281/zenodo.18180954

Related papers

CNC Fork Experiment (T=2): Second Hardware Run Forensics and a Certifiable Replication Protocol (Test 3)

Dale James Raymond

Jan 22, 20260 citations

CNC Fork Experiment — Test 3 QPU Replication (T=2 binary clocks, locked runner v3.1 on ibm_fez)

Dale James Raymond, Morgan Cameron

This preregistration specifies the final “Test 3” replication run of the CNC fork experiment in the simplest certifiable setting: T=2 binary clocks on a 3-qubit register. The goal is to maximize the chance of a conclusive decision either way under a preregistered rule that only emits conclusive labels after certifying overlap and bounding nuisance effects (mismatch and readout invasiveness).

Jan 1, 20260 citations

CNC Fork T=2 Heavy - Preregistered Protocol

Dale James Raymond, Morgan Cameron

Jan 1, 20260 citations

Fork experiment (T=3) - Preregistered protocol v7

Dale James Raymond

Jan 2, 20260 citations

Artian Monitored-Recurrence Reference-Switch Laboratory Protocol: A Preregistered, Activation-Gated A1 Test with First-Detection Resonances

Attar Ali

Jul 30, 20262 citations

UCT Prediction 2 (Stage 2c): Platform-Specific Pre-Registration for IBM Fez Z₂³ Test Under Topological Gate

Gabriel Steiger

May 27, 20260 citations

CNC Fork Experiment (T=3): First Hardware Run Forensics and a Certifiable Follow-up Test (T=2)

Dale James Raymond

Published Jan 8, 2026• 0 citations

Publisher

Abstract

DOI: 10.5281/zenodo.18180954

Related papers

CNC Fork Experiment (T=2): Second Hardware Run Forensics and a Certifiable Replication Protocol (Test 3)

Dale James Raymond

This report records and interprets the second real-device execution of the CNC fork experiment in the certifiable T = 2 “binary-clock” design (runner v3), including a software-forensics correction: an obsolete analysis JSON incorrectly reported ν = 1.0 even though all 2-bit clock patterns are legal by construction in T = 2. It also specifies a final replication run (“Test 3”) intended to be maximally robust against the dominant remaining failure mode (near-threshold readout invasiveness on ibm_fez). A conclusive outcome of Test 3 is meaningful regardless of direction, because (as preregistered) the runner only emits a conclusive label after certifying overlap and bounding nuisance effects (mismatch and readout invasiveness). Run metadata (from locked runner output): backend: ibm_fez output created (UTC): 2026-01-10T19:03:16.074947+00:00 IBM Runtime job id: d5ha332gim5s73ahnueg physical layout (C1,C2,S): [1, 2, 3] protocol blocks: ε ∈ {0.40, 0.20} (primary block ε = 0.40) Qiskit versions (recorded by harness): qiskit 2.2.3, qiskit-ibm-runtime 0.43.1 Key certified outputs (primary block, ε = 0.40): D̄ = 0.381793 ν = 0.016503 (≤ ν_max = 0.020) ε_inv = 0.047647 (≤ ε_inv,max = 0.050) δ′ = 0.313209 decision (locked runner): reject hard CNC The Test 3 OSF preregistration is complete and time‑stamped, but remains embargoed until execution; the public link will be added here immediately after the embargo is lifted. Raw run artefacts and outputs to be archived as a separate Zenodo Dataset record by the hardware executor (Morgan Cameron). This report is a forensic note and replication/protocol document.This report records and interprets the second real-device execution of the CNC fork experiment in the certifiable T = 2 “binary-clock” design (runner v3), including a software-forensics correction: an obsolete analysis JSON incorrectly reported ν = 1.0 even though all 2-bit clock patterns are legal by construction in T = 2. It also specifies a final replication run (“Test 3”) intended to be maximally robust against the dominant remaining failure mode (near-threshold readout invasiveness on ibm_fez). A conclusive outcome of Test 3 is meaningful regardless of direction, because (as preregistered) the runner only emits a conclusive label after certifying overlap and bounding nuisance effects (mismatch and readout invasiveness). Run metadata (from locked runner output): backend: ibm_fez output created (UTC): 2026-01-10T19:03:16.074947+00:00 IBM Runtime job id: d5ha332gim5s73ahnueg physical layout (C1,C2,S): [1, 2, 3] protocol blocks: ε ∈ {0.40, 0.20} (primary block ε = 0.40) Qiskit versions (recorded by harness): qiskit 2.2.3, qiskit-ibm-runtime 0.43.1 Key certified outputs (primary block, ε = 0.40): D̄ = 0.381793 ν = 0.016503 (≤ ν_max = 0.020) ε_inv = 0.047647 (≤ ε_inv,max = 0.050) δ′ = 0.313209 decision (locked runner): reject hard CNC The Test 3 OSF preregistration is complete and time‑stamped, but remains embargoed until execution; the public link will be added here immediately after the embargo is lifted. Raw run artefacts and outputs to be archived as a separate Zenodo Dataset record by the hardware executor (Morgan Cameron). This report is a forensic note and replication/protocol document.

Jan 22, 20260 citations

CNC Fork Experiment — Test 3 QPU Replication (T=2 binary clocks, locked runner v3.1 on ibm_fez)

Dale James Raymond, Morgan Cameron

Jan 1, 20260 citations

CNC Fork T=2 Heavy - Preregistered Protocol

Dale James Raymond, Morgan Cameron

This registration freezes the preregistration document and the exact reference implementation (code, configs, and SHA256 manifest) for a single scarce “heavy” run of the CNC fork experiment in the T=2 binary-clock setting. The goal is to maximize the chance of a conclusive decision either way while extracting high-value diagnostics from the same dataset. Execution: Planned to be performed by an external hardware operator with IBM Quantum access. At the time of registration, Morgan Cameron has offered to execute the run, subject to availability. If executed by another operator, the executor identity and run artefacts DOI will be recorded in the post run dataset deposit. The preregistered protocol, code, and decision rule are independent of executor identity. Protocol, analysis, and report: Dale James Raymond. The authoritative analysis plan is CNC_T2_Fork_Heavy_Prereg_v2.pdf. The exact runnable artefacts are: cnc_t2_qiskit_harness_v3.py cnc_t2_runner_v3.py cnc_t2_config_heavy_v3.json (intended run) cnc_t2_config_lean_v3.json (sanity/layout scout only) RUNBOOK_T2_FORK_HEAVY_V3.md Integrity: SHA256SUMS.txt contains hashes for all files in this registration.This registration freezes the preregistration document and the exact reference implementation (code, configs, and SHA256 manifest) for a single scarce “heavy” run of the CNC fork experiment in the T=2 binary-clock setting. The goal is to maximize the chance of a conclusive decision either way while extracting high-value diagnostics from the same dataset. Execution: Planned to be performed by an external hardware operator with IBM Quantum access. At the time of registration, Morgan Cameron has offered to execute the run, subject to availability. If executed by another operator, the executor identity and run artefacts DOI will be recorded in the post run dataset deposit. The preregistered protocol, code, and decision rule are independent of executor identity. Protocol, analysis, and report: Dale James Raymond. The authoritative analysis plan is CNC_T2_Fork_Heavy_Prereg_v2.pdf. The exact runnable artefacts are: cnc_t2_qiskit_harness_v3.py cnc_t2_runner_v3.py cnc_t2_config_heavy_v3.json (intended run) cnc_t2_config_lean_v3.json (sanity/layout scout only) RUNBOOK_T2_FORK_HEAVY_V3.md Integrity: SHA256SUMS.txt contains hashes for all files in this registration.

Jan 1, 20260 citations

Fork experiment (T=3) - Preregistered protocol v7

Dale James Raymond

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.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.

Jan 2, 20260 citations

Artian Monitored-Recurrence Reference-Switch Laboratory Protocol: A Preregistered, Activation-Gated A1 Test with First-Detection Resonances

Attar Ali

A sealed laboratory fork for monitored quantum recurrence Can the location of a first-detection recurrence resonance distinguish two physically qualified time-reference classes after ordinary clock-transfer, Hamiltonian, waveform, detector, and environmental effects have been held fixed? This preregistration converts that question into a reciprocal two-device experiment with a machine-evaluable entrance gate and a finite outcome ledger. For device $d$ and preregistered transition $j$ , the laboratory reports one dimensionless root ratio, $y_{dj} = \log\!\left( \frac{\widehat x^{*}_{dLj}} {\widehat x^{*}_{dAj}} \right), \qquad \widehat\Delta = \frac{\mathbf 1^{\mathsf T}\Sigma_y^{-1}\mathbf y} {\mathbf 1^{\mathsf T}\Sigma_y^{-1}\mathbf 1}, \qquad \widehat R_{\rm MRRS}=e^{\widehat\Delta}.$ The two frozen point hypotheses are $H_0: \quad \Delta_0=0, \qquad R_0=1,$ $H_{A1}: \quad \Delta_{A1}=\log\!\cos\!\left(\frac{\pi}{8}\right) =-0.0791735919101875\ldots, \qquad R_{A1}=\cos\!\left(\frac{\pi}{8}\right) =0.9238795325112867\ldots .$ The A1 point is dormant unless the proposed physical terminal exists in the apparatus. Version 2.0 therefore places a fifteen-gate constructor ahead of all role-dependent recurrence output: $G_{\rm PT} = \prod_{i=1}^{15}P_i.$ The gate requires a completed source event, continuous physical source memory, no later laboratory write, a source intervention witness, a target-blind ordinary camera, a numerical rank-two terminal Jacobian, a complete clock graph, and an irreversible pre-data seal. A free-running oscillator alone is not a $T^{\star}$ terminal. If any gate fails, the registered result is $G_{\rm PT}=0 \quad\Longrightarrow\quad \texttt{TARGET\_NOT\_ACTIVATED}.$ The executable packet freezes two devices, two independent oscillator chains, four reciprocal role cells, four recurrence roots, eight supercycles, $N=1024$ , an 81-point primary scan, and 16,384 trajectories per point, role, device, and transition. The estimator is the full finite- $N$ multinomial likelihood, including the no-detection category; no manual fit window, pseudoinverse, post-unblinding regularization, or effect-directed exclusion is permitted. The two equivalence regions have fixed half-width $0.025$ in log space, and the primary design gate is ${\rm SE}(\widehat\Delta)\le 0.006.$ A registered point must also exclude the other by at least five standard deviations. A fresh 400+400 finite-horizon synthetic campaign gives $u_{\Delta}^{\rm synth}=0.0010808000, \qquad \frac{|\Delta_{A1}-\Delta_0|}{u_{\Delta}^{\rm synth}} =73.25.$ Every synthetic campaign is classified correctly under the printed planning assumptions. This is a software and power receipt, not hardware activation or a laboratory observation. Release status: CLOSED: laboratory instruction layer and machine packet; CLOSED: synthetic activation, fail-closed, power, and outcome-classifier audits; PENDING: platform-specific hardware packet and physical-terminal activation; PENDING: qualified laboratory data and empirical A1 verdict. The reconstruction archive contains the LaTeX source, exact protocol JSON, activation templates and validator, raw-data dictionary, 31 exclusion codes, finite- $N$ power program, six-outcome classifier, independent experimental review and response matrix, visual audit, a 60-check release receipt, and complete SHA-256 hashes. Stable concept DOI: 10.5281/zenodo.21703683 Physical Terminal constructor: 10.5281/zenodo.21739215 Main book: Quantum Traction Theory: Main Book v10.01 Website: quantumtraction.orgA sealed laboratory fork for monitored quantum recurrence Can the location of a first-detection recurrence resonance distinguish two physically qualified time-reference classes after ordinary clock-transfer, Hamiltonian, waveform, detector, and environmental effects have been held fixed? This preregistration converts that question into a reciprocal two-device experiment with a machine-evaluable entrance gate and a finite outcome ledger. For device $d$ and preregistered transition $j$, the laboratory reports one dimensionless root ratio, \[ y_{dj} = \log\!\left( \frac{\widehat x^{*}_{dLj}} {\widehat x^{*}_{dAj}} \right), \qquad \widehat\Delta = \frac{\mathbf 1^{\mathsf T}\Sigma_y^{-1}\mathbf y} {\mathbf 1^{\mathsf T}\Sigma_y^{-1}\mathbf 1}, \qquad \widehat R_{\rm MRRS}=e^{\widehat\Delta}. \] The two frozen point hypotheses are \[ H_0: \quad \Delta_0=0, \qquad R_0=1, \] \[ H_{A1}: \quad \Delta_{A1}=\log\!\cos\!\left(\frac{\pi}{8}\right) =-0.0791735919101875\ldots, \qquad R_{A1}=\cos\!\left(\frac{\pi}{8}\right) =0.9238795325112867\ldots . \] The A1 point is dormant unless the proposed physical terminal exists in the apparatus. Version 2.0 therefore places a fifteen-gate constructor ahead of all role-dependent recurrence output: \[ G_{\rm PT} = \prod_{i=1}^{15}P_i. \] The gate requires a completed source event, continuous physical source memory, no later laboratory write, a source intervention witness, a target-blind ordinary camera, a numerical rank-two terminal Jacobian, a complete clock graph, and an irreversible pre-data seal. A free-running oscillator alone is not a $T^{\star}$ terminal. If any gate fails, the registered result is \[ G_{\rm PT}=0 \quad\Longrightarrow\quad \texttt{TARGET\_NOT\_ACTIVATED}. \] The executable packet freezes two devices, two independent oscillator chains, four reciprocal role cells, four recurrence roots, eight supercycles, $N=1024$, an 81-point primary scan, and 16,384 trajectories per point, role, device, and transition. The estimator is the full finite-$N$ multinomial likelihood, including the no-detection category; no manual fit window, pseudoinverse, post-unblinding regularization, or effect-directed exclusion is permitted. The two equivalence regions have fixed half-width $0.025$ in log space, and the primary design gate is \[ {\rm SE}(\widehat\Delta)\le 0.006. \] A registered point must also exclude the other by at least five standard deviations. A fresh 400+400 finite-horizon synthetic campaign gives \[ u_{\Delta}^{\rm synth}=0.0010808000, \qquad \frac{|\Delta_{A1}-\Delta_0|}{u_{\Delta}^{\rm synth}} =73.25. \] Every synthetic campaign is classified correctly under the printed planning assumptions. This is a software and power receipt, not hardware activation or a laboratory observation. Release status: CLOSED: laboratory instruction layer and machine packet; CLOSED: synthetic activation, fail-closed, power, and outcome-classifier audits; PENDING: platform-specific hardware packet and physical-terminal activation; PENDING: qualified laboratory data and empirical A1 verdict. The reconstruction archive contains the LaTeX source, exact protocol JSON, activation templates and validator, raw-data dictionary, 31 exclusion codes, finite-$N$ power program, six-outcome classifier, independent experimental review and response matrix, visual audit, a 60-check release receipt, and complete SHA-256 hashes. Stable concept DOI: 10.5281/zenodo.21703683 Physical Terminal constructor: 10.5281/zenodo.21739215 Main book: Quantum Traction Theory: Main Book v10.01 Website: quantumtraction.org

Jul 30, 20262 citations

UCT Prediction 2 (Stage 2c): Platform-Specific Pre-Registration for IBM Fez Z₂³ Test Under Topological Gate

Gabriel Steiger

Fresh IBM Fez platform-lock pre-registration for executing the (Z_2)^3 prediction under the Stage 1c topological gate (DOI 10.5281/zenodo.20404635). Locks: backend ibm_fez, qubits (15, 2, 23), calibration snapshot of 2026-05-27T02:18:29Z (SHA-256 3f69b12d793b7c0cfc1f7cb343b3a0b8c40f04ae3a6239f7e3edd48192dadd1d), analysis script SHA-256 69c5e040c96f8b0f3fd50bc5014a63b4d461129d2e2affb0297f54887d871534, execution parameters (16,000 shots per circuit, 36 circuits total, bootstrap seed 20260526), and outcome reporting commitment.The Stage 1c gate authority (R_gap = (τ - σ_2) / std(σ_2^bootstrap) ≥ 3.0 with m̂_0 = 1) replaces Stage 1b §6.2's union-bound mundane gate. All other Stage 1b provisions (predictions 7/8 vs 8/9, operational f̂ definition, statistical-power requirement, Bayes-factor decision rule) remain in force.This Stage 2c is distinct from Stage 2 (DOI 10.5281/zenodo.20360347) which locked qubits (15, 25, 56) against a 2026-05-23 calibration epoch and yielded the INDETERMINATE Stage 3 outcome (DOI 10.5281/zenodo.20360386) under the old gate. The present Stage 2c lock targets a fresh calibration epoch and a freshly-quality-ranked qubit triple, and the certified execution under this lock will produce a Stage 3c result-of-execution report.Files in this deposit:uct_prediction_2_pregist_stage2c_fez.md — platform pre-registration document (SHA-256: f37062bc98e9429ffe6e92fea135ad6ff729a56c00606337747872d0a4b00dc9, 10320 bytes)ibm_fez_cal_snapshot_2026-05-26.json — locked Fez calibration snapshot (SHA-256: 3f69b12d793b7c0cfc1f7cb343b3a0b8c40f04ae3a6239f7e3edd48192dadd1d, 19485 bytes)Calibration validity window: Fez job to be submitted within 24 hours of snapshot time (by 2026-05-28T02:18:29Z). Beyond that window this Stage 2c is invalidated and a fresh Stage 2 must be deposited.Lock chain:Stage 1: 10.5281/zenodo.20360004Stage 1b: 10.5281/zenodo.20360259Stage 1c: 10.5281/zenodo.20404635 (gate authority)Stage 2: 10.5281/zenodo.20360347 (historical — different qubits and cal epoch)Stage 3: 10.5281/zenodo.20360386 (INDETERMINATE under old gate — preserved as historical record)Fresh IBM Fez platform-lock pre-registration for executing the (Z_2)^3 prediction under the Stage 1c topological gate (DOI 10.5281/zenodo.20404635). Locks: backend ibm_fez, qubits (15, 2, 23), calibration snapshot of 2026-05-27T02:18:29Z (SHA-256 3f69b12d793b7c0cfc1f7cb343b3a0b8c40f04ae3a6239f7e3edd48192dadd1d), analysis script SHA-256 69c5e040c96f8b0f3fd50bc5014a63b4d461129d2e2affb0297f54887d871534, execution parameters (16,000 shots per circuit, 36 circuits total, bootstrap seed 20260526), and outcome reporting commitment.The Stage 1c gate authority (R_gap = (τ - σ_2) / std(σ_2^bootstrap) ≥ 3.0 with m̂_0 = 1) replaces Stage 1b §6.2's union-bound mundane gate. All other Stage 1b provisions (predictions 7/8 vs 8/9, operational f̂ definition, statistical-power requirement, Bayes-factor decision rule) remain in force.This Stage 2c is distinct from Stage 2 (DOI 10.5281/zenodo.20360347) which locked qubits (15, 25, 56) against a 2026-05-23 calibration epoch and yielded the INDETERMINATE Stage 3 outcome (DOI 10.5281/zenodo.20360386) under the old gate. The present Stage 2c lock targets a fresh calibration epoch and a freshly-quality-ranked qubit triple, and the certified execution under this lock will produce a Stage 3c result-of-execution report.Files in this deposit:uct_prediction_2_pregist_stage2c_fez.md — platform pre-registration document (SHA-256: f37062bc98e9429ffe6e92fea135ad6ff729a56c00606337747872d0a4b00dc9, 10320 bytes)ibm_fez_cal_snapshot_2026-05-26.json — locked Fez calibration snapshot (SHA-256: 3f69b12d793b7c0cfc1f7cb343b3a0b8c40f04ae3a6239f7e3edd48192dadd1d, 19485 bytes)Calibration validity window: Fez job to be submitted within 24 hours of snapshot time (by 2026-05-28T02:18:29Z). Beyond that window this Stage 2c is invalidated and a fresh Stage 2 must be deposited.Lock chain:Stage 1: 10.5281/zenodo.20360004Stage 1b: 10.5281/zenodo.20360259Stage 1c: 10.5281/zenodo.20404635 (gate authority)Stage 2: 10.5281/zenodo.20360347 (historical — different qubits and cal epoch)Stage 3: 10.5281/zenodo.20360386 (INDETERMINATE under old gate — preserved as historical record)

May 27, 20260 citations

d

and preregistered transition

j

, the laboratory reports one dimensionless root ratio,

y_{dj} = \log\!\left( \frac{\widehat x^{*}_{dLj}} {\widehat x^{*}_{dAj}} \right), \qquad \widehat\Delta = \frac{\mathbf 1^{\mathsf T}\Sigma_y^{-1}\mathbf y} {\mathbf 1^{\mathsf T}\Sigma_y^{-1}\mathbf 1}, \qquad \widehat R_{\rm MRRS}=e^{\widehat\Delta}.

The two frozen point hypotheses are

H_0: \quad \Delta_0=0, \qquad R_0=1,

H_{A1}: \quad \Delta_{A1}=\log\!\cos\!\left(\frac{\pi}{8}\right) =-0.0791735919101875\ldots, \qquad R_{A1}=\cos\!\left(\frac{\pi}{8}\right) =0.9238795325112867\ldots .

The A1 point is dormant unless the proposed physical terminal exists in the apparatus. Version 2.0 therefore places a fifteen-gate constructor ahead of all role-dependent recurrence output:

G_{\rm PT} = \prod_{i=1}^{15}P_i.

The gate requires a completed source event, continuous physical source memory, no later laboratory write, a source intervention witness, a target-blind ordinary camera, a numerical rank-two terminal Jacobian, a complete clock graph, and an irreversible pre-data seal. A free-running oscillator alone is not a

T^{\star}

terminal. If any gate fails, the registered result is

G_{\rm PT}=0 \quad\Longrightarrow\quad \texttt{TARGET\_NOT\_ACTIVATED}.

The executable packet freezes two devices, two independent oscillator chains, four reciprocal role cells, four recurrence roots, eight supercycles,

N=1024

, an 81-point primary scan, and 16,384 trajectories per point, role, device, and transition. The estimator is the full finite-

N

multinomial likelihood, including the no-detection category; no manual fit window, pseudoinverse, post-unblinding regularization, or effect-directed exclusion is permitted. The two equivalence regions have fixed half-width

0.025

in log space, and the primary design gate is

{\rm SE}(\widehat\Delta)\le 0.006.

A registered point must also exclude the other by at least five standard deviations. A fresh 400+400 finite-horizon synthetic campaign gives

u_{\Delta}^{\rm synth}=0.0010808000, \qquad \frac{|\Delta_{A1}-\Delta_0|}{u_{\Delta}^{\rm synth}} =73.25.

Every synthetic campaign is classified correctly under the printed planning assumptions. This is a software and power receipt, not hardware activation or a laboratory observation. Release status: CLOSED: laboratory instruction layer and machine packet; CLOSED: synthetic activation, fail-closed, power, and outcome-classifier audits; PENDING: platform-specific hardware packet and physical-terminal activation; PENDING: qualified laboratory data and empirical A1 verdict. The reconstruction archive contains the LaTeX source, exact protocol JSON, activation templates and validator, raw-data dictionary, 31 exclusion codes, finite-

N

power program, six-outcome classifier, independent experimental review and response matrix, visual audit, a 60-check release receipt, and complete SHA-256 hashes. Stable concept DOI: 10.5281/zenodo.21703683 Physical Terminal constructor: 10.5281/zenodo.21739215 Main book: Quantum Traction Theory: Main Book v10.01 Website: quantumtraction.org