As the limits of classical von Neumann architectures drive the development of continuous-state and topological processing units, the computer science community lacks a low-level Instruction Set Architecture (ISA) natively capable of programming non-associative spaces. Standard ISAs (x86, ARM, Quantum QASM) are inherently one-dimensional and chronological, operating via sequential memory addresses and associative logic gates. This paper introduces the Origami ISA, the machine code designed for 3D Simplicial Computing at the 731-tier of the unified V31 Architecture, targeting the Resonance Processing Unit (RPU) — a hardware platform that computes via continuous-state topological relaxation rather than discrete unitary gates. We formally define the hardware opcodes using a geometric visual alphabet of Pachner moves ($\blacksquare$ Split, $\lozenge$ Splat, $\blacktriangle$ Flip, $\rhd$ Flop) and scheduling/gauge operators ($\circlearrowleft$ Twist, $\circledast$ Triality Spin). We replace generic spiders with 4-legged Tree-Frogs and plain wires with 3-colored Ribbon-Legs. Crucially, the ISA enforces the "Four-Leg Constraint," reflecting the physical limit of the tetrahedron's four faces. Compiler Mnemonic: "Four legs good. More than four legs bad." The opcode pairing is not arbitrary: the $G_2$ root/coroot isomorphism $\sigma$ maps $\blacksquare \mapsto \lozenge$ and $\blacktriangle \mapsto \rhd$ exactly, making Split/Splat and Flip/Flop canonical duals. The Mirror Square identity $\lozenge \circ \blacksquare = \rhd \circ \blacktriangle = \mathrm{id}$ on Fano-compatible states is the hardware unitarity guarantee. Algebraic Rewriting Rules (Compiler Cheat Sheet): We supply the complete set of single-pass compiler optimisations available when the instruction stream contains short opcode sequences on Fano-adjacent registers: Fano-closure optimisation (Theorem 7.5): a queued triple $\blacksquare_i, \blacksquare_j, \blacksquare_k$ on an ordered Fano triple reduces to the explicit projector $I - \pi_i - \pi_k - 2\pi_j$. Three surgeries become one projector. Sandwich reduction (Moufang Echo): a pattern $\blacksquare_\alpha, \blacksquare_\beta, \blacksquare_\alpha$ reduces to $\blacksquare_\beta$ restricted to the 4-dimensional complement of the Fano span. Exact commutator (Malcev Resolution): $[\blacksquare_i, \blacksquare_j] = \blacksquare_k \circ D_{ijk}$, where $D_{ijk}$ is an explicit diagonal matrix. This gives the compiler the precise cost of out-of-order execution. No-parallelisation rule (Theorem 7.6): $|[\blacksquare_i, \blacksquare_j]|_F = 4\sqrt{2}$ for all 21 distinct pairs. No two $\blacksquare$ Split or $\blacktriangle$ Flip operations on distinct registers commute. This is a constraint of $G_2$ geometry, not an implementation limitation. The Arithmetic Logic Unit (ALU) operates as a continuous thermodynamic evaluator realized by the Maslov-Gibbs Einsum (MGE) as the monadic descent operator: driving $\beta \to \infty$ collapses continuous gauge freedom into the rigid discrete $G_2$ invariants, locking the computation. Finally, we introduce Simplicial Paging to dynamically coarse-grain resolved 731-crystals into scalar pointers, maintaining constant-depth overhead.
As the limits of classical von Neumann architectures drive the development of continuous-state and topological processing units, the computer science community lacks a low-level Instruction Set Architecture (ISA) natively capable of programming non-associative spaces. Standard ISAs (x86, ARM, Quantum QASM) are inherently one-dimensional and chronological, operating via sequential memory addresses and associative logic gates. This paper introduces the Origami ISA, the machine code designed for 3D Simplicial Computing at the 731-tier of the unified V31 Architecture, targeting the Resonance Processing Unit (RPU) — a hardware platform that computes via continuous-state topological relaxation rather than discrete unitary gates. We formally define the hardware opcodes using a geometric visual alphabet of Pachner moves (■ Split, ◊ Splat, ▲ Flip, ⊳ Flop) and scheduling/gauge operators (↺ Twist, ⊛ Triality Spin). We replace generic spiders with 4-legged Tree-Frogs and plain wires with 3-colored Ribbon-Legs. Crucially, the ISA enforces the "Four-Leg Constraint," reflecting the physical limit of the tetrahedron's four faces. Compiler Mnemonic: "Four legs good. More than four legs bad." The opcode pairing is not arbitrary: the G2 root/coroot isomorphism σ maps ■↦◊ and ▲↦⊳ exactly, making Split/Splat and Flip/Flop canonical duals. The Mirror Square identity ◊∘■=⊳∘▲=id on Fano-compatible states is the hardware unitarity guarantee. Algebraic Rewriting Rules (Compiler Cheat Sheet): We supply the complete set of single-pass compiler optimisations available when the instruction stream contains short opcode sequences on Fano-adjacent registers: Fano-closure optimisation (Theorem 7.5): a queued triple ■i,■j,■k on an ordered Fano triple reduces to the explicit projector I−πi−πk−2πj. Three surgeries become one projector. Sandwich reduction (Moufang Echo): a pattern ■α,■β,■α reduces to ■β restricted to the 4-dimensional complement of the Fano span. Exact commutator (Malcev Resolution): [■i,■j]=■k∘Dijk, where Dijk is an explicit diagonal matrix. This gives the compiler the precise cost of out-of-order execution. No-parallelisation rule (Theorem 7.6): ∣[■i,■j]∣F=42 for all 21 distinct pairs. No two ■ Split or ▲ Flip operations on distinct registers commute. This is a constraint of G2 geometry, not an implementation limitation. The Arithmetic Logic Unit (ALU) operates as a continuous thermodynamic evaluator realized by the Maslov-Gibbs Einsum (MGE) as the monadic descent operator: driving β→∞ collapses continuous gauge freedom into the rigid discrete G2 invariants, locking the computation. Finally, we introduce Simplicial Paging to dynamically coarse-grain resolved 731-crystals into scalar pointers, maintaining constant-depth overhead.
CORRECTION NOTICE (2026-08). The figure "4.3× directed magic-routing efficiency", quoted three times and attributed to a companion paper, does not appear in that paper. It is unsourced and should be disregarded. A revised version is in preparation. The Origami Instruction Set Architecture (O-ISA) was introduced alongside a conjectural exotic hardware substrate — the Resonance Processing Unit (RPU) — requiring non-associative materials to support octonion computation. This paper establishes that the base Origami ISA requires no exotic hardware whatsoever. It runs today on any quantum processor supporting three-qubit gates: superconducting transmons, trapped ions, neutral atoms, and photonic chips. Two complementary architectural primitives are specified. The TriQ (Origami Triple) is the fundamental three-qubit register: three physical qubits in Fano-plane incidence connectivity, corresponding to one logical qubit in the [[7,1,3]] Steane code. The SQU (Symplectic Quantum Unit) is the full processor architecture built from TriQ registers, with the Magic-ISA opcode set and inter-register typed routing. The SevenQ is the complete seven-qubit Fano register: all seven points of PG(2,2) simultaneously realised, corresponding to the full [[7,1,3]] Steane code with its six gauge degrees of freedom corresponding bijectively to the six non-classical Fano orbit valences. The key diagnostic opcode is ORBIT: seven simultaneous Pauli measurements returning the Fano orbit valence label of the register state, replacing the conjectured Freudenthal determinant ALU with seven standard readout operations. The SQU achieves fault-tolerant universal quantum computation with 7 physical qubits per logical qubit for CS-family gates via gauge-orbit selection, and 15 for CCZ gates via code switch — both at zero magic-state distillation overhead. A critical non-obvious result: SevenQ ORBIT is identical to standard Steane syndrome extraction. The seven syndrome measurements already performed at every error correction cycle are the ORBIT opcode, with the orbit valence label computed in classical post-processing at zero additional hardware cost. Three hardware tiers are defined: SQU (standard qubits, available today), SQU-diode (6-7 directed Fano coupling topology, near-term), and RPU (non-associative materials, long-term). The SevenQ-diode variant applies the 6-7 broken-symmetry topology to the full seven-qubit register for directed magic routing at 4× symmetric efficiency. The paper also establishes the exploration order for the projective tower: TriQ (3 qubits, minimal n=3) → SevenQ (7 qubits, complete n=3) → 1531-Anvil (15 qubits, first n=4). Keywords Origami ISA, TriQ, SevenQ, SQU, Symplectic Quantum Unit, Fano Plane, PG(2,2), Magic-ISA, ORBIT Opcode, Steane Code, [[7,1,3]] Code, Fault-Tolerant Quantum Computation, Magic State Distillation, CS Gate, Gauge Selection, Quantum Error Correction, Coherent Error Detection, Magic Valence, Fano Orbit, Superconducting Qubits, Trapped Ions, Neutral Atoms, Quantum Hardware, Instruction Set Architecture, 6-7 Topology, Directed Magic Routing, SevenQ-Diode, SQU-Diode, Adelic Simplicial Architecture, Resonance Processing Unit
PENDING QUALITY AUDIT (2026-08). The file is restricted while this record is reviewed as part of a systematic audit of the author's corpus. It has not yet been assessed. Metadata and DOI remain public, and access can be requested. The Origami ISA executes algorithms as Pachner moves on simplicial complexes at inverse temperature β→∞ (the discrete, tropical limit). The Meld identifies the β→0 limit, where the same opcodes become the operators of smooth Hodge theory. The Forge ISA is the bridge: the same five opcodes (SPLIT, SPLAT, FLOP, FLIP, TWIST) running at finite inverse temperature β under a Gibbs distribution over H¹-weighted configurations. A Forge ISA programme at inverse temperature β is an Origami ISA programme on a sheaf ℱ over a simplicial complex X, where FLOP corrections are applied with probability proportional to the Gibbs weight exp(−β‖H¹(s)‖), and the Maslov–Gibbs Einsum (MGE) is the unique β-correct implementation. The critical temperature β*(ρ) = (3/8) ln(1/(1−ρ)), where ρ = β₁/|E| is the load factor (first Betti number divided by edge count), is the universal threshold separating the efficient (β < β*) from the stalled (β > β*) regime, empirically confirmed across eight algorithm classes. The Topological Resonance Synthesis (TRS) mandate (five purity conditions) ensures the Forge ISA is thermodynamically correct: β appears only in the Hamiltonian via the MGE; conformal, symplectic, and adiabatic structure are preserved throughout. Standard machine learning optimisers (Adam, dropout, batch normalisation) violate one or more of these conditions. The vorton is the elementary sampler — a single draw from the Gibbs distribution P_β on the state manifold — and the snap event is crystallisation at the harmonic representative of H¹. The Forge ISA is the engine of the TRS trilogy: the Origami ISA (cold reservoir, β→∞), the Forge ISA (the cycle, 0 < β < ∞), and the Meld (hot reservoir, β→0). Keywords instruction set architecture, thermodynamic computation, Gibbs distribution, inverse temperature, Origami ISA, The Meld, TRS trilogy, Maslov–Gibbs Einsum, MGE, simplicial complexes, sheaf theory, H¹ cohomology, Hodge theory, critical temperature, β-ladder, vorton, snap event, Carnot cycle, information geometry, topological resonance synthesis, differentiable programming, tropical geometry, adiabatic computation, Fisher metric
PENDING QUALITY AUDIT (2026-08). The file is restricted while this record is reviewed as part of a systematic audit of the author's corpus. It has not yet been assessed. Metadata and DOI remain public, and access can be requested. A practitioner's primer for quantum computing researchers. No knowledge of octonions, sheaf theory, or category theory is assumed. Knowledge of stabiliser states, the Clifford group, and T-gates is assumed. The central message: the structure of the 3-qubit Pauli group is secretly governed by the Fano plane PG(2,2), and the Fano plane is the geometry of the 731 instruction set architecture (731 ISA) — a unified framework for quantum computation that organises every opcode as a Pachner move on a simplicial complex. The framework reveals three levels of quantum computational resource:• Level 0 (Clifford): stabiliser states; Gottesman-Knill simulable; the Fano lines are the free sector.• Level 1 (Standard magic): T-gates; Wigner function negativity; non-Clifford but accessible to the Origami ISA (regime 2).• Level 2 (Associamancy): the SPIN opcode; the Schur boundary; genuinely complex irreps of PSL(2,7); not accessible to any associative hardware. The Origami ISA (five opcodes: SPLIT, SPLAT, TWIST, FLIP, FLOP) subsumes Bell sampling, qudit stabiliser learning, and the abelian hidden subgroup problem as special cases. The 731 ISA adds SPIN and BIND, unlocking Level 2. This primer is a companion to "The Topology of Risk" (doi:10.5281/zenodo.20642983), which covers the same H⁰/H¹/H² framework applied to financial risk. Keywords: quantum computing, Fano plane, Origami ISA, 731 ISA, stabiliser states, magic states, associamancy, Schur boundary, primer, tutorial, hidden subgroup problem, MBQC, photonics
We survey the Origami Instruction Set Architecture (), a universal opcode language whose seven primitives---FLIP, FLOP, SPLIT, SPLAT, TWIST, LABEL, ORBIT---together with an eighth, BIND, describe every physical process at every scale from quantum gravity to metabolism. The algebraic closure of these opcodes is the Fano incidence structure = PGL(3,\GF_2), and their computational complexity hierarchy stratifies into three tiers: H^0 (tropical/classical), H^1 (Clifford/stabiliser), and H^2 (magic/topological). This hierarchy is a physical observable: the H^k tier of a process determines whether it can be simulated classically (H^0), efficiently by stabiliser circuits (H^1), or requires genuine quantum resources (H^2). We survey applications across nuclear and particle physics, quantum field theory, condensed matter, quantum chemistry, biology, mathematics, and economics, citing over forty companion papers in which each domain is developed in detail. We state nine open problems including the uniqueness conjecture and the completeness question beyond qutrits.
PENDING QUALITY AUDIT (2026-08). The file is restricted while this record is reviewed as part of a systematic audit of the author's corpus. It has not yet been assessed. Metadata and DOI remain public, and access can be requested. The seven opcodes of the Origami instruction-set architecture (ISA) — FLOP, SPLIT, TWIST, LABEL, BIND, FLIP, SPLAT — play structurally identical roles across every exactly solvable quantum model with a phase transition. This paper establishes a universal dictionary: FLOP is always the fermionisation map (Jordan–Wigner / slave-boson / Majorana representation); SPLIT is always the diagonalisation (Bogoliubov / Bethe rapidity / stabiliser expansion); TWIST is always the gap check (Berry phase / Chern number / spectral gap); LABEL is always the sector projection (gauge fixing / stabiliser projection / Bethe vacuum). BIND — the three-body frog vertex — is the unique opcode whose presence or absence determines whether a phase supports Abelian or non-Abelian anyons. Two theorems are proved. The BIND = Non-Abelian theorem: a gapped topological phase has non-Abelian anyonic order if and only if its minimal ISA programme contains BIND. The Universal Phase Boundary theorem: for any model in the SU(2)q family at q = exp(iπβ), the quantum phase transition is a TWIST failure at β = 1/2, where the quantum dimension d{1/2}(β) = 2cos(πβ) = 0 exactly. A master table across twelve models — toric code, Kitaev honeycomb, TFIM, XXZ chain, string nets, quantum doubles, SYK, MBQC, ZX-calculus, and others — makes the dictionary explicit. The Origami ISA is the universal language in which condensed-matter physicists, quantum-information theorists, and representation theorists describe the same computation under different names. Keywords instruction set architecture, exactly solvable models, topological order, non-Abelian anyons, quantum phase transitions, Origami ISA, Jordan–Wigner transformation, Bogoliubov transformation, Bethe ansatz, toric code, Kitaev honeycomb, XXZ chain, string-net condensation, quantum doubles, SYK model, MBQC, ZX-calculus, Frobenius algebra, quantum groups, Berry phase, BIND theorem, β-ladder, tensor networks, categorical quantum mechanics
PENDING QUALITY AUDIT (2026-08). The file is restricted while this record is reviewed as part of a systematic audit of the author's corpus. It has not yet been assessed. Metadata and DOI remain public, and access can be requested. We articulate a structural parallel between the MIP*=RE theorem and the Origami Instruction Set Architecture (ISA). The algebraic rigidity of entangled-prover verification — exact-or-fail Pauli basis tests, low-degree tests, Mermin Magic Square constraints — corresponds precisely to the Frobenius axiom SPLIT∘SPLAT=1, the Pentagon identity, and the seven-point Fano plane PG(2,2) in the ISA framework. Six numerical experiments confirm the parallels: Pentagon unitarity holds exactly for all j ∈ {1/2,...,15/2}; Frobenius fidelity degrades as (1-p)^{2(2j+1)} under depolarising noise; the GHZ stabiliser group forms a perfect quantum Fano strategy satisfying all seven constraints simultaneously while no classical strategy can; G₂ non-associativity produces a sharp excluded-volume step function above j=7/2. This version adds a synthesis remark showing that the numbers 3 and 7 — the two dimensions where the cross product exists, gyroscopes are stable, and choreographic orbits can close — are not two separate coincidences but the same theorem: the Fano plane PG(2,F₂) has 7 points and 3 points per line because these are the imaginary unit counts of the octonions O and quaternions H respectively, forced by the unique projective plane of order q=2 over the field F₂. The broken Fano (6/7 architecture) and the magic/non-associativity conjecture are restated in this unified language. The practical implication is a conjecture that fault-tolerant quantum computing overhead is governed by the regime of the code's F-move amplitudes, with MSD-free computation possible at rung 1 and higher. Keywords MIP* Equals RE, Interactive Proof Systems, Quantum Entanglement, Pentagon Identity, Frobenius Axiom, Fano Plane, PG(2,2), GHZ Stabiliser, Origami ISA, Wigner 6j Symbol, Fault-Tolerant Quantum Computing, Magic State Distillation, Regime Ladder, Complexity Theory, Quantum Prover, Local Pauli Test, Low-Degree Test, G₂ Non-Associativity, Excluded Volume, Depolarising Noise, Rung-1, Quantum Verification, Adelic Simplicial Architecture