Struct MerkleTree 

pub struct MerkleTree<F, Digest> { /* private fields */ }

Implementations

impl<F, Digest> MerkleTree<F, Digest>

pub fn backing_matrix(&self) -> &ColMajorMatrix<F>

The matrix that is used to form the leaves of the Merkle tree, which are in turn hashed into the bottom digest layer.

This is typically the codeword matrix in hash-based PCS.

pub fn digest_layers(&self) -> &Vec<Vec<Digest>>

impl<F, Digest> MerkleTree<F, Digest>

pub fn rows_per_query(&self) -> usize

impl<F, Digest> MerkleTree<F, Digest>

pub fn query_stride(&self) -> usize

pub fn proof_depth(&self) -> usize

impl<F, Digest: Clone> MerkleTree<F, Digest>

pub fn root(&self) -> Result<Digest, StackedPcsError>

pub fn query_merkle_proof( &self, query_idx: usize, ) -> Result<Vec<Digest>, StackedPcsError>

impl<EF: Field, Digest> MerkleTree<EF, Digest>

where Digest: Copy + Send + Sync,

pub fn new<H: MerkleHasher<Digest = Digest>>( hasher: &H, matrix: ColMajorMatrix<EF>, rows_per_query: usize, ) -> Result<Self, StackedPcsError>

where EF: ExtensionField<H::F>,

pub unsafe fn from_raw_parts( backing_matrix: ColMajorMatrix<EF>, digest_layers: Vec<Vec<Digest>>, rows_per_query: usize, ) -> Self

Construct a MerkleTree from pre-computed parts without validation.

Safety

The caller must guarantee:

• digest_layers form a valid Merkle tree over backing_matrix: the leaf layer contains correct hashes of the matrix rows and each subsequent layer contains correct compressions of consecutive pairs from the previous layer, terminating in a single root digest.
• rows_per_query is a power of two and does not exceed the number of leaves (i.e., backing_matrix.height().next_power_of_two()).
• The leaf layer length equals backing_matrix.height().next_power_of_two() / rows_per_query.

Violating these invariants will produce incorrect Merkle proofs or panics in downstream query/verification code.

pub fn get_opened_rows( &self, index: usize, ) -> Result<Vec<Vec<EF>>, StackedPcsError>

Returns the ordered set of opened rows for the given query index. The rows are { query_idx + t * query_stride() } for t in 0..rows_per_query.

Trait Implementations

impl<F: Clone, Digest: Clone> Clone for MerkleTree<F, Digest>

fn clone(&self) -> MerkleTree<F, Digest>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F: Debug, Digest: Debug> Debug for MerkleTree<F, Digest>

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

Formats the value using the given formatter.

impl<'de, F, Digest> Deserialize<'de> for MerkleTree<F, Digest>

where F: Deserialize<'de>, Digest: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<F, Digest> Serialize for MerkleTree<F, Digest>

where F: Serialize, Digest: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.