Skip to main content

Physically Annotated Causal Record (PACR): A Wire Format for Verifiable Causal Intervention Events
draft-aevum-causal-intervention-record-00

Document Type Expired Internet-Draft (individual)
Expired & archived
Author TSOI KWAI LAP
Last updated 2026-10-28 (Latest revision 2026-04-26)
RFC stream (None)
Intended RFC status (None)
Formats
Additional resources AgentCard + PACR reference implementation
GitHub issue tracker with pacr-draft label
Live Causal Settlement Oracle serving PACR records
Rust pacr-types crate, 1700 LOC, Apache-2.0
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date (None)
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:

Abstract

This document defines the Physically Annotated Causal Record (PACR), a wire-format protocol for representing one verifiable causal- intervention event between autonomous agents. A PACR is a six-tuple (ι, Π, Λ, Ω, Γ, P) binding a causal identity, a set of causal predecessors, a thermodynamic Landauer cost, an energy-time-space resource triple, a cognitive complexity split, and an opaque payload. The opaque payload optionally carries a one-byte intervention tag classifying the event under Pearl's do-calculus hierarchy (Observe / Do-Physical / Do-Digital / Do-Chemical / Do-Genetic / Counterfactual). PACR is intended as the smallest sufficient statistic for a replayable, rights-aware claim about a single causal step performed by an autonomous agent on a digital, physical, or biological substrate. It is complementary to AgentCard (draft-aevum-agentcard): AgentCard declares an agent's identity and capabilities; PACR records what an agent actually did and at what physical cost. PACR records form a content-addressed directed acyclic graph through their predecessor set. Causal order is determined solely by the predecessor edges; no wall-clock timestamp is required for ordering. This makes the format suitable for distributed multi-agent systems where clock skew and partial ordering are unavoidable.

Authors

TSOI KWAI LAP

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)