v0.3.4 · Business Source License 1.1
Enables AI assistants to read and write a local-first SQLite memory vault from inside a chat — orienting on inherited context, searching and fetching past decisions and notes, wandering linked memories, and recording new ones on demand. All data stays on the user's machine, shared across local and cloud tools via MCP.
v0.9.0 · MIT License
Stores what AI agents learn — thoughts, decisions, session events and repo facts — in PostgreSQL with pgvector and serves it back through versioned MCP tools with hybrid vector-plus-full-text retrieval and budgeted context packs. Enables multiple agents to share one scoped, role-isolated long-term memory, with deliberate promotion of distilled candidates into durable memories.
v0.1.0 · MIT License
Provides a shared, repo-local memory that lets coding agents recall relevant decisions, conventions, gotchas, and open threads, save new entries, coordinate file claims, and cache file summaries across tools and sessions.
— · MIT License
Exposes a read_source tool that lets agents read cited tickets, docs, and files through the same path the checker verifies, so quoted business rules match their sources and stay in sync as those sources or their authors change. It also keeps undecided product decisions explicit as open questions rather than letting agents invent answers.
— · MIT License
A self-hosted MCP memory server that gives every MCP-compatible agent a shared, persistent memory layer, so preferences, project conventions, and past decisions carry across sessions and across different agents and vendors. It combines hybrid keyword-plus-vector retrieval with automatic context injection, zero-config sync, and selective injection of memories by agent and priority.
— · MIT License
Enables AI agents to store decisions as a versioned history, linking each new decision to the one it replaces so that recall always resolves to the decision currently in force instead of obsolete ones. It runs fully locally on a single SQLite file with BM25 search, and can optionally detect replacements automatically via an LLM or heuristic linker.