Module mul

Source
Expand description

Multiplication based on exponentiation.

The core idea of this method is to verify the equality $a \cdot b = c$ by checking if $(g^a)^b = g^{clow} \cdot (g^{2^{len(clow)}})^{chigh}$, where exponentiation proofs can be efficiently verified using the GKR exponentiation protocol.

You can read more information in Integer Multiplication in Binius.

Functionsยง

mul
u32_mul
u32 Multiplication based on plain lookups for static exponentiation and gkr_exp for dynamic exponentiation