Struct ark_poly_commit::data_structures::LabeledPolynomial

pub struct LabeledPolynomial<F: Field, P: Polynomial<F>> { /* 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, P: Polynomial<F>> LabeledPolynomial<F, P>

pub fn new(
    label: PolynomialLabel,
    polynomial: P,
    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) -> &P

Retrieve the polynomial from self

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

Evaluate the polynomial in self.

pub fn degree(&self) -> usize

Retrieve the degree of 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.

Trait Implementations

impl<F: Field, P: Polynomial<F>> CanonicalDeserialize for LabeledPolynomial<F, P>

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

Reads Self from reader.

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

Reads Self from reader without compression.

fn deserialize_unchecked<R: Read>(reader: R) -> Result<Self, SerializationError>

Reads self from reader without compression, and without performing validity checks. Should be used only when the input is trusted.

impl<F: Field, P: Polynomial<F>> CanonicalSerialize for LabeledPolynomial<F, P>

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

Serializes self into writer. It is left up to a particular type for how it strikes the serialization efficiency vs compression tradeoff. For standard types (e.g. bool, lengths, etc.) typically an uncompressed form is used, whereas for algebraic types compressed forms are used.

fn serialized_size(&self) -> usize

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

Serializes self into writer without compression.

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

Serializes self into writer without compression, and without performing validity checks. Should be used only when there is no danger of adversarial manipulation of the output.

fn uncompressed_size(&self) -> usize

impl<F: Clone + Field, P: Clone + Polynomial<F>> Clone for LabeledPolynomial<F, P>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<F: Debug + Field, P: Debug + Polynomial<F>> Debug for LabeledPolynomial<F, P>

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

Formats the value using the given formatter.

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

type Target = P

The resulting type after dereferencing.

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

Dereferences the value.