Struct ark_poly_commit::kzg10::Randomness

pub struct Randomness<F: PrimeField, P: UVPolynomial<F>> {
    pub blinding_polynomial: P,
    // some fields omitted
}

Randomness hides the polynomial inside a commitment. It is output by KZG10::commit.

Fields

blinding_polynomial: P

For KZG10, the commitment randomness is a random polynomial.

Implementations

impl<F: PrimeField, P: UVPolynomial<F>> Randomness<F, P>

pub fn is_hiding(&self) -> bool

Does self provide any hiding properties to the corresponding commitment? self.is_hiding() == true only if the underlying polynomial is non-zero.

pub fn calculate_hiding_polynomial_degree(hiding_bound: usize) -> usize

What is the degree of the hiding polynomial for a given hiding bound?

Trait Implementations

impl<'a, F: PrimeField, P: UVPolynomial<F>> Add<&'a Randomness<F, P>> for Randomness<F, P>

type Output = Self

The resulting type after applying the + operator.

fn add(self, other: &'a Self) -> Self

Performs the + operation.

impl<'a, F: PrimeField, P: UVPolynomial<F>> Add<(F, &'a Randomness<F, P>)> for Randomness<F, P>

type Output = Self

The resulting type after applying the + operator.

fn add(self, other: (F, &'a Randomness<F, P>)) -> Self

Performs the + operation.

impl<'a, F: PrimeField, P: UVPolynomial<F>> AddAssign<&'a Randomness<F, P>> for Randomness<F, P>

fn add_assign(&mut self, other: &'a Self)

Performs the += operation.

impl<'a, F: PrimeField, P: UVPolynomial<F>> AddAssign<(F, &'a Randomness<F, P>)> for Randomness<F, P>

fn add_assign(&mut self, (f, other): (F, &'a Randomness<F, P>))

Performs the += operation.

impl<F: PrimeField, P: UVPolynomial<F>> CanonicalDeserialize for Randomness<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: PrimeField, P: UVPolynomial<F>> CanonicalSerialize for Randomness<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: PrimeField, P: UVPolynomial<F>> Clone for Randomness<F, P>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<F: PrimeField, P: UVPolynomial<F>> Debug for Randomness<F, P>

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

Formats the value using the given formatter.

impl<F: PrimeField, P: UVPolynomial<F>> Eq for Randomness<F, P>

impl<F: PrimeField, P: UVPolynomial<F>> Hash for Randomness<F, P>

fn hash<__HFP>(&self, __state: &mut __HFP) where
    __HFP: Hasher, 

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl<F: PrimeField, P: UVPolynomial<F>> PCRandomness for Randomness<F, P>

fn empty() -> Self

Outputs empty randomness that does not hide the commitment.

fn rand<R: RngCore>(
    hiding_bound: usize,
    _: bool,
    _: Option<usize>,
    rng: &mut R
) -> Self

Samples randomness for commitments; num_queries specifies the number of queries that the commitment will be opened at. has_degree_bound indicates that the corresponding commitment has an enforced num_vars specifies the number of variables for multivariate commitment. strict degree bound.

impl<F: PrimeField, P: UVPolynomial<F>> PartialEq<Randomness<F, P>> for Randomness<F, P>

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use]pub fn ne(&self, other: &Rhs) -> bool

This method tests for !=.