YantrikDB
⚠ Correction notice (2026-04-19): Phase 3 benchmark writeups committedearlier today (
docs/phase3a/,docs/phase3b/,docs/phase3c/,docs/phase3d/) used a Python simulator for the "structured memory"condition — NOT the actual yantrikdb engine. Rerun with real yantrikdbis indocs/phase3e/. Full audit trail inCORRECTIONS.md. Full corrected findings postcoming 2026-04-20.
A memory database that forgets, consolidates, and detects contradictions.
Vector databases store memories. They don't manage them. After 10,000 memories, recall quality degrades because there's no consolidation, no forgetting, no conflict resolution. Your AI agent just gets noisier.
YantrikDB is different. It's a cognitive memory engine — embed it, run it as a server, or connect via MCP. It thinks about what it stores.
Shortest path to try it: MCP setup for Claude Code / Cursor / Windsurf → (one pip install, one config block).
The bigger picture: YantrikDB is the memory layer being built on the road to YantrikOS — an AI-native operating system where agents are first-class primitives, not apps on top. Memory was the bottleneck, so we're shipping it first.
📄 New paper (May 2026): Skill as Memory, Not Document — measuring three failure modes when agent skill catalogs scale to 5,000 skills. Code + raw CSVs reproducible in
benchmarks/skill_recall/.

99.9% token savings vs file-based memory
| Memories | File-Based (CLAUDE.md) | YantrikDB | Token Savings | Recall Precision |
|---|---|---|---|---|
| 100 | 1,770 tokens | 69 tokens | 96% | 66% |
| 500 | 9,807 tokens | 72 tokens | 99.3% | 77% |
| 1,000 | 19,988 tokens | 72 tokens | 99.6% | 84% |
| 5,000 | 101,739 tokens | 53 tokens | 99.9% | 88% |
At 500 memories, file-based memory exceeds 32K context. At 5,000, it doesn't fit in any model — not even 200K. YantrikDB stays at ~70 tokens per query. Precision improves with more data — the opposite of context stuffing.
Reproduce: python benchmarks/bench_token_savings.py
Three things no other database does
1. It forgets
db.record("read the SLA doc by Friday", importance=0.4, half_life=86400) # 1 day
# 24 hours later, this memory's relevance score has decayed
# 7 days later, recall stops surfacing it unless explicitly queried
2. It consolidates
# 20 similar memories about the same meeting
for note in meeting_notes:
db.record(note, namespace="standup-2026-04-12")
db.think()
# → {"consolidation_count": 5} # collapsed 20 fragments into 5 canonical memories
3. It detects contradictions
db.record("CEO is Alice")
db.record("CEO is Bob") # added later in another conversation
db.think()
# → {"conflicts_found": 1, "conflicts": [{"memory_a": "CEO is Alice",
# "memory_b": "CEO is Bob",
# "type": "factual_contradiction"}]}
Plus: temporal decay with configurable half-life, entity graph with relationship edges, personality derivation from memory patterns, session-aware context surfacing, multi-signal scoring (recency × importance × similarity × graph proximity).
What makes this different
YantrikDB isn't just storage with operations. The engine has a layer that makes agents feel less reactive:
- Proactive triggers — the system surfaces what needs attention: pending conflicts, decaying important memories, approaching deadlines, patterns across domains. Agents don't have to ask what they should care about. The memory tells them.
- Derived personality — stable tendencies extracted from memory patterns over time. "This user prefers X, reacts to Y, values Z." Informs default agent behavior across sessions.
- Procedural memory — strategies that worked before get recorded and reinforced. Agents learn what to do, not just what they know.
- Temporal awareness —
stalesurfaces important memories that haven't been touched recently.upcomingsurfaces memories with approaching deadlines.
Full cognitive architecture lives in the standalone engine repo. This server repo focuses on deployment, HTTP API, and cluster operations.
Get started in 60 seconds — Claude Code / Cursor / Windsurf
The fastest adoption path. One pip install, one config block, and your agent gets persistent memory that auto-recalls on conversation start, auto-remembers decisions, and flags contradictions — without you prompting it.
pip install yantrikdb-mcp
Add this to your MCP client config — typically ~/.claude.json or .mcp.json in your project for Claude Code, and the equivalent mcp block in settings for Cursor/Windsurf (Claude Code · Cursor · Windsurf):
{
"mcpServers": {
"yantrikdb": {
"command": "yantrikdb-mcp"
}
}
}
That's it. No env vars. Uses a local SQLite memory file at ~/.yantrikdb/memory.db. First call auto-initializes the schema. Restart your client — the yantrikdb MCP server will show up with 15 memory tools (see below).
Want a shared memory across machines or teammates? Point at a YantrikDB cluster instead of local SQLite:
{
"mcpServers": {
"yantrikdb": {
"command": "yantrikdb-mcp",
"env": {
"YANTRIKDB_SERVER_URL": "http://node1:7438,http://node2:7438",
"YANTRIKDB_TOKEN": "ydb_your_database_token"
}
}
}
}
Want it over HTTP/SSE instead of stdio? (For IDE integrations that don't support stdio MCP servers.)
{
"mcpServers": {
"yantrikdb": {
"type": "sse",
"url": "http://your-server:8420/sse",
"headers": { "Authorization": "Bearer YOUR_API_KEY" }
}
}
}
Then start: yantrikdb-mcp --transport sse --port 8420.
The 15 MCP tools your agent gets
| Tools | |
|---|---|
| Core memory | remember · recall · forget · correct |
| Cognition | think (consolidate + conflict-detect) · memory · trigger (proactive insights) |
| Knowledge graph | graph (entities + relations) · category |
| Conflicts & corrections | conflict (list + resolve contradictions) |
| Time | session · temporal (stale/upcoming queries) |
| Behavior | procedure (strategies) · personality (derived traits) |
| Ops | stats (engine health + diagnostics) |
Full tool reference and agent-integration patterns: yantrikdb-mcp → · docs
Other ways to use it
As a network server (binary API + HA cluster)
docker run -p 7438:7438 ghcr.io/yantrikos/yantrikdb:latest
curl -X POST http://localhost:7438/v1/remember -d '{"text":"hello"}'
Single Rust binary. HTTP + binary wire protocol. 2-voter + 1-witness HA cluster via Docker Compose or Kubernetes. Per-tenant quotas, Prometheus metrics, AES-256-GCM at-rest encryption, runtime deadlock detection. See docker-compose.cluster.yml and k8s manifests.
As an embedded library (Python or Rust)
pip install yantrikdb
# or
cargo add yantrikdb
import yantrikdb
db = yantrikdb.YantrikDB("memory.db", embedding_dim=384)
db.set_embedder(SentenceTransformer("all-MiniLM-L6-v2"))
db.record("Alice leads engineering", importance=0.8)
db.recall("who leads the team?", top_k=3)
db.think() # consolidate, detect conflicts, derive personality
Performance
Live numbers from a 2-core LXC cluster with 1689 memories:
| Operation | Latency |
|---|---|
| Recall p50 | 112ms (most is query embedding ~100ms) |
| Recall p99 | 190ms |
| Batch write | 76 writes/sec |
| Engine lock acquire | <0.1ms |
| Deep health probe | <1ms |
For pre-computed embeddings (skip query-time embedding), recall p50 drops to ~5ms.
Status
v0.5.13 — hardened alpha + RFC 006 Phase 0 observability telemetry shipped. The embeddable engine has been used in production by the YantrikOS ecosystem since early 2026. The network server runs live on a 3-node Proxmox cluster with multiple tenants.
A 42-task hardening sprint just completed across 8 epics:
parking_lotmutexes everywhere with runtime deadlock detection (caught a self-deadlock that would have taken hours to find with std::sync)- Per-handler Prometheus metrics, structured JSON logging, deep health checks
- Chaos-tested failover (leader kill, network partition, kill-9 mid-write)
- Per-tenant quotas, load shedding, control plane replication
- 1178 core tests + chaos harness + cargo-fuzz + CRDT property tests
- 5 operational runbooks, watchdog with auto-restart
Read the maturity notes: https://yantrikdb.com/server/quickstart/#maturity
The Problem
Current AI memory is:
Store everything → Embed → Retrieve top-k → Inject into context → Hope it helps.
That's not memory. That's a search engine with extra steps.
Real memory is hierarchical, compressed, contextual, self-updating, emotionally weighted, time-aware, and predictive. YantrikDB is built for that.
Why Not Existing Solutions?
| Solution | What it does | What it lacks |
|---|---|---|
| Vector DBs (Pinecone, Weaviate) | Nearest-neighbor lookup | No decay, no causality, no self-organization |
| Knowledge Graphs (Neo4j) | Structured relations | Poor for fuzzy memory, not adaptive |
| Memory Frameworks (LangChain, Mem0) | Retrieval wrappers | Not a memory architecture — just middleware |
| File-based (CLAUDE.md, memory files) | Dump everything into context | O(n) token cost, no relevance filtering |
Benchmark: Selective Recall vs. File-Based Memory
| Memories | File-Based | YantrikDB | Token Savings | Precision |
|---|---|---|---|---|
| 100 | 1,770 tokens | 69 tokens | 96% | 66% |
| 500 | 9,807 tokens | 72 tokens | 99.3% | 77% |
| 1,000 | 19,988 tokens | 72 tokens | 99.6% | 84% |
| 5,000 | 101,739 tokens | 53 tokens | 99.9% | 88% |
At 500 memories, file-based exceeds 32K context windows. At 5,000, it doesn't fit in any context window — not even 200K. YantrikDB stays at ~70 tokens per query. Precision improves with more data — the opposite of context stuffing.
Architecture
Design Principles
- Embedded, not client-server — single file, no server process (like SQLite)
- Local-first, sync-native — works offline, syncs when connected
- Cognitive operations, not SQL —
record(),recall(),relate(), notSELECT - Living system, not passive store — does work between conversations
- Thread-safe —
Send + Syncwith internal Mutex/RwLock, safe for concurrent access
Five Indexes, One Engine
┌──────────────────────────────────────────────────────┐
│ YantrikDB Engine │
│ │
│ ┌──────────┬──────────┬──────────┬──────────┐ │
│ │ Vector │ Graph │ Temporal │ Decay │ │
│ │ (HNSW) │(Entities)│ (Events) │ (Heap) │ │
│ └──────────┴──────────┴──────────┴──────────┘ │
│ ┌──────────┐ │
│ │ Key-Value│ WAL + Replication Log (CRDT) │
│ └──────────┘ │
└──────────────────────────────────────────────────────┘
- Vector Index (HNSW) — semantic similarity search across memories
- Graph Index — entity relationships, profile aggregation, bridge detection
- Temporal Index — time-aware queries ("what happened Tuesday", "upcoming deadlines")
- Decay Heap — importance scores that degrade over time, like human memory
- Key-Value Store — fast facts, session state, scoring weights
Memory Types (Tulving's Taxonomy)
| Type | What it stores | Example |
|---|---|---|
| Semantic | Facts, knowledge | "User is a software engineer at Meta" |
| Episodic | Events with context | "Had a rough day at work on Feb 20" |
| Procedural | Strategies, what worked | "Deploy with blue-green, not rolling update" |
All memories carry importance, valence (emotional tone), domain, source, certainty, and timestamps — used in a multi-signal scoring function that goes far beyond cosine similarity.
Key Capabilities
Relevance-Conditioned Scoring
Not just vector similarity. Every recall combines:
- Semantic similarity (HNSW) — what's topically related
- Temporal decay — recent memories score higher
- Importance weighting — critical decisions beat trivia
- Graph proximity — entity relationships boost connected memories
- Retrieval feedback — learns from past recall quality
Weights are tuned automatically from usage patterns.
Conflict Detection & Resolution
When memories contradict, YantrikDB doesn't guess — it creates a conflict segment:
"works at Google" (recorded Jan 15) vs. "works at Meta" (recorded Mar 1)
→ Conflict: identity_fact, priority: high, strategy: ask_user
Resolution is conversational: the AI asks naturally, not programmatically.
Semantic Consolidation
After many conversations, memories pile up. think() runs:
- Consolidation — merge similar memories, extract patterns
- Conflict scan — find contradictions across the knowledge base
- Pattern mining — cross-domain discovery ("work stress correlates with health entries")
- Trigger evaluation — proactive insights worth surfacing
Proactive Triggers
The engine generates triggers when it detects something worth reaching out about:
- Memory conflicts needing resolution
- Approaching deadlines (temporal awareness)
- Patterns detected across domains
- High-importance memories about to decay
- Goal tracking ("how's the marathon training?")
Every trigger is grounded in real memory data — not engagement farming.
Multi-Device Sync (CRDT)
Local-first with append-only replication log:
- CRDT merging — graph edges, memories, and metadata merge without conflicts
- Vector indexes rebuild locally — raw memories sync, each device rebuilds HNSW
- Forget propagation — tombstones ensure forgotten memories stay forgotten
- Conflict detection — contradictions across devices are flagged for resolution
Sessions & Temporal Awareness
sid = db.session_start("default", "claude-code")
db.record("decided to use PostgreSQL") # auto-linked to session
db.record("Alice suggested Redis for caching")
db.session_end(sid)
# → computes: memory_count, avg_valence, topics, duration
db.stale(days=14) # high-importance memories not accessed recently
db.upcoming(days=7) # memories with approaching deadlines
Full API
| Operation | Methods |
|---|---|
| Core | record, record_batch, recall, recall_with_response, recall_refine, forget, correct |
| Knowledge Graph | relate, get_edges, search_entities, entity_profile, relationship_depth, link_memory_entity |
| Cognition | think, get_patterns, scan_conflicts, resolve_conflict, derive_personality |
| Triggers | get_pending_triggers, acknowledge_trigger, deliver_trigger, act_on_trigger, dismiss_trigger |
| Sessions | session_start, session_end, session_history, active_session, session_abandon_stale |
| Temporal | stale, upcoming |
| Procedural | record_procedural, surface_procedural, reinforce_procedural |
| Lifecycle | archive, hydrate, decay, evict, list_memories, stats |
| Sync | extract_ops_since, apply_ops, get_peer_watermark, set_peer_watermark |
| Maintenance | rebuild_vec_index, rebuild_graph_index, learned_weights |
Technical Decisions
| Decision | Choice | Rationale |
|---|---|---|
| Core language | Rust | Memory safety, no GC, ideal for embedded engines |
| Architecture | Embedded (like SQLite) | No server overhead, sub-ms reads, single-tenant |
| Bindings | Python (PyO3), TypeScript | Agent/AI layer integration |
| Storage | Single file per user | Portable, backupable, no infrastructure |
| Sync | CRDTs + append-only log | Conflict-free for most operations, deterministic |
| Thread safety | Mutex/RwLock, Send+Sync | Safe concurrent access from multiple threads |
| Query interface | Cognitive operations API | Not SQL — designed for how agents think |
Ecosystem
| Package | What | Install | Source |
|---|---|---|---|
| yantrikdb-mcp | MCP server for Claude Code / Cursor / Windsurf — start here | pip install yantrikdb-mcp |
GitHub · PyPI |
| yantrikdb-client | Python client SDK for the HTTP server (typed memory, reflect, character primitives) | pip install yantrikdb-client |
GitHub · PyPI |
| yantrikdb-server | HTTP + wire-protocol server, HA cluster | docker run ghcr.io/yantrikos/yantrikdb |
GitHub |
| yantrikdb (Rust) | Embedded Rust engine | cargo add yantrikdb |
GitHub |
| yantrikdb (Python) | Python bindings via PyO3 | pip install yantrikdb |
GitHub |
Roadmap
- V0 — Embedded engine, core memory model (record, recall, relate, consolidate, decay)
- V1 — Replication log, CRDT-based sync between devices
- V2 — Conflict resolution with human-in-the-loop
- V3 — Proactive cognition loop, pattern detection, trigger system
- V4 — Sessions, temporal awareness, cross-domain pattern mining, entity profiles
- V5 — Multi-agent shared memory, federated learning across users
Research & Publications
📄 Skill as Memory, Not Document (May 2026)

A measurement paper on what happens when LLM agent skill catalogs scale. On a 5,000-skill corpus:
- Token cost: full-catalog disclosure consumes 919,200 tokens (exceeds Claude 3.7's 200K window). YantrikDB's indexed top-K disclosure: 369 tokens, constant in catalog size. The honest ratio against an indexed filesystem baseline is 1.49× — an ablation pinpoints the entire gap as YAML frontmatter overhead.
- Latency: p50 = 87.3 ms, p95 = 106.3 ms at 5,000-skill scale, single-node.
- Invalid-skill admission: YantrikDB rejects 70/70 adversarially-malformed skills (0%) at write time; a document-only baseline admits 68/70 (97%).
Three failure modes for filesystem-shaped skill catalogs (token burn, slowdown, invalid-skill admission). One unifying framing: skill catalogs for autonomous learning aren't documents; they're memory.
Code + scripts + raw CSVs are reproducible at benchmarks/skill_recall/. Full deposit (PDF + source + data + scripts) on Zenodo. Companion blog post: yantrikdb.com/papers/skill-substrate.
Earlier work
- U.S. Patent Application 19/573,392 (March 2026): "Cognitive Memory Database System with Relevance-Conditioned Scoring and Autonomous Knowledge Management"
- Zenodo (software): YantrikDB: A Cognitive Memory Engine for Persistent AI Systems
Author
Pranab Sarkar — ORCID · LinkedIn · [email protected]
License
AGPL-3.0. See LICENSE for the full text.
The MCP server is MIT-licensed — using the engine via the MCP server does not trigger AGPL obligations on your code.