pub struct PedersenGens {
pub g: AffinePoint,
pub h: AffinePoint,
}Expand description
Generator pair for Pedersen commitments: C = v·G + r·H.
H is derived by try-and-increment hashing of a fixed label, so
nobody knows the discrete log of H with respect to G.
Fields§
§g: AffinePointStandard base generator.
h: AffinePointNothing-up-my-sleeve second generator.
Implementations§
Source§impl PedersenGens
impl PedersenGens
Trait Implementations§
Source§impl Clone for PedersenGens
impl Clone for PedersenGens
Source§fn clone(&self) -> PedersenGens
fn clone(&self) -> PedersenGens
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreimpl Copy for PedersenGens
Auto Trait Implementations§
impl Freeze for PedersenGens
impl RefUnwindSafe for PedersenGens
impl Send for PedersenGens
impl Sync for PedersenGens
impl Unpin for PedersenGens
impl UnsafeUnpin for PedersenGens
impl UnwindSafe for PedersenGens
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