Struct prio::pcp::types::Boolean

pub struct Boolean<F: FieldElement> { /* fields omitted */ }

Values of this type encode a simple boolean (either true or false).

Implementations

impl<F: FieldElement> Boolean<F>

pub fn new(b: bool) -> Self

Encodes a boolean as a value of this type.

Trait Implementations

impl<F: Clone + FieldElement> Clone for Boolean<F>

fn clone(&self) -> Boolean<F>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<F: Debug + FieldElement> Debug for Boolean<F>

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

Formats the value using the given formatter.

impl<F: PartialEq + FieldElement> PartialEq<Boolean<F>> for Boolean<F>

fn eq(&self, other: &Boolean<F>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Boolean<F>) -> bool

This method tests for !=.

impl<F: FieldElement> TryFrom<((), &'_ [F])> for Boolean<F>

type Error = TypeError

The type returned in the event of a conversion error.

fn try_from(val: ((), &[F])) -> Result<Self, TypeError>

Performs the conversion.

impl<F: FieldElement> Value for Boolean<F>

type Field = F

The finite field used for this type.

type Param = ()

Parameters used to construct a value of this type from a vector of field elements.

fn valid(
    &self,
    g: &mut Vec<Box<dyn Gadget<F>>>,
    rand: &[F]
) -> Result<F, PcpError>

Evaluates the validity circuit on the given input (i.e., self) and returns the output. joint_rand is the joint randomness shared by the prover and verifier. g is the sequence of gadgets called by the circuit.

fn valid_gadget_calls(&self) -> Vec<usize>

The number of calls to the gadget made when evaluating the validity circuit.

fn joint_rand_len(&self) -> usize

The length of the random input used by both the prover and the verifier.

fn prove_rand_len(&self) -> usize

The length of the random input consumed by the prover to generate a proof. This is the same as the sum of the arity of each gadget in the validity circuit.

fn query_rand_len(&self) -> usize

The length of the random input consumed by the verifier to make queries against inputs and proofs. This is the same as the number of gadgets in the validity circuit.

fn gadget(&self) -> Vec<Box<dyn Gadget<F>>>

Returns the sequence of gadgets associated with the validity circuit.

fn as_slice(&self) -> &[F]

Returns a reference to the underlying data.

fn param(&self) -> Self::Param

Returns a copy of the associated type parameters for this value.

fn set_leader(&mut self, _is_leader: bool)

When verifying a proof over secret shared data, this method may be used to distinguish the “leader” share from the others. This is useful, for example, when some of the gadget inputs are constants used for both proof generation and verification.

impl<F: Eq + FieldElement> Eq for Boolean<F>

impl<F: FieldElement> StructuralEq for Boolean<F>

impl<F: FieldElement> StructuralPartialEq for Boolean<F>