Struct bellperson::groth16::aggregate::ProverSRS [−][src]
pub struct ProverSRS<E: Engine> { pub n: usize, pub g_alpha_powers_table: MultiscalarPrecompOwned<E::G1Affine>, pub h_alpha_powers_table: MultiscalarPrecompOwned<E::G2Affine>, pub g_beta_powers_table: MultiscalarPrecompOwned<E::G1Affine>, pub h_beta_powers_table: MultiscalarPrecompOwned<E::G2Affine>, pub vkey: VKey<E>, pub wkey: WKey<E>, }
Expand description
ProverSRS is the specialized SRS version for the prover for a specific number of proofs to aggregate. It contains as well the commitment keys for this specific size. Note the size must be a power of two for the moment - if it is not, padding must be applied.
Fields
n: usize
number of proofs to aggregate
g_alpha_powers_table: MultiscalarPrecompOwned<E::G1Affine>
${g^a^i}_{i=0}^{2n-1}$ where n is the number of proofs to be aggregated We take all powers instead of only ones from n -> 2n-1 (w commitment key is formed from these powers) since the prover will create a shifted polynomial of degree 2n-1 when doing the KZG opening proof.
h_alpha_powers_table: MultiscalarPrecompOwned<E::G2Affine>
${h^a^i}_{i=0}^{n-1}$ - here we don’t need to go to 2n-1 since v commitment key only goes up to n-1 exponent.
g_beta_powers_table: MultiscalarPrecompOwned<E::G1Affine>
${g^b^i}_{i=0}^{2n-1}$
h_beta_powers_table: MultiscalarPrecompOwned<E::G2Affine>
${h^b^i}_{i=0}^{n-1}$
vkey: VKey<E>
commitment key using in MIPP and TIPP
wkey: WKey<E>
commitment key using in TIPP
Implementations
impl<E: Engine> ProverSRS<E>
[src]
impl<E: Engine> ProverSRS<E>
[src]pub fn has_correct_len(&self, n: usize) -> bool
[src]
pub fn has_correct_len(&self, n: usize) -> bool
[src]Returns true if commitment keys have the exact required length. It is necessary for the IPP scheme to work that commitment key have the exact same number of arguments as the number of proofs to aggregate.
Trait Implementations
Auto Trait Implementations
impl<E> RefUnwindSafe for ProverSRS<E> where
<E as Engine>::G1Affine: RefUnwindSafe,
<E as Engine>::G2Affine: RefUnwindSafe,
<E as Engine>::G1Affine: RefUnwindSafe,
<E as Engine>::G2Affine: RefUnwindSafe,
impl<E> Send for ProverSRS<E>
impl<E> Sync for ProverSRS<E>
impl<E> Unpin for ProverSRS<E> where
<E as Engine>::G1Affine: Unpin,
<E as Engine>::G2Affine: Unpin,
<E as Engine>::G1Affine: Unpin,
<E as Engine>::G2Affine: Unpin,
impl<E> UnwindSafe for ProverSRS<E> where
<E as Engine>::G1Affine: UnwindSafe,
<E as Engine>::G2Affine: UnwindSafe,
<E as Engine>::G1Affine: UnwindSafe,
<E as Engine>::G2Affine: UnwindSafe,
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
type Output = T
Should always be Self
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,