Struct ark_poly_commit::marlin::marlin_pst13_pc::Randomness

pub struct Randomness<E, P>where
    E: Pairing,
    P: DenseMVPolynomial<E::ScalarField>,
    P::Point: Index<usize, Output = E::ScalarField>,{
    pub blinding_polynomial: P,
    /* private fields */
}

Randomness hides the polynomial inside a commitment`.

Fields

blinding_polynomial: P

A multivariate polynomial where each monomial is univariate with random coefficient

Implementations

impl<E, P> Randomness<E, P>where E: Pairing, P: DenseMVPolynomial<E::ScalarField>, P::Point: Index<usize, Output = E::ScalarField>,

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, E, P> Add<&'a Randomness<E, P>> for Randomness<E, P>where E: Pairing, P: DenseMVPolynomial<E::ScalarField>, P::Point: Index<usize, Output = E::ScalarField>,

type Output = Randomness<E, P>

The resulting type after applying the + operator.

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

Performs the + operation.

impl<'a, E, P> Add<(<E as Pairing>::ScalarField, &'a Randomness<E, P>)> for Randomness<E, P>where E: Pairing, P: DenseMVPolynomial<E::ScalarField>, P::Point: Index<usize, Output = E::ScalarField>,

type Output = Randomness<E, P>

The resulting type after applying the + operator.

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

Performs the + operation.

impl<'a, E, P> AddAssign<&'a Randomness<E, P>> for Randomness<E, P>where E: Pairing, P: DenseMVPolynomial<E::ScalarField>, P::Point: Index<usize, Output = E::ScalarField>,

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

Performs the += operation.

impl<'a, E, P> AddAssign<(<E as Pairing>::ScalarField, &'a Randomness<E, P>)> for Randomness<E, P>where E: Pairing, P: DenseMVPolynomial<E::ScalarField>, P::Point: Index<usize, Output = E::ScalarField>,

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

Performs the += operation.

impl<E, P> CanonicalDeserialize for Randomness<E, P>where E: Pairing, P: DenseMVPolynomial<E::ScalarField>, P::Point: Index<usize, Output = E::ScalarField>,

fn deserialize_with_mode<R: Read>( reader: R, compress: Compress, validate: Validate ) -> Result<Self, SerializationError>

The general deserialize method that takes in customization flags.

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

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

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

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

impl<E, P> CanonicalSerialize for Randomness<E, P>where E: Pairing, P: DenseMVPolynomial<E::ScalarField>, P::Point: Index<usize, Output = E::ScalarField>,

fn serialize_with_mode<W: Write>( &self, writer: W, compress: Compress ) -> Result<(), SerializationError>

The general serialize method that takes in customization flags.

fn serialized_size(&self, compress: Compress) -> usize

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

fn compressed_size(&self) -> usize

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

fn uncompressed_size(&self) -> usize

impl<E, P> Clone for Randomness<E, P>where E: Pairing, P: DenseMVPolynomial<E::ScalarField>, P::Point: Index<usize, Output = E::ScalarField>,

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<E, P> Debug for Randomness<E, P>where E: Pairing, P: DenseMVPolynomial<E::ScalarField>, P::Point: Index<usize, Output = E::ScalarField>,

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

Formats the value using the given formatter.

impl<E, P> Hash for Randomness<E, P>where E: Pairing, P: DenseMVPolynomial<E::ScalarField>, P::Point: Index<usize, Output = E::ScalarField>,

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<E, P> PCRandomness for Randomness<E, P>where E: Pairing, P: DenseMVPolynomial<E::ScalarField>, P::Point: Index<usize, Output = E::ScalarField>,

fn empty() -> Self

Outputs empty randomness that does not hide the commitment.

fn rand<R: RngCore>( hiding_bound: usize, _: bool, num_vars: 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<E, P> PartialEq<Randomness<E, P>> for Randomness<E, P>where E: Pairing, P: DenseMVPolynomial<E::ScalarField>, P::Point: Index<usize, Output = E::ScalarField>,

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

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

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<E, P> Valid for Randomness<E, P>where E: Pairing, P: DenseMVPolynomial<E::ScalarField>, P::Point: Index<usize, Output = E::ScalarField>,

fn check(&self) -> Result<(), SerializationError>

fn batch_check<'a>( batch: impl Iterator<Item = &'a Self> + Send ) -> Result<(), SerializationError>where Self: 'a,

impl<E, P> Eq for Randomness<E, P>where E: Pairing, P: DenseMVPolynomial<E::ScalarField>, P::Point: Index<usize, Output = E::ScalarField>,