Struct ark_ed_on_bls12_377::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 = 8444461749428370424248824938781546531375899335154063827935233455917409239041
R = 6014086494747379908336260804527802945383293308637734276299549080986809532403
GENERATOR = 22 Encoded in Montgomery form, so the value is (22 * R) % q = 5642976643016801619665363617888466827793962762719196659561577942948671127251
(r - 1)/2 = 4222230874714185212124412469390773265687949667577031913967616727958704619520
t = (r - 1) / 2^s = 60001509534603559531609739528203892656505753216962260608619555
(t - 1) / 2 = 30000754767301779765804869764101946328252876608481130304309777
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