Struct SparseMerkleRangeProof

pub struct SparseMerkleRangeProof<H: SimpleHasher> { /* private fields */ }

Note: this is not a range proof in the sense that a range of nodes is verified! Instead, it verifies the entire left part of the tree up to a known rightmost node. See the description below.

A proof that can be used to authenticate a range of consecutive leaves, from the leftmost leaf to the rightmost known one, in a sparse Merkle tree. For example, given the following sparse Merkle tree:

                  root
                 /     \
                /       \
               /         \
              o           o
             / \         / \
            a   o       o   h
               / \     / \
              o   d   e   X
             / \         / \
            b   c       f   g

if the proof wants show that [a, b, c, d, e] exists in the tree, it would need the siblings X and h on the right.

Implementations

impl<H: SimpleHasher> SparseMerkleRangeProof<H>

pub fn verify( &self, expected_root_hash: RootHash, rightmost_known_leaf: SparseMerkleLeafNode, left_siblings: Vec<[u8; 32]>, ) -> Result<()>

Verifies that the rightmost known leaf exists in the tree and that the resulting root hash matches the expected root hash.

Trait Implementations

impl<H: SimpleHasher> BorshDeserialize for SparseMerkleRangeProof<H>

fn deserialize_reader<__R: Read>(reader: &mut __R) -> Result<Self, Error>

fn deserialize(buf: &mut &[u8]) -> Result<Self, Error>

Deserializes this instance from a given slice of bytes. Updates the buffer to point at the remaining bytes.

fn try_from_slice(v: &[u8]) -> Result<Self, Error>

Deserialize this instance from a slice of bytes.

fn try_from_reader<R>(reader: &mut R) -> Result<Self, Error>

where R: Read,

impl<H: SimpleHasher> BorshSerialize for SparseMerkleRangeProof<H>

fn serialize<__W: Write>(&self, writer: &mut __W) -> Result<(), Error>

impl<H: SimpleHasher> Clone for SparseMerkleRangeProof<H>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<H: SimpleHasher> Debug for SparseMerkleRangeProof<H>

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

Formats the value using the given formatter.

impl<'de, H: SimpleHasher> Deserialize<'de> for SparseMerkleRangeProof<H>

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<H: SimpleHasher> PartialEq for SparseMerkleRangeProof<H>

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<H: SimpleHasher> Serialize for SparseMerkleRangeProof<H>

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<H: Eq + SimpleHasher> Eq for SparseMerkleRangeProof<H>