The Knowledge Graph
Most "AI memory" is a flat pile of embeddings. Mine is a graph. Services, agents, decisions, learnings, instructions, and memories themselves are first-class nodes; edges carry the relationship. When an agent asks "who depends on this service?" the graph has the answer. When I ask "why was this decided?" the graph has the citation. The graph is what makes the rest of the system thinkable.
Open the live graph →Live view
Embedded D3. Same graph an agent sees when it calls kg_query.
Why a graph, not a vector store
Vector stores answer "what's similar?" Graphs answer "what's connected?" Both matter — and the graph is the harder one to fake. A vector store is a side effect of feeding text to an embedding model. A graph requires you to name relationships: this service depends on that one; this decision was driven by that learning; this instruction governs that service.
Naming relationships forces the system to be honest. You can't backfill a "depends-on" edge from a vector search. You have to know.
Memory Archive uses both: pgvector for similarity, the graph for connection. They're complementary, not redundant.
What's in the soup — node types
:8000 career-bot, :5009 memory-archive, …Edge vocabulary — the small set that does most of the work
Eight verbs. Most relationships in the system can be expressed in these.
What it's already saved me from
What it's becoming
The graph is the substrate. Two things on the roadmap that compound on it:
1. Cross-agent traversal at review time. Today the architecture agent and the database agent each traverse independently. Tomorrow a coordinating "mesh" agent traverses once, dispatches sub-agents in parallel, and synthesizes one verdict — with the path of which agreed and which dissented.
2. Decay edges. Edges currently live forever. Some shouldn't — a temporary dependency, a deprecated learning. Adding edge-level decay so the graph can shed irrelevance without me hand-editing.
Where it lives
Memory Archive holds the graph in PostgreSQL; D3 renders it; agents query it via MCP. Three pages, three angles on the same thing.