PGS

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Categories: Software Engineering (cs.SE), Programming Languages (cs.PL), Software Architecture Keywords: software architecture, declarative systems, deterministic execution, protocol governance, AI-generated code, auditability, separation of concerns, constitutional primitives, architectural layers, behavioral concerns ...

Separating What Is Dispensable from What Must Endure Software is changing faster than we can understand it. AI can now generate production-quality code at speeds that dwarf human output. Entire features can be scaffolded in minutes. Refactors that once took weeks are completed in seconds. But there is a growing problem hiding beneath that productivity surge: We no longer know, with confidence, what our systems actually do. When someone asks, “What does this system do?” the answer usually requires reading thousands of lines of code. Business rules, constraints, edge cases, compliance logic — all of it is embedded inside implementation details. ...

Why PGS Exists Traditional systems: embed behavior in code are difficult to audit and reproduce require changes across multiple layers PGS: declares behavior in protocol artifacts compiles it into an execution graph executes deterministically with a full trace This onboarding shows how to work within that model. 1. What You Already Did If you followed the pgs_workspace README, you ran this: ./scripts/bootstrap_pgs.sh source .venv/bin/activate ./scripts/demo_sample_workflow.sh You saw a workflow execute twice. The first run registered an actor. The second run produced ALREADY_EXISTS on one node — and still wrote to the event stream. You examined a trace. ...

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Categories: Software Engineering (cs.SE), Programming Languages (cs.PL), Computational Complexity (cs.CC) Keywords: Turing completeness, universal computation, protocol governance, declarative systems, constitutional architecture, deterministic execution, auditability, AI-era software Introduction Motivation: Why Turing Completeness Is No Longer Enough The theory of computation has long celebrated Turing completeness as the definitive measure of computational power. A system is deemed “complete” if it can simulate any Turing machine—if it can compute any function that is computable in principle . This criterion, established nearly a century ago, remains the benchmark against which programming languages, virtual machines, and computational models are evaluated. ...

In the previous post, I introduced the idea of Protocol-Governed Systems (PGS) — a class of software architecture where behavior is separated from implementation and governance becomes the primary system driver. The response told me something: the concept resonated, but the vocabulary needs grounding. Today, before we move into the mechanics of Paper #2, I want to establish two precise definitions: What exactly is a Protocol-Governed System? What role does OmniBachi play in that landscape? ...

Author: Bhash Ganti (Bachi) Goal: Teach PGS by building something real, not by describing an abstraction. Before You Start This document assumes you have run the bootstrap and seen at least one workflow execute. You do not need to understand everything yet — that is the point of an example. We will build a complete domain from scratch, following the same steps used to build the actual collatz_conjecture domain in pgs_ai_governance. By the end, you will understand how a real spec becomes a running, traceable, transport-accessible PGS domain. ...

In Part 2, we defined what a Protocol-Governed System is and where OmniBachi fits as its reference implementation. We established three architectural commitments: semantic-agnostic execution, linear scalability, and inverted security. Today, we apply those commitments to the most consequential architectural shift in enterprise software: agentic AI. Because the models are no longer just answering questions. They are acting. And acting without structural authority is how systems fail. AI grips power and chaos unfolds ...

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Contact: bachipeachy@gmail.com Abstract This paper formalizes the structural core of protocol-governed systems through a constitutional taxonomy based on two orthogonal primitives: layers and concerns. Prior work established the separation between behavioral specification and execution mechanics [Bachi, 2026a] and demonstrated that constitutional constraint is compatible with universal computation [Bachi, 2026b]. This paper isolates the structural grammar that makes such governance enforceable. ...

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Contact: bachipeachy@gmail.com Abstract This paper formalizes the governance mechanics of protocol-governed systems. Building on the structural taxonomy defined in Paper 3 [Bachi, 2026c], it specifies how behavioral law is proposed, validated, ratified, versioned, and amended. ...

In Part 3, we argued that agentic AI needs a constitution, not just guardrails. The core insight: the real enterprise risk is not hallucination — it is ambient authority, the implicit power agent frameworks grant to models without structural boundaries. That post was about why. This one is about how. And we have a concrete protagonist: OpenClaw. OpenClaw: The Agent Enterprises Want OpenClaw is an open-source autonomous AI assistant that is catching fire in the developer community. It runs locally, uses Claude as its reasoning engine, and has capabilities that would have seemed science fiction two years ago: ...