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

Get the most recently determined random seed, along with the time in the past since when it was determinable by chain observers. Read more

Get the basic random seed. Read more

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

Convert from a value of T into an equivalent instance of Option<Self>. Read more

Consume self to return Some equivalent value of Option<T>. Read more

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

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

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

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait. Read more

Performs the conversion.

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

Performs the conversion.

Cast reference.

Cast reference.

Cast mutable reference.

Cast mutable reference.

Get a reference to the inner from the outer.

Get a mutable reference to the inner from the outer.

Should always be Self

Convert from a value of T into an equivalent instance of Self. Read more

Consume self to return an equivalent value of T. Read more

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more

Checks if self is actually part of its subset T (and can be converted to it).

Use with care! Same as self.to_subset but without any property checks. Always succeeds.

The inclusion map: converts self to the equivalent element of its superset.

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.

The counterpart to unchecked_from.

Consume self to return an equivalent value of T.