Inputs, retained state, outputs and limits of Naevum’s Memory & knowledge systems architecture.
- Bitemporal claim query
- Validity intervals and recorded-at cutoffs distinguish the world at a time from what the system knew at a time.
- Authority inheritance
- Derived authority is capped by contributing ancestry. Missing parents, cycles and unsupported derivations do not promote a claim.
- Claim operation algebra
- Supersede, revise, contest, suppress and retract affect applicability and recall differently. Conflicting top-ranked claims remain non-binding.
- Holder-scoped integrity
- Append-only keyed chains retain previous-record linkage and verified-prefix status. Storage boundaries remain attached to recall.
- Deterministic retrieval
- SQLite FTS5 supports a rebuildable index. Ranking includes relevance, binding authority, scope distance and ACT-R-inspired use activation.
- Recall budget and abstention
- Item and byte limits bound the returned view. Unreadable, withheld and absent results retain reasons rather than silently becoming an empty success.
- Use-aware consolidation
- Projection, failure memory, hygiene, index rebuilding, packs and examination are distinct stages. Canonical claims and their operations remain the historical basis.
- Measured failure memory
- Defined observed harms contribute to a decayed failure weight. Quarantine and release use different thresholds, and transitions retain their cause.
- World-model scope
- Connected sources, supported identity inferences, preferences, responsibilities and objectives form a scoped representation. The person or organization can inspect and correct that representation.
- Two-layer convergent memory
- An observed-remove set accumulates claim/origin elements by union. A deterministic read-time interpretation resolves the evidence without replacing the historical set.
- Typed maintenance and forgetting
- Decayed, never-captured, unlearned and superseded remain distinct. Recurrence, retrieval spacing, promotion and retention are separate policy decisions.