APEX Infrastructure

MelbourneVictoriaAustralia kawaljeet.singh3008@gmail.comhttps://ai-governance-standard.com

This document specifies the Merkle commitment profile used by Proof of Stateful Integrity (PSI) receipts. It adopts the Merkle Tree Hash and inclusion proof of RFC 9162 without modification, fixes leaf order, and defines how a receipt declares the profile and how a verifier obtains and checks an inclusion proof. A valid proof shows only that a leaf was committed under a root; it says nothing about the truth or lawfulness of the sealed content.This revision replaces the lexicographic ordering and odd-leaf duplication of revision 00, which were incompatible with RFC 9162, and withdraws all anchoring claims other than OpenTimestamps.

IntroductionPSI receipts commit each sealed digest as a leaf of a Merkle tree so that a third party can check membership without the full ledger. The key words "MUST", "MUST NOT", "SHOULD", and "MAY" in this document are to be interpreted as described in BCP 14 when, and only when, they appear in all capitals, as shown here.

Profile IdentifierA receipt using this profile MUST carry the member merkle_profile with the value RFC6962-SHA256. Receipts without this member MUST NOT be verified under this profile; they were produced under an earlier profile and are out of scope.

Tree ConstructionLeaves are the 32-byte PSI leaf digests, ordered by ledger sequence, oldest first. The tree hash is the Merkle Tree Hash of with SHA-256: a leaf hash is SHA-256(0x00 || leaf) and an interior node is SHA-256(0x01 || left || right). The tree for n leaves splits at the largest power of two less than n; equivalently, an unpaired node is promoted unchanged and is never duplicated.A receipt's root is computed over a window of at most 256 leaves ending with the receipt's own leaf. The window is identified by the receipt's leaf index and tree size, both returned with the proof.

Inclusion ProofAn issuer SHOULD offer a keyless resolver returning, for a receipt identifier, a JSON object with members leaf, leaf_index, tree_size, audit_path (array of lowercase hex digests, bottom-up), root, and root_matches_receipt. The reference resolver is https://qhtntebpcribjiwrdtdd.supabase.co/functions/v1/merkle-proof?receipt_id=.A verifier MUST check the proof with the algorithm of and MUST compare the result with the root printed in the receipt, not with the resolver's root member. The verifier needs no further contact with the issuer.

Test VectorLeaves are SHA-256 of the ASCII strings "a", "b", "c". For leaf index 2 and tree size 3:

Security ConsiderationsInclusion shows commitment, not creation time; time is bounded only by an external anchor. A window shorter than the full ledger means two receipts may commit to different roots; each root is checked against its own receipt. An issuer that controls the ledger can refuse to issue proofs; receipts already held remain verifiable from their own fields.

IANA ConsiderationsThis document has no IANA actions.

ReferencesNormative ReferencesInformative References