Module diem_types::proof::definition [−][src]
Expand description
This module has definition of various proofs.
Structs
AccountStateProof | The complete proof used to authenticate the state of an account. This structure consists of the
|
AccumulatorConsistencyProof | A proof that can be used to show that two Merkle accumulators are consistent – the big one can
be obtained by appending certain leaves to the small one. For example, at some point in time a
client knows that the root hash of the ledger at version 10 is |
AccumulatorExtensionProof | A proof that first verifies that establishes correct computation of the root and then returns the new tree to acquire a new root and version. |
AccumulatorProof | A proof that can be used authenticate an element in an accumulator given trusted root hash. For
example, both |
AccumulatorRangeProof | A proof that is similar to |
EventProof | The complete proof used to authenticate a contract event. This structure consists of the
|
SparseMerkleProof | A proof that can be used to authenticate an element in a Sparse Merkle Tree given trusted root
hash. For example, |
SparseMerkleRangeProof | A proof that can be used authenticate a range of consecutive leaves, from the leftmost leaf to a certain one, in a sparse Merkle tree. For example, given the following sparse Merkle tree: |
TransactionInfoWithProof |
|
TransactionListProof | The complete proof used to authenticate a list of consecutive transactions. |
Constants
MAX_ACCUMULATOR_LEAVES | |
MAX_ACCUMULATOR_PROOF_DEPTH |
Type Definitions
EventAccumulatorProof | |
LeafCount | Because leaves can only take half the space in the tree, any numbering of the tree leaves must not take the full width of the total space. Thus, for a 64-bit ordering, our maximumm proof depth is limited to 63. |
TransactionAccumulatorProof | |
TransactionAccumulatorRangeProof |