Struct exclusion_merkle_cbt::ExclusionMerkleProof

pub struct ExclusionMerkleProof<K, V, H, M> { /* fields omitted */ }

The proof wrapped MerkleProof to verify the exclusion of some keys

Implementations

impl<K, V, H, M> ExclusionMerkleProof<K, V, H, M> where
    K: AsRef<[u8]> + Clone + Ord,
    V: AsRef<[u8]> + Clone + Default,
    H: Hasher + Default,
    M: Merge<Item = H256>, 

pub fn new(
    raw_proof: MerkleProof<H256, M>,
    range_leaves: Vec<RangeLeaf<K, V, H>>
) -> Self

pub fn raw_proof(&self) -> &MerkleProof<H256, M>

The underlying proof

pub fn range_leaves(&self) -> &[RangeLeaf<K, V, H>]

pub fn verify_exclusion_with_ranges<'a>(
    &self,
    root: &H256,
    range_leaves: &[RangeLeaf<K, V, H>],
    excluded_keys: &'a [K]
) -> Result<(), Error<'a, K>>

pub fn verify_exclusion<'a>(
    &self,
    root: &H256,
    excluded_keys: &'a [K]
) -> Result<(), Error<'a, K>>

Verify the excluded_keys are all not in tree.

• Ok(()) => All keys are not in tree
• Err(Error::InvalidProof) => The proof don’t match the root
• Err(Error::KeyIncluded(K))=> Some keys are in tree
• Err(Error::KeyUnknown(K)) => The proof is ok, but some keys not coverted in the range

Trait Implementations

impl<K, V, H, M> From<ExclusionMerkleProof<K, V, H, M>> for (MerkleProof<H256, M>, Vec<RangeLeaf<K, V, H>>)

fn from(proof: ExclusionMerkleProof<K, V, H, M>) -> Self

Performs the conversion.