pub struct NonInclusionProof {
pub root: [u8; 32],
pub value: [u8; 32],
pub leaf_lower_range_value: [u8; 32],
pub leaf_higher_range_value: [u8; 32],
pub leaf_index: usize,
pub next_index: usize,
pub merkle_proof: BoundedVec<[u8; 32]>,
}
Expand description
We prove non-inclusion by:
- Showing that value is greater than leaf_lower_range_value and less than leaf_higher_range_value
- Showing that the leaf_hash H(leaf_lower_range_value, leaf_next_index, leaf_higher_value) is included in the root (Merkle tree)
Fields§
§root: [u8; 32]
§value: [u8; 32]
§leaf_lower_range_value: [u8; 32]
§leaf_higher_range_value: [u8; 32]
§leaf_index: usize
§next_index: usize
§merkle_proof: BoundedVec<[u8; 32]>
Trait Implementations§
Auto Trait Implementations§
impl Freeze for NonInclusionProof
impl RefUnwindSafe for NonInclusionProof
impl !Send for NonInclusionProof
impl !Sync for NonInclusionProof
impl Unpin for NonInclusionProof
impl UnwindSafe for NonInclusionProof
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more