Struct ProofShape 

pub struct ProofShape {
    pub stir_queries: usize,
    pub opened_base_elements: usize,
    pub opened_extension_elements: usize,
    pub merkle_digests: usize,
    pub sent_base_elements: usize,
    pub sent_extension_elements: usize,
    pub grinding_bits: usize,
}

Everything a schedule fixes about the size of its proofs and the work of checking one.

Each figure is read off the derived schedule and the claim count, never off a witness.

Fields

stir_queries: usize

Codeword positions opened across every round, one Merkle check each.

opened_base_elements: usize

Alphabet elements opened from the first codeword.

opened_extension_elements: usize

Challenge-field elements opened from the folded codewords.

merkle_digests: usize

Digests the proof carries, which are the folded codewords’ roots and their opened paths.

No prefix a path shares with another is discounted.

sent_base_elements: usize

Alphabet elements the proof carries outside the openings, which are its grinding witnesses.

sent_extension_elements: usize

Challenge-field elements the proof carries outside the openings.

grinding_bits: usize

Hardest grinding any phase of the schedule demands.

Implementations

impl ProofShape

pub fn of<EF, F, Challenger>( config: &WhirConfig<EF, F, Challenger>, opened_values: usize, ) -> Self

where F: Field, EF: ExtensionField<F>, Challenger: FieldChallenger<F> + GrindingChallenger<Witness = F>,

Read the shape of every proximity opening a schedule can produce.

The claim count fixes how many opened values travel beside the transcript.

pub fn of_bit_readings<EF, Challenger>( config: &WhirConfig<EF, EF, Challenger>, num_claims: usize, successor_tensors: bool, ) -> Self

where EF: Field + TowerLevel, Challenger: FieldChallenger<EF> + GrindingChallenger<Witness = EF>,

Read the shape of every bit-witness opening a schedule can produce for this many claims.

One batched reduction travels beside a proximity opening of its one surviving point.

Each claim sends its elements by rows. The batch sends one run of degree-two rounds and the value it survives with.

pub const fn max_bytes( &self, base_element_bytes: usize, extension_element_bytes: usize, digest_bytes: usize, ) -> usize

Bytes a proof of this shape cannot exceed, given the width of each thing it carries.

A serializer that pads a value beyond its own width invalidates the figure.

Framing the serializer adds around a list is the caller’s to allow for.

Trait Implementations

impl Clone for ProofShape

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for ProofShape

impl Debug for ProofShape

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

Formats the value using the given formatter.

impl Eq for ProofShape

impl PartialEq for ProofShape

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for ProofShape