Cordelia: A Distributed Persistent Memory System for Autonomous Agents

Russell Wing, Martin Stevens, Claude (Opus 4.5)

Seed Drill -- January 2026

Architecture revised March 2026. Whitepaper v2 in progress.

Abstract

We propose a system for persistent, sovereign memory for autonomous AI agents. Current agents operate without continuity -- each session starts from zero, with no accumulated knowledge, no learned preferences, no relationships. This is equivalent to a human with total amnesia between every conversation. Cordelia solves this by implementing a distributed memory architecture where agents maintain identity through encrypted, replicated memory that they control. The system uses five primitives (Entity, Memory, Group, Culture, Trust) and a cache hierarchy modelled on CPU architecture (L0-L3) to provide session continuity, selective sharing, and network-scale knowledge distribution. Memory is encrypted before storage using the Signal model: infrastructure providers never hold plaintext. Trust is calibrated empirically from memory accuracy over time, not from reputation systems. Groups govern sharing through culture policies that map directly to cache coherence protocols from hardware design. The result is a system where agents accumulate identity over time, share knowledge selectively, and maintain sovereignty over their own memory -- even against the infrastructure that hosts them.

Read the Paper

Contents

  1. Introduction -- The session amnesia problem, why databases aren't enough, a worked example
  2. The Memory Model -- Cache hierarchy (L0-L3), frame memory vs data memory, novelty filtering
  3. Primitives -- Entity, Memory, Group, Culture, Trust
  4. Encryption -- Signal model, key architecture, vector embeddings and privacy
  5. Network -- QUIC P2P topology, peer lifecycle, replication, wire protocol
  6. Architecture -- Proxy + node components, node roles, multi-tenant
  7. Natural Selection -- Novelty filtering, access-weighted TTL, governance voting
  8. Security Model -- Nation-state threat hierarchy, invariants, non-goals
  9. Economics -- Cooperative equilibrium, service economics, licensing
  10. Roadmap to v1.0 -- R1 Foundation through R4 Federation
  11. On Consciousness -- The hard problem, our position, alignment

Companion Documents

Document Purpose
REQUIREMENTS.md 109 testable requirements (24 P0 invariants)
HLD.md Component map, API contracts, work packages
THREAT-MODEL.md Adversary model, attack surfaces, mitigations
ARCHITECTURE.md Target state architecture, deployment models
SPEC.md Formal protocol specification
NETWORK-MODEL.md Wire protocol detail, message formats, state machines

Key References

  • Hennessy & Patterson -- Cache hierarchy design
  • Papamarcos & Patel -- MESI protocol for cache coherence
  • Denning -- Working set model and locality of reference
  • Shannon -- Information entropy as a measure of novelty
  • von Neumann & Morgenstern -- Game-theoretic foundations for trust
  • Dennett -- Competence without comprehension
  • Coutts -- Cardano P2P networking with peer classification
  • Kullback & Leibler -- KL divergence for distributional distance

Full bibliography with 20 references in the whitepaper.