Struct sp_runtime::proving_trie::base2::BasicProvingTrie

pub struct BasicProvingTrie<Hashing, Key, Value>
where
    Hashing: Hasher,
{ /* private fields */ }

A helper structure for building a basic base-2 merkle trie and creating compact proofs for that trie.

Trait Implementations

impl<Hashing, Key, Value> ProofToHashes for BasicProvingTrie<Hashing, Key, Value>

where Hashing: Hasher, Hashing::Out: MaxEncodedLen + Decode, Key: Decode, Value: Decode,

type Proof = [u8]

The Proof type we will use to determine the number of hashes.

fn proof_to_hashes(proof: &[u8]) -> Result<u32, DispatchError>

This function returns the number of hashes we expect to calculate based on the size of the proof. This is used for benchmarking, so for worst case scenario, we should round up.

impl<Hashing, Key, Value> ProvingTrie<Hashing, Key, Value> for BasicProvingTrie<Hashing, Key, Value>

where Hashing: Hasher, Hashing::Out: Encode + Decode, Key: Encode + Decode + Ord, Value: Encode + Decode + Clone,

fn generate_for<I>(items: I) -> Result<Self, DispatchError>

where I: IntoIterator<Item = (Key, Value)>,

Create a new instance of a ProvingTrie using an iterator of key/value pairs.

fn root(&self) -> &Hashing::Out

Access the underlying trie root.

fn query(&self, key: &Key) -> Option<Value>

Query a value contained within the current trie. Returns None if the nodes within the current db are insufficient to query the item.

fn create_proof(&self, key: &Key) -> Result<Vec<u8>, DispatchError>

Create a compact merkle proof needed to prove a single key and its value are in the trie. Returns an error if the nodes within the current db are insufficient to create a proof.

fn verify_proof( root: &Hashing::Out, proof: &[u8], key: &Key, value: &Value, ) -> Result<(), DispatchError>

Verify the existence of key and value in a given trie root and proof.