Struct BinaryPcsShape 

pub struct BinaryPcsShape {
    pub num_variables: usize,
    pub log_folding_factor: usize,
    pub num_oracles: usize,
    pub final_codeword_len: usize,
    pub pow_bits: usize,
    pub pair_bits: usize,
    pub num_pairs: usize,
}

Numbers that fix the transcript of one binary-tower PCS run.

Both sides derive this from their own configuration, never from a proof.

Fields

num_variables: usize

Arity of the committed polynomial.

log_folding_factor: usize

Variables each fold batch consumes.

num_oracles: usize

Folded oracles committed between the fold batches.

The last batch sends its codeword in the clear, so it commits nothing.

final_codeword_len: usize

Symbols the final codeword carries.

pow_bits: usize

Grinding difficulty guarding the query positions.

pair_bits: usize

Bit width of one sampled fold pair.

num_pairs: usize

Distinct pairs the run opens.

Implementations

impl BinaryPcsShape

pub const fn new(config: &BinaryPcsConfig) -> Self

Derive the shape of one run from its configuration.

Arguments

• config: the parameter set both sides agreed on.

Panics

When the base domain does not hold a whole number of fold pairs.

pub fn pattern<F, EF>(&self) -> InteractionPattern

where F: TranscriptField, EF: Field + AlgebraIdentity<F>,

Describe the transcript this shape fixes.

The fold rounds are absent: each seeds its own sumcheck sub-transcript.

    per oracle  ->  one Merkle root
    closing     ->  final codeword, grind, query positions

Panics

Never in practice.

A flat sequence of leaf steps always passes structural validation.

pub fn domain_separator<F, EF>(&self) -> DomainSeparator<FieldUnit<F>>

where F: TranscriptField, EF: Field + AlgebraIdentity<F>,

Bind the protocol identity and this shape into a seed.

Soundness

The step counts and widths ride the fingerprint on their own.

The arity and the folding factor move no step, so they are bound as chunks.

Without them, a run folding every variable at once shares a description.

Every other arity at the same rate lands on it.

    nv = 8, k = 8   ->  one batch, no oracle, rate-wide final word
    nv = 9, k = 9   ->  the same three numbers

The surrounding layout binds the arity too.

This makes the seed self-contained rather than closing a reachable gap.

Trait Implementations

impl Clone for BinaryPcsShape

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 BinaryPcsShape

impl Debug for BinaryPcsShape

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

Formats the value using the given formatter.

impl Eq for BinaryPcsShape

impl PartialEq for BinaryPcsShape

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for BinaryPcsShape