pub struct JubjubBls12 { /* private fields */ }
Implementations§
Source§impl JubjubBls12
impl JubjubBls12
Trait Implementations§
Source§impl JubjubParams<Bls12> for JubjubBls12
impl JubjubParams<Bls12> for JubjubBls12
Source§fn montgomery_a(&self) -> &Fr
fn montgomery_a(&self) -> &Fr
The
A
constant of the birationally equivalent Montgomery curve.Source§fn montgomery_2a(&self) -> &Fr
fn montgomery_2a(&self) -> &Fr
The
A
constant, doubled.Source§fn pedersen_hash_generators(&self) -> &[Point<Bls12, PrimeOrder>]
fn pedersen_hash_generators(&self) -> &[Point<Bls12, PrimeOrder>]
Returns the generators (for each segment) used in all Pedersen commitments.
Source§fn pedersen_hash_exp_table(&self) -> &[Vec<Vec<Point<Bls12, PrimeOrder>>>]
fn pedersen_hash_exp_table(&self) -> &[Vec<Vec<Point<Bls12, PrimeOrder>>>]
Returns the exp table for Pedersen hashes.
Source§fn pedersen_hash_chunks_per_generator(&self) -> usize
fn pedersen_hash_chunks_per_generator(&self) -> usize
Returns the maximum number of chunks per segment of the Pedersen hash.
Source§fn fixed_base_chunks_per_generator(&self) -> usize
fn fixed_base_chunks_per_generator(&self) -> usize
Returns the number of chunks needed to represent a full scalar during fixed-base
exponentiation.
Source§fn pedersen_circuit_generators(&self) -> &[Vec<Vec<(Fr, Fr)>>]
fn pedersen_circuit_generators(&self) -> &[Vec<Vec<(Fr, Fr)>>]
Returns the pre-computed window tables [-4, 3, 2, 1, 1, 2, 3, 4] of different
magnitudes of the Pedersen hash segment generators.
Source§fn generator(&self, base: FixedGenerators) -> &Point<Bls12, PrimeOrder>
fn generator(&self, base: FixedGenerators) -> &Point<Bls12, PrimeOrder>
Returns a fixed generator.
Source§fn circuit_generators(&self, base: FixedGenerators) -> &[Vec<(Fr, Fr)>]
fn circuit_generators(&self, base: FixedGenerators) -> &[Vec<(Fr, Fr)>]
Returns a window table [0, 1, …, 8] for different magnitudes of some
fixed generator.
Source§fn pedersen_hash_exp_window_size(&self) -> u32
fn pedersen_hash_exp_window_size(&self) -> u32
Returns the window size for exponentiation of Pedersen hash generators
outside the circuit
Auto Trait Implementations§
impl Freeze for JubjubBls12
impl RefUnwindSafe for JubjubBls12
impl Send for JubjubBls12
impl Sync for JubjubBls12
impl Unpin for JubjubBls12
impl UnwindSafe for JubjubBls12
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more