SPEC

OMEGA Protocol Specification

Version 1.0, March 2026

OMEGA is an authorisation layer for autonomous action and commitment infrastructure for machine systems. This document specifies how computation becomes consequence — not how cognition ought to proceed — in human, hybrid, and autonomous deployments.

Making it harder to lie with OMEGA than without it.

OMEGA turns latent probabilistic computation into explicit, governed, falsifiable commitment records at the boundary where action becomes irreversible.

OMEGA does not prove that a governed decision was correct. It proves that a commitment was authorised, that the reasoning was recorded before the action was taken, and that the record cannot be altered after the fact. It makes bad reasoning harder to disguise, easier to detect, and possible to compare against outcomes over time. Auditability is not correctness. It is the precondition for measuring correctness.

About this document

Making it harder to lie with OMEGA than without it. OMEGA is an authorisation layer for autonomous action and commitment infrastructure for machine systems; it turns latent probabilistic computation into explicit, governed, falsifiable commitment records at the boundary where action becomes irreversible.

Version 1.0

Status Published

Date March 2026

Canonical reference omegaprotocol.org/spec/v1

Licence Open. Freely cite with attribution.

Download full PDF (v1.0) →

The PDF is generated from this page plus the long-form narrative chapters (scope, decision cycle, governance spine, and related sections). Use the contents below to jump within the web supplement; the PDF is the complete printable document.

Contents — on this page

  1. Preamble — positioning and auditability
  2. About this document
  3. Primitive irreducibility — Governance, Reasoning, Traceability, Expectation (P4), Confirmation
  4. Evidence
  5. Named failure modes (FM_R)
  6. What OMEGA does not claim
  7. Formal verification — necessity, sufficiency, SymPy script, failure-mode table
  8. Appendix — OMEGA adversarial simulation

Chapters such as Scope, the OMEGA Decision Cycle, Governance Spine, Non-action schema, Assumption handling, Expectation and surprise, Domain packs, Versioning, Falsification, and References appear in the PDF only — they are not duplicated in this HTML view.

Primitive Irreducibility

Governance

Governance captures authority and constraint at the moment of decision — who is permitted to act, under what rules, and within what boundaries. Removing Governance loses the answer to the question: was this decision legitimate? A system could produce perfect Reasoning, accurate Expectation, complete Traceability, and verified Confirmation, and still have acted outside its authorised scope. Governance is the primitive that determines whether a decision was made by the right entity under the right conditions. No other primitive captures this. Traceability records that a decision happened. Governance records whether it was authorised to happen.

Reasoning

Reasoning captures the real-time process of navigating uncertainty before commitment — the FACT, INFERENCE, and ASSUMPTION chain that connects available information to a conclusion. Removing Reasoning loses the answer to the question: how did the system get from its inputs to its decision? Expectation captures what was predicted. Reasoning captures how that prediction was formed and how the decision followed from it. They are sequential not equivalent. The Reasoning that produced a prior Expectation is not the same as the Reasoning captured in the current decision record. A system could hold accurate Expectations and still reason to the wrong conclusion through flawed inference. Reasoning is the primitive that makes the path from evidence to action inspectable.

Traceability

Traceability captures the permanent auditable record that exists independently of the governance structure that produced it. Removing Traceability loses the answer to the question: what can be verified after the fact, even if the system that made the decision no longer exists? Governance is ephemeral — authority structures can be dismantled, policies can be changed, organisations can dissolve. Traceability is permanent — the record survives the removal of everything else. This is not a property of Governance extended over time. It is a structurally distinct primitive because it is the only one that cannot be revoked. A cryptographically immutable Traceability record remains evidence even when every other layer of the governed system has been modified or destroyed.

Expectation (P4)

Expectation captures an explicit commitment to a predicted future state before any action is taken. Removing Expectation loses the answer to the question: what did the system believe would happen, and can that belief be falsified? Most autonomous systems act without committing to a prediction. They respond to inputs without recording what they expected those inputs to mean. Expectation forces the system to declare its model of the world before acting — creating a falsifiable object that can be compared against outcomes. This is not contained within Reasoning. Reasoning is the process. Expectation is a specific output of that process — a committed prior that exists as a distinct record before the decision unfolds. Without Expectation, there is no baseline against which to measure whether the system's model of the world was accurate.

A complete Expectation primitive records at minimum the following sub-fields:

Confirmation

Confirmation captures the moment at which intent becomes irreversible commitment — the point at which possibility collapses into actuality. Removing Confirmation loses the answer to the question: was there a distinct gate between deciding and acting? Every other primitive operates in the space of deliberation. Confirmation is the primitive that marks the boundary between deliberation and execution. It is not Expectation-closure — Expectation is a commitment about the future, Confirmation is the present becoming permanent. The structural analogy is precise: Expectation is the quantum superposition of possible futures, Confirmation is the measurement that collapses that superposition into a single irreversible outcome. Without Confirmation as a distinct primitive, there is no record of whether the system had a genuine opportunity to not act. The non-action record is only meaningful if Confirmation exists as the gate through which action must pass.

Why all five together

Each primitive captures something the other four cannot. Together they form the minimum complete anatomy of a governed passage from deliberation to authorised commitment: who was authorised (Governance), how they reasoned (Reasoning), what they predicted (Expectation), that the record is permanent (Traceability), and that there was a distinct moment of commitment (Confirmation). Remove any one and the record loses a dimension that cannot be recovered from the remaining four. This is not a design claim — it is an empirical finding validated across financial markets, biological adaptive systems, space governance scenarios, pharmaceutical manufacturing, and AI agent evaluation. The same five structures appear wherever adaptive intelligence navigates uncertainty under constraint.

Evidence

Empirical validation March 22 2026: six AI systems tested against OMEGA primitive structure. DeepSeek R1 produced the richest Reasoning primitive of any model tested but only one of five primitives unprompted. Every system tested produced decision fragments. OMEGA is the complete anatomy. The standard exists because no individual AI system produces it spontaneously.

Named Failure Modes

FM_R — Reasoning failure mode

The gate passed and the confirmation fired, but the reasoning that led to the gate decision was hollow at the point that mattered. Binary gate passed therefore safe is not governed reasoning. It is the absence of Reasoning dressed as its presence. Instantiated empirically: March 22 2026, re-entry governed record, Reasoning scored 4/10 by adversarial audit.

What OMEGA Does Not Claim

Formal Verification of Primitive Necessity and Sufficiency

The following constitutes a machine-verified formal proof of primitive necessity and sufficiency, produced using SymPy (Python symbolic mathematics library) on 22 March 2026.

SymPy verification script

from sympy import symbols
from sympy.logic.boolalg import And, Not
from sympy.logic.inference import satisfiable

G, R, T, E, C = symbols('G R T E C')
Accountability = G; Justification = R; Auditability = T
Predictability = E; CommitmentControl = C
Complete = And(Accountability, Justification, Auditability, Predictability, CommitmentControl)

checks = {}
for prim, name in [(G,'Governance'), (R,'Reasoning'), (T,'Traceability'),
                   (E,'Expectation'), (C,'Confirmation')]:
    no_prim = And(Complete, Not(prim))
    checks[name] = {
        'Complete_implies_primitive (unsat)': not satisfiable(no_prim),
        'Failure_possible_without_it': satisfiable(And(Not(prim), *[p for p in [G,R,T,E,C] if p != prim]))
    }
sat_all_five = satisfiable(And(G, R, T, E, C, Complete))
print(checks)
print('Sufficient (all five implies Complete):', sat_all_five)

Results

Every Complete implies primitive check returns True — Complete AND NOT primitive is UNSAT for all five.

Every failure possible without it check returns True — the other four can hold while the missing primitive fails.

Sufficient: True — model {G:True, R:True, T:True, E:True, C:True}.

Failure modes when a primitive is absent

Remove Failure mode
Governance Illegitimate authority — rogue decisions indistinguishable from valid ones
Reasoning Opaque decision logic — cannot audit rationality or detect error
Traceability Mutable history — retroactive rewriting becomes possible
Expectation No falsifiable prior — hindsight bias uncheckable, learning impossible
Confirmation No deliberate gate — intent flows directly into irreversible action

Sufficiency

With all five primitives present, all failure modes are simultaneously eliminated. Any conceivable sixth property reduces to one of the five categories. The set is proven minimal and complete.

Note: the formal proof establishes structural completeness — that no primitive can be removed without creating an uncompensable failure mode. It does not guarantee the quality of reasoning within each primitive. FM_R (see Named Failure Modes) is a quality failure that can occur even when all five primitives are structurally present — the gate fires, the record exists, but the reasoning chain is hollow at the point that matters. Structural completeness is necessary but not sufficient for governed correctness.

Formal verification produced by Grok (xAI) via Python REPL, 22 March 2026. Machine-verified.

Appendix — adversarial simulation

The full Grok-run simulation of ten agent violations and ten detections is published as a standalone appendix: OMEGA Adversarial Simulation — 10 Agent Violations, 10 Detections.