Struct Fp

pub struct Fp<P, const N: usize>(/* private fields */)
where
    P: FpConfig<N>;

Represents an element of the prime field F_p, where p == P::MODULUS. This type can represent elements in any field of size at most N * 64 bits.

Implementations

impl<T, const N: usize> Fp<MontBackend<T, N>, N>

where T: MontConfig<N>,

pub const fn new(element: BigInt<N>) -> Fp<MontBackend<T, N>, N>

Construct a new field element from its underlying BigInt data type.

pub const fn new_unchecked(element: BigInt<N>) -> Fp<MontBackend<T, N>, N>

Construct a new field element from its underlying BigInt data type.

Unlike Self::new, this method does not perform Montgomery reduction. Thus, this method should be used only when constructing an element from an integer that has already been put in Montgomery form.

Trait Implementations

impl<'a, 'b, P, const N: usize> Add<&'b Fp<P, N>> for &'a Fp<P, N>

where P: FpConfig<N>,

type Output = Fp<P, N>

The resulting type after applying the + operator.

fn add(self, other: &'b Fp<P, N>) -> Fp<P, N>

Performs the + operation.

impl<'a, P, const N: usize> Add<&'a Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

type Output = Fp<P, N>

The resulting type after applying the + operator.

fn add(self, other: &Fp<P, N>) -> Fp<P, N>

Performs the + operation.

impl<'a, P, const N: usize> Add<&'a mut Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

type Output = Fp<P, N>

The resulting type after applying the + operator.

fn add(self, other: &'a mut Fp<P, N>) -> Fp<P, N>

Performs the + operation.

impl<P, const N: usize> Add for Fp<P, N>

where P: FpConfig<N>,

type Output = Fp<P, N>

The resulting type after applying the + operator.

fn add(self, other: Fp<P, N>) -> Fp<P, N>

Performs the + operation.

impl<'a, P, const N: usize> AddAssign<&'a Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

fn add_assign(&mut self, other: &Fp<P, N>)

Performs the += operation.

impl<'a, P, const N: usize> AddAssign<&'a mut Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

fn add_assign(&mut self, other: &'a mut Fp<P, N>)

Performs the += operation.

impl<P, const N: usize> AddAssign for Fp<P, N>

where P: FpConfig<N>,

fn add_assign(&mut self, other: Fp<P, N>)

Performs the += operation.

impl<P, const N: usize> AdditiveGroup for Fp<P, N>

where P: FpConfig<N>,

const ZERO: Fp<P, N> = P::ZERO

The additive identity of the field.

type Scalar = Fp<P, N>

fn double(&self) -> Fp<P, N>

Doubles self.

fn double_in_place(&mut self) -> &mut Fp<P, N>

Doubles self in place.

fn neg_in_place(&mut self) -> &mut Fp<P, N>

Negates self in place.

impl<P, const N: usize> CanonicalDeserialize for Fp<P, N>

where P: FpConfig<N>,

fn deserialize_with_mode<R>( reader: R, _compress: Compress, _validate: Validate, ) -> Result<Fp<P, N>, SerializationError>

where R: Read,

The general deserialize method that takes in customization flags.

fn deserialize_compressed<R>(reader: R) -> Result<Self, SerializationError>

where R: Read,

fn deserialize_compressed_unchecked<R>( reader: R, ) -> Result<Self, SerializationError>

where R: Read,

fn deserialize_uncompressed<R>(reader: R) -> Result<Self, SerializationError>

where R: Read,

fn deserialize_uncompressed_unchecked<R>( reader: R, ) -> Result<Self, SerializationError>

where R: Read,

impl<P, const N: usize> CanonicalDeserializeWithFlags for Fp<P, N>

where P: FpConfig<N>,

fn deserialize_with_flags<R, F>( reader: R, ) -> Result<(Fp<P, N>, F), SerializationError>

where R: Read, F: Flags,

Reads Self and Flags from reader. Returns empty flags by default.

impl<P, const N: usize> CanonicalSerialize for Fp<P, N>

where P: FpConfig<N>,

fn serialize_with_mode<W>( &self, writer: W, _compress: Compress, ) -> Result<(), SerializationError>

where W: Write,

The general serialize method that takes in customization flags.

fn serialized_size(&self, _compress: Compress) -> usize

fn serialize_compressed<W>(&self, writer: W) -> Result<(), SerializationError>

where W: Write,

fn compressed_size(&self) -> usize

fn serialize_uncompressed<W>(&self, writer: W) -> Result<(), SerializationError>

where W: Write,

fn uncompressed_size(&self) -> usize

impl<P, const N: usize> CanonicalSerializeWithFlags for Fp<P, N>

where P: FpConfig<N>,

fn serialize_with_flags<W, F>( &self, writer: W, flags: F, ) -> Result<(), SerializationError>

where W: Write, F: Flags,

Serializes self and flags into writer.

fn serialized_size_with_flags<F>(&self) -> usize

where F: Flags,

Serializes self and flags into writer.

impl<P, const N: usize> Clone for Fp<P, N>

where P: FpConfig<N>, BigInt<N>: Copy, PhantomData<P>: Copy,

fn clone(&self) -> Fp<P, N>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<P, const N: usize> Debug for Fp<P, N>

where P: FpConfig<N>,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<P, const N: usize> Default for Fp<P, N>

where P: FpConfig<N>, BigInt<N>: Default, PhantomData<P>: Default,

fn default() -> Fp<P, N>

Returns the “default value” for a type.

impl<P, const N: usize> Display for Fp<P, N>

where P: FpConfig<N>,

Outputs a string containing the value of self, represented as a decimal without leading zeroes.

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<'a, 'b, P, const N: usize> Div<&'b Fp<P, N>> for &'a Fp<P, N>

where P: FpConfig<N>,

type Output = Fp<P, N>

The resulting type after applying the / operator.

fn div(self, other: &Fp<P, N>) -> Fp<P, N>

Performs the / operation.

impl<'a, P, const N: usize> Div<&'a Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

fn div(self, other: &Fp<P, N>) -> Fp<P, N>

Returns self * other.inverse() if other.inverse() is Some, and panics otherwise.

type Output = Fp<P, N>

The resulting type after applying the / operator.

impl<'a, P, const N: usize> Div<&'a mut Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

type Output = Fp<P, N>

The resulting type after applying the / operator.

fn div(self, other: &'a mut Fp<P, N>) -> Fp<P, N>

Performs the / operation.

impl<P, const N: usize> Div for Fp<P, N>

where P: FpConfig<N>,

type Output = Fp<P, N>

The resulting type after applying the / operator.

fn div(self, other: Fp<P, N>) -> Fp<P, N>

Performs the / operation.

impl<'a, P, const N: usize> DivAssign<&'a Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

Computes self *= other.inverse() if other.inverse() is Some, and panics otherwise.

fn div_assign(&mut self, other: &Fp<P, N>)

Performs the /= operation.

impl<'a, P, const N: usize> DivAssign<&'a mut Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

fn div_assign(&mut self, other: &'a mut Fp<P, N>)

Performs the /= operation.

impl<P, const N: usize> DivAssign for Fp<P, N>

where P: FpConfig<N>,

fn div_assign(&mut self, other: Fp<P, N>)

Performs the /= operation.

impl<P, const N: usize> FftField for Fp<P, N>

where P: FpConfig<N>,

const GENERATOR: Fp<P, N> = P::GENERATOR

The generator of the multiplicative group of the field

const TWO_ADICITY: u32 = P::TWO_ADICITY

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.

const TWO_ADIC_ROOT_OF_UNITY: Fp<P, N> = P::TWO_ADIC_ROOT_OF_UNITY

2^s root of unity computed by GENERATOR^t

const SMALL_SUBGROUP_BASE: Option<u32> = P::SMALL_SUBGROUP_BASE

An integer b such that there exists a multiplicative subgroup of size b^k for some integer k.

const SMALL_SUBGROUP_BASE_ADICITY: Option<u32> = P::SMALL_SUBGROUP_BASE_ADICITY

The integer k such that there exists a multiplicative subgroup of size Self::SMALL_SUBGROUP_BASE^k.

const LARGE_SUBGROUP_ROOT_OF_UNITY: Option<Fp<P, N>> = P::LARGE_SUBGROUP_ROOT_OF_UNITY

GENERATOR^((MODULUS-1) / (2^s * SMALL_SUBGROUP_BASE^SMALL_SUBGROUP_BASE_ADICITY)) Used for mixed-radix FFT.

fn get_root_of_unity(n: u64) -> Option<Self>

Returns the root of unity of order n, if one exists. If no small multiplicative subgroup is defined, this is the 2-adic root of unity of order n (for n a power of 2). If a small multiplicative subgroup is defined, this is the root of unity of order n for the larger subgroup generated by FftConfig::LARGE_SUBGROUP_ROOT_OF_UNITY (for n = 2^i * FftConfig::SMALL_SUBGROUP_BASE^j for some i, j).

impl<P, const N: usize> Field for Fp<P, N>

where P: FpConfig<N>,

fn frobenius_map_in_place(&mut self, _: usize)

The Frobenius map has no effect in a prime field.

fn mul_by_base_prime_field( &self, elem: &<Fp<P, N> as Field>::BasePrimeField, ) -> Fp<P, N>

Fp is already a “BasePrimeField”, so it’s just mul by self

const SQRT_PRECOMP: Option<SqrtPrecomputation<Fp<P, N>>> = P::SQRT_PRECOMP

Determines the algorithm for computing square roots.

const ONE: Fp<P, N> = P::ONE

The multiplicative identity of the field.

type BasePrimeField = Fp<P, N>

fn extension_degree() -> u64

Returns the extension degree of this field with respect to Self::BasePrimeField.

fn from_base_prime_field(elem: <Fp<P, N> as Field>::BasePrimeField) -> Fp<P, N>

Constructs a field element from a single base prime field elements.

fn to_base_prime_field_elements( &self, ) -> impl Iterator<Item = <Fp<P, N> as Field>::BasePrimeField>

fn from_base_prime_field_elems( elems: impl IntoIterator<Item = <Fp<P, N> as Field>::BasePrimeField>, ) -> Option<Fp<P, N>>

Convert a slice of base prime field elements into a field element. If the slice length != Self::extension_degree(), must return None.

fn characteristic() -> &'static [u64]

Returns the characteristic of the field, in little-endian representation.

fn sum_of_products<const T: usize>( a: &[Fp<P, N>; T], b: &[Fp<P, N>; T], ) -> Fp<P, N>

Returns sum([a_i * b_i]).

fn from_random_bytes_with_flags<F>(bytes: &[u8]) -> Option<(Fp<P, N>, F)>

where F: Flags,

Attempt to deserialize a field element, splitting the bitflags metadata according to F specification. Returns None if the deserialization fails.

fn square(&self) -> Fp<P, N>

Returns self * self.

fn square_in_place(&mut self) -> &mut Fp<P, N>

Squares self in place.

fn inverse(&self) -> Option<Fp<P, N>>

Computes the multiplicative inverse of self if self is nonzero.

fn inverse_in_place(&mut self) -> Option<&mut Fp<P, N>>

If self.inverse().is_none(), this just returns None. Otherwise, it sets self to self.inverse().unwrap().

fn legendre(&self) -> LegendreSymbol

Returns a LegendreSymbol, which indicates whether this field element is 1 : a quadratic residue 0 : equal to 0 -1 : a quadratic non-residue

fn from_random_bytes(bytes: &[u8]) -> Option<Self>

Attempt to deserialize a field element. Returns None if the deserialization fails.

fn sqrt(&self) -> Option<Self>

Returns the square root of self, if it exists.

fn sqrt_in_place(&mut self) -> Option<&mut Self>

Sets self to be the square root of self, if it exists.

fn frobenius_map(&self, power: usize) -> Self

Returns self^s, where s = Self::BasePrimeField::MODULUS^power. This is also called the Frobenius automorphism.

fn pow<S>(&self, exp: S) -> Self

where S: AsRef<[u64]>,

Returns self^exp, where exp is an integer represented with u64 limbs, least significant limb first.

fn pow_with_table<S>(powers_of_2: &[Self], exp: S) -> Option<Self>

where S: AsRef<[u64]>,

Exponentiates a field element f by a number represented with u64 limbs, using a precomputed table containing as many powers of 2 of f as the 1 + the floor of log2 of the exponent exp, starting from the 1st power. That is, powers_of_2 should equal &[p, p^2, p^4, ..., p^(2^n)] when exp has at most n bits.

impl<P, const N: usize> From<BigInt<N>> for Fp<P, N>

where P: FpConfig<N>,

fn from(int: BigInt<N>) -> Fp<P, N>

Converts Self::BigInteger into Self

impl<P, const N: usize> From<BigUint> for Fp<P, N>

where P: FpConfig<N>,

fn from(val: BigUint) -> Fp<P, N>

Converts to this type from the input type.

impl<P, const N: usize> From<bool> for Fp<P, N>

where P: FpConfig<N>,

fn from(other: bool) -> Fp<P, N>

Converts to this type from the input type.

impl<P, const N: usize> From<i128> for Fp<P, N>

where P: FpConfig<N>,

fn from(other: i128) -> Fp<P, N>

Converts to this type from the input type.

impl<P, const N: usize> From<i16> for Fp<P, N>

where P: FpConfig<N>,

fn from(other: i16) -> Fp<P, N>

Converts to this type from the input type.

impl<P, const N: usize> From<i32> for Fp<P, N>

where P: FpConfig<N>,

fn from(other: i32) -> Fp<P, N>

Converts to this type from the input type.

impl<P, const N: usize> From<i64> for Fp<P, N>

where P: FpConfig<N>,

fn from(other: i64) -> Fp<P, N>

Converts to this type from the input type.

impl<P, const N: usize> From<i8> for Fp<P, N>

where P: FpConfig<N>,

fn from(other: i8) -> Fp<P, N>

Converts to this type from the input type.

impl<P, const N: usize> From<u128> for Fp<P, N>

where P: FpConfig<N>,

fn from(other: u128) -> Fp<P, N>

Converts to this type from the input type.

impl<P, const N: usize> From<u16> for Fp<P, N>

where P: FpConfig<N>,

fn from(other: u16) -> Fp<P, N>

Converts to this type from the input type.

impl<P, const N: usize> From<u32> for Fp<P, N>

where P: FpConfig<N>,

fn from(other: u32) -> Fp<P, N>

Converts to this type from the input type.

impl<P, const N: usize> From<u64> for Fp<P, N>

where P: FpConfig<N>,

fn from(other: u64) -> Fp<P, N>

Converts to this type from the input type.

impl<P, const N: usize> From<u8> for Fp<P, N>

where P: FpConfig<N>,

fn from(other: u8) -> Fp<P, N>

Converts to this type from the input type.

impl<P, const N: usize> FromStr for Fp<P, N>

where P: FpConfig<N>,

fn from_str(s: &str) -> Result<Fp<P, N>, <Fp<P, N> as FromStr>::Err>

Interpret a string of numbers as a (congruent) prime field element. Does not accept unnecessary leading zeroes or a blank string.

type Err = ()

The associated error which can be returned from parsing.

impl<P, const N: usize> Hash for Fp<P, N>

where P: FpConfig<N>, BigInt<N>: Hash, PhantomData<P>: Hash,

fn hash<H>(&self, state: &mut H)

where H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, 'b, P, const N: usize> Mul<&'b Fp<P, N>> for &'a Fp<P, N>

where P: FpConfig<N>,

type Output = Fp<P, N>

The resulting type after applying the * operator.

fn mul(self, other: &Fp<P, N>) -> Fp<P, N>

Performs the * operation.

impl<'a, P, const N: usize> Mul<&'a Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

type Output = Fp<P, N>

The resulting type after applying the * operator.

fn mul(self, other: &Fp<P, N>) -> Fp<P, N>

Performs the * operation.

impl<'a, P, const N: usize> Mul<&'a mut Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

type Output = Fp<P, N>

The resulting type after applying the * operator.

fn mul(self, other: &'a mut Fp<P, N>) -> Fp<P, N>

Performs the * operation.

impl<P, const N: usize> Mul for Fp<P, N>

where P: FpConfig<N>,

type Output = Fp<P, N>

The resulting type after applying the * operator.

fn mul(self, other: Fp<P, N>) -> Fp<P, N>

Performs the * operation.

impl<'a, P, const N: usize> MulAssign<&'a Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

fn mul_assign(&mut self, other: &Fp<P, N>)

Performs the *= operation.

impl<'a, P, const N: usize> MulAssign<&'a mut Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

fn mul_assign(&mut self, other: &'a mut Fp<P, N>)

Performs the *= operation.

impl<P, const N: usize> MulAssign for Fp<P, N>

where P: FpConfig<N>,

fn mul_assign(&mut self, other: Fp<P, N>)

Performs the *= operation.

impl<P, const N: usize> Neg for Fp<P, N>

where P: FpConfig<N>,

type Output = Fp<P, N>

The resulting type after applying the - operator.

fn neg(self) -> Fp<P, N>

Performs the unary - operation.

impl<P, const N: usize> One for Fp<P, N>

where P: FpConfig<N>,

fn one() -> Fp<P, N>

Returns the multiplicative identity element of Self, 1.

fn is_one(&self) -> bool

Returns true if self is equal to the multiplicative identity.

fn set_one(&mut self)

Sets self to the multiplicative identity element of Self, 1.

impl<P, const N: usize> Ord for Fp<P, N>

where P: FpConfig<N>,

Note that this implementation of Ord compares field elements viewing them as integers in the range 0, 1, …, P::MODULUS - 1. However, other implementations of PrimeField might choose a different ordering, and as such, users should use this Ord for applications where any ordering suffices (like in a BTreeMap), and not in applications where a particular ordering is required.

fn cmp(&self, other: &Fp<P, N>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<P, const N: usize> PartialEq for Fp<P, N>

where P: FpConfig<N>, BigInt<N>: PartialEq, PhantomData<P>: PartialEq,

fn eq(&self, other: &Fp<P, N>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<P, const N: usize> PartialOrd for Fp<P, N>

where P: FpConfig<N>,

Note that this implementation of PartialOrd compares field elements viewing them as integers in the range 0, 1, …, P::MODULUS - 1. However, other implementations of PrimeField might choose a different ordering, and as such, users should use this PartialOrd for applications where any ordering suffices (like in a BTreeMap), and not in applications where a particular ordering is required.

fn partial_cmp(&self, other: &Fp<P, N>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<P, const N: usize> PrimeField for Fp<P, N>

where P: FpConfig<N>,

const MODULUS: <Fp<P, N> as PrimeField>::BigInt = P::MODULUS

The modulus p.

const MODULUS_MINUS_ONE_DIV_TWO: <Fp<P, N> as PrimeField>::BigInt = _

The value (p - 1)/ 2.

const MODULUS_BIT_SIZE: u32 = _

The size of the modulus in bits.

const TRACE: <Fp<P, N> as PrimeField>::BigInt = _

The trace of the field is defined as the smallest integer t such that by 2^s * t = p - 1, and t is coprime to 2.

const TRACE_MINUS_ONE_DIV_TWO: <Fp<P, N> as PrimeField>::BigInt = _

The value (t - 1)/ 2.

type BigInt = BigInt<N>

A BigInteger type that can represent elements of this field.

fn from_bigint(r: BigInt<N>) -> Option<Fp<P, N>>

Construct a prime field element from an integer in the range 0..(p - 1).

fn into_bigint(self) -> BigInt<N>

Converts an element of the prime field into an integer in the range 0..(p - 1).

fn from_be_bytes_mod_order(bytes: &[u8]) -> Self

Reads bytes in big-endian, and converts them to a field element. If the integer represented by bytes is larger than the modulus p, this method performs the appropriate reduction.

fn from_le_bytes_mod_order(bytes: &[u8]) -> Self

Reads bytes in little-endian, and converts them to a field element. If the integer represented by bytes is larger than the modulus p, this method performs the appropriate reduction.

impl<'a, P, const N: usize> Product<&'a Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

fn product<I>(iter: I) -> Fp<P, N>

where I: Iterator<Item = &'a Fp<P, N>>,

Takes an iterator and generates Self from the elements by multiplying the items.

impl<P, const N: usize> Product for Fp<P, N>

where P: FpConfig<N>,

fn product<I>(iter: I) -> Fp<P, N>

where I: Iterator<Item = Fp<P, N>>,

Takes an iterator and generates Self from the elements by multiplying the items.

impl<'a, 'b, P, const N: usize> Sub<&'b Fp<P, N>> for &'a Fp<P, N>

where P: FpConfig<N>,

type Output = Fp<P, N>

The resulting type after applying the - operator.

fn sub(self, other: &Fp<P, N>) -> Fp<P, N>

Performs the - operation.

impl<'a, P, const N: usize> Sub<&'a Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

type Output = Fp<P, N>

The resulting type after applying the - operator.

fn sub(self, other: &Fp<P, N>) -> Fp<P, N>

Performs the - operation.

impl<'a, P, const N: usize> Sub<&'a mut Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

type Output = Fp<P, N>

The resulting type after applying the - operator.

fn sub(self, other: &'a mut Fp<P, N>) -> Fp<P, N>

Performs the - operation.

impl<P, const N: usize> Sub for Fp<P, N>

where P: FpConfig<N>,

type Output = Fp<P, N>

The resulting type after applying the - operator.

fn sub(self, other: Fp<P, N>) -> Fp<P, N>

Performs the - operation.

impl<'a, P, const N: usize> SubAssign<&'a Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

fn sub_assign(&mut self, other: &Fp<P, N>)

Performs the -= operation.

impl<'a, P, const N: usize> SubAssign<&'a mut Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

fn sub_assign(&mut self, other: &'a mut Fp<P, N>)

Performs the -= operation.

impl<P, const N: usize> SubAssign for Fp<P, N>

where P: FpConfig<N>,

fn sub_assign(&mut self, other: Fp<P, N>)

Performs the -= operation.

impl<'a, P, const N: usize> Sum<&'a Fp<P, N>> for Fp<P, N>

where P: FpConfig<N>,

fn sum<I>(iter: I) -> Fp<P, N>

where I: Iterator<Item = &'a Fp<P, N>>,

Takes an iterator and generates Self from the elements by “summing up” the items.

impl<P, const N: usize> Sum for Fp<P, N>

where P: FpConfig<N>,

fn sum<I>(iter: I) -> Fp<P, N>

where I: Iterator<Item = Fp<P, N>>,

Takes an iterator and generates Self from the elements by “summing up” the items.

impl<P, const N: usize> Valid for Fp<P, N>

where P: FpConfig<N>,

fn check(&self) -> Result<(), SerializationError>

fn batch_check<'a>( batch: impl Iterator<Item = &'a Self> + Send, ) -> Result<(), SerializationError>

where Self: 'a,

impl<P, const N: usize> Zero for Fp<P, N>

where P: FpConfig<N>,

fn zero() -> Fp<P, N>

Returns the additive identity element of Self, 0.

fn is_zero(&self) -> bool

Returns true if self is equal to the additive identity.

fn set_zero(&mut self)

Sets self to the additive identity element of Self, 0.

impl<P, const N: usize> Zeroize for Fp<P, N>

where P: FpConfig<N>,

fn zeroize(&mut self)

Zero out this object from memory using Rust intrinsics which ensure the zeroization operation is not “optimized away” by the compiler.

impl<P, const N: usize> Copy for Fp<P, N>

where P: FpConfig<N>, BigInt<N>: Copy, PhantomData<P>: Copy,

impl<P, const N: usize> Eq for Fp<P, N>

where P: FpConfig<N>, BigInt<N>: PartialEq, PhantomData<P>: PartialEq,