Struct BigUintModPowHint 

pub struct BigUintModPowHint;

Implementations

impl BigUintModPowHint

pub const fn new() -> Self

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

Modular exponentiation.

Computes (base^exp) % modulus. This is a hint - a deterministic computation that happens only on the prover side. The result should be additionally constrained using bignum circuits.

Trait Implementations

impl Default for BigUintModPowHint

fn default() -> Self

Returns the “default value” for a type.

impl Hint for BigUintModPowHint

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

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.