Enum LookupChallengeTerm

pub enum LookupChallengeTerm {
    Beta,
    Gamma,
    Alpha,
}

Variants

Beta

The challenge to compute 1/(beta + lookupvalue)

Gamma

The challenge to combine tuple sum gamma^i lookupvalue_i

Alpha

The challenge to combine constraints

Trait Implementations

impl<'a> AlphaChallengeTerm<'a> for LookupChallengeTerm

const ALPHA: Self = Self::Alpha

impl Clone for LookupChallengeTerm

fn clone(&self) -> LookupChallengeTerm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a, F: FftField> ColumnEnvironment<'a, F, LookupChallengeTerm, LookupChallenges<F>> for LookupEvalEnvironment<'a, F>

type Column = LookupColumns

The generic type of column the environment can use. In other words, with the multi-variate polynomial analogy, it is the variables the multi-variate polynomials are defined upon. i.e. for a polynomial P(X, Y, Z), the type will represent the variable X, Y and Z.

fn get_column(&self, col: &Self::Column) -> Option<&'a Evaluations<F, D<F>>>

Return the evaluation of the given column, over the domain.

fn get_domain(&self, d: Domain) -> D<F>

fn column_domain(&self, _col: &Self::Column) -> Domain

Defines the domain over which the column is evaluated

fn get_constants(&self) -> &Constants<F>

Return the constants parameters that the expression might use. For instance, it can be the matrix used by the linear layer in the permutation.

fn get_challenges(&self) -> &LookupChallenges<F>

Return the challenges, coined by the verifier.

fn vanishes_on_zero_knowledge_and_previous_rows( &self, ) -> &'a Evaluations<F, D<F>>

fn l0_1(&self) -> F

Return the value prod_{j != 1} (1 - omega^j), used for efficiently computing the evaluations of the unnormalized Lagrange basis polynomials.

impl Debug for LookupChallengeTerm

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for LookupChallengeTerm

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for LookupChallengeTerm

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

Formats the value using the given formatter.

impl<F: Field> Index<LookupChallengeTerm> for LookupChallenges<F>

type Output = F

The returned type after indexing.

fn index(&self, term: LookupChallengeTerm) -> &Self::Output

Performs the indexing (container[index]) operation.

impl PartialEq for LookupChallengeTerm

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for LookupChallengeTerm

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for LookupChallengeTerm

impl Eq for LookupChallengeTerm

impl StructuralPartialEq for LookupChallengeTerm