Struct sc_light::fetcher::StorageProof

pub struct StorageProof { /* fields omitted */ }

A proof that some set of key-value pairs are included in the storage trie. The proof contains the storage values so that the partial storage backend can be reconstructed by a verifier that does not already have access to the key-value pairs.

The proof consists of the set of serialized nodes in the storage trie accessed when looking up the keys covered by the proof. Verifying the proof requires constructing the partial trie from the serialized nodes and performing the key lookups.

Implementations

impl StorageProof

pub fn new(trie_nodes: Vec<Vec<u8, Global>, Global>) -> StorageProof

Constructs a storage proof from a subset of encoded trie nodes in a storage backend.

pub fn empty() -> StorageProof

Returns a new empty proof.

An empty proof is capable of only proving trivial statements (ie. that an empty set of key-value pairs exist in storage).

pub fn is_empty(&self) -> bool

Returns whether this is an empty proof.

pub fn iter_nodes(self) -> StorageProofNodeIterator

Create an iterator over trie nodes constructed from the proof. The nodes are not guaranteed to be traversed in any particular order.

pub fn into_nodes(self) -> Vec<Vec<u8, Global>, Global>

Convert into plain node vector.

pub fn into_memory_db<H>(
    self
) -> MemoryDB<H, HashKey<H>, Vec<u8, Global>, MemCounter<Vec<u8, Global>>> where
    H: Hasher, 

Creates a MemoryDB from Self.

pub fn merge<I>(proofs: I) -> StorageProof where
    I: IntoIterator<Item = StorageProof>, 

Merges multiple storage proofs covering potentially different sets of keys into one proof covering all keys. The merged proof output may be smaller than the aggregate size of the input proofs due to deduplication of trie nodes.

pub fn into_compact_proof<H>(
    self,
    root: <H as Hasher>::Out
) -> Result<CompactProof, Error<Layout<H>>> where
    H: Hasher, 

Encode as a compact proof with default trie layout.

pub fn encoded_compact_size<H>(self, root: <H as Hasher>::Out) -> Option<usize> where
    H: Hasher, 

Returns the estimated encoded size of the compact proof.

Runing this operation is a slow operation (build the whole compact proof) and should only be in non sensitive path. Return None on error.

Trait Implementations

impl Clone for StorageProof

pub fn clone(&self) -> StorageProof

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for StorageProof

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl Decode for StorageProof

pub fn decode<__CodecInputEdqy>(
    __codec_input_edqy: &mut __CodecInputEdqy
) -> Result<StorageProof, Error> where
    __CodecInputEdqy: Input, 

Attempt to deserialise the value from input.

fn skip<I>(input: &mut I) -> Result<(), Error> where
    I: Input, 

Attempt to skip the encoded value from input.

fn encoded_fixed_size() -> Option<usize>

Returns the fixed encoded size of the type.

impl Encode for StorageProof

pub fn encode_to<__CodecOutputEdqy>(
    &self,
    __codec_dest_edqy: &mut __CodecOutputEdqy
) where
    __CodecOutputEdqy: Output + ?Sized, 

Convert self to a slice and append it to the destination.

pub fn encode(&self) -> Vec<u8, Global>

Convert self to an owned vector.

pub fn using_encoded<R, F>(&self, f: F) -> R where
    F: FnOnce(&[u8]) -> R, 

Convert self to a slice and then invoke the given closure with it.

fn size_hint(&self) -> usize

If possible give a hint of expected size of the encoding.

fn encoded_size(&self) -> usize

Calculates the encoded size.

impl PartialEq<StorageProof> for StorageProof

pub fn eq(&self, other: &StorageProof) -> bool

This method tests for self and other values to be equal, and is used by ==.

pub fn ne(&self, other: &StorageProof) -> bool

This method tests for !=.

impl EncodeLike<StorageProof> for StorageProof

impl Eq for StorageProof

impl StructuralEq for StorageProof

impl StructuralPartialEq for StorageProof