Struct pallet_babe::CurrentBlockRandomness [−][src]
pub struct CurrentBlockRandomness<T>(_);
Expand description
Randomness produced semi-freshly with each block, but inherits limitations of
RandomnessFromTwoEpochsAgo from which it derives.
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.
As with RandomnessFromTwoEpochsAgo, all input commitments combined with
CurrentBlockRandomness should come from at least two epoch ago, except preferably
not near epoch ending, and thus ideally three epochs ago.
Almost all users learn this randomness for a block when the block producer announces
the block, which makes this randomness appear quite fresh. Yet, the block producer
themselves learned this randomness at the beginning of epoch current_epoch - 2, at
the same time as they learn RandomnessFromTwoEpochsAgo.
Aside from just biasing RandomnessFromTwoEpochsAgo, adversaries could also bias
CurrentBlockRandomness by never announcing their block if doing so yields an
unfavorable randomness. As such, CurrentBlockRandomness should be considered weaker
than both other randomness sources provided by BABE, but CurrentBlockRandomness
remains constrained by declared staking, while a randomness source like block hash is
only constrained by adversaries’ unknowable computational power.
As an example use, parachains could assign block production slots based upon the
CurrentBlockRandomness of their relay parent or relay parent’s parent, provided the
parachain registers collators but avoids censorship sensitive functionality like
slashing. Any parachain with slashing could operate BABE itself or perhaps better yet
a BABE-like approach that derives its CurrentBlockRandomness, and authorizes block
production, based upon the relay parent’s CurrentBlockRandomness or more likely the
relay parent’s RandomnessFromTwoEpochsAgo.
Trait Implementations
impl<T: Config> Randomness<Option<<T as Config>::Hash>, <T as Config>::BlockNumber> for CurrentBlockRandomness<T>
impl<T: Config> Randomness<Option<<T as Config>::Hash>, <T as Config>::BlockNumber> for CurrentBlockRandomness<T>Auto Trait Implementations
impl<T> RefUnwindSafe for CurrentBlockRandomness<T> where
T: RefUnwindSafe, impl<T> Send for CurrentBlockRandomness<T> where
T: Send, impl<T> Sync for CurrentBlockRandomness<T> where
T: Sync, impl<T> Unpin for CurrentBlockRandomness<T> where
T: Unpin, impl<T> UnwindSafe for CurrentBlockRandomness<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 = TShould 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) -> boolChecks 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) -> SSUse 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) -> SPThe 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