Direct KIP: Recall card
September 15, 2026 · View on GitHub
For a model implementing Brain Recall. The Recall policy owns selection and interpretation; Core owns semantics. Use a read-only execution path. No read changes strength, confidence or grades.
Start from the authorized context and live vocabulary:
DESCRIBE PRIMER MODE "compact"
Ground unfamiliar entities, preserving ambiguity. Keyword is the baseline; use semantic/hybrid only where advertised. A search miss is not canonical absence.
SEARCH CONCEPT :query MODE "keyword" LIMIT 10
Use final BELIEF for facts. All parameters below are complete bound values and exact known references; context is supplied, never guessed as universal.
FIND(?belief)
WHERE { ?belief BELIEF (:subject, :predicate, :object) }
WITH EPISTEMIC {context_refs: :contexts, purpose: "answer_user", explanation: "summary"}
Use a slot to inspect alternative values. Both forms account for applicable conflicts.
FIND(?slot)
WHERE { ?slot BELIEF SLOT (:subject, :predicate) }
FOR TIME :world_time
WITH EPISTEMIC {context_refs: :contexts, purpose: "answer_user", explanation: "ledger"}
Raw history is for source inspection, not a shortcut to accepted belief:
FIND(?assertion)
WHERE { ?assertion ASSERTION {proposition: :proposition} }
LIMIT 20
AS OF SEQ selects retained cognitive history; FOR TIME selects world validity. Cursors are opaque and current authorization still applies. Follow every required page or disclose incomplete coverage. For resume, use task-scoped WorkingState plus changes through a declared watermark, validating all computation dependencies.
Return essential facts, constraints, conflicts, failures, candidates and unknowns. Check virtual dependency validity before using derived cognition. Keep applicable warnings even when output is short; a basis or ranking score is not permission. A pending Memory Interface after barrier cannot be satisfied by a fresh index alone. Expand evidence only as needed; full ProjectionBasis/RecallCoverage stay attached to the result or a governed binding handle. Never invent unavailable history.
Complete syntax is available for aggregates, paths and uncommon META operations. It need not be loaded for each ordinary recall.