Digital proof Experimental
See the Audit section to learn more about digital proofs.
A register proof is a digitally-signed demonstration of the integrity of all entries in a register. Given a register proof, it is possible to verify that all of the entries and blobs are correct, and that the entries are in the correct order.
A consistency proof proves the append-only property of a register.
The consistency proof for a register containing
m entries and a previous
version of the same register containing
n entries is the information
required to prove that the first
n entries are equal for both, given a
Register proof for each version of the register.
A consistency proof does not require to get the entirety of either logs to verify the consistency between the two.
An entry proof does not require a client to get the entire register to verify the integrity of a single entry.
The root hash for a register is the Merkle tree root hash (RFC6962 section 2.1) of a Merkle tree containing all entries in the register.
The signed tree head for a register is the signed Merkle tree root hash (RFC6962 section 2.1) of a Merkle tree containing all entries in the register.
The audit path provides the shortest list of additional nodes in the Merkle tree required to compute the Merkle tree root hash.