Enum kimchi::circuits::berkeley_columns::BerkeleyChallengeTerm

pub enum BerkeleyChallengeTerm {
    Alpha,
    Beta,
    Gamma,
    JointCombiner,
}

The challenge terms used in Berkeley.

Variants

Alpha

Used to combine constraints

Beta

The first challenge used in the permutation argument

Gamma

The second challenge used in the permutation argument

JointCombiner

A challenge used to columns of a lookup table

Trait Implementations

impl<'a> AlphaChallengeTerm<'a> for BerkeleyChallengeTerm

const ALPHA: Self = Self::Alpha

impl Clone for BerkeleyChallengeTerm

fn clone(&self) -> BerkeleyChallengeTerm

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, F: FftField> ColumnEnvironment<'a, F, BerkeleyChallengeTerm, BerkeleyChallenges<F>> for Environment<'a, F>

type Column = Column

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) -> &BerkeleyChallenges<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 BerkeleyChallengeTerm

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for BerkeleyChallengeTerm

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for BerkeleyChallengeTerm

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

Formats the value using the given formatter.

impl<F> ExprOps<F, BerkeleyChallengeTerm> for Expr<ConstantExpr<F, BerkeleyChallengeTerm>, Column>where F: PrimeField, Expr<ConstantExpr<F, BerkeleyChallengeTerm>, Column>: Display,

fn two_pow(pow: u64) -> Self

2^pow

fn two_to_limb() -> Self

2^{LIMB_BITS}

fn two_to_2limb() -> Self

2^{2 * LIMB_BITS}

fn two_to_3limb() -> Self

2^{3 * LIMB_BITS}

fn double(&self) -> Self

Double the value

fn square(&self) -> Self

Compute the square of this value

fn pow(&self, p: u64) -> Self

Raise the value to the given power

fn boolean(&self) -> Self

Constrain to boolean

fn crumb(&self) -> Self

Constrain to crumb (i.e. two bits)

fn literal(x: F) -> Self

Create a literal

fn witness(row: CurrOrNext, col: usize, _: Option<&ArgumentData<F>>) -> Self

fn coeff(col: usize, _: Option<&ArgumentData<F>>) -> Self

Coefficient

fn constant( expr: ConstantExpr<F, BerkeleyChallengeTerm>, _: Option<&ArgumentData<F>> ) -> Self

Create a constant

fn cache(&self, cache: &mut Cache) -> Self

Cache item

impl<F: Field> ExprOps<F, BerkeleyChallengeTerm> for F

fn two_pow(pow: u64) -> Self

2^pow

fn two_to_limb() -> Self

2^{LIMB_BITS}

fn two_to_2limb() -> Self

2^{2 * LIMB_BITS}

fn two_to_3limb() -> Self

2^{3 * LIMB_BITS}

fn double(&self) -> Self

Double the value

fn square(&self) -> Self

Compute the square of this value

fn pow(&self, p: u64) -> Self

Raise the value to the given power

fn boolean(&self) -> Self

Constrain to boolean

fn crumb(&self) -> Self

Constrain to crumb (i.e. two bits)

fn literal(x: F) -> Self

Create a literal

fn witness(row: CurrOrNext, col: usize, env: Option<&ArgumentData<F>>) -> Self

fn coeff(col: usize, env: Option<&ArgumentData<F>>) -> Self

Coefficient

fn constant( expr: ConstantExpr<F, BerkeleyChallengeTerm>, env: Option<&ArgumentData<F>> ) -> Self

Create a constant

fn cache(&self, _: &mut Cache) -> Self

Cache item

impl<F: Field> Index<BerkeleyChallengeTerm> for BerkeleyChallenges<F>

type Output = F

The returned type after indexing.

fn index(&self, challenge_term: BerkeleyChallengeTerm) -> &Self::Output

Performs the indexing (container[index]) operation.

impl PartialEq<BerkeleyChallengeTerm> for BerkeleyChallengeTerm

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

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

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

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

impl Serialize for BerkeleyChallengeTerm

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 BerkeleyChallengeTerm

impl Eq for BerkeleyChallengeTerm

impl StructuralEq for BerkeleyChallengeTerm

impl StructuralPartialEq for BerkeleyChallengeTerm