Nicheloom visits: 58,069 all-time · 7,637 in the last 7 days

The opportunity tracker for new startups.

Today: 1,953 launches · Niche of the day: specialized calculation tools · See what launched today →

AI memory with biological decay (52% recall)

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.

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 "logical neighbor" problem where semantic search misses relevant but non-similar nodes, a graph layer is layered over the vector store. Benchmarked against the LoCoMo dataset, this reached 52% Recall@5, nearly double the accuracy of stateless vector stores, while cutting token waste by roughly 84%.Built as a local first MCP server using DuckDB, the hypothesis is that for agents handling long-running projects, "what to forget" is just as critical as "what to remember." I'd be interested to hear if others are exploring non-linear decay or similar biological constraints for context management.GitHub: https://github.com/sachitrafa/cognitive-ai-memory

HN · launched Apr 26, 2026 · 98 upvotes (top 11%) · 0 views

Niche: ai agent memory infrastructure · 350 launches, 11 in the last 7 days ▼ -58% · Explore this niche →

Category and tags

  • Horizontal
  • Data infrastructure
  • Developer
  • AI-native
  • Hobby / open-source project

Visit website ↗ Source listing ↗

Could you build this?

Yes This is an experimental RAG retrieval strategy that applies mathematical decay scoring (e.g., Ebbinghaus forgetting curve equations) to vector/metadata database queries. Implementing custom decay scoring functions over an existing vector database (like Chroma or pgvector) is easily built with an AI assistant.

Discussion

20 comments analyzed.

Competitors mentioned: Google Research's Titans+Atlas, Claude Code's auto-memory, LongMemEval dataset benchmarks, RAG systems

Concerns raised: Wall clock decay penalizes users taking vacations, Memory systems in general may not improve outcomes for software work, Risk of comingling unrelated projects without proper scoping, Markdown files bloat and require manual maintenance, Every product launching long-term memory systems lacks clean breakthrough

Feature requests: Spaced repetition algorithm (Anki-like) for keeping relevant memories fresher, Per-fact files with tiny always-loaded index for on-demand loading, Filter on what gets written to distinguish globally vs locally-relevant information, Multi-step task context injection without per-turn recall triggering

Competitors

Other products that read as similar to this one : 352 launches clear the similarity bar, closest 8 shown.

Attention rank: #44 of 353 (itself plus its competitors, highest first, normalized so YC and Product Hunt are compared fairly).

Launched 171 days after the earliest competitor.

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.