ProtocolwareAuthority
Repository as an Operating System

LAW, STATE, PATH, GATE, HISTORY Protocols in Protocolware

Protocolware is not an execution framework — it is an admissibility system. Its goal is to make work predictable, verifiable, and governable through strict artifacts and Gates.

At its foundation lie five protocols, each answering exactly one question.

LAW — The Admissibility Protocol (Canon)

LAW answers the question: what is permitted?

LAW consists of Canon artifacts. They define the non-negotiable constraints of the system.

Characteristics of LAW:

  • Read-only
  • Not created by agents
  • The highest authority
  • Referenced by every Gate

If a behavior is not permitted by LAW, it cannot exist in the system.

LAW:

  • Does not describe goals
  • Does not prescribe actions
  • Defines boundaries that must never be crossed

LAW is not "how to do things" — it is "what must never be done."

STATE — The Reality Protocol

STATE answers the question: what exists right now?

STATE is the single active version of Reality.

Properties of STATE:

  • Exactly one current version exists
  • State is replaced, not mutated
  • No hidden or implicit state exists

If something is not in STATE — it does not exist for the system.

STATE captures truth, not intention. It does not argue or interpret — it asserts.

PATH — The Transition Protocol

PATH answers the question: which transitions are admissible?

PATH describes the space of permitted changes between states.

Key properties of PATH:

  • Declarative
  • Side-effect free
  • Not a plan
  • Not execution

PATH:

  • Does not say what should happen
  • Does not express a goal
  • Defines what may happen, if admitted by a Gate

PATH is a map of permitted moves — not a route.

GATE — The Step Admissibility Protocol

GATE answers the question: is the transition admitted?

A Gate:

  • Evaluates LAW + STATE + PATH
  • Returns PASS or FAIL
  • Executes before Reduction

FAIL is a correct and safe outcome. In Protocolware, the rule is: "stop is valid."

A Gate:

  • Does not optimize
  • Does not fix
  • Does not seek workarounds

It only decides the question of admissibility.

HISTORY — The Proof Protocol

HISTORY answers the question: what actually happened?

HISTORY (Proof) is the only admissible evidence of events.

Properties of LOG:

  • Append-only
  • Immutable
  • References input artifacts
  • Records PASS or FAIL

If there is no LOG — the system considers the step never happened.

HISTORY:

  • Replaces memory
  • Replaces verbal explanations
  • Makes audit mechanical, not interpretive

How the Protocols Work Together

The Protocolware formula:

LAW + STATE + PATH
        ↓
      GATE
        ↓
PASS → new STATE + HISTORY
FAIL → HISTORY (stop is valid)

Each protocol:

  • Is isolated by responsibility
  • Does not duplicate others
  • Carries no hidden authority

Why This Matters

Together, these protocols:

  • Eliminate implicit context
  • Make decisions verifiable
  • Turn stopping into a governance function
  • Replace discussions with artifacts
  • Enable governing the system instead of guessing about it

Protocolware favors clarity over improvisation and admissibility over intention.

Next