forked from yetanotherco/aligned_layer
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #23 from lambdaclass/long_range_consensus
Add long-range fork consensus rule
- Loading branch information
Showing
15 changed files
with
171 additions
and
60 deletions.
There are no files selected for viewing
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,47 +1,174 @@ | ||
| use blake2::{Blake2b512, Digest}; | ||
| use kimchi::o1_utils::FieldHelpers; | ||
| use mina_p2p_messages::{hash::MinaHash, v2::MinaStateProtocolStateValueStableV2}; | ||
| use mina_p2p_messages::{ | ||
| hash::MinaHash, | ||
| v2::{ | ||
| ConsensusProofOfStakeDataConsensusStateValueStableV2 as MinaConsensusState, | ||
| MinaStateProtocolStateValueStableV2 as MinaProtocolState, | ||
| }, | ||
| }; | ||
| use std::cmp::{max, min, Ordering}; | ||
|
|
||
| #[derive(PartialEq)] | ||
| pub enum LongerChainResult { | ||
| const GRACE_PERIOD_END: u32 = 1440; | ||
| const SUB_WINDOWS_PER_WINDOW: u32 = 11; | ||
| const SLOTS_PER_SUB_WINDOW: u32 = 7; | ||
|
|
||
| #[derive(Debug, PartialEq)] | ||
| pub enum ChainResult { | ||
| Bridge, | ||
| Candidate, | ||
| } | ||
|
|
||
| pub fn select_longer_chain( | ||
| candidate: &MinaStateProtocolStateValueStableV2, | ||
| tip: &MinaStateProtocolStateValueStableV2, | ||
| ) -> LongerChainResult { | ||
| pub fn select_secure_chain( | ||
| candidate: &MinaProtocolState, | ||
| tip: &MinaProtocolState, | ||
| ) -> Result<ChainResult, String> { | ||
| if is_short_range(candidate, tip)? { | ||
| Ok(select_longer_chain(candidate, tip)) | ||
| } else { | ||
| let tip_density = relative_min_window_density(candidate, tip); | ||
| let candidate_density = relative_min_window_density(candidate, tip); | ||
| Ok(match candidate_density.cmp(&tip_density) { | ||
| Ordering::Less => ChainResult::Bridge, | ||
| Ordering::Equal => select_longer_chain(candidate, tip), | ||
| Ordering::Greater => ChainResult::Candidate, | ||
| }) | ||
| } | ||
| } | ||
|
|
||
| fn select_longer_chain(candidate: &MinaProtocolState, tip: &MinaProtocolState) -> ChainResult { | ||
| let candidate_block_height = &candidate.body.consensus_state.blockchain_length.as_u32(); | ||
| let tip_block_height = &tip.body.consensus_state.blockchain_length.as_u32(); | ||
|
|
||
| if candidate_block_height > tip_block_height { | ||
| return LongerChainResult::Candidate; | ||
| return ChainResult::Candidate; | ||
| } | ||
| // tiebreak logic | ||
| else if candidate_block_height == tip_block_height { | ||
| // compare last VRF digests lexicographically | ||
| if hash_last_vrf(candidate) > hash_last_vrf(tip) { | ||
| return LongerChainResult::Candidate; | ||
| return ChainResult::Candidate; | ||
| } else if hash_last_vrf(candidate) == hash_last_vrf(tip) { | ||
| // compare consensus state hashes lexicographically | ||
| if hash_state(candidate) > hash_state(tip) { | ||
| return LongerChainResult::Candidate; | ||
| return ChainResult::Candidate; | ||
| } | ||
| } | ||
| } | ||
|
|
||
| LongerChainResult::Bridge | ||
| ChainResult::Bridge | ||
| } | ||
|
|
||
| /// Returns true if the fork is short-range, else the fork is long-range. | ||
| fn is_short_range(candidate: &MinaProtocolState, tip: &MinaProtocolState) -> Result<bool, String> { | ||
| // TODO(xqft): verify constants are correct | ||
| if tip.body.constants != candidate.body.constants { | ||
| return Err("Protocol constants on candidate and tip state are not equal".to_string()); | ||
| } | ||
| let slots_per_epoch = tip.body.constants.slots_per_epoch.as_u32(); | ||
|
|
||
| let candidate = &candidate.body.consensus_state; | ||
| let tip = &tip.body.consensus_state; | ||
|
|
||
| let check = |s1: &MinaConsensusState, s2: &MinaConsensusState| { | ||
| let s2_epoch_slot = s2.global_slot() % slots_per_epoch; | ||
| if s1.epoch_count.as_u32() == s2.epoch_count.as_u32() + 1 | ||
| && s2_epoch_slot >= slots_per_epoch * 2 / 3 | ||
| { | ||
| s1.staking_epoch_data.lock_checkpoint == s2.next_epoch_data.lock_checkpoint | ||
| } else { | ||
| false | ||
| } | ||
| }; | ||
|
|
||
| Ok(if candidate.epoch_count == tip.epoch_count { | ||
| candidate.staking_epoch_data.lock_checkpoint == tip.staking_epoch_data.lock_checkpoint | ||
| } else { | ||
| check(candidate, tip) || check(tip, candidate) | ||
| }) | ||
| } | ||
|
|
||
| fn relative_min_window_density(candidate: &MinaProtocolState, tip: &MinaProtocolState) -> u32 { | ||
| let candidate = &candidate.body.consensus_state; | ||
| let tip = &tip.body.consensus_state; | ||
|
|
||
| let max_slot = max(candidate.global_slot(), tip.global_slot()); | ||
|
|
||
| if max_slot < GRACE_PERIOD_END { | ||
| return candidate.min_window_density.as_u32(); | ||
| } | ||
|
|
||
| let projected_window = { | ||
| let shift_count = (max_slot - candidate.global_slot() - 1).clamp(0, SUB_WINDOWS_PER_WINDOW); | ||
| let mut projected_window: Vec<_> = candidate | ||
| .sub_window_densities | ||
| .iter() | ||
| .map(|d| d.as_u32()) | ||
| .collect(); | ||
|
|
||
| let mut i = relative_sub_window(candidate); | ||
| for _ in 0..shift_count { | ||
| i = (i + 1) % SUB_WINDOWS_PER_WINDOW; | ||
| projected_window[i as usize] = 0 | ||
| } | ||
|
|
||
| projected_window | ||
| }; | ||
|
|
||
| let projected_window_density = projected_window.iter().sum(); | ||
|
|
||
| min( | ||
| candidate.min_window_density.as_u32(), | ||
| projected_window_density, | ||
| ) | ||
| } | ||
|
|
||
| fn hash_last_vrf(chain: &MinaStateProtocolStateValueStableV2) -> String { | ||
| fn relative_sub_window(state: &MinaConsensusState) -> u32 { | ||
| (state.global_slot() / SLOTS_PER_SUB_WINDOW) % SUB_WINDOWS_PER_WINDOW | ||
| } | ||
|
|
||
| fn hash_last_vrf(chain: &MinaProtocolState) -> String { | ||
| let mut hasher = Blake2b512::new(); | ||
| hasher.update(chain.body.consensus_state.last_vrf_output.as_slice()); | ||
| let digest = hasher.finalize().to_vec(); | ||
|
|
||
| hex::encode(&digest) | ||
| hex::encode(digest) | ||
| } | ||
|
|
||
| fn hash_state(chain: &MinaStateProtocolStateValueStableV2) -> String { | ||
| fn hash_state(chain: &MinaProtocolState) -> String { | ||
| MinaHash::hash(chain).to_hex() | ||
| } | ||
|
|
||
| #[cfg(test)] | ||
| mod test { | ||
| use mina_bridge_core::proof::state_proof::MinaStateProof; | ||
|
|
||
| use super::*; | ||
|
|
||
| const PROOF_BYTES: &[u8] = | ||
| include_bytes!("../../../../scripts/test_files/mina/mina_state.proof"); | ||
|
|
||
| #[test] | ||
| fn new_mina_state_passes_consensus_checks() { | ||
| let valid_proof: MinaStateProof = bincode::deserialize(PROOF_BYTES).unwrap(); | ||
| let old_tip = valid_proof.bridge_tip_state; | ||
| let new_tip = valid_proof.candidate_chain_states.last().unwrap(); | ||
|
|
||
| assert_eq!( | ||
| select_secure_chain(new_tip, &old_tip).unwrap(), | ||
| ChainResult::Candidate | ||
| ); | ||
| } | ||
|
|
||
| #[test] | ||
| fn old_mina_state_fails_consensus_checks() { | ||
| let valid_proof: MinaStateProof = bincode::deserialize(PROOF_BYTES).unwrap(); | ||
| let old_tip = valid_proof.bridge_tip_state; | ||
| let new_tip = valid_proof.candidate_chain_states.last().unwrap(); | ||
|
|
||
| assert_eq!( | ||
| select_secure_chain(&old_tip, new_tip).unwrap(), | ||
| ChainResult::Bridge | ||
| ); | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Binary file not shown.
Binary file not shown.
Binary file not shown.
File renamed without changes.
File renamed without changes.