Struct PackedBinomialExtensionField 

pub struct PackedBinomialExtensionField<F: Field, PF: PackedField<Scalar = F>, const D: usize> { /* private fields */ }

Trait Implementations

impl<F, PF, const D: usize> Add<BinomialExtensionField<F, D>> for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

type Output = PackedBinomialExtensionField<F, PF, D>

The resulting type after applying the + operator.

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

Performs the + operation.

impl<F, PF, const D: usize> Add<PF> for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

type Output = PackedBinomialExtensionField<F, PF, D>

The resulting type after applying the + operator.

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

Performs the + operation.

impl<F, PF, const D: usize> Add for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

type Output = PackedBinomialExtensionField<F, PF, D>

The resulting type after applying the + operator.

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

Performs the + operation.

impl<F, PF, const D: usize> AddAssign<BinomialExtensionField<F, D>> for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

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

Performs the += operation.

impl<F, PF, const D: usize> AddAssign<PF> for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

fn add_assign(&mut self, rhs: PF)

Performs the += operation.

impl<F, PF, const D: usize> AddAssign for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

fn add_assign(&mut self, rhs: Self)

Performs the += operation.

impl<F, PF, const D: usize> BasedVectorSpace<PF> for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

const DIMENSION: usize = D

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>, const D: usize> Clone for PackedBinomialExtensionField<F, PF, D>

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

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>, const D: usize> Debug for PackedBinomialExtensionField<F, PF, D>

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

Formats the value using the given formatter.

impl<F: Field, PF: PackedField<Scalar = F>, const D: usize> Default for PackedBinomialExtensionField<F, PF, D>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, F: Field, PF, const D: usize> Deserialize<'de> for PackedBinomialExtensionField<F, PF, D>

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>, const D: usize> Distribution<PackedBinomialExtensionField<F, PF, D>> for StandardUniform

where Self: Distribution<PF>,

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

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: Field, PF: PackedField<Scalar = F>, const D: usize> From<BinomialExtensionField<F, D>> for PackedBinomialExtensionField<F, PF, D>

fn from(x: BinomialExtensionField<F, D>) -> Self

Converts to this type from the input type.

impl<F: Field, PF: PackedField<Scalar = F>, const D: usize> From<PF> for PackedBinomialExtensionField<F, PF, D>

fn from(x: PF) -> Self

Converts to this type from the input type.

impl<F: Hash + Field, PF: Hash + PackedField<Scalar = F>, const D: usize> Hash for PackedBinomialExtensionField<F, PF, D>

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, const D: usize> Mul<BinomialExtensionField<F, D>> for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

type Output = PackedBinomialExtensionField<F, PF, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<F, PF, const D: usize> Mul<PF> for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

type Output = PackedBinomialExtensionField<F, PF, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<F, PF, const D: usize> Mul for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

type Output = PackedBinomialExtensionField<F, PF, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<F, PF, const D: usize> MulAssign<BinomialExtensionField<F, D>> for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

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

Performs the *= operation.

impl<F, PF, const D: usize> MulAssign<PF> for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

fn mul_assign(&mut self, rhs: PF)

Performs the *= operation.

impl<F, PF, const D: usize> MulAssign for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

fn mul_assign(&mut self, rhs: Self)

Performs the *= operation.

impl<F, PF, const D: usize> Neg for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

type Output = PackedBinomialExtensionField<F, PF, D>

The resulting type after applying the - operator.

fn neg(self) -> Self

Performs the unary - operation.

impl<F: Ord + Field, PF: Ord + PackedField<Scalar = F>, const D: usize> Ord for PackedBinomialExtensionField<F, PF, D>

fn cmp(&self, other: &PackedBinomialExtensionField<F, PF, D>) -> 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, const D: usize> PackedFieldExtension<F, BinomialExtensionField<F, D>> for PackedBinomialExtensionField<F, F::Packing, D>

where F: BinomiallyExtendable<D>,

fn from_ext_slice(ext_slice: &[BinomialExtensionField<F, D>]) -> 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 to_ext_iter( iter: impl IntoIterator<Item = Self>, ) -> impl Iterator<Item = BinomialExtensionField<F, D>>

Given a iterator of packed extension field elements, convert to an iterator of extension field elements.

fn packed_ext_powers(base: BinomialExtensionField<F, D>) -> Powers<Self>

Similar to packed_powers, construct an iterator which returns powers of base packed into PackedFieldExtension 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 + Field, PF: PartialEq + PackedField<Scalar = F>, const D: usize> PartialEq for PackedBinomialExtensionField<F, PF, D>

fn eq(&self, other: &PackedBinomialExtensionField<F, PF, D>) -> 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>, const D: usize> PartialOrd for PackedBinomialExtensionField<F, PF, D>

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

where F: BinomiallyExtendable<D>, 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 square(&self) -> Self

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

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 * (1 - x).

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 mul_2exp_u64(&self, exp: u64) -> Self

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

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, const D: usize> Product for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, 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, const D: usize> Serialize for PackedBinomialExtensionField<F, PF, D>

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, const D: usize> Sub<BinomialExtensionField<F, D>> for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

type Output = PackedBinomialExtensionField<F, PF, D>

The resulting type after applying the - operator.

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

Performs the - operation.

impl<F, PF, const D: usize> Sub<PF> for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

type Output = PackedBinomialExtensionField<F, PF, D>

The resulting type after applying the - operator.

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

Performs the - operation.

impl<F, PF, const D: usize> Sub for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

type Output = PackedBinomialExtensionField<F, PF, D>

The resulting type after applying the - operator.

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

Performs the - operation.

impl<F, PF, const D: usize> SubAssign<BinomialExtensionField<F, D>> for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

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

Performs the -= operation.

impl<F, PF, const D: usize> SubAssign<PF> for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

fn sub_assign(&mut self, rhs: PF)

Performs the -= operation.

impl<F, PF, const D: usize> SubAssign for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>,

fn sub_assign(&mut self, rhs: Self)

Performs the -= operation.

impl<F, PF, const D: usize> Sum for PackedBinomialExtensionField<F, PF, D>

where F: BinomiallyExtendable<D>, 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: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>, const D: usize> Algebra<BinomialExtensionField<F, D>> for PackedBinomialExtensionField<F, PF, D>

impl<F: BinomiallyExtendable<D>, PF: PackedField<Scalar = F>, const D: usize> Algebra<PF> for PackedBinomialExtensionField<F, PF, D>

impl<F: Copy + Field, PF: Copy + PackedField<Scalar = F>, const D: usize> Copy for PackedBinomialExtensionField<F, PF, D>

impl<F: Eq + Field, PF: Eq + PackedField<Scalar = F>, const D: usize> Eq for PackedBinomialExtensionField<F, PF, D>

impl<F: Field, PF: PackedField<Scalar = F>, const D: usize> StructuralPartialEq for PackedBinomialExtensionField<F, PF, D>