Struct LookupChallenges

pub struct LookupChallenges<F> {
    pub beta: F,
    pub gamma: F,
    pub alpha: F,
}

Fields

beta: F

gamma: F

alpha: F

Trait Implementations

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<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.