Struct diem_sdk::types::proof::AccumulatorRangeProof

pub struct AccumulatorRangeProof<H> { /* private fields */ }

A proof that is similar to AccumulatorProof, but can be used to authenticate a range of leaves. For example, given the following accumulator:

                root
               /     \
             /         \
           /             \
          o               o
        /   \           /   \
       /     \         /     \
      X       o       o       Y
     / \     / \     / \     / \
    o   o   a   b   c   Z   o   o

if the proof wants to show that [a, b, c] exists in the accumulator, it would need X on the left and Y and Z on the right.

Implementations

impl<H> AccumulatorRangeProof<H>where H: CryptoHasher,

pub fn new( left_siblings: Vec<HashValue, Global>, right_siblings: Vec<HashValue, Global> ) -> AccumulatorRangeProof<H>

Constructs a new AccumulatorRangeProof using left_siblings and right_siblings.

pub fn new_empty() -> AccumulatorRangeProof<H>

Constructs a new AccumulatorRangeProof for an empty list of leaves.

pub fn left_siblings(&self) -> &Vec<HashValue, Global>

Get all the left siblngs.

pub fn right_siblings(&self) -> &Vec<HashValue, Global>

Get all the right siblngs.

pub fn verify( &self, expected_root_hash: HashValue, first_leaf_index: Option<u64>, leaf_hashes: &[HashValue] ) -> Result<(), Error>

Verifies the proof is correct. The verifier needs to have expected_root_hash, the index of the first leaf and all of the leaves in possession.

Trait Implementations

impl<H> Arbitrary for AccumulatorRangeProof<H>where H: CryptoHasher,

type Parameters = ()

The type of parameters that arbitrary_with accepts for configuration of the generated Strategy. Parameters must implement Default.

type Strategy = BoxedStrategy<AccumulatorRangeProof<H>>

The type of Strategy used to generate values of type Self.

fn arbitrary_with( _args: <AccumulatorRangeProof<H> as Arbitrary>::Parameters ) -> <AccumulatorRangeProof<H> as Arbitrary>::Strategy

Generates a Strategy for producing arbitrary values of type the implementing type (Self). The strategy is passed the arguments given in args.

fn arbitrary() -> Self::Strategy

Generates a Strategy for producing arbitrary values of type the implementing type (Self).

impl<H> Clone for AccumulatorRangeProof<H>where H: Clone,

fn clone(&self) -> AccumulatorRangeProof<H>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<H> Debug for AccumulatorRangeProof<H>

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

Formats the value using the given formatter.

impl<'de, H> Deserialize<'de> for AccumulatorRangeProof<H>

fn deserialize<__D>( __deserializer: __D ) -> Result<AccumulatorRangeProof<H>, <__D as Deserializer<'de>>::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<H> PartialEq<AccumulatorRangeProof<H>> for AccumulatorRangeProof<H>

fn eq(&self, other: &AccumulatorRangeProof<H>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<H> Serialize for AccumulatorRangeProof<H>

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

Serialize this value into the given Serde serializer.

impl<H> Eq for AccumulatorRangeProof<H>