Struct sc_consensus_grandpa::BeforeBestBlockBy

pub struct BeforeBestBlockBy<N>(pub N);

A custom voting rule that guarantees that our vote is always behind the best block by at least N blocks, unless the base number is < N blocks behind the best, in which case it votes for the base.

In the best case our vote is exactly N blocks behind the best block, but if there is a scenario where either >34% of validators run without this rule or the fork-choice rule can prioritize shorter chains over longer ones, the vote may be closer to the best block than N.

Tuple Fields

0: N

Trait Implementations

impl<N: Clone> Clone for BeforeBestBlockBy<N>

fn clone(&self) -> BeforeBestBlockBy<N>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<Block, B> VotingRule<Block, B> for BeforeBestBlockBy<NumberFor<Block>>where Block: BlockT, B: HeaderBackend<Block>,

fn restrict_vote( &self, backend: Arc<B>, base: &Block::Header, best_target: &Block::Header, current_target: &Block::Header ) -> VotingRuleResult<Block>

Restrict the given current_target vote, returning the block hash and number of the block to vote on, and None in case the vote should not be restricted. base is the block that we’re basing our votes on in order to pick our target (e.g. last round estimate), and best_target is the initial best vote target before any vote rules were applied. When applying multiple VotingRules both base and best_target should remain unchanged.