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.

Tuple Fields

0: Array<Elem<F>, U256>

Implementations

impl<F: Field> Polynomial<F>

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

Create a new polynomial.

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<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

Size of the encoded object.

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

Encode object.

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

Decode object.

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<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> Zeroize for Polynomial<F>

where F::Int: Zeroize,

Available on crate feature zeroize only.

fn zeroize(&mut self)

Zero out this object from memory using Rust intrinsics which ensure the zeroization operation is not “optimized away” by the compiler.

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

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