Breathe-Memory
Associative memory injection for LLMs (not RAG)
Get picks like this daily. Today's launch numbers, the top launches, AI and tech news, and a daily opportunity pick, straight to your inbox.
Want to reach these readers? Sponsor an issue.
LLMs forget. The standard fix is RAG — retrieve chunks, stuff them in. It works until it doesn't: irrelevant chunks waste tokens, summaries lose structure, and nothing actually models how memory works.Breathe-memory takes a different approach: associative injection. Before each LLM call, it extracts anchors from the user's message (entities, temporal references, emotional signals), traverses a concept graph via BFS, runs optional vector search, and injects only what's relevant — typically in <60ms.When context fills up, instead of summarizing, it extracts a structured graph: topics, decisions, open questions, artifacts. This preserves the semantic structure that summaries destroy.The whole thing is ~1500 lines of Python, interface-based, zero mandatory deps. Plug in any database, any LLM, any vector store. Reference implementation uses PostgreSQL + pgvector.https://github.com/tkenaz/breathe-memoryWe've been running this in production for several months. Open-sourcing because we think the approach (injection over retrieval) is underexplored and worth more attention.We've also posted an article about memory injections in a more human-readable form, if you want to see the thinking under the hood: https://medium.com/towards-artificial-intelligence/beyond-ra...
HN · launched Mar 26, 2026 · 6 upvotes (top 71%) · 0 views
Niche: ai agent memory infrastructure · 350 launches, 11 in the last 7 days ▼ -58% · Explore this niche →
Category and tags
- Horizontal
- Model & infra
- Developer
- AI-native
- Commercial product
Visit website ↗ Source listing ↗
More like this: all 350 launches in ai agent memory infrastructure →
Could you build this?
Partial The memory injection interface is simple Python code, but developing a genuinely effective associative memory model beyond basic RAG requires non-trivial graph/associative retrieval algorithms.
What it would actually take: The architecture relies on a local or embedded vector/graph store (e.g., NetworkX, SQLite-VSS, or Neo4j) that tracks temporal associations, entity relationships, and activation spreading algorithms before formatting prompt injections. The hard part is designing the cognitive/associative retrieval algorithm so it stays fast and avoids poisoning context windows with irrelevant associations. It requires domain knowledge in cognitive architecture or information retrieval systems.
Discussion
1 comment analyzed.
Competitors mentioned: RAG (Retrieval-Augmented Generation)
Competitors
Other products that read as similar to this one : 155 launches clear the similarity bar, closest 8 shown.
Attention rank: #120 of 156 (itself plus its competitors, highest first, normalized so YC and Product Hunt are compared fairly).
Launched 143 days after the earliest competitor.
- OpenFable · hn · 2026-04-08 · 5 upvotes · similarity 0.53
- A file-based agent memory framework that works like skill · hn · 2026-01-06 · 11 upvotes · similarity 0.53
- Context-compact · hn · 2026-03-07 · 6 upvotes · similarity 0.52
- GibRAM an in-memory ephemeral GraphRAG runtime for retrieval · hn · 2026-01-18 · 60 upvotes · similarity 0.51
- LLM Memory Storage that scales, easily integrates, and is smart · hn · 2026-03-16 · 6 upvotes · similarity 0.50
- AI memory with biological decay (52% recall) · hn · 2026-04-26 · 98 upvotes · similarity 0.48
- Fixing LLM memory degradation in long coding sessions · hn · 2025-11-27 · 5 upvotes · similarity 0.48
- Llm.sql · hn · 2026-04-24 · 8 upvotes · similarity 0.48
The niche, labels, vibe code rating and competitor comparison on this page are analysis by Nicheloom. If you use them, please credit nicheloom.com. How you may use our data.