a236003a7b
* types: first updates for v0.8 * state_processing: epoch processing v0.8.0 * state_processing: block processing v0.8.0 * tree_hash_derive: support generics in SignedRoot * types v0.8: update to use ssz_types * state_processing v0.8: use ssz_types * ssz_types: add bitwise methods and from_elem * types: fix v0.8 FIXMEs * ssz_types: add bitfield shift_up * ssz_types: iterators and DerefMut for VariableList * types,state_processing: use VariableList * ssz_types: fix BitVector Decode impl Fixed a typo in the implementation of ssz::Decode for BitVector, which caused it to be considered variable length! * types: fix test modules for v0.8 update * types: remove slow type-level arithmetic * state_processing: fix tests for v0.8 * op_pool: update for v0.8 * ssz_types: Bitfield difference length-independent Allow computing the difference of two bitfields of different lengths. * Implement compact committee support * epoch_processing: committee & active index roots * state_processing: genesis state builder v0.8 * state_processing: implement v0.8.1 * Further improve tree_hash * Strip examples, tests from cached_tree_hash * Update TreeHash, un-impl CachedTreeHash * Update bitfield TreeHash, un-impl CachedTreeHash * Update FixedLenVec TreeHash, unimpl CachedTreeHash * Update update tree_hash_derive for new TreeHash * Fix TreeHash, un-impl CachedTreeHash for ssz_types * Remove fixed_len_vec, ssz benches SSZ benches relied upon fixed_len_vec -- it is easier to just delete them and rebuild them later (when necessary) * Remove boolean_bitfield crate * Fix fake_crypto BLS compile errors * Update ef_tests for new v.8 type params * Update ef_tests submodule to v0.8.1 tag * Make fixes to support parsing ssz ef_tests * `compact_committee...` to `compact_committees...` * Derive more traits for `CompactCommittee` * Flip bitfield byte-endianness * Fix tree_hash for bitfields * Modify CLI output for ef_tests * Bump ssz crate version * Update ssz_types doc comment * Del cached tree hash tests from ssz_static tests * Tidy SSZ dependencies * Rename ssz_types crate to eth2_ssz_types * validator_client: update for v0.8 * ssz_types: update union/difference for bit order swap * beacon_node: update for v0.8, EthSpec * types: disable cached tree hash, update min spec * state_processing: fix slot bug in committee update * tests: temporarily disable fork choice harness test See #447 * committee cache: prevent out-of-bounds access In the case where we tried to access the committee of a shard that didn't have a committee in the current epoch, we were accessing elements beyond the end of the shuffling vector and panicking! This commit adds a check to make the failure safe and explicit. * fix bug in get_indexed_attestation and simplify There was a bug in our implementation of get_indexed_attestation whereby incorrect "committee indices" were used to index into the custody bitfield. The bug was only observable in the case where some bits of the custody bitfield were set to 1. The implementation has been simplified to remove the bug, and a test added. * state_proc: workaround for compact committees bug https://github.com/ethereum/eth2.0-specs/issues/1315 * v0.8: updates to make the EF tests pass * Remove redundant max operation checks. * Always supply both messages when checking attestation signatures -- allowing verification of an attestation with no signatures. * Swap the order of the fork and domain constant in `get_domain`, to match the spec. * rustfmt * ef_tests: add new epoch processing tests * Integrate v0.8 into master (compiles) * Remove unused crates, fix clippy lints * Replace v0.6.3 tags w/ v0.8.1 * Remove old comment * Ensure lmd ghost tests only run in release * Update readme
264 lines
9.1 KiB
Rust
264 lines
9.1 KiB
Rust
use criterion::Criterion;
|
|
use criterion::{black_box, Benchmark};
|
|
use state_processing::{
|
|
per_epoch_processing,
|
|
per_epoch_processing::{
|
|
clean_attestations, initialize_validator_statuses, process_crosslinks, process_eth1_data,
|
|
process_justification, process_rewards_and_penalities, process_validator_registry,
|
|
update_active_tree_index_roots, update_latest_slashed_balances,
|
|
},
|
|
};
|
|
use tree_hash::TreeHash;
|
|
use types::test_utils::TestingBeaconStateBuilder;
|
|
use types::*;
|
|
|
|
pub const BENCHING_SAMPLE_SIZE: usize = 10;
|
|
pub const SMALL_BENCHING_SAMPLE_SIZE: usize = 10;
|
|
|
|
/// Run the benchmarking suite on a foundation spec with 16,384 validators.
|
|
pub fn bench_epoch_processing_n_validators(c: &mut Criterion, validator_count: usize) {
|
|
let spec = ChainSpec::mainnet();
|
|
|
|
let mut builder =
|
|
TestingBeaconStateBuilder::from_default_keypairs_file_if_exists(validator_count, &spec);
|
|
|
|
// Set the state to be just before an epoch transition.
|
|
let target_slot = (T::genesis_epoch() + 4).end_slot(T::slots_per_epoch());
|
|
builder.teleport_to_slot(target_slot, &spec);
|
|
|
|
// Builds all caches; benches will not contain shuffling/committee building times.
|
|
builder.build_caches(&spec).unwrap();
|
|
|
|
// Inserts one attestation with full participation for each committee able to include an
|
|
// attestation in this state.
|
|
builder.insert_attestations(&spec);
|
|
|
|
let (state, _keypairs) = builder.build();
|
|
|
|
// Assert that the state has an attestations for each committee that is able to include an
|
|
// attestation in the state.
|
|
let committees_per_epoch = spec.get_committee_count(validator_count);
|
|
let committees_per_slot = committees_per_epoch / T::slots_per_epoch();
|
|
let previous_epoch_attestations = committees_per_epoch;
|
|
let current_epoch_attestations =
|
|
committees_per_slot * (T::slots_per_epoch() - spec.min_attestation_inclusion_delay);
|
|
assert_eq!(
|
|
state.latest_attestations.len() as u64,
|
|
previous_epoch_attestations + current_epoch_attestations,
|
|
"The state should have an attestation for each committee."
|
|
);
|
|
|
|
// Assert that we will run the first arm of process_rewards_and_penalties
|
|
let epochs_since_finality = state.next_epoch(&spec) - state.finalized_epoch;
|
|
assert_eq!(
|
|
epochs_since_finality, 4,
|
|
"Epochs since finality should be 4"
|
|
);
|
|
|
|
bench_epoch_processing(c, &state, &spec, &format!("{}_validators", validator_count));
|
|
}
|
|
|
|
/// Run the detailed benchmarking suite on the given `BeaconState`.
|
|
///
|
|
/// `desc` will be added to the title of each bench.
|
|
fn bench_epoch_processing(c: &mut Criterion, state: &BeaconState, spec: &ChainSpec, desc: &str) {
|
|
let state_clone = state.clone();
|
|
let spec_clone = spec.clone();
|
|
c.bench(
|
|
&format!("{}/epoch_processing", desc),
|
|
Benchmark::new("process_eth1_data", move |b| {
|
|
b.iter_batched(
|
|
|| state_clone.clone(),
|
|
|mut state| {
|
|
process_eth1_data(&mut state, &spec_clone);
|
|
state
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
)
|
|
})
|
|
.sample_size(BENCHING_SAMPLE_SIZE),
|
|
);
|
|
|
|
let state_clone = state.clone();
|
|
let spec_clone = spec.clone();
|
|
c.bench(
|
|
&format!("{}/epoch_processing", desc),
|
|
Benchmark::new("initialize_validator_statuses", move |b| {
|
|
b.iter_batched(
|
|
|| state_clone.clone(),
|
|
|mut state| {
|
|
initialize_validator_statuses(&mut state, &spec_clone).unwrap();
|
|
state
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
)
|
|
})
|
|
.sample_size(BENCHING_SAMPLE_SIZE),
|
|
);
|
|
|
|
let state_clone = state.clone();
|
|
let spec_clone = spec.clone();
|
|
let attesters = initialize_validator_statuses(&state, &spec).unwrap();
|
|
c.bench(
|
|
&format!("{}/epoch_processing", desc),
|
|
Benchmark::new("process_justification", move |b| {
|
|
b.iter_batched(
|
|
|| state_clone.clone(),
|
|
|mut state| {
|
|
process_justification(&mut state, &attesters.total_balances, &spec_clone);
|
|
state
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
)
|
|
})
|
|
.sample_size(10),
|
|
);
|
|
|
|
let state_clone = state.clone();
|
|
let spec_clone = spec.clone();
|
|
c.bench(
|
|
&format!("{}/epoch_processing", desc),
|
|
Benchmark::new("process_crosslinks", move |b| {
|
|
b.iter_batched(
|
|
|| state_clone.clone(),
|
|
|mut state| black_box(process_crosslinks(&mut state, &spec_clone).unwrap()),
|
|
criterion::BatchSize::SmallInput,
|
|
)
|
|
})
|
|
.sample_size(BENCHING_SAMPLE_SIZE),
|
|
);
|
|
|
|
let mut state_clone = state.clone();
|
|
let spec_clone = spec.clone();
|
|
let attesters = initialize_validator_statuses(&state, &spec).unwrap();
|
|
let winning_root_for_shards = process_crosslinks(&mut state_clone, &spec).unwrap();
|
|
c.bench(
|
|
&format!("{}/epoch_processing", desc),
|
|
Benchmark::new("process_rewards_and_penalties", move |b| {
|
|
b.iter_batched(
|
|
|| (state_clone.clone(), attesters.clone()),
|
|
|(mut state, mut attesters)| {
|
|
process_rewards_and_penalities(
|
|
&mut state,
|
|
&mut attesters,
|
|
&winning_root_for_shards,
|
|
&spec_clone,
|
|
)
|
|
.unwrap();
|
|
state
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
)
|
|
})
|
|
.sample_size(SMALL_BENCHING_SAMPLE_SIZE),
|
|
);
|
|
|
|
let state_clone = state.clone();
|
|
let spec_clone = spec.clone();
|
|
c.bench(
|
|
&format!("{}/epoch_processing", desc),
|
|
Benchmark::new("process_ejections", move |b| {
|
|
b.iter_batched(
|
|
|| state_clone.clone(),
|
|
|mut state| {
|
|
state.process_ejections(&spec_clone);
|
|
state
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
)
|
|
})
|
|
.sample_size(BENCHING_SAMPLE_SIZE),
|
|
);
|
|
|
|
let state_clone = state.clone();
|
|
let spec_clone = spec.clone();
|
|
c.bench(
|
|
&format!("{}/epoch_processing", desc),
|
|
Benchmark::new("process_validator_registry", move |b| {
|
|
b.iter_batched(
|
|
|| state_clone.clone(),
|
|
|mut state| {
|
|
process_validator_registry(&mut state, &spec_clone).unwrap();
|
|
state
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
)
|
|
})
|
|
.sample_size(BENCHING_SAMPLE_SIZE),
|
|
);
|
|
|
|
let state_clone = state.clone();
|
|
let spec_clone = spec.clone();
|
|
c.bench(
|
|
&format!("{}/epoch_processing", desc),
|
|
Benchmark::new("update_active_tree_index_roots", move |b| {
|
|
b.iter_batched(
|
|
|| state_clone.clone(),
|
|
|mut state| {
|
|
update_active_tree_index_roots(&mut state, &spec_clone).unwrap();
|
|
state
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
)
|
|
})
|
|
.sample_size(BENCHING_SAMPLE_SIZE),
|
|
);
|
|
|
|
let state_clone = state.clone();
|
|
let spec_clone = spec.clone();
|
|
c.bench(
|
|
&format!("{}/epoch_processing", desc),
|
|
Benchmark::new("update_latest_slashed_balances", move |b| {
|
|
b.iter_batched(
|
|
|| state_clone.clone(),
|
|
|mut state| {
|
|
update_latest_slashed_balances(&mut state, &spec_clone);
|
|
state
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
)
|
|
})
|
|
.sample_size(BENCHING_SAMPLE_SIZE),
|
|
);
|
|
|
|
let state_clone = state.clone();
|
|
let spec_clone = spec.clone();
|
|
c.bench(
|
|
&format!("{}/epoch_processing", desc),
|
|
Benchmark::new("clean_attestations", move |b| {
|
|
b.iter_batched(
|
|
|| state_clone.clone(),
|
|
|mut state| {
|
|
clean_attestations(&mut state, &spec_clone);
|
|
state
|
|
},
|
|
criterion::BatchSize::SmallInput,
|
|
)
|
|
})
|
|
.sample_size(BENCHING_SAMPLE_SIZE),
|
|
);
|
|
|
|
let state_clone = state.clone();
|
|
let spec_clone = spec.clone();
|
|
c.bench(
|
|
&format!("{}/epoch_processing", desc),
|
|
Benchmark::new("per_epoch_processing", move |b| {
|
|
b.iter_batched(
|
|
|| state_clone.clone(),
|
|
|mut state| black_box(per_epoch_processing(&mut state, &spec_clone).unwrap()),
|
|
criterion::BatchSize::SmallInput,
|
|
)
|
|
})
|
|
.sample_size(SMALL_BENCHING_SAMPLE_SIZE),
|
|
);
|
|
|
|
let state_clone = state.clone();
|
|
c.bench(
|
|
&format!("{}/epoch_processing", desc),
|
|
Benchmark::new("tree_hash_state", move |b| {
|
|
b.iter(|| black_box(state_clone.tree_hash_root()))
|
|
})
|
|
.sample_size(SMALL_BENCHING_SAMPLE_SIZE),
|
|
);
|
|
}
|