Struct QuinticTrinomialExtensionField 

pub struct QuinticTrinomialExtensionField<F, A = F> { /* private fields */ }

A degree-5 extension field using the trinomial X^5 + X^2 - 1.

Elements are represented as a_0 + a_1*X + a_2*X^2 + a_3*X^3 + a_4*X^4.

Implementations

impl<F, A> QuinticTrinomialExtensionField<F, A>

pub const fn new(value: [A; 5]) -> Self

Create an extension field element from coefficient array.

The coefficients represent the polynomial value[0] + value[1]*X + ... + value[4]*X^4.

impl<F: Copy> QuinticTrinomialExtensionField<F, F>

pub const fn new_array<const N: usize>(input: [[F; 5]; N]) -> [Self; N]

Convert a [[F; 5]; N] array to an array of extension field elements.

Panics

Panics if N == 0.

Trait Implementations

impl<F, A> Add<A> for QuinticTrinomialExtensionField<F, A>

where F: QuinticTrinomialExtendable, A: Algebra<F>,

type Output = QuinticTrinomialExtensionField<F, A>

The resulting type after applying the + operator.

fn add(self, rhs: A) -> Self

Performs the + operation.

impl<F, PF> Add<QuinticTrinomialExtensionField<F>> for PackedQuinticTrinomialExtensionField<F, PF>

where F: QuinticTrinomialExtendable, PF: PackedField<Scalar = F>,

type Output = PackedQuinticTrinomialExtensionField<F, PF>

The resulting type after applying the + operator.

fn add(self, rhs: QuinticTrinomialExtensionField<F>) -> Self

Performs the + operation.

impl<F, A> Add for QuinticTrinomialExtensionField<F, A>

where F: QuinticTrinomialExtendable, A: QuinticExtendableAlgebra<F>,

type Output = QuinticTrinomialExtensionField<F, A>

The resulting type after applying the + operator.

fn add(self, rhs: Self) -> Self

Performs the + operation.

impl<F, A> AddAssign<A> for QuinticTrinomialExtensionField<F, A>

where F: QuinticTrinomialExtendable, A: Algebra<F>,

fn add_assign(&mut self, rhs: A)

Performs the += operation.

impl<F, PF> AddAssign<QuinticTrinomialExtensionField<F>> for PackedQuinticTrinomialExtensionField<F, PF>

where F: QuinticTrinomialExtendable, PF: PackedField<Scalar = F>,

fn add_assign(&mut self, rhs: QuinticTrinomialExtensionField<F>)

Performs the += operation.

impl<F, A> AddAssign for QuinticTrinomialExtensionField<F, A>

where F: QuinticTrinomialExtendable, A: QuinticExtendableAlgebra<F>,

fn add_assign(&mut self, rhs: Self)

Performs the += operation.

impl<F: QuinticTrinomialExtendable> Algebra<F> for QuinticTrinomialExtensionField<F>

fn mixed_dot_product<const N: usize>(a: &[Self; N], f: &[F; N]) -> Self

where F: Dup,

Dot product between algebra elements and base field scalars.

const BATCHED_LC_CHUNK: usize = 8

Optimal chunk size for batched_linear_combination.

fn batched_linear_combination(values: &[Self], coeffs: &[F]) -> Self

where F: Dup,

Runtime-length linear combination: Σ values[i] * coeffs[i].

impl<F: QuinticTrinomialExtendable, PF: PackedField<Scalar = F>> Algebra<QuinticTrinomialExtensionField<F>> for PackedQuinticTrinomialExtensionField<F, PF>

fn mixed_dot_product<const N: usize>(a: &[Self; N], f: &[F; N]) -> Self

where F: Dup,

Dot product between algebra elements and base field scalars.

const BATCHED_LC_CHUNK: usize = 8

Optimal chunk size for batched_linear_combination.

fn batched_linear_combination(values: &[Self], coeffs: &[F]) -> Self

where F: Dup,

Runtime-length linear combination: Σ values[i] * coeffs[i].

impl<F: QuinticTrinomialExtendable, A: Algebra<F>> BasedVectorSpace<A> for QuinticTrinomialExtensionField<F, A>

const DIMENSION: usize = 5

The dimension of the vector space, i.e. the number of elements in its basis.

fn as_basis_coefficients_slice(&self) -> &[A]

Fixes a basis for the algebra A and uses this to map an element of A to a slice of DIMENSION F elements.

fn from_basis_coefficients_fn<Fn: FnMut(usize) -> A>(f: Fn) -> Self

Fixes a basis for the algebra A and uses this to map DIMENSION F elements to an element of A. Similar to core:array::from_fn, the DIMENSION F elements are given by Fn(0), ..., Fn(DIMENSION - 1) called in that order.

fn from_basis_coefficients_iter<I: ExactSizeIterator<Item = A>>( iter: I, ) -> Option<Self>

Fixes a basis for the algebra A and uses this to map DIMENSION F elements to an element of A.

fn flatten_to_base(vec: Vec<Self>) -> Vec<A>

Convert from a vector of Self to a vector of F by flattening the basis coefficients.

fn reconstitute_from_base(vec: Vec<A>) -> Vec<Self>

Convert from a vector of F to a vector of Self by combining the basis coefficients.

fn from_basis_coefficients_slice(slice: &[F]) -> Option<Self>

Fixes a basis for the algebra A and uses this to map DIMENSION F elements to an element of A.

fn ith_basis_element(i: usize) -> Option<Self>

Given a basis for the Algebra A, return the i’th basis element.

impl<F: Clone, A: Clone> Clone for QuinticTrinomialExtensionField<F, A>

fn clone(&self) -> QuinticTrinomialExtensionField<F, A>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F: Debug, A: Debug> Debug for QuinticTrinomialExtensionField<F, A>

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

Formats the value using the given formatter.

impl<F: Field, A: Algebra<F>> Default for QuinticTrinomialExtensionField<F, A>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, F, A> Deserialize<'de> for QuinticTrinomialExtensionField<F, A>

where A: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<F: QuinticTrinomialExtendable> Display for QuinticTrinomialExtensionField<F>

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

Formats the value using the given formatter.

impl<F: QuinticTrinomialExtendable> Distribution<QuinticTrinomialExtensionField<F>> for StandardUniform

where Self: Distribution<F>,

fn sample<R: Rng + ?Sized>( &self, rng: &mut R, ) -> QuinticTrinomialExtensionField<F>

Generate a random value of T, using rng as the source of randomness.

fn sample_iter<R>(self, rng: R) -> Iter<Self, R, T>

where R: Rng, Self: Sized,

Create an iterator that generates random values of T, using rng as the source of randomness.

fn map<F, S>(self, func: F) -> Map<Self, F, T, S>

where F: Fn(T) -> S, Self: Sized,

Map sampled values to type S

impl<F, PF> Div<QuinticTrinomialExtensionField<F>> for PackedQuinticTrinomialExtensionField<F, PF>

where F: QuinticTrinomialExtendable, PF: PackedField<Scalar = F>,

type Output = PackedQuinticTrinomialExtensionField<F, PF>

The resulting type after applying the / operator.

fn div(self, rhs: QuinticTrinomialExtensionField<F>) -> Self

Performs the / operation.

impl<F> Div for QuinticTrinomialExtensionField<F>

where F: QuinticTrinomialExtendable,

type Output = QuinticTrinomialExtensionField<F>

The resulting type after applying the / operator.

fn div(self, rhs: Self) -> Self::Output

Performs the / operation.

impl<F, PF> DivAssign<QuinticTrinomialExtensionField<F>> for PackedQuinticTrinomialExtensionField<F, PF>

where F: QuinticTrinomialExtendable, PF: PackedField<Scalar = F>,

fn div_assign(&mut self, rhs: QuinticTrinomialExtensionField<F>)

Performs the /= operation.

impl<F> DivAssign for QuinticTrinomialExtensionField<F>

where F: QuinticTrinomialExtendable,

fn div_assign(&mut self, rhs: Self)

Performs the /= operation.

impl<F: QuinticTrinomialExtendable> ExtensionField<F> for QuinticTrinomialExtensionField<F>

where PackedQuinticTrinomialExtensionField<F, F::Packing>: PackedFieldExtension<F, Self>,

type ExtensionPacking = PackedQuinticTrinomialExtensionField<F, <F as Field>::Packing>

fn is_in_basefield(&self) -> bool

Determine if the given element lies in the base field.

fn as_base(&self) -> Option<F>

If the element lies in the base field project it down. Otherwise return None.

impl<F: QuinticTrinomialExtendable> Field for QuinticTrinomialExtensionField<F>

const GENERATOR: Self

A generator of this field’s multiplicative group.

type Packing = QuinticTrinomialExtensionField<F>

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

The multiplicative inverse of this field element, if it exists.

fn add_slices(slice_1: &mut [Self], slice_2: &[Self])

Add two slices of field elements together, returning the result in the first slice.

fn order() -> BigUint

The number of elements in the field.

fn is_zero(&self) -> bool

Check if the given field element is equal to the unique additive identity (ZERO).

fn is_one(&self) -> bool

Check if the given field element is equal to the unique multiplicative identity (ONE).

fn inverse(&self) -> Self

The multiplicative inverse of this field element.

fn bits() -> usize

The number of bits required to define an element of this field.

impl<F, A> From<[A; 5]> for QuinticTrinomialExtensionField<F, A>

fn from(x: [A; 5]) -> Self

Converts to this type from the input type.

impl<F: Field, A: Algebra<F>> From<A> for QuinticTrinomialExtensionField<F, A>

fn from(x: A) -> Self

Converts to this type from the input type.

impl<F: Field, PF: PackedField<Scalar = F>> From<QuinticTrinomialExtensionField<F>> for PackedQuinticTrinomialExtensionField<F, PF>

fn from(x: QuinticTrinomialExtensionField<F>) -> Self

Converts to this type from the input type.

impl<F: QuinticTrinomialExtendable> HasFrobenius<F> for QuinticTrinomialExtensionField<F>

fn repeated_frobenius(&self, count: usize) -> Self

Apply Frobenius count times: x → x^{p^count}.

fn pseudo_inv(&self) -> Self

Compute pseudo-inverse using Frobenius automorphism.

Returns 0 if self == 0, and 1/self otherwise.

Uses the identity: a^{-1} = ProdConj(a) * Norm(a)^{-1} where

• ProdConj(a) = a^{p^4 + p^3 + p^2 + p},
• Norm(a) = a * ProdConj(a) is in the base field.

fn frobenius(&self) -> Self

Apply the Frobenius automorphism once.

fn galois_orbit(self) -> Vec<Self>

Returns the full Galois orbit of the element under Frobenius.

impl<F: Hash, A: Hash> Hash for QuinticTrinomialExtensionField<F, A>

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

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<F, A> Mul<A> for QuinticTrinomialExtensionField<F, A>

where F: QuinticTrinomialExtendable, A: QuinticExtendableAlgebra<F>,

type Output = QuinticTrinomialExtensionField<F, A>

The resulting type after applying the * operator.

fn mul(self, rhs: A) -> Self

Performs the * operation.

impl<F, PF> Mul<QuinticTrinomialExtensionField<F>> for PackedQuinticTrinomialExtensionField<F, PF>

where F: QuinticTrinomialExtendable, PF: PackedField<Scalar = F>,

type Output = PackedQuinticTrinomialExtensionField<F, PF>

The resulting type after applying the * operator.

fn mul(self, rhs: QuinticTrinomialExtensionField<F>) -> Self

Performs the * operation.

impl<F, A> Mul for QuinticTrinomialExtensionField<F, A>

where F: QuinticTrinomialExtendable, A: QuinticExtendableAlgebra<F>,

type Output = QuinticTrinomialExtensionField<F, A>

The resulting type after applying the * operator.

fn mul(self, rhs: Self) -> Self

Performs the * operation.

impl<F, A> MulAssign<A> for QuinticTrinomialExtensionField<F, A>

where F: QuinticTrinomialExtendable, A: QuinticExtendableAlgebra<F>,

fn mul_assign(&mut self, rhs: A)

Performs the *= operation.

impl<F, PF> MulAssign<QuinticTrinomialExtensionField<F>> for PackedQuinticTrinomialExtensionField<F, PF>

where F: QuinticTrinomialExtendable, PF: PackedField<Scalar = F>,

fn mul_assign(&mut self, rhs: QuinticTrinomialExtensionField<F>)

Performs the *= operation.

impl<F, A> MulAssign for QuinticTrinomialExtensionField<F, A>

where F: QuinticTrinomialExtendable, A: QuinticExtendableAlgebra<F>,

fn mul_assign(&mut self, rhs: Self)

Performs the *= operation.

impl<F, A> Neg for QuinticTrinomialExtensionField<F, A>

where F: QuinticTrinomialExtendable, A: Algebra<F>,

type Output = QuinticTrinomialExtensionField<F, A>

The resulting type after applying the - operator.

fn neg(self) -> Self

Performs the unary - operation.

impl<F: Ord, A: Ord> Ord for QuinticTrinomialExtensionField<F, A>

fn cmp(&self, other: &QuinticTrinomialExtensionField<F, A>) -> 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<F: QuinticTrinomialExtendable> PackedFieldExtension<F, QuinticTrinomialExtensionField<F>> for PackedQuinticTrinomialExtensionField<F, F::Packing>

fn from_ext_slice(ext_slice: &[QuinticTrinomialExtensionField<F>]) -> Self

Given a slice of extension field EF elements of length W, convert into the array [[F; D]; W] transpose to [[F; W]; D] and then pack to get [PF; D].

fn packed_ext_powers(base: QuinticTrinomialExtensionField<F>) -> Powers<Self>

Similar to packed_powers, construct an iterator which returns powers of base packed into PackedFieldExtension elements.

fn extract(&self, lane: usize) -> ExtField

Extract the extension field element at the given SIMD lane.

fn to_ext_iter( iter: impl IntoIterator<Item = Self>, ) -> impl Iterator<Item = ExtField>

Convert an iterator of packed extension field elements to an iterator of extension field elements.

fn packed_ext_powers_capped( base: ExtField, unpacked_len: usize, ) -> impl Iterator<Item = Self>

Similar to packed_ext_powers but only returns unpacked_len powers of base.

impl<F: PartialEq, A: PartialEq> PartialEq for QuinticTrinomialExtensionField<F, A>

fn eq(&self, other: &QuinticTrinomialExtensionField<F, A>) -> 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<F: PartialOrd, A: PartialOrd> PartialOrd for QuinticTrinomialExtensionField<F, A>

fn partial_cmp( &self, other: &QuinticTrinomialExtensionField<F, A>, ) -> 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<F, A> PrimeCharacteristicRing for QuinticTrinomialExtensionField<F, A>

where F: QuinticTrinomialExtendable, A: QuinticExtendableAlgebra<F> + Copy,

const ZERO: Self

The additive identity of the ring.

const ONE: Self

The multiplicative identity of the ring.

const TWO: Self

The element in the ring given by ONE + ONE.

const NEG_ONE: Self

The element in the ring given by -ONE.

type PrimeSubfield = <A as PrimeCharacteristicRing>::PrimeSubfield

The field ℤ/p where the characteristic of this ring is p.

fn from_prime_subfield(f: Self::PrimeSubfield) -> Self

Embed an element of the prime field ℤ/p into the ring R.

fn halve(&self) -> Self

The elementary function halve(a) = a/2.

fn square(&self) -> Self

The elementary function square(a) = a^2.

fn mul_2exp_u64(&self, exp: u64) -> Self

The elementary function mul_2exp_u64(a, exp) = a * 2^{exp}.

fn div_2exp_u64(&self, exp: u64) -> Self

Divide by a given power of two. div_2exp_u64(a, exp) = a/2^exp

fn zero_vec(len: usize) -> Vec<Self>

Allocates a vector of zero elements of length len. Many operating systems zero pages before assigning them to a userspace process. In that case, our process should not need to write zeros, which would be redundant. However, the compiler may not always recognize this.

fn from_bool(b: bool) -> Self

Return Self::ONE if b is true and Self::ZERO if b is false.

fn from_u8(int: u8) -> Self

Given an integer r, return the sum of r copies of ONE:

fn from_u16(int: u16) -> Self

Given an integer r, return the sum of r copies of ONE:

fn from_u32(int: u32) -> Self

Given an integer r, return the sum of r copies of ONE:

fn from_u64(int: u64) -> Self

Given an integer r, return the sum of r copies of ONE:

fn from_u128(int: u128) -> Self

Given an integer r, return the sum of r copies of ONE:

fn from_usize(int: usize) -> Self

Given an integer r, return the sum of r copies of ONE:

fn from_i8(int: i8) -> Self

Given an integer r, return the sum of r copies of ONE:

fn from_i16(int: i16) -> Self

Given an integer r, return the sum of r copies of ONE:

fn from_i32(int: i32) -> Self

Given an integer r, return the sum of r copies of ONE:

fn from_i64(int: i64) -> Self

Given an integer r, return the sum of r copies of ONE:

fn from_i128(int: i128) -> Self

Given an integer r, return the sum of r copies of ONE:

fn from_isize(int: isize) -> Self

Given an integer r, return the sum of r copies of ONE:

fn double(&self) -> Self

The elementary function double(a) = 2*a.

fn cube(&self) -> Self

The elementary function cube(a) = a^3.

fn xor(&self, y: &Self) -> Self

Computes the arithmetic generalization of boolean xor.

fn xor3(&self, y: &Self, z: &Self) -> Self

Computes the arithmetic generalization of a triple xor.

fn andn(&self, y: &Self) -> Self

Computes the arithmetic generalization of andnot.

fn bool_check(&self) -> Self

The vanishing polynomial for boolean values: x * (x - 1).

fn exp_u64(&self, power: u64) -> Self

Exponentiation by a u64 power.

fn exp_const_u64<const POWER: u64>(&self) -> Self

Exponentiation by a small constant power.

fn exp_power_of_2(&self, power_log: usize) -> Self

The elementary function exp_power_of_2(a, power_log) = a^{2^power_log}.

fn powers(&self) -> Powers<Self>

Construct an iterator which returns powers of self: self^0, self^1, self^2, ....

fn shifted_powers(&self, start: Self) -> Powers<Self>

Construct an iterator which returns powers of self shifted by start: start, start*self^1, start*self^2, ....

fn dot_product<const N: usize>(u: &[Self; N], v: &[Self; N]) -> Self

Compute the dot product of two vectors.

fn sum_array<const N: usize>(input: &[Self]) -> Self

Compute the sum of a slice of elements whose length is a compile time constant.

impl<F, PF> Product<QuinticTrinomialExtensionField<F>> for PackedQuinticTrinomialExtensionField<F, PF>

where F: QuinticTrinomialExtendable, PF: PackedField<Scalar = F>,

fn product<I: Iterator<Item = QuinticTrinomialExtensionField<F>>>( iter: I, ) -> Self

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

impl<F, A> Product for QuinticTrinomialExtensionField<F, A>

where F: QuinticTrinomialExtendable, A: QuinticExtendableAlgebra<F> + Copy,

fn product<I: Iterator<Item = Self>>(iter: I) -> Self

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

impl<F: QuinticTrinomialExtendable> RawDataSerializable for QuinticTrinomialExtensionField<F>

const NUM_BYTES: usize

The number of bytes which this field element occupies in memory. Must be equal to the length of self.into_bytes().

fn into_bytes(self) -> impl IntoIterator<Item = u8>

Convert a field element into a collection of bytes.

fn into_byte_stream( input: impl IntoIterator<Item = Self>, ) -> impl IntoIterator<Item = u8>

Convert an iterator of field elements into an iterator of bytes.

fn into_u32_stream( input: impl IntoIterator<Item = Self>, ) -> impl IntoIterator<Item = u32>

Convert an iterator of field elements into an iterator of u32s.

fn into_u64_stream( input: impl IntoIterator<Item = Self>, ) -> impl IntoIterator<Item = u64>

Convert an iterator of field elements into an iterator of u64s.

fn into_parallel_byte_streams<const N: usize>( input: impl IntoIterator<Item = [Self; N]>, ) -> impl IntoIterator<Item = [u8; N]>

Convert an iterator of field element arrays into an iterator of byte arrays.

fn into_parallel_u32_streams<const N: usize>( input: impl IntoIterator<Item = [Self; N]>, ) -> impl IntoIterator<Item = [u32; N]>

Convert an iterator of field element arrays into an iterator of u32 arrays.

fn into_parallel_u64_streams<const N: usize>( input: impl IntoIterator<Item = [Self; N]>, ) -> impl IntoIterator<Item = [u64; N]>

Convert an iterator of field element arrays into an iterator of u64 arrays.

impl<F, A> Serialize for QuinticTrinomialExtensionField<F, A>

where A: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<F, A> Sub<A> for QuinticTrinomialExtensionField<F, A>

where F: QuinticTrinomialExtendable, A: Algebra<F>,

type Output = QuinticTrinomialExtensionField<F, A>

The resulting type after applying the - operator.

fn sub(self, rhs: A) -> Self

Performs the - operation.

impl<F, PF> Sub<QuinticTrinomialExtensionField<F>> for PackedQuinticTrinomialExtensionField<F, PF>

where F: QuinticTrinomialExtendable, PF: PackedField<Scalar = F>,

type Output = PackedQuinticTrinomialExtensionField<F, PF>

The resulting type after applying the - operator.

fn sub(self, rhs: QuinticTrinomialExtensionField<F>) -> Self

Performs the - operation.

impl<F, A> Sub for QuinticTrinomialExtensionField<F, A>

where F: QuinticTrinomialExtendable, A: QuinticExtendableAlgebra<F>,

type Output = QuinticTrinomialExtensionField<F, A>

The resulting type after applying the - operator.

fn sub(self, rhs: Self) -> Self

Performs the - operation.

impl<F, A> SubAssign<A> for QuinticTrinomialExtensionField<F, A>

where F: QuinticTrinomialExtendable, A: Algebra<F>,

fn sub_assign(&mut self, rhs: A)

Performs the -= operation.

impl<F, PF> SubAssign<QuinticTrinomialExtensionField<F>> for PackedQuinticTrinomialExtensionField<F, PF>

where F: QuinticTrinomialExtendable, PF: PackedField<Scalar = F>,

fn sub_assign(&mut self, rhs: QuinticTrinomialExtensionField<F>)

Performs the -= operation.

impl<F, A> SubAssign for QuinticTrinomialExtensionField<F, A>

where F: QuinticTrinomialExtendable, A: QuinticExtendableAlgebra<F>,

fn sub_assign(&mut self, rhs: Self)

Performs the -= operation.

impl<F, PF> Sum<QuinticTrinomialExtensionField<F>> for PackedQuinticTrinomialExtensionField<F, PF>

where F: QuinticTrinomialExtendable, PF: PackedField<Scalar = F>,

fn sum<I: Iterator<Item = QuinticTrinomialExtensionField<F>>>(iter: I) -> Self

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

impl<F, A> Sum for QuinticTrinomialExtensionField<F, A>

where F: QuinticTrinomialExtendable, A: QuinticExtendableAlgebra<F> + Copy,

fn sum<I: Iterator<Item = Self>>(iter: I) -> Self

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

impl<F: QuinticTrinomialExtendable + HasTwoAdicQuinticExtension> TwoAdicField for QuinticTrinomialExtensionField<F>

const TWO_ADICITY: usize = F::EXT_TWO_ADICITY

The number of factors of two in this field’s multiplicative group.

fn two_adic_generator(bits: usize) -> Self

Returns a generator of the multiplicative group of order 2^bits. Assumes bits <= TWO_ADICITY, otherwise the result is undefined.

impl<F: Copy, A: Copy> Copy for QuinticTrinomialExtensionField<F, A>

impl<F: Eq, A: Eq> Eq for QuinticTrinomialExtensionField<F, A>

impl<F: QuinticTrinomialExtendable> Packable for QuinticTrinomialExtensionField<F>

impl<F, A> StructuralPartialEq for QuinticTrinomialExtensionField<F, A>