Alternatives
Products that do what null-drift does
Local AI memory without the VectorDB bloat
- 1LA
I built LocalGPT over 4 nights as a Rust reimagining of the OpenClaw assistant pattern (markdown-based persistent memory, autonomous heartbeat tasks, skills system). It compiles to a single ~27MB binary — no Node.js, Docker, or Python required. Key features: - Persistent memory via markdown files (MEMORY, HEARTBEAT, SOUL markdown files) — compatible with OpenClaw's format - Full-text search (SQLite FTS5) + semantic search (local embeddings, no API key needed) - Autonomous heartbeat runner that checks tasks on a configurable interval - CLI + web interface + desktop GUI - Multi-provider:…
Feb 2026 · github.com
- 2
- 3
- 4
- 5
- 6AM
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
- 7AM
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
- 8
- 9AL
Dec 2025 · github.com
- 10
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
- 11
Local, gradient-free neuro-symbolic memory engine combining Hyperdimensional Computing (HDC/VSA), Hebbian plasticity, and graph triples for offline AI. - roandejager/Hillock
7d ago · github.com
- 12RB
We built HALO (Hierarchal Agent Loop Optimizer), an open-source tool for debugging and optimizing AI agents using their execution traces. It’s a loop. Run your agent, feed the traces to HALO, get the report, apply the fixes, then re-run your agent. HALO takes in OTEL compliant traces from AI agents using tracing frameworks such as Langfuse, Arize/OpenInference, or even just plain JSONL. It uses an RLM (Recursive Language Model) to more efficiently break trace analysis into smaller subproblems in order to find recurring patterns across large amounts of data and fix systemic issues that…
Jun 2026 · github.com
- 13
Gomaa — Autonomous Agent Memory OS. Persistent memory system for AI agents with Obsidian vault integration, hybrid RRF search, knowledge graphs, security gates, and MCP server. - M4F-S/gomaa
14d ago · github.com
- 14MD
Hi HN, I’m releasing minikv, a distributed key-value and object store in Rust. What is minikv? minikv is an open-source, distributed storage engine built for learning, experimentation, and self-hosted setups. It combines a strongly-consistent key-value database (Raft), S3-compatible object storage, and basic multi-tenancy. I started minikv as a learning project about distributed systems, and it grew into something production-ready and fun to extend. Features/highlights: - Raft consensus with automatic failover and sharding - S3-compatible HTTP API (plus REST/gRPC APIs) - Pluggable…
Jan 2026 · github.com
- 15CW
Jul 2026 · github.com
- 16DA
Sep 2025 · github.com
- 17SA
SlateDB is an embedded storage engine built as a log-structured merge-tree. Unlike traditional LSM-tree storage engines, SlateDB writes data to object storage (S3, GCS, ABS, MinIO, Tigris, and so on). Leveraging object storage allows SlateDB to provide bottomless storage capacity, high durability, and easy replication. The trade-off is that object storage has a higher latency and higher API cost than local disk. To mitigate high write API costs (PUTs), SlateDB batches writes. Rather than writing every put() call to object storage, MemTables are flushed periodically to object storage as a…
2024 · github.com
- 18
- 19BA
Tired of AI coding tools that forget everything between sessions? Every time I open a new chat with Claude or fire up Copilot, I'm back to square one explaining my codebase structure. So I built something to fix this. It's called In Memoria. Its an MCP server that gives AI tools persistent memory. Instead of starting fresh every conversation, the AI remembers your coding patterns, architectural decisions, and all the context you've built up. The setup is dead simple: `npx in-memoria server` then connect your AI tool. No accounts, no data leaves your machine. Under the hood it's TypeScript +…
2025 · github.com
- 20TI
I'm an "ideas person" who messes around with AI on a low budget. I got tired of watching my tokens vanish and context windows filling up while agents fumbled around trying to find the right thing. Agents don't flail like they used to with shell tools, but there are still weak/blind spots and back-and-forth episodes — especially when using tools in combination/sequence. So I built "tilth" today. Or rather, AI built it — every line is Opus 4.6. I spent a lot of my precious tokens getting it to "not shit" (at least several of the different vendors' AI overlords assure me it's not…
Feb 2026 · github.com
- 21
- 22
- 23SM
Apr 2026 · github.com
- 24
Ranked by how close each launch is in meaning, then by votes. Refine with a description →