Alternatives
Products that do what Shinobi does
Local-first memory layer for AI coding agents
- 1
- 2
- 3
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
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
Open-source MCP server. #5 on LoCoMo. 100% local. MIT.
May 2026 · totalmemory.dev
- 13
- 14RG
Hey HN! I'm José, and I built Recall to solve a problem that was driving me crazy. The Problem: I use Claude for coding daily, but every conversation starts from scratch. I'd explain my architecture, coding standards, past decisions... then hit the context limit and lose everything. Next session? Start over. The Solution: Recall is an MCP (Model Context Protocol) server that gives Claude persistent memory using Redis + semantic search. Think of it as long-term memory that survives context limits and session restarts. How it works: - Claude stores important context as "memories" during…
Oct 2025 · npmjs.com
- 15
- 16
- 17
- 18BA
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
- 19ML
Jun 2026 · github.com
- 20
- 21
- 22SM
Apr 2026 · github.com
- 23PL
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
- 24
Ranked by how close each launch is in meaning, then by votes. Refine with a description →