// Copyright (C) Parity Technologies (UK) Ltd. // This file is part of Parity Bridges Common. // Parity Bridges Common 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. // Parity Bridges Common 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 Parity Bridges Common. If not, see . //! Defines traits which represent a common interface for Substrate pallets which want to //! incorporate bridge functionality. #![warn(missing_docs)] #![cfg_attr(not(feature = "std"), no_std)] use crate::justification::{ GrandpaJustification, JustificationVerificationContext, JustificationVerificationError, }; use bp_runtime::{ BasicOperatingMode, Chain, HashOf, HasherOf, HeaderOf, RawStorageProof, StorageProofChecker, StorageProofError, UnderlyingChainProvider, }; use codec::{Codec, Decode, Encode, EncodeLike, MaxEncodedLen}; use core::{clone::Clone, cmp::Eq, default::Default, fmt::Debug}; use frame_support::PalletError; use scale_info::TypeInfo; use serde::{Deserialize, Serialize}; use sp_consensus_grandpa::{AuthorityList, ConsensusLog, SetId, GRANDPA_ENGINE_ID}; use sp_runtime::{traits::Header as HeaderT, Digest, RuntimeDebug}; use sp_std::{boxed::Box, vec::Vec}; pub mod justification; pub mod storage_keys; /// Header chain error. #[derive(Clone, Decode, Encode, Eq, PartialEq, PalletError, Debug, TypeInfo)] pub enum HeaderChainError { /// Header with given hash is missing from the chain. UnknownHeader, /// Storage proof related error. StorageProof(StorageProofError), } /// Header data that we're storing on-chain. /// /// Even though we may store full header, our applications (XCM) only use couple of header /// fields. Extracting those values makes on-chain storage and PoV smaller, which is good. #[derive(Clone, Decode, Encode, Eq, MaxEncodedLen, PartialEq, RuntimeDebug, TypeInfo)] pub struct StoredHeaderData { /// Header number. pub number: Number, /// Header state root. pub state_root: Hash, } /// Stored header data builder. pub trait StoredHeaderDataBuilder { /// Build header data from self. fn build(&self) -> StoredHeaderData; } impl StoredHeaderDataBuilder for H { fn build(&self) -> StoredHeaderData { StoredHeaderData { number: *self.number(), state_root: *self.state_root() } } } /// Substrate header chain, abstracted from the way it is stored. pub trait HeaderChain { /// Returns state (storage) root of given finalized header. fn finalized_header_state_root(header_hash: HashOf) -> Option>; /// Get storage proof checker using finalized header. fn storage_proof_checker( header_hash: HashOf, storage_proof: RawStorageProof, ) -> Result>, HeaderChainError> { let state_root = Self::finalized_header_state_root(header_hash) .ok_or(HeaderChainError::UnknownHeader)?; StorageProofChecker::new(state_root, storage_proof).map_err(HeaderChainError::StorageProof) } } /// A type that can be used as a parameter in a dispatchable function. /// /// When using `decl_module` all arguments for call functions must implement this trait. pub trait Parameter: Codec + EncodeLike + Clone + Eq + Debug + TypeInfo {} impl Parameter for T where T: Codec + EncodeLike + Clone + Eq + Debug + TypeInfo {} /// A GRANDPA Authority List and ID. #[derive(Default, Encode, Eq, Decode, RuntimeDebug, PartialEq, Clone, TypeInfo)] #[cfg_attr(feature = "std", derive(Serialize, Deserialize))] pub struct AuthoritySet { /// List of GRANDPA authorities for the current round. pub authorities: AuthorityList, /// Monotonic identifier of the current GRANDPA authority set. pub set_id: SetId, } impl AuthoritySet { /// Create a new GRANDPA Authority Set. pub fn new(authorities: AuthorityList, set_id: SetId) -> Self { Self { authorities, set_id } } } /// Data required for initializing the GRANDPA bridge pallet. /// /// The bridge needs to know where to start its sync from, and this provides that initial context. #[derive( Default, Encode, Decode, RuntimeDebug, PartialEq, Eq, Clone, TypeInfo, Serialize, Deserialize, )] pub struct InitializationData { /// The header from which we should start syncing. pub header: Box, /// The initial authorities of the pallet. pub authority_list: AuthorityList, /// The ID of the initial authority set. pub set_id: SetId, /// Pallet operating mode. pub operating_mode: BasicOperatingMode, } /// Abstract finality proof that is justifying block finality. pub trait FinalityProof: Clone + Send + Sync + Debug { /// Return hash of header that this proof is generated for. fn target_header_hash(&self) -> Hash; /// Return number of header that this proof is generated for. fn target_header_number(&self) -> Number; } /// A trait that provides helper methods for querying the consensus log. pub trait ConsensusLogReader { /// Returns true if digest contains item that schedules authorities set change. fn schedules_authorities_change(digest: &Digest) -> bool; } /// A struct that provides helper methods for querying the GRANDPA consensus log. pub struct GrandpaConsensusLogReader(sp_std::marker::PhantomData); impl GrandpaConsensusLogReader { /// Find and return scheduled (regular) change digest item. pub fn find_scheduled_change( digest: &Digest, ) -> Option> { // find the first consensus digest with the right ID which converts to // the right kind of consensus log. digest .convert_first(|log| log.consensus_try_to(&GRANDPA_ENGINE_ID)) .and_then(|log| match log { ConsensusLog::ScheduledChange(change) => Some(change), _ => None, }) } /// Find and return forced change digest item. Or light client can't do anything /// with forced changes, so we can't accept header with the forced change digest. pub fn find_forced_change( digest: &Digest, ) -> Option<(Number, sp_consensus_grandpa::ScheduledChange)> { // find the first consensus digest with the right ID which converts to // the right kind of consensus log. digest .convert_first(|log| log.consensus_try_to(&GRANDPA_ENGINE_ID)) .and_then(|log| match log { ConsensusLog::ForcedChange(delay, change) => Some((delay, change)), _ => None, }) } } impl ConsensusLogReader for GrandpaConsensusLogReader { fn schedules_authorities_change(digest: &Digest) -> bool { GrandpaConsensusLogReader::::find_scheduled_change(digest).is_some() } } /// The finality-related info associated to a header. #[derive(Encode, Decode, Debug, PartialEq, Clone, TypeInfo)] pub struct HeaderFinalityInfo { /// The header finality proof. pub finality_proof: FinalityProof, /// The new verification context introduced by the header. pub new_verification_context: Option, } /// Grandpa-related info associated to a header. This info can be saved to events. pub type StoredHeaderGrandpaInfo
= HeaderFinalityInfo, AuthoritySet>; /// Processed Grandpa-related info associated to a header. pub type HeaderGrandpaInfo
= HeaderFinalityInfo, JustificationVerificationContext>; impl TryFrom> for HeaderGrandpaInfo
{ type Error = JustificationVerificationError; fn try_from(grandpa_info: StoredHeaderGrandpaInfo
) -> Result { Ok(Self { finality_proof: grandpa_info.finality_proof, new_verification_context: match grandpa_info.new_verification_context { Some(authority_set) => Some(authority_set.try_into()?), None => None, }, }) } } /// Helper trait for finding equivocations in finality proofs. pub trait FindEquivocations { /// The type returned when encountering an error while looking for equivocations. type Error: Debug; /// Find equivocations. fn find_equivocations( verification_context: &FinalityVerificationContext, synced_proof: &FinalityProof, source_proofs: &[FinalityProof], ) -> Result, Self::Error>; } /// A minimized version of `pallet-bridge-grandpa::Call` that can be used without a runtime. #[derive(Encode, Decode, Debug, PartialEq, Eq, Clone, TypeInfo)] #[allow(non_camel_case_types)] pub enum BridgeGrandpaCall { /// `pallet-bridge-grandpa::Call::submit_finality_proof` #[codec(index = 0)] submit_finality_proof { /// The header that we are going to finalize. finality_target: Box
, /// Finality justification for the `finality_target`. justification: justification::GrandpaJustification
, }, /// `pallet-bridge-grandpa::Call::initialize` #[codec(index = 1)] initialize { /// All data, required to initialize the pallet. init_data: InitializationData
, }, /// `pallet-bridge-grandpa::Call::submit_finality_proof_ex` #[codec(index = 4)] submit_finality_proof_ex { /// The header that we are going to finalize. finality_target: Box
, /// Finality justification for the `finality_target`. justification: justification::GrandpaJustification
, /// An identifier of the validators set, that have signed the justification. current_set_id: SetId, }, } /// The `BridgeGrandpaCall` used by a chain. pub type BridgeGrandpaCallOf = BridgeGrandpaCall>; /// Substrate-based chain that is using direct GRANDPA finality. /// /// Keep in mind that parachains are relying on relay chain GRANDPA, so they should not implement /// this trait. pub trait ChainWithGrandpa: Chain { /// Name of the bridge GRANDPA pallet (used in `construct_runtime` macro call) that is deployed /// at some other chain to bridge with this `ChainWithGrandpa`. /// /// We assume that all chains that are bridging with this `ChainWithGrandpa` are using /// the same name. const WITH_CHAIN_GRANDPA_PALLET_NAME: &'static str; /// Max number of GRANDPA authorities at the chain. /// /// This is a strict constant. If bridged chain will have more authorities than that, /// the GRANDPA bridge pallet may halt. const MAX_AUTHORITIES_COUNT: u32; /// Max reasonable number of headers in `votes_ancestries` vector of the GRANDPA justification. /// /// This isn't a strict limit. The relay may submit justifications with more headers in its /// ancestry and the pallet will accept such justification. The limit is only used to compute /// maximal refund amount and submitting justifications which exceed the limit, may be costly /// to submitter. const REASONABLE_HEADERS_IN_JUSTIFICATON_ANCESTRY: u32; /// Maximal size of the mandatory chain header. Mandatory header is the header that enacts new /// GRANDPA authorities set (so it has large digest inside). /// /// This isn't a strict limit. The relay may submit larger headers and the pallet will accept /// the call. The limit is only used to compute maximal refund amount and doing calls which /// exceed the limit, may be costly to submitter. const MAX_MANDATORY_HEADER_SIZE: u32; /// Average size of the chain header. We don't expect to see there headers that change GRANDPA /// authorities set (GRANDPA will probably be able to finalize at least one additional header /// per session on non test chains), so this is average size of headers that aren't changing the /// set. /// /// This isn't a strict limit. The relay may submit justifications with larger headers and the /// pallet will accept the call. However, if the total size of all `submit_finality_proof` /// arguments exceeds the maximal size, computed using this average size, relayer will only get /// partial refund. /// /// We expect some headers on production chains that are above this size. But they are rare and /// if rellayer cares about its profitability, we expect it'll select other headers for /// submission. const AVERAGE_HEADER_SIZE: u32; } impl ChainWithGrandpa for T where T: Chain + UnderlyingChainProvider, T::Chain: ChainWithGrandpa, { const WITH_CHAIN_GRANDPA_PALLET_NAME: &'static str = ::WITH_CHAIN_GRANDPA_PALLET_NAME; const MAX_AUTHORITIES_COUNT: u32 = ::MAX_AUTHORITIES_COUNT; const REASONABLE_HEADERS_IN_JUSTIFICATON_ANCESTRY: u32 = ::REASONABLE_HEADERS_IN_JUSTIFICATON_ANCESTRY; const MAX_MANDATORY_HEADER_SIZE: u32 = ::MAX_MANDATORY_HEADER_SIZE; const AVERAGE_HEADER_SIZE: u32 = ::AVERAGE_HEADER_SIZE; } /// Returns maximal expected size of `submit_finality_proof` call arguments. pub fn max_expected_submit_finality_proof_arguments_size( is_mandatory_finality_target: bool, precommits: u32, ) -> u32 { let max_expected_justification_size = GrandpaJustification::>::max_reasonable_size::(precommits); // call arguments are header and justification let max_expected_finality_target_size = if is_mandatory_finality_target { C::MAX_MANDATORY_HEADER_SIZE } else { C::AVERAGE_HEADER_SIZE }; max_expected_finality_target_size.saturating_add(max_expected_justification_size) } #[cfg(test)] mod tests { use super::*; use bp_runtime::ChainId; use frame_support::weights::Weight; use sp_runtime::{testing::H256, traits::BlakeTwo256, MultiSignature}; struct TestChain; impl Chain for TestChain { const ID: ChainId = *b"test"; type BlockNumber = u32; type Hash = H256; type Hasher = BlakeTwo256; type Header = sp_runtime::generic::Header; type AccountId = u64; type Balance = u64; type Nonce = u64; type Signature = MultiSignature; fn max_extrinsic_size() -> u32 { 0 } fn max_extrinsic_weight() -> Weight { Weight::zero() } } impl ChainWithGrandpa for TestChain { const WITH_CHAIN_GRANDPA_PALLET_NAME: &'static str = "Test"; const MAX_AUTHORITIES_COUNT: u32 = 128; const REASONABLE_HEADERS_IN_JUSTIFICATON_ANCESTRY: u32 = 2; const MAX_MANDATORY_HEADER_SIZE: u32 = 100_000; const AVERAGE_HEADER_SIZE: u32 = 1_024; } #[test] fn max_expected_submit_finality_proof_arguments_size_respects_mandatory_argument() { assert!( max_expected_submit_finality_proof_arguments_size::(true, 100) > max_expected_submit_finality_proof_arguments_size::(false, 100), ); } }