Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Run bench on CI #16

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Run bench on CI #16

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 3 additions & 0 deletions .github/workflows/ci.yml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -73,6 +73,9 @@ jobs:

- name: Test
run: cargo test -- --test-threads=1

- name: Bench
run: cargo bench

docs:
name: Docs
Expand Down
176 changes: 99 additions & 77 deletions benches/perf.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,6 +11,8 @@ use ark_std::UniformRand;
use core::iter;
use core::time::Duration;
use criterion::*;
use curdleproofs::whisk::g1_generator;
use curdleproofs::whisk::rand_scalar;
use std::ops::Mul;

use curdleproofs::curdleproofs::{generate_crs, CurdleproofsProof};
Expand All @@ -26,87 +28,107 @@ fn apply_permutation_group(vec_a: Vec<G1Affine>, permutation: &Vec<u32>) -> Vec<
fn benchmark_shuffle(c: &mut Criterion) {
let mut rng = StdRng::seed_from_u64(0u64);

let N = 512;
let N_VALUES = [16, 32, 64, 128];
let N_BLINDERS = 4;
let ell = N - N_BLINDERS;

// Construct the CRS
let crs = generate_crs(ell);

// Get witnesses: the permutation, the randomizer, and a bunch of blinders
let mut permutation: Vec<u32> = (0..ell as u32).collect();
permutation.shuffle(&mut rng);
let k = Fr::rand(&mut rng);
let vec_r_m = generate_blinders(&mut rng, N_BLINDERS);

// Get shuffle inputs
let vec_R: Vec<G1Affine> = iter::repeat_with(|| G1Projective::rand(&mut rng).into_affine())
.take(ell)
.collect();
let vec_S: Vec<G1Affine> = iter::repeat_with(|| G1Projective::rand(&mut rng).into_affine())
.take(ell)
.collect();

// Derive shuffled outputs
c.bench_function("shuffling", |b| {
b.iter(|| {
let mut vec_T: Vec<G1Affine> = vec_R.iter().map(|R| R.mul(k).into_affine()).collect();
let mut vec_U: Vec<G1Affine> = vec_S.iter().map(|S| S.mul(k).into_affine()).collect();
vec_T = apply_permutation_group(vec_T, &permutation);
vec_U = apply_permutation_group(vec_U, &permutation);
})
});

let mut vec_T: Vec<G1Affine> = vec_R.iter().map(|R| R.mul(k).into_affine()).collect();
let mut vec_U: Vec<G1Affine> = vec_S.iter().map(|S| S.mul(k).into_affine()).collect();
vec_T = apply_permutation_group(vec_T, &permutation);
vec_U = apply_permutation_group(vec_U, &permutation);

let range_as_fr: Vec<Fr> = (0..ell as u32).into_iter().map(|s| Fr::from(s)).collect();
let sigma_ell = get_permutation(&range_as_fr, &permutation);
let M = msm(&crs.vec_G, &sigma_ell) + msm(&crs.vec_H, &vec_r_m);

c.bench_function("prover", |b| {
b.iter(|| {
CurdleproofsProof::new(
&crs,
vec_R.clone(),
vec_S.clone(),
vec_T.clone(),
vec_U.clone(),
M,
permutation.clone(),
k,
vec_r_m.clone(),
&mut rng,
);
})
});

let shuffle_proof = CurdleproofsProof::new(
&crs,
vec_R.clone(),
vec_S.clone(),
vec_T.clone(),
vec_U.clone(),
M,
permutation,
k,
vec_r_m,
&mut rng,
);

c.bench_function("verifier", |b| {
b.iter(|| {
assert!(shuffle_proof
.verify(&crs, &vec_R, &vec_S, &vec_T, &vec_U, &M, &mut rng)
.is_ok());
})
});

for N in N_VALUES {
let ell = N - N_BLINDERS;

// Construct the CRS
let crs = generate_crs(ell);

// Get witnesses: the permutation, the randomizer, and a bunch of blinders
let mut permutation: Vec<u32> = (0..ell as u32).collect();
permutation.shuffle(&mut rng);
let k = Fr::rand(&mut rng);
let vec_r_m = generate_blinders(&mut rng, N_BLINDERS);

// Get shuffle inputs
let vec_R: Vec<G1Affine> = iter::repeat_with(|| G1Projective::rand(&mut rng).into_affine())
.take(ell)
.collect();
let vec_S: Vec<G1Affine> = iter::repeat_with(|| G1Projective::rand(&mut rng).into_affine())
.take(ell)
.collect();

// Derive shuffled outputs
c.bench_function(&format!("shuffling N={}", N), |b| {
b.iter(|| {
let mut vec_T: Vec<G1Affine> =
vec_R.iter().map(|R| R.mul(k).into_affine()).collect();
let mut vec_U: Vec<G1Affine> =
vec_S.iter().map(|S| S.mul(k).into_affine()).collect();
vec_T = apply_permutation_group(vec_T, &permutation);
vec_U = apply_permutation_group(vec_U, &permutation);
})
});

let mut vec_T: Vec<G1Affine> = vec_R.iter().map(|R| R.mul(k).into_affine()).collect();
let mut vec_U: Vec<G1Affine> = vec_S.iter().map(|S| S.mul(k).into_affine()).collect();
vec_T = apply_permutation_group(vec_T, &permutation);
vec_U = apply_permutation_group(vec_U, &permutation);

let range_as_fr: Vec<Fr> = (0..ell as u32).into_iter().map(|s| Fr::from(s)).collect();
let sigma_ell = get_permutation(&range_as_fr, &permutation);
let M = msm(&crs.vec_G, &sigma_ell) + msm(&crs.vec_H, &vec_r_m);

c.bench_function(&format!("prover N={}", N), |b| {
b.iter(|| {
CurdleproofsProof::new(
&crs,
vec_R.clone(),
vec_S.clone(),
vec_T.clone(),
vec_U.clone(),
M,
permutation.clone(),
k,
vec_r_m.clone(),
&mut rng,
);
})
});

let shuffle_proof = CurdleproofsProof::new(
&crs,
vec_R.clone(),
vec_S.clone(),
vec_T.clone(),
vec_U.clone(),
M,
permutation,
k,
vec_r_m,
&mut rng,
);

c.bench_function(&format!("verifier N={}", N), |b| {
b.iter(|| {
assert!(shuffle_proof
.verify(&crs, &vec_R, &vec_S, &vec_T, &vec_U, &M, &mut rng)
.is_ok());
})
});
}

// Duty discovery benchmark

for N in [1, 100, 10000] {
let k = rand_scalar(&mut rng);
let p = g1_generator();

c.bench_function(&format!("G1 point multiplication N={}", N), |b| {
b.iter(|| {
for _ in 0..N {
let _ = p == p.mul(k);
}
})
});
}
}

criterion_group! {name = shuffle;
config = Criterion::default().measurement_time(Duration::from_secs(60));
config = Criterion::default().measurement_time(Duration::from_secs(30));
targets = benchmark_shuffle
}

Expand Down