Struct BinaryWhirBudget 

pub struct BinaryWhirBudget {
    pub max_stir_queries: usize,
    pub max_proof_bytes: usize,
    pub max_grinding_bits: usize,
}

A ceiling a deployment refuses to prove above.

A schedule is graded against it before any witness is touched.

Fields

max_stir_queries: usize

Most codeword positions a verifier will open.

max_proof_bytes: usize

Most bytes a serialized proof may occupy.

max_grinding_bits: usize

Hardest grinding a prover will accept.

Implementations

impl BinaryWhirBudget

pub const PRODUCTION: Self

The ceiling a deployment of this scheme is expected to hold to.

Two hundred openings keep a verifier inside a few milliseconds of hashing.

A quarter of a megabyte is the size at which a proof stops fitting comfortably on a wire.

Twenty-four grinding bits cost a prover well under a second.

pub const fn check_shape( &self, shape: &ProofShape, base_element_bytes: usize, extension_element_bytes: usize, digest_bytes: usize, ) -> Result<(), BudgetError>

Grade a schedule against the ceiling, before anything is committed.

Errors

Returns an error naming the first figure the schedule exceeds.

pub const fn check_bytes(&self, bytes: usize) -> Result<(), BudgetError>

Grade a proof that was produced, against the same ceiling.

Errors

Returns an error when the serialized proof is larger than the ceiling allows.

Trait Implementations

impl Clone for BinaryWhirBudget

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 BinaryWhirBudget

impl Debug for BinaryWhirBudget

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

Formats the value using the given formatter.

impl Eq for BinaryWhirBudget

impl PartialEq for BinaryWhirBudget

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for BinaryWhirBudget