# [−][src]Struct bulletproofs::generators::BulletproofGens

pub struct BulletproofGens {
pub gens_capacity: usize,
pub party_capacity: usize,
G_vec: Vec<Vec<RistrettoPoint>>,
H_vec: Vec<Vec<RistrettoPoint>>,
}

The BulletproofGens struct contains all the generators needed for aggregating up to m range proofs of up to n bits each.

# Extensible Generator Generation

Instead of constructing a single vector of size m*n, as described in the Bulletproofs paper, we construct each party's generators separately.

To construct an arbitrary-length chain of generators, we apply SHAKE256 to a domain separator label, and feed each 64 bytes of XOF output into the ristretto255 hash-to-group function. Each of the m parties' generators are constructed using a different domain separation label, and proving and verification uses the first n elements of the arbitrary-length chain.

This means that the aggregation size (number of parties) is orthogonal to the rangeproof size (number of bits), and allows using the same BulletproofGens object for different proving parameters.

This construction is also forward-compatible with constraint system proofs, which use a much larger slice of the generator chain, and even forward-compatible to multiparty aggregation of constraint system proofs, since the generators are namespaced by their party index.

## Fields

gens_capacity: usize

The maximum number of usable generators for each party.

party_capacity: usize

Number of values or parties

G_vec: Vec<Vec<RistrettoPoint>>

Precomputed $$\mathbf G$$ generators for each party.

H_vec: Vec<Vec<RistrettoPoint>>

Precomputed $$\mathbf H$$ generators for each party.

## Methods

### impl BulletproofGens[src]

#### pub fn new(gens_capacity: usize, party_capacity: usize) -> Self[src]

Create a new BulletproofGens object.

# Inputs

• gens_capacity is the number of generators to precompute for each party. For rangeproofs, it is sufficient to pass 64, the maximum bitsize of the rangeproofs. For circuit proofs, the capacity must be greater than the number of multipliers, rounded up to the next power of two.

• party_capacity is the maximum number of parties that can produce an aggregated proof.

#### pub fn share(&self, j: usize) -> BulletproofGensShare[src]

Returns j-th share of generators, with an appropriate slice of vectors G and H for the j-th range proof.

#### pub fn increase_capacity(&mut self, new_capacity: usize)[src]

Increases the generators' capacity to the amount specified. If less than or equal to the current capacity, does nothing.

#### pub(crate) fn G(    &self,     n: usize,     m: usize) -> impl Iterator<Item = &RistrettoPoint>[src]

Return an iterator over the aggregation of the parties' G generators with given size n.

#### pub(crate) fn H(    &self,     n: usize,     m: usize) -> impl Iterator<Item = &RistrettoPoint>[src]

Return an iterator over the aggregation of the parties' H generators with given size n.

## Blanket Implementations

### impl<T> Same<T> for T

#### type Output = T

Should always be Self

### impl<T> ToOwned for T where    T: Clone, [src]

#### type Owned = T

The resulting type after obtaining ownership.

### impl<T, U> TryFrom<U> for T where    U: Into<T>, [src]

#### type Error = !

The type returned in the event of a conversion error.

### impl<T, U> TryInto<U> for T where    U: TryFrom<T>, [src]

#### type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.