Struct ark_cp6_782::FrParameters [−][src]
pub struct FrParameters;
Trait Implementations
type BigInt = BigInteger384
Let N
be the size of the multiplicative group defined by the field.
Then TWO_ADICITY
is the two-adicity of N
, i.e. the integer s
such that N = 2^s * t
for some odd integer t
. Read more
2^s root of unity computed by GENERATOR^t
An integer b
such that there exists a multiplicative subgroup
of size b^k
for some integer k
. Read more
The integer k
such that there exists a multiplicative subgroup
of size Self::SMALL_SUBGROUP_BASE^k
. Read more
GENERATOR^((MODULUS-1) / (2^s * SMALL_SUBGROUP_BASE^SMALL_SUBGROUP_BASE_ADICITY)) Used for mixed-radix FFT. Read more
MODULUS = 258664426012969094010652733694893533536393512754914660539884262666720468348340822774968888139573360124440321458177
R = 85013442423176922659824578519796707547925331718418265885885478904210582549405549618995257669764901891699128663912
GENERATOR = -5 Encoded in Montgomery form, so the value here is (-5 * R) % q = 92261639910053574722182574790803529333160366917737991650341130812388023949653897454961487930322210790384999596794
The number of bits needed to represent the Self::MODULUS
.
The number of bits that can be reliably stored.
(Should equal SELF::MODULUS_BITS - 1
) Read more
The number of bits that must be shaved from the beginning of the representation when randomly sampling. Read more
R2 = R^2 % Self::MODULUS
(Self::MODULUS - 1) / 2
t for 2^s * t = MODULUS - 1, and t coprime to 2.
(t - 1) / 2