Struct StorageProof 

pub struct StorageProof<T, H, K = AddedRemovedKeys> { /* private fields */ }

Generates storage merkle proofs.

Implementations

impl<T, H> StorageProof<T, H>

pub fn new(t: T, h: H, address: Address) -> Self

Create a new StorageProof instance.

pub fn new_hashed(t: T, h: H, hashed_address: B256) -> Self

Create a new StorageProof instance with hashed address.

impl<T, H, K> StorageProof<T, H, K>

pub fn with_prefix_set_mut(self, prefix_set: PrefixSetMut) -> Self

Set the changed prefixes.

pub const fn with_branch_node_masks(self, branch_node_masks: bool) -> Self

Set the flag indicating whether to include branch node masks in the proof.

pub fn with_added_removed_keys<K2>( self, added_removed_keys: Option<K2>, ) -> StorageProof<T, H, K2>

Configures the retainer to retain proofs for certain nodes which would otherwise fall outside the target set, when those nodes might be required to calculate the state root when keys have been added or removed to the trie.

If None is given then retention of extra proofs is disabled.

impl<T, H, K> StorageProof<T, H, K>

where T: TrieCursorFactory, H: HashedCursorFactory, K: AsRef<AddedRemovedKeys>,

pub fn storage_proof(self, slot: B256) -> Result<StorageProof, StateProofError>

Generate an account proof from intermediate nodes.

pub fn storage_multiproof( self, targets: B256Set, ) -> Result<StorageMultiProof, StateProofError>

Generate storage proof.

Trait Implementations

impl<T: Debug, H: Debug, K: Debug> Debug for StorageProof<T, H, K>

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

Formats the value using the given formatter.

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.