knowledgepixels / nanopub-query / 24875604150 / 1

59%

main: 59%

push

github

docs(plan): incremental, load-number-driven space state graph

Reshapes the materialization model. npa:spacesGraph becomes the add-only
extraction graph (summary triples + npa:Invalidation entries, each
stamped with npa:hasLoadNumber). A single npass:<trustStateHash> space
state graph holds the mirrored approved+non-contested trust rows and
the validated closures. Per-tier SPARQL UPDATE loops consume the
(lastProcessed, currentLoadCounter] delta, with fixed-point iteration
per tier and processedUpTo tracking per graph. Invalidations become
single DELETE WHERE { ?invalidatedNP ?p ?o } against npass. Trust-state
flip is the only full rebuild; same-state rebuilds are incremental.
Second-order invalidations are ignored. Sticky, non-cascading revocation.

Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>

296 of 554 branches covered (53.43%)

Branch coverage included in aggregate %.

849 of 1378 relevant lines covered (61.61%)

2.98 hits per line