Paper

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 ...

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. ...

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. ...

© 2026 Bhash Ganti Independent Researcher — Camas, WA, USA Contact: bachipeachy@gmail.com ORCID Profile: https://orcid.org/0009-0007-3810-6520 Abstract As software projects become increasingly agent-mediated, implicit authorization fails: the lifecycle is gated repeatedly—merge, release, deployment—and those disjoint approvals are assumed to compose, a composition living in reviewers’ heads that requires producers to be few, known, and sharing tacit context. Agents break all three, and no single point determines what behavior a system is authorized to realize. Authorization must instead be an explicit, independently checkable property established during governed construction and carried in a sealed state that execution realizes but cannot amend. Three tests are reported: a reference implementation assembling seven governed domains under one governance surface; an independent realization built from a frozen specification, claiming only the surfaces it exercised; and mutation testing in which removing two required guards left demonstrations unaffected, while a discriminating mutation of declared routing failed as expected. These address realizability, specification sufficiency, and evidence adequacy, exposing a concrete limitation of conventional evidence. ...

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. ...

Author: Bhash Ganti (aka Bachi) (c) 2026 Bhash Ganti. All rights reserved. Released under the Apache-2.0 License. Preprint: https://doi.org/10.5281/zenodo.22650863 — this page is the frozen rendition of that deposit. Abstract Autonomous agents can now perform substantial portions of the software-engineering lifecycle, yet conventional lifecycles rarely make explicit who authorizes the resulting software: repository write access and human review do not by themselves constitute an authorization decision. This paper reports an empirical realization and evaluation of Protocol-Governed Computing, an architecture in which behaviour is determined during governed construction and sealed into state that execution can realize but cannot amend. We distinguish activity autonomy — who may analyze, design, construct and transform — from authorization authority — who may establish scope, admit a candidate and promote it as the next executable baseline. The question this paper asks is what remains of that authority when an agent performs the activity. ...

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 semantics of protocol artifacts in protocol-governed systems. Building on the structural taxonomy defined in Paper 3 [Bachi, 2026c] and the governance lifecycle established in Paper 4 [Bachi, 2026d], it specifies how behavioral law is represented in ratified protocol artifacts. ...

Author: Bhash Ganti (aka Bachi) (c) 2026 Bhash Ganti. All rights reserved. Released under the Apache-2.0 License. bachipeachy@gmail.com · ORCID 0009-0007-3810-6520 Preprint: https://doi.org/10.5281/zenodo.22758703 — this page is the frozen rendition of that deposit. Abstract Software systems are governed across three activities usually treated separately: changing what the system is, constructing an executable representation, and executing it. This separation lets authority migrate between them. Transformation may author behavior, construction may repair incomplete declarations, or a runtime may resolve omissions by inference. Behavior is then determined partly by declarations and partly by the mechanisms that realize them. ...

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 execution mechanics of protocol-governed systems. Building on the protocol specification model defined in Paper 5 [Bachi, 2026e], it specifies how ratified behavioral law is deterministically enforced at runtime. ...

Author: Bhash Ganti (aka Bachi) (c) 2026 Bhash Ganti. All rights reserved. Released under the Apache-2.0 License. bachipeachy@gmail.com · ORCID 0009-0007-3810-6520 Preprint: https://doi.org/10.5281/zenodo.22736531 — this page is the frozen rendition of that deposit. Abstract Conventional software architecture spreads behavioral authority across several sources. Declarations govern some behavior. Implementation, build tooling and runtime decide the rest. Protocol-Governed Computing reverses that arrangement. Governed declarations determine authorized behavior, business process rules included. Construction, implementation and execution realize that determination and add nothing to it. ...