1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
pub use crate::crh::pedersen_parameters::PedersenSize;
use crate::{
commitment::PedersenCommitmentParameters,
errors::CommitmentError,
traits::{CommitmentScheme, CRH},
};
use snarkvm_curves::traits::Group;
use snarkvm_fields::PrimeField;
use snarkvm_utilities::bititerator::BitIteratorBE;
use rand::Rng;
#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord)]
pub struct PedersenCommitment<G: Group, S: PedersenSize> {
pub parameters: PedersenCommitmentParameters<G, S>,
}
impl<G: Group, S: PedersenSize> CommitmentScheme for PedersenCommitment<G, S> {
type Output = G;
type Parameters = PedersenCommitmentParameters<G, S>;
type Randomness = G::ScalarField;
fn setup<R: Rng>(rng: &mut R) -> Self {
Self {
parameters: PedersenCommitmentParameters::setup(rng),
}
}
fn commit(&self, input: &[u8], randomness: &Self::Randomness) -> Result<Self::Output, CommitmentError> {
if input.len() > S::WINDOW_SIZE * S::NUM_WINDOWS {
return Err(CommitmentError::IncorrectInputLength(
input.len(),
S::WINDOW_SIZE,
S::NUM_WINDOWS,
));
}
let mut output = self.parameters.crh.hash(&input)?;
let mut scalar_bits = BitIteratorBE::new(randomness.into_repr()).collect::<Vec<_>>();
scalar_bits.reverse();
for (bit, power) in scalar_bits.into_iter().zip(&self.parameters.random_base) {
if bit {
output += power
}
}
Ok(output)
}
fn parameters(&self) -> &Self::Parameters {
&self.parameters
}
}
impl<G: Group, S: PedersenSize> From<PedersenCommitmentParameters<G, S>> for PedersenCommitment<G, S> {
fn from(parameters: PedersenCommitmentParameters<G, S>) -> Self {
Self { parameters }
}
}