Practical summary
Build document recall and decision-history prototypes with explicit source ownership.
CORE ARCHITECTURE · Implemented
A technical note on durable storage, approximate vector search and inspectable ranking, with legacy and canonical episode paths distinguished.
MLAI Research · WDBX Core · JUNE 2026 · 3 min read · research note
Practical summary
Build document recall and decision-history prototypes with explicit source ownership.
Status
The described source behavior is implemented; customer outcomes and deployment readiness are not established.
Reviewed 2026-09-30
A technical note on durable storage, approximate vector search and inspectable ranking, with legacy and canonical episode paths distinguished.
Build document recall and decision-history prototypes with explicit source ownership.
The active Rust substrate provides durable snapshots and WAL recovery, a layered HNSW graph, and a hybrid retrieval API that exposes score components. HNSW defaults in the inspected source are M=16, EF_CONSTRUCTION=40 and EF_SEARCH=32.
Legacy snapshot chain verification and strict content verification are different entry points. Canonical v3 episode storage is also a distinct API. Applications must identify the path they actually use; this note does not assert that every write from every consumer passed episode admission.
For nonzero, equal-dimension vectors, cosine similarity is the normalized dot product below. It ranges from -1 to 1; it is not a probability. The CPU reference returns zero for empty or zero-norm inputs. HNSW supplies approximate candidates rather than an exhaustive guarantee of the globally closest records. An evaluation therefore needs an exact-search baseline for its chosen corpus and requested result count.
The hybrid scorer clamps semantic similarity and caller-provided persona affinity to the unit interval, then multiplies them by temporal and causal factors. With a positive half-life, temporal weight halves each half-life of nonnegative age; a nonpositive half-life disables decay. Missing timestamps use the query time. Causal reachability is bounded and uses an undirected view of persisted edges, so a hop count should not be interpreted as a proof of causal direction.
Use a disposable corpus with known vector neighbors and explicit metadata. Capture the source revision, vector dimensions, insertion order, query vectors and index parameters. Compare approximate results with exact ranking, then checkpoint, reopen and repeat the same queries. Separately alter a copied block payload to distinguish predecessor-link checks from strict content-hash verification. Neither successful recovery nor matching hashes validates the factual content of a stored statement. Canonical episode commitments must be tested through the v3 episode path, not inferred from legacy snapshot success.
Start with a synthetic or authorized corpus. Check recovery, source identifiers, update behavior and retrieval relevance. Treat application permissions, data retention and deployment evidence as additional requirements.
source · revision e45410356ceb4e96f0dc26a83b02e1c18cf94860
source · revision e45410356ceb4e96f0dc26a83b02e1c18cf94860
source · revision e45410356ceb4e96f0dc26a83b02e1c18cf94860
source · revision e45410356ceb4e96f0dc26a83b02e1c18cf94860
source · revision e45410356ceb4e96f0dc26a83b02e1c18cf94860
source · revision e45410356ceb4e96f0dc26a83b02e1c18cf94860
source · revision e45410356ceb4e96f0dc26a83b02e1c18cf94860
Current edition · 2026-09-06 · 3 pages
SHA-256: 294a7906391b064273691eff60a0f83242cbbb78e2a894321285e993f31f3fa2
Historical edition · 2026-06-01 · 5 pages
SHA-256: 1030bd50a64ab2426ba6558aee26398cfea1a7b7de39e527db0685bf54a853cf