Struct ark_bls12_377::FrConfig

source ·
pub struct FrConfig;

Trait Implementations§

Sets a = -a.

The modulus of the field.
A multiplicative generator of the field. Self::GENERATOR is an element having multiplicative order Self::MODULUS - 1.
2^s root of unity computed by GENERATOR^t
Sets a = a + b.
Sets a = a - b.
Sets a = 2 * a.
This modular multiplication algorithm uses Montgomery reduction for efficient implementation. It also additionally uses the “no-carry optimization” outlined here if Self::MODULUS has (a) a non-zero MSB, and (b) at least one zero bit in the rest of the modulus.
Let M be the power of 2^64 nearest to Self::MODULUS_BITS. Then R = M % Self::MODULUS.
R2 = R^2 % Self::MODULUS
INV = -MODULUS^{-1} mod 2^64
An integer b such that there exists a multiplicative subgroup of size b^k for some integer k.
The integer k such that there exists a multiplicative subgroup of size Self::SMALL_SUBGROUP_BASE^k.
GENERATOR^((MODULUS-1) / (2^s * SMALL_SUBGROUP_BASE^SMALL_SUBGROUP_BASE_ADICITY)). Used for mixed-radix FFT.
Precomputed material for use when computing square roots. The default is to use the standard Tonelli-Shanks algorithm.

Auto Trait Implementations§

Blanket Implementations§

Gets the TypeId of self. Read more
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Should always be Self
The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion error.
Performs the conversion.