Struct ark_ed_on_bls12_381::fq::FqParameters [−][src]
pub struct FqParameters;
Trait Implementations
type BigInt = BigInteger256
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 = 52435875175126190479447740508185965837690552500527637822603658699938581184513
R = 10920338887063814464675503992315976177888879664585288394250266608035967270910
GENERATOR = 7 Encoded in Montgomery form, so the value here is 7 * R % q = 24006497034320510773280787438025867407531605151569380937148207556313189711857
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