// Copyright 2017-2019 Parity Technologies (UK) Ltd. // This file is part of Substrate. // Substrate is free software: you can redistribute it and/or modify // it under the terms of the GNU General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // Substrate is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // You should have received a copy of the GNU General Public License // along with Substrate. If not, see . //! Proof of work consensus for Substrate. //! //! To use this engine, you can need to have a struct that implements //! `PowAlgorithm`. After that, pass an instance of the struct, along //! with other necessary client references to `import_queue` to setup //! the queue. Use the `start_mine` function for basic CPU mining. //! //! The auxiliary storage for PoW engine only stores the total difficulty. //! For other storage requirements for particular PoW algorithm (such as //! the actual difficulty for each particular blocks), you can take a client //! reference in your `PowAlgorithm` implementation, and use a separate prefix //! for the auxiliary storage. It is also possible to just use the runtime //! as the storage, but it is not recommended as it won't work well with light //! clients. use std::sync::Arc; use std::thread; use std::collections::HashMap; use client::{ BlockOf, blockchain::{HeaderBackend, ProvideCache}, block_builder::api::BlockBuilder as BlockBuilderApi, backend::AuxStore, }; use sr_primitives::Justification; use sr_primitives::generic::{BlockId, Digest, DigestItem}; use sr_primitives::traits::{Block as BlockT, Header as HeaderT, ProvideRuntimeApi}; use srml_timestamp::{TimestampInherentData, InherentError as TIError}; use pow_primitives::{Difficulty, Seal, POW_ENGINE_ID}; use primitives::H256; use inherents::{InherentDataProviders, InherentData}; use consensus_common::{ BlockImportParams, BlockOrigin, ForkChoiceStrategy, well_known_cache_keys::Id as CacheKeyId, Environment, Proposer, }; use consensus_common::import_queue::{BoxBlockImport, BasicQueue, Verifier}; use codec::{Encode, Decode}; use log::*; /// Auxiliary storage prefix for PoW engine. pub const POW_AUX_PREFIX: [u8; 4] = *b"PoW:"; /// Get the auxiliary storage key used by engine to store total difficulty. fn aux_key(hash: &H256) -> Vec { POW_AUX_PREFIX.iter().chain(&hash[..]) .cloned().collect::>() } /// Auxiliary storage data for PoW. #[derive(Encode, Decode, Clone, Debug, Default)] pub struct PowAux { /// Total difficulty. pub total_difficulty: Difficulty, } impl PowAux { /// Read the auxiliary from client. pub fn read(client: &C, hash: &H256) -> Result { let key = aux_key(hash); match client.get_aux(&key).map_err(|e| format!("{:?}", e))? { Some(bytes) => PowAux::decode(&mut &bytes[..]).map_err(|e| format!("{:?}", e)), None => Ok(PowAux::default()), } } } /// Algorithm used for proof of work. pub trait PowAlgorithm { /// Get the next block's difficulty. fn difficulty(&self, parent: &BlockId) -> Result; /// Verify proof of work against the given difficulty. fn verify( &self, parent: &BlockId, pre_hash: &H256, seal: &Seal, difficulty: Difficulty, ) -> Result; /// Mine a seal that satisfy the given difficulty. fn mine( &self, parent: &BlockId, pre_hash: &H256, seed: &H256, difficulty: Difficulty, round: u32, ) -> Result, String>; } /// A verifier for PoW blocks. pub struct PowVerifier { client: Arc, algorithm: Algorithm, inherent_data_providers: inherents::InherentDataProviders, } impl PowVerifier { fn check_header>( &self, mut header: B::Header, parent_block_id: BlockId, ) -> Result<(B::Header, Difficulty, DigestItem), String> where Algorithm: PowAlgorithm, { 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(format!("Header uses the wrong engine {:?}", id)) } }, _ => return Err(format!("Header {:?} is unsealed", 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("PoW validation error: invalid seal".into()); } Ok((header, difficulty, seal)) } fn check_inherents>( &self, block: B, block_id: BlockId, inherent_data: InherentData, timestamp_now: u64, ) -> Result<(), String> where C: ProvideRuntimeApi, C::Api: BlockBuilderApi { const MAX_TIMESTAMP_DRIFT_SECS: u64 = 60; let inherent_res = self.client.runtime_api().check_inherents( &block_id, block, inherent_data, ).map_err(|e| format!("{:?}", e))?; if !inherent_res.ok() { inherent_res .into_errors() .try_for_each(|(i, e)| match TIError::try_from(&i, &e) { Some(TIError::ValidAtTimestamp(timestamp)) => { if timestamp > timestamp_now + MAX_TIMESTAMP_DRIFT_SECS { return Err("Rejecting block too far in future".into()); } Ok(()) }, Some(TIError::Other(e)) => Err(e.into()), None => Err(self.inherent_data_providers.error_to_string(&i, &e)), }) } else { Ok(()) } } } impl, C, Algorithm> Verifier for PowVerifier where C: ProvideRuntimeApi + Send + Sync + HeaderBackend + AuxStore + ProvideCache + BlockOf, C::Api: BlockBuilderApi, Algorithm: PowAlgorithm + Send + Sync, { fn verify( &mut self, origin: BlockOrigin, header: B::Header, justification: Option, mut body: Option>, ) -> Result<(BlockImportParams, Option)>>), String> { let inherent_data = self.inherent_data_providers .create_inherent_data().map_err(String::from)?; let timestamp_now = inherent_data.timestamp_inherent_data().map_err(String::from)?; let best_hash = self.client.info().best_hash; let hash = header.hash(); let parent_hash = *header.parent_hash(); let best_aux = PowAux::read(self.client.as_ref(), &best_hash)?; let mut aux = PowAux::read(self.client.as_ref(), &parent_hash)?; let (checked_header, difficulty, seal) = self.check_header::( header, BlockId::Hash(parent_hash), )?; aux.total_difficulty = aux.total_difficulty.saturating_add(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 )?; let (_, inner_body) = block.deconstruct(); body = Some(inner_body); } let key = aux_key(&hash); let import_block = BlockImportParams { origin, header: checked_header, post_digests: vec![seal], body, finalized: false, justification, auxiliary: vec![(key, Some(aux.encode()))], fork_choice: ForkChoiceStrategy::Custom(aux.total_difficulty > best_aux.total_difficulty), }; Ok((import_block, None)) } } /// Register the PoW inherent data provider, if not registered already. fn register_pow_inherent_data_provider( inherent_data_providers: &InherentDataProviders, ) -> Result<(), consensus_common::Error> { if !inherent_data_providers.has_provider(&srml_timestamp::INHERENT_IDENTIFIER) { inherent_data_providers .register_provider(srml_timestamp::InherentDataProvider) .map_err(Into::into) .map_err(consensus_common::Error::InherentData) } else { Ok(()) } } /// The PoW import queue type. pub type PowImportQueue = BasicQueue; /// Import queue for PoW engine. pub fn import_queue( block_import: BoxBlockImport, client: Arc, algorithm: Algorithm, inherent_data_providers: InherentDataProviders, ) -> Result, consensus_common::Error> where B: BlockT, C: ProvideRuntimeApi + HeaderBackend + BlockOf + ProvideCache + AuxStore, C: Send + Sync + AuxStore + 'static, C::Api: BlockBuilderApi, Algorithm: PowAlgorithm + Send + Sync + 'static, { register_pow_inherent_data_provider(&inherent_data_providers)?; let verifier = PowVerifier { client: client.clone(), algorithm, inherent_data_providers, }; Ok(BasicQueue::new( verifier, block_import, None, None )) } /// Start the background mining thread for PoW. Note that because PoW mining /// is CPU-intensive, it is not possible to use an async future to define this. /// However, it's not recommended to use background threads in the rest of the /// codebase. /// /// `preruntime` is a parameter that allows a custom additional pre-runtime /// digest to be inserted for blocks being built. This can encode authorship /// information, or just be a graffiti. `round` is for number of rounds the /// CPU miner runs each time. This parameter should be tweaked so that each /// mining round is within sub-second time. pub fn start_mine, C, Algorithm, E>( mut block_import: BoxBlockImport, client: Arc, algorithm: Algorithm, mut env: E, preruntime: Option>, round: u32, inherent_data_providers: inherents::InherentDataProviders, ) where C: HeaderBackend + AuxStore + 'static, Algorithm: PowAlgorithm + Send + Sync + 'static, E: Environment + Send + Sync + 'static, E::Error: std::fmt::Debug, { if let Err(_) = register_pow_inherent_data_provider(&inherent_data_providers) { warn!("Registering inherent data provider for timestamp failed"); } thread::spawn(move || { loop { match mine_loop( &mut block_import, client.as_ref(), &algorithm, &mut env, preruntime.as_ref(), round, &inherent_data_providers ) { Ok(()) => (), Err(e) => error!( "Mining block failed with {:?}. Sleep for 1 second before restarting...", e ), } std::thread::sleep(std::time::Duration::new(1, 0)); } }); } fn mine_loop, C, Algorithm, E>( block_import: &mut BoxBlockImport, client: &C, algorithm: &Algorithm, env: &mut E, preruntime: Option<&Vec>, round: u32, inherent_data_providers: &inherents::InherentDataProviders, ) -> Result<(), String> where C: HeaderBackend + AuxStore, Algorithm: PowAlgorithm, E: Environment, E::Error: std::fmt::Debug, { 'outer: loop { let best_hash = client.info().best_hash; let best_header = client.header(BlockId::Hash(best_hash)) .map_err(|e| format!("Fetching best header failed: {:?}", e))? .ok_or("Best header does not exist")?; let mut aux = PowAux::read(client, &best_hash)?; let mut proposer = env.init(&best_header).map_err(|e| format!("{:?}", e))?; let inherent_data = inherent_data_providers .create_inherent_data().map_err(String::from)?; let mut inherent_digest = Digest::default(); if let Some(preruntime) = &preruntime { inherent_digest.push(DigestItem::PreRuntime(POW_ENGINE_ID, preruntime.to_vec())); } let block = futures::executor::block_on(proposer.propose( inherent_data, inherent_digest, std::time::Duration::new(0, 0) )).map_err(|e| format!("Block proposing error: {:?}", e))?; let (header, body) = block.deconstruct(); let seed = H256::random(); let (difficulty, seal) = { loop { let difficulty = algorithm.difficulty( &BlockId::Hash(best_hash), )?; let seal = algorithm.mine( &BlockId::Hash(best_hash), &header.hash(), &seed, difficulty, round, )?; if let Some(seal) = seal { break (difficulty, seal) } if best_hash != client.info().best_hash { continue 'outer } } }; aux.total_difficulty = aux.total_difficulty.saturating_add(difficulty); let hash = header.hash(); let key = aux_key(&hash); let import_block = BlockImportParams { origin: BlockOrigin::Own, header, justification: None, post_digests: vec![DigestItem::Seal(POW_ENGINE_ID, seal)], body: Some(body), finalized: false, auxiliary: vec![(key, Some(aux.encode()))], fork_choice: ForkChoiceStrategy::Custom(true), }; block_import.import_block(import_block, HashMap::default()) .map_err(|e| format!("Error with block built on {:?}: {:?}", best_hash, e))?; } }