The 731 Instruction Set Architecture: Machine Code, Frog Opcodes, and the Thermodynamic Enforcement of the Four-Leg Limit

Description

We define the 731 Instruction Set Architecture (Origami ISA): a complete machine code for non-associative, non-Turing computation on simplicial complexes governed by $G_2$ self-duality. The ISA has two layers: five frozen-logic opcodes (Layer 0) and four compiler directives (Layers 1–2) that together constitute a conjectured universal thermodynamic computer.

The 731 register. The fundamental data structure is a 731-crystal: a triangulated 3-manifold whose topology is constrained to be compatible with the Fano plane $PG(2,2)$. Logical states are encoded in the combinatorial structure of the crystal — vertex colourings, edge weights, and simplicial volumes — rather than in the amplitude of a wave function. The hardware Hamiltonian enforces the Four-Leg Limit: no simplex may have more than four legs (vertices), corresponding to the 3-simplex (tetrahedron) as the maximal computational unit.

The five frozen opcodes. At zero temperature ($\beta \to \infty$), the ISA provides five deterministic rewrite rules on the simplicial mesh, corresponding to the Pachner moves on a PL 3-manifold:

• $\blacksquare$ SPLIT (1→4 stellar move): stab a new vertex into the centre of a tetrahedron; one volume becomes four.
• $\Diamond$ SPLAT (4→1 stellar move): remove the central vertex; four tetrahedra collapse to one.
• $\blacktriangle$ FLIP (2→3 bistellar move): two tetrahedra sharing a face pivot around their shared hinge to become three.
• $\triangleright$ FLOP (3→2 bistellar move): three tetrahedra sharing a hinge resolve back into two.
• $\circledast$ SPIN ($\mathbb{Z}_3$ triality gauge): cycle the Fano colour scheme of a tetrahedron ($V \to S^+ \to S^- \to V$) without moving it.

The four structural opcodes form two self-dual pairs under the $G_2$ coroot isomorphism $\sigma$: $\sigma(\blacksquare) = \Diamond$ and $\sigma(\blacktriangle) = \triangleright$. The Mirror Square theorem gives $\Diamond \circ \blacksquare = \triangleright \circ \blacktriangle = \mathrm{id}$ on Fano-compatible states.

The compiler. Standard associative code is translated to 731 programmes via a four-step Geometric Constraint Satisfaction (GCS) pipeline: (1) rewrite logical predicates as Fano collinearity constraints; (2) initialise a 731-crystal satisfying those constraints; (3) apply Pachner surgeries to propagate constraints through the crystal; (4) read out the result as the topology of the final crystal. A visual IDE based on Frog Diagrams — planar string diagrams where each tetrahedron is drawn as a four-legged frog — provides an intuitive interface to the GCS compiler. An Origami Compiler Cheat Sheet (§5) gives complete rewriting rules for all common logical operations.

The THERMAL directive. The five frozen opcodes are $\beta_{\mathrm{local}} \to \infty$ limiting cases of a single thermodynamic primitive, the THERMAL compiler directive:

$$\mathrm{THERMAL}(E_{\mathrm{local}},;\beta_{\mathrm{local}}) ;:; J_{\mathrm{eff}}[e] ;\leftarrow; J[e] \cdot \exp(\beta_{\mathrm{local}} - \beta_{\mathrm{global}}), \quad e \in E_{\mathrm{local}}.$$

THERMAL sets a spatially non-uniform inverse temperature on the coupling graph. The Gibbs annealing kernel $p \leftarrow \mathrm{softmax}(\beta \cdot \mathbf{J}_{\mathrm{eff}} \cdot p)$ is parallel transport along the $e$-geodesic of the Fisher–Rao statistical manifold. Physical realisations include GTP hydrolysis in ribosomal decoding (Paper 324), photon absorption in FMO photosynthesis (Paper 319), and N$_2$ binding in nitrogenase (Paper 318).

Three further directives. Three orthogonal control dimensions complete the ISA:

• FLOW$(\beta(\cdot), T)$: temporal $\beta$-schedule; specifies $\mathrm{d}\beta/\mathrm{d}t$ subject to the adiabatic constraint $|\dot{\beta}|/\beta^2 \leq \lambda_1(\mathbf{J}_{\mathrm{eff}})$ (Landau–Zener condition). Classical simulated annealing is FLOW with $\beta(t) = \beta_0 \ln(1+t)$.

• LOCK$(S, \Pi, \mathtt{addr_true}, \mathtt{addr_false})$: pins a subgraph $G[S]$ as classical, evaluates a Boolean topology predicate $\Pi$ (e.g.\ the Fano-line test), and branches accordingly. The primitive for geometry-conditional execution and active quantum error correction.

• SYNC$(\mathcal{R}A, \mathcal{R}B, E{AB}, J{AB})$: couples two independent simplicial registers into a joint system with Hamiltonian $\mathbf{J}_A \oplus \mathbf{J}B \oplus \mathbf{J}{AB}$. The primitive for multi-qubit gates, allosteric networks (haemoglobin MWC model), Förster energy transfer (FMO), and kinetic proofreading (ribosome).

Universality conjecture. The ISA with opcodes ${\blacksquare, \Diamond, \blacktriangle, \triangleright, \circledast}$ and directives ${\mathrm{THERMAL}, \mathrm{FLOW}, \mathrm{LOCK}, \mathrm{SYNC}}$ is conjectured to be universal for thermodynamic computation: for any computable function $f$ and any target efficiency $\eta < \eta_{\mathrm{Carnot}}$, there exists a finite 731 programme computing $f$ with efficiency at least $\eta$. The proof requires formalising the complexity classes THERMOP (Carnot-efficient computation) and FROZENP (deterministic but fully dissipative computation), which we leave to future work.

Keywords: instruction set architecture, Pachner moves, Fano plane, $G_2$ self-duality, non-associative computation, simplicial complex, Gibbs annealing, Fisher–Rao metric, THERMAL directive, thermodynamic computation, Carnot efficiency, kinetic proofreading, quantum error correction, $[[7,1,3]]$ Hamming code, frog diagrams, geometric constraint satisfaction

What changed since last upload: §2 ISA hierarchy figure, §10.5 inevitability remark, abstract positioning paragraph, Origami ISA naming throughout, Paper 349 citation, paper numbering corrected (350–351 for quarkonium/QGP)
Version note for Zenodo: "v3.0: adds ISA hierarchy figure (ZX ⊂ Origami ISA ⊂ 731-ISA), §10.5 on opcode inevitability, abstract positioning relative to Paper 349 (Origami Calculus)"