Struct ConstantArityStrategy 

pub struct ConstantArityStrategy {
    pub arity: usize,
}

Strategy that uses a constant fold arity.

Fields

arity: usize

The fold arity to use for each reduction step.

Implementations

impl ConstantArityStrategy

pub const fn new(arity: usize) -> Self

Creates a new strategy with the given arity.

pub fn with_optimal_arity<F, MerkleScheme>( _merkle_scheme: &MerkleScheme, approx_log_code_len: usize, ) -> Self

where F: Field, MerkleScheme: MerkleTreeScheme<F>,

Creates a strategy with an estimated optimal arity.

Uses a heuristic to estimate the optimal FRI folding arity that minimizes proof size.

Arguments

• _merkle_scheme - the Merkle tree scheme (used to infer digest size)
• approx_log_code_len - approximate log2 of the codeword length

Trait Implementations

impl AritySelectionStrategy for ConstantArityStrategy

fn choose_arities<F, MerkleScheme>( &self, merkle_scheme: &MerkleScheme, log_msg_len: usize, log_inv_rate: usize, n_test_queries: usize, ) -> Vec<usize>

where F: Field, MerkleScheme: MerkleTreeScheme<F>,

impl Clone for ConstantArityStrategy

fn clone(&self) -> ConstantArityStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for ConstantArityStrategy

impl Debug for ConstantArityStrategy

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

Formats the value using the given formatter.