mirror of
https://github.com/sigp/lighthouse.git
synced 2026-03-17 11:52:42 +00:00
* Single-pass epoch processing (#4483, #4573) Co-authored-by: Michael Sproul <michael@sigmaprime.io> * Delete unused epoch processing code (#5170) * Delete unused epoch processing code * Compare total deltas * Remove unnecessary apply_pending * cargo fmt * Remove newline * Use epoch cache in block packing (#5223) * Remove progressive balances mode (#5224) * inline inactivity_penalty_quotient_for_state * drop previous_epoch_total_active_balance * fc lint * spec compliant process_sync_aggregate (#15) * spec compliant process_sync_aggregate * Update consensus/state_processing/src/per_block_processing/altair/sync_committee.rs Co-authored-by: Michael Sproul <micsproul@gmail.com> --------- Co-authored-by: Michael Sproul <micsproul@gmail.com> * Delete the participation cache (#16) * update help * Fix op_pool tests * Fix fork choice tests * Merge remote-tracking branch 'sigp/unstable' into epoch-single-pass * Simplify exit cache (#5280) * Fix clippy on exit cache * Clean up single-pass a bit (#5282) * Address Mark's review of single-pass (#5386) * Merge remote-tracking branch 'origin/unstable' into epoch-single-pass * Address Sean's review comments (#5414) * Address most of Sean's review comments * Simplify total balance cache building * Clean up unused junk * Merge remote-tracking branch 'origin/unstable' into epoch-single-pass * More self-review * Merge remote-tracking branch 'origin/unstable' into epoch-single-pass * Merge branch 'unstable' into epoch-single-pass * Fix imports for beta compiler * Fix tests, probably
49 lines
1.5 KiB
Rust
49 lines
1.5 KiB
Rust
use integer_sqrt::IntegerSquareRoot;
|
|
use safe_arith::{ArithError, SafeArith};
|
|
use types::*;
|
|
|
|
/// This type exists to avoid confusing `total_active_balance` with `base_reward_per_increment`,
|
|
/// since they are used in close proximity and the same type (`u64`).
|
|
#[derive(Copy, Clone)]
|
|
pub struct BaseRewardPerIncrement(u64);
|
|
|
|
impl BaseRewardPerIncrement {
|
|
pub fn new(total_active_balance: u64, spec: &ChainSpec) -> Result<Self, ArithError> {
|
|
get_base_reward_per_increment(total_active_balance, spec).map(Self)
|
|
}
|
|
|
|
pub fn as_u64(&self) -> u64 {
|
|
self.0
|
|
}
|
|
}
|
|
|
|
/// Returns the base reward for some validator.
|
|
///
|
|
/// The function has a different interface to the spec since it accepts the
|
|
/// `base_reward_per_increment` without computing it each time. Avoiding the re computation has
|
|
/// shown to be a significant optimisation.
|
|
///
|
|
/// Spec v1.1.0
|
|
pub fn get_base_reward(
|
|
validator_effective_balance: u64,
|
|
base_reward_per_increment: BaseRewardPerIncrement,
|
|
spec: &ChainSpec,
|
|
) -> Result<u64, Error> {
|
|
validator_effective_balance
|
|
.safe_div(spec.effective_balance_increment)?
|
|
.safe_mul(base_reward_per_increment.as_u64())
|
|
.map_err(Into::into)
|
|
}
|
|
|
|
/// Returns the base reward for some validator.
|
|
///
|
|
/// Spec v1.1.0
|
|
fn get_base_reward_per_increment(
|
|
total_active_balance: u64,
|
|
spec: &ChainSpec,
|
|
) -> Result<u64, ArithError> {
|
|
spec.effective_balance_increment
|
|
.safe_mul(spec.base_reward_factor)?
|
|
.safe_div(total_active_balance.integer_sqrt())
|
|
}
|