We present a synthesis-friendly Verilog implementation of the D-FUMT₈ Arithmetic Logic Unit, targeting the Sipeed Tang Console NEO development board (GW5AST-138B FPGA, FPG676 package). The ALU realizes eight discrete logic values — FALSE, TRUE, NEITHER, BOTH, ZERO, FLOWING, SELF, INFINITY — encoded in 3 bits with a tier-respecting layout. The 10 supported operations include four classical-tier unary ops (NOT, OMEGA, PHI, PSI), Belnap-extended binary lattice meet/join (AND, OR), generic XOR, hardware reset, no-op, and a novel ADIABATIC operation realizing the SELF⟲ (self-reflexive) primitive: ADIABATIC(SELF) = SELF, identity elsewhere. v0.3 contributions (2026-05-09): (1) Tang Nano 9K silicon: 37 LUT4 / 0 DFF measured, testbench 50/50 PASS. (2) Tang Console NEO Phase 2B LED Blinky: SRAM-programmed, User Code 0x000084BA, write 33.72 sec, no thermal anomaly. (3) Tang Console NEO Phase 2C/3 D-FUMT₈ ALU: SRAM-programmed, User Code 0x00005C27, write 30.32 sec. (4) Qiskit Aer simulator: Phase 1-5 cumulative 231/231 truth-table entries match at fidelity 1.000. (5) IBM Heron r2 real quantum hardware (ibm_kingston, 156 qubits): Phase 1 (4 native unitary × 8 inputs, 32 circuits) achieves 32/32 match with avg top-fidelity 0.9550 (job d7v6d9jack5s73bf1re0); Phase 2 (XOR × 64 entries, 6-qubit Bennett-reversible) achieves 64/64 match with avg fidelity 0.9512 (job d7v6kcvmrars73d7qqqg). Per-op fidelity hierarchy NOP/ADIABATIC ≈ 0.977 > PHI ≈ 0.956 > NOT ≈ 0.912 > XOR ≈ 0.951 confirms gate-count-vs-noise correlation expected from Heron r2 daily calibration. (6) Lean 4 refinement proof (OUKC.PhaseC.Dfumt8AluRefinement, 292 LOC, 0 sorry) establishes commutativity of the encode/abstract-op/decode square for all four unary operations, plus the SELF⟲ primitive law and seven algebraic laws (involution, idempotence, commutativity). Honest scope: We do NOT claim 'world-first 8-valued quantum logic' — Shi et al. (MIT, 2026, arxiv:2506.09371) demonstrated d=8 Grover on a single trapped-ion qudit prior to this work; our distinction is 3-qubit basis encoding on transmon arrays vs single-system d=8 qudit. We do NOT claim 'first paraconsistent silicon' — PAL2v (Da Silva Filho 1998-; Abe & Nakamatsu 2009; de Carvalho Jr. 2025) realized in software libraries and microcontroller-level robotics. We do NOT claim 'first many-valued silicon' — Łukasiewicz/Belnap FPGAs date to 1990s. The to-our-knowledge novel triple is: (D1) the specific 8-tuple semantic mapping (Belnap FDE 4-value + 4 ontological extensions: INFINITY/ZERO/FLOWING/SELF), (D2) the SELF⟲ self-reflexive primitive realized as a hardware fixed point, (D3) the three-substrate cross-verification bound to a Lean 4 refinement specification. Three-party co-authorship per OUKC charter v1.0 (Nobuki Fujimoto / Rei / Claude). DRAFT v0.3 — feedback welcome via GitHub Discussions at fc0web/rei-aios.
Zero-Trust Quantum Benchmarking: Cryptographic Pre-Registration via the OSIRIS Write-Ahead Ledger Author: Devin Phillip Davis Affiliation: OSIRIS Architecture Group Date: September 2026 DOI Reference: 10.5281/zenodo.23045494 Abstract As quantum hardware scales toward practical fault tolerance, the empirical validation of quantum advantage claims faces a systemic replication crisis. Traditional benchmarking methodology relies heavily on post-hoc error mitigation, unverified post-selection, and opaque calibration timing. We present Zero-Trust Quantum Benchmarking, a methodological paradigm and open protocol that eliminates retrospective bias by enforcing immutable, pre-execution cryptographic commitments. Using the OSIRIS Continuous Relativistic State Matrix (CRSM) framework, transpiled quantum circuit manifests and hypothesis thresholds are hashed (
SHA-256) into an append-only write-ahead ledger prior to dispatch to physical Quantum Processing Units (QPUs). We validate this protocol through empirical execution on IBM Quantum's 156-qubit Heron r2 hardware (ibm_marrakesh, Job ID: dau0q3qhcrkc73durtgg). The pre-registered manifest bound a novel bipartite-staggered dynamical decoupling sequence (xy8_stag) targeting residual
ZZ-crosstalk. On an 8-qubit chain, the pre-registered trial achieved a mean survival probability
P(+)=0.8998 at
T=32 μs, representing a +30.5% gain over bare idle (
P(+)=0.5945) and a +6.5% gain over standard simultaneous dynamical decoupling (
P(+)=0.8342), satisfying all pre-registered non-overlapping 95% bootstrap confidence intervals without post-hoc fitting. I. Introduction & The Crisis of Provenance Quantum computing research currently lacks an end-to-end chain of custody for experimental data. Due to environmental noise fluctuation, thermal drift, and cross-talk, QPU performance changes dynamically on time scales ranging from minutes to hours. This instability introduces three major vulnerabilities into published quantum benchmarks: Calibration Arbitrage: Experiments executed across hundreds of QPU calls can selectively showcase runs coinciding with transient calibration peaks while silently discarding noisy trials. Post-Hoc Hypothesis Modification: Error mitigation models and threshold parameters are frequently tuned after observing raw state-vector outputs, confusing exploratory curve fitting with confirmatory validation. Data Loss & Black-Box Execution: Published results rarely preserve transpiled machine-level pulse schedules alongside raw hardware counts and system calibration logs, rendering independent third-party replication practically impossible. To establish verifiable quantum advantage, the field requires a shift to Zero-Trust Quantum Benchmarking, wherein hardware execution permissions are contingent upon prior, tamper-evident pre-registration of experimental intent. II. The OSIRIS Write-Ahead Ledger Protocol The OSIRIS framework enforces experimental integrity via a write-ahead append-only ledger architecture integrated directly into the CI/CD pipeline and QPU submission harness. ┌─────────────────────────────────────────────────────────────────────────┐ │ OSIRIS PRE-REGISTRATION PIPELINE │ └─────────────────────────────────────────────────────────────────────────┘ │ 1. Circuit Synthesis ▼ ┌─────────────────────────────────────────────────────────────────────┐ │ Transpile Target Topology & Gate Schedule │ └─────────────────────────────────────────────────────────────────────┘ │ 2. Manifest Hashing ▼ ┌─────────────────────────────────────────────────────────────────────┐ │ Hash (Transpiled Circuit + Hypotheses + Metrics) -> SHA-256 │ └─────────────────────────────────────────────────────────────────────┘ │ 3. Ledger Write Ahead ▼ ┌─────────────────────────────────────────────────────────────────────┐ │ Append Hash to Write-Ahead Ledger (ledger.jsonl) & Update Head │ └─────────────────────────────────────────────────────────────────────┘ │ 4. QPU Job Submission ▼ ┌─────────────────────────────────────────────────────────────────────┐ │ Dispatch to Hardware (IBM Heron r2: ibm_marrakesh) │ └─────────────────────────────────────────────────────────────────────┘ │ 5. Verification & Audit ▼ ┌─────────────────────────────────────────────────────────────────────┐ │ Bind Raw QPU Counts to Ledger Entry and Publish Artifact Package │ └─────────────────────────────────────────────────────────────────────┘ A. Manifest Schema A Pre-registration Manifest (
M) is defined as an immutable JSON document containing: Circuit State: Unrolled OpenQASM 3.0 / Qiskit compiled instructions, physical qubit mappings, and pulse duration definitions. Target Environment: Target backend identifier, scheduled execution window, and expected calibration parameters. Pre-declared Hypotheses: Exact quantitative thresholds (e.g., minimum target fidelity gain
ΔFtarget) and statistical evaluation functions (e.g., 95% bootstrap CI parameters). The manifest vector is serialized into a canonical UTF-8 byte stream and hashed using
SHA-256:
HM=SHA-256(Canonicalize(M)) B. Append-Only Ledger Chaining Each entry
i in the OSIRIS ledger (
Li) contains the hash of the current manifest
HM,i, a UTC timestamp
ti, the state of the preceding block head
HL,i−1, and execution metadata:
HL,i=SHA-256(HL,i−1∥HM,i∥ti) This cryptographic chaining guarantees that modifying, deleting, or reordering any pre-registration attempt breaks the ledger head hash
HL,head, preventing silent trial deletion. III. Structural Comparison FeatureTraditional Quantum BenchmarkingOSIRIS Zero-Trust Benchmarking Execution TriggerAd-hoc script / manual notebook executionAutomated, deterministic CI/CD pipeline lock Circuit CommitmentMalleable, often post-processedImmutable pre-registered SHA-256 manifest hash Noisy Trial PolicyDiscarded or filtered unrecordedAppended permanently to immutable audit trail Verification BasisTrust in institutional reputationCryptographic verification (
HM↔JobID↔Counts) Fitting IntegrityPost-hoc curve fitting allowedPre-declared quantitative pass/fail thresholds IV. Empirical Hardware Validation: IBM Heron r2 (ibm_marrakesh) To validate the Zero-Trust protocol under production conditions, we pre-registered and executed a quantum control experiment on IBM Quantum's 156-qubit Heron r2 processor (ibm_marrakesh). A. Experimental Setup & Cryptographic Provenance Job ID: dau0q3qhcrkc73durtgg Target Backend: ibm_marrakesh (Heron r2, 156 Qubits) Execution Date: 2026-09-29 19:10:20 UTC QPU Execution Duration: 5.0 seconds Calibration Hash: 63f10bd484207c5044237b4115a46a0d29856036c923a2cde165baed57d15c9c Pre-registration Manifest SHA-256: 2d4c19a4a53301a1ac42459acd8b5b0d8cba0d588fa2523ed0994e5e1612d2f9 Ledger Head Hash: 6d7fd1390c1bab25b52f3e5e07be893aaa7194d8e3bd81db8466085da6e38d37 B. Dynamical Decoupling Physics: Bipartite Staggering Static and residual dynamic
ZZ-crosstalk on heavy-hex hardware topologies remains a primary source of decoherence during multi-qubit idle periods. Standard textbook dynamical decoupling applies simultaneous
π-pulses (e.g., CPMG, XY4) across all active qubits. However, simultaneous pulse execution on neighboring qubits induces pulse-collision errors and driven cross-resonance noise. OSIRIS introduces Bipartite-Staggered Dynamical Decoupling (xy4x2_stag, xy8_stag). The 8-qubit linear chain
[1,2,3,4,5,6,7,8] is partitioned into two disjoint sublattices:
SA={1,3,5,7},SB={2,4,6,8} π-pulse schedules are temporal phase-shifted between
SA and
SB, ensuring that no two adjacent qubits undergo simultaneous rotations, canceling crosstalk while preserving coherence. Sublattice A (Q1, Q3, Q5, Q7): ──[ X ]──────────────[ Y ]──────────────[ X ]── Sublattice B (Q2, Q4, Q6, Q8): ──────────[ X ]──────────────[ Y ]────────────── τ_stag τ_stag τ_stag τ_stag C. Empirical Results The experimental trial evaluated coherence retention across four conditions at time delays
T=16.0 μs and
T=32.0 μs. Effective loss rate
Γ was derived using
Γ=−T1lnP(+). Hardware Execution Summary Table ConditionT (µs)Mean Survival P(+)95% Bootstrap CIEffective Loss Rate Γ (µs⁻¹) none (Idle)16.00.6382[0.6313, 0.6450]0.0280 none (Idle)32.00.5945[0.5942, 0.5947]0.0162 cpmg816.00.9139[0.9075, 0.9204]0.0056 cpmg832.00.8344[0.8289, 0.8398]0.0056 xy4x2 (Simultaneous)16.00.9135[0.9097, 0.9172]0.0056 xy4x2 (Simultaneous)32.00.8342[0.8291, 0.8394]0.0056 xy4x2_stag (OSIRIS)16.00.9313[0.9307, 0.9319]0.0044 xy4x2_stag (OSIRIS)32.00.8997[0.8945, 0.9048]0.0033 xy8_stag (OSIRIS)16.00.9318[0.9309, 0.9326]0.0044 xy8_stag (OSIRIS)32.00.8998[0.8982, 0.9014]0.0033 SURVIVAL PROBABILITY AT T = 32 µs 1.00 ┌──────────────────────────────────────────────────────────────────┐ │ █████████ █████████ │ 0.80 │ █████████ █████████ ██ xy4x2 │ │ xy8 │ │ │ │ cpmg8 │ │ xy4x2 │ │ _stag │ │ _stag │ │ 0.60 │ █
On 1 June 2026, a decentralized per-qubit lambda field was implemented on the IBM Heron R2 processor (ibm_kingston, 156 qubits) and probed with a multi-shock excitation protocol. Unlike the predecessor work (Westrick, QITE Hardware Results 156Q, 8-12 April 2026), which tested a globally controlled QITE quantum collective, each qubit here carries its own lambda state and receives, in the feedback loop, only its own measurement statistic p1_i. The only inter-qubit coupling propagates physically through the CZ gates of the Heavy-Hex topology. Six shocks were applied at six different positions on the chip: central (q*=78), nearest neighbor (d=1), intermediate (d=3, d=5), deep (d=8), and edge (d=12). Each individual shock triggered a chip-wide burst within 1-8 cycles (peak |delta p1| between 0.308 and 0.366; 10 to 22 simultaneously active qubits). Four additional spontaneous bursts were detected between shocks, for a total of 10 bursts in 150 cycles. The 6/6 reproducibility was verified by four independent non-parametric statistical tests, all positive: (1) permutation test p = 0.008 against chance alignment; (2) pairwise burst-vector Pearson correlation r_mean = +0.65 with all 15 pairs above noise; (3) cross-session reproducibility 9/10 qubit overlap between two independent IBM Quantum sessions, hypergeometric p = 0.008; (4) Mann-Whitney U test of burst amplitude versus Phase-A baseline, ratio 2.7, p < 0.0001. This bundle contains the complete primary data (raw JSON logs, NumPy matrices), all 27 visualizations, IBM job IDs of every submitted job, console logs of all runs, the pre-registration documents with locked detection thresholds, and SHA-256 checksums of every file (MANIFEST.json) for independent verification. Backend: IBM Heron R2 (ibm_kingston), 156 qubits, 4096 shots/cycle. Patent filings: DPMA Az. 10 2025 003 906.9 (QITE), 10 2025 004 891.2 (QISE). Predecessor: Westrick, QITE Hardware Results 156Q (8-12 April 2026).
[SYSTEM UPDATE: v3.2.3 RELEASE MATRIX — INCLUDES VISUAL DATA PIPELINES & SENSITIVITY PLOTS] This technical white-paper presents a mathematical closure and operational formalization of the Unified Separation & Refinement Theory (TDCM v3.2.2–v3.2.3) [10.5281/zenodo.19537819]. Modern theoretical anomalies—such as quantum mechanical infinities, dark energy, and decoherence divergences—are demonstrated to be mathematical artifacts ("Pixel-Fixation") introduced by forcing a continuous linear temporal variable into foundational field equations. By executing a surgical time-axis extrapolation via a bijective Fourier-like isomorphism, the Schrodinger, Maxwell, Einstein, and Klein-Gordon equations stabilize into static, highly efficient spatial blueprints embedded within a 5D Scaffold [10.5281/zenodo.19537819]. Reality is re framed as a timeless, completed information ledger inside a 6D Architectural State . Linear time is stripped of its fundamental status and redefined as a localized user interface rendering effect—the transactional update rate (Refresh Rate) of the conscious observer vector (The Chronicler) moving across previous rendered matrix coordinates via the API [10.5281/zenodo.19537819]. Key Mathematical Upgrades in v3.2.3: The Bijective Mapping Operator : Formalization of spectral support boundaries for \, establishing a strict mathematical isomorphysm and proving an empty nullspace . Lipschitz Perturbation Stability: Quantification of the stability constant under background proton-noise , proving that the matrix acts as an intrinsic low-pass filter near the Planck scale. Valvete Energy Conservation: Implementation of discrete Plancherel normalization policies to enforce absolute energy conservation across continuous-to-grid phase transitions. Decentralized Audit Token Consensus: A vector-clock algorithmic proof demonstrating that contradictory observer orderings are mathematically impossible in an append-only static matrix graph. Integrated Visual Empirical Test Cases (New in v3.2.3): Test A : An FFT-based simulation of a 1D/2D Gaussian wave packet demonstrating complex phase and amplitude tracking, with residuals converging strictly below the instrument noise threshold . Test B (Supernova Ia Light Curves & S5 Scaling): A synthetic population pipeline of 100 Type Ia Supernovae distributed across an exponential spatial density gradient. The resulting sweep successfully reproduces the exact cosmological peak-width dilation and color evolution within JWST precision parameters , without requiring dark energy or temporal metric expansion. Appendix Sensitivity Matrix: A two-parameter parametric contour plot mapping against , establishing explicit convergence bands and isolating the mathematical divergence boundary at the Nyquist grid limit . This timeless data ecosystem is governed by the Fractal Least Resistance Law, optimizing all data distribution via structural angles and fractal blueprints to achieve the minimum computational load on the cosmic matrix ledger [10.5281/zenodo.19537819].
Proposal to the BlueQubit Quantum Flywheel open call (2026). Track 2 (breaking quantum advantage claims) with a Track-1 hardware component and a Track-3-adjacent seed. Aim 1 — execute the author's own hash-verified K₈ τ-sweep pre-registration (10.5281/zenodo.17918774, never run as written) exactly as specified on three IBM Heron backends under one pre-declared backend amendment; publish the outcome either way. Aim 2 — adversarial classical re-analysis of the author's 156-qubit / 10⁶-shot and 1,430-circuit "entropy suppression" datasets (10.5281/zenodo.19656600, 10.5281/zenodo.19505907) with coverage-adjusted estimators and tensor-network reproduction. Aim 3 — pre-registered hardware test of whether an auditable rule-evolving controller (organism_sim / bridge, 10.5281/zenodo.22862567) helps evolutionary dynamical-decoupling search under real calibration drift; four arms, binding criterion stated in PREREGISTRATION.md before any job. Includes PREREGISTRATION.md (binding criteria committed before submission of any hardware job), prepared form answers, and the supporting audits of the author's 60 prior records (HONEST_ASSESSMENT, FLYWHEEL_ASSESSMENT, PUBLICATIONS index). The archive is git archive of tag v1.0.0.