VA-Graph is a single engine for every state in the collection that is secretly a graph: a memory that decays, a map of places and routes, a ledger of agents and assets. Nodes carry identity, edges carry a record of weights — strength, confidence, distance, amount — and one stock table records what is physically held where. A single partition id scopes each world; the kernel never learns what a memory or a city is.

The kernel is deliberately blind. It stores, traverses, decays, and paginates — k-hop expansion, Dijkstra shortest path per weight dimension or combined, cascade deletes, idempotent upserts — while per-domain plugins supply the strictness: memory episodes and causal links, places and bidirectional routes, agents with transfers that must balance. Strictness moved from DDL into validation, so three domains share three tables without stepping on each other.

Distribution is a folder, not a registry: copy src/graph with its index and note, and the engine travels. An isolation check forbids the kernel from importing any domain, and persistence arrives through VA-ORM with an in-memory twin for tests. Forgetting is physics here — half-life decay with reinforcement caps — and stock moves atomically with its edge, so a crash cannot leave a transfer half-remembered.