Enum ZeroBitConvention 

pub enum ZeroBitConvention {
    Elided,
    Always,
    WhenPhaseRuns,
}

Whether a protocol describes a grinding step whose difficulty is zero.

A zero-bit grind is free to produce and vacuous to check.

Whether it is described at all is therefore a per-protocol choice.

The choice is not uniform across this workspace, so an absent step cannot be read as zero bits everywhere.

Variants

Elided

The step is described only when the difficulty is positive.

    bits == 0  ->  no step at all
    bits >  0  ->  one step carrying `bits`

Always

The step is described whatever the difficulty, zero included.

Used where the witness travels in the proof unconditionally.

The proof layout then does not depend on the difficulty.

WhenPhaseRuns

The step is described, carrying its exact difficulty, only while its challenge’s phase runs at all.

An absent step then means the phase did not run, so nothing was ground.

Nothing is credited either: the term the site would boost is itself absent from the report.

The lookup argument is the case in point: with no interactions it contributes no term.

Trait Implementations

impl Clone for ZeroBitConvention

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 ZeroBitConvention

impl Debug for ZeroBitConvention

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

Formats the value using the given formatter.

impl Eq for ZeroBitConvention

impl PartialEq for ZeroBitConvention

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ZeroBitConvention