Struct snarkvm_curves::bls12_377::FqParameters [−][src]
pub struct FqParameters;
Trait Implementations
type BigInteger = BigInteger
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
.
2^s * t = MODULUS - 1 with t odd. This is the two-adicity of the prime. 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
GENERATOR = -5
MODULUS = 258664426012969094010652733694893533536393512754914660539884262666720468348340822774968888139573360124440321458177
T = (MODULUS - 1) // 2^S = 3675842578061421676390135839012792950148785745837396071634149488243117337281387659330802195819009059
(T - 1) // 2 = 1837921289030710838195067919506396475074392872918698035817074744121558668640693829665401097909504529
The number of bits that can be reliably stored.
(Should equal SELF::MODULUS_BITS - 1
) Read more
The number of bits needed to represent the Self::MODULUS
.
(Self::MODULUS - 1) / 2
R = 2^256 % Self::MODULUS
R2 = R^2 % Self::MODULUS
The number of bits that must be shaved from the beginning of the representation when randomly sampling. Read more
Auto Trait Implementations
impl RefUnwindSafe for FqParameters
impl Send for FqParameters
impl Sync for FqParameters
impl Unpin for FqParameters
impl UnwindSafe for FqParameters