Struct ark_poly_commit::marlin::marlin_pst13_pc::Randomness [−][src]
pub struct Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>, {
pub blinding_polynomial: P,
// some fields omitted
}
Expand description
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: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]
impl<E, P> Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]Does self
provide any hiding properties to the corresponding commitment?
self.is_hiding() == true
only if the underlying polynomial is non-zero.
What is the degree of the hiding polynomial for a given hiding bound?
Trait Implementations
impl<'a, E: PairingEngine, P: MVPolynomial<E::Fr>> Add<&'a Randomness<E, P>> for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]
impl<'a, E: PairingEngine, P: MVPolynomial<E::Fr>> Add<&'a Randomness<E, P>> for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]impl<'a, E, P> Add<(<E as PairingEngine>::Fr, &'a Randomness<E, P>)> for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]
impl<'a, E, P> Add<(<E as PairingEngine>::Fr, &'a Randomness<E, P>)> for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]impl<'a, E, P> AddAssign<&'a Randomness<E, P>> for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]
impl<'a, E, P> AddAssign<&'a Randomness<E, P>> for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]Performs the +=
operation. Read more
impl<'a, E, P> AddAssign<(<E as PairingEngine>::Fr, &'a Randomness<E, P>)> for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]
impl<'a, E, P> AddAssign<(<E as PairingEngine>::Fr, &'a Randomness<E, P>)> for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]Performs the +=
operation. Read more
impl<E, P> CanonicalDeserialize for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]
impl<E, P> CanonicalDeserialize for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]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
impl<E, P> CanonicalSerialize for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]
impl<E, P> CanonicalSerialize for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]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
impl<E, P> Clone for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]
impl<E, P> Clone for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]impl<E, P> Debug for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]
impl<E, P> Debug for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]impl<E, P> Hash for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]
impl<E, P> Hash for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]impl<E, P> PCRandomness for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]
impl<E, P> PCRandomness for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]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. Read more
impl<E, P> PartialEq<Randomness<E, P>> for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]
impl<E, P> PartialEq<Randomness<E, P>> for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]impl<E, P> Eq for Randomness<E, P> where
E: PairingEngine,
P: MVPolynomial<E::Fr>,
P::Point: Index<usize, Output = E::Fr>,
[src]Auto Trait Implementations
impl<E, P> RefUnwindSafe for Randomness<E, P> where
E: RefUnwindSafe,
P: RefUnwindSafe,
impl<E, P> Send for Randomness<E, P> where
P: Send,
impl<E, P> Sync for Randomness<E, P> where
P: Sync,
impl<E, P> Unpin for Randomness<E, P> where
E: Unpin,
P: Unpin,
impl<E, P> UnwindSafe for Randomness<E, P> where
E: UnwindSafe,
P: UnwindSafe,
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