YantrikDB — A Cognitive Memory Engine for Persistent AI Systems

The memory engine for AI that actually knows you.

Get Started in 60 Seconds

For AI agents (MCP — works with Claude, Cursor, Windsurf, Copilot)

pip install yantrikdb-mcp

Add to your MCP client config:

{
  "mcpServers": {
    "yantrikdb": {
      "command": "yantrikdb-mcp"
    }
  }
}

That's it. The agent auto-recalls context, auto-remembers decisions, and auto-detects contradictions — no prompting needed. See yantrikdb-mcp for full docs.

As a Python library

pip install yantrikdb

The engine ships a default embedder (potion-base-2M, ~7 MB, distilled from BGE-base-en-v1.5) — record_text() / recall_text() work out of the box. No sentence-transformers install. No first-run model download. No ONNX runtime. Just one pip install.

import yantrikdb

# Default: bundled embedder, dim=64. Just works.
db = yantrikdb.YantrikDB.with_default("memory.db")

db.record("Alice is the engineering lead", importance=0.8, domain="people")
db.record("Project deadline is March 30", importance=0.9, domain="work")
db.record("User prefers dark mode", importance=0.6, domain="preference")

results = db.recall("who leads the team?", top_k=3)
# → [{"text": "Alice is the engineering lead", "score": 1.0}, ...]

db.relate("Alice", "Engineering", "leads")
db.get_edges("Alice")

db.think()  # consolidate, detect conflicts, mine patterns

db.close()

Want higher-quality embeddings?

Three opt-in upgrade paths, in increasing weight:

# 1. Larger bundled variant — downloads on first call, caches under
#    your user data dir. Self-hosted from yantrikos/yantrikdb-models;
#    no HuggingFace dependency, no rate limits.
db = yantrikdb.YantrikDB("memory.db", embedding_dim=256)
db.set_embedder_named("potion-base-8M")   # ~28 MB, ~92% MiniLM
# or:  db.set_embedder_named("potion-base-32M")  # ~121 MB, ~95% MiniLM

# 2. Bring your own embedder (sentence-transformers, fastembed, custom).
from sentence_transformers import SentenceTransformer
db = yantrikdb.YantrikDB("memory.db", embedding_dim=384)
db.set_embedder(SentenceTransformer("all-MiniLM-L6-v2"))

# 3. Slim build (no bundled embedder, must set_embedder yourself).
#    For deployments where the ~7 MB bundle is intolerable.
#    Rust:  yantrikdb = { version = "0.7", default-features = false }

Path	Quality vs MiniLM	Size on disk	Install network
Bundled default (`with_default`)	~89%	~7 MB (bundled)	none
`set_embedder_named("potion-base-8M")`	~92%	~28 MB (cached)	first call only
`set_embedder_named("potion-base-32M")`	~95%	~121 MB (cached)	first call only
`set_embedder(MiniLM)`	100% (baseline)	~80 MB	sentence-transformers' own download

As a Rust crate

[dependencies]
yantrikdb = "0.7"

# Want set_embedder_named() for runtime model upgrades?
# yantrikdb = { version = "0.7", features = ["embedder-download"] }

# Slim build (no bundled embedder, no network code path):
# yantrikdb = { version = "0.7", default-features = false }

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.

Evidence (reproducible)

Every claim here points at a runnable harness — not a static number. Each is gated in CI (.github/workflows/benchmark.yml) so a regression fails the build.

Recall doesn't degrade as the corpus grows, and stays fast. python -m yantrikdb.eval.benchmark holds a fixed signal corpus while adding distractors and measures recall + latency at each scale. Sample run: recall@k 0.938 → 0.929 as memories grow 7×, with p95 recall latency under 3 ms. regression_check() is the CI gate.
The knowledge graph earns its keep on connected data. python -m yantrikdb.eval.graph_lift measures recall with entity-expansion ON vs OFF. Verdict on the connected corpus: +2.5% recall, +1.7% MRR — graph expansion helps where memories are actually linked.
Apples-to-apples vs other memory systems. python -m yantrikdb.eval.competitors scores YantrikDB, mem0, Zep, and Letta on the same corpus, same queries, same metrics, no per-system tuning. (Competitors run once their libraries are installed; results are not pre-tuned.)

These run dependency-free on the bundled embedder, so anyone can reproduce them with one command.

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(), not SELECT
Living system, not passive store — does work between conversations
Thread-safe — Send + Sync with 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

Decoupled Write Path (v0.6.6+)

The vector index is structured as a two-tier LSM: a small mutable delta and an immutable HNSW cold tier swapped atomically via ArcSwap. Foreground writes only touch the delta (brief lock, O(1) push); HNSW work amortizes on a dedicated compactor thread. This is what eliminated the production wedge where sustained writes starved readers — see CONCURRENCY.md and docs/decoupled_write_path_rfc.md.

flowchart LR
    subgraph CLIENT["Caller"]
        C1["record / record_with_rid"]
        C2["recall / recall_with_seq"]
    end

    subgraph FG["Foreground — P1, brief locks only"]
        F1["assign_seq<br/>vec_seq.fetch_add<br/>(or fetch_max for cluster seq)"]
        F2["DeltaIndex.append<br/>brief RwLock&lt;Vec&gt; push"]
        F3["bump_visible_seq<br/>DashMap + AtomicU64<br/>(lock-free)"]
        F4["log_op → SQLite WAL"]
    end

    subgraph IDX["DeltaIndex (per engine)"]
        D1[("delta<br/>RwLock&lt;Vec&lt;DeltaEntry&gt;&gt;<br/>cap = delta_max (256)")]
        D2[("cold<br/>ArcSwap&lt;HnswIndex&gt;<br/>lock-free read")]
    end

    subgraph BG["Background — P3, dedicated threads"]
        B1["Compactor (1s tick)<br/>fires when delta past half-cap<br/>OR oldest entry > max_dirty_age"]
        B2["Materializer pool<br/>N = cores / 2<br/>drains pending oplog ops"]
    end

    subgraph STORE["SQLite (WAL mode, single file)"]
        S1["memories"]
        S2["oplog"]
        S3["entity_edges, sessions, ..."]
    end

    C1 --> F1
    F1 --> F2
    F2 --> D1
    F1 --> F3
    F1 --> F4
    F4 --> S2

    C2 -.->|"optional<br/>wait_for_visible_seq"| F3
    C2 --> D1
    C2 --> D2

    B1 -->|"seal + clone + ArcSwap.store"| D1
    B1 --> D2
    B2 --> S2
    B2 --> S1
    B2 --> S3

The structural invariant. Foreground (P1) and background (P3) do not share a lock primitive that holds for non-O(1) work. The cold tier is read lock-free via ArcSwap; the delta's RwLock is held for the O(1) push only. This is what makes "no single background task can wedge reads, writes, or recovery" enforceable — see CONCURRENCY.md Rules 2 and 3 for the names and failure modes if violated.

Cluster Mode (RFC 010 + Phase 6 RYW)

For multi-node deployments, yantrikdb-server wraps the engine with openraft for leader-elected replication. The four cluster-mutation primitives take the openraft commit-log index as their seq, so all nodes agree on a single global monotonic sequence — read-your-writes works across the cluster, not just within a node.

flowchart LR
    L["Leader<br/>HTTP request"]
    LR["Leader engine<br/>record_with_rid(seq=Some(log_idx))"]
    OR["openraft<br/>commit log"]
    F1["Follower 1 applier<br/>record_with_rid(seq=Some(log_idx))"]
    F2["Follower 2 applier<br/>record_with_rid(seq=Some(log_idx))"]
    R["Reader on any node<br/>recall_with_seq(min_seq=log_idx)"]

    L --> LR
    LR --> OR
    OR -->|replicate + apply| F1
    OR -->|replicate + apply| F2
    F1 -.->|"visible_seq[ns] reaches log_idx"| R
    F2 -.->|"visible_seq[ns] reaches log_idx"| R
    LR -.->|"visible_seq[ns] reaches log_idx"| R

Each record_with_rid / tombstone_with_rid / upsert_entity_edge_with_id / delete_entity_edge_with_id accepts an optional seq: Option<u64>. Single-node callers pass None and the engine allocates; cluster appliers pass Some(commit_log_index) and the engine ratchets vec_seq up to at least that value via fetch_max. After apply, visible_seq[namespace] reaches the log index, so any subsequent recall_with_seq(min_seq=N) blocks just long enough for the local node to have applied through index N — and no longer.

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
yantrikdb	Rust engine	`cargo add yantrikdb`
yantrikdb	Python bindings (PyO3)	`pip install yantrikdb`
yantrikdb-mcp	MCP server for AI agents	`pip install yantrikdb-mcp`

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

Worked example: Wirecard (RFC 008 substrate — with honest limits)

For nearly a decade, Wirecard's filings and EY's audit attested to €1.9B in Philippine escrow accounts. In June 2020 both banks and the central bank formally denied the accounts existed.

When the source_lineage fields are hand-populated — EY as [wirecard, ey] to capture audit dependence on Wirecard-provided documents, BSP as [bsp, bpi, bdo] to capture restatement of the commercial banks — RFC 008's ⊕ discounts the dependent claims, and the contest operator's temporal split distinguishes present-tense contradictions from historical state changes. On this hand-populated data, the substrate produces useful annotations.

Honest limits (surfaced by Phase 2 empirical testing, Apr 2026):

On naturalistic evidence where a real agent populates the fields, the substrate's gates don't reliably fire. Cases B and C of the Phase 2 eval need an extractor/canonicalizer (not yet built) to work; Case A exposed that ⊕ is mathematically incapable of flipping decisions at realistic N, regardless of coefficient tuning.
Current claim: structured schema for evidence provenance/temporal/conflict annotation, useful for audit and inspection. The dependence-discount operator works on curated inputs but needs replacement before it can drive decisions.
Not a current claim: "decision-improvement substrate for AGI-capable agents." That framing is withdrawn pending RFC 009.

See docs/showcase/wirecard.md for the full walkthrough including the Phase 2 negative result and the gold-state ablation that partitioned operator failure from extraction failure. Run the hand-populated demonstration directly:

cargo run --example showcase_wirecard

Research & Publications

📄 Skill as Memory, Not Document (May 2026)

Sarkar, P. (2026). Skill as Memory, Not Document: A Database-Native Substrate for Agent Skill Catalogs. Zenodo.

A measurement paper at 5K-skill scale: token cost vs filesystem catalogs (with the honest 1.49× ablation), retrieval latency (87.3 ms p50), and invalid-skill admission (0% YantrikDB vs 97% document-only baseline). Reproducible scripts + raw CSVs at yantrikdb-server/benchmarks/skill_recall/. Companion blog: 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 · developer@pranab.co.in

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.

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

yantrikdb-0.11.0.tar.gz (8.7 MB view details)

Uploaded Jul 29, 2026 Source

Built Distributions

If you're not sure about the file name format, learn more about wheel file names.

The dropdown lists show the available interpreters, ABIs, and platforms. Enable javascript to be able to filter the list of wheel files.

yantrikdb-0.11.0-cp314-cp314-win_amd64.whl (20.1 MB view details)

Uploaded Jul 29, 2026 CPython 3.14Windows x86-64

yantrikdb-0.11.0-cp314-cp314-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (21.2 MB view details)

Uploaded Jul 29, 2026 CPython 3.14manylinux: glibc 2.17+ x86-64

yantrikdb-0.11.0-cp314-cp314-manylinux_2_17_aarch64.manylinux2014_aarch64.whl (21.0 MB view details)

Uploaded Jul 29, 2026 CPython 3.14manylinux: glibc 2.17+ ARM64

yantrikdb-0.11.0-cp314-cp314-macosx_11_0_arm64.whl (13.3 MB view details)

Uploaded Jul 29, 2026 CPython 3.14macOS 11.0+ ARM64

yantrikdb-0.11.0-cp314-cp314-macosx_10_12_x86_64.whl (20.8 MB view details)

Uploaded Jul 29, 2026 CPython 3.14macOS 10.12+ x86-64

yantrikdb-0.11.0-cp313-cp313-win_amd64.whl (20.1 MB view details)

Uploaded Jul 29, 2026 CPython 3.13Windows x86-64

yantrikdb-0.11.0-cp313-cp313-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (21.2 MB view details)

Uploaded Jul 29, 2026 CPython 3.13manylinux: glibc 2.17+ x86-64

yantrikdb-0.11.0-cp313-cp313-manylinux_2_17_aarch64.manylinux2014_aarch64.whl (21.0 MB view details)

Uploaded Jul 29, 2026 CPython 3.13manylinux: glibc 2.17+ ARM64

yantrikdb-0.11.0-cp313-cp313-macosx_11_0_arm64.whl (13.3 MB view details)

Uploaded Jul 29, 2026 CPython 3.13macOS 11.0+ ARM64

yantrikdb-0.11.0-cp313-cp313-macosx_10_12_x86_64.whl (20.8 MB view details)

Uploaded Jul 29, 2026 CPython 3.13macOS 10.12+ x86-64

yantrikdb-0.11.0-cp312-cp312-win_amd64.whl (20.1 MB view details)

Uploaded Jul 29, 2026 CPython 3.12Windows x86-64

yantrikdb-0.11.0-cp312-cp312-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (21.2 MB view details)

Uploaded Jul 29, 2026 CPython 3.12manylinux: glibc 2.17+ x86-64

yantrikdb-0.11.0-cp312-cp312-manylinux_2_17_aarch64.manylinux2014_aarch64.whl (21.0 MB view details)

Uploaded Jul 29, 2026 CPython 3.12manylinux: glibc 2.17+ ARM64

yantrikdb-0.11.0-cp312-cp312-macosx_11_0_arm64.whl (13.3 MB view details)

Uploaded Jul 29, 2026 CPython 3.12macOS 11.0+ ARM64

yantrikdb-0.11.0-cp312-cp312-macosx_10_12_x86_64.whl (20.8 MB view details)

Uploaded Jul 29, 2026 CPython 3.12macOS 10.12+ x86-64

yantrikdb-0.11.0-cp311-cp311-win_amd64.whl (20.1 MB view details)

Uploaded Jul 29, 2026 CPython 3.11Windows x86-64

yantrikdb-0.11.0-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (21.2 MB view details)

Uploaded Jul 29, 2026 CPython 3.11manylinux: glibc 2.17+ x86-64

yantrikdb-0.11.0-cp311-cp311-manylinux_2_17_aarch64.manylinux2014_aarch64.whl (21.0 MB view details)

Uploaded Jul 29, 2026 CPython 3.11manylinux: glibc 2.17+ ARM64

yantrikdb-0.11.0-cp311-cp311-macosx_11_0_arm64.whl (13.3 MB view details)

Uploaded Jul 29, 2026 CPython 3.11macOS 11.0+ ARM64

yantrikdb-0.11.0-cp311-cp311-macosx_10_12_x86_64.whl (20.8 MB view details)

Uploaded Jul 29, 2026 CPython 3.11macOS 10.12+ x86-64

yantrikdb-0.11.0-cp310-cp310-win_amd64.whl (20.1 MB view details)

Uploaded Jul 29, 2026 CPython 3.10Windows x86-64

yantrikdb-0.11.0-cp310-cp310-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (21.2 MB view details)

Uploaded Jul 29, 2026 CPython 3.10manylinux: glibc 2.17+ x86-64

yantrikdb-0.11.0-cp310-cp310-manylinux_2_17_aarch64.manylinux2014_aarch64.whl (21.0 MB view details)

Uploaded Jul 29, 2026 CPython 3.10manylinux: glibc 2.17+ ARM64

yantrikdb-0.11.0-cp310-cp310-macosx_11_0_arm64.whl (13.3 MB view details)

Uploaded Jul 29, 2026 CPython 3.10macOS 11.0+ ARM64

yantrikdb-0.11.0-cp310-cp310-macosx_10_12_x86_64.whl (20.8 MB view details)

Uploaded Jul 29, 2026 CPython 3.10macOS 10.12+ x86-64

File details

Details for the file yantrikdb-0.11.0.tar.gz.

File metadata

Download URL: yantrikdb-0.11.0.tar.gz
Upload date: Jul 29, 2026
Size: 8.7 MB
Tags: Source
Uploaded using Trusted Publishing? Yes
Uploaded via: twine/6.1.0 CPython/3.13.14

File hashes

Hashes for yantrikdb-0.11.0.tar.gz
Algorithm	Hash digest
SHA256	`cb13caf5186f3a2aea9d3a5fbb01571175fe97cea95f04bf30369743a8b40e51`
MD5	`a0c2b4ff7af3a6531e7ea21a26e1d61a`
BLAKE2b-256	`69987b0c2b8b76cdf58f270463eec7ce57b1f9ae34313ea032adb6de3c85daa0`

Algorithm	Hash digest
SHA256	`c1856a42e4394374252b2e59180f0659e3cf850c0823e14af0eef3df38bc4339`
MD5	`6063ebbf193b7f95b246febfe76385d1`
BLAKE2b-256	`11b31f49e3da41682e2bc2e64c826ed7f93a2c8f0bc2a8b6a2ce5980ef327e77`

Algorithm	Hash digest
SHA256	`df3c7a4b33ea7d62bc50aa1cab89b3d415ef7642a50d22739d90d68d49e26790`
MD5	`acdeb5633372d594eb162c27572071b8`
BLAKE2b-256	`458adcf2fe5c80ecc18b3e22b9a338fac860519f24c4fe3e9c23ee303261afbc`

Algorithm	Hash digest
SHA256	`d966d5cd477583973eceb3d04a0a93835f5fd5e377464f57a2756a28ce5d716d`
MD5	`ae8a4922c7ec560d5240963383d9617f`
BLAKE2b-256	`39a61395a48d108ecfdc59f026ea33a28b91f86a13f41d6d6247a7fc4940517f`

Algorithm	Hash digest
SHA256	`066b492037211c730a0a29b0ddd5677892b1db3f4a587b117a546c3e9bebbacd`
MD5	`26cd766be9de81249fcadf308156d9f5`
BLAKE2b-256	`6e3ad9ec47e93ca75145a9847ffd10d0d793de50b4dc2a9b5914790798ba4c43`

Algorithm	Hash digest
SHA256	`0bfc35ba3cf19cf8746fb2e2955b468f192fc8fcf8e3b4c102135fb69ec107c4`
MD5	`07cab6e5bd992b49c15c309dec511b53`
BLAKE2b-256	`c6a11c2a6fff21d07f1b36a1dc7cc84cb7dd6373f0cd18a101a805762f67ba47`

Algorithm	Hash digest
SHA256	`9c4575d99aa8de16b300c271125d3df94429a82bd1fa3a0b3aafd3cde001c774`
MD5	`c3739ba9b42f13d92fbddba71c1e0580`
BLAKE2b-256	`74bb32df0f16e1386e7cd529a9d6c035cfe552e549999513ff96fcad4b82d404`

Algorithm	Hash digest
SHA256	`bdd690ee07238c916f6d75da18daa10f32f137edd97af9dd2bd7a841e4c55d61`
MD5	`bed0268c3a0a1963812e39eb358b1a75`
BLAKE2b-256	`8ce20e62606a2873e163d51d2f69df816c7c778c2613cb35657fc1c17ff2616c`

Algorithm	Hash digest
SHA256	`81b2cb13cfbfb2b15f340cebfde53579653a7c83bb379f3ead65a1249053cb4d`
MD5	`8aa23024ecd1d4cc6ef2b44d0298b69a`
BLAKE2b-256	`5928a03ee9a864ef8ac43f90d6298b3759e78f4d3faf2fa0adbe556dfd2cb988`

Algorithm	Hash digest
SHA256	`ffbfc214dc98f71918108879bff7be2e4d95d8187c1f96066e08483d81dba55a`
MD5	`03a7ee20a4558e5f45e8d2a416493656`
BLAKE2b-256	`d6c803335fa424940506626836ceb8d62b14e11eaca9a8ed485db8b79e56d4f6`

Algorithm	Hash digest
SHA256	`f4c26a23b13e40937a5bf68afff464bf014d1a3dabe47e2ac56ca7806529a1cf`
MD5	`495017270580bae6b094759e72e511c3`
BLAKE2b-256	`6c3e01d9378638a2560e6a369bd8c7a1048794f7367c86e6c4a2cbf367747c58`

Algorithm	Hash digest
SHA256	`e6a1ce530ecddb9d007da79c2a3b4809c1d4d38d10f6c019094db5f3690dfec8`
MD5	`60c0a37a0c8b4ef092ad7a0519563ffe`
BLAKE2b-256	`4f917250e621d653277e6ad4c15b0fd273bdab54a843ae5aa7c37f3dd17c6562`

Algorithm	Hash digest
SHA256	`6c3275209747c1fd88bfe31d7d72909f179cebe1bf18ed18f1812490230654f1`
MD5	`e92e1935fde711d08dcf623a016bb908`
BLAKE2b-256	`0ddad1f20cfeb511d466da04a1accf9b350872197ef115b3ceaeea068d71d852`

Algorithm	Hash digest
SHA256	`280315226d8eeac47e63aaf7da7999117a3cd473b00109e3a2d87a501305a403`
MD5	`9a44b793bcbc16f2aee5bb6af9c4a1cf`
BLAKE2b-256	`8f37beadff081d51aaae6711a79cdfe61641eadd3d33d7329a3be7c8afdb0305`

Algorithm	Hash digest
SHA256	`d84463e73a91f2e18226acc9027260e7b8570c26c85219e8c9477611e4ff1b29`
MD5	`de12b7821bde3bd43c2f2b67d85f8d52`
BLAKE2b-256	`40100f40e151406cd4b3a6f5603a6d4f9c0dabfe57693cab2c398a8517353ef1`

Algorithm	Hash digest
SHA256	`09b9dd4a10d8fbf24b688008e1f7104316bf9b0915241474b82ef6093e99af48`
MD5	`18dba095fbdac49fd5a908e1b60d08f4`
BLAKE2b-256	`08f70dd0bb954c77296b678033bf547debef6375a676f1dd0af57e5b950e91d0`

Algorithm	Hash digest
SHA256	`35d9904cf528c14c5615198b4c64b93f4b57316245efc08b431c6600e58cd5e0`
MD5	`1d468e5b923d2ef27010298c1c4f0da7`
BLAKE2b-256	`177073add7b773b14be9f060478b74249306ab30b26d4ae7e07a8d6ec9cd226b`

Algorithm	Hash digest
SHA256	`c5f717f9ec774301b844a5d28602ddd10187a88810a90a7a05bef226fdbc77f0`
MD5	`fca1c0f3f8b48f140447f2f63e37deba`
BLAKE2b-256	`28c7532b871fa1138e0cb65c0a05c23a2371fce0f8f870502e064daee68592f5`

Algorithm	Hash digest
SHA256	`c2c6e3877beeb54f7495c5d2da5da38fc1017ec898516083a2f702dffe2dae7f`
MD5	`519a31b05c0112474d2296cd667c4ee5`
BLAKE2b-256	`c8eb28b271d3f2c3583c8ee3b27ae460f19a9e969f7c913c214199e17c10c33d`

Algorithm	Hash digest
SHA256	`9fbdadebb851a0282353fa548aa33732095b33f55a2d9f611c0b76e40a128380`
MD5	`87c58101a5ec18f516c6f9f94db3c033`
BLAKE2b-256	`e0b705601577adad2b2a73631808e0ef4d9b264ef13336aef0a6b6d796f38c24`

Algorithm	Hash digest
SHA256	`72d903383bd82ee37bd45fc1eaab79598ccae071ed69ebee844318410c78f275`
MD5	`2d6d6d3e585d0343a37aec923fe90345`
BLAKE2b-256	`29b44a97b5276a794bea9bb4846bf266aa046629d6d2320af8deb2e04df8754d`

yantrikdb 0.11.0

YantrikDB — A Cognitive Memory Engine for Persistent AI Systems

Get Started in 60 Seconds

For AI agents (MCP — works with Claude, Cursor, Windsurf, Copilot)

As a Python library

Want higher-quality embeddings?

As a Rust crate

The Problem

Why Not Existing Solutions?

Benchmark: Selective Recall vs. File-Based Memory

Evidence (reproducible)

Architecture

Design Principles

Five Indexes, One Engine

Decoupled Write Path (v0.6.6+)

Cluster Mode (RFC 010 + Phase 6 RYW)

Memory Types (Tulving's Taxonomy)

Key Capabilities

Relevance-Conditioned Scoring

Conflict Detection & Resolution

Semantic Consolidation

Proactive Triggers

Multi-Device Sync (CRDT)

Sessions & Temporal Awareness

Full API

Technical Decisions

Ecosystem

Roadmap

Worked example: Wirecard (RFC 008 substrate — with honest limits)

Research & Publications

📄 Skill as Memory, Not Document (May 2026)

Earlier work

Author

License

Project links

Key dates

Owner

Credits

GitHub Statistics

License expression

Requires

Provides Extra

Tags

Classifiers

Download files

Source Distribution

Built Distributions

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

Algorithm	Hash digest
SHA256	`8058f2381087ab32840743c92ea48a0547f88ac6e93845d7b7a65746d9834f09`
MD5	`28dbd94f30da3cb8444f43a41dc383e9`
BLAKE2b-256	`3d39b14d23c21265d8ab2decacf5775c2abaa43c2ba5bf25831359e68a392266`

Algorithm	Hash digest
SHA256	`5f70155daf86d97462e91ab4f5fef8dbf3c1d1d612f48ba2cba6d68a6917132e`
MD5	`8bac0dcac2789c20c01a41fbdadfe916`
BLAKE2b-256	`6fff63fb5cb76801b5ab4038870fd5fa4e874f284cf26a43f30aa6296b747f7b`

Algorithm	Hash digest
SHA256	`9bbcb58065c77f2ff261912363f707a179d3a9c68efef87969c73a1236621ce9`
MD5	`34c8478f9540448bb0a6257dba5d73e7`
BLAKE2b-256	`ac2c35f36c53c824273910267f935a667443f69c0189a31cd6694b01a52d11d6`

Algorithm	Hash digest
SHA256	`f3195de95a9d032b9225ab0bbe79a501e836b7e6899ae9be53cbe508b7eea462`
MD5	`6078652a7ab850c9334c9cf677ee6171`
BLAKE2b-256	`04e24af0b566ec81de2b526b4fc435afed34fa293528cc89f938b6b5dbfc9f00`

Algorithm	Hash digest
SHA256	`42bfb772ae5141fd93513023c1a93b8bb2e4a83068c8dde54ae9e36512f8a249`
MD5	`0e94ee81544eeec5306b405e82e45565`
BLAKE2b-256	`2f2cde08eb6ab462ddf241f48c7fbdb2863b02ebf92651b60ff77831476db3d8`