"memory" matching MCP servers:

A local MCP server that gives AI assistants persistent long-term memory using a biological neural architecture with cortex, synapses, and hippocampus.

MCP server for managing project memory in AGENTS.md. Allows agents to record and remove durable facts using save/forget tools.

Hand a project over — to your next session, to Cursor/Codex/Gemini, to your successor — with the reasons attached. Local-first memory MCP for coding agents: decisions re-injected before the agent acts, drift detection across every project you run. One SQLite file, nothing leaves your machine.

Embedded, local-first agent memory: facts extracted into a per-namespace SQLite file (vec0 + FTS5) with hybrid retrieval and point-in-time (time-travel) queries. ADD-only history over stdio — no server process, no cloud dependency.

MCP server providing persistent memory for AI applications, enabling Claude to store and recall memories with hybrid search and knowledge graph.

Persistent long-term memory for AI agents — semantic recall across Claude, Cursor, ChatGPT & MCP.

Multi-user, file-backed MCP memory server enabling isolated namespaces and persistent memory across sessions and AI clients.

Local, searchable project memory for AI coding agents. Markdown source of truth, MCP interface, safe structured updates

Exposes tools that let an agent search a local Markdown-based memory store, fetch full cards by id, write new knowledge cards that are indexed immediately, and inspect or rebuild the SQLite index. All retrieval runs locally over Chinese-friendly full-text search with graded exact/prefix matching, so agents without a memory system can recall prior notes while existing Markdown files stay read-only.

Provides persistent memory for AI agents using hybrid search (vector embeddings + BM25) with neural reranking, enabling storage and retrieval of insights, debugging solutions, and patterns across coding sessions.

Smart memory for AI agents. Solves the Karpathy problem: memories decay, topics are frequency-weighted, one-time questions don't become obsessions. 7 tools. Zero deps.

MCP server that exposes agent-memory-daemon to any MCP-compatible client — Kiro (CLI & IDE), Claude Desktop, Cursor, and others. The daemon does the thinking (consolidation + extraction); this server is a thin filesystem bridge so agents can read, append, and search memory through the Model Context Protocol.

Provides AI agents with persistent, searchable memory using semantic search, auto-linking, and categorization, with zero-config local setup or production-ready external providers.

A different approach from typical persistent-memory MCPs. Instead of a local SQLite + embeddings store, the memory lives as plain files in a .ai-memory/ directory you commit to your repo (facts.jsonl, decisions/\*.md, gotchas.md). Git is the sync layer — what one Claude/Cursor/Cline learns about a repo, the next session (or a teammate's agent) picks up automatically. 5 MCP tools: get_rep

Persistent knowledge graph MCP server with SQLite backend, offering graph traversal, fuzzy search, and temporal queries for entities and relations. It serves as a drop-in replacement for the npm mcp-server-memory with enhanced capabilities.

Enables coding agents to query and modify a SQLite database through twelve SQL-based tools, with safety enforced server-side via statement policies, protected tables, result caps, and snapshots. It also provides an append-only, hash-chained memory log with checkpoints so agents can record events and resume context across sessions.

Cross-project memory sharing for Claude Code and Cowork. Stop teaching Claude the same thing twice.

A zero-dependency, file-based persistent memory system for AI agents with tiered memory, Ebbinghaus decay, and keyword retrieval.

An MCP server providing long-term memory for LLMs via hybrid search (FTS5 + vector) stored in SQLite, with time-decay scoring and support for multiple AI assistants.

Enables AI agents to maintain long-term, cross-session memory by extracting facts, reconciling state conflicts, and retrieving relevant memories via vector search.