Module diem_types::proof::definition
source · Expand description
This module has definition of various proofs.
Structs
- The complete proof used to authenticate the state of an account. This structure consists of the
AccumulatorProof
fromLedgerInfo
toTransactionInfo
, theTransactionInfo
object and theSparseMerkleProof
from state root to the account. - 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
old_root
(it could be a waypoint). If a server wants to prove that the new ledger at versionN
is derived from the old ledger the client knows, it can show the subtrees that represent all the new leaves. If the client can verify that it can indeed obtain the new root hash by appending these new leaves, it can be convinced that the two accumulators are consistent. - 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.
- A proof that can be used authenticate an element in an accumulator given trusted root hash. For example, both
LedgerInfoToTransactionInfoProof
andTransactionInfoToEventProof
can be constructed on top of this structure. - A proof that is similar to
AccumulatorProof
, but can be used to authenticate a range of leaves. For example, given the following accumulator: - The complete proof used to authenticate a contract event. This structure consists of the
AccumulatorProof
fromLedgerInfo
toTransactionInfo
, theTransactionInfo
object and theAccumulatorProof
from event accumulator root to the event. - A proof that can be used to authenticate an element in a Sparse Merkle Tree given trusted root hash. For example,
TransactionInfoToAccountProof
can be constructed on top of this structure. - 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:
- An in-memory accumulator for storing a summary of the core transaction info accumulator. It is a summary in the sense that it only stores maximally frozen subtree nodes rather than storing all leaves and internal nodes.
TransactionInfo
and aTransactionAccumulatorProof
connecting it to the ledger root.- The complete proof used to authenticate a list of consecutive transactions.
Constants
Type Definitions
- 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.