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. 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. We show that Kitaev's topological phases — the toric code, the gapless Dirac cone, and the non-Abelian phase — are three computational phases of the Forge instruction-set architecture (ISA), distinguished by opcode mix and inverse-temperature scheduling via the THERMAL compiler directive. The central result is a pair of exact identities. The F-matrix of Ising anyons equals the j = 1/2 recoupling coefficient of the quantum group SU(2)₂ at q = exp(iπ/4). The F-matrix of Fibonacci anyons equals the j = 1/2 coefficient of SU(2)₃ at q = exp(iπ/5). Both identities are verified numerically. In each case the deformation parameter q = exp(iπ/(k+2)) equals exp(iπβ), where β is the Forge ISA inverse temperature, placing topological quantum computation at finite β in the semiring-deformation interpolating family of the Maslov–Gibbs programme. Three consequences follow: (i) The ISA containment hierarchy ZX ⊂ Origami ISA ⊂ 731-ISA maps exactly onto the anyon hierarchy Abelian ⊂ Ising ⊂ Fibonacci. The same algebraic ladder that organises instruction sets organises topological order. (ii) The quantum group deformation parameter q is the Forge ISA inverse temperature. Topological quantum computation is quantum mechanics at finite β. (iii) The logical qubit of the toric code is identified with the generator of H¹(T²; Z₂). Quantum error correction is an H¹ obstruction computation, placing the toric code threshold in the Islands/Flatland/The Deep cohomological framework. Results are verified numerically in experiment x445c (Racah coefficient matching for Ising and Fibonacci anyons). This paper is part of the Origami ISA series. Paper 446 (β-Ladder of Exactly Solvable Models, doi:10.5281/zenodo.20761278) extends the same β-axis to the full taxonomy of integrable quantum spin models. Keywords Kitaev model, toric code, topological quantum computation, anyons, Fibonacci anyons, Ising anyons, F-matrix, quantum groups, Racah coefficients, instruction set architecture, topological order, ZX-calculus, cohomology, quantum error correction, beta deformation, Levin-Wen string nets, honeycomb model, modular tensor categories
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 complete the TRS trilogy — Origami (β→∞, tropical, classical), Forge (0<β<∞, real, statistical), Meld (β=it, complex, quantum) — by showing that the Meld ISA is the quantum circuit model expressed in the TRS semiring language. Three results follow. Result 1 (ISA completeness). The Clifford group equals the Meld ISA without the BIND opcode. Universal quantum computation equals Meld plus BIND. The T-gate T=diag(1,,eiπ/4) is the BIND opcode at j=21 — the Fano associator obstruction of Paper 407, applied to qubit representations. The magic-typing classification of Papers 365/366 maps exactly onto the 731-ISA opcode hierarchy: Clifford gates occupy Fano-line orbits (SPLIT/FLIP/TWIST at Clifford angles); the T-gate occupies the non-collinear Fano triple (BIND). Result 2 (Quantum algorithm factory). Every classical algorithm of the form argmaxg∈Gf(g) over an abelian group G has a C-MGE quantum counterpart C-MGE(f)=SPLITG⋅FLIP(f)⋅SPLAT, giving exponential speedup via quantum Fourier sampling whenever G is abelian and f has a hidden subgroup concentrating Fourier mass. Shor's algorithm decomposes into three ISA layers: Layer 1 (Origami — classical modular exponentiation), Layer 2 (Meld — QFT as SPLIT-TWIST-FLIP cascade), Layer 3 (Origami — measurement as tropical projection). "Frozen-Shor" (Origami ISA, β→∞) recovers classical exhaustive search at cost O(N). "Warm-Shor" (Forge ISA, real β) gives Grover-like O(N) thermal concentration. Full Shor (Meld, β=it) achieves O(logN) via destructive interference — a resource unavailable in either real ISA. New algorithm candidates follow by identifying the symmetry group of the target problem: equivariant ML, quantum persistent homology (Lloyd-Garnerone-Zanardi 2016), and Boson Sampling (Aaronson-Arkhipov 2011) all fit the five-step factory template. Result 3 (ML-KEM structural no-go). ML-KEM (Module-LWE) is immune because LWE noise exponentially suppresses every Fourier component: Ee∼Dσ[ei⟨ξ,e⟩]=e−∣ξ∣2σ2/2. No Fourier peak exists; SPLAT cannot extract a period. The deeper reason is that worst-case LWE reduces to the dihedral hidden subgroup problem (Regev 2002) — a non-abelian problem for which no efficient Meld program is known. Breaking ML-KEM would require a BIND opcode capable of distinguishing dihedral cosets, a capability not established for the current 731-Meld. The Hk complexity ladder (Paper 420) is realised by the trilogy: H0 (tree) = Origami, H1 (loop) = Forge/BPP, H2 (surface) = Meld/BQP. The T-gate is the H2 generator that lifts computation off the stabiliser submanifold into the curved interior of the Fisher information metric. Series: Paper 258 (Origami ISA) → Paper 419 (Forge ISA) → Paper 443 (⊕β semiring, six pairs) → Paper 453 (multi-sector Forge) → Paper 454 (this paper — Meld ISA, trilogy complete). Related identifiers (Cites) Paper 258 Origami ISA: doi:10.5281/zenodo.19916429 Paper 419 Forge ISA: doi:10.5281/zenodo.20694527 Paper 443 ⊕_β semiring: doi:10.5281/zenodo.20752384 Paper 407 Associamancy: doi:10.5281/zenodo.20702223 Paper 365 Fano Magic Factory: doi:10.5281/zenodo.20541583 Paper 366 CS Magic Composition: doi:10.5281/zenodo.20541665 Paper 445 Kitaev anyons: doi:10.5281/zenodo.20752352 Paper 453 Multi-sector Forge: doi:10.5281/zenodo.20773423 Paper 420 H^k complexity ladder: doi:10.5281/zenodo.20773526
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. 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
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.
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 Forge ISA operates with a single annealing parameter β. For systems with multiple coupled degrees of freedom, the natural generalisation assigns an independent β_i to each sector. The central result is a non-commutativity theorem: the sector dequantization operators T_∞^c and T_∞^s satisfy [T_∞^c, T_∞^s] = 0 ⟺ I_cs = 0 where I_cs = ⟨H_c H_s⟩ − ⟨H_c⟩⟨H_s⟩ is the off-diagonal Fisher information coupling. When sectors are coupled (I_cs ≠ 0), dequantization order matters: the joint e-geodesic path on the product Fisher manifold outperforms sector-by-sector annealing by ΔE = 0.35 at U = 4t on the half-filled 4-site Hubbard chain (99.3% vs 82.7% of ground state energy). A new Hubbard limit is identified: the spin-frozen limit (β_s → ∞, β_c finite) reduces to a hard-core Bose gas, complementing the known charge-frozen limit (Heisenberg AFM, Anderson 1959). The annealing-order holonomy is the thermodynamic analogue of the Aharonov-Bohm effect, largest near the Mott transition where Fisher curvature peaks. Series: Paper 325 (doi:10.5281/zenodo.20400638) → Paper 419 (doi:10.5281/zenodo.20694527) → Paper 443 (doi:10.5281/zenodo.20752384) → Paper 453 (this paper). Keywords Forge ISA, multi-sector annealing, non-commutativity, Fisher information, Hubbard model, hard-core Bose gas, Mott transition, information geometry, e-geodesic, annealing order, holonomy, Aharonov-Bohm, thermodynamic computation, natural gradient, dequantization