yantrikdb-mcp
Active·★ 25·MIT·Updated 2026-10-16
YantrikDB MCP Server gives any MCP-compatible agent persistent, structured, queryable memory across sessions, with semantic recall, a knowledge graph, contradiction detection and procedural learning. It works with Claude Code, Cursor, Windsurf and other clients.
#agent-memory#agent-skills#ai-agents#anthropic#claude-code#cognitive-memory#cursor#embeddings
01
Features
01Persistent semantic recall and a knowledge graph
02Temporal decay and contradiction detection
03Portable Agent Skills file included
02
Compatibility
Claude Code
Client
Verified via docs
Claude Desktop
Client
Verified via docs
Cursor
IDE / Editor
Verified via docs
Windsurf
IDE / Editor
Verified via docs
Python
Runtime
Verified via docs
Node.js
Runtime
Verified via docs
03
Quick start
1
$ pip install yantrikdb-mcp
04
Use cases
↳Keep an agent's knowledge consistent across sessions
↳Detect when new information contradicts what the agent remembers
05
Alternatives
yantrikdb-server★ 177
Cognitive memory database for AI agents — consolidates duplicates, detects contradictions, fades stale memories via temporal decay. Rust, AGPL, ships as library / MCP server / HTTP cluster.
wordcell★ 16
Wordcell keeps decisions, plans, and sources as Markdown beside your code, so coding agents can find them from the file they are about to change.
xerj★ 12.8k
Local-first search engine and MCP server for AI agents. One Rust binary indexes code, docs, logs, JSONL/CSV and PDFs for BM25 full-text, vector and hybrid search, code search without grep, agent memory and RAG. Elasticsearch-compatible API; Corpus Hub serves hundreds of reference memory corpora.
pmb★ 285
Local-first persistent memory for AI coding agents (Claude Code, Cursor, Codex) via MCP. 94.5% LoCoMo recall@10, 70ms p50, multilingual, zero API keys.
reposkein★ 12
Deterministic code-graph (GraphRAG) over your repo for LLM agents — local-first, git-native, zero-infra, served via MCP. Python, TS/JS, Rust, Go, Java, C#.
Comments
Log in to leave a comment
No comments yet. Be the first!