pub struct MerkleTreeMmcs<P, PW, H, C, const DIGEST_ELEMS: usize> { /* private fields */ }
Expand description
A vector commitment scheme backed by a MerkleTree
.
Generics:
P
: a leaf valuePW
: an element of a digestH
: the leaf hasherC
: the digest compression function
Implementations§
Trait Implementations§
Source§impl<P: Clone, PW: Clone, H: Clone, C: Clone, const DIGEST_ELEMS: usize> Clone for MerkleTreeMmcs<P, PW, H, C, DIGEST_ELEMS>
impl<P: Clone, PW: Clone, H: Clone, C: Clone, const DIGEST_ELEMS: usize> Clone for MerkleTreeMmcs<P, PW, H, C, DIGEST_ELEMS>
Source§fn clone(&self) -> MerkleTreeMmcs<P, PW, H, C, DIGEST_ELEMS>
fn clone(&self) -> MerkleTreeMmcs<P, PW, H, C, DIGEST_ELEMS>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl<P: Debug, PW: Debug, H: Debug, C: Debug, const DIGEST_ELEMS: usize> Debug for MerkleTreeMmcs<P, PW, H, C, DIGEST_ELEMS>
impl<P: Debug, PW: Debug, H: Debug, C: Debug, const DIGEST_ELEMS: usize> Debug for MerkleTreeMmcs<P, PW, H, C, DIGEST_ELEMS>
Source§impl<P, PW, H, C, const DIGEST_ELEMS: usize> Mmcs<<P as PackedValue>::Value> for MerkleTreeMmcs<P, PW, H, C, DIGEST_ELEMS>where
P: PackedValue,
PW: PackedValue,
H: CryptographicHasher<P::Value, [PW::Value; DIGEST_ELEMS]> + CryptographicHasher<P, [PW; DIGEST_ELEMS]> + Sync,
C: PseudoCompressionFunction<[PW::Value; DIGEST_ELEMS], 2> + PseudoCompressionFunction<[PW; DIGEST_ELEMS], 2> + Sync,
PW::Value: Eq,
[PW::Value; DIGEST_ELEMS]: Serialize + for<'de> Deserialize<'de>,
impl<P, PW, H, C, const DIGEST_ELEMS: usize> Mmcs<<P as PackedValue>::Value> for MerkleTreeMmcs<P, PW, H, C, DIGEST_ELEMS>where
P: PackedValue,
PW: PackedValue,
H: CryptographicHasher<P::Value, [PW::Value; DIGEST_ELEMS]> + CryptographicHasher<P, [PW; DIGEST_ELEMS]> + Sync,
C: PseudoCompressionFunction<[PW::Value; DIGEST_ELEMS], 2> + PseudoCompressionFunction<[PW; DIGEST_ELEMS], 2> + Sync,
PW::Value: Eq,
[PW::Value; DIGEST_ELEMS]: Serialize + for<'de> Deserialize<'de>,
Source§fn open_batch<M: Matrix<P::Value>>(
&self,
index: usize,
prover_data: &MerkleTree<P::Value, PW::Value, M, DIGEST_ELEMS>,
) -> BatchOpening<P::Value, Self>
fn open_batch<M: Matrix<P::Value>>( &self, index: usize, prover_data: &MerkleTree<P::Value, PW::Value, M, DIGEST_ELEMS>, ) -> BatchOpening<P::Value, Self>
Opens a batch of rows from committed matrices.
Returns (openings, proof)
where openings
is a vector whose i
th element is
the j
th row of the ith matrix M[i]
, with
j == index >> (log2_ceil(max_height) - log2_ceil(M[i].height))
and proof
is the vector of sibling Merkle tree nodes allowing the verifier to
reconstruct the committed root.
Source§fn verify_batch(
&self,
commit: &Self::Commitment,
dimensions: &[Dimensions],
index: usize,
batch_proof: BatchOpeningRef<'_, P::Value, Self>,
) -> Result<(), Self::Error>
fn verify_batch( &self, commit: &Self::Commitment, dimensions: &[Dimensions], index: usize, batch_proof: BatchOpeningRef<'_, P::Value, Self>, ) -> Result<(), Self::Error>
Verifies an opened batch of rows with respect to a given commitment.
commit
: The merkle root of the tree.dimensions
: A vector of the dimensions of the matrices committed to.index
: The index of a leaf in the tree.opened_values
: A vector of matrix rows. Assume that the tallest matrix committed to has height2^n >= M_tall.height() > 2^{n - 1}
and thej
th matrix has height2^m >= Mj.height() > 2^{m - 1}
. Thenj
’th value of opened values must be the rowMj[index >> (m - n)]
.proof
: A vector of sibling nodes. Thei
th element should be the node at leveli
with index(index << i) ^ 1
.
Returns nothing if the verification is successful, otherwise returns an error.
type ProverData<M> = MerkleTree<<P as PackedValue>::Value, <PW as PackedValue>::Value, M, DIGEST_ELEMS>
type Commitment = Hash<<P as PackedValue>::Value, <PW as PackedValue>::Value, DIGEST_ELEMS>
type Proof = Vec<[<PW as PackedValue>::Value; DIGEST_ELEMS]>
type Error = MerkleTreeError
Source§fn commit<M: Matrix<P::Value>>(
&self,
inputs: Vec<M>,
) -> (Self::Commitment, Self::ProverData<M>)
fn commit<M: Matrix<P::Value>>( &self, inputs: Vec<M>, ) -> (Self::Commitment, Self::ProverData<M>)
Commits to a batch of matrices at once and returns both the commitment and associated prover data. Read more
Source§fn get_matrices<'a, M: Matrix<P::Value>>(
&self,
prover_data: &'a Self::ProverData<M>,
) -> Vec<&'a M>
fn get_matrices<'a, M: Matrix<P::Value>>( &self, prover_data: &'a Self::ProverData<M>, ) -> Vec<&'a M>
Returns references to all matrices originally committed to in the batch. Read more
Source§fn commit_matrix<M>(&self, input: M) -> (Self::Commitment, Self::ProverData<M>)where
M: Matrix<T>,
fn commit_matrix<M>(&self, input: M) -> (Self::Commitment, Self::ProverData<M>)where
M: Matrix<T>,
Convenience method to commit to a single matrix. Read more
Source§fn commit_vec(
&self,
input: Vec<T>,
) -> (Self::Commitment, Self::ProverData<DenseMatrix<T>>)
fn commit_vec( &self, input: Vec<T>, ) -> (Self::Commitment, Self::ProverData<DenseMatrix<T>>)
Convenience method to commit to a single column vector, treated as a column matrix. Read more
Source§fn get_matrix_heights<M>(&self, prover_data: &Self::ProverData<M>) -> Vec<usize>where
M: Matrix<T>,
fn get_matrix_heights<M>(&self, prover_data: &Self::ProverData<M>) -> Vec<usize>where
M: Matrix<T>,
Returns the height (number of rows) of each matrix in the batch. Read more
Source§fn get_max_height<M>(&self, prover_data: &Self::ProverData<M>) -> usizewhere
M: Matrix<T>,
fn get_max_height<M>(&self, prover_data: &Self::ProverData<M>) -> usizewhere
M: Matrix<T>,
Get the largest height of any committed matrix. Read more
impl<P: Copy, PW: Copy, H: Copy, C: Copy, const DIGEST_ELEMS: usize> Copy for MerkleTreeMmcs<P, PW, H, C, DIGEST_ELEMS>
Auto Trait Implementations§
impl<P, PW, H, C, const DIGEST_ELEMS: usize> Freeze for MerkleTreeMmcs<P, PW, H, C, DIGEST_ELEMS>
impl<P, PW, H, C, const DIGEST_ELEMS: usize> RefUnwindSafe for MerkleTreeMmcs<P, PW, H, C, DIGEST_ELEMS>
impl<P, PW, H, C, const DIGEST_ELEMS: usize> Send for MerkleTreeMmcs<P, PW, H, C, DIGEST_ELEMS>
impl<P, PW, H, C, const DIGEST_ELEMS: usize> Sync for MerkleTreeMmcs<P, PW, H, C, DIGEST_ELEMS>
impl<P, PW, H, C, const DIGEST_ELEMS: usize> Unpin for MerkleTreeMmcs<P, PW, H, C, DIGEST_ELEMS>
impl<P, PW, H, C, const DIGEST_ELEMS: usize> UnwindSafe for MerkleTreeMmcs<P, PW, H, C, DIGEST_ELEMS>
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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