Struct ark_ed_on_bls12_381::FrConfig
source · pub struct FrConfig;
Trait Implementations§
source§impl MontConfig<4> for FrConfig
impl MontConfig<4> for FrConfig
source§fn neg_in_place(a: &mut Fp<MontBackend<FrConfig, { _ }>, { _ }>)
fn neg_in_place(a: &mut Fp<MontBackend<FrConfig, { _ }>, { _ }>)
Sets a = -a
.
source§const GENERATOR: Fp<MontBackend<FrConfig, { _ }>, { _ }> = _
const GENERATOR: Fp<MontBackend<FrConfig, { _ }>, { _ }> = _
A multiplicative generator of the field.
Self::GENERATOR
is an element having multiplicative order
Self::MODULUS - 1
. Read moresource§const TWO_ADIC_ROOT_OF_UNITY: Fp<MontBackend<FrConfig, { _ }>, { _ }> = _
const TWO_ADIC_ROOT_OF_UNITY: Fp<MontBackend<FrConfig, { _ }>, { _ }> = _
2^s root of unity computed by GENERATOR^t
source§fn add_assign(
a: &mut Fp<MontBackend<FrConfig, { _ }>, { _ }>,
b: &Fp<MontBackend<FrConfig, { _ }>, { _ }>
)
fn add_assign(
a: &mut Fp<MontBackend<FrConfig, { _ }>, { _ }>,
b: &Fp<MontBackend<FrConfig, { _ }>, { _ }>
)
Sets
a = a + b
.source§fn sub_assign(
a: &mut Fp<MontBackend<FrConfig, { _ }>, { _ }>,
b: &Fp<MontBackend<FrConfig, { _ }>, { _ }>
)
fn sub_assign(
a: &mut Fp<MontBackend<FrConfig, { _ }>, { _ }>,
b: &Fp<MontBackend<FrConfig, { _ }>, { _ }>
)
Sets
a = a - b
.source§fn double_in_place(a: &mut Fp<MontBackend<FrConfig, { _ }>, { _ }>)
fn double_in_place(a: &mut Fp<MontBackend<FrConfig, { _ }>, { _ }>)
Sets
a = 2 * a
.source§fn mul_assign(
a: &mut Fp<MontBackend<FrConfig, { _ }>, { _ }>,
b: &Fp<MontBackend<FrConfig, { _ }>, { _ }>
)
fn mul_assign(
a: &mut Fp<MontBackend<FrConfig, { _ }>, { _ }>,
b: &Fp<MontBackend<FrConfig, { _ }>, { _ }>
)
fn sum_of_products<const M: usize>(
a: &[Fp<MontBackend<FrConfig, { _ }>, { _ }>; M],
b: &[Fp<MontBackend<FrConfig, { _ }>, { _ }>; M]
) -> Fp<MontBackend<FrConfig, { _ }>, { _ }>
source§const SMALL_SUBGROUP_BASE: Option<u32> = None
const SMALL_SUBGROUP_BASE: Option<u32> = None
An integer
b
such that there exists a multiplicative subgroup
of size b^k
for some integer k
. Read moresource§const SMALL_SUBGROUP_BASE_ADICITY: Option<u32> = None
const SMALL_SUBGROUP_BASE_ADICITY: Option<u32> = None
The integer
k
such that there exists a multiplicative subgroup
of size Self::SMALL_SUBGROUP_BASE^k
. Read moresource§const LARGE_SUBGROUP_ROOT_OF_UNITY: Option<Fp<MontBackend<Self, N>, N>> = None
const LARGE_SUBGROUP_ROOT_OF_UNITY: Option<Fp<MontBackend<Self, N>, N>> = None
GENERATOR^((MODULUS-1) / (2^s *
SMALL_SUBGROUP_BASE^SMALL_SUBGROUP_BASE_ADICITY)).
Used for mixed-radix FFT. Read more
source§const SQRT_PRECOMP: Option<SqrtPrecomputation<Fp<MontBackend<Self, N>, N>>> = sqrt_precomputation::<N, Self>()
const SQRT_PRECOMP: Option<SqrtPrecomputation<Fp<MontBackend<Self, N>, N>>> = sqrt_precomputation::<N, Self>()
Precomputed material for use when computing square roots.
The default is to use the standard Tonelli-Shanks algorithm. Read more