A Common Transparency Protocol in the Age of Agentic AI: A trustworthy architecture for governing what autonomous AI agents do and when their actions may be considered complete
Description
The contribution of this paper is a machine-enforced settlement rule for governed mutations, designed to be portable across systems and independently testable. Indeed, AI systems no longer merely answer questions. They autonomously plan, retrieve, decide, and execute actions across APIs, databases, and other systems, but a successful execution response alone does not establish that the specific agentic action produced the expected external effect. This paper proposes the Common Transparency Protocol (CTP), a framework for making agentic systems auditable, explainable, contestable, and accountable. Its machine-readable CTP Agentic Envelope represents a bounded objective and contains zero or more Action Envelopes, binding authority, evidence, approvals, execution, reconciliation, action closure, and derived objective disposition into a portable governance record. CTP has three modular architectural components and three cumulative conformance classes: CTP-Core specifies structured records and closure semantics; CTP-Integrity adds cryptographic sealing and independently administered anchoring; CTP-Oversight enforces designated approval and mediation rules before execution and withholds committed closure until all applicable reconciliation and authority conditions pass. A successful tool response or matching postcondition alone is not settled completion. The system that performs a change cannot certify its own success: committed closure requires a fresh authoritative observation, obtained by an independently selected verifier, establishing both the expected effect and its attribution to the governed action, and only a qualified closure authority outside the mutation path may assign it. If the attributable effect remains unresolved at the closure deadline or other policy bound, the original Action Envelope closes incomplete. Later resolution uses a linked successor without rewriting that original terminal closure.
Patent notice: DSS, Inc. has filed a U.S. provisional patent application covering aspects of the work described in this paper. The Creative Commons license applies to the text of this paper and does not grant any patent rights.