Struct ModInverseHint 

pub struct ModInverseHint;

ModInverse hint implementation

Implementations

impl ModInverseHint

pub const fn new() -> Self

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

Modular inverse.

Computes the modular inverse of base modulo modulus. Returns a pair (quotient, inverse) where both numbers are Bézout coefficients when base and modulus are coprime. Both numbers are set to zero if gcd(base, modulus) > 1.

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 base * inverse = 1 + quotient * modulus.

Trait Implementations

impl Default for ModInverseHint

fn default() -> Self

Returns the “default value” for a type.

impl Hint for ModInverseHint

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

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.