The Substrate Language Compiler is the executable computation branch of the SAM Research Project. The current frozen revision, SLCV1.2-H14F-EA18WA-D9, preserves the N100 native basis and H14F exact variable-elimination fallback of the earlier SLC line while installing the complete Exact Algebra of a Write, the directional T18/Z4^9 Weil adapter with reconstructible W9 reciprocal history, and an exact reversible dyadic block interface at depths 1 through 9. The source grammar remains the object of computation: N100 is not replaced by a smaller physical problem, and the current machine still returns exact global tensors whose coefficient sums close to the complete formal state count. The canonical N100 frustrated-spin computation retains all 2^100 formal binary configurations of the unchanged 100-spin, 260-edge Hamiltonian. The structure-first route detects eight exact components of sizes 15,15,15,15,15,10,10,5, evaluates 165,920 local assignments, and reconvolves them into the same coefficientwise-identical tensor returned by the full H14F path. The current SLC therefore treats graph structure, separator width, quotient rank, reversible history, and readout type as computational certificates rather than as after-the-fact annotations. SLCV1.2 adds a native write engine whose exact finite semantics include the complete 256-state W8 shell, B-gated X1 activation, W9 record emission and W9-to-W8 return, signed Z4^9 action, endpoint reversal, the 161-coordinate nonconstant history quotient, completed-mode projection, analytic Bt/Et/J/P+/- operators, and multiplicative-ledger readback. A 4,096-write program applied at every one of 262,144 addresses represents 1,073,741,824 logical transitions; the compiled group-law path produces bit-identical output and exact inverse closure with a recorded same-task speedup of 1784.531387x. The directional Weil fusion replaces the former NumPy write seam with this native exact write while leaving the prime-spacing and completed-Weil channels unchanged. The machine now joins exact dense state computation, typed record semantics, reciprocal direction, and read-only Weil custody in one frozen architecture. The result is a compiler whose central principle is unchanged: preserve the complete mathematical object, identify the information that must remain live, contract the rest exactly, and retain enough custody that the result can be independently reconstructed
The Substrate Language Compiler is the executable computation branch of the SAM Research Project. The current frozen revision, SLCV1.2-H14F-EA18WA-D9, preserves the N100 native basis and H14F exact variable-elimination fallback of the earlier SLC line while installing the complete Exact Algebra of a Write, the directional T18/Z4^9 Weil adapter with reconstructible W9 reciprocal history, and an exact reversible dyadic block interface at depths 1 through 9. The source grammar remains the object of computation: N100 is not replaced by a smaller physical problem, and the current machine still returns exact global tensors whose coefficient sums close to the complete formal state count. The canonical N100 frustrated-spin computation retains all 2^100 formal binary configurations of the unchanged 100-spin, 260-edge Hamiltonian. The structure-first route detects eight exact components of sizes 15,15,15,15,15,10,10,5, evaluates 165,920 local assignments, and reconvolves them into the same coefficientwise-identical tensor returned by the full H14F path. The current SLC therefore treats graph structure, separator width, quotient rank, reversible history, and readout type as computational certificates rather than as after-the-fact annotations. SLCV1.2 adds a native write engine whose exact finite semantics include the complete 256-state W8 shell, B-gated X1 activation, W9 record emission and W9-to-W8 return, signed Z4^9 action, endpoint reversal, the 161-coordinate nonconstant history quotient, completed-mode projection, analytic Bt/Et/J/P+/- operators, and multiplicative-ledger readback. A 4,096-write program applied at every one of 262,144 addresses represents 1,073,741,824 logical transitions; the compiled group-law path produces bit-identical output and exact inverse closure with a recorded same-task speedup of 1784.531387x. The directional Weil fusion replaces the former NumPy write seam with this native exact write while leaving the prime-spacing and completed-Weil channels unchanged. The machine now joins exact dense state computation, typed record semantics, reciprocal direction, and read-only Weil custody in one frozen architecture. The result is a compiler whose central principle is unchanged: preserve the complete mathematical object, identify the information that must remain live, contract the rest exactly, and retain enough custody that the result can be independently reconstructed
The NEXUS Quantum Compiler Mathematical-Space Execution and Constrained Molecular Folding Native reversible routes · quantum-sector reduction · legal molecular transformations · classical execution Driven by Dean A. Kulik · October 2026 ABSTRACT A quantum-compatible mathematical state space can be compiled and executed on ordinary classical hardware when its constraints, return paths, and observable symmetry sectors are explicitly represented. This manuscript integrates two complementary NEXUS studies without replacing either with a shorter summary. The first examines the exact native ring and E/G return machinery and audits an earlier quantum lattice-protein simulation whose eight-address mixer introduced four transitions through invalid padding states. It derives the short-time leakage coefficient 49/75, explains the distinction between finite penalties and exact subspace preservation, identifies the disconnected projected graph, and records the approximation and environmental-return requirements. The second advances to a self-avoiding honeycomb-chain compiler in which turn words construct geometry and admissible bit rewrites construct the transition graph. Global complement is an exact mirror symmetry; for a complement-stable Hamiltonian it separates the quantum space into even and odd sectors, retaining the necessary sheet sign and inverse readout. In the 12-residue HP example, 776 legal conformations form 388 mirror pairs. Classical propagation in the full Hilbert space and its independently assembled mirror-even sector agrees after reconstruction to machine precision under the reported sparse solver; the precise rounding error is implementation dependent. Local four-turn hexagon rewrites are reversible but fragment the legal graph; unrestricted pivots reconnect it while sacrificing bounded spatial support. Together these results establish a rigorous, finite compiler architecture and a precise reduction in the resources needed for symmetry-selected states. They do not establish experimentally validated molecular kinetics, a general quantum-simulation speedup, or measured low electrical power. The remaining link is an independently constrained molecular transition generator, its environmental coupling, and a resource benchmark carried out under the same input–output contract. Keywords: NEXUS; reversible routing; quantum-inspired classical simulation; parity decomposition; Hilbert-space reduction; self-avoiding walks; hydrophobic-polar models; constrained transitions; local moves; protein folding. Figure 1. The integrated compiler path: binary word → geometric legality → admissible transition graph → symmetry sectors → classical propagation. The route back to full state is explicit. PART I / THE NATIVE STATE SPACE AND WHAT “QUANTUM COMPILER” MEANS 1. Problem statement: computation before hardware The motivating hypothesis is that a sufficiently explicit mathematical relation space can execute useful quantum-style calculations on conventional, low-power hardware. In its strongest form, this would make special-purpose quantum machines unnecessary for the targeted tasks. A physically meaningful version of that hypothesis must distinguish three different propositions: an algebraic operator can be represented classically; a specified quantum evolution can be simulated faithfully; and the simulation has an advantageous cost in time, memory, or joules. The first two are demonstrated here in a finite structured family. The third remains subject to benchmarking. The Nexus program approaches problems from legal transformations and their return paths rather than from cataloged answers. Earlier One Inverter and twisted-partner-ring work constructed involutions, native addresses, temporal center reads, and odd-lane locks [1, 2]. The honeycomb extensions (§§144–146) supply a particularly instructive domain: a word is a conformation-generating route, while a molecular move is determined by geometry rather than by neighboring values in an address table [2]. Classical simulation of quantum subfamilies is established mathematical territory. Stabilizer circuits admit efficient classical simulation [6], and quantum-inspired linear algebra can dequantize some low-rank algorithms under explicit data-access assumptions [7, 8]. The point of the present work is narrower: show where the Nexus native-route and reflection machinery gives a concrete geometry-respecting Hilbert-space reduction, with complete return information and negative controls. The governing research hypothesis is stronger than an indexing engine. The compiler is proposed as a transformation architecture: a molecular sequence and surroundings determine lawful continuations, and a fold is the realized trajectory rather than a catalog match. The scientific question is whether a native, local, reversible transformation system reproduces a molecular process without placing the answer in a chosen transition matrix. Three different “one answer” statements must remain typed. A fully specified deterministic calculation has one result. A fully specified quantum experiment has a definite predicted probability distribution but may have multiple measurement outcomes. A protein may have an ensemble of conformations that changes with conditions. The route does not license substituting one for the others. For this paper, “compilation” has a testable meaning: construct a state domain, certify lawful transformations, select a representation that makes required relations visible, propagate that declared operator, and preserve an inverse or a residual route. Classical hardware is sufficient to carry out these finite algebraic steps. Whether it is efficient for an enlarging family depends on the structure of that family, not on a claim that all quantum amplitudes can be recovered from one address. 2. Native ring: partner, face, canonical address, and exact return For an n-bit word, J is bit reversal and C is bitwise complement. Define P(x)=J(x) unless x is palindromic, in which case P(x)=C(x). P²=I, P has no fixed word, and the native ring pairs addresses antipodally: PTP=T⁻¹, where T is the ring’s own successor. The inward E/G route ends at width two, retaining each branch and middle qualifier and a face bit. The complete code is n bits for an n-bit word; reconstruction is exact but not generic compression. P(x) = J(x) if J(x) ≠ x; P(x) = C(x) otherwise. The canonical address is an exact re-labeling of word space. T is a native address successor. A raw k-bit transport shift, a partner read, and T are separate operators. In particular, declaring an edge between successive catalog addresses does not establish that the corresponding conformations are molecular neighbors. Three interfaces must not be conflated. The native ring successor T is a step in canonical address order. The geometric word rewrite is a change of chain conformation. A measurement/readout R extracts a specified property of the state. In particular, T does not become a protein move simply because it is a reversible permutation. The twisted one-inverter clock and temporal reader The “One Inverter” paper derives the affine twisted rotation τ(x₀…xₙ₋₁)=x₁…xₙ₋₁¬x₀, so after k ticks the first k departing bits are returned complemented. At k=n it is global complement; at k=2n the state returns. The inward terminal reader is exactly the XOR of the two central word bits. Under τ, its temporal trace reads each adjacent difference around the cyclic word, with one known inverted crossing. τᵏ(x) = rotlₖ(x) ⊕ (2ᵏ − 1), 0 ≤ k ≤ n; τⁿ = C, τ²ⁿ = I. r(x) = xₙ/₂₋₁ ⊕ xₙ/₂ ; ⊕ₜ₌₀ⁿ⁻¹ r(τᵗ x) = 1. [even n] The n−1 independent adjacent differences plus one native face bit recover the word. The two-bit closed complement-feedback rule is τ², not a new primitive. None of this creates a physical molecule; it gives a provably executable, invertible substrate for how a local reader can obtain and return distinctions. Odd-lane locks and relational deviations For odd q and n=qs, the alternating-complement lift Λq(u)=u‖Cu‖u‖…‖u is invariant under the twisted clock and intertwines J, C, and P. A center trace of period s identifies this lock and supports exact reconstruction through the first s-bit lane. In the full q-lane state, de-staggered lane differences and one anchor preserve all n bits. τₙ Λq = Λq τₛ ; Pₙ Λq = Λq Pₛ ; dH(Λq u,Λq v) = q · dH(u,v). These differences were formerly called “defects.” They are lawful relational deviations from a selected lock—not failures of the transformation. Under common affine transport, differences rotate and preserve weight. An external input can alter them at a known boundary, but selecting an input law is not already derived by the native permutation. The native address T, the twisted clock τ, and the geometric pivot defined later remain separate typed operators. The exact E/G route has n bits for a general n-bit input. A locked multi-lane family instead requires only its independent local state and the stated lift rule; the reduction comes from a demonstrated invariant restriction, not from labeling an arbitrary large input “locked.” Which operations the embedding preserves The One Inverter temporal read is an operational return path, not just a yes/no label. For n=2h, define the cyclic adjacent differences Dᵢ=xᵢ⊕xᵢ₊₁ (indices modulo n) and the observed center trace yₜ=r(τᵗx). The twisted boundary contributes exactly one inverted crossing. Over n ticks the center presents n relations; their XOR equals one, and n−1 of them together with the retained canonical face bit reconstruct the entire original word. The E/G inward/outward route supplies a separate exact return by retained qualifiers. Neither return is compression of arbitrary n-bit words. yₜ = D₍ₕ₋₁₊ₜ₎ mod n ⊕ [t=h], ⊕ₜ₌₀ⁿ⁻¹ yₜ = 1; (y₀,…,yₙ₋₂, face) ↔ x. The two masks must not be conflated. The mirror shell lamps are gⱼ=xⱼ⊕xₙ₋₁₋ⱼ, the paired entries in x⊕J(x). The dist
This update consolidates the formal, numerical, and publication-level corrections identified after Revision 3.0 of the FEINMAN 2 project and after direct execution of its reproducibility package. The underlying proposal remains a typed directed operator-graph calculus organized through the locked 4S-11S operator-space chain. The update does not introduce a new interaction or a confirmed deviation from standard quantum mechanics or quantum electrodynamics. Its main contribution is instead evidential and methodological: the complete package was checked by exact SHA-256 verification and rerun in the frozen environment (Python 3.13.5, NumPy 2.3.5, Linux x86_64/glibc 2.41), producing STATE=DONE and TESTS=PASS. The run reproduces the Cl(0,8) eight-generator certificate, the 32x32 extended Pauli certificate, the standard-QED anomalous-frequency checksum, the TERRA/ZERRA finite-grid count, and the frozen H2/H3+ finite-basis molecular outputs. The update corrects the benchmark-contract hash to c006873e...db777, distinguishes a recovery checksum from an independent one-loop integration, replaces the ambiguous bridge limit B->I by an explicitly declared identification or isometry between Hilbert spaces, and separates verified implementation claims from open physical claims. It also records incomplete executable coverage for graph-schema rejection tests, numerical no-signalling regression, and the TERRA/ZERRA norm-residual certificate. FEYNMAN-2 is therefore supported as a reproducible formal and computational research platform, while promotion to a physical theory still requires a nonidentity operator assignment frozen before a sealed holdout and independently replicated.
Foundational — Relativity and Decoherence of Spacetime Superpositions Under Containment and Engine Custody This article develops a containment-first response to the reported relativity and decoherence of spacetime superpositions. It joins Universal and containment rule placement, dedicated engine custody, immutable path identity, Single-Trajectory Local Filtering, Pedigree–Transmission–Triad certification, Sign Net grading, Richardson Subspace carry, and D8 containment-of-containments history into one continuous operating framework. The presentation distinguishes the Universal placement surface from engine firing sequence. Every object receives a permanent engine number and declared path, while global fire incrementation records the order of all committed events, per-engine fire count records every scheduled engine action, and engine position count advances only when the object reaches the next declared route position. Movement is retained beneath the fire event as a derived STLF checksum, allowing repeated (0T), (0S), hold, timeout, refusal, and typed-skip records to remain at one route position without becoming duplicate events. D8 records containment-owned engine histories through receiving D8, post-fire containment, permanent engine identity, global fire order, route position, path coordinates, typed outcome, and immutable path hash. EVENT references identify one exact committed firing, while POSITION references identify one route position and its complete stationary-history family. This architecture preserves same-coordinate and same-route operation across different objects while preventing identity flattening, path rewriting, and ambiguous history return. The article also audits the assumptions used in the source framework. It identifies a direct difference at semiclassical metric intake: the source begins with metric branches associated with classical Einstein-equation solutions, while this framework begins with unresolved Gm and pre-(M) conditions that must form a locally certified MG containment frame. Hilbert space is reconstructed as nested admissible rooms, Richardson Subspace supplies bounded (0S) half-sign carry, branch dynamics arise through tighter object rules inside frozen U and containment authority, and linearity and reversible symmetry are treated through independent branch custody and replayable transformations. General covariance is mapped to label-independent containment custody, while diffeomorphism invariance is mapped to structure-preserving relabeling of containment ancestry, proportional units, time placement, route adjacency, boundary rules, and D8 references. Different paths or coordinate labels inside one invariant containment architecture support the fixed-background reading. A source condition that changes parentage, unit proportion, time mapping, MG closure, boundary size, path availability, or D8 ancestry defines the candidate architecture-changing branch. Python stress testing supports the internal architecture through dedicated-engine, route-manifest, movement-checksum, containment-graph, Hilbert-room, anchor-channel, and history-overlap harnesses. The tests detect injected identity, movement, path, containment, reference, symmetry, and history faults while preserving laboratory evidence and formal metric correspondence as separate proof layers. The resulting framework supplies a reusable custody grammar for distinguishing coordinate description, path difference, containment architecture, branch history, and public record formation. Its central result is that spacetime-superposition interpretation begins only after placement, engine identity, path authority, sign formation, grade, containment ownership, and external-history distinguishability have been separately certified.
OSIRIS v4.7.0 Monograph & Governed Release Package This technical note and empirical dataset encapsulate the complete sovereign architecture, operational history, and automated self-correction framework of the OSIRIS and dna::}{::lang project. Developed entirely on severely constrained consumer hardware—a handheld Google Pixel Fold (Node Alpha, running Termux with ARM64 NEON SIMD kernels and a 300s thermal horizon; now retired post-campaign) and a GPU-less HP laptop powered by an Intel Core i7 CPU (Node Beta, executing local quantized mentor models and NCLM continual training within WSL2)—OSIRIS proves that sovereign, verifiable scientific agency can be achieved without enterprise server clusters. Key Empirical & Architectural Contributions: Governed Execution (SYS-021): Enforces the foundational axiom 'Cognition may be distributed; authority is not.' Unverified generative models propose; deterministic AST firewalls constrain; cryptographic receipts authorize (H_payload = SHA-256(code)); and immutable Merkle DAGs record. Automated Falsification of the τ-Phase Anomaly: Under strict budget limits on the IBM Quantum Open Plan (Job dbiobimne4hc73bf2am0 on IBM Heron r2 ibm_fez), OSIRIS autonomously audited and conclusively refuted the historical December 2025 hypothesis (τ0 = 46 μs, θ_lock = 51.843°). Using 3-basis Pauli tomography (ZZ, XX, YY), OSIRIS proved that apparent 'entanglement revivals' were classical T1 relaxation artifacts to |00> (P_Bell drops to a minimum at T1*ln(2) and rebounds as qubits decay to ground; transverse coherence C_perp measures dead zero: +0.0029 ± 0.0221; θ_lock p = 0.3537). The erratum is permanently anchored under Merkle Root 7e8f20c2e0ce.... Genuine Quantum Advantage in Multi-Qubit Crosstalk Refocusing: On 156-qubit heavy-hex architecture (ibm_kingston, Job dbb4ppk24mrc73bo8ntg), OSIRIS evolved bipartite sublattice pulse-timing staggering (xy4x2_stag and osiris_evolved_g1) that crushes standard unstaggered dynamical decoupling (retaining 0.9602 and 0.9373 vs 0.8625 ground state probability) by canceling static spectator ZZ crosstalk. Continual Living Intelligence (osiris.nclm): Operates an online, byte-level transformer core governed by a permanently held-out speaking gate (≤ 2.0 bits/byte vs unigram baseline), actively distilling mentor lessons from verified writing. The package contains the full monograph, reproducible Qiskit/QPY circuit definitions, raw decoded IBM Quantum execution spans and bitstrings, Merkle governance ledgers, and the complete OSIRIS v4.7.0 codebase.