Struct CompleteAdd 

pub struct CompleteAdd<F>(PhantomData<F>);

Implementation of the CompleteAdd gate It uses the constraints

(x2 - x1) * s = y2 - y1 s^2 = x1 + x2 + x3 y3 = s (x1 - x3) - y1

for addition and

2 * s * y1 = 3 * x1^2 s^2 = 2 x1 + x3 y3 = s (x1 - x3) - y1

for doubling.

See here for the formulas used.

Tuple Fields

0: PhantomData<F>

Trait Implementations

impl<F> Argument<F> for CompleteAdd<F>

where F: PrimeField,

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

The number of constraints created by the argument.

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

Constraints for this 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.

impl<F: Default> Default for CompleteAdd<F>

fn default() -> CompleteAdd<F>

Returns the “default value” for a type.