jf_relation::gadgets::ultraplonk

Module mod_arith

Source
Expand description

Modular arithmetic gates

Structs§

  • A field element represented by: p = p.0 + 2^m * p.1. The struct is useful in modular multiplication as the multiplication of two components (e.g. p.0 * q.0) won’t overflow the prime field. Warning: for performance reasons, when this struct is used, we will assume 2^m - two_power_m without checking.
  • Represent variable of an Fp element: elem = witness[vars.0] + 2^m * witness[vars.1] Warning: for performance reasons, when this struct is used, we will assume 2^m - two_power_m without checking.