Skip to content

Commit

Permalink
remove bench
Browse files Browse the repository at this point in the history
  • Loading branch information
@joyqvq
joyqvq committed Jan 2, 2025
1 parent 2c67e86 commit ea19d73
Show file tree
Hide file tree
Showing 2 changed files with 127 additions and 126 deletions.
251 changes: 126 additions & 125 deletions fastcrypto-tbls/benches/nidkg.rs
View file
Original file line number Diff line number Diff line change
@@ -1,135 +1,136 @@
// Copyright (c) 2022, Mysten Labs, Inc.
// SPDX-License-Identifier: Apache-2.0

use criterion::{criterion_group, criterion_main, BenchmarkGroup, Criterion};
use fastcrypto::groups::bls12381;
use fastcrypto_tbls::ecies_v1;
use fastcrypto_tbls::nidkg::Party;
use fastcrypto_tbls::nodes::Node;
use fastcrypto_tbls::random_oracle::RandomOracle;
use rand::thread_rng;

type G = bls12381::G1Element;

fn gen_ecies_keys(n: u16) -> Vec<(u16, ecies_v0::PrivateKey<G>, ecies_v1::PublicKey<G>)> {
(0..n)
.map(|id| {
let sk = ecies_v1::PrivateKey::<G>::new(&mut thread_rng());
let pk = ecies_v1::PublicKey::<G>::from_private_key(&sk);
(id, sk, pk)
})
.collect()
}

pub fn setup_party(
id: usize,
threshold: u16,
keys: &[(u16, ecies_v1::PrivateKey<G>, ecies_v1::PublicKey<G>)],
) -> Party<G> {
let nodes = keys
.iter()
.map(|(id, _sk, pk)| Node::<G> {
id: *id,
pk: pk.clone(),
weight: 1,
})
.collect();
Party::<G>::new(
keys.get(id).unwrap().1.clone(),
nodes,
threshold,
RandomOracle::new("dkg"),
&mut thread_rng(),
)
.unwrap()
}
use criterion::{criterion_group, criterion_main, Criterion};
// use criterion::{criterion_group, criterion_main, BenchmarkGroup, Criterion};
// use fastcrypto::groups::bls12381;
// use fastcrypto_tbls::ecies_v1;
// use fastcrypto_tbls::nidkg::Party;
// use fastcrypto_tbls::nodes::Node;
// use fastcrypto_tbls::random_oracle::RandomOracle;
// use rand::thread_rng;

// type G = bls12381::G1Element;

// fn gen_ecies_keys(n: u16) -> Vec<(u16, ecies_v0::PrivateKey<G>, ecies_v1::PublicKey<G>)> {
// (0..n)
// .map(|id| {
// let sk = ecies_v1::PrivateKey::<G>::new(&mut thread_rng());
// let pk = ecies_v1::PublicKey::<G>::from_private_key(&sk);
// (id, sk, pk)
// })
// .collect()
// }

// pub fn setup_party(
// id: usize,
// threshold: u16,
// keys: &[(u16, ecies_v1::PrivateKey<G>, ecies_v1::PublicKey<G>)],
// ) -> Party<G> {
// let nodes = keys
// .iter()
// .map(|(id, _sk, pk)| Node::<G> {
// id: *id,
// pk: pk.clone(),
// weight: 1,
// })
// .collect();
// Party::<G>::new(
// keys.get(id).unwrap().1.clone(),
// nodes,
// threshold,
// RandomOracle::new("dkg"),
// &mut thread_rng(),
// )
// .unwrap()
// }

mod nidkg_benches {
use super::*;

fn nidkg(c: &mut Criterion) {
const SIZES: [u16; 1] = [512];

{
let mut create: BenchmarkGroup<_> = c.benchmark_group("NI-DKG create");
for n in SIZES {
let t = n / 2;
let keys = gen_ecies_keys(n);
let d0 = setup_party(0, t, &keys);

create.bench_function(format!("n={}, t={}", n, t).as_str(), |b| {
b.iter(|| d0.create_message(&mut thread_rng()))
});
}
}

{
let mut verify: BenchmarkGroup<_> = c.benchmark_group("NI-DKG message verification");
for n in SIZES {
let t = n / 2;
let keys = gen_ecies_keys(n);
let d0 = setup_party(0, t, &keys);
let d1 = setup_party(1, t, &keys);
let m = d0.create_message(&mut thread_rng());
println!("Message size: {}", bcs::to_bytes(&m).unwrap().len());

verify.bench_function(format!("n={}, t={}", n, t).as_str(), |b| {
b.iter(|| d1.verify_message(&m, &mut thread_rng()))
});
}
}

{
let mut verify: BenchmarkGroup<_> =
c.benchmark_group("NI-DKG message processing for one share");
for n in SIZES {
let t = n / 2;
let keys = gen_ecies_keys(n);
let d0 = setup_party(0, t, &keys);
let d1 = setup_party(1, t, &keys);
let m = d0.create_message(&mut thread_rng());

verify.bench_function(format!("n={}, t={}", n, t).as_str(), |b| {
b.iter(|| d1.process_message(&m, &mut thread_rng()))
});
}
}

// comment out if G=G2
{
let mut verify: BenchmarkGroup<_> =
c.benchmark_group("NI-DKG generate partial pks in g2");
for n in SIZES {
let t = n / 2;
let keys = gen_ecies_keys(n);
let d1 = setup_party(1, t, &keys);

verify.bench_function(format!("n={}, t={}", n, t).as_str(), |b| {
b.iter(|| d1.create_partial_pks_in_g2())
});
}
}
{
let mut verify: BenchmarkGroup<_> =
c.benchmark_group("NI-DKG verify partial pks in g2");
for n in SIZES {
let t = n / 2;
let keys = gen_ecies_keys(n);
let d0 = setup_party(0, t, &keys);
let pks_in_g2 = d0.create_partial_pks_in_g2();
println!(
"pks_in_g2 size: {}",
bcs::to_bytes(&pks_in_g2).unwrap().len()
);
let m = d0.create_message(&mut thread_rng());

verify.bench_function(format!("n={}, t={}", n, t).as_str(), |b| {
b.iter(|| {
Party::<G>::verify_partial_pks_in_g2(&m, &pks_in_g2, &mut thread_rng())
})
});
}
}
fn nidkg(_c: &mut Criterion) {
// const SIZES: [u16; 1] = [512];

// {
// let mut create: BenchmarkGroup<_> = c.benchmark_group("NI-DKG create");
// for n in SIZES {
// let t = n / 2;
// let keys = gen_ecies_keys(n);
// let d0 = setup_party(0, t, &keys);

// create.bench_function(format!("n={}, t={}", n, t).as_str(), |b| {
// b.iter(|| d0.create_message(&mut thread_rng()))
// });
// }
// }

// {
// let mut verify: BenchmarkGroup<_> = c.benchmark_group("NI-DKG message verification");
// for n in SIZES {
// let t = n / 2;
// let keys = gen_ecies_keys(n);
// let d0 = setup_party(0, t, &keys);
// let d1 = setup_party(1, t, &keys);
// let m = d0.create_message(&mut thread_rng());
// println!("Message size: {}", bcs::to_bytes(&m).unwrap().len());

// verify.bench_function(format!("n={}, t={}", n, t).as_str(), |b| {
// b.iter(|| d1.verify_message(&m, &mut thread_rng()))
// });
// }
// }

// {
// let mut verify: BenchmarkGroup<_> =
// c.benchmark_group("NI-DKG message processing for one share");
// for n in SIZES {
// let t = n / 2;
// let keys = gen_ecies_keys(n);
// let d0 = setup_party(0, t, &keys);
// let d1 = setup_party(1, t, &keys);
// let m = d0.create_message(&mut thread_rng());

// verify.bench_function(format!("n={}, t={}", n, t).as_str(), |b| {
// b.iter(|| d1.process_message(&m, &mut thread_rng()))
// });
// }
// }

// // comment out if G=G2
// {
// let mut verify: BenchmarkGroup<_> =
// c.benchmark_group("NI-DKG generate partial pks in g2");
// for n in SIZES {
// let t = n / 2;
// let keys = gen_ecies_keys(n);
// let d1 = setup_party(1, t, &keys);

// verify.bench_function(format!("n={}, t={}", n, t).as_str(), |b| {
// b.iter(|| d1.create_partial_pks_in_g2())
// });
// }
// }
// {
// let mut verify: BenchmarkGroup<_> =
// c.benchmark_group("NI-DKG verify partial pks in g2");
// for n in SIZES {
// let t = n / 2;
// let keys = gen_ecies_keys(n);
// let d0 = setup_party(0, t, &keys);
// let pks_in_g2 = d0.create_partial_pks_in_g2();
// println!(
// "pks_in_g2 size: {}",
// bcs::to_bytes(&pks_in_g2).unwrap().len()
// );
// let m = d0.create_message(&mut thread_rng());

// verify.bench_function(format!("n={}, t={}", n, t).as_str(), |b| {
// b.iter(|| {
// Party::<G>::verify_partial_pks_in_g2(&m, &pks_in_g2, &mut thread_rng())
// })
// });
// }
// }
}

criterion_group! {
Expand Down
2 changes: 1 addition & 1 deletion fastcrypto-tbls/src/dkg_v1.rs
View file
Original file line number Diff line number Diff line change
Expand Up @@ -43,7 +43,7 @@ where
/// - The high-level protocol is responsible for verifying that the 'sender' is correct in the
/// following messages (based on the chain's authentication).
/// - The high-level protocol is responsible that all parties see the same order of messages.
///
/// A complaint/fraud claim against a dealer that created invalid encrypted share.
#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]
pub struct Complaint<EG: GroupElement> {
Expand Down

0 comments on commit ea19d73

Please sign in to comment.