Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

The ZYQL/ZEPHIRUM Code: Trivalent Quantum Decisions with Sealed Receipts

Maria Clara dos Anjos

Published Oct 26, 2026• 0 citations
Publisher

Abstract

THE ZYQL/ZEPHIRUM CODE — the book of the trivalent quantum decision language. 306 pages anchored in 24 sealed post-quantum receipts (Z-QEA chain: SHA3-256 + ML-DSA-44): the honest refusal of a hardware Deutsch-Jozsa, the shot auditor that refused to spend 75% of a sealed shot budget, the reproducibility audit (delta 0.0024), and the bridge between two Brazilian quantum languages. Multilingual index in 16 languages. No claim without a receipt: where there is no receipt, the book says 'not yet'. Author: Maria Clara dos Anjos, a certified workplace-safety technician from Campinas, Brazil.

DOI
10.5281/zenodo.23676736

Related papers

ZYQL: A Trivalent-Decision Quantum Language with Pre-Registered, Signed Evidence Receipts (v1.0)

Ravi Dos Anjos

Artifact release for the ZYQL quantum language (v1.3): formal EBNF grammar (ISO/IEC 14977) with operational semantics, C kernel with circuit IR and evidence receipts, pre-registered experimental campaigns on real superconducting QPU hardware (Bell baseline; FRONTIER 001-003 causal discrimination of correlation decay; QLAB-002 end-to-end VQE of H2 from a compiled .zeph program, tripartite verification), raw hardware counts, verification scripts, and maturity-labeled reports. Authors: Ravi Dos Anjos (Serena Solutions). AI orchestration (agent Solene, Base44) acknowledged in methodology; all hardware claims point to published job identifiers.2026-10-24 metadata revision. The language has since evolved into ZEPHIRUM (ZYQL) v2.1.0: a trivalent quantum machine-learning language where REFUSED is a first-class verdict (barren plateaus, decoherence, correlated noise) and every execution emits a SHA3-256 sealed receipt (post-quantum signatures ML-DSA-44 / ML-KEM-768, FIPS 204). Pure-Python kernel: statevector and MPS tensor networks, QML kernels with proven PSD, native ZNE with extrapolation guards. Test suite 66/66 with a falsifiable adversarial battery; every hardware round publishes sealed receipts and job identifiers. Repository: SerenaSolutions/zephirum-lang · Project site: serenasolutions.github.io · Worldwide launch announcement: discussions/38 --- Nota de reconciliacao (10/11/2026): deposito DUPLICADO do mesmo manuscrito. O registro canonico e 10.5281/zenodo.23330695.

•Oct 13, 2026•1 citation

Necessity-First Computational Quantum Chemistry: The ZYQL Exact-Decision Language and Quantum-Witnessed Verification on Superconducting Hardware (thesis v0.1) and ZYQL software record v1.1.0

Serena Solutions

Doctoral-scale thesis draft and the guarded software record of ZYQL, a necessity-first trivalent exact-decision language (1 / 0 / REFUSED) for computational quantum chemistry, with the Hybrid Boundary Pattern (exact offline decision; QPU as witness; ML-DSA-44 sealed receipts) validated on three IBM Heron superconducting processors (ibm_fez, ibm_marrakesh, ibm_kingston). Includes signed experiment records: H2 exact ground state certified at -1.1456 Ha; Bell positive/separable negative hardware controls; GHZ ladder to 20 qubits (sparse); CHSH S=1.2822 certified refusal. Software carries the ZYGUARD guardian: refusal-before-compute for seven prohibited purpose classes, structural purity (no execution primitives), post-quantum traceable receipts. License note: code is MIT; the thesis text is CC BY-NC-ND 4.0 (dual licensing declared; the record-level license field reflects the dominant artifact, the software).

•Oct 11, 2026•1 citation

Ouroboros Thesis v17 — Wheelerian Audit Closure, Shannon Doctrine Code, and the QEC-Evolved Agent Body

Stephen P. Lutar

v17 of the Ouroboros Thesis threads two foundational physics grafts and the full quantum-error-correction lineage through the v13 SZL Agent Body anatomy. Three named contributions are kernel-checked in Lean 4 (Mathlib v4.13.0) and mirrored by TypeScript runtime counterparts with passing test suites. §II Wheelerian audit closure — bounded delayed-choice receipt-close operator (W = 1000 ticks); operationalises Wheeler (1978) for AI doctrine; 7 theorems / 10 kernel-checked examples; 18 runtime tests. §III Shannon doctrine code — the 4-level lattice {Bot, L1, L2, Top} admits a Shannon-optimal 2-bit prefix code with Kraft sum equal to 1 at equality; receipt-channel rate bound r ≤ B/2 for an audit-closure bit-rate budget B; 7 theorems / 12 examples; 18 runtime tests. §IV QEC-evolved anatomy — wraps the v13 Heart/Brain/Blood/Immune organs with a defensive cortex threading Hamming distance/weight at the substrate, Shor [[9,1,3]] receipt replication in the blood organ (Amaru), the CSS classical-to-stabilizer bridge in the brain organ, Kitaev surface-code vertex parity in the immune organ (Sentra), and the Shannon doctrine code as a new spine; 10 theorems / 17 examples; 70 runtime tests across the ecosystem. Totals: 24 Lean theorems / 39 kernel-checked examples / 0 sorry / 0 axiom; 108 runtime tests passing; doctrine v6 clean (0 violations across 20 scanned files). Predecessor DOIs in the concept chain: v14 10.5281/zenodo.20424992; v15 10.5281/zenodo.20424995; v16 10.5281/zenodo.20424996.

•May 28, 2026•0 citations

Ouroboros Thesis v17 — Wheelerian Audit Closure, Shannon Doctrine Code, and the QEC-Evolved Agent Body

Stephen P. Lutar

v17 of the Ouroboros Thesis threads two foundational physics grafts and the full quantum-error-correction lineage through the v13 SZL Agent Body anatomy. Three named contributions are kernel-checked in Lean 4 (Mathlib v4.13.0) and mirrored by TypeScript runtime counterparts with passing test suites. §II Wheelerian audit closure — a bounded delayed-choice receipt-close operator (W = 1000 ticks); operationalises Wheeler (1978) for AI doctrine; 7 theorems / 10 kernel-checked examples; 18 runtime tests. §III Shannon doctrine code — the 4-level lattice {Bot, L1, L2, Top} admits a Shannon-optimal 2-bit prefix code with Kraft sum equal to 1 at equality; receipt-channel rate bound r ≤ B/2 for an audit-closure bit-rate budget B; 7 theorems / 12 examples; 18 runtime tests. §IV QEC-evolved anatomy — wraps the v13 Heart/Brain/Blood/Immune organs with a defensive cortex threading Hamming distance/weight at the substrate, Shor [[9,1,3]] receipt replication in the blood organ (Amaru), the CSS classical-to-stabilizer bridge in the brain organ, Kitaev surface-code vertex parity in the immune organ (Sentra), and the Shannon doctrine code as a new spine; 10 theorems / 17 examples; 70 runtime tests across the ecosystem. Totals: 24 Lean theorems / 39 kernel-checked examples / 0 sorry / 0 axiom; 108 runtime tests passing; doctrine v6 clean (0 violations across 20 scanned files). Companion Lean modules in szl-holdings/lutar-lean. Companion runtime in szl-holdings/platform/packages/doctrine-runtime. Ecosystem integrations in szl-holdings/a11oy, amaru, sentra, rosie. Predecessor DOIs in the concept chain: v14 10.5281/zenodo.20424992; v15 10.5281/zenodo.20424995; v16 10.5281/zenodo.20424996.

•May 28, 2026•0 citations

DSOS → PQC Canon: The Complete Deterministic Computing Framework

Leon Calvin II long

SQUIRL OS RESEARCH DISCLOSURE — READ FIRST: This record is part of an open-book, AI-assisted research program published under an audit-and-correction doctrine. Every record is audited; errors are corrected only through disclosed, versioned amendments (original versions preserved in the version history). Audit ledger and correction receipts: github.com/LLong2026/squirrel-os-lindy-test. This material is a prototype, provided for educational and research purposes only; it is not intended for production use, commercial deployment, or safety-critical environments. Abstract This Canon establishes the complete theoretical and applied architecture of Deterministic System/Output Science (DSOS) and its culminating discipline, Deterministic Quantum-Classical Operations (DQCO) for Post-Quantum Cryptography (PQC). Beginning with the Kolmogorov–Shannon Bridge — the mathematical genesis that proves a deterministic channel can be constructed whose output is informationally indistinguishable from true randomness — the Canon proceeds through seven interconnected layers: foundational mathematics, core science, universal interoperability, operating substrate, governance, cryptographic discipline, and education. Together these layers constitute a coherent, self-consistent framework that replaces probabilistic assumptions with deterministic guarantees across the full computing stack. The DSOS Axioms provide the formal scientific bedrock; the Universal Bridge provides heterogeneous interoperability; JasperOS and SquirrelOS provide deterministic execution substrates; the Governance Framework provides provable policy enforcement; the DQCO discipline provides post-quantum cryptographic correctness; and the Educational Layer ensures human perpetuation of the canon across generations of engineers, architects, and policymakers. The Canon is intended as both a living reference for practitioners and a founding text for the DSOS scientific community. Public receipts: append-only work ledger and determinism-test preregistrations — Lindy test receipts: github.com/LLong2026/squirrel-os-lindy-test | Horsemen benchmark preregistrations: github.com/LLong2026/four-horsemen

•Aug 5, 2026•0 citations

Paper 23 - Quantum Reality Before the Symbols

Joe Bloggs

FRC Paper P-23 - Quantum Reality Before the Symbols A Finite Memory-Relay Reconstruction of Interference, Local Capture, Repeated Counts, Signed Interaction, Spin, Exclusion, Binding, Discrete Levels and Emission By Joe Bloggs “The quantum symbol may be the receipt. The question is what finite Reality had to do before the receipt could exist.” WHAT THIS MAY BE P-23 may be pointing towards a simple possibility: the familiar quantum symbols may be highly successful compressed receipts of a finite Reality whose causally relevant history is richer than the final measurement record. Across interference, repeated counts, signed interaction, magnetic response, spin, exclusion, binding, discrete levels and emission, the same less-compressed scene repeatedly survives the audit: a finite condition arrives carrying retained history; it meets an active boundary; not every continuation is compatible; the realised encounter changes the relation; the consequence is retained; and where physically handed forward it becomes part of the next event. If the CLOSE correspondences survive future quantitative tests, several apparently separate quantum mysteries may be different symbolic views of this one event grammar. The wave-like receipt may describe distributed route-conditioned memory before closure, while the particle-like receipt describes one local completed Capture. Probability may be a later count over finite histories that a nominal apparatus reset does not fully restore. A field may partly compress finite source-conditioned ancestry arriving at later boundaries. Spin may concern a complete Candidate-plus-landscape relation whose ordinary presentation has returned before every retained relationship has. Exclusion may be finite receiving capacity. Binding may be persistent admissibility under containment, compatibility and recurrence. Emission may be realised difference leaving a changed bound relation through finite Relay. WHAT THIS PAPER ESTABLISHES The formal claim is deliberately smaller than the possible reading. P-23 does not claim that FRC has replaced quantum mechanics, derived the Born rule, calculated the elementary charge, reproduced the electron magnetic moment, derived the hydrogen spectrum, or generated a universal event-local constitutive law. It does not treat wavefunction, spinor, gauge field or probability as disproved mathematics. It asks whether the observed receipts can be reconstructed through a lower-level finite causal grammar without importing those later symbolic objects as upstream causes. The paper establishes or source-locks the following layered results: · Interference: route availability and route-conditioned finite history can alter later compatibility before one local detector Capture; the quantitative fringe/Born law remains open. · Local detection: one realised compatible contact closes to one primary local Capture without a separate global-collapse primitive. · Repeated counts: finite recurrent and apparatus-dependent histories can generate stable finite count distributions before probability is named; Born correspondence remains open. · Signed interaction: the Candidate-E model contains two opposite role-relative structural sectors and cancelling signed handover bookkeeping; measured elementary charge and the full electric force law remain open. · Finite source-conditioned influence: retained source difference can be handed boundary-to-boundary along realised finite ancestry; isotropic field geometry and inverse-square magnitude are not derived. · Spin: neutron interferometry source-locks the reference-relative 2pi sign/4pi return receipt; the FRC physical bridge is CLOSE because the microscopic magnetic interaction-to-retained-memory update is not directly measured. · Exclusion: a one-capacity same-class refusal theorem is exact conditionally, and free-electron antibunching is source-locked operationally; universal physical Pauli identity remains CLOSE until the event-local capacity map is independently measured. · Binding: P-05b supplies an executed finite structural bound certificate inside its declared model, while real hydrogen supplies the physical bound-system receipt; physical Candidate-E/hydrogen identity and numerical binding remain CLOSE/open. · Discrete levels: finite recurrent bound-state classes are structurally discrete, while hydrogen spectroscopy supplies discrete physical receipts; numerical class-to-energy calibration remains open. · Emission: realised bound-state change can be represented by Capture -> Release -> finite Relay -> outward receipt; spectral-line records source-lock the observation class, while transition selection and quantitative energy/frequency derivation remain open. THE TERMINAL DISTINCTION The paper therefore closes a qualitative causal explanation only at explicitly layered EXACT/CLOSE grades. A complete target-blind quantitative replacement for quantum mechanics is not claimed. The remaining frontier is boundary-specific constitutive prediction, event-resolved evidence where internal order is not measured, and calibration from finite changed relation to measured action, energy, intensity, magnetic moment or frequency. Further progress must predict held-out receipts rather than rearrange the memory grammar after the answer is known. FRAMEWORK POSITION P-23 follows P-22 in Phase V - Reality Audit, Correspondence and Empirical Accountability. It is not a return to the earlier symbol-first quantum branch. Instead it uses Papers 21, 21a and 21b as the methodological filter through which the older finite-closure quantum papers are re-audited. Results from Papers 3, 11, 12 and 19 are retained only where they survive that stricter reality-first audit; downstream Hilbert, U(1), spinor, probability and eigenphase machinery is not allowed to become upstream physical authority merely because it reproduces familiar quantum language. The paper's primary structural ancestry is therefore: Primitive 0 and finite realisation -> compatibility filtering -> closure -> retained relational redundancy -> primitive structural matter -> finite restoration/recurrence -> certified Hydrogen-seed -> source-locked correspondence audit -> three-memory grammar -> reality-first reconstruction -> P-23 quantum reconstruction. P-22 is the immediately preceding programme paper and a methodological precedent for uncompressing successful mathematical receipts into a finite capture-relay account while preserving the original tested mathematics at its own layer. PEER-REPLAY The accompanying peer-review replay package follows the paper claim order and supplies deterministic finite replays, expected outputs, source-receipt metadata, selected PACKMAN provenance, original P-05b machine receipts required for the structural binding audit, a master runner and SHA-256 manifests. External journal PDFs are not redistributed; DOI and institutional routes are supplied so reviewers can retrieve the source records independently. The replay package tests what the paper says was executed. It does not convert a CLOSE physical correspondence into an EXACT physical identity. P-23 may be describing quantum mechanics as a successful symbolic compression of finite memory-relay Reality. What it establishes more narrowly is a contiguous, replayable qualitative causal reconstruction at explicit EXACT/CLOSE grades, with the numerical predictive bridge still open and falsifiable.

•Aug 22, 2026•0 citations
THE ZYQL/ZEPHIRUM CODE — the book of the trivalent quantum decision language. 306 pages anchored in 24 sealed post-quantum receipts (Z-QEA chain: SHA3-256 + ML-DSA-44): the honest refusal of a hardware Deutsch-Jozsa, the shot auditor that refused to spend 75% of a sealed shot budget, the reproducibility audit (delta 0.0024), and the bridge between two Brazilian quantum languages. Multilingual index in 16 languages. No claim without a receipt: where there is no receipt, the book says 'not yet'. Author: Maria Clara dos Anjos, a certified workplace-safety technician from Campinas, Brazil.
Artifact release for the ZYQL quantum language (v1.3): formal EBNF grammar (ISO/IEC 14977) with operational semantics, C kernel with circuit IR and evidence receipts, pre-registered experimental campaigns on real superconducting QPU hardware (Bell baseline; FRONTIER 001-003 causal discrimination of correlation decay; QLAB-002 end-to-end VQE of H2 from a compiled .zeph program, tripartite verification), raw hardware counts, verification scripts, and maturity-labeled reports. Authors: Ravi Dos Anjos (Serena Solutions). AI orchestration (agent Solene, Base44) acknowledged in methodology; all hardware claims point to published job identifiers.2026-10-24 metadata revision. The language has since evolved into ZEPHIRUM (ZYQL) v2.1.0: a trivalent quantum machine-learning language where REFUSED is a first-class verdict (barren plateaus, decoherence, correlated noise) and every execution emits a SHA3-256 sealed receipt (post-quantum signatures ML-DSA-44 / ML-KEM-768, FIPS 204). Pure-Python kernel: statevector and MPS tensor networks, QML kernels with proven PSD, native ZNE with extrapolation guards. Test suite 66/66 with a falsifiable adversarial battery; every hardware round publishes sealed receipts and job identifiers. Repository: SerenaSolutions/zephirum-lang · Project site: serenasolutions.github.io · Worldwide launch announcement: discussions/38 --- Nota de reconciliacao (10/11/2026): deposito DUPLICADO do mesmo manuscrito. O registro canonico e 10.5281/zenodo.23330695.
Doctoral-scale thesis draft and the guarded software record of ZYQL, a necessity-first trivalent exact-decision language (1 / 0 / REFUSED) for computational quantum chemistry, with the Hybrid Boundary Pattern (exact offline decision; QPU as witness; ML-DSA-44 sealed receipts) validated on three IBM Heron superconducting processors (ibm_fez, ibm_marrakesh, ibm_kingston). Includes signed experiment records: H2 exact ground state certified at -1.1456 Ha; Bell positive/separable negative hardware controls; GHZ ladder to 20 qubits (sparse); CHSH S=1.2822 certified refusal. Software carries the ZYGUARD guardian: refusal-before-compute for seven prohibited purpose classes, structural purity (no execution primitives), post-quantum traceable receipts. License note: code is MIT; the thesis text is CC BY-NC-ND 4.0 (dual licensing declared; the record-level license field reflects the dominant artifact, the software).
v17 of the Ouroboros Thesis threads two foundational physics grafts and the full quantum-error-correction lineage through the v13 SZL Agent Body anatomy. Three named contributions are kernel-checked in Lean 4 (Mathlib v4.13.0) and mirrored by TypeScript runtime counterparts with passing test suites. §II Wheelerian audit closure — bounded delayed-choice receipt-close operator (W = 1000 ticks); operationalises Wheeler (1978) for AI doctrine; 7 theorems / 10 kernel-checked examples; 18 runtime tests. §III Shannon doctrine code — the 4-level lattice {Bot, L1, L2, Top} admits a Shannon-optimal 2-bit prefix code with Kraft sum equal to 1 at equality; receipt-channel rate bound r ≤ B/2 for an audit-closure bit-rate budget B; 7 theorems / 12 examples; 18 runtime tests. §IV QEC-evolved anatomy — wraps the v13 Heart/Brain/Blood/Immune organs with a defensive cortex threading Hamming distance/weight at the substrate, Shor [[9,1,3]] receipt replication in the blood organ (Amaru), the CSS classical-to-stabilizer bridge in the brain organ, Kitaev surface-code vertex parity in the immune organ (Sentra), and the Shannon doctrine code as a new spine; 10 theorems / 17 examples; 70 runtime tests across the ecosystem. Totals: 24 Lean theorems / 39 kernel-checked examples / 0 sorry / 0 axiom; 108 runtime tests passing; doctrine v6 clean (0 violations across 20 scanned files). Predecessor DOIs in the concept chain: v14 10.5281/zenodo.20424992; v15 10.5281/zenodo.20424995; v16 10.5281/zenodo.20424996.
v17 of the Ouroboros Thesis threads two foundational physics grafts and the full quantum-error-correction lineage through the v13 SZL Agent Body anatomy. Three named contributions are kernel-checked in Lean 4 (Mathlib v4.13.0) and mirrored by TypeScript runtime counterparts with passing test suites. §II Wheelerian audit closure — a bounded delayed-choice receipt-close operator (W = 1000 ticks); operationalises Wheeler (1978) for AI doctrine; 7 theorems / 10 kernel-checked examples; 18 runtime tests. §III Shannon doctrine code — the 4-level lattice {Bot, L1, L2, Top} admits a Shannon-optimal 2-bit prefix code with Kraft sum equal to 1 at equality; receipt-channel rate bound r ≤ B/2 for an audit-closure bit-rate budget B; 7 theorems / 12 examples; 18 runtime tests. §IV QEC-evolved anatomy — wraps the v13 Heart/Brain/Blood/Immune organs with a defensive cortex threading Hamming distance/weight at the substrate, Shor [[9,1,3]] receipt replication in the blood organ (Amaru), the CSS classical-to-stabilizer bridge in the brain organ, Kitaev surface-code vertex parity in the immune organ (Sentra), and the Shannon doctrine code as a new spine; 10 theorems / 17 examples; 70 runtime tests across the ecosystem. Totals: 24 Lean theorems / 39 kernel-checked examples / 0 sorry / 0 axiom; 108 runtime tests passing; doctrine v6 clean (0 violations across 20 scanned files). Companion Lean modules in szl-holdings/lutar-lean. Companion runtime in szl-holdings/platform/packages/doctrine-runtime. Ecosystem integrations in szl-holdings/a11oy, amaru, sentra, rosie. Predecessor DOIs in the concept chain: v14 10.5281/zenodo.20424992; v15 10.5281/zenodo.20424995; v16 10.5281/zenodo.20424996.
SQUIRL OS RESEARCH DISCLOSURE — READ FIRST: This record is part of an open-book, AI-assisted research program published under an audit-and-correction doctrine. Every record is audited; errors are corrected only through disclosed, versioned amendments (original versions preserved in the version history). Audit ledger and correction receipts: github.com/LLong2026/squirrel-os-lindy-test. This material is a prototype, provided for educational and research purposes only; it is not intended for production use, commercial deployment, or safety-critical environments. Abstract This Canon establishes the complete theoretical and applied architecture of Deterministic System/Output Science (DSOS) and its culminating discipline, Deterministic Quantum-Classical Operations (DQCO) for Post-Quantum Cryptography (PQC). Beginning with the Kolmogorov–Shannon Bridge — the mathematical genesis that proves a deterministic channel can be constructed whose output is informationally indistinguishable from true randomness — the Canon proceeds through seven interconnected layers: foundational mathematics, core science, universal interoperability, operating substrate, governance, cryptographic discipline, and education. Together these layers constitute a coherent, self-consistent framework that replaces probabilistic assumptions with deterministic guarantees across the full computing stack. The DSOS Axioms provide the formal scientific bedrock; the Universal Bridge provides heterogeneous interoperability; JasperOS and SquirrelOS provide deterministic execution substrates; the Governance Framework provides provable policy enforcement; the DQCO discipline provides post-quantum cryptographic correctness; and the Educational Layer ensures human perpetuation of the canon across generations of engineers, architects, and policymakers. The Canon is intended as both a living reference for practitioners and a founding text for the DSOS scientific community. Public receipts: append-only work ledger and determinism-test preregistrations — Lindy test receipts: github.com/LLong2026/squirrel-os-lindy-test | Horsemen benchmark preregistrations: github.com/LLong2026/four-horsemen
FRC Paper P-23 - Quantum Reality Before the Symbols A Finite Memory-Relay Reconstruction of Interference, Local Capture, Repeated Counts, Signed Interaction, Spin, Exclusion, Binding, Discrete Levels and Emission By Joe Bloggs “The quantum symbol may be the receipt. The question is what finite Reality had to do before the receipt could exist.” WHAT THIS MAY BE P-23 may be pointing towards a simple possibility: the familiar quantum symbols may be highly successful compressed receipts of a finite Reality whose causally relevant history is richer than the final measurement record. Across interference, repeated counts, signed interaction, magnetic response, spin, exclusion, binding, discrete levels and emission, the same less-compressed scene repeatedly survives the audit: a finite condition arrives carrying retained history; it meets an active boundary; not every continuation is compatible; the realised encounter changes the relation; the consequence is retained; and where physically handed forward it becomes part of the next event. If the CLOSE correspondences survive future quantitative tests, several apparently separate quantum mysteries may be different symbolic views of this one event grammar. The wave-like receipt may describe distributed route-conditioned memory before closure, while the particle-like receipt describes one local completed Capture. Probability may be a later count over finite histories that a nominal apparatus reset does not fully restore. A field may partly compress finite source-conditioned ancestry arriving at later boundaries. Spin may concern a complete Candidate-plus-landscape relation whose ordinary presentation has returned before every retained relationship has. Exclusion may be finite receiving capacity. Binding may be persistent admissibility under containment, compatibility and recurrence. Emission may be realised difference leaving a changed bound relation through finite Relay. WHAT THIS PAPER ESTABLISHES The formal claim is deliberately smaller than the possible reading. P-23 does not claim that FRC has replaced quantum mechanics, derived the Born rule, calculated the elementary charge, reproduced the electron magnetic moment, derived the hydrogen spectrum, or generated a universal event-local constitutive law. It does not treat wavefunction, spinor, gauge field or probability as disproved mathematics. It asks whether the observed receipts can be reconstructed through a lower-level finite causal grammar without importing those later symbolic objects as upstream causes. The paper establishes or source-locks the following layered results: · Interference: route availability and route-conditioned finite history can alter later compatibility before one local detector Capture; the quantitative fringe/Born law remains open. · Local detection: one realised compatible contact closes to one primary local Capture without a separate global-collapse primitive. · Repeated counts: finite recurrent and apparatus-dependent histories can generate stable finite count distributions before probability is named; Born correspondence remains open. · Signed interaction: the Candidate-E model contains two opposite role-relative structural sectors and cancelling signed handover bookkeeping; measured elementary charge and the full electric force law remain open. · Finite source-conditioned influence: retained source difference can be handed boundary-to-boundary along realised finite ancestry; isotropic field geometry and inverse-square magnitude are not derived. · Spin: neutron interferometry source-locks the reference-relative 2pi sign/4pi return receipt; the FRC physical bridge is CLOSE because the microscopic magnetic interaction-to-retained-memory update is not directly measured. · Exclusion: a one-capacity same-class refusal theorem is exact conditionally, and free-electron antibunching is source-locked operationally; universal physical Pauli identity remains CLOSE until the event-local capacity map is independently measured. · Binding: P-05b supplies an executed finite structural bound certificate inside its declared model, while real hydrogen supplies the physical bound-system receipt; physical Candidate-E/hydrogen identity and numerical binding remain CLOSE/open. · Discrete levels: finite recurrent bound-state classes are structurally discrete, while hydrogen spectroscopy supplies discrete physical receipts; numerical class-to-energy calibration remains open. · Emission: realised bound-state change can be represented by Capture -> Release -> finite Relay -> outward receipt; spectral-line records source-lock the observation class, while transition selection and quantitative energy/frequency derivation remain open. THE TERMINAL DISTINCTION The paper therefore closes a qualitative causal explanation only at explicitly layered EXACT/CLOSE grades. A complete target-blind quantitative replacement for quantum mechanics is not claimed. The remaining frontier is boundary-specific constitutive prediction, event-resolved evidence where internal order is not measured, and calibration from finite changed relation to measured action, energy, intensity, magnetic moment or frequency. Further progress must predict held-out receipts rather than rearrange the memory grammar after the answer is known. FRAMEWORK POSITION P-23 follows P-22 in Phase V - Reality Audit, Correspondence and Empirical Accountability. It is not a return to the earlier symbol-first quantum branch. Instead it uses Papers 21, 21a and 21b as the methodological filter through which the older finite-closure quantum papers are re-audited. Results from Papers 3, 11, 12 and 19 are retained only where they survive that stricter reality-first audit; downstream Hilbert, U(1), spinor, probability and eigenphase machinery is not allowed to become upstream physical authority merely because it reproduces familiar quantum language. The paper's primary structural ancestry is therefore: Primitive 0 and finite realisation -> compatibility filtering -> closure -> retained relational redundancy -> primitive structural matter -> finite restoration/recurrence -> certified Hydrogen-seed -> source-locked correspondence audit -> three-memory grammar -> reality-first reconstruction -> P-23 quantum reconstruction. P-22 is the immediately preceding programme paper and a methodological precedent for uncompressing successful mathematical receipts into a finite capture-relay account while preserving the original tested mathematics at its own layer. PEER-REPLAY The accompanying peer-review replay package follows the paper claim order and supplies deterministic finite replays, expected outputs, source-receipt metadata, selected PACKMAN provenance, original P-05b machine receipts required for the structural binding audit, a master runner and SHA-256 manifests. External journal PDFs are not redistributed; DOI and institutional routes are supplied so reviewers can retrieve the source records independently. The replay package tests what the paper says was executed. It does not convert a CLOSE physical correspondence into an EXACT physical identity. P-23 may be describing quantum mechanics as a successful symbolic compression of finite memory-relay Reality. What it establishes more narrowly is a contiguous, replayable qualitative causal reconstruction at explicit EXACT/CLOSE grades, with the numerical predictive bridge still open and falsifiable.