[SLICE 12][CORE-C] Implement RACE durable cursor/cache generations, invalidation fingerprints, and replayable retrieval receipts #19
Labels
No labels
accessibility
bug
documentation
duplicate
enhancement
good first issue
help wanted
invalid
question
wontfix
No milestone
No project
No assignees
1 participant
Notifications
Due date
No due date set.
Dependencies
No dependencies set.
Reference
nsaspy/symbolic-memory#19
Loading…
Add table
Add a link
Reference in a new issue
No description provided.
Delete branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Parent epic: #14
Depends on: #29
Research: prolog-rlm#403C/#403D
Goal
Implement the store-side durable state needed for heterogeneous retrieval execution without making backend statistics or cache state epistemic truth.
Implement:
Acceptance
Mixed-generation pagination is rejected/marked partial; async response permutation yields identical normalized result; cache invalidates only actual dependents; stale cache cannot answer as exact; remote requery creates new observation lineage; no cache hit grants authority or warrant.