Alternatives
Products that do what PMB – local-first memory for AI coding agents over MCP does
How it works: - Storage uses one SQLite database file, plus a local LanceDB index of vectors. No need for a server, cloud services, or any API keys. - Retrieval is a hybrid approach using BM25 (rank-bm25) and vector-based search (sentence-transformers) combined with a co-occurrence graph of entities, using reciprocal rank fusion. The idea is to find the right memory, not the closest one. - It plugs into the agent's lifecycle via MCP: before the agent responds, relevant memories are added to its input; after each turn, decisions and new learnings are automatically recorded. No need to…
- 1
- 2
An OKF-backed Model Context Protocol (MCP) server delivering persistent long-term memory and SQLite FTS5 search for AI agents. - fellowgeek/mcp-memory
24d ago · github.com
- 3PL
Jun 2026 · pmbai.dev
- 4
- 5
- 6
- 7
- 8AL
Dec 2025 · github.com
- 9
- 10IR
Hey HN! I built a proof-of-concept for AI memory using Git instead of vector databases. The insight: Git already solved versioned document management. Why are we building complex vector stores when we could just use markdown files with Git's built-in diff/blame/history? How it works: Memories stored as markdown files in a Git repo Each conversation = one commit git diff shows how understanding evolves over time BM25 for search (no embeddings needed) LLMs generate search queries from conversation context Example: Ask "how has my project evolved?" and it uses git diff to show actual…
2025 · github.com
- 11
- 12
- 13AM
Most RAG setups fail because they treat memory like a static filing cabinet. When every transient bug fix or abandoned rule is stored forever, the context window eventually chokes on noise, spiking token costs and degrading the agent's reasoning. This implementation experiments with a biological approach by using the Ebbinghaus forgetting curve to manage context as a living substrate. Memories are assigned a "strength" score where each recall reinforces the data and flattens its decay curve (spaced repetition), while unused data eventually hits a threshold and is pruned. To solve the…
Apr 2026 · github.com
- 14
- 15AF
Hi HN, We’ve been building [memU](https://github.com/NevaMind-AI/memU), an open-source memory framework for AI agents that supports both classic RAG and LLM-based direct file reading. RAG has become the default in LLM systems, but many of its failures don’t come from the model — they come from the retrieval assumptions. Embedding-based retrieval is fundamentally an approximation over semantic similarity. It works well for fuzzy recall, but it often breaks when relevance ≠ correctness, which is common in real systems. From a retrieval perspective, RAG struggles with: -…
Jan 2026 · github.com
- 16
An agent that remembers across sessions can keep its memory as curated markdown files, as an auto-mined structured store, or as trained experience.
22d ago · pinglin.tw
- 17SM
Apr 2026 · github.com
- 18
- 19
I've been working on Polign and built a small prototype around something I've been thinking about with agent memory. I have built a lightweight/stateless vector db + BM25 search which works really well with typed facts and structured queries. It uses your own S3, or GCS bucket as primary storage, and restarting a node is fairly quick. Demo + writeup: https://polign.com/blog-edge-agent-memory Live search demo: https://demo.polign.com Docs: https://polign.com
11d ago · polign.com
- 20
- 21MA
Hello there HN I experimented with agentic coding recently and I felt the need to track more contextual data by project. Also I felt the need to be able to go beyond the 1D chat to communicate with agents. So I created a local document memory, that is discoverable by agents themselves. The CLI is designed to be easy to pick up by agents. It allows humans to collaborate too by reading / searching / editing documents in the store. I have a Mac native GUI in the review process, I hope it will show up in the App Store soon. You can try it easily, instructions here:…
Jun 2026 · metabrain.eu
- 22CS
Coding agents don't have long-term memory. But you do have months of full-fidelity agent transcripts stored on your machine. A simple solution that goes a long way: ingest those transcripts and logs into a structured SQLite database, then search them with ranked text match. Everything is fully local and doesn't require anything fancy like a graph database or hosted memory service. This is the idea behind ctx, a Rust CLI that handles the ingestion and searching. We give our agents a skill that tells them to reference past sessions before working in an area. Usually we do this through an…
Jul 2026 · github.com
- 23
- 24AM
Vector databases store memories. They don't manage them. After 10k memories, recall quality degrades because there's no consolidation, no forgetting, no conflict resolution. Your AI agent just gets noisier. YantrikDB is a cognitive memory engine — embed it, run it as a server, or connect via MCP. It thinks about what it stores: consolidation collapses duplicate memories, contradiction detection flags incompatible facts, temporal decay with configurable half-life lets unimportant memories fade like human memory does. Single Rust binary. HTTP + binary wire protocol. 2-voter + 1-witness HA…
Apr 2026 · github.com
Ranked by how close each launch is in meaning, then by votes. Refine with a description →