Struct ark_poly_commit::data_structures::LabeledPolynomial [−][src]
pub struct LabeledPolynomial<F: Field, P: Polynomial<F>> { /* fields omitted */ }
Expand description
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
Construct a new labeled polynomial.
Retrieve the polynomial from self
Retrieve the degree bound in self
.
Retrieve the hiding bound for the polynomial in self
.
Trait Implementations
Reads Self
from reader
.
Reads Self
from reader
without compression.
Reads self
from reader
without compression, and without performing
validity checks. Should be used only when the input is trusted. Read more
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. Read more
Serializes self
into writer
without compression.
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. Read more
Auto Trait Implementations
impl<F, P> !RefUnwindSafe for LabeledPolynomial<F, P>
impl<F, P> !Send for LabeledPolynomial<F, P>
impl<F, P> !Sync for LabeledPolynomial<F, P>
impl<F, P> Unpin for LabeledPolynomial<F, P> where
F: Unpin,
impl<F, P> UnwindSafe for LabeledPolynomial<F, P> where
F: UnwindSafe,
P: RefUnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
fn hash_uncompressed<H>(&self) -> GenericArray<u8, <H as Digest>::OutputSize> where
H: Digest,
[src]type Output = T
type Output = T
Should always be Self
pub fn vzip(self) -> V