Struct CpuMerkleTree 

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

Merkle tree with row-major codeword backing.

Each leaf corresponds to a row of backing_matrix (or a batch of rows when rows_per_query > 1). The digest_layers are built exactly as in MerkleTree, so proof construction and verification are identical.

Implementations

impl<F, Digest> CpuMerkleTree<F, Digest>

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

Construct a CpuMerkleTree 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 backing_matrix(&self) -> &RowMajorMatrix<F>

Returns a reference to the row-major codeword matrix.

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

Returns a reference to the digest layers.

pub fn rows_per_query(&self) -> usize

Number of rows batched into each Merkle leaf.

pub fn query_stride(&self) -> usize

Number of distinct query indices (= number of entries in the bottom digest layer).

pub fn proof_depth(&self) -> usize

Depth of a Merkle proof (number of sibling digests).

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

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

Returns the Merkle root (the single element of the topmost digest layer).

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

Returns the Merkle authentication path for the given query_idx.

impl<F: Copy, Digest> CpuMerkleTree<F, Digest>

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

Returns the opened rows for the given query index.

The rows are { index + t * query_stride() } for t in 0..rows_per_query.

Because the backing matrix is row-major, each row is a contiguous slice — no scatter-gather is needed (unlike the column-major variant).

Trait Implementations

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

fn clone(&self) -> CpuMerkleTree<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 CpuMerkleTree<F, Digest>

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

Formats the value using the given formatter.