Shows that a single Wilson RG step is the ISA programme SPLAT (integrate out high-energy modes) then LABEL (rescale) then TWIST (update the coupling). The beta-function is the TWIST rate per SPLAT step. Fixed points are stable ORBIT programmes. Classifies fixed points by H^k tier: H0 = Gaussian (free field), H1 = Wilson-Fisher (interacting, TWIST-stable), H2 = topological (BIND-protected, SPLAT-stable). Loop order equals ORBIT depth.
Shows that a single Wilson RG step is the ISA programme SPLAT (integrate out high-energy modes) then LABEL (rescale) then TWIST (update the coupling). The beta-function is the TWIST rate per SPLAT step. Fixed points are stable ORBIT programmes. Classifies fixed points by H^k tier: H0 = Gaussian (free field), H1 = Wilson-Fisher (interacting, TWIST-stable), H2 = topological (BIND-protected, SPLAT-stable). Loop order equals ORBIT depth.
Establishes that ISA perturbation theory is the Dyson series: the n-th order correction equals n extra TWIST insertions in the ORBIT loop. The coupling constant lambda = J/zeta_eff is the ratio of two opcode amplitudes; the perturbativity criterion lambda < 1 equals finite programme depth. Derives an ISA analogue of the Solovay-Kitaev theorem bounding programme depth. Identifies coupling constants across physics from gravity (alpha_G ~ 1e-38) through QED (alpha ~ 1/137) to cuprate pseudogap (lambda ~ 21-28, non-perturbative).
Shows that XXZ chain, transverse-field Ising model, Levin-Wen string nets, and Kitaev quantum doubles are a single ISA family parameterised by the beta-deformation. At beta=1/2 the BKT transition is a TWIST failure. Walker-Wang models are identified as H2 (BIND-mandatory). Haah codes require twisted coefficients and lie outside the standard H2 tier (fracton sector). The quantum group parameter q = exp(i*pi*beta) encodes the semiring interpolation between tropical (beta=infinity) and metaplectic (beta=0).
This walkthrough derives, from substrate primitives, the structural backbone of Wilsonian renormalization applied to the canonical Event Density (ED) PDE — and shows what the RG actually says about ED as a coarse‑grained theory. In 1971, Kenneth Wilson introduced the renormalization group: instead of solving a system at one scale, track how its couplings flow as you integrate out short‑distance structure. Fixed points govern universal behavior; relevant and irrelevant operators determine which features survive coarse‑graining. The framework reshaped statistical physics and quantum field theory. Applied to the canonical ED PDE, three structural results emerge: (1) Form‑closure of the operator basis. Under Wilsonian coarse‑graining (momentum‑shell integration + rescaling), the ED operator basis is *closed*: no new operators appear at tree level or one loop. The ED PDE’s structure isa theorem, not an ansatz. (2) ED is not an RG fixed point at physical couplings. The beta functions are non‑trivial. With dynamical exponent z = 2, M₀ is marginal, P₀ and ζ are relevant, τ is irrelevant. The couplings flow; ED is regime‑dependent, not scale‑invariant. (3) Three distinct flow regimes. The RG flow produces a UV regime of free two‑channel diffusion, an intermediate ED‑activeregime where the full operator structure matters, and an IR regime of linear gapped diffusion. ED‑specific predictions live only in the intermediate window. The derivation chain: canonical two‑channel ED PDE (δ coupled to participation mode v) with finite operator basis → momentum‑shell split and rescaling → form‑closure at tree and one loop → beta‑function computation at z = 2 → fixed‑point catalog (Gaussian fixed point, two fixed lines, IR sink at infinity) → flow invariants → two crossover scales (ℓ_v for participation‑slaving onset; ℓ_ξ for gap‑dominated decay) → ED window ℓ_v < ℓ < ℓ_ξ → three effective PDEs in UV, intermediate, and IR regimes. The structural payoff: ED’s cross‑scale invariance is *operator‑structure* invariance within a bounded window, not coupling‑invariance across all scales. The “one PDE, three domains” claim means the same operator basis governs behavior across the intermediate regime, even though the couplings run. The RG walkthrough establishes ED’s self‑consistency: the canonical ED PDE is a closed, well‑behaved object under Wilsonian coarse‑graining, with a defined applicability window and controlled limits. This is not a derivation of a new equation — it is a structural validation that ED’s cross‑scale invariance survives RG analysis exactly as advertised.
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
Heunen, Lemonnier, McNally, and Rice (POPL 2026) introduce the phase language: two primitives, Ph(theta) and 'if let p then s', that together are universal for unitary quantum computation. Their language is elegant and expressive, yet by design it restricts to unitary operations, to a fixed real-phase semiring, and to a single computational tier. We show that the phase language is the grade-beta=i special case of the Origami instruction-set architecture (ISA), a beta-graded Frobenius monad defined over the beta-semiring. Three main results are proved. Theorem 1 (restricted embedding): the phase-only and empty-pattern fragment of the phase language embeds faithfully into the H^1-tier subcategory of Origami_{beta=i} generated by ORBIT, TWIST, and FLIP. Theorem 2 (strict extension): the Raven ISA (complex beta) is strictly more expressive than the phase language; any computation using a non-unitary TWIST serves as witness. Theorem 3 (Frobenius monad): the quadruple {ORBIT, FLIP, BIND, MERGE} forms a Frobenius monad in the PROP semantics, satisfying the Frobenius condition and giving a categorical foundation for the full ISA. The graded structure enables a three-tier computational hierarchy: tropical (beta -> infinity), quantum (beta = i), and PT-symmetric (beta in C), with the phase language occupying exactly the middle tier.