Struct pallet_babe::RandomnessFromOneEpochAgo [−][src]
pub struct RandomnessFromOneEpochAgo<T>(_);
Expand description
Randomness usable by on-chain code that does not depend upon finality and takes action based upon on-chain commitments made during the previous epoch.
All randomness is relative to commitments to any other inputs to the computation: If Alice samples randomness near perfectly using radioactive decay, but then afterwards Eve selects an arbitrary value with which to xor Alice’s randomness, then Eve always wins whatever game they play.
All input commitments used with RandomnessFromOneEpochAgo
should come from at least
two epochs ago, although the previous epoch might work in special cases under
additional assumption.
All users learn RandomnessFromOneEpochAgo
at the end of the previous epoch, although
some block producers learn it several block earlier.
Adversaries with enough block producers could bias this randomness by choosing upon what their block producers build at either the end of the previous epoch or the beginning of the current epoch, or electing to skipping some of their own block production slots towards the end of the previous epoch.
Adversaries should not possess many block production slots towards the beginning or end of every epoch, but they possess some influence over when they possess more slots.
As an example usage, we determine parachain auctions ending times in Polkadot using
RandomnessFromOneEpochAgo
because it reduces bias from CurrentBlockRandomness
and
does not require the extra finality delay of RandomnessFromTwoEpochsAgo
.
Trait Implementations
impl<T: Config> Randomness<<T as Config>::Hash, <T as Config>::BlockNumber> for RandomnessFromOneEpochAgo<T>
impl<T: Config> Randomness<<T as Config>::Hash, <T as Config>::BlockNumber> for RandomnessFromOneEpochAgo<T>
Auto Trait Implementations
impl<T> RefUnwindSafe for RandomnessFromOneEpochAgo<T> where
T: RefUnwindSafe,
impl<T> Send for RandomnessFromOneEpochAgo<T> where
T: Send,
impl<T> Sync for RandomnessFromOneEpochAgo<T> where
T: Sync,
impl<T> Unpin for RandomnessFromOneEpochAgo<T> where
T: Unpin,
impl<T> UnwindSafe for RandomnessFromOneEpochAgo<T> where
T: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
Convert Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert &mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read more
Instruments this type with the provided Span
, returning an
Instrumented
wrapper. Read more
type Output = T
type Output = T
Should always be Self
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
The counterpart to unchecked_from
.
Consume self to return an equivalent value of T
.
pub fn vzip(self) -> V