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.

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

Tree availability service benchmarks #41

Merged
merged 2 commits into from
Nov 22, 2023
Merged
Changes from 1 commit
Commits
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
Next Next commit
added benches for travis
  • Loading branch information
0xKitsune committed Nov 22, 2023

Verified

This commit was signed with the committer’s verified signature.
penelopeysm Penelope Yong
commit a563e4054040c7231ee606ae06c8ab366f41f66b
76 changes: 74 additions & 2 deletions Cargo.lock

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

9 changes: 9 additions & 0 deletions Cargo.toml
Original file line number Diff line number Diff line change
@@ -10,6 +10,7 @@ axum = "0.6.20"
axum-middleware = { path = "crates/axum-middleware" }
clap = { version = "4.4.8", features = ["derive"] }
common = { path = "crates/common" }
criterion = { version = "0.5.1", features = ["async", "async_futures"] }
ethers = { version = "2.0.10", features = [
"abigen",
"ws",
@@ -25,6 +26,7 @@ hex = "0.4.3"
hyper = { version = "^0.14.27", features = ["server", "tcp", "http1", "http2"] }
metrics = "0.21.1"
opentelemetry = "0.21.0"
rand = "0.8.5"
ruint = "1.10.1"
semaphore = { git = "https://github.com/worldcoin/semaphore-rs", branch = "main", features = [
"depth_20",
@@ -48,3 +50,10 @@ path = "bin/tree_availability_service.rs"
[[bin]]
name = "state-bridge-service"
path = "bin/state_bridge_service.rs"


[[bench]]
name = "tree_data"
harness = false


122 changes: 122 additions & 0 deletions benches/tree_data.rs
Original file line number Diff line number Diff line change
@@ -0,0 +1,122 @@
use criterion::async_executor::FuturesExecutor;
use criterion::{criterion_group, criterion_main, Criterion};
use rand::seq::IteratorRandom;
use rand::Rng;
use semaphore::lazy_merkle_tree::Canonical;
use world_tree::tree::tree_data::TreeData;
use world_tree::tree::{Hash, PoseidonTree};

pub const TREE_DEPTH: usize = 30;
pub const TREE_HISTORY_SIZE: usize = 24;
pub const NUMBER_OF_IDENTITIES: usize = 100;

fn generate_random_identity() -> Hash {
let mut rng = rand::thread_rng();
ruint::Uint::from(rng.gen::<usize>())
}

fn generate_random_identities(num_identities: usize) -> Vec<Hash> {
let mut identities = vec![];

for _ in 0..(num_identities) {
identities.push(generate_random_identity());
}

identities
}
async fn setup_tree_data() -> TreeData {
let tree = PoseidonTree::<Canonical>::new(TREE_DEPTH, Hash::ZERO);
let tree_data = TreeData::new(tree, TREE_HISTORY_SIZE);

tree_data
.insert_many_at(0, &generate_random_identities(1 << 10))
.await;

tree_data
}

fn bench_insert_many_at(c: &mut Criterion) {
let mut group = c.benchmark_group("TreeData Insertion");

let runtime = tokio::runtime::Runtime::new().unwrap();
let tree_data = runtime.block_on(setup_tree_data());

let identities = generate_random_identities(NUMBER_OF_IDENTITIES);

group.bench_function("insert_many_at", |b| {
b.to_async(FuturesExecutor)
.iter(|| tree_data.insert_many_at(0, &identities))
});
}

fn bench_delete_many(c: &mut Criterion) {
let mut group = c.benchmark_group("TreeData Deletion");

let runtime = tokio::runtime::Runtime::new().unwrap();
let tree_data = runtime.block_on(setup_tree_data());

let delete_indices: Vec<usize> = (0..NUMBER_OF_IDENTITIES).collect();

group.bench_function("delete_many", |b| {
b.to_async(FuturesExecutor)
.iter(|| tree_data.delete_many(&delete_indices))
});
}

fn bench_get_inclusion_proof_latest_root(c: &mut Criterion) {
let mut group = c.benchmark_group("TreeData Inclusion Proof");

let runtime = tokio::runtime::Runtime::new().unwrap();
let tree_data = runtime.block_on(setup_tree_data());

let tree = runtime.block_on(tree_data.tree.read());

let random_identity = tree
.leaves()
.choose(&mut rand::thread_rng())
.expect("Could not get random identity");

group.bench_function("get_inclusion_proof at latest root", |b| {
b.to_async(FuturesExecutor)
.iter(|| tree_data.get_inclusion_proof(random_identity, None))
});
}

fn bench_get_inclusion_proof_historical_root(c: &mut Criterion) {
let mut group =
c.benchmark_group("get_inclusion_proof at oldest historical root");

let runtime = tokio::runtime::Runtime::new().unwrap();

// Insert the target identity
let identity = generate_random_identity();
let tree_data = runtime.block_on(setup_tree_data());
runtime.block_on(tree_data.insert_many_at(0, &vec![identity]));

// Update the tree history
let tree_data = runtime.block_on(async {
for _ in 0..TREE_HISTORY_SIZE {
let identities = generate_random_identities(10);
tree_data.insert_many_at(1, &identities).await;
}

tree_data
});

let tree_history = runtime.block_on(tree_data.tree_history.read());
let oldest_root = tree_history.back().unwrap().root();

group.bench_function("get_inclusion_proof at historical root", |b| {
b.to_async(FuturesExecutor)
.iter(|| tree_data.get_inclusion_proof(identity, Some(oldest_root)))
});
}

criterion_group!(
benches,
bench_insert_many_at,
bench_delete_many,
bench_get_inclusion_proof_latest_root,
bench_get_inclusion_proof_historical_root
);
criterion_main!(benches);
Loading