pub struct QuadExtField<P>where
    P: QuadExtConfig,{
    pub c0: <P as QuadExtConfig>::BaseField,
    pub c1: <P as QuadExtConfig>::BaseField,
}
Expand description

An element of a quadratic extension field F_p[X]/(X^2 - P::NONRESIDUE) is represented as c0 + c1 * X, for c0, c1 in P::BaseField.

Fields§

§c0: <P as QuadExtConfig>::BaseField

Coefficient c0 in the representation of the field element c = c0 + c1 * X

§c1: <P as QuadExtConfig>::BaseField

Coefficient c1 in the representation of the field element c = c0 + c1 * X

Implementations§

source§

impl<P> QuadExtField<Fp2ConfigWrapper<P>>where P: Fp2Config,

source

pub fn mul_assign_by_fp(&mut self, other: &<P as Fp2Config>::Fp)

In-place multiply both coefficients c0 and c1 of self by an element from Fp.

Examples
let c0: Fp = Fp::rand(&mut test_rng());
let c1: Fp = Fp::rand(&mut test_rng());
let mut ext_element: Fp2 = Fp2::new(c0, c1);

let base_field_element: Fp = Fp::rand(&mut test_rng());
ext_element.mul_assign_by_fp(&base_field_element);

assert_eq!(ext_element.c0, c0 * base_field_element);
assert_eq!(ext_element.c1, c1 * base_field_element);
source§

impl<P> QuadExtField<Fp4ConfigWrapper<P>>where P: Fp4Config,

source

pub fn mul_by_fp( &mut self, element: &<<P as Fp4Config>::Fp2Config as Fp2Config>::Fp )

source

pub fn mul_by_fp2( &mut self, element: &QuadExtField<Fp2ConfigWrapper<<P as Fp4Config>::Fp2Config>> )

source§

impl<P> QuadExtField<Fp6ConfigWrapper<P>>where P: Fp6Config,

source

pub fn mul_by_034( &mut self, c0: &<<P as Fp6Config>::Fp3Config as Fp3Config>::Fp, c3: &<<P as Fp6Config>::Fp3Config as Fp3Config>::Fp, c4: &<<P as Fp6Config>::Fp3Config as Fp3Config>::Fp )

source

pub fn mul_by_014( &mut self, c0: &<<P as Fp6Config>::Fp3Config as Fp3Config>::Fp, c1: &<<P as Fp6Config>::Fp3Config as Fp3Config>::Fp, c4: &<<P as Fp6Config>::Fp3Config as Fp3Config>::Fp )

source§

impl<P> QuadExtField<Fp12ConfigWrapper<P>>where P: Fp12Config,

source§

impl<P> QuadExtField<P>where P: QuadExtConfig,

source

pub const fn new( c0: <P as QuadExtConfig>::BaseField, c1: <P as QuadExtConfig>::BaseField ) -> QuadExtField<P>

Create a new field element from coefficients c0 and c1, so that the result is of the form c0 + c1 * X.

Examples
let c0: Fp = Fp::rand(&mut test_rng());
let c1: Fp = Fp::rand(&mut test_rng());
// `Fp2` a degree-2 extension over `Fp`.
let c: Fp2 = Fp2::new(c0, c1);
source

pub fn conjugate_in_place(&mut self) -> &mut QuadExtField<P>

This is only to be used when the element is known to be in the cyclotomic subgroup.

source

pub fn norm(&self) -> <P as QuadExtConfig>::BaseField

Norm of QuadExtField over P::BaseField:Norm(a) = a * a.conjugate(). This simplifies to: Norm(a) = a.x^2 - P::NON_RESIDUE * a.y^2. This is alternatively expressed as Norm(a) = a^(1 + p).

Examples
let c: Fp2 = Fp2::rand(&mut test_rng());
let norm = c.norm();
// We now compute the norm using the `a * a.conjugate()` approach.
// A Frobenius map sends an element of `Fp2` to one of its p_th powers:
// `a.frobenius_map_in_place(1) -> a^p` and `a^p` is also `a`'s Galois conjugate.
let mut c_conjugate = c;
c_conjugate.frobenius_map_in_place(1);
let norm2 = c * c_conjugate;
// Computing the norm of an `Fp2` element should result in an element
// in BaseField `Fp`, i.e. `c1 == 0`
assert!(norm2.c1.is_zero());
assert_eq!(norm, norm2.c0);
source

pub fn mul_assign_by_basefield( &mut self, element: &<P as QuadExtConfig>::BaseField )

In-place multiply both coefficients c0 & c1 of the quadratic extension field by an element from the base field.

Trait Implementations§

source§

impl<'a, 'b, P> Add<&'a QuadExtField<P>> for &'b QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the + operator.
source§

fn add(self, other: &'a QuadExtField<P>) -> QuadExtField<P>

Performs the + operation. Read more
source§

impl<'a, P> Add<&'a QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the + operator.
source§

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

Performs the + operation. Read more
source§

impl<'a, 'b, P> Add<&'a mut QuadExtField<P>> for &'b QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the + operator.
source§

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

Performs the + operation. Read more
source§

impl<'a, P> Add<&'a mut QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the + operator.
source§

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

Performs the + operation. Read more
source§

impl<'b, P> Add<QuadExtField<P>> for &'b QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the + operator.
source§

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

Performs the + operation. Read more
source§

impl<P> Add<QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the + operator.
source§

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

Performs the + operation. Read more
source§

impl<'a, P> AddAssign<&'a QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

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

Performs the += operation. Read more
source§

impl<'a, P> AddAssign<&'a mut QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

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

Performs the += operation. Read more
source§

impl<P> AddAssign<QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

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

Performs the += operation. Read more
source§

impl<P> CanonicalDeserialize for QuadExtField<P>where P: QuadExtConfig,

source§

fn deserialize_with_mode<R>( reader: R, compress: Compress, validate: Validate ) -> Result<QuadExtField<P>, 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,

source§

impl<P> CanonicalDeserializeWithFlags for QuadExtField<P>where P: QuadExtConfig,

source§

fn deserialize_with_flags<R, F>( reader: R ) -> Result<(QuadExtField<P>, F), SerializationError>where R: Read, F: Flags,

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

impl<P> CanonicalSerialize for QuadExtField<P>where P: QuadExtConfig,

source§

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

The general serialize method that takes in customization flags.
source§

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

source§

impl<P> CanonicalSerializeWithFlags for QuadExtField<P>where P: QuadExtConfig,

source§

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

Serializes self and flags into writer.
source§

fn serialized_size_with_flags<F>(&self) -> usizewhere F: Flags,

Serializes self and flags into writer.
source§

impl<P> Clone for QuadExtField<P>where P: QuadExtConfig,

source§

fn clone(&self) -> QuadExtField<P>

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<P> CyclotomicMultSubgroup for QuadExtField<Fp12ConfigWrapper<P>>where P: Fp12Config,

source§

const INVERSE_IS_FAST: bool = true

Is the inverse fast to compute? For example, in quadratic extensions, the inverse can be computed at the cost of negating one coordinate, which is much faster than standard inversion. By default this is false, but should be set to true for quadratic extensions.
source§

fn cyclotomic_inverse_in_place( &mut self ) -> Option<&mut QuadExtField<Fp12ConfigWrapper<P>>>

Compute the inverse of self. See Self::INVERSE_IS_FAST for details. Returns None if self.is_zero(), and Some otherwise. Read more
source§

fn cyclotomic_square_in_place( &mut self ) -> &mut QuadExtField<Fp12ConfigWrapper<P>>

Square self in place. By default this is computed using Field::square_in_place, but for degree 12 extensions, this can be computed faster than normal squaring. Read more
source§

fn cyclotomic_square(&self) -> Self

Compute a square in the cyclotomic subgroup. By default this is computed using Field::square, but for degree 12 extensions, this can be computed faster than normal squaring. Read more
source§

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

Compute the inverse of self. See Self::INVERSE_IS_FAST for details. Returns None if self.is_zero(), and Some otherwise. Read more
source§

fn cyclotomic_exp(&self, e: impl AsRef<[u64]>) -> Self

Compute a cyclotomic exponentiation of self with respect to e. Read more
source§

fn cyclotomic_exp_in_place(&mut self, e: impl AsRef<[u64]>)

Set self to be the result of exponentiating self by e, using efficient cyclotomic algorithms. Read more
source§

impl<P> CyclotomicMultSubgroup for QuadExtField<Fp2ConfigWrapper<P>>where P: Fp2Config,

source§

const INVERSE_IS_FAST: bool = true

Is the inverse fast to compute? For example, in quadratic extensions, the inverse can be computed at the cost of negating one coordinate, which is much faster than standard inversion. By default this is false, but should be set to true for quadratic extensions.
source§

fn cyclotomic_inverse_in_place( &mut self ) -> Option<&mut QuadExtField<Fp2ConfigWrapper<P>>>

Compute the inverse of self. See Self::INVERSE_IS_FAST for details. Returns None if self.is_zero(), and Some otherwise. Read more
source§

fn cyclotomic_square(&self) -> Self

Compute a square in the cyclotomic subgroup. By default this is computed using Field::square, but for degree 12 extensions, this can be computed faster than normal squaring. Read more
source§

fn cyclotomic_square_in_place(&mut self) -> &mut Self

Square self in place. By default this is computed using Field::square_in_place, but for degree 12 extensions, this can be computed faster than normal squaring. Read more
source§

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

Compute the inverse of self. See Self::INVERSE_IS_FAST for details. Returns None if self.is_zero(), and Some otherwise. Read more
source§

fn cyclotomic_exp(&self, e: impl AsRef<[u64]>) -> Self

Compute a cyclotomic exponentiation of self with respect to e. Read more
source§

fn cyclotomic_exp_in_place(&mut self, e: impl AsRef<[u64]>)

Set self to be the result of exponentiating self by e, using efficient cyclotomic algorithms. Read more
source§

impl<P> CyclotomicMultSubgroup for QuadExtField<Fp4ConfigWrapper<P>>where P: Fp4Config,

source§

const INVERSE_IS_FAST: bool = true

Is the inverse fast to compute? For example, in quadratic extensions, the inverse can be computed at the cost of negating one coordinate, which is much faster than standard inversion. By default this is false, but should be set to true for quadratic extensions.
source§

fn cyclotomic_inverse_in_place( &mut self ) -> Option<&mut QuadExtField<Fp4ConfigWrapper<P>>>

Compute the inverse of self. See Self::INVERSE_IS_FAST for details. Returns None if self.is_zero(), and Some otherwise. Read more
source§

fn cyclotomic_square(&self) -> Self

Compute a square in the cyclotomic subgroup. By default this is computed using Field::square, but for degree 12 extensions, this can be computed faster than normal squaring. Read more
source§

fn cyclotomic_square_in_place(&mut self) -> &mut Self

Square self in place. By default this is computed using Field::square_in_place, but for degree 12 extensions, this can be computed faster than normal squaring. Read more
source§

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

Compute the inverse of self. See Self::INVERSE_IS_FAST for details. Returns None if self.is_zero(), and Some otherwise. Read more
source§

fn cyclotomic_exp(&self, e: impl AsRef<[u64]>) -> Self

Compute a cyclotomic exponentiation of self with respect to e. Read more
source§

fn cyclotomic_exp_in_place(&mut self, e: impl AsRef<[u64]>)

Set self to be the result of exponentiating self by e, using efficient cyclotomic algorithms. Read more
source§

impl<P> CyclotomicMultSubgroup for QuadExtField<Fp6ConfigWrapper<P>>where P: Fp6Config,

source§

const INVERSE_IS_FAST: bool = true

Is the inverse fast to compute? For example, in quadratic extensions, the inverse can be computed at the cost of negating one coordinate, which is much faster than standard inversion. By default this is false, but should be set to true for quadratic extensions.
source§

fn cyclotomic_inverse_in_place( &mut self ) -> Option<&mut QuadExtField<Fp6ConfigWrapper<P>>>

Compute the inverse of self. See Self::INVERSE_IS_FAST for details. Returns None if self.is_zero(), and Some otherwise. Read more
source§

fn cyclotomic_square(&self) -> Self

Compute a square in the cyclotomic subgroup. By default this is computed using Field::square, but for degree 12 extensions, this can be computed faster than normal squaring. Read more
source§

fn cyclotomic_square_in_place(&mut self) -> &mut Self

Square self in place. By default this is computed using Field::square_in_place, but for degree 12 extensions, this can be computed faster than normal squaring. Read more
source§

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

Compute the inverse of self. See Self::INVERSE_IS_FAST for details. Returns None if self.is_zero(), and Some otherwise. Read more
source§

fn cyclotomic_exp(&self, e: impl AsRef<[u64]>) -> Self

Compute a cyclotomic exponentiation of self with respect to e. Read more
source§

fn cyclotomic_exp_in_place(&mut self, e: impl AsRef<[u64]>)

Set self to be the result of exponentiating self by e, using efficient cyclotomic algorithms. Read more
source§

impl<P> Debug for QuadExtField<P>where P: QuadExtConfig,

source§

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

Formats the value using the given formatter. Read more
source§

impl<P> Default for QuadExtField<P>where P: QuadExtConfig,

source§

fn default() -> QuadExtField<P>

Returns the “default value” for a type. Read more
source§

impl<P> Display for QuadExtField<P>where P: QuadExtConfig,

source§

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

Formats the value using the given formatter. Read more
source§

impl<'a, 'b, P> Div<&'a QuadExtField<P>> for &'b QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the / operator.
source§

fn div(self, other: &'a QuadExtField<P>) -> QuadExtField<P>

Performs the / operation. Read more
source§

impl<'a, P> Div<&'a QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the / operator.
source§

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

Performs the / operation. Read more
source§

impl<'a, 'b, P> Div<&'a mut QuadExtField<P>> for &'b QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the / operator.
source§

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

Performs the / operation. Read more
source§

impl<'a, P> Div<&'a mut QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the / operator.
source§

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

Performs the / operation. Read more
source§

impl<'b, P> Div<QuadExtField<P>> for &'b QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the / operator.
source§

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

Performs the / operation. Read more
source§

impl<P> Div<QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the / operator.
source§

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

Performs the / operation. Read more
source§

impl<'a, P> DivAssign<&'a QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

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

Performs the /= operation. Read more
source§

impl<'a, P> DivAssign<&'a mut QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

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

Performs the /= operation. Read more
source§

impl<P> DivAssign<QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

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

Performs the /= operation. Read more
source§

impl<P> Field for QuadExtField<P>where P: QuadExtConfig,

§

type BasePrimeField = <P as QuadExtConfig>::BasePrimeField

§

type BasePrimeFieldIter = Chain<<<P as QuadExtConfig>::BaseField as Field>::BasePrimeFieldIter, <<P as QuadExtConfig>::BaseField as Field>::BasePrimeFieldIter>

source§

const SQRT_PRECOMP: Option<SqrtPrecomputation<QuadExtField<P>>> = None

Determines the algorithm for computing square roots.
source§

const ZERO: QuadExtField<P> = Self::new(<P::BaseField>::ZERO, <P::BaseField>::ZERO)

The additive identity of the field.
source§

const ONE: QuadExtField<P> = Self::new(<P::BaseField>::ONE, <P::BaseField>::ZERO)

The multiplicative identity of the field.
source§

fn extension_degree() -> u64

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

fn from_base_prime_field( elem: <QuadExtField<P> as Field>::BasePrimeField ) -> QuadExtField<P>

Constructs a field element from a single base prime field elements. Read more
source§

fn to_base_prime_field_elements( &self ) -> <QuadExtField<P> as Field>::BasePrimeFieldIter

source§

fn from_base_prime_field_elems( elems: &[<QuadExtField<P> as Field>::BasePrimeField] ) -> Option<QuadExtField<P>>

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

fn double(&self) -> QuadExtField<P>

Returns self + self.
source§

fn double_in_place(&mut self) -> &mut QuadExtField<P>

Doubles self in place.
source§

fn neg_in_place(&mut self) -> &mut QuadExtField<P>

Negates self in place.
source§

fn square(&self) -> QuadExtField<P>

Returns self * self.
source§

fn from_random_bytes_with_flags<F>(bytes: &[u8]) -> Option<(QuadExtField<P>, F)>where F: Flags,

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

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

Attempt to deserialize a field element. Returns None if the deserialization fails. Read more
source§

fn square_in_place(&mut self) -> &mut QuadExtField<P>

Squares self in place.
source§

fn inverse(&self) -> Option<QuadExtField<P>>

Computes the multiplicative inverse of self if self is nonzero.
source§

fn inverse_in_place(&mut self) -> Option<&mut QuadExtField<P>>

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

fn frobenius_map_in_place(&mut self, power: usize)

Sets self to self^s, where s = Self::BasePrimeField::MODULUS^power. This is also called the Frobenius automorphism.
source§

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
source§

fn sqrt(&self) -> Option<QuadExtField<P>>

Returns the square root of self, if it exists.
source§

fn sqrt_in_place(&mut self) -> Option<&mut QuadExtField<P>>

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

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

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

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

Returns sum([a_i * b_i]).
source§

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

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

fn pow<S>(&self, exp: S) -> Selfwhere S: AsRef<[u64]>,

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

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. Read more
source§

impl<P> From<bool> for QuadExtField<P>where P: QuadExtConfig,

source§

fn from(other: bool) -> QuadExtField<P>

Converts to this type from the input type.
source§

impl<P> From<i128> for QuadExtField<P>where P: QuadExtConfig,

source§

fn from(val: i128) -> QuadExtField<P>

Converts to this type from the input type.
source§

impl<P> From<i16> for QuadExtField<P>where P: QuadExtConfig,

source§

fn from(val: i16) -> QuadExtField<P>

Converts to this type from the input type.
source§

impl<P> From<i32> for QuadExtField<P>where P: QuadExtConfig,

source§

fn from(val: i32) -> QuadExtField<P>

Converts to this type from the input type.
source§

impl<P> From<i64> for QuadExtField<P>where P: QuadExtConfig,

source§

fn from(val: i64) -> QuadExtField<P>

Converts to this type from the input type.
source§

impl<P> From<i8> for QuadExtField<P>where P: QuadExtConfig,

source§

fn from(val: i8) -> QuadExtField<P>

Converts to this type from the input type.
source§

impl<P> From<u128> for QuadExtField<P>where P: QuadExtConfig,

source§

fn from(other: u128) -> QuadExtField<P>

Converts to this type from the input type.
source§

impl<P> From<u16> for QuadExtField<P>where P: QuadExtConfig,

source§

fn from(other: u16) -> QuadExtField<P>

Converts to this type from the input type.
source§

impl<P> From<u32> for QuadExtField<P>where P: QuadExtConfig,

source§

fn from(other: u32) -> QuadExtField<P>

Converts to this type from the input type.
source§

impl<P> From<u64> for QuadExtField<P>where P: QuadExtConfig,

source§

fn from(other: u64) -> QuadExtField<P>

Converts to this type from the input type.
source§

impl<P> From<u8> for QuadExtField<P>where P: QuadExtConfig,

source§

fn from(other: u8) -> QuadExtField<P>

Converts to this type from the input type.
source§

impl<P> Hash for QuadExtField<P>where P: QuadExtConfig,

source§

fn hash<__HP>(&self, __state: &mut __HP)where __HP: Hasher,

Feeds this value into the given Hasher. Read more
1.3.0 · source§

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

Feeds a slice of this type into the given Hasher. Read more
source§

impl<'a, 'b, P> Mul<&'a QuadExtField<P>> for &'b QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the * operator.
source§

fn mul(self, other: &'a QuadExtField<P>) -> QuadExtField<P>

Performs the * operation. Read more
source§

impl<'a, P> Mul<&'a QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the * operator.
source§

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

Performs the * operation. Read more
source§

impl<'a, 'b, P> Mul<&'a mut QuadExtField<P>> for &'b QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the * operator.
source§

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

Performs the * operation. Read more
source§

impl<'a, P> Mul<&'a mut QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the * operator.
source§

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

Performs the * operation. Read more
source§

impl<'b, P> Mul<QuadExtField<P>> for &'b QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the * operator.
source§

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

Performs the * operation. Read more
source§

impl<P> Mul<QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the * operator.
source§

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

Performs the * operation. Read more
source§

impl<'a, P> MulAssign<&'a QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

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

Performs the *= operation. Read more
source§

impl<'a, P> MulAssign<&'a mut QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

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

Performs the *= operation. Read more
source§

impl<P> MulAssign<QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

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

Performs the *= operation. Read more
source§

impl<P> Neg for QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the - operator.
source§

fn neg(self) -> QuadExtField<P>

Performs the unary - operation. Read more
source§

impl<P> One for QuadExtField<P>where P: QuadExtConfig,

source§

fn one() -> QuadExtField<P>

Returns the multiplicative identity element of Self, 1. Read more
source§

fn is_one(&self) -> bool

Returns true if self is equal to the multiplicative identity. Read more
source§

fn set_one(&mut self)

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

impl<P> Ord for QuadExtField<P>where P: QuadExtConfig,

QuadExtField elements are ordered lexicographically.

source§

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

This method returns an Ordering between self and other. Read more
1.21.0 · source§

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

Compares and returns the maximum of two values. Read more
1.21.0 · source§

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

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval. Read more
source§

impl<P> PartialEq<QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

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

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl<P> PartialOrd<QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

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

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

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

This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§

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

This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 · source§

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

This method tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

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

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more
source§

impl<'a, P> Product<&'a QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

fn product<I>(iter: I) -> QuadExtField<P>where I: Iterator<Item = &'a QuadExtField<P>>,

Method which takes an iterator and generates Self from the elements by multiplying the items.
source§

impl<P> Product<QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

fn product<I>(iter: I) -> QuadExtField<P>where I: Iterator<Item = QuadExtField<P>>,

Method which takes an iterator and generates Self from the elements by multiplying the items.
source§

impl<'a, 'b, P> Sub<&'a QuadExtField<P>> for &'b QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the - operator.
source§

fn sub(self, other: &'a QuadExtField<P>) -> QuadExtField<P>

Performs the - operation. Read more
source§

impl<'a, P> Sub<&'a QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the - operator.
source§

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

Performs the - operation. Read more
source§

impl<'a, 'b, P> Sub<&'a mut QuadExtField<P>> for &'b QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the - operator.
source§

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

Performs the - operation. Read more
source§

impl<'a, P> Sub<&'a mut QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the - operator.
source§

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

Performs the - operation. Read more
source§

impl<'b, P> Sub<QuadExtField<P>> for &'b QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the - operator.
source§

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

Performs the - operation. Read more
source§

impl<P> Sub<QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

§

type Output = QuadExtField<P>

The resulting type after applying the - operator.
source§

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

Performs the - operation. Read more
source§

impl<'a, P> SubAssign<&'a QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

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

Performs the -= operation. Read more
source§

impl<'a, P> SubAssign<&'a mut QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

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

Performs the -= operation. Read more
source§

impl<P> SubAssign<QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

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

Performs the -= operation. Read more
source§

impl<'a, P> Sum<&'a QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

fn sum<I>(iter: I) -> QuadExtField<P>where I: Iterator<Item = &'a QuadExtField<P>>,

Method which takes an iterator and generates Self from the elements by “summing up” the items.
source§

impl<P> Sum<QuadExtField<P>> for QuadExtField<P>where P: QuadExtConfig,

source§

fn sum<I>(iter: I) -> QuadExtField<P>where I: Iterator<Item = QuadExtField<P>>,

Method which takes an iterator and generates Self from the elements by “summing up” the items.
source§

impl<P> ToConstraintField<<P as QuadExtConfig>::BasePrimeField> for QuadExtField<P>where P: QuadExtConfig, <P as QuadExtConfig>::BaseField: ToConstraintField<<P as QuadExtConfig>::BasePrimeField>,

source§

impl<P> Valid for QuadExtField<P>where P: QuadExtConfig,

source§

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

§

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

source§

impl<P> Zero for QuadExtField<P>where P: QuadExtConfig,

source§

fn zero() -> QuadExtField<P>

Returns the additive identity element of Self, 0. Read more
source§

fn is_zero(&self) -> bool

Returns true if self is equal to the additive identity.
source§

fn set_zero(&mut self)

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

impl<P> Zeroize for QuadExtField<P>where P: QuadExtConfig,

source§

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.
source§

impl<P> Copy for QuadExtField<P>where P: QuadExtConfig,

source§

impl<P> Eq for QuadExtField<P>where P: QuadExtConfig,

Auto Trait Implementations§

§

impl<P> RefUnwindSafe for QuadExtField<P>where <P as QuadExtConfig>::BaseField: RefUnwindSafe,

§

impl<P> Send for QuadExtField<P>

§

impl<P> Sync for QuadExtField<P>

§

impl<P> Unpin for QuadExtField<P>where <P as QuadExtConfig>::BaseField: Unpin,

§

impl<P> UnwindSafe for QuadExtField<P>where <P as QuadExtConfig>::BaseField: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> CanonicalSerializeHashExt for Twhere T: CanonicalSerialize,

§

fn hash<H>(&self) -> GenericArray<u8, <H as OutputSizeUser>::OutputSize>where H: Digest,

§

fn hash_uncompressed<H>( &self ) -> GenericArray<u8, <H as OutputSizeUser>::OutputSize>where H: Digest,

§

impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

const: unstable · source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T> ToString for Twhere T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<T> UniformRand for Twhere Standard: Distribution<T>,

source§

fn rand<R>(rng: &mut R) -> Twhere R: Rng + ?Sized,

§

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T, F> DomainCoeff<F> for Twhere F: FftField, T: Copy + Send + Sync + Add<T, Output = T> + Sub<T, Output = T> + AddAssign<T> + SubAssign<T> + Zero + MulAssign<F> + Debug + PartialEq<T>,