What is PDDS?
PDDS is a distributed systems paradigm for reasoning about systems whose participants exhibit bounded, governable, or irreducible non-determinism.
The coordination layer for infrastructure whose autonomous participants are probabilistic. PDDS converts stochastic model output into governed intent before any consequential state change.
Classical distributed consensus assumes deterministic participants under network partitions. PDDS decouples reasoning from execution authority, enforcing zero unauthorized state mutations across critical systems.

Deterministic policy gates isolate model stochasticity, ensuring actions execute only within validated contracts and immutable audit chains.
PDDS describes distributed systems whose participants may be deterministic, stochastic, adaptive, or human-mediated, while still requiring governed, explainable, and auditable coordination before consequential execution.
Classical distributed systems assumed deterministic participants and focused on networks, timing, and failures. That foundation remains essential, but it does not fully describe systems where participants interpret goals, synthesize plans, adapt workflows, or ask humans to approve consequential actions.
Post-Deterministic Distributed Systems (PDDS) extends the model to include non-deterministic participants such as AI agents, autonomous services, adaptive workflows, and human-in-the-loop components. PDDS treats deterministic services as the zero-ambiguity limit case inside a broader governable participant model.
The pillar names follow the terminology defined in the PDDS paper and manifesto.
Defines machine-enforceable protocols that admit generated software and autonomous outputs only when they satisfy semantic and operational invariants.
Replaces static credentials with intent-based authorization, ephemeral delegation, and evidence-backed execution identity.
Separates high-variance reasoning from direct state mutation while preserving intent across asynchronous execution.
Certifies meaning, intent, policy, and evidence across diverse participants instead of relying only on bitwise agreement.
Replicates knowledge states and belief lineage while preserving cognitive diversity and enabling semantic rollback.
How does PDDS verify and audit non-deterministic execution in practice? By replacing verbose human prose logs with cryptographically verifiable state deltas. ATP slashes LLM context load by 88.8%, reduces wire payloads by 96.4%, and eliminates prompt injection vulnerabilities.
512.4 B → 18.4 B raw wire payload per record.
34k → 3.8k tokens per incident diagnosis session.
TT-RCA reduced from 184s down to 46s.
0/100 attacks successful across adversarial trials.
Why do protocol-compliant AI agents agree on catastrophic state transitions? Classical BFT assumes independent node failures. When LLMs share foundational biases or prompt drift, they exhibit correlated cognitive failure modes. Epistemic Byzantine Fault Tolerance (EBFT) introduces confidence-indexed quorum bounds (Q > f + eδ) to prevent false semantic consensus.
Quorum size required to survive malicious + correlated hallucinating nodes.
Physical/crash, semantic divergence, and correlated hallucination.
Enforces deterministic semantic validation before state commits.
Cross-substrate quorum members decouple correlation failure modes.
OpenKedge explores architectures for sovereign, governable, and verifiable AI systems supporting enterprises, critical infrastructure, and national-scale digital transformation initiatives.
Critical actions begin as reviewable intent instead of unchecked operational access.
Institutional policy constrains what autonomous systems may recommend, escalate, or execute.
Every important decision leaves a replayable chain for operators, auditors, and leaders.
Reasoning can be global while execution authority remains inside local institutions.
The implementation path stays portable through open protocols and reference code.
The canonical research artifact is the arXiv paper, with the OpenKedge paper page serving as the HTML reading and sharing surface.
Use Post-Deterministic Distributed Systems (PDDS) on first mention, then PDDS thereafter. This keeps citations, answer engines, social posts, GitHub discussions, and future papers converged on one short term.
PDDS is a distributed systems paradigm for reasoning about systems whose participants exhibit bounded, governable, or irreducible non-determinism.
PDDS stands for Post-Deterministic Distributed Systems.
Classical distributed systems primarily model deterministic participants under network, timing, and failure constraints. PDDS extends that model to include non-deterministic participants such as AI agents, autonomous services, adaptive workflows, and human-in-the-loop components.
Global models may propose. Local policy, bounded credentials, and tamper-evident evidence determine what is permitted to execute.