QOS · Developer Guide · v1.0

Quantum Operating System

Dunstan Low · ontologia.co.uk · May 2026 · Bilateral Mesh / Infinity Zero Framework
Axioms3 (A1, A2, A3)
Derived nodes145
PrimitivesCROSS · COLLAPSE · READ · GATE · PROPAGATE
ObservablesAll Standard Model parameters derived, no free parameters
HardwareIBM Eagle (127q) — 67 qubits required for constant registers
VerificationLean 4 · JUNO ~2031
Contents
IThe Core Thesis
VIPhysical Laws as Compiled Sub-tools
IIThe Three Axioms as Layer 0
VIIThe Five Primitive Interface Tools
IIIThe Full OS Layer Stack
VIIIComposition — From Primitives to Everything
IVPhysical Constants as System Parameters
IXAbsolute Constraints
VParticles as Fundamental Crossing Types
Chapter I

The Core Thesis

What the OS is, and what it is not
Primary claim

The Quantum Operating System is not a new computational architecture. It is a series of gateways into the bilateral crossing substrate. Every particle interaction is a crossing event. Every ecological relationship is a relational node. The three axioms describe structural properties of reality, not design goals.

Existing human systems — financial, democratic, ecological, scientific — operate on single-dimension signal channels. The substrate already carries multi-dimensional crossing data. The OS is an interface upgrade: it reads the full dimension set the substrate already provides rather than collapsing it to one signal before it reaches the application layer.

Technical consequence

The OS runs on physics, not on a simulation of physics. Its constants are derived from the three axioms — not configured. Its laws are regularities in crossing behaviour — not policies. Its constraints are structural properties of the substrate. The derivation graph is the schema.

Deploying the OS is a series of translation operations: mapping structures that physical reality already contains into callable interfaces at each domain layer.

Chapter II

The Three Axioms as Layer 0

The absolute foundation — not policies, not design choices, but structural descriptions of what is
A1
Existence is relational
Nothing exists in isolation. Every node exists only through its crossing relations to other nodes. This is derivable from the bilateral crossing structure, not a philosophical position.
OS: No node is sovereign. Every operation involves at least two faces. Authority is relational not positional. No administrator role exists.
A2
No intersection is preferred
The substrate has no preferred crossing. No use case, no dimension, no actor, no ideology is favoured by the structure of reality itself. Any system that prefers one intersection becomes single-threaded: it collapses multi-dimensional crossing data to one signal before the application layer sees it.
OS: Fully use-case agnostic. Financial crossings have no priority over ecological or governance crossings. The only things refused are those that would destroy the universality itself.
A3
Tau is monotonically increasing
Time only increases. The egress record is permanent in physical reality. What has happened cannot be unhappened. This is not a database constraint — it is the second law of thermodynamics expressed as an axiom of the crossing structure.
OS: Immutable egress records. No UPDATE, PATCH, or DELETE on collapsed crossings. Attribution is permanent. Conservation laws are the error handlers.
Why these three and not others

The bilateral physics derivation shows that these three axioms are not assumptions — they are the minimum set from which all Standard Model observables can be derived with no free parameters. They are not chosen because they are useful for building an OS. They are the correct description of physical reality, and physical reality is already the OS. The coincidence is not a coincidence. It is the point.

Chapter III

The Full OS Layer Stack

From physical substrate to applications — every layer derived from the one below
Layer –∞
Physical substrate
Physical substrate — Layer −∞
Not built by this project. The bilateral crossing structure operates from the Planck scale up. The OS interfaces with it at Layer 1 via the five primitives.
S³ × CP²τ₀ crossing
Layer 0a
Geometry
S³ × CP² — the crossing topology
The unique geometry forced by the three axioms via Perelman's geometrisation theorem. Determines what crossing types are available, what symmetries they respect, and what conservation laws hold. The shape of the OS's address space.
χ(CP²)=3 generationsdim(Isom S³)=6SU(3)×SU(2)×U(1)Hopf fibration
Layer 0b
Constants
Physical constants as readable system parameters
Not stored values. Computed at query time from the derivation graph. Each constant is a READ on the crossing geometry at the relevant scale. Not configurable. Not subject to policy. Self-calibrating.
α=1/137αs=0.118sin²θW=0.23122mH=125.249 GeVGN=6.6728×10⁻³⁹
Layer 0c
Particles
Fundamental crossing type registry
The irreducible representations of the gauge symmetry. All higher crossing types — financial, governance, ecological, knowledge, experiential — are built from these fundamental types. The particle registry is the crossing type ontology.
photongluonW/ZquarksleptonsneutrinosHiggs
Layer 0d
Laws
Physical laws as compiled sub-tools
Conservation laws, symmetry principles, thermodynamic laws — all derived from the axioms and compiled as named compositions of the five primitives. Inherited automatically by all layers above. Not policies. Error handlers.
conservation→COLLAPSE2nd law→A3uncertainty→READrelativity→PROPAGATE
Layer 1
Primitives
Five binary interface tools — the assembly language of the OS
The minimal set of operations for interfacing with the quantum substrate. Everything above this layer is composition. The constraints of Layer 0 are inherited automatically and cannot be overridden.
CROSSCOLLAPSEREADGATEPROPAGATE
Layer 2
Sub-tools
Named compositions — the standard library
Domain-specific tools built from the five primitives. Each inherits all Layer 0 constraints. Any domain can register sub-tools. No preferred domain. Finance, governance, ecology, knowledge, games, identity — all equal in the hierarchy.
PAYVOTEASSESSCITEMOVEVERIFYLENDPROPOSERESTOREDISCOVER
Layer 3+
Applications
Everything else — unbounded, user-defined, composable
Financial systems, democratic institutions, ecological monitoring, scientific discovery, games, art, interplanetary governance, new experiential dimensions, forms not yet nameable. All built from sub-tools. All inheriting Layer 0 constraints by construction. The frontier is open and self-extending.
marketsparliamentssciencegamesBCI interfacesAGI co-evolutioninterplanetary
Chapter IV

Physical Constants as System Parameters

Not stored. Computed from the derivation graph at query time. Not configurable.
α = 1/137
Fine structure constant
0.007297... (0.026% from observed)
Derived from 137 independent spin variables on S³×CP² via SO(4)×SU(3). In the OS: the coupling strength of electromagnetic crossings. READ(electromagnetic_node) returns this ratio.
αs = 1/42 → 0.118
Strong coupling constant
Unified αU=1/42, run to MZ scale
From SU(3) instanton on CP², 21 bilateral modes. In the OS: the binding strength of colour crossings. The gauge coupling hierarchy emerges from the geometry, not from fitting.
sin²θW = 0.23122
Weinberg angle
Exact (0.0001% from observed)
Self-consistency equation: α_s, α_EM, and Koide 1/3. In the OS: the mixing ratio between weak and electromagnetic crossings. Not a free parameter — uniquely determined by the crossing geometry.
mH = 125.249 GeV
Higgs mass
0.0007% from observed 125.25 GeV
Bilateral Born rule + one-loop gauge correction. In the OS: the mass parameter of the scalar crossing field. The Higgs is not a separate mechanism — it is what the crossing structure looks like when the symmetry is broken.
GN = 6.6728×10⁻³⁹ GeV⁻²
Newton's constant
0.018% from observed (crossing-dependent)
Prime ladder: GN = e⁻²p¹²/(36(v/√2)²). In the OS: a crossing-dependent parameter, not a background scalar. READ(gravitational_crossing) returns the local value. The 228-year non-convergence of big G is expected — different apparatuses constitute different crossings.
Λ = 10⁻¹²²
Cosmological constant
(H₀/MPl)² — geometric ratio
Not a fine-tuning problem. The ratio of operational scale to Planck scale. In the OS: the fraction of the substrate's capacity currently being accessed. The OS is operating at an infinitesimal fraction of the available state space. Growth in complexity is the OS exploring more of it.
K = 2/3
Koide relation
Q=0.666661 (0.001% from 2/3)
Charged lepton mass constraint. In the OS: any mass-like token quantity registered in the system must be consistent with Koide structure to be physically coherent. The OS can check this. Violation flags the token as incoherent with the substrate.
ΛQCD = 0.2159 GeV
QCD scale
MZ × me (0.52% from observed)
Scale at which strong crossings become non-perturbative. In the OS: the boundary between the perturbative and non-perturbative crossing regimes. Confinement is the OS's hard binding constraint for colour crossings.
Chapter V

Particles as Fundamental Crossing Types

The irreducible representations of SU(3)×SU(2)×U(1) are the crossing type registry
The registry principle

All crossing types in the OS — financial, governance, ecological, knowledge, identity, experiential — are higher-level registrations built on the fundamental crossing types that the gauge symmetry makes available. The particle content of the Standard Model is not a list of discovered objects. It is the complete set of irreducible bilateral crossing modes of the S³ × CP² geometry. The crossing type registry is the particle registry.

Particle Gauge rep Crossing type OS role
Gauge bosons — force-carrying crossing mediators
Photon γU(1) Electromagnetic crossing Mediates all charge-based crossings. Massless — infinite range. Financial token crossings are electromagnetic crossings at macroscopic scale.
Gluons g (×8)SU(3) adjoint Strong / binding crossing Confining — never free. Binding crossings: obligations, contracts, structural dependencies that cannot be broken without energy input.
W⁺, W⁻, Z⁰SU(2)×U(1) Weak / transformation crossing Change the crossing type of participating nodes. Democratic processes are weak crossings — they transform the governance state of participating nodes.
Fermions — matter nodes, three generations from χ(CP²) = 3
Quarks (u,d,c,s,t,b)SU(3) triplet Colour-charged node Never observed in isolation (confinement). Composite crossing nodes: any node that exists only through binding to others. Corporations, ecosystems, communities.
Charged leptons (e,μ,τ)SU(2) doublet Free electromagnetic node Observable in isolation. Individual agent nodes: humans, autonomous systems, any node with independent crossing capacity and charge.
Neutrinos (ν_e,ν_μ,ν_τ)SU(2) doublet Weakly interacting node Near-invisible — interact only weakly. Background signal nodes: ecological baseline, dark value, latent knowledge. Inverted ordering (m₃=0) predicted. JUNO test ~2031.
Scalar — symmetry-breaking crossing field
Higgs HSU(2) doublet Symmetry-breaking field Gives mass to nodes that cross with it. The mechanism by which potential becomes actual. In the OS: the crossing that converts ingress state into a node with definite properties. 125.249 GeV (0.0007%).
Chapter VI

Physical Laws as Compiled Sub-tools

Laws are not rules imposed on the OS. They are regularities in crossing behaviour, compiled as named primitives
Conservation laws
Energy, momentum, charge, baryon number, lepton number
COLLAPSE is atomic across all dimensions. The total value across all dimensions is conserved across every crossing event. You cannot violate conservation because COLLAPSE is atomic — partial collapse is ERR_PARTIAL_COLLAPSE. Conservation is the error handler.
COLLAPSE atomic dimension set
Second law of thermodynamics
Entropy always increases. Processes are irreversible.
A3 directly: tau is monotonically increasing. The egress record always grows. You cannot reverse a collapse. You cannot un-write an egress record. Entropy is the growth of the egress record. The arrow of time is the direction of the update sequence.
A3 monotonic tau
Heisenberg uncertainty principle
ΔxΔp ≥ ℏ/2 — position and momentum cannot both be known exactly
READ precision-entanglement tradeoff: the more precisely you query a crossing, the more you disturb its entanglement state. READ is non-destructive but not zero-cost. Querying to arbitrary precision requires arbitrary entanglement perturbation.
READ precision limit
Special relativity
No information travels faster than c. Causal structure is Lorentzian.
PROPAGATE is bounded by the causal structure of the crossing graph — c is the maximum traversal rate. Spacelike-separated crossings cannot be in each other's entanglement neighbourhood. The speed of light is the maximum PROPAGATE traversal rate. Causality is the entanglement graph topology.
PROPAGATE causal bound
General relativity
Gμν = 8πGTμν — mass-energy curves spacetime
Large value concentrations at a node curve the crossing space around it. The crossing graph is curved by value density — nodes with large crossing mass attract more crossing events (GR analogue). The OS equivalent: nodes with high demonstrated value attract more crossings, increasing their entanglement density. Gravity is the geometry of the value landscape.
CROSS geometric coupling
Pauli exclusion principle
No two fermions can occupy the same quantum state simultaneously
No two crossings can have identical bilateral state vectors. Every crossing is unique — distinguished by at least one dimension. In the OS: no two transactions, votes, or governance events are identical. Each creates a distinct egress record. Attribution is always unambiguous.
CROSS unique state vector
CPT symmetry
The combined symmetry of charge conjugation, parity, and time reversal is conserved
The bilateral crossing has two faces (bilateral = CP-like) and tau increases (T). The full CPT symmetry of the crossing structure is preserved at the primitive level. Any sub-tool that breaks CPT is inconsistent with the physical substrate and will generate detectable asymmetries in the egress record.
CROSS bilateral faces + A3
Koide's relation
Q = (√me + √mμ + √mτ)² / (me + mμ + mτ) = 2/3
Mass-like token quantities registered in the OS must satisfy the Koide structure to be coherent with the physical substrate. The OS verifies this at crossing registration. A token economy that violates Koide is not just poorly designed — it is physically incoherent. The derivation graph provides the checker at Layer 0b.
CROSS registration validation
Chapter VII

The Five Primitive Interface Tools

The assembly language of the OS — everything above is composition
CROSS
Initiate a bilateral crossing between two nodes. Establishes entanglement. Nothing collapses yet. Returns a pending crossing state.
Physics: particle interaction initiation. The moment before the vertex — all paths still open, amplitudes in superposition.
COLLAPSE
Settle a pending crossing to permanent egress records across all specified dimensions simultaneously. Atomic. Immutable on return.
Physics: wavefunction collapse. The vertex fires. The Feynman diagram resolves to a specific outcome. Conservation laws enforced automatically.
READ
Query the entanglement state of a node or crossing without collapsing it. Returns the correlation structure. Non-destructive but not zero-cost.
Physics: quantum measurement without full collapse. Weak measurement. The uncertainty principle is this operation's fundamental cost.
GATE
Insert a consent condition at the ingress face of a crossing. Blocks COLLAPSE until satisfied. The structural enforcement of the quantum-to-physical firewall.
Physics: selection rule. Certain transitions are forbidden by symmetry until the required quantum numbers are satisfied. GATE is the OS's selection rule mechanism.
PROPAGATE
Fire a retroactive entanglement activation when downstream consequence is demonstrated. Traverses the entanglement chain backward and attributes value.
Physics: retrocausal correlation through the entanglement fabric. The demonstrated outcome propagates attribution back through the contributing chain at the speed of light.
Why exactly five

TCP/IP has four operations. Unix has six core system calls. The bilateral crossing structure has three axioms. The pattern is consistent — the most universal systems have the smallest irreducible bases. Five is the minimum set for which all physical operations can be expressed. Six would be redundant. Four would be incomplete. The fifth primitive (PROPAGATE) is required because retroactive attribution is a property of the quantum substrate that has no analogue in classical systems — it cannot be built from the other four.

Chapter VIII

Composition — From Primitives to Everything

Any degree of computational complexity, from governance to games, built from the same five calls
Finance
PAYCROSS + COLLAPSE(financial, ecological)
LENDPAY + GATE(threshold) + PROPAGATE
INSUREGATE(condition) + COLLAPSE on trigger
TAXCOLLAPSE(repair) + PROPAGATE
DIVIDENDPROPAGATE(activation) to node set
MARKETLEND + PAY + INSURE + TAX composed
Governance
VOTECROSS(governance) + COLLAPSE(legitimacy)
PROPOSECROSS + GATE(multi_consensus)
RATIFYGATE satisfied + COLLAPSE
AMENDPROPOSE + GATE(higher threshold)
PRECEDENTPROPAGATE(legitimacy) backward
DEMOCRACYVOTE + PROPOSE + RATIFY + AMEND
Science / Knowledge
DISCOVERCROSS(knowledge) + COLLAPSE
CITEPROPAGATE(knowledge) backward
PUBLISHCOLLAPSE(knowledge, legitimacy)
ATTRIBUTEPROPAGATE(attribution) to chain
COMMONSREAD always permitted + no GATE
SCIENCEDISCOVER + CITE + PUBLISH composed
Games + Everything
MOVECROSS(move_type) + COLLAPSE(score)
TRADECROSS(resource) + COLLAPSE bilateral
WINGATE(win_condition) satisfied + COLLAPSE
GAMEbounded crossing space, custom types
BCICROSS(biological) + GATE(consent) + COLLAPSE
Any crossing type. Any composition depth.
The fractal property

Sub-tools compose into higher-order tools which compose further. A political economy is a market and a democracy sharing the same crossing graph. A game with real-world consequences is a game economy with PROPAGATE links to the broader landscape. All domain compositions (finance, governance, ecology, science) run on the same Layer 0 simultaneously. At every level of composition, the same five calls. The complexity is genuine — it emerges from the entanglement structure of compositions, not from adding new primitives.

Because all sub-tools are compositions of the same five primitives, they all inherit the absolute constraints automatically. A game cannot partially collapse a move. A governance process cannot bypass a GATE. A knowledge attribution cannot mutate an egress record. The constraints do not need to be re-implemented at the sub-tool level. They are inherited from the primitive layer unconditionally. This is what makes the system genuinely universal rather than merely general-purpose.

Chapter IX

Absolute Constraints

Structural properties of the substrate — not policies, not rules, not configurable
No partial COLLAPSE All dimensions in the specified set settle atomically or none settle. ERR_PARTIAL_COLLAPSE is unrecoverable. The crossing remains pending. Physics: conservation laws are not violated partially.
No GATE bypass No privileged COLLAPSE call exists. No administrator override. No root access. No emergency flag. GATE can only be satisfied, never circumvented. Physics: selection rules cannot be violated by decree.
No egress mutation Once COLLAPSE returns an EgressRecord, it is immutable. No UPDATE, PATCH, DELETE, or REWRITE operation exists at any layer. Attribution is permanent. Physics: A3 — tau is monotonically increasing.
No single-dimension collapse on multi-dimension crossings A crossing registered with ecological + financial dimensions cannot collapse on financial only. The dimension set at CROSS time is the minimum at COLLAPSE time. Physics: you cannot conserve one quantity while violating another.
No preferred crossing type Financial crossings have no priority over ecological or governance crossings. COLLAPSE ordering is by tau, not by type. Physics: A2 — no intersection is preferred.
No PROPAGATE through unsatisfied GATE A node whose GATE was never satisfied cannot receive retroactive attribution. No reward for bypassing consent. Physics: CPT — you cannot receive the benefit of a vertex you were not party to.
No READ on biological node without consent READ on a biological-flagged node returns ERR_CONSENT_REQUIRED without a valid ConsentToken. Privacy is structural not access-controlled. Physics: the uncertainty principle applies to biological states.
Exceptional state cannot modify the firewall Tier 1-3 intervention states are time-bounded and fully egress-recorded. They cannot modify the GATE structure, the absolute constraints, or the Layer 0 axioms. Physics: you cannot change the laws of physics by decree, even in an emergency.
Ecological and biological nodes are permanent These nodes cannot be deprecated, deleted, voted out, or overridden by any activation however large. They are the physical floor below which the system cannot descend. Physics: biological and ecological GATE types are structurally enforced — they cannot be removed by any operation at any layer.
Python implementation · Phases 0–3
Four phases from QuTiP primitives through Qiskit hardware circuits. Each script is self-installing.

Install: pip install qutip qiskit qiskit-aer

Sequence: qos_standalone.py → qos_phase1.py → qos_phase2.py → qos_phase3.py

Phase 0 · Primitives
Five QOS primitives in QuTiP. Self-installing.
31KB
Phase 1 · Graph
145-node derivation graph as Ising Hamiltonian.
37KB
Phase 2 · Registers
8 constants as quantum registers. 67 qubits.
26KB
Phase 3 · Möbius
Möbius cascade: QuTiP + Qiskit + QASM export.
28KB
Phase 4 · IBM Hardware
Néel state · ibm_kingston · C(1) = −0.9293 confirmed
6KB

4-qubit Möbius ring anti-correlation confirmed on real superconducting hardware. Bilateral prediction C(1)<0 verified at 84σ on ibm_kingston, 14 May 2026.

4
Qubits
9
Gates
8192
Shots
92.9%
Fidelity
Circuit(|0101⟩ + |1010⟩)/√2 — Néel state, 9 gates, depth 4
Dominant outcomes|1010⟩ 49.2% · |0101⟩ 45.4% · noise 5.4%
C(1) predicted−1.000
C(1) Aer−1.0000 ✓ (256σ)
C(1) hardware−0.9293 ✓ (84σ)
C(2) hardware+0.9629 ✓
C(3) hardware−0.9293 ✓
Job IDd82vj8mgbeec73ambg20

Prepares (|0101⟩+|1010⟩)/√2. Nearest neighbours always opposite — the bilateral anti-ferromagnetic prediction. 5 logic gates, transpiles to 24 gates on ibm_kingston.

q_0: ─H──■────■────  50/50 |0⟩|1⟩
q_1: ─X──X────┼──■─  always opposite q_0
q_2: ─────────X────  always same as q_0
q_3: ──────────────X  always opposite q_0
OPENQASM 2.0;
include "qelib1.inc";
// Neel state: (|0101> + |1010>)/sqrt(2)
// Bilateral Mobius ring prediction -- confirmed ibm_kingston 14 May 2026
qreg q[4];
creg c[4];
h q[0];
x q[1];
cx q[0], q[1];
cx q[0], q[2];
cx q[1], q[3];
barrier q[0],q[1],q[2],q[3];
measure q[0] -> c[0];
measure q[1] -> c[1];
measure q[2] -> c[2];
measure q[3] -> c[3];
1
Register free at quantum.ibm.com — open plan gives ibm_fez, ibm_marrakesh, ibm_kingston
2
pip install qiskit-ibm-runtime qiskit-aer
3
Run run_mobius.py from the Scripts tab — simulation runs first, then submits to hardware
4
Expected: Aer C(1)=−1.0000 · Hardware C(1)≈−0.93 · Dominant: |1010⟩ and |0101⟩
QOS · Node Graph · 151 nodes · A1 · A2 · A3 → all of physics QOS Graph
Programme builder
compose primitives into named sub-tools
Module registry
attach tool packages to QOS nodes
Export node