Expand description
Bounded-memory proof of the encoded graph represented by an N-Triples source and a Q42 volume.
The qualia-cli ingest semantic pipeline stores the default graph as hashed
(subject, predicate, object, context) records. This module compares those
records exactly as a set, using sorted fixed-width disk runs rather than an
in-memory graph or a lossy aggregate checksum.
Blank-node graphs require lexical Q42 terms for canonical isomorphism.
Structs§
- Graph
Proof Options - Resource limits for
prove_cli_ntriples_q42_equivalence. - Graph
Proof Report - Result of an exact, external-sort comparison.
Enums§
- RdfIsomorphism
Status - The level of RDF claim that can be made from an encoded Q42 comparison.
Constants§
- DEFAULT_
GRAPH_ PROOF_ MEMORY_ BYTES - Default RAM reserved for the sort buffer. The verifier uses bounded I/O buffers in addition to this allocation.
- DEFAULT_
GRAPH_ PROOF_ TEMP_ BYTES - Default maximum temporary on-disk footprint. The verifier fails closed rather than exhausting an arbitrary temp volume.
Functions§
- prove_
cli_ ntriples_ q42_ equivalence - Compare an N-Triples input to a Q42 volume without retaining either graph in memory.