Struct kimchi::circuits::polynomials::turshi::Transition

pub struct Transition<F>(_);

Trait Implementations

impl<F> Argument<F> for Transition<F>where F: PrimeField,

fn constraint_checks<T: ExprOps<F, BerkeleyChallengeTerm>>( env: &ArgumentEnv<F, T>, _cache: &mut Cache ) -> Vec<T>

Generates the constraints for the Cairo transition Accesses Curr and Next rows (Next only first 3 entries)

const ARGUMENT_TYPE: ArgumentType = _

The type of constraints that this will produce. This is important to enforce that we don’t combine the constraints with powers of alpha that collide with other mutually inclusive arguments.

const CONSTRAINTS: u32 = 3u32

The number of constraints created by the argument.

fn constraints(cache: &mut Cache) -> Vec<E<F>>

Returns the set of constraints required to prove this argument.

fn combined_constraints(alphas: &Alphas<F>, cache: &mut Cache) -> E<F>

Returns constraints safely combined via the passed combinator.