Struct snarkvm_polycommit::kzg10::KZG10 [−][src]
KZG10
is an implementation of the polynomial commitment scheme of
Kate, Zaverucha and Goldbgerg
Implementations
impl<E: PairingEngine> KZG10<E>
[src]
pub fn setup<R: RngCore>(
max_degree: usize,
produce_g2_powers: bool,
rng: &mut R
) -> Result<UniversalParams<E>, Error>
[src]
max_degree: usize,
produce_g2_powers: bool,
rng: &mut R
) -> Result<UniversalParams<E>, Error>
Constructs public parameters when given as input the maximum degree degree
for the polynomial commitment scheme.
pub fn commit(
powers: &Powers<'_, E>,
polynomial: &Polynomial<E::Fr>,
hiding_bound: Option<usize>,
rng: Option<&mut dyn RngCore>
) -> Result<(Commitment<E>, Randomness<E>), Error>
[src]
powers: &Powers<'_, E>,
polynomial: &Polynomial<E::Fr>,
hiding_bound: Option<usize>,
rng: Option<&mut dyn RngCore>
) -> Result<(Commitment<E>, Randomness<E>), Error>
Outputs a commitment to polynomial
.
pub fn compute_witness_polynomial(
p: &Polynomial<E::Fr>,
point: E::Fr,
randomness: &Randomness<E>
) -> Result<(Polynomial<E::Fr>, Option<Polynomial<E::Fr>>), Error>
[src]
p: &Polynomial<E::Fr>,
point: E::Fr,
randomness: &Randomness<E>
) -> Result<(Polynomial<E::Fr>, Option<Polynomial<E::Fr>>), Error>
Compute witness polynomial.
The witness polynomial w(x) the quotient of the division (p(x) - p(z)) / (x - z) Observe that this quotient does not change with z because p(z) is the remainder term. We can therefore omit p(z) when computing the quotient.
pub fn check(
vk: &VerifierKey<E>,
comm: &Commitment<E>,
point: E::Fr,
value: E::Fr,
proof: &Proof<E>
) -> Result<bool, Error>
[src]
vk: &VerifierKey<E>,
comm: &Commitment<E>,
point: E::Fr,
value: E::Fr,
proof: &Proof<E>
) -> Result<bool, Error>
Verifies that value
is the evaluation at point
of the polynomial
committed inside comm
.
pub fn batch_check<R: RngCore>(
vk: &VerifierKey<E>,
commitments: impl ExactSizeIterator<Item = Commitment<E>>,
points: &[E::Fr],
values: &[E::Fr],
proofs: &[Proof<E>],
rng: &mut R
) -> Result<bool, Error>
[src]
vk: &VerifierKey<E>,
commitments: impl ExactSizeIterator<Item = Commitment<E>>,
points: &[E::Fr],
values: &[E::Fr],
proofs: &[Proof<E>],
rng: &mut R
) -> Result<bool, Error>
Check that each proof_i
in proofs
is a valid proof of evaluation for
commitment_i
at point_i
.
Trait Implementations
impl<E: Clone + PairingEngine> Clone for KZG10<E>
[src]
impl<E: Debug + PairingEngine> Debug for KZG10<E>
[src]
Auto Trait Implementations
impl<E> RefUnwindSafe for KZG10<E> where
E: RefUnwindSafe,
E: RefUnwindSafe,
impl<E> Send for KZG10<E>
impl<E> Sync for KZG10<E>
impl<E> Unpin for KZG10<E> where
E: Unpin,
E: Unpin,
impl<E> UnwindSafe for KZG10<E> where
E: UnwindSafe,
E: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> Pointable for T
pub const ALIGN: usize
type Init = T
The type for initializers.
pub unsafe fn init(init: <T as Pointable>::Init) -> usize
pub unsafe fn deref<'a>(ptr: usize) -> &'a T
pub unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T
pub unsafe fn drop(ptr: usize)
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,