mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-04-30 10:47:55 +00:00
Relative slots (#2820)
* Initial work on relative slots for BABE * More work * Update core/consensus/babe/src/lib.rs `Aura` → `Babe` Co-Authored-By: Pierre Krieger <pierre.krieger1708@gmail.com> * More work on relative slots * Add missing field in test-runtime * Bump `impl_version` and `authoring_version` * Fix compile errors and warnings * Upgrade dependencies * Update dependencies more * Revert some updates to dependencies Somehow, those broke the build * Fix compilation errors * `Duration` → `u128` in calculations * `slot_duration` is in milleseconds, not seconds * Median algorithm: ignore blocks with slot_num < sl * Fix silly compile error * Store a duration, rather than an instant It is more useful * Fix compilation errors * `INVERSE_NANO` → `NANOS_PER_SEC` Also: `1000_000_000` → `1_000_000_000` Suggested-by: Niklas Adolfsson <niklasadolfsson1@gmail.com> * Un-bump `authoring_version` * Disable median algorithm when `median_required_blocks` is 0 Otherwise it would panic. * Apply suggestions from code review Co-Authored-By: Bastian Köcher <bkchr@users.noreply.github.com> * Simplify panic * Fix build error * Create `SignedDuration` struct for signed `Duration` values. Suggested-by: Bastian Köcher * Refactor median algorithm into separate function * Add issues for FIXMEs and respond to code review * Fix minor warnings
This commit is contained in:
@@ -30,15 +30,20 @@ use digest::CompatibleDigestItem;
|
||||
pub use digest::{BabePreDigest, BABE_VRF_PREFIX};
|
||||
pub use babe_primitives::*;
|
||||
pub use consensus_common::SyncOracle;
|
||||
use consensus_common::import_queue::{
|
||||
SharedBlockImport, SharedJustificationImport, SharedFinalityProofImport,
|
||||
SharedFinalityProofRequestBuilder,
|
||||
};
|
||||
use consensus_common::well_known_cache_keys::Id as CacheKeyId;
|
||||
use runtime_primitives::{generic, generic::{BlockId, OpaqueDigestItemId}, Justification};
|
||||
use runtime_primitives::traits::{
|
||||
Block, Header, DigestItemFor, ProvideRuntimeApi,
|
||||
SimpleBitOps,
|
||||
SimpleBitOps, Zero,
|
||||
};
|
||||
use std::{sync::Arc, u64, fmt::{Debug, Display}};
|
||||
use std::{sync::Arc, u64, fmt::{Debug, Display}, time::{Instant, Duration}};
|
||||
use runtime_support::serde::{Serialize, Deserialize};
|
||||
use parity_codec::{Decode, Encode};
|
||||
use parking_lot::Mutex;
|
||||
use primitives::{crypto::Pair, sr25519};
|
||||
use merlin::Transcript;
|
||||
use inherents::{InherentDataProviders, InherentData};
|
||||
@@ -77,7 +82,7 @@ use futures::{Future, IntoFuture, future};
|
||||
use tokio_timer::Timeout;
|
||||
use log::{error, warn, debug, info, trace};
|
||||
|
||||
use slots::{SlotWorker, SlotData, SlotInfo, SlotCompatible, slot_now};
|
||||
use slots::{SlotWorker, SlotData, SlotInfo, SlotCompatible, SignedDuration};
|
||||
|
||||
pub use babe_primitives::AuthorityId;
|
||||
|
||||
@@ -332,8 +337,8 @@ impl<Hash, H, B, C, E, I, Error, SO> SlotWorker<B> for BabeWorker<C, E, I, SO> w
|
||||
Box::new(proposal_work.map(move |b| {
|
||||
// minor hack since we don't have access to the timestamp
|
||||
// that is actually set by the proposer.
|
||||
let slot_after_building = slot_now(slot_duration);
|
||||
if slot_after_building != Some(slot_num) {
|
||||
let slot_after_building = SignedDuration::default().slot_now(slot_duration);
|
||||
if slot_after_building != slot_num {
|
||||
info!(
|
||||
target: "babe",
|
||||
"Discarding proposal for slot {}; block production took too long",
|
||||
@@ -512,7 +517,8 @@ fn check_header<B: Block + Sized, C: AuxStore>(
|
||||
pub struct BabeVerifier<C> {
|
||||
client: Arc<C>,
|
||||
inherent_data_providers: inherents::InherentDataProviders,
|
||||
threshold: u64,
|
||||
config: Config,
|
||||
timestamps: Mutex<(Option<Duration>, Vec<(Instant, u64)>)>,
|
||||
}
|
||||
|
||||
impl<C> BabeVerifier<C> {
|
||||
@@ -540,6 +546,38 @@ impl<C> BabeVerifier<C> {
|
||||
}
|
||||
}
|
||||
|
||||
fn median_algorithm(
|
||||
median_required_blocks: u64,
|
||||
slot_duration: u64,
|
||||
slot_num: u64,
|
||||
slot_now: u64,
|
||||
timestamps: &mut (Option<Duration>, Vec<(Instant, u64)>),
|
||||
) {
|
||||
let num_timestamps = timestamps.1.len();
|
||||
if num_timestamps as u64 >= median_required_blocks && median_required_blocks > 0 {
|
||||
let mut new_list: Vec<_> = timestamps.1.iter().map(|&(t, sl)| {
|
||||
let offset: u128 = u128::from(slot_duration)
|
||||
.checked_mul(1_000_000u128) // self.config.get() returns *milliseconds*
|
||||
.and_then(|x| x.checked_mul(u128::from(slot_num).saturating_sub(u128::from(sl))))
|
||||
.expect("we cannot have timespans long enough for this to overflow; qed");
|
||||
const NANOS_PER_SEC: u32 = 1_000_000_000;
|
||||
let nanos = (offset % u128::from(NANOS_PER_SEC)) as u32;
|
||||
let secs = (offset / u128::from(NANOS_PER_SEC)) as u64;
|
||||
t + Duration::new(secs, nanos)
|
||||
}).collect();
|
||||
// FIXME #2926: use a selection algorithm instead of a full sorting algorithm.
|
||||
new_list.sort_unstable();
|
||||
let &median = new_list
|
||||
.get(num_timestamps / 2)
|
||||
.expect("we have at least one timestamp, so this is a valid index; qed");
|
||||
timestamps.1.clear();
|
||||
// FIXME #2927: pass this to the block authoring logic somehow
|
||||
timestamps.0.replace(Instant::now() - median);
|
||||
} else {
|
||||
timestamps.1.push((Instant::now(), slot_now))
|
||||
}
|
||||
}
|
||||
|
||||
impl<B: Block, C> Verifier<B> for BabeVerifier<C> where
|
||||
C: ProvideRuntimeApi + Send + Sync + AuxStore + ProvideCache<B>,
|
||||
C::Api: BlockBuilderApi<B> + BabeApi<B>,
|
||||
@@ -582,7 +620,7 @@ impl<B: Block, C> Verifier<B> for BabeVerifier<C> where
|
||||
header,
|
||||
hash,
|
||||
&authorities[..],
|
||||
self.threshold,
|
||||
self.config.threshold(),
|
||||
)?;
|
||||
match checked_header {
|
||||
CheckedHeader::Checked(pre_header, (pre_digest, seal)) => {
|
||||
@@ -629,7 +667,13 @@ impl<B: Block, C> Verifier<B> for BabeVerifier<C> where
|
||||
auxiliary: Vec::new(),
|
||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
||||
};
|
||||
|
||||
median_algorithm(
|
||||
self.config.0.median_required_blocks,
|
||||
self.config.get(),
|
||||
slot_num,
|
||||
slot_now,
|
||||
&mut *self.timestamps.lock(),
|
||||
);
|
||||
// FIXME #1019 extract authorities
|
||||
Ok((import_block, maybe_keys))
|
||||
}
|
||||
@@ -739,6 +783,72 @@ fn claim_slot(
|
||||
get_keypair(key).vrf_sign_n_check(transcript, |inout| check(inout, threshold))
|
||||
}
|
||||
|
||||
fn initialize_authorities_cache<B, C>(client: &C) -> Result<(), ConsensusError> where
|
||||
B: Block,
|
||||
C: ProvideRuntimeApi + ProvideCache<B>,
|
||||
C::Api: BabeApi<B>,
|
||||
{
|
||||
// no cache => no initialization
|
||||
let cache = match client.cache() {
|
||||
Some(cache) => cache,
|
||||
None => return Ok(()),
|
||||
};
|
||||
|
||||
// check if we already have initialized the cache
|
||||
let genesis_id = BlockId::Number(Zero::zero());
|
||||
let genesis_authorities: Option<Vec<AuthorityId>> = cache
|
||||
.get_at(&well_known_cache_keys::AUTHORITIES, &genesis_id)
|
||||
.and_then(|v| Decode::decode(&mut &v[..]));
|
||||
if genesis_authorities.is_some() {
|
||||
return Ok(());
|
||||
}
|
||||
|
||||
let map_err = |error| consensus_common::Error::from(consensus_common::Error::ClientImport(
|
||||
format!(
|
||||
"Error initializing authorities cache: {}",
|
||||
error,
|
||||
)));
|
||||
let genesis_authorities = authorities(client, &genesis_id)?;
|
||||
cache.initialize(&well_known_cache_keys::AUTHORITIES, genesis_authorities.encode())
|
||||
.map_err(map_err)
|
||||
}
|
||||
|
||||
/// Start an import queue for the Babe consensus algorithm.
|
||||
pub fn import_queue<B, C, E>(
|
||||
config: Config,
|
||||
block_import: SharedBlockImport<B>,
|
||||
justification_import: Option<SharedJustificationImport<B>>,
|
||||
finality_proof_import: Option<SharedFinalityProofImport<B>>,
|
||||
finality_proof_request_builder: Option<SharedFinalityProofRequestBuilder<B>>,
|
||||
client: Arc<C>,
|
||||
inherent_data_providers: InherentDataProviders,
|
||||
) -> Result<BabeImportQueue<B>, consensus_common::Error> where
|
||||
B: Block,
|
||||
C: 'static + ProvideRuntimeApi + ProvideCache<B> + Send + Sync + AuxStore,
|
||||
C::Api: BlockBuilderApi<B> + BabeApi<B>,
|
||||
DigestItemFor<B>: CompatibleDigestItem,
|
||||
E: 'static,
|
||||
{
|
||||
register_babe_inherent_data_provider(&inherent_data_providers, config.get())?;
|
||||
initialize_authorities_cache(&*client)?;
|
||||
|
||||
let verifier = Arc::new(
|
||||
BabeVerifier {
|
||||
client: client,
|
||||
inherent_data_providers,
|
||||
timestamps: Default::default(),
|
||||
config,
|
||||
}
|
||||
);
|
||||
Ok(BasicQueue::new(
|
||||
verifier,
|
||||
block_import,
|
||||
justification_import,
|
||||
finality_proof_import,
|
||||
finality_proof_request_builder,
|
||||
))
|
||||
}
|
||||
|
||||
#[cfg(test)]
|
||||
#[allow(dead_code, unused_imports, deprecated)]
|
||||
// FIXME #2532: need to allow deprecated until refactor is done
|
||||
@@ -753,7 +863,6 @@ mod tests {
|
||||
use network::test::{Block as TestBlock, PeersClient};
|
||||
use runtime_primitives::traits::{Block as BlockT, DigestFor};
|
||||
use network::config::ProtocolConfig;
|
||||
use parking_lot::Mutex;
|
||||
use tokio::runtime::current_thread;
|
||||
use keyring::sr25519::Keyring;
|
||||
use super::generic::DigestItem;
|
||||
@@ -837,7 +946,8 @@ mod tests {
|
||||
Arc::new(BabeVerifier {
|
||||
client,
|
||||
inherent_data_providers,
|
||||
threshold: config.threshold(),
|
||||
config,
|
||||
timestamps: Default::default(),
|
||||
})
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user