Struct PackedQuinticTrinomialExtensionField 

pub struct PackedQuinticTrinomialExtensionField<F: Field, PF: PackedField<Scalar = F>> { /* private fields */ }

Packed quintic extension field.

This is a wrapper around [PF; 5] where PF is a packed field type. It enables SIMD-style operations on multiple quintic extension field elements.

Trait Implementations

impl<F, PF> Add<PF> 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: PF) -> 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, PF> Add 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: Self) -> Self

Performs the + operation.

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

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

fn add_assign(&mut self, rhs: PF)

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, PF> AddAssign for PackedQuinticTrinomialExtensionField<F, PF>

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

fn add_assign(&mut self, rhs: Self)

Performs the += operation.

impl<F: QuinticTrinomialExtendable, PF: PackedField<Scalar = F>> Algebra<PF> 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, 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, PF> BasedVectorSpace<PF> for PackedQuinticTrinomialExtensionField<F, PF>

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

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) -> &[PF]

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) -> PF>(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 = PF>>( 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<PF>

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

fn reconstitute_from_base(vec: Vec<PF>) -> 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 + Field, PF: Clone + PackedField<Scalar = F>> Clone for PackedQuinticTrinomialExtensionField<F, PF>

fn clone(&self) -> PackedQuinticTrinomialExtensionField<F, PF>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F: Debug + Field, PF: Debug + PackedField<Scalar = F>> Debug for PackedQuinticTrinomialExtensionField<F, PF>

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

Formats the value using the given formatter.

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

fn default() -> Self

Returns the “default value” for a type.

impl<'de, F: Field, PF> Deserialize<'de> for PackedQuinticTrinomialExtensionField<F, PF>

where PF: Deserialize<'de> + PackedField<Scalar = F>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<F: Field, PF: PackedField<Scalar = F>> Distribution<PackedQuinticTrinomialExtensionField<F, PF>> for StandardUniform

where Self: Distribution<PF>,

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

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, 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: Field, PF: PackedField<Scalar = F>> From<PF> for PackedQuinticTrinomialExtensionField<F, PF>

fn from(x: PF) -> 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: Hash + Field, PF: Hash + PackedField<Scalar = F>> Hash for PackedQuinticTrinomialExtensionField<F, PF>

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, PF> Mul<PF> 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: PF) -> 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, PF> Mul 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: Self) -> Self

Performs the * operation.

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

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

fn mul_assign(&mut self, rhs: PF)

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, PF> MulAssign for PackedQuinticTrinomialExtensionField<F, PF>

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

fn mul_assign(&mut self, rhs: Self)

Performs the *= operation.

impl<F, PF> Neg for PackedQuinticTrinomialExtensionField<F, PF>

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

type Output = PackedQuinticTrinomialExtensionField<F, PF>

The resulting type after applying the - operator.

fn neg(self) -> Self

Performs the unary - operation.

impl<F: Ord + Field, PF: Ord + PackedField<Scalar = F>> Ord for PackedQuinticTrinomialExtensionField<F, PF>

fn cmp(&self, other: &PackedQuinticTrinomialExtensionField<F, PF>) -> 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, PF> PackedField for PackedQuinticTrinomialExtensionField<F, PF>

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

type Scalar = QuinticTrinomialExtensionField<F>

fn packed_powers(base: Self::Scalar) -> Powers<Self>

Construct an iterator which returns powers of base packed into packed field elements.

fn packed_shifted_powers( base: Self::Scalar, start: Self::Scalar, ) -> Powers<Self>

Construct an iterator which returns powers of base multiplied by start and packed into packed field elements.

fn packed_linear_combination<const N: usize>( coeffs: &[Self::Scalar], vecs: &[Self], ) -> Self

Compute a linear combination of a slice of base field elements and a slice of packed field elements. The slices must have equal length and it must be a compile time constant.

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, PF> PackedValue for PackedQuinticTrinomialExtensionField<F, PF>

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

const WIDTH: usize = PF::WIDTH

Number of scalar values packed together.

type Value = QuinticTrinomialExtensionField<F>

The scalar type that is packed into this value.

fn from_slice(slice: &[Self::Value]) -> &Self

Interprets a slice of scalar values as a packed value reference.

fn from_slice_mut(slice: &mut [Self::Value]) -> &mut Self

Interprets a mutable slice of scalar values as a mutable packed value.

fn from_fn<Fn: FnMut(usize) -> Self::Value>(f: Fn) -> Self

Constructs a packed value using a function to generate each element.

fn as_slice(&self) -> &[Self::Value]

Returns the underlying scalar values as an immutable slice.

fn as_slice_mut(&mut self) -> &mut [Self::Value]

Returns the underlying scalar values as a mutable slice.

fn pack_slice(buf: &[Self::Value]) -> &[Self]

Packs a slice of scalar values into a slice of packed values.

fn pack_slice_with_suffix(buf: &[Self::Value]) -> (&[Self], &[Self::Value])

Packs a slice into packed values and returns the packed portion and any remaining suffix.

fn pack_slice_mut(buf: &mut [Self::Value]) -> &mut [Self]

Converts a mutable slice of scalar values into a mutable slice of packed values.

fn pack_maybe_uninit_slice_mut( buf: &mut [MaybeUninit<Self::Value>], ) -> &mut [MaybeUninit<Self>]

Converts a mutable slice of possibly uninitialized scalar values into a mutable slice of possibly uninitialized packed values.

fn pack_slice_with_suffix_mut( buf: &mut [Self::Value], ) -> (&mut [Self], &mut [Self::Value])

Converts a mutable slice of scalar values into a pair:

fn pack_maybe_uninit_slice_with_suffix_mut( buf: &mut [MaybeUninit<Self::Value>], ) -> (&mut [MaybeUninit<Self>], &mut [MaybeUninit<Self::Value>])

Converts a mutable slice of possibly uninitialized scalar values into a pair:

fn unpack_slice(buf: &[Self]) -> &[Self::Value]

Reinterprets a slice of packed values as a flat slice of scalar values.

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

Extract the scalar value at the given SIMD lane.

fn unpack_into<const N: usize>( packed: &[Self; N], rows: &mut [[Self::Value; N]], )

Unpack N packed values into WIDTH rows of N scalars.

impl<F: PartialEq + Field, PF: PartialEq + PackedField<Scalar = F>> PartialEq for PackedQuinticTrinomialExtensionField<F, PF>

fn eq(&self, other: &PackedQuinticTrinomialExtensionField<F, PF>) -> 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 + Field, PF: PartialOrd + PackedField<Scalar = F>> PartialOrd for PackedQuinticTrinomialExtensionField<F, PF>

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

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

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 = <PF as PrimeCharacteristicRing>::PrimeSubfield

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

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

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

fn from_bool(b: bool) -> Self

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

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_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, PF> Product for PackedQuinticTrinomialExtensionField<F, PF>

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

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

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

impl<F: Field, PF> Serialize for PackedQuinticTrinomialExtensionField<F, PF>

where PF: Serialize + PackedField<Scalar = F>,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<F, PF> Sub<PF> 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: PF) -> 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, PF> Sub 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: Self) -> Self

Performs the - operation.

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

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

fn sub_assign(&mut self, rhs: PF)

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, PF> SubAssign for PackedQuinticTrinomialExtensionField<F, PF>

where F: QuinticTrinomialExtendable, PF: PackedField<Scalar = 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, PF> Sum for PackedQuinticTrinomialExtensionField<F, PF>

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

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: Copy + Field, PF: Copy + PackedField<Scalar = F>> Copy for PackedQuinticTrinomialExtensionField<F, PF>

impl<F: Eq + Field, PF: Eq + PackedField<Scalar = F>> Eq for PackedQuinticTrinomialExtensionField<F, PF>

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