pub struct PedersenCommitter<C: PrimeOrderCurve> {
pub generators: Vec<C>,
pub blinding_generator: C,
pub int_abs_val_bitwidth: usize,
generator_doublings: Vec<Vec<C>>,
}Expand description
For committing to vectors of integers and scalars using the Pedersen commitment scheme.
Fields§
§generators: Vec<C>vector of “g” generators, i.e. the generators that are exponentiated by the message elements themselves (length > 0) The first N generators are used to commit to a vector of N values. The last generator is used for scalar commitments.
blinding_generator: Cthe “h” generator which is exponentiated by the blinding factor
int_abs_val_bitwidth: usizeThe bitwidth of the absolute values of the integers that can be committed to using integral vector commit methods (has no bearing on scalar_commit and vector_commit).
generator_doublings: Vec<Vec<C>>Implementations§
Source§impl<C: PrimeOrderCurve> PedersenCommitter<C>
impl<C: PrimeOrderCurve> PedersenCommitter<C>
const DEFAULT_INT_ABS_VAL_BITWIDTH: usize = 8
Sourcepub fn new(
num_generators: usize,
public_string: &str,
int_abs_val_bitwidth: Option<usize>,
) -> Self
pub fn new( num_generators: usize, public_string: &str, int_abs_val_bitwidth: Option<usize>, ) -> Self
Creates a new PedersenCommitter with random generators. See also PedersenCommitter. Generators are sampled using the public string and the Shake256 hash function. Post: self.generators.len() == num_generators
Sourcepub fn scalar_commit_generator(&self) -> C
pub fn scalar_commit_generator(&self) -> C
Return the generator used for scalar commitments.
Sourcefn sample_generators(num_generators: usize, public_string: &str) -> Vec<C>
fn sample_generators(num_generators: usize, public_string: &str) -> Vec<C>
Sample generators using the public string and the Shake256 hash function. Pre: public_string.len() >= 32 Post: result.len() == num_generators TODO: make seekable (block cipher)
Sourcepub fn new_with_generators(
generators: Vec<C>,
blinding_generator: C,
int_abs_val_bitwidth: Option<usize>,
) -> Self
pub fn new_with_generators( generators: Vec<C>, blinding_generator: C, int_abs_val_bitwidth: Option<usize>, ) -> Self
Create a new PedersenCommitter with the provided generators.
See PedersenCommitter.
DEFAULT_INT_ABS_VAL_BITWIDTH is used for int_abs_val_bitwidth if None is provided.
Sourcepub fn unsigned_integer_vector_commit<T: Unsigned + Zero + ToBytes>(
&self,
message: &[T],
blinding: &C::Scalar,
) -> C
pub fn unsigned_integer_vector_commit<T: Unsigned + Zero + ToBytes>( &self, message: &[T], blinding: &C::Scalar, ) -> C
An optimized version of Pedersen vector commit when the message is comprised of values that fit within 128 bits.
Sourcepub fn u8_vector_commit(&self, message: &[u8], blinding: &C::Scalar) -> C
pub fn u8_vector_commit(&self, message: &[u8], blinding: &C::Scalar) -> C
Commits to the vector of u8s using the specified blinding factor. Uses the precomputed generator powers and the binary decomposition. Convient wrapper of integer_vector_commit. Pre: self.int_abs_val_bitwidth >= 8. Post: same result as vector_commit, assuming uints are smaller than scalar field order.
Sourcepub fn i8_vector_commit(&self, message: &[i8], blinding: &C::Scalar) -> C
pub fn i8_vector_commit(&self, message: &[i8], blinding: &C::Scalar) -> C
Commits to the vector of i8s using the specified blinding factor. Uses the precomputed generator powers and the binary decomposition. Convient wrapper of integer_vector_commit. Pre: self.int_abs_val_bitwidth >= 8. Post: same result as vector_commit, assuming ints are smaller than scalar field order.
Sourcepub fn integer_vector_commit<T: PrimInt>(
&self,
message: &[T],
message_is_negative_bits: &[bool],
blinding: &C::Scalar,
) -> C
pub fn integer_vector_commit<T: PrimInt>( &self, message: &[T], message_is_negative_bits: &[bool], blinding: &C::Scalar, ) -> C
Commits to the vector of integers using the specified blinding factor. Integers are provided as a vector of UNSIGNED ints and a vector of bits indicating whether the integer is negative. Pre: values in message are non-negative. Pre: values have unsigned binary expressions using at most (self.highest_generator_power + 1) bits. Pre: message.len() <= self.message_generators.len()
Sourcepub fn vector_commit(&self, message: &[C::Scalar], blinding: &C::Scalar) -> C
pub fn vector_commit(&self, message: &[C::Scalar], blinding: &C::Scalar) -> C
Commit to the provided vector using the specified blinding factor. The first message.len() generators are used to commit to the message. Note that self.int_abs_val_bitwidth is not relevant here. Pre: message.len() <= self.message_generators.len()
Sourcepub fn committed_vector(
&self,
message: &[C::Scalar],
blinding: &C::Scalar,
) -> CommittedVector<C>
pub fn committed_vector( &self, message: &[C::Scalar], blinding: &C::Scalar, ) -> CommittedVector<C>
Convenience wrapper of [self.vector_commit] that returns the commitment wrapped in a CommittedVector.
Sourcepub fn scalar_commit(&self, message: &C::Scalar, blinding: &C::Scalar) -> C
pub fn scalar_commit(&self, message: &C::Scalar, blinding: &C::Scalar) -> C
Commit to the provided scalar using the specified blinding factor. Note that self.int_abs_val_bitwidth is not relevant here. Pre: self.message_generators.len() >= 1
Sourcepub fn committed_scalar(
&self,
message: &C::Scalar,
blinding: &C::Scalar,
) -> CommittedScalar<C>
pub fn committed_scalar( &self, message: &C::Scalar, blinding: &C::Scalar, ) -> CommittedScalar<C>
Convenience wrapper of [self.scalar_commit] that returns the commitment wrapped in a CommittedScalar.
Trait Implementations§
Source§impl<C: Clone + PrimeOrderCurve> Clone for PedersenCommitter<C>
impl<C: Clone + PrimeOrderCurve> Clone for PedersenCommitter<C>
Source§fn clone(&self) -> PedersenCommitter<C>
fn clone(&self) -> PedersenCommitter<C>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl<C: Debug + PrimeOrderCurve> Debug for PedersenCommitter<C>
impl<C: Debug + PrimeOrderCurve> Debug for PedersenCommitter<C>
Source§impl<'de, C> Deserialize<'de> for PedersenCommitter<C>where
C: PrimeOrderCurve,
impl<'de, C> Deserialize<'de> for PedersenCommitter<C>where
C: PrimeOrderCurve,
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Source§impl<C> Serialize for PedersenCommitter<C>where
C: PrimeOrderCurve,
impl<C> Serialize for PedersenCommitter<C>where
C: PrimeOrderCurve,
Auto Trait Implementations§
impl<C> Freeze for PedersenCommitter<C>where
C: Freeze,
impl<C> RefUnwindSafe for PedersenCommitter<C>where
C: RefUnwindSafe,
impl<C> Send for PedersenCommitter<C>
impl<C> Sync for PedersenCommitter<C>
impl<C> Unpin for PedersenCommitter<C>where
C: Unpin,
impl<C> UnwindSafe for PedersenCommitter<C>where
C: UnwindSafe,
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> Conv for T
impl<T> Conv for T
§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
self to use its Binary implementation when Debug-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
self to use its Display implementation when
Debug-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
self to use its LowerExp implementation when
Debug-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
self to use its LowerHex implementation when
Debug-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
self to use its Octal implementation when Debug-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
self to use its Pointer implementation when
Debug-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
self to use its UpperExp implementation when
Debug-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
self to use its UpperHex implementation when
Debug-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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>
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>
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§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
self, then passes self.as_ref() into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self, then passes self.as_mut() into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self, then passes self.deref() into the pipe function.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B> of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B> of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R> view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R> view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap() only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut() only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow() only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut() only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref() only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut() only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref() only in debug builds, and is erased in release
builds.