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.
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.
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.
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.
Eight verified quantum computing jobs executed on IBM Quantum hardware (ibm_fez Heron R2, 156 qubits; ibm_torino Heron R1, 133 qubits) between January 27 and March 15, 2026. User ID: IBMid-692001DJRD. Experiments include: 1. Bell State Entanglement — 96.3% fidelity on ibm_fez Heron R2 (Concurrence C = 0.926, Tangle T = 0.858, 1,000 shots). Cross-platform benchmark: Heron R2 vs Heron R1 (+8.3 pp fidelity advantage, noise ratio 2.43×). 2. Reproducibility Test — Two independent runs of identical circuit (χ² = 2.70, p = 0.44, df = 3). H₀ not rejected: statistically indistinguishable results at 95% confidence. 3. BB84 Quantum Key Distribution — Full Alice/Eve/Bob protocol implementation. Alice baseline error 0.60% → Bob QBER 49.0% under eavesdropping (82× degradation). Experimental demonstration of the quantum no-cloning theorem. Control group design isolates eavesdropper signal from hardware noise baseline. 4. Variational Quantum Circuit (VQC) — 2-qubit circuit, 10 trained parameters with tied weights (θ₃ = θ₄), 8 CZ gates in 4 entangling layers. 4-qubit ansatz: Shannon entropy 3.885/4.000 bits (97.1%), ground-state bias confirmed (χ² = 300.94, p ≈ 0). 5. Quantum Random Number Generation (QRNG) — 8-bit outputs, 10/10 unique values per shot (range 16–254). Total: 39,010 quantum measurements across 8 jobs and 10 circuits. QPU time: 4.8 seconds. Job completion rate: 100%. All results decoded from raw IBM SamplerV2 BitArray binary archives (zlib + base64 + NumPy .npy pipeline). No simulations. Statistical validation applied throughout (Wilson 95% CIs, chi-squared tests). Stack: Qiskit Runtime SamplerV2 · QPY · OpenQASM 2.0 · Python · NumPy · SciPy Repository: https://github.com/dinohatibovicWhitepaper: https://dinohatibovic.github.io (Doc QAI-WP-2026-01-28-V4)
Amendment 5 (2026-10-09), deposited before any S2 data. The registered question, estimand, test, seeds (1000-1079), shots (2,000), backend and qubit rules and 600 s ceiling are unchanged. What changes is how sampler calls become IBM jobs: one job per call (960 jobs, about 2,900 billed seconds) cannot fit the ceiling because of per-job billing, so seeds run in two blocks of 40 and every round of a block is one multi-pub job (12 jobs, about 540 s expected). Both arms of a seed share each job; the resulting shared-job exposure is accepted, with the primary test unchanged and per-block estimates reported as a secondary diagnostic. There is no statistical stopping and no interim analysis. Author decisions (shots, blocks, exposure) were made on 2026-10-09. Files: S2_AMENDMENT_5.md, AMENDMENT_5_MANIFEST.json (hashes of the implementation snapshot, commit 3332e893, and of the documents) and rqc-s2-amendment5-5fc50b0c.zip (code, documents and tests at commit 5fc50b0c). The original pre-registration and its frozen tooling are included unchanged. Not approved for execution: a run requires a recorded approval bound to the exact run payload. Pre-registration, deposited before any hardware job. On one IBM Heron backend (alphabetical-first rule; lowest-CZ-error 8-qubit path), with depth, two-qubit gate count, shots and session equal, does feedback-driven local search over single-qubit angles raise the fresh-re-measured, circuit-normalized XEB of the selected circuit compared with random search, at equal output concentration? Primary estimand: β0 of d = β0 + β1·Δc (one-sided, α = 0.05); 80 fresh seeds (1000–1079); 10-minute QPU ceiling. Simulation (S1) on an ibm_fez noise model and on Google's Willow noise model disagreed (β0 +0.010 and −0.003, both intervals include 0); the test is powered for effects of about 0.012 or larger and a null does not rule out smaller ones. Code frozen at github.com/osiris-dnalang/osiris-cli commit 86e3a3f4 (archive included).