Struct BinaryPcsRegime 

pub struct BinaryPcsRegime { /* private fields */ }

Validated mirror of the binary PCS schedule. Constructed by the protocol crate.

Implementations

impl BinaryPcsRegime

pub const fn new( challenge_field_bits: usize, num_variables: usize, log_inv_rate: usize, log_folding_factor: usize, num_queries: usize, query_pow_bits: usize, ) -> Option<Self>

Reject empty, overflowing, rate-one, or query-free schedules.

The challenge width must be a power-of-two tower level, one byte or wider. Every algebraic error below is measured against it.

pub fn queries_for_target( security_level: usize, log_inv_rate: usize, query_pow_bits: usize, ) -> usize

Query count reserving half the requested error for queries. Full enumeration has zero query error and releases that reserve in Self::max_opening_claims.

pub const fn challenge_field_bits(&self) -> usize

Bit width of the field every challenge is drawn from.

pub const fn query_pow_bits(&self) -> usize

The only credited grinding site: immediately before query sampling.

pub const fn queries_are_exhaustive(&self) -> bool

Whether every first-batch coset is authenticated, eliminating query error.

pub const fn field_error_numerator(&self) -> u128

Sum of every fold and sumcheck error, as a numerator over the challenge field size.

pub const fn field_security_bits(&self) -> usize

Whole-bit lower bound before adding opening claims or query error.

pub const fn max_security_bits(&self) -> usize

Field ceiling after reserving query error, before opening-claim batching.

pub fn query_security_bits(&self) -> f64

Query security before grinding; infinity when all cosets are checked.

pub fn max_opening_claims(&self, security_level: usize) -> usize

Conservative claim capacity for a positive total-error target.

Returns zero if the base error already exceeds its budget, queries are too weak, or the target is unsupported. In particular, subtraction underflow does not grant a spurious one-claim allowance. Configurations must reject zero capacity themselves.

pub fn opening_error(&self, num_claims: usize) -> ErrorBits

Union of the opening-claim, fold, sumcheck, and query errors.

Under unique decoding the candidate polynomial is unique at commitment time. This error therefore needs no candidate-list multiplier when composed with an AIR.

pub fn opening_term(&self, num_claims: usize) -> SecurityTerm

The opening error, labelled for a report.

Trait Implementations

impl Clone for BinaryPcsRegime

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 BinaryPcsRegime

impl Debug for BinaryPcsRegime

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

Formats the value using the given formatter.

impl Eq for BinaryPcsRegime

impl PartialEq for BinaryPcsRegime

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for BinaryPcsRegime