Struct GrindingSites 

pub struct GrindingSites {
    pub out_of_domain: usize,
    pub batch_combination: usize,
    pub lookup_challenge: usize,
}

Where a STARK grinds, in bits per site.

Every field defaults to 0 — a protocol declares only the sites it actually uses, and a default-constructed value is neutral.

Each site is consumed by the term whose round it opens:

• Self::out_of_domain is applied to the DEEP-ALI term by crate::stark::proven_security_report, crate::stark::conjectured_security_report, and crate::stark::legacy_security_report.
• Self::batch_combination is applied to the batched-openings term by crate::stark::proven_security_report, crate::stark::conjectured_security_report, and crate::stark::legacy_security_report.
• Self::lookup_challenge is applied to the LogUp fingerprint term by crate::logup::security_term.

The low-degree test’s own grinding sites (e.g. FRI’s query- and commit-phase proof-of-work) are not modeled here: a crate::ldt::LowDegreeTest implementation carries those itself (FriRegime::query_pow_bits / FriRegime::commit_pow_bits) and folds them into the terms it returns, so the composite never re-applies them — a site in this struct for them would be read back out unchanged, never consulted.

A protocol grinding at a site this crate does not model builds its own crate::report::SecurityTerm, applies boost to it, and passes it through extras — no change to this struct is needed.

Fields

out_of_domain: usize

Bits ground before the DEEP out-of-domain point is sampled.

batch_combination: usize

Bits ground before the challenge that random-linear-combines the committed codewords into the single low-degree-test instance.

This is the opening-batching challenge of the polynomial commitment scheme (alpha in p3_fri::TwoAdicFriPcs::open), not a FRI folding challenge — those are FriRegime::commit_pow_bits, carried by the low-degree test itself. It is credited only to the term crate::report::BATCH_LABEL names, which exists only when more than one codeword is batched (InstanceShape::num_batched_functions >= 2); with nothing to batch there is no such round and these bits buy nothing.

The proven, conjectured, and legacy composites all model this round. They grade it in different proximity regimes, but the prover pays the same work regardless.

lookup_challenge: usize

Bits ground before the lookup / permutation argument’s challenges are sampled.

Implementations

impl GrindingSites

pub const NONE: Self

No grinding at any site — the neutral element, usable in const contexts where Default::default is not available.

Trait Implementations

impl Clone for GrindingSites

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 GrindingSites

impl Debug for GrindingSites

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

Formats the value using the given formatter.

impl Default for GrindingSites

fn default() -> Self

Returns the “default value” for a type.

impl Eq for GrindingSites

impl PartialEq for GrindingSites

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for GrindingSites

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for GrindingSites