Struct Polynomial 

pub struct Polynomial<F: Field>(pub Array<Elem<F>, U256>);

A Polynomial is a member of the ring R_q = Z_q[X] / (X^256) of degree-256 polynomials over the finite field with prime order q. Polynomials can be added, subtracted, negated, and multiplied by field elements. We do not define multiplication of polynomials here.

Tuple Fields

0: Array<Elem<F>, U256>

Implementations

impl<F: Field> Polynomial<F>

pub const fn new(x: Array<Elem<F>, U256>) -> Self

Trait Implementations

impl<F: Field> Add<&Polynomial<F>> for &Polynomial<F>

type Output = Polynomial<F>

The resulting type after applying the + operator.

fn add(self, rhs: &Polynomial<F>) -> Polynomial<F>

Performs the + operation.

impl AlgebraExt for Polynomial<BaseField>

fn mod_plus_minus<M: Unsigned>(&self) -> Self

fn infinity_norm(&self) -> u32

fn power2round(&self) -> (Self, Self)

fn high_bits<TwoGamma2: Unsigned>(&self) -> Self

fn low_bits<TwoGamma2: Unsigned>(&self) -> Self

impl<A, B> BitPack<A, B> for Polynomial<BaseField>

where (A, B): RangeEncodingSize,

type PackedSize = <<(A, B) as RangeEncodingSize>::EncodingSize as EncodingSize>::EncodedPolynomialSize

fn pack( &self, ) -> Array<u8, <<(A, B) as RangeEncodingSize>::EncodingSize as EncodingSize>::EncodedPolynomialSize>

fn unpack( enc: &Array<u8, <<(A, B) as RangeEncodingSize>::EncodingSize as EncodingSize>::EncodedPolynomialSize>, ) -> Self

impl<F: Clone + Field> Clone for Polynomial<F>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F: Debug + Field> Debug for Polynomial<F>

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

Formats the value using the given formatter.

impl<F: Default + Field> Default for Polynomial<F>

fn default() -> Polynomial<F>

Returns the “default value” for a type.

impl<F: Field, D: EncodingSize> Encode<D> for Polynomial<F>

type EncodedSize = <D as EncodingSize>::EncodedPolynomialSize

fn encode(&self) -> Array<u8, Self::EncodedSize>

fn decode(enc: &Array<u8, Self::EncodedSize>) -> Self

impl<F: Field> Mul<&Polynomial<F>> for Elem<F>

type Output = Polynomial<F>

The resulting type after applying the * operator.

fn mul(self, rhs: &Polynomial<F>) -> Polynomial<F>

Performs the * operation.

impl<F: Field> Neg for &Polynomial<F>

type Output = Polynomial<F>

The resulting type after applying the - operator.

fn neg(self) -> Polynomial<F>

Performs the unary - operation.

impl Ntt for Polynomial<BaseField>

type Output = NttPolynomial<BaseField>

fn ntt(&self) -> Self::Output

impl<F: PartialEq + Field> PartialEq for Polynomial<F>

fn eq(&self, other: &Polynomial<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: Field> Sub<&Polynomial<F>> for &Polynomial<F>

type Output = Polynomial<F>

The resulting type after applying the - operator.

fn sub(self, rhs: &Polynomial<F>) -> Polynomial<F>

Performs the - operation.

impl<F: Field> StructuralPartialEq for Polynomial<F>