Struct snarkos_polycommit::data_structures::LabeledPolynomial

pub struct LabeledPolynomial<'a, F: Field> { /* fields omitted */ }

A polynomial along with information about its degree bound (if any), and the maximum number of queries that will be made to it. This latter number determines the amount of protection that will be provided to a commitment for this polynomial.

Implementations

impl<'a, F: Field> LabeledPolynomial<'a, F>

pub fn new_owned(
    label: PolynomialLabel,
    polynomial: Polynomial<F>,
    degree_bound: Option<usize>,
    hiding_bound: Option<usize>
) -> Self

Construct a new labeled polynomial by consuming polynomial.

pub fn new(
    label: PolynomialLabel,
    polynomial: &'a Polynomial<F>,
    degree_bound: Option<usize>,
    hiding_bound: Option<usize>
) -> Self

Construct a new labeled polynomial.

pub fn label(&self) -> &String

Return the label for self.

pub fn polynomial(&self) -> &Polynomial<F>

Retrieve the polynomial from self.

pub fn evaluate(&self, point: F) -> F

Evaluate the polynomial in self.

pub fn degree_bound(&self) -> Option<usize>

Retrieve the degree bound in self.

pub fn is_hiding(&self) -> bool

Retrieve whether the polynomial in self should be hidden.

pub fn hiding_bound(&self) -> Option<usize>

Retrieve the hiding bound for the polynomial in self.

Methods from Deref<Target = Polynomial<F>>

pub fn is_zero(&self) -> bool

Checks if the given polynomial is zero.

pub fn degree(&self) -> usize

Returns the degree of the polynomial.

pub fn evaluate(&self, point: F) -> F

Evaluates self at the given point in the field.

pub fn naive_mul(&self, other: &DensePolynomial<F>) -> DensePolynomial<F>

Perform a naive n^2 multiplicatoin of self by other.

pub fn mul_by_vanishing_poly(
    &self,
    domain: EvaluationDomain<F>
) -> DensePolynomial<F>

Multiply self by the vanishing polynomial for the domain domain. Returns the quotient and remainder of the division.

pub fn divide_by_vanishing_poly(
    &self,
    domain: EvaluationDomain<F>
) -> Option<(DensePolynomial<F>, DensePolynomial<F>)>

Divide self by the vanishing polynomial for the domain domain. Returns the quotient and remainder of the division.

pub fn evaluate_over_domain_by_ref(
    &self,
    domain: EvaluationDomain<F>
) -> Evaluations<F>

Evaluate self over domain.

Trait Implementations

impl<'a, F: Field> CanonicalDeserialize for LabeledPolynomial<'a, F>

fn deserialize<R: Read>(reader: &mut R) -> Result<Self, SerializationError>

Reads Self from reader.

fn deserialize_uncompressed<R: Read>(
    reader: &mut R
) -> Result<Self, SerializationError>

Reads Self from reader without compression.

impl<'a, F: Field> CanonicalSerialize for LabeledPolynomial<'a, F>

fn serialize<W: Write>(&self, writer: &mut W) -> Result<(), SerializationError>

Serializes self into writer.

fn serialized_size(&self) -> usize

fn serialize_uncompressed<W: Write>(
    &self,
    writer: &mut W
) -> Result<(), SerializationError>

Serializes self into writer without compression.

fn uncompressed_size(&self) -> usize

impl<'a, F: Clone + Field> Clone for LabeledPolynomial<'a, F>

fn clone(&self) -> LabeledPolynomial<'a, F>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, F: Debug + Field> Debug for LabeledPolynomial<'a, F>

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

Formats the value using the given formatter.

impl<'a, F: Field> Deref for LabeledPolynomial<'a, F>

type Target = Polynomial<F>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.