Skip to main content

Module common

Module common 

Source

Structs§

IntMulOutput
Phase1Output
Output of Phase 1: GKR reduction of the exponentiation product tree.
Phase2Output
Phase3Output
Output of Phase 3: batched Frobenius selector sumcheck and LO * HI product sumcheck.
Phase4Output
Output of Phase 4: the three constant-base GKR product trees reduced to per-limb evaluation claims.

Constants§

LIMB_BITS
The bit width of one exponent limb; the lookup table has 2^LIMB_BITS rows.
LOG_N_LIMBS
The log2 of the number of limbs each exponent word is split into for the Phase 4/5 fixed-base lookup.
N_LIMBS
The number of exponent limbs per word.
N_LIMB_COLUMNS
The number of looked-up limb columns: one per limb of $\widetilde{a}$, $\widetilde{c}{\textsf{lo}}$, and $\widetilde{c}{\textsf{hi}}$.

Functions§

eval_power_table_mle
Evaluate the MLE of the fixed-base power table i ↦ g^i at a point.
frobenius_twist
Apply inverse Frobenius twists to the leaf evaluation claims from Phase 1.
limb_column_twists
The Frobenius twist amounts (numbers of squarings) mapping each looked-up limb column onto the shared generator table, ordered [a limbs, c_lo limbs, c_hi limbs].
twist_limb_claim
Twist a limb-column evaluation claim onto the shared generator table.