mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-07-20 17:25:41 +00:00
Default fork choice value and intermediates for block import parameters (#4652)
* consensus, pow: intermediate separation and fail * Fix compiles * Update primitives/consensus/common/src/block_import.rs Co-Authored-By: Robert Habermeier <rphmeier@gmail.com> * Update primitives/consensus/common/src/block_import.rs Co-Authored-By: Robert Habermeier <rphmeier@gmail.com> * Document what None means for `fork_choice` in block import params Co-authored-by: Robert Habermeier <rphmeier@gmail.com>
This commit is contained in:
@@ -565,7 +565,8 @@ mod tests {
|
|||||||
storage_changes: None,
|
storage_changes: None,
|
||||||
finalized: false,
|
finalized: false,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::LongestChain),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
};
|
};
|
||||||
|
|||||||
@@ -202,7 +202,8 @@ fn import_block<Backend, Exec, Block, RtApi>(
|
|||||||
finalized: false,
|
finalized: false,
|
||||||
justification: None,
|
justification: None,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::LongestChain),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
};
|
};
|
||||||
|
|||||||
@@ -290,7 +290,8 @@ impl<B, C, E, I, P, Error, SO> sc_consensus_slots::SimpleSlotWorker<B> for AuraW
|
|||||||
storage_changes: Some(storage_changes),
|
storage_changes: Some(storage_changes),
|
||||||
finalized: false,
|
finalized: false,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::LongestChain),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
}
|
}
|
||||||
@@ -644,7 +645,8 @@ impl<B: BlockT, C, P, T> Verifier<B> for AuraVerifier<C, P, T> where
|
|||||||
finalized: false,
|
finalized: false,
|
||||||
justification,
|
justification,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::LongestChain),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
};
|
};
|
||||||
|
|||||||
@@ -451,10 +451,8 @@ impl<B, C, E, I, Error, SO> sc_consensus_slots::SimpleSlotWorker<B> for BabeWork
|
|||||||
storage_changes: Some(storage_changes),
|
storage_changes: Some(storage_changes),
|
||||||
finalized: false,
|
finalized: false,
|
||||||
auxiliary: Vec::new(), // block-weight is written in block import.
|
auxiliary: Vec::new(), // block-weight is written in block import.
|
||||||
// TODO: block-import handles fork choice and this shouldn't even have the
|
intermediates: Default::default(),
|
||||||
// option to specify one.
|
fork_choice: None,
|
||||||
// https://github.com/paritytech/substrate/issues/3623
|
|
||||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
}
|
}
|
||||||
@@ -807,10 +805,8 @@ impl<B, E, Block, RA, PRA> Verifier<Block> for BabeVerifier<B, E, Block, RA, PRA
|
|||||||
finalized: false,
|
finalized: false,
|
||||||
justification,
|
justification,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
// TODO: block-import handles fork choice and this shouldn't even have the
|
intermediates: Default::default(),
|
||||||
// option to specify one.
|
fork_choice: None,
|
||||||
// https://github.com/paritytech/substrate/issues/3623
|
|
||||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
};
|
};
|
||||||
@@ -1085,13 +1081,13 @@ impl<B, E, Block, I, RA, PRA> BlockImport<Block> for BabeBlockImport<B, E, Block
|
|||||||
)?
|
)?
|
||||||
};
|
};
|
||||||
|
|
||||||
ForkChoiceStrategy::Custom(if total_weight > last_best_weight {
|
Some(ForkChoiceStrategy::Custom(if total_weight > last_best_weight {
|
||||||
true
|
true
|
||||||
} else if total_weight == last_best_weight {
|
} else if total_weight == last_best_weight {
|
||||||
number > last_best_number
|
number > last_best_number
|
||||||
} else {
|
} else {
|
||||||
false
|
false
|
||||||
})
|
}))
|
||||||
};
|
};
|
||||||
|
|
||||||
let import_result = self.inner.import_block(block, new_cache);
|
let import_result = self.inner.import_block(block, new_cache);
|
||||||
|
|||||||
@@ -594,7 +594,8 @@ fn propose_and_import_block<Transaction>(
|
|||||||
storage_changes: None,
|
storage_changes: None,
|
||||||
finalized: false,
|
finalized: false,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::LongestChain),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
},
|
},
|
||||||
|
|||||||
@@ -32,6 +32,7 @@
|
|||||||
use std::sync::Arc;
|
use std::sync::Arc;
|
||||||
use std::thread;
|
use std::thread;
|
||||||
use std::collections::HashMap;
|
use std::collections::HashMap;
|
||||||
|
use std::marker::PhantomData;
|
||||||
use sc_client_api::{BlockOf, backend::AuxStore};
|
use sc_client_api::{BlockOf, backend::AuxStore};
|
||||||
use sp_blockchain::{HeaderBackend, ProvideCache, well_known_cache_keys::Id as CacheKeyId};
|
use sp_blockchain::{HeaderBackend, ProvideCache, well_known_cache_keys::Id as CacheKeyId};
|
||||||
use sp_block_builder::BlockBuilder as BlockBuilderApi;
|
use sp_block_builder::BlockBuilder as BlockBuilderApi;
|
||||||
@@ -43,7 +44,8 @@ use sp_consensus_pow::{Seal, TotalDifficulty, POW_ENGINE_ID};
|
|||||||
use sp_inherents::{InherentDataProviders, InherentData};
|
use sp_inherents::{InherentDataProviders, InherentData};
|
||||||
use sp_consensus::{
|
use sp_consensus::{
|
||||||
BlockImportParams, BlockOrigin, ForkChoiceStrategy, SyncOracle, Environment, Proposer,
|
BlockImportParams, BlockOrigin, ForkChoiceStrategy, SyncOracle, Environment, Proposer,
|
||||||
SelectChain, Error as ConsensusError, CanAuthorWith, RecordProof,
|
SelectChain, Error as ConsensusError, CanAuthorWith, RecordProof, BlockImport,
|
||||||
|
BlockCheckParams, ImportResult,
|
||||||
};
|
};
|
||||||
use sp_consensus::import_queue::{BoxBlockImport, BasicQueue, Verifier};
|
use sp_consensus::import_queue::{BoxBlockImport, BasicQueue, Verifier};
|
||||||
use codec::{Encode, Decode};
|
use codec::{Encode, Decode};
|
||||||
@@ -59,6 +61,10 @@ pub enum Error<B: BlockT> {
|
|||||||
HeaderUnsealed(B::Hash),
|
HeaderUnsealed(B::Hash),
|
||||||
#[display(fmt = "PoW validation error: invalid seal")]
|
#[display(fmt = "PoW validation error: invalid seal")]
|
||||||
InvalidSeal,
|
InvalidSeal,
|
||||||
|
#[display(fmt = "PoW validation error: invalid difficulty")]
|
||||||
|
InvalidDifficulty,
|
||||||
|
#[display(fmt = "PoW block import expects an intermediate, but not found one")]
|
||||||
|
NoIntermediate,
|
||||||
#[display(fmt = "Rejecting block too far in future")]
|
#[display(fmt = "Rejecting block too far in future")]
|
||||||
TooFarInFuture,
|
TooFarInFuture,
|
||||||
#[display(fmt = "Fetching best header failed using select chain: {:?}", _0)]
|
#[display(fmt = "Fetching best header failed using select chain: {:?}", _0)]
|
||||||
@@ -89,6 +95,12 @@ impl<B: BlockT> std::convert::From<Error<B>> for String {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
impl<B: BlockT> std::convert::From<Error<B>> for ConsensusError {
|
||||||
|
fn from(error: Error<B>) -> ConsensusError {
|
||||||
|
ConsensusError::ClientImport(error.to_string())
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
/// Auxiliary storage prefix for PoW engine.
|
/// Auxiliary storage prefix for PoW engine.
|
||||||
pub const POW_AUX_PREFIX: [u8; 4] = *b"PoW:";
|
pub const POW_AUX_PREFIX: [u8; 4] = *b"PoW:";
|
||||||
|
|
||||||
@@ -97,6 +109,18 @@ fn aux_key<T: AsRef<[u8]>>(hash: &T) -> Vec<u8> {
|
|||||||
POW_AUX_PREFIX.iter().chain(hash.as_ref()).copied().collect()
|
POW_AUX_PREFIX.iter().chain(hash.as_ref()).copied().collect()
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/// Intermediate value passed to block importer.
|
||||||
|
#[derive(Encode, Decode, Clone, Debug, Default)]
|
||||||
|
pub struct PowIntermediate<B: BlockT, Difficulty> {
|
||||||
|
/// The header hash with seal, used for auxiliary key.
|
||||||
|
pub hash: B::Hash,
|
||||||
|
/// Difficulty of the block, if known.
|
||||||
|
pub difficulty: Option<Difficulty>,
|
||||||
|
}
|
||||||
|
|
||||||
|
/// Intermediate key for PoW engine.
|
||||||
|
pub static INTERMEDIATE_KEY: &[u8] = b"pow1";
|
||||||
|
|
||||||
/// Auxiliary storage data for PoW.
|
/// Auxiliary storage data for PoW.
|
||||||
#[derive(Encode, Decode, Clone, Debug, Default)]
|
#[derive(Encode, Decode, Clone, Debug, Default)]
|
||||||
pub struct PowAux<Difficulty> {
|
pub struct PowAux<Difficulty> {
|
||||||
@@ -126,14 +150,22 @@ pub trait PowAlgorithm<B: BlockT> {
|
|||||||
type Difficulty: TotalDifficulty + Default + Encode + Decode + Ord + Clone + Copy;
|
type Difficulty: TotalDifficulty + Default + Encode + Decode + Ord + Clone + Copy;
|
||||||
|
|
||||||
/// Get the next block's difficulty.
|
/// Get the next block's difficulty.
|
||||||
|
///
|
||||||
|
/// This function will be called twice during the import process, so the implementation
|
||||||
|
/// should be properly cached.
|
||||||
fn difficulty(&self, parent: &BlockId<B>) -> Result<Self::Difficulty, Error<B>>;
|
fn difficulty(&self, parent: &BlockId<B>) -> Result<Self::Difficulty, Error<B>>;
|
||||||
/// Verify proof of work against the given difficulty.
|
/// Verify that the seal is valid against given pre hash.
|
||||||
fn verify(
|
fn verify_seal(
|
||||||
&self,
|
&self,
|
||||||
parent: &BlockId<B>,
|
|
||||||
pre_hash: &B::Hash,
|
pre_hash: &B::Hash,
|
||||||
seal: &Seal,
|
seal: &Seal,
|
||||||
|
) -> Result<bool, Error<B>>;
|
||||||
|
/// Verify that the difficulty is valid against given seal.
|
||||||
|
fn verify_difficulty(
|
||||||
|
&self,
|
||||||
difficulty: Self::Difficulty,
|
difficulty: Self::Difficulty,
|
||||||
|
parent: &BlockId<B>,
|
||||||
|
seal: &Seal,
|
||||||
) -> Result<bool, Error<B>>;
|
) -> Result<bool, Error<B>>;
|
||||||
/// Mine a seal that satisfies the given difficulty.
|
/// Mine a seal that satisfies the given difficulty.
|
||||||
fn mine(
|
fn mine(
|
||||||
@@ -145,59 +177,35 @@ pub trait PowAlgorithm<B: BlockT> {
|
|||||||
) -> Result<Option<Seal>, Error<B>>;
|
) -> Result<Option<Seal>, Error<B>>;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// A verifier for PoW blocks.
|
/// A block importer for PoW.
|
||||||
pub struct PowVerifier<B: BlockT, C, S, Algorithm> {
|
pub struct PowBlockImport<B: BlockT, I, C, S, Algorithm> {
|
||||||
client: Arc<C>,
|
|
||||||
algorithm: Algorithm,
|
algorithm: Algorithm,
|
||||||
inherent_data_providers: sp_inherents::InherentDataProviders,
|
inner: I,
|
||||||
select_chain: Option<S>,
|
select_chain: Option<S>,
|
||||||
|
client: Arc<C>,
|
||||||
|
inherent_data_providers: sp_inherents::InherentDataProviders,
|
||||||
check_inherents_after: <<B as BlockT>::Header as HeaderT>::Number,
|
check_inherents_after: <<B as BlockT>::Header as HeaderT>::Number,
|
||||||
}
|
}
|
||||||
|
|
||||||
impl<B: BlockT, C, S, Algorithm> PowVerifier<B, C, S, Algorithm> {
|
impl<B, I, C, S, Algorithm> PowBlockImport<B, I, C, S, Algorithm> where
|
||||||
|
B: BlockT,
|
||||||
|
I: BlockImport<B, Transaction = sp_api::TransactionFor<C, B>> + Send + Sync,
|
||||||
|
I::Error: Into<ConsensusError>,
|
||||||
|
C: ProvideRuntimeApi<B> + Send + Sync + HeaderBackend<B> + AuxStore + ProvideCache<B> + BlockOf,
|
||||||
|
C::Api: BlockBuilderApi<B, Error = sp_blockchain::Error>,
|
||||||
|
Algorithm: PowAlgorithm<B>,
|
||||||
|
{
|
||||||
|
/// Create a new block import suitable to be used in PoW
|
||||||
pub fn new(
|
pub fn new(
|
||||||
|
inner: I,
|
||||||
client: Arc<C>,
|
client: Arc<C>,
|
||||||
algorithm: Algorithm,
|
algorithm: Algorithm,
|
||||||
check_inherents_after: <<B as BlockT>::Header as HeaderT>::Number,
|
check_inherents_after: <<B as BlockT>::Header as HeaderT>::Number,
|
||||||
select_chain: Option<S>,
|
select_chain: Option<S>,
|
||||||
inherent_data_providers: sp_inherents::InherentDataProviders,
|
inherent_data_providers: sp_inherents::InherentDataProviders,
|
||||||
) -> Self {
|
) -> Self {
|
||||||
Self { client, algorithm, inherent_data_providers, select_chain, check_inherents_after }
|
Self { inner, client, algorithm, check_inherents_after,
|
||||||
}
|
select_chain, inherent_data_providers }
|
||||||
|
|
||||||
fn check_header(
|
|
||||||
&self,
|
|
||||||
mut header: B::Header,
|
|
||||||
parent_block_id: BlockId<B>,
|
|
||||||
) -> Result<(B::Header, Algorithm::Difficulty, DigestItem<B::Hash>), Error<B>> where
|
|
||||||
Algorithm: PowAlgorithm<B>,
|
|
||||||
{
|
|
||||||
let hash = header.hash();
|
|
||||||
|
|
||||||
let (seal, inner_seal) = match header.digest_mut().pop() {
|
|
||||||
Some(DigestItem::Seal(id, seal)) => {
|
|
||||||
if id == POW_ENGINE_ID {
|
|
||||||
(DigestItem::Seal(id, seal.clone()), seal)
|
|
||||||
} else {
|
|
||||||
return Err(Error::WrongEngine(id))
|
|
||||||
}
|
|
||||||
},
|
|
||||||
_ => return Err(Error::HeaderUnsealed(hash)),
|
|
||||||
};
|
|
||||||
|
|
||||||
let pre_hash = header.hash();
|
|
||||||
let difficulty = self.algorithm.difficulty(&parent_block_id)?;
|
|
||||||
|
|
||||||
if !self.algorithm.verify(
|
|
||||||
&parent_block_id,
|
|
||||||
&pre_hash,
|
|
||||||
&inner_seal,
|
|
||||||
difficulty,
|
|
||||||
)? {
|
|
||||||
return Err(Error::InvalidSeal);
|
|
||||||
}
|
|
||||||
|
|
||||||
Ok((header, difficulty, seal))
|
|
||||||
}
|
}
|
||||||
|
|
||||||
fn check_inherents(
|
fn check_inherents(
|
||||||
@@ -206,9 +214,7 @@ impl<B: BlockT, C, S, Algorithm> PowVerifier<B, C, S, Algorithm> {
|
|||||||
block_id: BlockId<B>,
|
block_id: BlockId<B>,
|
||||||
inherent_data: InherentData,
|
inherent_data: InherentData,
|
||||||
timestamp_now: u64,
|
timestamp_now: u64,
|
||||||
) -> Result<(), Error<B>> where
|
) -> Result<(), Error<B>> {
|
||||||
C: ProvideRuntimeApi<B>, C::Api: BlockBuilderApi<B, Error = sp_blockchain::Error>
|
|
||||||
{
|
|
||||||
const MAX_TIMESTAMP_DRIFT_SECS: u64 = 60;
|
const MAX_TIMESTAMP_DRIFT_SECS: u64 = 60;
|
||||||
|
|
||||||
if *block.header().number() < self.check_inherents_after {
|
if *block.header().number() < self.check_inherents_after {
|
||||||
@@ -243,10 +249,148 @@ impl<B: BlockT, C, S, Algorithm> PowVerifier<B, C, S, Algorithm> {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
impl<B: BlockT, C, S, Algorithm> Verifier<B> for PowVerifier<B, C, S, Algorithm> where
|
impl<B, I, C, S, Algorithm> BlockImport<B> for PowBlockImport<B, I, C, S, Algorithm> where
|
||||||
|
B: BlockT,
|
||||||
|
I: BlockImport<B, Transaction = sp_api::TransactionFor<C, B>> + Send + Sync,
|
||||||
|
I::Error: Into<ConsensusError>,
|
||||||
|
S: SelectChain<B>,
|
||||||
C: ProvideRuntimeApi<B> + Send + Sync + HeaderBackend<B> + AuxStore + ProvideCache<B> + BlockOf,
|
C: ProvideRuntimeApi<B> + Send + Sync + HeaderBackend<B> + AuxStore + ProvideCache<B> + BlockOf,
|
||||||
C::Api: BlockBuilderApi<B, Error = sp_blockchain::Error>,
|
C::Api: BlockBuilderApi<B, Error = sp_blockchain::Error>,
|
||||||
S: SelectChain<B>,
|
Algorithm: PowAlgorithm<B>,
|
||||||
|
{
|
||||||
|
type Error = ConsensusError;
|
||||||
|
type Transaction = sp_api::TransactionFor<C, B>;
|
||||||
|
|
||||||
|
fn check_block(
|
||||||
|
&mut self,
|
||||||
|
block: BlockCheckParams<B>,
|
||||||
|
) -> Result<ImportResult, Self::Error> {
|
||||||
|
self.inner.check_block(block).map_err(Into::into)
|
||||||
|
}
|
||||||
|
|
||||||
|
fn import_block(
|
||||||
|
&mut self,
|
||||||
|
mut block: BlockImportParams<B, Self::Transaction>,
|
||||||
|
new_cache: HashMap<CacheKeyId, Vec<u8>>,
|
||||||
|
) -> Result<ImportResult, Self::Error> {
|
||||||
|
let best_hash = match self.select_chain.as_ref() {
|
||||||
|
Some(select_chain) => select_chain.best_chain()
|
||||||
|
.map_err(|e| format!("Fetch best chain failed via select chain: {:?}", e))?
|
||||||
|
.hash(),
|
||||||
|
None => self.client.info().best_hash,
|
||||||
|
};
|
||||||
|
|
||||||
|
let parent_hash = *block.header.parent_hash();
|
||||||
|
let best_aux = PowAux::read::<_, B>(self.client.as_ref(), &best_hash)?;
|
||||||
|
let mut aux = PowAux::read::<_, B>(self.client.as_ref(), &parent_hash)?;
|
||||||
|
|
||||||
|
if let Some(inner_body) = block.body.take() {
|
||||||
|
let inherent_data = self.inherent_data_providers
|
||||||
|
.create_inherent_data().map_err(|e| e.into_string())?;
|
||||||
|
let timestamp_now = inherent_data.timestamp_inherent_data().map_err(|e| e.into_string())?;
|
||||||
|
|
||||||
|
let check_block = B::new(block.header.clone(), inner_body);
|
||||||
|
|
||||||
|
self.check_inherents(
|
||||||
|
check_block.clone(),
|
||||||
|
BlockId::Hash(parent_hash),
|
||||||
|
inherent_data,
|
||||||
|
timestamp_now
|
||||||
|
)?;
|
||||||
|
|
||||||
|
block.body = Some(check_block.deconstruct().1);
|
||||||
|
}
|
||||||
|
|
||||||
|
let inner_seal = match block.post_digests.last() {
|
||||||
|
Some(DigestItem::Seal(id, seal)) => {
|
||||||
|
if id == &POW_ENGINE_ID {
|
||||||
|
seal.clone()
|
||||||
|
} else {
|
||||||
|
return Err(Error::<B>::WrongEngine(*id).into())
|
||||||
|
}
|
||||||
|
},
|
||||||
|
_ => return Err(Error::<B>::HeaderUnsealed(block.header.hash()).into()),
|
||||||
|
};
|
||||||
|
|
||||||
|
let intermediate = PowIntermediate::<B, Algorithm::Difficulty>::decode(
|
||||||
|
&mut &block.intermediates.remove(INTERMEDIATE_KEY)
|
||||||
|
.ok_or(Error::<B>::NoIntermediate)?[..]
|
||||||
|
).map_err(|_| Error::<B>::NoIntermediate)?;
|
||||||
|
|
||||||
|
let difficulty = match intermediate.difficulty {
|
||||||
|
Some(difficulty) => difficulty,
|
||||||
|
None => self.algorithm.difficulty(&BlockId::hash(parent_hash))?,
|
||||||
|
};
|
||||||
|
|
||||||
|
if !self.algorithm.verify_difficulty(
|
||||||
|
difficulty,
|
||||||
|
&BlockId::hash(parent_hash),
|
||||||
|
&inner_seal,
|
||||||
|
)? {
|
||||||
|
return Err(Error::<B>::InvalidDifficulty.into())
|
||||||
|
}
|
||||||
|
|
||||||
|
aux.difficulty = difficulty;
|
||||||
|
aux.total_difficulty.increment(difficulty);
|
||||||
|
|
||||||
|
let key = aux_key(&intermediate.hash);
|
||||||
|
block.auxiliary.push((key, Some(aux.encode())));
|
||||||
|
if block.fork_choice.is_none() {
|
||||||
|
block.fork_choice = Some(ForkChoiceStrategy::Custom(
|
||||||
|
aux.total_difficulty > best_aux.total_difficulty
|
||||||
|
));
|
||||||
|
}
|
||||||
|
|
||||||
|
self.inner.import_block(block, new_cache).map_err(Into::into)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/// A verifier for PoW blocks.
|
||||||
|
pub struct PowVerifier<B: BlockT, Algorithm> {
|
||||||
|
algorithm: Algorithm,
|
||||||
|
_marker: PhantomData<B>,
|
||||||
|
}
|
||||||
|
|
||||||
|
impl<B: BlockT, Algorithm> PowVerifier<B, Algorithm> {
|
||||||
|
pub fn new(
|
||||||
|
algorithm: Algorithm,
|
||||||
|
) -> Self {
|
||||||
|
Self { algorithm, _marker: PhantomData }
|
||||||
|
}
|
||||||
|
|
||||||
|
fn check_header(
|
||||||
|
&self,
|
||||||
|
mut header: B::Header,
|
||||||
|
) -> Result<(B::Header, DigestItem<B::Hash>), Error<B>> where
|
||||||
|
Algorithm: PowAlgorithm<B>,
|
||||||
|
{
|
||||||
|
let hash = header.hash();
|
||||||
|
|
||||||
|
let (seal, inner_seal) = match header.digest_mut().pop() {
|
||||||
|
Some(DigestItem::Seal(id, seal)) => {
|
||||||
|
if id == POW_ENGINE_ID {
|
||||||
|
(DigestItem::Seal(id, seal.clone()), seal)
|
||||||
|
} else {
|
||||||
|
return Err(Error::WrongEngine(id))
|
||||||
|
}
|
||||||
|
},
|
||||||
|
_ => return Err(Error::HeaderUnsealed(hash)),
|
||||||
|
};
|
||||||
|
|
||||||
|
let pre_hash = header.hash();
|
||||||
|
|
||||||
|
if !self.algorithm.verify_seal(
|
||||||
|
&pre_hash,
|
||||||
|
&inner_seal,
|
||||||
|
)? {
|
||||||
|
return Err(Error::InvalidSeal);
|
||||||
|
}
|
||||||
|
|
||||||
|
Ok((header, seal))
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
impl<B: BlockT, Algorithm> Verifier<B> for PowVerifier<B, Algorithm> where
|
||||||
Algorithm: PowAlgorithm<B> + Send + Sync,
|
Algorithm: PowAlgorithm<B> + Send + Sync,
|
||||||
{
|
{
|
||||||
fn verify(
|
fn verify(
|
||||||
@@ -254,44 +398,16 @@ impl<B: BlockT, C, S, Algorithm> Verifier<B> for PowVerifier<B, C, S, Algorithm>
|
|||||||
origin: BlockOrigin,
|
origin: BlockOrigin,
|
||||||
header: B::Header,
|
header: B::Header,
|
||||||
justification: Option<Justification>,
|
justification: Option<Justification>,
|
||||||
mut body: Option<Vec<B::Extrinsic>>,
|
body: Option<Vec<B::Extrinsic>>,
|
||||||
) -> Result<(BlockImportParams<B, ()>, Option<Vec<(CacheKeyId, Vec<u8>)>>), String> {
|
) -> Result<(BlockImportParams<B, ()>, Option<Vec<(CacheKeyId, Vec<u8>)>>), String> {
|
||||||
let inherent_data = self.inherent_data_providers
|
|
||||||
.create_inherent_data().map_err(|e| e.into_string())?;
|
|
||||||
let timestamp_now = inherent_data.timestamp_inherent_data().map_err(|e| e.into_string())?;
|
|
||||||
|
|
||||||
let best_hash = match self.select_chain.as_ref() {
|
|
||||||
Some(select_chain) => select_chain.best_chain()
|
|
||||||
.map_err(|e| format!("Fetch best chain failed via select chain: {:?}", e))?
|
|
||||||
.hash(),
|
|
||||||
None => self.client.info().best_hash,
|
|
||||||
};
|
|
||||||
let hash = header.hash();
|
let hash = header.hash();
|
||||||
let parent_hash = *header.parent_hash();
|
let (checked_header, seal) = self.check_header(header)?;
|
||||||
let best_aux = PowAux::read::<_, B>(self.client.as_ref(), &best_hash)?;
|
|
||||||
let mut aux = PowAux::read::<_, B>(self.client.as_ref(), &parent_hash)?;
|
|
||||||
|
|
||||||
let (checked_header, difficulty, seal) = self.check_header(
|
let intermediate = PowIntermediate::<B, Algorithm::Difficulty> {
|
||||||
header,
|
hash: hash,
|
||||||
BlockId::Hash(parent_hash),
|
difficulty: None,
|
||||||
)?;
|
};
|
||||||
aux.difficulty = difficulty;
|
|
||||||
aux.total_difficulty.increment(difficulty);
|
|
||||||
|
|
||||||
if let Some(inner_body) = body.take() {
|
|
||||||
let block = B::new(checked_header.clone(), inner_body);
|
|
||||||
|
|
||||||
self.check_inherents(
|
|
||||||
block.clone(),
|
|
||||||
BlockId::Hash(parent_hash),
|
|
||||||
inherent_data,
|
|
||||||
timestamp_now
|
|
||||||
)?;
|
|
||||||
|
|
||||||
body = Some(block.deconstruct().1);
|
|
||||||
}
|
|
||||||
|
|
||||||
let key = aux_key(&hash);
|
|
||||||
let import_block = BlockImportParams {
|
let import_block = BlockImportParams {
|
||||||
origin,
|
origin,
|
||||||
header: checked_header,
|
header: checked_header,
|
||||||
@@ -300,10 +416,13 @@ impl<B: BlockT, C, S, Algorithm> Verifier<B> for PowVerifier<B, C, S, Algorithm>
|
|||||||
storage_changes: None,
|
storage_changes: None,
|
||||||
finalized: false,
|
finalized: false,
|
||||||
justification,
|
justification,
|
||||||
auxiliary: vec![(key, Some(aux.encode()))],
|
intermediates: {
|
||||||
fork_choice: ForkChoiceStrategy::Custom(
|
let mut ret = HashMap::new();
|
||||||
aux.total_difficulty > best_aux.total_difficulty
|
ret.insert(INTERMEDIATE_KEY.to_vec(), intermediate.encode());
|
||||||
),
|
ret
|
||||||
|
},
|
||||||
|
auxiliary: vec![],
|
||||||
|
fork_choice: None,
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
};
|
};
|
||||||
@@ -332,10 +451,7 @@ pub type PowImportQueue<B, Transaction> = BasicQueue<B, Transaction>;
|
|||||||
/// Import queue for PoW engine.
|
/// Import queue for PoW engine.
|
||||||
pub fn import_queue<B, C, S, Algorithm>(
|
pub fn import_queue<B, C, S, Algorithm>(
|
||||||
block_import: BoxBlockImport<B, sp_api::TransactionFor<C, B>>,
|
block_import: BoxBlockImport<B, sp_api::TransactionFor<C, B>>,
|
||||||
client: Arc<C>,
|
|
||||||
algorithm: Algorithm,
|
algorithm: Algorithm,
|
||||||
check_inherents_after: <<B as BlockT>::Header as HeaderT>::Number,
|
|
||||||
select_chain: Option<S>,
|
|
||||||
inherent_data_providers: InherentDataProviders,
|
inherent_data_providers: InherentDataProviders,
|
||||||
) -> Result<
|
) -> Result<
|
||||||
PowImportQueue<B, sp_api::TransactionFor<C, B>>,
|
PowImportQueue<B, sp_api::TransactionFor<C, B>>,
|
||||||
@@ -345,18 +461,12 @@ pub fn import_queue<B, C, S, Algorithm>(
|
|||||||
C: ProvideRuntimeApi<B> + HeaderBackend<B> + BlockOf + ProvideCache<B> + AuxStore,
|
C: ProvideRuntimeApi<B> + HeaderBackend<B> + BlockOf + ProvideCache<B> + AuxStore,
|
||||||
C: Send + Sync + AuxStore + 'static,
|
C: Send + Sync + AuxStore + 'static,
|
||||||
C::Api: BlockBuilderApi<B, Error = sp_blockchain::Error>,
|
C::Api: BlockBuilderApi<B, Error = sp_blockchain::Error>,
|
||||||
Algorithm: PowAlgorithm<B> + Send + Sync + 'static,
|
Algorithm: PowAlgorithm<B> + Clone + Send + Sync + 'static,
|
||||||
S: SelectChain<B> + 'static,
|
S: SelectChain<B> + 'static,
|
||||||
{
|
{
|
||||||
register_pow_inherent_data_provider(&inherent_data_providers)?;
|
register_pow_inherent_data_provider(&inherent_data_providers)?;
|
||||||
|
|
||||||
let verifier = PowVerifier::new(
|
let verifier = PowVerifier::new(algorithm);
|
||||||
client.clone(),
|
|
||||||
algorithm,
|
|
||||||
check_inherents_after,
|
|
||||||
select_chain,
|
|
||||||
inherent_data_providers,
|
|
||||||
);
|
|
||||||
|
|
||||||
Ok(BasicQueue::new(
|
Ok(BasicQueue::new(
|
||||||
verifier,
|
verifier,
|
||||||
@@ -485,7 +595,6 @@ fn mine_loop<B: BlockT, C, Algorithm, E, SO, S, CAW>(
|
|||||||
continue 'outer
|
continue 'outer
|
||||||
}
|
}
|
||||||
|
|
||||||
let mut aux = PowAux::read(client, &best_hash)?;
|
|
||||||
let mut proposer = futures::executor::block_on(env.init(&best_header))
|
let mut proposer = futures::executor::block_on(env.init(&best_header))
|
||||||
.map_err(|e| Error::Environment(format!("{:?}", e)))?;
|
.map_err(|e| Error::Environment(format!("{:?}", e)))?;
|
||||||
|
|
||||||
@@ -526,38 +635,36 @@ fn mine_loop<B: BlockT, C, Algorithm, E, SO, S, CAW>(
|
|||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
aux.difficulty = difficulty;
|
let (hash, seal) = {
|
||||||
aux.total_difficulty.increment(difficulty);
|
let seal = DigestItem::Seal(POW_ENGINE_ID, seal);
|
||||||
let hash = {
|
|
||||||
let mut header = header.clone();
|
let mut header = header.clone();
|
||||||
header.digest_mut().push(DigestItem::Seal(POW_ENGINE_ID, seal.clone()));
|
header.digest_mut().push(seal);
|
||||||
header.hash()
|
let hash = header.hash();
|
||||||
|
let seal = header.digest_mut().pop()
|
||||||
|
.expect("Pushed one seal above; length greater than zero; qed");
|
||||||
|
(hash, seal)
|
||||||
};
|
};
|
||||||
|
|
||||||
let key = aux_key(&hash);
|
let intermediate = PowIntermediate::<B, Algorithm::Difficulty> {
|
||||||
let best_hash = match select_chain {
|
hash,
|
||||||
Some(select_chain) => select_chain.best_chain()
|
difficulty: Some(difficulty),
|
||||||
.map_err(Error::BestHashSelectChain)?
|
|
||||||
.hash(),
|
|
||||||
None => client.info().best_hash,
|
|
||||||
};
|
};
|
||||||
let best_aux = PowAux::<Algorithm::Difficulty>::read(client, &best_hash)?;
|
|
||||||
|
|
||||||
// if the best block has changed in the meantime drop our proposal
|
|
||||||
if best_aux.total_difficulty > aux.total_difficulty {
|
|
||||||
continue 'outer
|
|
||||||
}
|
|
||||||
|
|
||||||
let import_block = BlockImportParams {
|
let import_block = BlockImportParams {
|
||||||
origin: BlockOrigin::Own,
|
origin: BlockOrigin::Own,
|
||||||
header,
|
header,
|
||||||
justification: None,
|
justification: None,
|
||||||
post_digests: vec![DigestItem::Seal(POW_ENGINE_ID, seal)],
|
post_digests: vec![seal],
|
||||||
body: Some(body),
|
body: Some(body),
|
||||||
storage_changes: Some(proposal.storage_changes),
|
storage_changes: Some(proposal.storage_changes),
|
||||||
|
intermediates: {
|
||||||
|
let mut ret = HashMap::new();
|
||||||
|
ret.insert(INTERMEDIATE_KEY.to_vec(), intermediate.encode());
|
||||||
|
ret
|
||||||
|
},
|
||||||
finalized: false,
|
finalized: false,
|
||||||
auxiliary: vec![(key, Some(aux.encode()))],
|
auxiliary: vec![],
|
||||||
fork_choice: ForkChoiceStrategy::Custom(true),
|
fork_choice: None,
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
};
|
};
|
||||||
|
|||||||
@@ -697,7 +697,8 @@ pub mod tests {
|
|||||||
storage_changes: None,
|
storage_changes: None,
|
||||||
finalized: false,
|
finalized: false,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::LongestChain),
|
||||||
allow_missing_state: true,
|
allow_missing_state: true,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
};
|
};
|
||||||
|
|||||||
@@ -1032,7 +1032,8 @@ fn allows_reimporting_change_blocks() {
|
|||||||
storage_changes: None,
|
storage_changes: None,
|
||||||
finalized: false,
|
finalized: false,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::LongestChain),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
}
|
}
|
||||||
@@ -1091,7 +1092,8 @@ fn test_bad_justification() {
|
|||||||
storage_changes: None,
|
storage_changes: None,
|
||||||
finalized: false,
|
finalized: false,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::LongestChain),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
}
|
}
|
||||||
@@ -1829,7 +1831,8 @@ fn imports_justification_for_regular_blocks_on_import() {
|
|||||||
storage_changes: None,
|
storage_changes: None,
|
||||||
finalized: false,
|
finalized: false,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::LongestChain),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
};
|
};
|
||||||
|
|||||||
@@ -95,7 +95,8 @@ impl<B: BlockT> Verifier<B> for PassThroughVerifier {
|
|||||||
justification,
|
justification,
|
||||||
post_digests: vec![],
|
post_digests: vec![],
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::LongestChain),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
}, maybe_keys))
|
}, maybe_keys))
|
||||||
|
|||||||
@@ -818,12 +818,19 @@ impl<B, E, Block, RA> Client<B, E, Block, RA> where
|
|||||||
finalized,
|
finalized,
|
||||||
auxiliary,
|
auxiliary,
|
||||||
fork_choice,
|
fork_choice,
|
||||||
|
intermediates,
|
||||||
import_existing,
|
import_existing,
|
||||||
..
|
..
|
||||||
} = import_block;
|
} = import_block;
|
||||||
|
|
||||||
assert!(justification.is_some() && finalized || justification.is_none());
|
assert!(justification.is_some() && finalized || justification.is_none());
|
||||||
|
|
||||||
|
if !intermediates.is_empty() {
|
||||||
|
return Err(Error::IncompletePipeline)
|
||||||
|
}
|
||||||
|
|
||||||
|
let fork_choice = fork_choice.ok_or(Error::IncompletePipeline)?;
|
||||||
|
|
||||||
let import_headers = if post_digests.is_empty() {
|
let import_headers = if post_digests.is_empty() {
|
||||||
PrePostHeader::Same(header)
|
PrePostHeader::Same(header)
|
||||||
} else {
|
} else {
|
||||||
|
|||||||
@@ -126,6 +126,9 @@ pub enum Error {
|
|||||||
/// Invalid calculated state root on block import.
|
/// Invalid calculated state root on block import.
|
||||||
#[display(fmt = "Calculated state root does not match.")]
|
#[display(fmt = "Calculated state root does not match.")]
|
||||||
InvalidStateRoot,
|
InvalidStateRoot,
|
||||||
|
/// Incomplete block import pipeline.
|
||||||
|
#[display(fmt = "Incomplete block import pipeline.")]
|
||||||
|
IncompletePipeline,
|
||||||
/// A convenience variant for String
|
/// A convenience variant for String
|
||||||
#[display(fmt = "{}", _0)]
|
#[display(fmt = "{}", _0)]
|
||||||
Msg(String),
|
Msg(String),
|
||||||
|
|||||||
@@ -142,13 +142,21 @@ pub struct BlockImportParams<Block: BlockT, Transaction> {
|
|||||||
/// Is this block finalized already?
|
/// Is this block finalized already?
|
||||||
/// `true` implies instant finality.
|
/// `true` implies instant finality.
|
||||||
pub finalized: bool,
|
pub finalized: bool,
|
||||||
|
/// Intermediate values that are interpreted by block importers. Each block importer,
|
||||||
|
/// upon handling a value, removes it from the intermediate list. The final block importer
|
||||||
|
/// rejects block import if there are still intermediate values that remain unhandled.
|
||||||
|
pub intermediates: HashMap<Vec<u8>, Vec<u8>>,
|
||||||
/// Auxiliary consensus data produced by the block.
|
/// Auxiliary consensus data produced by the block.
|
||||||
/// Contains a list of key-value pairs. If values are `None`, the keys
|
/// Contains a list of key-value pairs. If values are `None`, the keys
|
||||||
/// will be deleted.
|
/// will be deleted.
|
||||||
pub auxiliary: Vec<(Vec<u8>, Option<Vec<u8>>)>,
|
pub auxiliary: Vec<(Vec<u8>, Option<Vec<u8>>)>,
|
||||||
/// Fork choice strategy of this import. This should only be set by a
|
/// Fork choice strategy of this import. This should only be set by a
|
||||||
/// synchronous import, otherwise it may race against other imports.
|
/// synchronous import, otherwise it may race against other imports.
|
||||||
pub fork_choice: ForkChoiceStrategy,
|
/// `None` indicates that the current verifier or importer cannot yet
|
||||||
|
/// determine the fork choice value, and it expects subsequent importer
|
||||||
|
/// to modify it. If `None` is passed all the way down to bottom block
|
||||||
|
/// importer, the import fails with an `IncompletePipeline` error.
|
||||||
|
pub fork_choice: Option<ForkChoiceStrategy>,
|
||||||
/// Allow importing the block skipping state verification if parent state is missing.
|
/// Allow importing the block skipping state verification if parent state is missing.
|
||||||
pub allow_missing_state: bool,
|
pub allow_missing_state: bool,
|
||||||
/// Re-validate existing block.
|
/// Re-validate existing block.
|
||||||
@@ -210,6 +218,7 @@ impl<Block: BlockT, Transaction> BlockImportParams<Block, Transaction> {
|
|||||||
storage_changes: None,
|
storage_changes: None,
|
||||||
finalized: self.finalized,
|
finalized: self.finalized,
|
||||||
auxiliary: self.auxiliary,
|
auxiliary: self.auxiliary,
|
||||||
|
intermediates: self.intermediates,
|
||||||
allow_missing_state: self.allow_missing_state,
|
allow_missing_state: self.allow_missing_state,
|
||||||
fork_choice: self.fork_choice,
|
fork_choice: self.fork_choice,
|
||||||
import_existing: self.import_existing,
|
import_existing: self.import_existing,
|
||||||
|
|||||||
@@ -96,7 +96,8 @@ impl<Block: BlockT, T, Transaction> ClientBlockImportExt<Block> for std::sync::A
|
|||||||
storage_changes: None,
|
storage_changes: None,
|
||||||
finalized: false,
|
finalized: false,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::LongestChain),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
};
|
};
|
||||||
@@ -115,7 +116,8 @@ impl<Block: BlockT, T, Transaction> ClientBlockImportExt<Block> for std::sync::A
|
|||||||
storage_changes: None,
|
storage_changes: None,
|
||||||
finalized: false,
|
finalized: false,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::Custom(true),
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::Custom(true)),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
};
|
};
|
||||||
@@ -134,7 +136,8 @@ impl<Block: BlockT, T, Transaction> ClientBlockImportExt<Block> for std::sync::A
|
|||||||
storage_changes: None,
|
storage_changes: None,
|
||||||
finalized: true,
|
finalized: true,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::Custom(true),
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::Custom(true)),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
};
|
};
|
||||||
@@ -158,7 +161,8 @@ impl<Block: BlockT, T, Transaction> ClientBlockImportExt<Block> for std::sync::A
|
|||||||
storage_changes: None,
|
storage_changes: None,
|
||||||
finalized: true,
|
finalized: true,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::LongestChain),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
};
|
};
|
||||||
@@ -182,7 +186,8 @@ impl<B, E, RA, Block: BlockT> ClientBlockImportExt<Block> for Client<B, E, Block
|
|||||||
storage_changes: None,
|
storage_changes: None,
|
||||||
finalized: false,
|
finalized: false,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::LongestChain),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
};
|
};
|
||||||
@@ -201,7 +206,8 @@ impl<B, E, RA, Block: BlockT> ClientBlockImportExt<Block> for Client<B, E, Block
|
|||||||
storage_changes: None,
|
storage_changes: None,
|
||||||
finalized: false,
|
finalized: false,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::Custom(true),
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::Custom(true)),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
};
|
};
|
||||||
@@ -220,7 +226,8 @@ impl<B, E, RA, Block: BlockT> ClientBlockImportExt<Block> for Client<B, E, Block
|
|||||||
storage_changes: None,
|
storage_changes: None,
|
||||||
finalized: true,
|
finalized: true,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::Custom(true),
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::Custom(true)),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
};
|
};
|
||||||
@@ -244,7 +251,8 @@ impl<B, E, RA, Block: BlockT> ClientBlockImportExt<Block> for Client<B, E, Block
|
|||||||
storage_changes: None,
|
storage_changes: None,
|
||||||
finalized: true,
|
finalized: true,
|
||||||
auxiliary: Vec::new(),
|
auxiliary: Vec::new(),
|
||||||
fork_choice: ForkChoiceStrategy::LongestChain,
|
intermediates: Default::default(),
|
||||||
|
fork_choice: Some(ForkChoiceStrategy::LongestChain),
|
||||||
allow_missing_state: false,
|
allow_missing_state: false,
|
||||||
import_existing: false,
|
import_existing: false,
|
||||||
};
|
};
|
||||||
|
|||||||
Reference in New Issue
Block a user