A CONCEPT · PROJECTED FROM THE VINDEX KNOWLEDGE GRAPH
VERIFICATION — G4
four views must agree pairwise
Four independently derived views of the same system — Declared, Resolved, Graph, Encoded — compared pairwise, so a failure names the two that disagree.
Both ends are re-hashed at verify time, so a drifted checkpoint fails differently from a corrupted container. The tensor table is compared entry by entry, because a relabelled dtype over identical bytes is invisible to every hash. And consistency is not sufficiency — the other half of the proof is closure.
IN THE GRAPH
verification — g4— proves →authority
verification — g4— completed by →operand closure