agenticow
An embedded vector database for multi-agent memory that branches a base vector index in about half a millisecond using copy-on-write, instead of fully copying the index to snapshot, fork or checkpoint it as other vector stores require.
agenticow treats vector memory as a branchable runtime primitive rather than a static index: creating a branch costs about 0.5 milliseconds and 162 bytes regardless of whether the base index holds 10,000 or 1,000,000 vectors, because it copies only the parts that change rather than the whole index. Querying a branch transparently sees the parent index plus that branch's own edits, with the child's edits winning on any id collision and deletions honored.
This makes several patterns cheap that are otherwise a full index copy each time: many parallel agents sharing one base memory, each paying only its own edits' cost instead of a full copy; rolling back a branch that was corrupted by a bad or hallucinated ingest, by simply dropping it; and zero-cost checkpointing before a risky step, storing only the edits made since the last checkpoint. A CLI and an API support branching, checkpointing and rolling back, diffing and promoting a branch, top-K read-through queries with tombstone masking, and forking many branches off one static base in a single process.
It installs from npm and is written in JavaScript.