Struct sp_trie::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>>) -> Self
pub fn new(trie_nodes: impl IntoIterator<Item = Vec<u8>>) -> Self
Constructs a storage proof from a subset of encoded trie nodes in a storage backend.
sourcepub fn empty() -> Self
pub fn empty() -> Self
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 Sized + DoubleEndedIterator<Item = Vec<u8>>
pub fn into_iter_nodes(self) -> impl Sized + DoubleEndedIterator<Item = Vec<u8>>
Convert into an iterator over encoded trie nodes in lexicographical order constructed from the proof.
sourcepub fn iter_nodes(&self) -> impl Sized + DoubleEndedIterator<Item = &Vec<u8>>
pub fn iter_nodes(&self) -> impl Sized + DoubleEndedIterator<Item = &Vec<u8>>
Create an iterator over encoded trie nodes in lexicographical order constructed from the proof.
sourcepub fn into_nodes(self) -> BTreeSet<Vec<u8>>
pub fn into_nodes(self) -> BTreeSet<Vec<u8>>
Convert into plain node vector.
sourcepub fn into_memory_db<H: Hasher>(self) -> MemoryDB<H>
pub fn into_memory_db<H: Hasher>(self) -> MemoryDB<H>
Creates a MemoryDB from Self.
sourcepub fn to_memory_db<H: Hasher>(&self) -> MemoryDB<H>
pub fn to_memory_db<H: Hasher>(&self) -> MemoryDB<H>
Creates a MemoryDB from Self reference.
sourcepub fn merge(proofs: impl IntoIterator<Item = Self>) -> Self
pub fn merge(proofs: impl IntoIterator<Item = Self>) -> Self
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: Hasher>(
self,
root: H::Out
) -> Result<CompactProof, CompactProofError<H::Out, Error<H::Out>>>
pub fn into_compact_proof<H: Hasher>(
self,
root: H::Out
) -> Result<CompactProof, CompactProofError<H::Out, Error<H::Out>>>
Encode as a compact proof with default trie layout.
sourcepub fn to_compact_proof<H: Hasher>(
&self,
root: H::Out
) -> Result<CompactProof, CompactProofError<H::Out, Error<H::Out>>>
pub fn to_compact_proof<H: Hasher>(
&self,
root: H::Out
) -> Result<CompactProof, CompactProofError<H::Out, Error<H::Out>>>
Encode as a compact proof with default trie layout.
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: Input>(
__codec_input_edqy: &mut __CodecInputEdqy
) -> Result<Self, Error>
fn decode<__CodecInputEdqy: Input>(
__codec_input_edqy: &mut __CodecInputEdqy
) -> Result<Self, Error>
sourcefn skip<I>(input: &mut I) -> Result<(), Error>where
I: Input,
fn skip<I>(input: &mut I) -> Result<(), Error>where
I: Input,
sourcefn encoded_fixed_size() -> Option<usize>
fn encoded_fixed_size() -> Option<usize>
sourceimpl Encode for StorageProof
impl Encode for StorageProof
sourcefn encode_to<__CodecOutputEdqy: Output + ?Sized>(
&self,
__codec_dest_edqy: &mut __CodecOutputEdqy
)
fn encode_to<__CodecOutputEdqy: Output + ?Sized>(
&self,
__codec_dest_edqy: &mut __CodecOutputEdqy
)
sourcefn using_encoded<R, F: FnOnce(&[u8]) -> R>(&self, f: F) -> R
fn using_encoded<R, F: FnOnce(&[u8]) -> R>(&self, f: F) -> R
sourcefn size_hint(&self) -> usize
fn size_hint(&self) -> usize
sourcefn encoded_size(&self) -> usize
fn encoded_size(&self) -> usize
sourceimpl<H: Hasher> From<&StorageProof> for MemoryDB<H>
impl<H: Hasher> From<&StorageProof> for MemoryDB<H>
sourcefn from(proof: &StorageProof) -> Self
fn from(proof: &StorageProof) -> Self
sourceimpl<H: Hasher> From<StorageProof> for MemoryDB<H>
impl<H: Hasher> From<StorageProof> for MemoryDB<H>
sourcefn from(proof: StorageProof) -> Self
fn from(proof: StorageProof) -> Self
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
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> DecodeLimit for Twhere
T: Decode,
impl<T> DecodeLimit for Twhere
T: Decode,
impl<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<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>,
sourceimpl<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.