Governed admission
Identity, role, scope and the write gate check every save, then a durable receipt is issued.
One local control plane for evidence, memory, retrieval, optimization, governance, and peer coordination — memory runs on infrastructure you control. Enterprise deployments add per-workspace isolation, role-based access, GDPR controls, and a per-mode EU AI Act self-assessment. The design makes optional providers, connectors, scale projections, and networked surfaces explicit rather than hiding them behind a single “local” claim.
Pick a mode to see what changes.
Canonical state stays local. Every external path is visible and explicitly enabled.
Mode A: remember and recall make no model-provider call by default. Rules extract facts; a local encoder and cross-encoder retrieve.
Identity, role, scope and the write gate check every save, then a durable receipt is issued.
SQLite, sqlite-vec and FTS are the source of truth, with restore points before upgrades.
Facts, entities, time, nine memory kinds and the knowledge graph advance in bounded, retryable stages.
rules, no language modelA bandit and a LightGBM ranker learn from outcomes; a shadow test promotes and rolls back.
Semantic, keyword, temporal, Hopfield and graph candidates are fused, reranked and traced.
local encoder, 768-dimLaya on your Mac or Jev online decides whether the memories answer the question, or says “I don’t have that”.
same in every modeSecrets are redacted, boundaries neutralised and provenance attached before anything reaches a prompt.
Exact cache, reversible compression, doctor, audit trail and encrypted backup keep it inspectable.
SuperLocalMemory is a durable memory runtime, not a standalone vector index. The same installed system accepts evidence, derives governed memory, retrieves bounded context, checks whether the memories actually answer the question, and exposes optimization, coordination and optional Web access to agents and operators.
One map of the whole system: callers and the four doors, the save and recall paths, the answer gate and check, pictures and documents, the living brain, governance and SLM-Mesh. Light up a pillar, switch the operating mode, then select any component for its role, data flow, controls, boundary and guide.
The memory database stays on your laptop. Tool requests and results pass through the gateway and the app you connected, and the laptop must be online.
Boundary: installed optional components are not silently promoted. The receipt, trace, health, doctor, and scale commands are the release evidence for the stages actually active in a deployment.
This view isolates the five surfaces that agents and operators touch most often. The interactive map above defines every component beneath them.
The MCP server exposes a profile-selected tool surface. Named client templates configure transport, but each client still needs a release-specific install, session, mutation, recall, restart, and uninstall check.
Data-returning CLI commands support --json where documented, returning an envelope with command metadata and data. Consumers must parse the versioned fields they use rather than infer meaning from display text.
slm connect --list for the release surfaceWhen Optimize or proxy caching is enabled, exact-match caching keys the normalized request and can avoid a repeated provider call. Caching is off by default in the shipped configuration; runtime latency and provider accounting must be measured.
Semantic cache is experimental and explicitly opt-in because a near-match can return the wrong response. The implementation can record prompt-class threshold state, but production use remains blocked on held-out false-hit calibration, tenant isolation, and invalidation evidence. LRU and TTL settings bound retained entries when configured.
When compression is explicitly enabled, safe handling preserves JSON and code invariants and may produce no reduction. Reversible CCR storage can retain the original for byte-exact retrieval; aggressive prose reduction is a separate opt-in, lossy path.
Prefix ordering can improve reuse when the configured provider supports prompt caching and all provider-specific conditions are met. Pricing, TTL, minimum-prefix, and discount behavior belong to the provider contract and must be measured separately.
Every accepted write owns a durable operation record and raw evidence in the SQLite-backed source of truth. A queryable relational and FTS projection is committed before asynchronous enrichment begins.
Enrichment is lease-owned, checkpointed, retryable, and marked complete only after its declared stages succeed. SQLite remains canonical; CozoDB and LanceDB projections are activated only through explicit prepare, verify, promote, and rollback controls.
Dense semantic candidate generation uses cosine similarity. Lexical, temporal, Hopfield associative, and spreading-activation channels can add candidates before fusion; entity-graph information enhances scores after fusion.
Fisher-derived terms can inform later scoring when their state is available. This ranking utility is not answer probability. The score contract keeps query relevance, stored-memory confidence, trust, and internal ranking utility separate.
slm recall.A recall command traverses the configured layers and records runtime evidence. Latency depends on corpus, hardware, warmup state, enabled channels, and reranker availability.
slm recall "JWT token lifetime". If --json is present, the response envelope is prepared. Input and explicit scope are normalized and validated before retrieval.
calibration_status is uncalibrated and answer_confidence is null.
SQLite is the normal-path source of truth. The scale engine includes CozoDB and LanceDB scale-engine projectors, but promotion is explicit and reversible: prepare an isolated projection, verify parity, then promote or roll back.
| Optional graph projector | Optional vector projector | Canonical store | |
|---|---|---|---|
| Engine | CozoDB | LanceDB | SQLite + zstd |
| Format | Property graph | Columnar vectors | Compressed rows |
| Access time | Benchmark required | Benchmark required | Benchmark required |
| Compression | None | None | Content-specific; release benchmark required |
| Use for | Promotion-gated graph projection | Promotion-gated vector projection | Normal-path durable records, indexes, and configured compressed payloads |
Read the code, fork it, and audit it. The SuperLocalMemory source and packages are AGPL-3.0-or-later. Optional model providers and external integrations retain their own licenses, terms, and network behavior.
Read the guidesArchitecture in detail · Scale engine · Score contract