Maintained repository documentationView source on GitHub

Rendered from docs/standards/SCITT_SEMANTIC_BOUNDARY.md at build time without changing its status. The repository source controls if this presentation differs.

Supply Chain Integrity, Transparency, and Trust (SCITT) semantic boundary for Verifier Standard (VSTD) interoperability#

Acronyms: Concise Binary Object Representation (CBOR); CBOR Object Signing and Encryption (COSE); grounded decision certificate (GDC); JavaScript Object Notation (JSON); Request for Comments (RFC); Secure Hash Algorithm 256-bit (SHA-256); Transparency Service (TS); verifiable data structure proof (VDP); verifiable data structure (VDS); working group (WG).

Status: experimental, non-normative. This boundary follows RFC 9943, RFC 9942, and the current repository's implemented VSTD specifications. It does not claim SCITT WG review.

SCITT can establish#

Subject to the named trust anchors, keys, algorithms, VDS profile, registration policy, receipt validity period, and relying-party checks, SCITT can establish:

RFC 9943 is explicit that an issuer can make a false statement and that registration only proves the statement was produced by the issuer. A SCITT Receipt is therefore not a generic certificate of payload truth.

VSTD can establish#

VSTD is not the domain verifier or proof engine. It is the standard domain language and operator/result layer through which those orchestrated substrates expose portable claim boundaries and results. Only for its declared claim, coordinate, evidence, policy, native verifier fragment, and resource bounds, the implemented VSTD numbered profiles can establish:

The native solver, proof engine, signature checker, identity service, transparency log, or provenance system retains its own semantics and result. A loss-declared adapter maps that result into VSTD's verification interlingua and records the boundary around its portable composition; VSTD does not absorb or reimplement the substrate.

VSTD-5 and VSTD-Graph-5 have implemented evidence-bound reference paths, but this SCITT example supplies neither a qualifying witness nor profile-5 rating evidence. A later VSTD profile does not supply a missing prerequisite coordinate.

Identity, disclosure, trust, and reputation#

VSTD verification is claim-first. Deciding a bounded claim does not, merely by being a VSTD check, require a natural-person identity, creator identity, or persistent actor identity. Some VSTD numbered and application profiles name devices, verifier implementations, evidence sources, or witnesses where those coordinates are part of the claim. Such identifiers do not automatically establish authorship, authority, independence, reputation, or real-world identity.

SCITT composition is therefore optional, not a prerequisite for VSTD. An RFC 9943 Signed Statement introduces an authenticated issuer coordinate, and public registration may expose stable identifiers, subjects, payload bytes or digests, timing, and relationship metadata. A key or pseudonym need not identify a natural person, but it can still be linkable. Wrapping a VSTD receipt in SCITT adds an accountability/transparency proposition; it does not strengthen the native VSTD computational proposition and can weaken an identity-minimizing privacy posture.

The implemented VSTD core is disclosure-neutral, not itself a zero-knowledge proof protocol. Under the governing architecture, zero identity means zero identity-derived verdict weight and zero knowledge means zero unevidenced knowledge is presumed. Neither alone is a privacy claim. When a witness must remain confidential, a cryptographic zero-knowledge proof can enclose that architectural rule by binding the exact program, predicate, public commitments, output, parameters, and verifier. Full-disclosure receipts remain valid, and no receipt may claim the cryptographic zero-knowledge property without a real proof-system guarantee. “Trustless” must mean trust-minimized and assumption-explicit: a relying party still depends on selected algorithms, checker code, canonicalization, policy, input availability, and, when used, proof-system parameters or trust roots.

VSTD-Graph can preserve artifact history, challenges, lifecycle changes, and refutations, but the current standard does not define a scalar artifact-reputation score. The governing semantics instead distinguish TRUST, mechanism-earned artifact support; ROT, typed time-indexed degradation of current admissibility; and RUST, inverse-TRUST diagnostic traversal toward recorded ancestors. Their reference transfer mechanisms must never overwrite a native verdict or turn actor identity, repeated registrations, signatures, observations, age, or reputation into process validity.

Neither establishes automatically#

Neither a valid SCITT Receipt nor a valid VSTD receipt automatically establishes:

Two receipts, two propositions#

ArtifactNative proposition
VSTD receiptThe declared bounded computational result and its evidence/refutation boundary.
SCITT COSE ReceiptA VDS property, normally inclusion of the exact Signed Statement under a TS identity and proof profile.

The experimental profile places the first inside the payload of a SCITT Signed Statement and attaches the second to that statement. Implementations must name the receipt type whenever “receipt” would be ambiguous.

The unwrapped VSTD receipt remains checkable outside its producer. Selecting the SCITT profile deliberately adds issuer and transparency coordinates; it is not the default wire path for an identity-independent or witness-private VSTD profile.

Trust coordinates that must remain visible#

SCITT#

VSTD#

Composition rule#

A composed PASS is permitted only when all of the following hold:

  1. the native VSTD checker accepts a VSTD PASS without sharing verdict-producing code;
  2. the full VSTD payload digest matches the payload signed in the SCITT statement;
  3. the SCITT statement signature is valid under an accepted issuer policy;
  4. the SCITT Receipt is valid for that exact statement under an accepted TS/VDS policy;
  5. the SCITT subject equals the VSTD claim-coordinate subject;
  6. the observed artifact digests equal the VSTD-bound artifact digests;
  7. the required evidence is current and neither revoked, superseded, conflicted, missing, nor unavailable under the declared relying-party policy.

Any single failed condition prevents PASS. Registration never repairs a failed VSTD claim. A VSTD PASS never fabricates missing SCITT transparency.

UNKNOWN and lifecycle behavior#

SCITT core does not define one application-level UNKNOWN verdict. The individual Composite Evidence Verification draft proposes unknown, missing, stale, conflict, and warning, but it is not an adopted WG standard and its result precedence remains draft work.

VSTD UNKNOWN is bounded and reason-bearing. In VSTD-4, resource exhaustion, unavailable dependencies, unavailable verifiers, and unretrievable artifacts have distinct indeterminacy reasons. Therefore adapters must preserve both the native SCITT condition and native VSTD reason. Label equality alone is not semantic equivalence.

Historical SCITT inclusion may remain valid while current VSTD usability falls. For example, a receipt can still prove that a statement was registered in the past even after a relying party considers its evidence stale or an ancestor revoked. The adapter records both facts rather than deleting history or treating inclusion as current computational validity.

Implementation boundary#

The module in src/verifier/interoperability/scitt/:

The example uses pinned optional libraries to create and verify real COSE bytes and an RFC 9162 SHA-256 inclusion receipt in a local one-entry test log. That demonstrates the cryptographic boundary but does not represent a production TS, public witness, or public anchoring.