The Log Is the Agent: Event-Sourced Reactive Graphs for Auditable, Forkable Agentic Systems
The Log Is the Agent
Yohei Nakajima proposes ActiveGraph, a runtime where the append-only event log is the source of truth and the working graph is a deterministic projection. Components coordinate only through the shared graph, never by direct instruction. This gives three properties retrieval-based memory can't match: deterministic replay from the log, cheap forking at any event without re-running the shared prefix, and end-to-end lineage from goal to individual model call. The paper includes architecture, a determinism contract, and a worked diligence example. Open-source code is available. The post doesn't report large-scale performance numbers, so treat this as an architecture proposal for now.
Why it matters: The architectural idea is original—applying event sourcing to agent runtimes, not just a wrapper. But it's a single arXiv paper with no open-source implementation or real-world deployment yet, so it stays at the 72-point featured threshold.