Struct ModDivideHint 

pub struct ModDivideHint;

ModDivide hint implementation.

Computes the modular quotient slope = dividend * divisor^{-1} (mod modulus) together with the integer quotient witnessing the reduction slope * divisor = dividend + quotient * modulus. Both outputs are set to zero when divisor is not invertible modulo modulus (e.g. divisor == 0 or gcd(divisor, modulus) > 1).

Implementations

impl ModDivideHint

pub const fn new() -> Self

pub fn call( builder: &CircuitBuilder, dividend: &[Wire], divisor: &[Wire], modulus: &[Wire], ) -> (Vec<Wire>, Vec<Wire>)

Modular division.

Computes dividend / divisor (mod modulus) = dividend * divisor^{-1} (mod modulus). Returns a pair (quotient, slope) where slope is the modular quotient and quotient is the non-negative integer satisfying slope * divisor = dividend + quotient * modulus. Both are set to zero when divisor is not invertible modulo modulus (e.g. divisor == 0).

This is a hint - a deterministic computation that happens only on the prover side. The result should be additionally constrained by using bignum circuits to check that slope * divisor = dividend + quotient * modulus.

Trait Implementations

impl Default for ModDivideHint

fn default() -> Self

Returns the “default value” for a type.

impl Hint for ModDivideHint

const NAME: &'static str = "binius.mod_divide"

Globally unique name for this hint, which the registry hashes into its key.

fn shape(&self, dimensions: &[usize]) -> (usize, usize)

Compute the gate’s input/output arity as a function of dimensions.

fn execute(&self, dimensions: &[usize], inputs: &[Word], outputs: &mut [Word])

Compute the hint’s outputs from its inputs at witness-generation time.