mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-07-15 14:55:42 +00:00
81d8a5d01d
* Initial work on exposing pre-runtime digests
This provides the primitive API, as well as exposing it from BABE.
* Initial work on using pre-digests in runtimes
This includes both code to expose them from `srml_system`, as well as
using it in (currently dead) code in `srml_babe`.
* Bump `{spec,impl}_version`
* Add `u64_backend` feature to curve25519-dalek
Otherwise, it errors out at compile-time.
* Bump `Cargo.lock`
* Do not depend on the schnorrkel crate in the runtime
The schnorrkel crate does not work on `#![no_std]`, but the runtime only
needs constants from it. This adds our own definitions of those
constants, and checks them for correctness at compile-time.
* Actually implement storage of VRF outputs
* Trivial formatting change
* Provide a `hash_randomness` function in BABE
for processing VRF outputs.
* Implement a basic randomness generating function
It just XORs the VRF outputs together.
* Actually implement on-chain randomness
Blake2b is used for hashing.
* Update dependencies
* Run `cargo update` where needed
* Re-add a newline at EOF
* Remove broken and unsafe code
XOR is not a hash function, and must not be used as such. The
implementation was also needlessly unsafe.
* Run `cargo update` where needed
* Remove spurious dependency
* Document security guarantees of BABE randomness
* Add a `RandomnessBeacon` trait
* Document `RandomnessBeacon::random`
* Fix silly compile error (unexpected type arguments)
* Fix BABE randomness
* Implement `FindAuthor` for `babe::Module`
* Apply suggestions from code review
Co-Authored-By: Bastian Köcher <bkchr@users.noreply.github.com>
Co-Authored-By: Robert Habermeier <rphmeier@gmail.com>
* Respond to suggestions from code review and fix bugs
* Store an authority index, not the authority itself.
* Avoid unnecessary decoding.
* Implement relative slots and BABE randomness fully and correctly.
* Remove spurious dependency
* Fix error reported by rust-analyzer
* Update Cargo.lock files
* `wrapping_add` → `checked_add`
The epoch index will not overflow. Panic if it does.
* Move randomness documentation to trait
* Fix compile error in test suite
* Explain 2^64 limit
Co-Authored-By: Robert Habermeier <rphmeier@gmail.com>
175 lines
4.7 KiB
Rust
175 lines
4.7 KiB
Rust
// Copyright 2019 Parity Technologies (UK) Ltd.
|
|
// This file is part of Substrate.
|
|
|
|
// Substrate is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
|
|
// Substrate is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with Substrate. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
//! Utility stream for yielding slots in a loop.
|
|
//!
|
|
//! This is used instead of `tokio_timer::Interval` because it was unreliable.
|
|
|
|
use super::SlotCompatible;
|
|
use consensus_common::Error;
|
|
use futures::prelude::*;
|
|
use futures::try_ready;
|
|
use inherents::{InherentData, InherentDataProviders};
|
|
|
|
use std::time::{Duration, Instant};
|
|
use tokio_timer::Delay;
|
|
|
|
/// Returns current duration since unix epoch.
|
|
pub fn duration_now() -> Duration {
|
|
use std::time::SystemTime;
|
|
let now = SystemTime::now();
|
|
now.duration_since(SystemTime::UNIX_EPOCH).unwrap_or_else(|e| panic!(
|
|
"Current time {:?} is before unix epoch. Something is wrong: {:?}",
|
|
now,
|
|
e,
|
|
))
|
|
}
|
|
|
|
|
|
/// A `Duration` with a sign (before or after). Immutable.
|
|
#[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd, Ord, Hash, Default)]
|
|
pub struct SignedDuration {
|
|
offset: Duration,
|
|
is_positive: bool,
|
|
}
|
|
|
|
impl SignedDuration {
|
|
/// Construct a `SignedDuration`
|
|
pub fn new(offset: Duration, is_positive: bool) -> Self {
|
|
Self { offset, is_positive }
|
|
}
|
|
|
|
/// Get the slot for now. Panics if `slot_duration` is 0.
|
|
pub fn slot_now(&self, slot_duration: u64) -> u64 {
|
|
(if self.is_positive {
|
|
duration_now() + self.offset
|
|
} else {
|
|
duration_now() - self.offset
|
|
}.as_secs()) / slot_duration
|
|
}
|
|
}
|
|
|
|
/// Returns the duration until the next slot, based on current duration since
|
|
pub fn time_until_next(now: Duration, slot_duration: u64) -> Duration {
|
|
let remaining_full_secs = slot_duration - (now.as_secs() % slot_duration) - 1;
|
|
let remaining_nanos = 1_000_000_000 - now.subsec_nanos();
|
|
Duration::new(remaining_full_secs, remaining_nanos)
|
|
}
|
|
|
|
/// Information about a slot.
|
|
pub struct SlotInfo {
|
|
/// The slot number.
|
|
pub number: u64,
|
|
/// Current timestamp.
|
|
pub timestamp: u64,
|
|
/// The instant at which the slot ends.
|
|
pub ends_at: Instant,
|
|
/// The inherent data.
|
|
pub inherent_data: InherentData,
|
|
/// Slot duration.
|
|
pub duration: u64,
|
|
}
|
|
|
|
impl SlotInfo {
|
|
/// Yields the remaining duration in the slot.
|
|
pub fn remaining_duration(&self) -> Duration {
|
|
let now = Instant::now();
|
|
if now < self.ends_at {
|
|
self.ends_at.duration_since(now)
|
|
} else {
|
|
Duration::from_secs(0)
|
|
}
|
|
}
|
|
}
|
|
|
|
/// A stream that returns every time there is a new slot.
|
|
pub struct Slots<SC> {
|
|
last_slot: u64,
|
|
slot_duration: u64,
|
|
inner_delay: Option<Delay>,
|
|
inherent_data_providers: InherentDataProviders,
|
|
timestamp_extractor: SC,
|
|
}
|
|
|
|
impl<SC> Slots<SC> {
|
|
/// Create a new `Slots` stream.
|
|
pub fn new(
|
|
slot_duration: u64,
|
|
inherent_data_providers: InherentDataProviders,
|
|
timestamp_extractor: SC,
|
|
) -> Self {
|
|
Slots {
|
|
last_slot: 0,
|
|
slot_duration,
|
|
inner_delay: None,
|
|
inherent_data_providers,
|
|
timestamp_extractor,
|
|
}
|
|
}
|
|
}
|
|
|
|
impl<SC: SlotCompatible> Stream for Slots<SC> {
|
|
type Item = SlotInfo;
|
|
type Error = Error;
|
|
|
|
fn poll(&mut self) -> Poll<Option<SlotInfo>, Self::Error> {
|
|
loop {
|
|
let slot_duration = self.slot_duration;
|
|
self.inner_delay = match self.inner_delay.take() {
|
|
None => {
|
|
// schedule wait.
|
|
let wait_until = Instant::now() + time_until_next(duration_now(), slot_duration);
|
|
Some(Delay::new(wait_until))
|
|
}
|
|
Some(d) => Some(d),
|
|
};
|
|
|
|
if let Some(ref mut inner_delay) = self.inner_delay {
|
|
try_ready!(inner_delay
|
|
.poll()
|
|
.map_err(Error::FaultyTimer));
|
|
}
|
|
|
|
// timeout has fired.
|
|
|
|
let inherent_data = self
|
|
.inherent_data_providers
|
|
.create_inherent_data()
|
|
.map_err(|s| consensus_common::Error::InherentData(s.into_owned()))?;
|
|
let (timestamp, slot_num, offset) = self
|
|
.timestamp_extractor
|
|
.extract_timestamp_and_slot(&inherent_data)?;
|
|
// reschedule delay for next slot.
|
|
let ends_at = Instant::now() + offset +
|
|
time_until_next(Duration::from_secs(timestamp), slot_duration);
|
|
self.inner_delay = Some(Delay::new(ends_at));
|
|
|
|
// never yield the same slot twice.
|
|
if slot_num > self.last_slot {
|
|
self.last_slot = slot_num;
|
|
|
|
break Ok(Async::Ready(Some(SlotInfo {
|
|
number: slot_num,
|
|
duration: self.slot_duration,
|
|
timestamp,
|
|
ends_at,
|
|
inherent_data,
|
|
})))
|
|
}
|
|
}
|
|
}
|
|
}
|