Struct ark_r1cs_std::poly::domain::vanishing_poly::VanishingPolynomial

pub struct VanishingPolynomial<F: Field> {
    pub constant_term: F,
    pub dim_h: u64,
    pub order_h: u64,
}

Struct describing vanishing polynomial for a multiplicative coset H where |H| is a power of 2. As H is a coset, every element can be described as h*g^i and therefore has vanishing polynomial Z_H(x) = x^|H| - h^|H|

Fields

constant_term: F

h^|H|

dim_h: u64

log_2(|H|)

order_h: u64

|H|

Implementations

impl<F: PrimeField> VanishingPolynomial<F>

pub fn new(offset: F, dim_h: u64) -> Self

returns a VanishingPolynomial of coset H = h<g>.

pub fn evaluate(&self, x: &F) -> F

Evaluates the vanishing polynomial without generating the constraints.

pub fn evaluate_constraints(
    &self,
    x: &FpVar<F>
) -> Result<FpVar<F>, SynthesisError>

Evaluates the constraints and just gives you the gadget for the result. Caution for use in holographic lincheck: The output has 2 entries in one matrix

Trait Implementations

impl<F: Clone + Field> Clone for VanishingPolynomial<F>

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

Returns a copy of the value.

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

Performs copy-assignment from source.