§03-ii Minerva — Knowledge Base — Inspector verification (property table)
Mars® Spec › §03-ii Minerva — Knowledge Base › Inspector verification (property table)
5. Inspector verification (property table)
The following properties are externally observable by a qualified inspector without access to internal system state.
| Property | Observable indicator | Load-bearing |
|---|---|---|
| S1 Order-typed primitives | Primitives are typed by orders and organized along orders; KB is not a flat entity-relation graph. The typing is carried by the aspect identifier (§3.2): an inspector parses the aspect identifier of any entry and recovers its three encoded components — order type, position in the order-decomposition tree, and the domain-model version under which it was issued. An entry whose index field is an opaque or arbitrary label — a UUID, free-form tag, or category annotation — from which those three components cannot be recovered does not satisfy this property, regardless of how the store is navigated; the recovered components are what make update-scoped regeneration (§01 §14 D20) computable against a changed model node | Yes |
| S2 Aspect-bound synthetic variants | Variants are bound to the same aspect as their originating primitive and are traceable to that primitive and its source span | Yes |
| S3 N-way navigation | Any representation may serve as entry point; any other as lookup target; navigation is entry-point-agnostic | — |
| S4 Per-artifact provenance | Each primitive and variant carries provenance to its source span | — |
| S5 Primitive-level retrieval | A typed primitive is returned and expanded along the metadata fabric; raw chunk alone is not the retrieval unit | Yes |
| S6 Portable order-structured package | Symbolic store, embedded index, metadata fabric, extraction records, configuration artifacts, and accessor; usable without the creation pipeline | — |
| S7 Map-governed segmentation with subchunk expression | Chunk boundaries occur at aspect and order transitions; subchunks are expressed as first-class entries with their own identifiers, aspect bindings, and embedding vector identifiers | Yes |
| S8 Bidirectional symbolic-embedding round-trip | A vector returned by embedding-space retrieval carries an identifier enabling a direct lookup of its originating primitive in the symbolic store; the round-trip does not require a secondary similarity search | Yes |
| S9 Controlled transformation admissibility | A transformation T applied to entry e is admissible only when D(T(e), e) ≤ δ under the KB’s declared distance function (declared bound) and d(prim(T(e)), prim(e)) ≤ ε (declared semantic tolerance); an inadmissible transformation is recorded as a boundary encounter, not applied as a traversal step | Yes |
| S10 Traversal-governed vs. graph-proximity distinction | KB traversal follows the order-decomposition tree and aspect-binding index; removing or substituting the domain model produces an observably different traversal path; graph-proximity alone does not govern traversal | Yes |
| S11 Six-field variant declaration completeness | Every synthetic variant registered in the KB carries all six required fields of the variant declaration record (§01 §5); a variant missing any field is structurally deficient and refused at registration | Yes |
| S12 Variant consistency map present | A KB carrying synthetic variants carries an attested variant consistency map with per-element and per-pair entries for every declared variant pair; a KB with variants but without a variant consistency map is structurally incomplete | Yes |
| S13 Per-pair attestation with agreement gate | Every per-pair entry in the variant consistency map carries an attestation record from a named authority with domain standing; the declared inter-rater agreement statistic meets the declared threshold; an entry with a below-threshold statistic value is refused as an attested entry | Yes |
| S14 Conflict entry gap propagation | A conflict correspondence type in the variant consistency map produces a KB-variant-locus gap entry in the multi-locus gap report; a conflict entry that is not reflected in the gap report is a registry conformance failure |
— |
| S15 Pending-re-attestation exclusion from benchmark use | Per-pair entries in pending-re-attestation state are excluded from benchmark use at the calibration attestation gate (§02a §5a.6); a deployment that uses pending-re-attestation entries as benchmark inputs is observably non-conforming | Yes |
| S16 Corpus source-trust admission and propagation | Each admitted corpus document carries a declared source-trust tier (attested / first-party / unattested) recorded in the extraction record and propagated unstripped into every derived primitive, variant, evidence record, and verdict; a verdict grounded at an aspect on evidence below the aspect’s declared minimum trust tier is non-conforming; a document admitted without a tier is a structurally incomplete admission | Yes |
| S17 Embedder-migration conformance | A single KB index containing vectors from two or more distinct embedder versions without a registered cross-embedder calibration mapping is non-conforming; migration proceeds by atomic version cut or dual-index discipline; a traversal over a KB in migration records which index (embedder) each step drew from | Yes |