mirror of
https://github.com/sigp/lighthouse.git
synced 2026-03-17 11:52:42 +00:00
* Consensus changes
* EF tests
* lcli
* common and watch
* account manager
* cargo
* fork choice
* promise cache
* beacon chain
* interop genesis
* http api
* lighthouse
* op pool
* beacon chain misc
* parallel state cache
* store
* fix issues in store
* IT COMPILES
* Remove some unnecessary module qualification
* Revert Arced pubkey optimization (#5536)
* Merge remote-tracking branch 'origin/unstable' into tree-states-memory
* Fix caching, rebasing and some tests
* Remove unused deps
* Merge remote-tracking branch 'origin/unstable' into tree-states-memory
* Small cleanups
* Revert shuffling cache/promise cache changes
* Fix state advance bugs
* Fix shuffling tests
* Remove some resolved FIXMEs
* Remove StateProcessingStrategy
* Optimise withdrawals calculation
* Don't reorg if state cache is missed
* Remove inconsistent state func
* Fix beta compiler
* Rebase early, rebase often
* Fix state caching behaviour
* Update to milhouse release
* Fix on-disk consensus context format
* Merge remote-tracking branch 'origin/unstable' into tree-states-memory
* Squashed commit of the following:
commit 3a16649023
Author: Michael Sproul <michael@sigmaprime.io>
Date: Thu Apr 18 14:26:09 2024 +1000
Fix on-disk consensus context format
* Keep indexed attestations, thanks Sean
* Merge branch 'on-disk-consensus-context' into tree-states-memory
* Merge branch 'unstable' into tree-states-memory
* Address half of Sean's review
* More simplifications from Sean's review
* Cache state after get_advanced_hot_state
104 lines
3.8 KiB
Rust
104 lines
3.8 KiB
Rust
use crate::{BeaconChain, BeaconChainError, BeaconChainTypes};
|
|
|
|
use eth2::lighthouse::SyncCommitteeReward;
|
|
use safe_arith::SafeArith;
|
|
use slog::error;
|
|
use state_processing::per_block_processing::altair::sync_committee::compute_sync_aggregate_rewards;
|
|
use std::collections::HashMap;
|
|
use store::RelativeEpoch;
|
|
use types::{AbstractExecPayload, BeaconBlockRef, BeaconState};
|
|
|
|
impl<T: BeaconChainTypes> BeaconChain<T> {
|
|
pub fn compute_sync_committee_rewards<Payload: AbstractExecPayload<T::EthSpec>>(
|
|
&self,
|
|
block: BeaconBlockRef<'_, T::EthSpec, Payload>,
|
|
state: &mut BeaconState<T::EthSpec>,
|
|
) -> Result<Vec<SyncCommitteeReward>, BeaconChainError> {
|
|
if block.slot() != state.slot() {
|
|
return Err(BeaconChainError::BlockRewardSlotError);
|
|
}
|
|
|
|
let spec = &self.spec;
|
|
|
|
state.build_committee_cache(RelativeEpoch::Current, spec)?;
|
|
|
|
let sync_aggregate = block.body().sync_aggregate()?;
|
|
|
|
let sync_committee = state.current_sync_committee()?.clone();
|
|
|
|
let sync_committee_indices = state.get_sync_committee_indices(&sync_committee)?;
|
|
|
|
let (participant_reward_value, proposer_reward_per_bit) =
|
|
compute_sync_aggregate_rewards(state, spec).map_err(|e| {
|
|
error!(
|
|
self.log, "Error calculating sync aggregate rewards";
|
|
"error" => ?e
|
|
);
|
|
BeaconChainError::SyncCommitteeRewardsSyncError
|
|
})?;
|
|
|
|
let mut balances = HashMap::<usize, u64>::new();
|
|
for &validator_index in &sync_committee_indices {
|
|
balances.insert(
|
|
validator_index,
|
|
*state
|
|
.balances()
|
|
.get(validator_index)
|
|
.ok_or(BeaconChainError::SyncCommitteeRewardsSyncError)?,
|
|
);
|
|
}
|
|
|
|
let proposer_index = block.proposer_index() as usize;
|
|
balances.insert(
|
|
proposer_index,
|
|
*state
|
|
.balances()
|
|
.get(proposer_index)
|
|
.ok_or(BeaconChainError::SyncCommitteeRewardsSyncError)?,
|
|
);
|
|
|
|
let mut total_proposer_rewards = 0;
|
|
|
|
// Apply rewards to participant balances. Keep track of proposer rewards
|
|
for (validator_index, participant_bit) in sync_committee_indices
|
|
.iter()
|
|
.zip(sync_aggregate.sync_committee_bits.iter())
|
|
{
|
|
let participant_balance = balances
|
|
.get_mut(validator_index)
|
|
.ok_or(BeaconChainError::SyncCommitteeRewardsSyncError)?;
|
|
|
|
if participant_bit {
|
|
participant_balance.safe_add_assign(participant_reward_value)?;
|
|
|
|
balances
|
|
.get_mut(&proposer_index)
|
|
.ok_or(BeaconChainError::SyncCommitteeRewardsSyncError)?
|
|
.safe_add_assign(proposer_reward_per_bit)?;
|
|
|
|
total_proposer_rewards.safe_add_assign(proposer_reward_per_bit)?;
|
|
} else {
|
|
*participant_balance = participant_balance.saturating_sub(participant_reward_value);
|
|
}
|
|
}
|
|
|
|
Ok(balances
|
|
.iter()
|
|
.filter_map(|(&i, &new_balance)| {
|
|
let initial_balance = *state.balances().get(i)? as i64;
|
|
let reward = if i != proposer_index {
|
|
new_balance as i64 - initial_balance
|
|
} else if sync_committee_indices.contains(&i) {
|
|
new_balance as i64 - initial_balance - total_proposer_rewards as i64
|
|
} else {
|
|
return None;
|
|
};
|
|
Some(SyncCommitteeReward {
|
|
validator_index: i as u64,
|
|
reward,
|
|
})
|
|
})
|
|
.collect())
|
|
}
|
|
}
|