Struct sc_client_api::StorageProof
source · pub struct StorageProof { /* private fields */ }
Expand description
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
sourceimpl StorageProof
impl StorageProof
sourcepub fn new(
trie_nodes: impl IntoIterator<Item = Vec<u8, Global>>
) -> StorageProof
pub fn new(
trie_nodes: impl IntoIterator<Item = Vec<u8, Global>>
) -> StorageProof
Constructs a storage proof from a subset of encoded trie nodes in a storage backend.
sourcepub fn empty() -> StorageProof
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).
sourcepub fn into_iter_nodes(self) -> impl DoubleEndedIterator
pub fn into_iter_nodes(self) -> impl DoubleEndedIterator
Convert into an iterator over encoded trie nodes in lexicographical order constructed from the proof.
sourcepub fn iter_nodes(&self) -> impl DoubleEndedIterator
pub fn iter_nodes(&self) -> impl DoubleEndedIterator
Create an iterator over encoded trie nodes in lexicographical order constructed from the proof.
sourcepub fn into_memory_db<H>(self) -> MemoryDB<H, HashKey<H>, Vec<u8, Global>>where
H: Hasher,
pub fn into_memory_db<H>(self) -> MemoryDB<H, HashKey<H>, Vec<u8, Global>>where
H: Hasher,
Creates a MemoryDB
from Self
.
sourcepub fn to_memory_db<H>(&self) -> MemoryDB<H, HashKey<H>, Vec<u8, Global>>where
H: Hasher,
pub fn to_memory_db<H>(&self) -> MemoryDB<H, HashKey<H>, Vec<u8, Global>>where
H: Hasher,
Creates a MemoryDB
from Self
reference.
sourcepub fn merge(proofs: impl IntoIterator<Item = StorageProof>) -> StorageProof
pub fn merge(proofs: impl IntoIterator<Item = StorageProof>) -> 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.
sourcepub fn into_compact_proof<H>(
self,
root: <H as Hasher>::Out
) -> Result<CompactProof, Error<<H as Hasher>::Out, Error<<H as Hasher>::Out>>>where
H: Hasher,
pub fn into_compact_proof<H>(
self,
root: <H as Hasher>::Out
) -> Result<CompactProof, Error<<H as Hasher>::Out, Error<<H as Hasher>::Out>>>where
H: Hasher,
Encode as a compact proof with default trie layout.
sourcepub fn to_compact_proof<H>(
&self,
root: <H as Hasher>::Out
) -> Result<CompactProof, Error<<H as Hasher>::Out, Error<<H as Hasher>::Out>>>where
H: Hasher,
pub fn to_compact_proof<H>(
&self,
root: <H as Hasher>::Out
) -> Result<CompactProof, Error<<H as Hasher>::Out, Error<<H as Hasher>::Out>>>where
H: Hasher,
Encode as a compact proof with default trie layout.
sourcepub fn encoded_compact_size<H>(self, root: <H as Hasher>::Out) -> Option<usize>where
H: Hasher,
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.
Running 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
sourceimpl Clone for StorageProof
impl Clone for StorageProof
sourcefn clone(&self) -> StorageProof
fn clone(&self) -> StorageProof
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresourceimpl Debug for StorageProof
impl Debug for StorageProof
sourceimpl Decode for StorageProof
impl Decode for StorageProof
sourcefn decode<__CodecInputEdqy>(
__codec_input_edqy: &mut __CodecInputEdqy
) -> Result<StorageProof, Error>where
__CodecInputEdqy: Input,
fn decode<__CodecInputEdqy>(
__codec_input_edqy: &mut __CodecInputEdqy
) -> Result<StorageProof, Error>where
__CodecInputEdqy: Input,
fn skip<I>(input: &mut I) -> Result<(), Error>where
I: Input,
fn skip<I>(input: &mut I) -> Result<(), Error>where
I: Input,
fn encoded_fixed_size() -> Option<usize>
fn encoded_fixed_size() -> Option<usize>
sourceimpl Encode for StorageProof
impl Encode for StorageProof
sourcefn encode_to<__CodecOutputEdqy>(&self, __codec_dest_edqy: &mut __CodecOutputEdqy)where
__CodecOutputEdqy: Output + ?Sized,
fn encode_to<__CodecOutputEdqy>(&self, __codec_dest_edqy: &mut __CodecOutputEdqy)where
__CodecOutputEdqy: Output + ?Sized,
sourcefn using_encoded<R, F>(&self, f: F) -> Rwhere
F: FnOnce(&[u8]) -> R,
fn using_encoded<R, F>(&self, f: F) -> Rwhere
F: FnOnce(&[u8]) -> R,
fn encoded_size(&self) -> usize
fn encoded_size(&self) -> usize
sourceimpl PartialEq<StorageProof> for StorageProof
impl PartialEq<StorageProof> for StorageProof
sourcefn eq(&self, other: &StorageProof) -> bool
fn eq(&self, other: &StorageProof) -> bool
sourceimpl TypeInfo for StorageProof
impl TypeInfo for StorageProof
type Identity = StorageProof
type Identity = StorageProof
impl EncodeLike<StorageProof> for StorageProof
impl Eq for StorageProof
impl StructuralEq for StorageProof
impl StructuralPartialEq for StorageProof
Auto Trait Implementations
impl RefUnwindSafe for StorageProof
impl Send for StorageProof
impl Sync for StorageProof
impl Unpin for StorageProof
impl UnwindSafe for StorageProof
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
sourceimpl<T> CheckedConversion for T
impl<T> CheckedConversion for T
sourcefn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
sourcefn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
impl<T> DecodeAll for Twhere
T: Decode,
impl<T> DecodeAll for Twhere
T: Decode,
fn decode_all(input: &mut &[u8]) -> Result<T, Error>
fn decode_all(input: &mut &[u8]) -> Result<T, Error>
Self
and consume all of the given input data. Read moreimpl<T> DecodeLimit for Twhere
T: Decode,
impl<T> DecodeLimit for Twhere
T: Decode,
fn decode_all_with_depth_limit(limit: u32, input: &mut &[u8]) -> Result<T, Error>
fn decode_all_with_depth_limit(limit: u32, input: &mut &[u8]) -> Result<T, Error>
Self
and consume all of the given input data. Read morefn decode_with_depth_limit<I>(limit: u32, input: &mut I) -> Result<T, Error>where
I: Input,
fn decode_with_depth_limit<I>(limit: u32, input: &mut I) -> Result<T, Error>where
I: Input,
Self
with the given maximum recursion depth and advance input
by the number of
bytes consumed. Read moreimpl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
. Read morefn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read morefn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read morefn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read moresourceimpl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
sourcefn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
sourceimpl<T> Instrument for T
impl<T> Instrument for T
sourcefn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
sourcefn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
sourceimpl<T, Outer> IsWrappedBy<Outer> for Twhere
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,
impl<T, Outer> IsWrappedBy<Outer> for Twhere
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,
impl<T> Pointable for T
impl<T> Pointable for T
sourceimpl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
sourcefn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
sourcefn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
T
. Read moresourceimpl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
sourcefn unchecked_into(self) -> T
fn unchecked_into(self) -> T
unchecked_from
.sourceimpl<T, S> UniqueSaturatedInto<T> for Swhere
T: Bounded,
S: TryInto<T>,
impl<T, S> UniqueSaturatedInto<T> for Swhere
T: Bounded,
S: TryInto<T>,
sourcefn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T
.