Struct Binomial 

pub struct Binomial<F>(/* private fields */);

Marker for the binomial reducer X^D - W (degree-generic).

Trait Implementations

impl<F> Clone for Binomial<F>

where F: Clone,

fn clone(&self) -> Binomial<F>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F> Copy for Binomial<F>

where F: Copy,

impl<F> Debug for Binomial<F>

where F: Debug,

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

Formats the value using the given formatter.

impl<F> Eq for Binomial<F>

where F: Eq,

impl<F, const D: usize> ExtensionAlgebra<ExtField<F, 2, Binomial<F>>, D, Binomial<ExtField<F, 2, Binomial<F>>>> for ExtField<F, 2, Binomial<F>>

where F: HasComplexBinomialExtension<D>,

fn ext_mul( a: &[ExtField<F, 2, Binomial<F>>; D], b: &[ExtField<F, 2, Binomial<F>>; D], res: &mut [ExtField<F, 2, Binomial<F>>; D], )

Multiplication in the algebra extension ring.

fn ext_square(a: &[Self; D], res: &mut [Self; D])

Squaring in the algebra extension ring.

fn ext_add(a: &[Self; D], b: &[Self; D]) -> [Self; D]

Coefficient-wise addition.

fn ext_sub(a: &[Self; D], b: &[Self; D]) -> [Self; D]

Coefficient-wise subtraction.

fn ext_base_mul(lhs: [Self; D], rhs: Self) -> [Self; D]

Multiply an extension element by a base-field scalar.

impl<F> ExtensionAlgebra<F, 2, Binomial<F>> for F

where F: ComplexExtendable,

fn ext_mul(a: &[F; 2], b: &[F; 2], res: &mut [F; 2])

Multiplication in the algebra extension ring.

fn ext_square(a: &[Self; D], res: &mut [Self; D])

Squaring in the algebra extension ring.

fn ext_add(a: &[Self; D], b: &[Self; D]) -> [Self; D]

Coefficient-wise addition.

fn ext_sub(a: &[Self; D], b: &[Self; D]) -> [Self; D]

Coefficient-wise subtraction.

fn ext_base_mul(lhs: [Self; D], rhs: Self) -> [Self; D]

Multiply an extension element by a base-field scalar.

impl ExtensionAlgebra<Felt, 2, Binomial<Felt>> for Felt

fn ext_mul(a: &[Self; 2], b: &[Self; 2], res: &mut [Self; 2])

Multiplication in the algebra extension ring.

fn ext_square(a: &[Self; D], res: &mut [Self; D])

Squaring in the algebra extension ring.

fn ext_add(a: &[Self; D], b: &[Self; D]) -> [Self; D]

Coefficient-wise addition.

fn ext_sub(a: &[Self; D], b: &[Self; D]) -> [Self; D]

Coefficient-wise subtraction.

fn ext_base_mul(lhs: [Self; D], rhs: Self) -> [Self; D]

Multiply an extension element by a base-field scalar.

impl ExtensionAlgebra<Felt, 5, Binomial<Felt>> for Felt

fn ext_mul(a: &[Self; 5], b: &[Self; 5], res: &mut [Self; 5])

Multiplication in the algebra extension ring.

fn ext_square(a: &[Self; D], res: &mut [Self; D])

Squaring in the algebra extension ring.

fn ext_add(a: &[Self; D], b: &[Self; D]) -> [Self; D]

Coefficient-wise addition.

fn ext_sub(a: &[Self; D], b: &[Self; D]) -> [Self; D]

Coefficient-wise subtraction.

fn ext_base_mul(lhs: [Self; D], rhs: Self) -> [Self; D]

Multiply an extension element by a base-field scalar.

impl ExtensionAlgebra<Goldilocks, 2, Binomial<Goldilocks>> for Goldilocks

fn ext_mul(a: &[Goldilocks; 2], b: &[Goldilocks; 2], res: &mut [Goldilocks; 2])

Multiplication in the algebra extension ring.

fn ext_square(a: &[Self; D], res: &mut [Self; D])

Squaring in the algebra extension ring.

fn ext_add(a: &[Self; D], b: &[Self; D]) -> [Self; D]

Coefficient-wise addition.

fn ext_sub(a: &[Self; D], b: &[Self; D]) -> [Self; D]

Coefficient-wise subtraction.

fn ext_base_mul(lhs: [Self; D], rhs: Self) -> [Self; D]

Multiply an extension element by a base-field scalar.

impl ExtensionAlgebra<Goldilocks, 5, Binomial<Goldilocks>> for Goldilocks

fn ext_mul(a: &[Goldilocks; 5], b: &[Goldilocks; 5], res: &mut [Goldilocks; 5])

Multiplication in the algebra extension ring.

fn ext_square(a: &[Self; D], res: &mut [Self; D])

Squaring in the algebra extension ring.

fn ext_add(a: &[Self; D], b: &[Self; D]) -> [Self; D]

Coefficient-wise addition.

fn ext_sub(a: &[Self; D], b: &[Self; D]) -> [Self; D]

Coefficient-wise subtraction.

fn ext_base_mul(lhs: [Self; D], rhs: Self) -> [Self; D]

Multiply an extension element by a base-field scalar.

impl<const WIDTH: usize, FP> ExtensionAlgebra<MontyField31<FP>, WIDTH, Binomial<MontyField31<FP>>> for MontyField31<FP>

where FP: BinomialExtensionData<WIDTH> + FieldParameters,

fn ext_mul( a: &[MontyField31<FP>; WIDTH], b: &[MontyField31<FP>; WIDTH], res: &mut [MontyField31<FP>; WIDTH], )

Multiplication in the algebra extension ring.

fn ext_add( a: &[MontyField31<FP>; WIDTH], b: &[MontyField31<FP>; WIDTH], ) -> [MontyField31<FP>; WIDTH]

Coefficient-wise addition.

fn ext_sub( a: &[MontyField31<FP>; WIDTH], b: &[MontyField31<FP>; WIDTH], ) -> [MontyField31<FP>; WIDTH]

Coefficient-wise subtraction.

fn ext_base_mul( lhs: [MontyField31<FP>; WIDTH], rhs: MontyField31<FP>, ) -> [MontyField31<FP>; WIDTH]

Multiply an extension element by a base-field scalar.

fn ext_square(a: &[Self; D], res: &mut [Self; D])

Squaring in the algebra extension ring.

impl<F> ExtensionShape for Binomial<F>

where F: Field,

impl<F> Hash for Binomial<F>

where F: Hash,

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

where __H: Hasher,

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<F> Ord for Binomial<F>

where F: Ord,

fn cmp(&self, other: &Binomial<F>) -> 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> PartialEq for Binomial<F>

where F: PartialEq,

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

where F: PartialOrd,

fn partial_cmp(&self, other: &Binomial<F>) -> 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> StructuralPartialEq for Binomial<F>

where F: PartialEq,