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

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§

source§

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

source

pub fn new(left_siblings: Vec<HashValue>, right_siblings: Vec<HashValue>) -> Self

Constructs a new AccumulatorRangeProof using left_siblings and right_siblings.

source

pub fn new_empty() -> Self

Constructs a new AccumulatorRangeProof for an empty list of leaves.

source

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

Get all the left siblngs.

source

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

Get all the right siblngs.

source

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

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§

source§

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.
source§

fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy

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

fn arbitrary() -> Self::Strategy

Generates a Strategy for producing arbitrary values of type the implementing type (Self). Read more
source§

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

source§

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

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<H> Debug for AccumulatorRangeProof<H>

source§

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

Formats the value using the given formatter. Read more
source§

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

source§

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

Deserialize this value from the given Serde deserializer. Read more
source§

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

source§

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

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

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.
source§

impl<H> Serialize for AccumulatorRangeProof<H>

source§

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

Serialize this value into the given Serde serializer. Read more
source§

impl<H> Eq for AccumulatorRangeProof<H>

Auto Trait Implementations§

§

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

§

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

§

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

§

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

§

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

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

const: unstable · source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
source§

impl<T> TestOnlyHash for Twhere T: Serialize + ?Sized,

source§

fn test_only_hash(&self) -> HashValue

Generates a hash used only for tests.
source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

§

fn vzip(self) -> V

source§

impl<T> DeserializeOwned for Twhere T: for<'de> Deserialize<'de>,