Struct CandidateSet 

pub struct CandidateSet { /* private fields */ }

How many polynomials a commitment still leaves open.

The rule: a layer charges its own draws over the whole set, then passes the set on.

A charge never shrinks the set, which the commitment fixed before anything above drew.

Unique decoding leaves one candidate, which costs a later draw nothing.

A list-decoding argument leaves a list, and each earlier draw gets one try per member.

What this type does and does not catch

It catches a count that is not a set size.

That is the one arithmetic error here that overstates a level.

A negative count would add bits to the term it is charged over.

Being copied rather than spent is what forwarding looks like in the signature.

It does not catch a draw nobody charged.

Nor a scheme reporting an open list as unique.

Both of those overstate a level, and no type can see either one.

A component supplying no evidence leaves the report with no number to give.

Past that, a missing term is caught by the tests that name each one.

An understated list is a claim about the proximity argument, checked where it lives.

Example

Two stacked layers, over a commitment leaving sixteen candidates open.

use p3_security::{CandidateSet, ErrorBits, SecurityTerm};

let candidates = CandidateSet::from_log2(4.0).unwrap();

// The inner layer charges its own reduction and forwards the set untouched.
let inner = SecurityTerm::new("inner", ErrorBits::from_log2(100.0)).over_candidates(candidates);
assert_eq!(inner.bits.bits(), 96.0);

// The outer layer charges its own draw over the same set, not over what is left of it.
let outer = SecurityTerm::new("outer", ErrorBits::from_log2(100.0)).over_candidates(candidates);
assert_eq!(outer.bits.bits(), 96.0);

Implementations

impl CandidateSet

pub const UNIQUE: Self

The commitment names one polynomial, so a later draw pays nothing.

pub fn from_log2(log2_size: f64) -> Option<Self>

A set of that many candidates, as a base-two logarithm.

Returns

Nothing when the argument is not a set size.

A set has at least one member and finitely many.

So a negative, infinite, or undefined argument names no set at all.

pub const fn log2_size(self) -> f64

Base-two logarithm of how many candidates are left open.

pub fn is_unique(self) -> bool

Whether the commitment already names one polynomial.

pub fn product(self, other: Self) -> Self

The set a draw faces when two independent commitments are both still open.

A prover chooses one member of each, so the two choices multiply.

Trait Implementations

impl Clone for CandidateSet

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 CandidateSet

impl Debug for CandidateSet

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

Formats the value using the given formatter.

impl PartialEq for CandidateSet

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for CandidateSet

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for CandidateSet

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 CandidateSet