Trait prio::flp::Gadget

pub trait Gadget<F: FftFriendlyFieldElement>: Debug {
    // Required methods
    fn call(&mut self, inp: &[F]) -> Result<F, FlpError>;
    fn call_poly(
        &mut self,
        outp: &mut [F],
        inp: &[Vec<F>]
    ) -> Result<(), FlpError>;
    fn arity(&self) -> usize;
    fn degree(&self) -> usize;
    fn calls(&self) -> usize;
    fn as_any(&mut self) -> &mut dyn Any;
}

A gadget, a non-affine arithmetic circuit that is called when evaluating a validity circuit.

Required Methods

fn call(&mut self, inp: &[F]) -> Result<F, FlpError>

Evaluates the gadget on input inp and returns the output.

fn call_poly(&mut self, outp: &mut [F], inp: &[Vec<F>]) -> Result<(), FlpError>

Evaluate the gadget on input of a sequence of polynomials. The output is written to outp.

fn arity(&self) -> usize

Returns the arity of the gadget. This is the length of inp passed to call or call_poly.

fn degree(&self) -> usize

Returns the circuit’s arithmetic degree. This determines the minimum length the outp buffer passed to call_poly.

fn calls(&self) -> usize

Returns the number of times the gadget is expected to be called.

fn as_any(&mut self) -> &mut dyn Any

This call is used to downcast a Box<dyn Gadget<F>> to a concrete type.

Implementors

impl<F, G> Gadget<F> for ParallelSumMultithreaded<F, G>

where F: FftFriendlyFieldElement + Sync + Send, G: 'static + Gadget<F> + Clone + Sync + Send,

impl<F: FftFriendlyFieldElement> Gadget<F> for Mul<F>

impl<F: FftFriendlyFieldElement> Gadget<F> for PolyEval<F>

impl<F: FftFriendlyFieldElement, G: 'static + Gadget<F>> Gadget<F> for ParallelSum<F, G>