Skip to main content

Pedersen

sonobe_primitives::commitments::pedersen

Struct Pedersen 

Source 
pub struct Pedersen<C: SonobeCurve, const H: bool> { /* private fields */ }
Expand description

Pedersen defines the out-of-circuit Pedersen widget, where H controls whether the scheme is hiding or not.

Trait Implementations§

Source§

impl<C: Clone + SonobeCurve, const H: bool> Clone for Pedersen<C, H>

Source§

fn clone(&self) -> Pedersen<C, H>

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl<C: SonobeCurve> CommitmentDef for Pedersen<C, false>

Source§

const IS_HIDING: bool = false

CommitmentDef::IS_HIDING indicates whether the commitment scheme has the hiding property.
Source§

type Key = PedersenKey<C, false>

CommitmentDef::Key is the type of the commitment key.
Source§

type Scalar = <C as PrimeGroup>::ScalarField

CommitmentDef::Scalar is the type of the scalars being committed to. Read more
Source§

type Commitment = C

CommitmentDef::Commitment is the type of the commitment. Read more
Source§

type Randomness = Null

CommitmentDef::Randomness is the type of the randomness used in the commitment. Read more
Source§

impl<C: SonobeCurve> CommitmentDef for Pedersen<C, true>

Source§

const IS_HIDING: bool = true

CommitmentDef::IS_HIDING indicates whether the commitment scheme has the hiding property.
Source§

type Key = PedersenKey<C, true>

CommitmentDef::Key is the type of the commitment key.
Source§

type Scalar = <C as PrimeGroup>::ScalarField

CommitmentDef::Scalar is the type of the scalars being committed to. Read more
Source§

type Commitment = C

CommitmentDef::Commitment is the type of the commitment. Read more
Source§

type Randomness = <C as PrimeGroup>::ScalarField

CommitmentDef::Randomness is the type of the randomness used in the commitment. Read more
Source§

impl<C: SonobeCurve> CommitmentOps for Pedersen<C, false>

Source§

fn generate_key( len: usize, rng: impl RngCore, ) -> Result<PedersenKey<C, false>, Error>

CommitmentOps::generate_key defines the key generation algorithm, which is a randomized algorithm that takes as input the maximum length len of supported messages, and a randomness source rng, and outputs the commitment key.
Source§

fn commit( ck: &PedersenKey<C, false>, v: &[CF1<C>], _rng: impl RngCore, ) -> Result<(C, Null), Error>

CommitmentOps::commit defines the commitment generation algorithm, which is a (probably) randomized algorithm that takes as input commitment key ck, a vector of scalars v to be committed to, and a randomness source rng, and outputs the commitment and the randomness.
Source§

fn open( ck: &PedersenKey<C, false>, v: &[CF1<C>], _r: &Null, cm: &C, ) -> Result<(), Error>

CommitmentOps::open defines the commitment opening algorithm, which is a deterministic algorithm that takes as input commitment key ck, a vector of scalars v, the randomness r, and a commitment cm, and outputs Ok(()) if the opening verifies, or an error otherwise.
Source§

impl<C: SonobeCurve> CommitmentOps for Pedersen<C, true>

Source§

fn generate_key( len: usize, rng: impl RngCore, ) -> Result<PedersenKey<C, true>, Error>

CommitmentOps::generate_key defines the key generation algorithm, which is a randomized algorithm that takes as input the maximum length len of supported messages, and a randomness source rng, and outputs the commitment key.
Source§

fn commit( ck: &PedersenKey<C, true>, v: &[CF1<C>], rng: impl RngCore, ) -> Result<(C, CF1<C>), Error>

CommitmentOps::commit defines the commitment generation algorithm, which is a (probably) randomized algorithm that takes as input commitment key ck, a vector of scalars v to be committed to, and a randomness source rng, and outputs the commitment and the randomness.
Source§

fn open( ck: &PedersenKey<C, true>, v: &[CF1<C>], r: &CF1<C>, cm: &C, ) -> Result<(), Error>

CommitmentOps::open defines the commitment opening algorithm, which is a deterministic algorithm that takes as input commitment key ck, a vector of scalars v, the randomness r, and a commitment cm, and outputs Ok(()) if the opening verifies, or an error otherwise.
Source§

impl<C: Debug + SonobeCurve, const H: bool> Debug for Pedersen<C, H>

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl<C: Eq + SonobeCurve, const H: bool> Eq for Pedersen<C, H>

Source§

impl<C: SonobeCurve> GroupBasedCommitment for Pedersen<C, false>

Source§

type Gadget1 = PedersenGadget<C, false>

GroupBasedCommitment::Gadget1 points to the in-circuit gadget for the group-based commitment scheme over the curve’s base field.
Source§

type Gadget2 = PedersenEmulatedGadget<C, false>

GroupBasedCommitment::Gadget2 points to the in-circuit gadget for the group-based commitment scheme over the curve’s scalar field.
Source§

impl<C: SonobeCurve> GroupBasedCommitment for Pedersen<C, true>

Source§

type Gadget1 = PedersenGadget<C, true>

GroupBasedCommitment::Gadget1 points to the in-circuit gadget for the group-based commitment scheme over the curve’s base field.
Source§

type Gadget2 = PedersenEmulatedGadget<C, true>

GroupBasedCommitment::Gadget2 points to the in-circuit gadget for the group-based commitment scheme over the curve’s scalar field.
Source§

impl<C: PartialEq + SonobeCurve, const H: bool> PartialEq for Pedersen<C, H>

Source§

fn eq(&self, other: &Pedersen<C, H>) -> bool

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=. Read more
Source§

impl<C: PartialEq + SonobeCurve, const H: bool> StructuralPartialEq for Pedersen<C, H>

Auto Trait Implementations§

§

impl<C, const H: bool> Freeze for Pedersen<C, H>
where <C as Val>::Var: Sized, <C as CurveGroup>::Config: Sized, <<C as CurveGroup>::BaseField as Val>::Var: for<'a> Sized, <C as CurveGroup>::BaseField: Sized, <<C as PrimeGroup>::ScalarField as Val>::Var: for<'a> Sized, <C as PrimeGroup>::ScalarField: Sized,

§

impl<C, const H: bool> RefUnwindSafe for Pedersen<C, H>
where <C as Val>::Var: Sized, <C as CurveGroup>::Config: Sized, <<C as CurveGroup>::BaseField as Val>::Var: for<'a> Sized, <C as CurveGroup>::BaseField: Sized, <<C as PrimeGroup>::ScalarField as Val>::Var: for<'a> Sized, <C as PrimeGroup>::ScalarField: Sized, C: RefUnwindSafe,

§

impl<C, const H: bool> Send for Pedersen<C, H>
where <C as Val>::Var: Sized, <C as CurveGroup>::Config: Sized, <<C as CurveGroup>::BaseField as Val>::Var: for<'a> Sized, <C as CurveGroup>::BaseField: Sized, <<C as PrimeGroup>::ScalarField as Val>::Var: for<'a> Sized, <C as PrimeGroup>::ScalarField: Sized,

§

impl<C, const H: bool> Sync for Pedersen<C, H>
where <C as Val>::Var: Sized, <C as CurveGroup>::Config: Sized, <<C as CurveGroup>::BaseField as Val>::Var: for<'a> Sized, <C as CurveGroup>::BaseField: Sized, <<C as PrimeGroup>::ScalarField as Val>::Var: for<'a> Sized, <C as PrimeGroup>::ScalarField: Sized,

§

impl<C, const H: bool> Unpin for Pedersen<C, H>
where <C as Val>::Var: Sized, <C as CurveGroup>::Config: Sized, <<C as CurveGroup>::BaseField as Val>::Var: for<'a> Sized, <C as CurveGroup>::BaseField: Sized, <<C as PrimeGroup>::ScalarField as Val>::Var: for<'a> Sized, <C as PrimeGroup>::ScalarField: Sized, C: Unpin,

§

impl<C, const H: bool> UnsafeUnpin for Pedersen<C, H>
where <C as Val>::Var: Sized, <C as CurveGroup>::Config: Sized, <<C as CurveGroup>::BaseField as Val>::Var: for<'a> Sized, <C as CurveGroup>::BaseField: Sized, <<C as PrimeGroup>::ScalarField as Val>::Var: for<'a> Sized, <C as PrimeGroup>::ScalarField: Sized,

§

impl<C, const H: bool> UnwindSafe for Pedersen<C, H>
where <C as Val>::Var: Sized, <C as CurveGroup>::Config: Sized, <<C as CurveGroup>::BaseField as Val>::Var: for<'a> Sized, <C as CurveGroup>::BaseField: Sized, <<C as PrimeGroup>::ScalarField as Val>::Var: for<'a> Sized, <C as PrimeGroup>::ScalarField: Sized, C: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

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

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more