Alternatives
Products that do what A file-based agent memory framework that works like skill does
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: -…
- 1UM
Hi HN, We’ve been building memU(https://github.com/NevaMind-AI/memU), an open-source, general-purpose memory framework for AI agents. It supports dual-mode retrieval: classic RAG and LLM-based direct file reading. Most multimodal memory systems either embed everything into vectors or treat non-text data as attachments. These work, but at scale it becomes hard to explain why certain context was retrieved and what evidence it relies on. memU takes a different approach: since models reason in language, multimodal memory should converge into structured, queryable text, while…
Jan 2026 · github.com
- 2AM
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
- 3
- 4
- 5
Smarter RAG with Agentic Retrieval & Context-Aware MCP
Sep 2025
- 6
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
- 7
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
- 8
- 9CL
I have a proposal that addresses long-term memory problems for LLMs when new data arrives continuously (cheaply!). The program involves no code, but two Markdown files. For retrieval, there is a semantic filesystem that makes it easy for LLMs to search using shell commands. It is currently a scrappy v1, but it works better than anything I have tried. Curious for any feedback!
Apr 2026 · github.com
- 10PL
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…
Jun 2026 · github.com
- 11YA
This is a project that I have been building for a while now, YourMemory is a solution to agentic memory which focuses on pruning of noise rather than hoarding of data. In the current state of agentic memory most of the context is stored in the form of a MD file or is derived through a RAG model where you store each and everything. Both of the solution leads to bloated context which does not optimize the usage of any tokens. In this system we only keep relevant data in our memory and prune all the unnecessary data. The relevance of a data is derived through multiple factors such as recall…
Jun 2026 · yourmemoryai.vercel.app
- 12
- 13
- 14OA
Hi HN, we're Kiran and Vijay! Over the past two years, we have built a columnar storage engine for observability: logs, metrics, and traces. Today, it's exciting for us to show what we've built on top of that foundation: LLM Agent Observability. Given how non-deterministic agents are, storing all traces without sampling was critical for us. But these traces tend to be in the MBs, sometimes GBs - we needed to store them inexpensively. We also needed the queries and analyses to be fast. To meet both these goals, we store them in S3 in our own parquet-like file format, and query them using AWS…
Jul 2026 · oodle.ai
- 15TA
In this post, we document the results of some experiments comparing vanilla Graph RAG (just a single pass of text2cypher) vs. a router agent Graph RAG approach that can call vector search tools alongside text2cypher. The routing agent uses an LLM to decide which vector search tool to call, depending on the terms identified in the question, and it works quite well. The results show that recent frontier LLMs like `gpt-4.1` and the trusty workhorse `gemini-2.0-flash` produce great quality Cypher reliably and reproducibly, with some prompt engineering to ensure that the graph schema is formatted…
2025 · blog.kuzudb.com
- 16
- 17HO
Hey HN, It’s Vineeth from Plastic Labs. We've been building Honcho, an open-source memory library for stateful AI agents. Most memory systems are just vector search—store facts, retrieve facts, stuff into context. We took a different approach: memory as reasoning. (We talk about this a lot on our blog) We built Neuromancer, a model trained specifically for AI-native memory. Instead of naive fact extraction, Neuromancer does formal logical reasoning over conversations to build representations that evolve over time. Its both cheap ( $2/M tokens ingestion, unlimited retrieval), token…
Jan 2026 · github.com
- 18
- 19
- 20IM
When your embedding provider is good, but could be better for your use-case.
2024 · zoplabs.com
- 21
- 22PR
Hi HN, While building RAG agents, I noticed a lot of token budget was wasted on formatting overhead (HTML tags, JSON structure, whitespace). Existing solutions felt too heavy (often requiring torch/transformers), so I wrote this lightweight, zero-dependency library to solve it. It includes strategies for context packing, PII redaction, and tool output compression. Benchmarks show it can save ~15% of tokens with negligible latency overhead (<0.5ms). Happy to answer any questions!
Dec 2025 · github.com
- 23ZL
Zep is a long-term memory store designed for conversational AI applications built using modern LLMs. It handles the storage, summarization, embedding, indexing, and enrichment of chat histories, and offers developers a simple, low-latency API to this data. Chat history storage is an infrastructure challenge all developers and enterprises face as they look to move from prototypes to deploying conversational AI applications that provide rich and intimate experiences to users. Key features include long-term memory persistence, auto-summarization, vector search, auto-token counting, and Python…
2023
- 24
Ranked by how close each launch is in meaning, then by votes. Refine with a description →