reth_blockchain_tree::blockchain_tree

Struct BlockchainTree

Source 
pub struct BlockchainTree<N: NodeTypesWithDB, E> { /* private fields */ }
Expand description

A Tree of chains.

The flowchart represents all the states a block can have inside the tree.

  • Green blocks belong to the canonical chain and are saved inside the database.
  • Pending blocks and sidechains are found in-memory inside BlockchainTree.

Both pending chains and sidechains have the same mechanisms, the only difference is when they get committed to the database.

For pending, it is an append operation, but for sidechains they need to move the current canonical blocks to the tree (by removing them from the database), and commit the sidechain blocks to the database to become the canonical chain (reorg).

include_mmd!("docs/mermaid/tree.mmd“)

§Main functions

Implementations§

Source§

impl<N: NodeTypesWithDB, E> BlockchainTree<N, E>

Source

pub fn subscribe_canon_state(&self) -> CanonStateNotifications

Subscribe to new blocks events.

Note: Only canonical blocks are emitted by the tree.

Source

pub fn canon_state_notification_sender(&self) -> CanonStateNotificationSender

Returns a clone of the sender for the canonical state notifications.

Source§

impl<N, E> BlockchainTree<N, E>
where N: ProviderNodeTypes, E: BlockExecutorProvider,

Source

pub fn new( externals: TreeExternals<N, E>, config: BlockchainTreeConfig, ) -> ProviderResult<Self>

Builds the blockchain tree for the node.

This method configures the blockchain tree, which is a critical component of the node, responsible for managing the blockchain state, including blocks, transactions, and receipts. It integrates with the consensus mechanism and the EVM for executing transactions.

§Parameters
  • externals: External components required by the blockchain tree:
    • provider_factory: A factory for creating various blockchain-related providers, such as for accessing the database or static files.
    • consensus: The consensus configuration, which defines how the node reaches agreement on the blockchain state with other nodes.
    • evm_config: The EVM (Ethereum Virtual Machine) configuration, which affects how smart contracts and transactions are executed. Proper validation of this configuration is crucial for the correct execution of transactions.
  • tree_config: Configuration for the blockchain tree, including any parameters that affect its structure or performance.
Source

pub fn with_sync_metrics_tx(self, metrics_tx: MetricEventsSender) -> Self

Set the sync metric events sender.

A transmitter for sending synchronization metrics. This is used for monitoring the node’s synchronization process with the blockchain network.

Source

pub const fn block_indices(&self) -> &BlockIndices

Expose internal indices of the BlockchainTree.

Source

pub fn sidechain_block_by_hash( &self, block_hash: BlockHash, ) -> Option<&SealedBlock>

Returns the block with matching hash from any side-chain.

Caution: This will not return blocks from the canonical chain.

Source

pub fn block_with_senders_by_hash( &self, block_hash: BlockHash, ) -> Option<&SealedBlockWithSenders>

Returns the block with matching hash from any side-chain.

Caution: This will not return blocks from the canonical chain.

Source

pub fn receipts_by_block_hash( &self, block_hash: BlockHash, ) -> Option<Vec<&Receipt>>

Returns the block’s receipts with matching hash from any side-chain.

Caution: This will not return blocks from the canonical chain.

Source

pub fn pending_block(&self) -> Option<&SealedBlock>

Returns the block that’s considered the Pending block, if it exists.

Source

pub fn post_state_data(&self, block_hash: BlockHash) -> Option<ExecutionData>

Return items needed to execute on the pending state. This includes: * BlockHash of canonical block that chain connects to. Needed for creating database provider for the rest of the state. * BundleState changes that happened at the asked block_hash * BTreeMap<BlockNumber,BlockHash> list of past pending and canonical hashes, That are needed for evm BLOCKHASH opcode. Return none if: * block unknown. * chain_id not present in state. * there are no parent hashes stored.

Source

pub fn get_buffered_block( &self, hash: &BlockHash, ) -> Option<&SealedBlockWithSenders>

Checks the block buffer for the given block.

Source

pub fn lowest_buffered_ancestor( &self, hash: &BlockHash, ) -> Option<&SealedBlockWithSenders>

Gets the lowest ancestor for the given block in the block buffer.

Source

pub fn insert_block_without_senders( &mut self, block: SealedBlock, ) -> Result<InsertPayloadOk, InsertBlockError>

Insert a new block into the tree.

§Note

This recovers transaction signers (unlike BlockchainTree::insert_block).

Source

pub fn buffer_block( &mut self, block: SealedBlockWithSenders, ) -> Result<(), InsertBlockError>

Insert block for future execution.

Returns an error if the block is invalid.

Source

pub fn insert_block( &mut self, block: SealedBlockWithSenders, block_validation_kind: BlockValidationKind, ) -> Result<InsertPayloadOk, InsertBlockError>

Insert a block (with recovered senders) into the tree.

Returns the BlockStatus on success:

  • The block is already part of a sidechain in the tree, or
  • The block is already part of the canonical chain, or
  • The parent is part of a sidechain in the tree, and we can fork at this block, or
  • The parent is part of the canonical chain, and we can fork at this block

Otherwise, an error is returned, indicating that neither the block nor its parent are part of the chain or any sidechains.

This means that if the block becomes canonical, we need to fetch the missing blocks over P2P.

If the BlockValidationKind::SkipStateRootValidation variant is provided the state root is not validated.

§Note

If the senders have not already been recovered, call BlockchainTree::insert_block_without_senders instead.

Source

pub fn remove_old_blocks(&mut self, block: BlockNumber)

Discard all blocks that precede block number from the buffer.

Source

pub fn finalize_block( &mut self, finalized_block: BlockNumber, ) -> ProviderResult<()>

Finalize blocks up until and including finalized_block, and remove them from the tree.

Source

pub fn connect_buffered_blocks_to_canonical_hashes_and_finalize( &mut self, last_finalized_block: BlockNumber, ) -> ProviderResult<()>

Reads the last N canonical hashes from the database and updates the block indices of the tree by attempting to connect the buffered blocks to canonical hashes.

N is the maximum of max_reorg_depth and the number of block hashes needed to satisfy the BLOCKHASH opcode in the EVM.

§Note

This finalizes last_finalized_block prior to reading the canonical hashes (using BlockchainTree::finalize_block).

Source

pub fn update_block_hashes( &mut self, ) -> ProviderResult<BTreeMap<BlockNumber, B256>>

Update all block hashes. iterate over present and new list of canonical hashes and compare them. Remove all mismatches, disconnect them and removes all chains.

Source

pub fn update_block_hashes_and_clear_buffered( &mut self, ) -> ProviderResult<BTreeMap<BlockNumber, BlockHash>>

Update all block hashes. iterate over present and new list of canonical hashes and compare them. Remove all mismatches, disconnect them, removes all chains and clears all buffered blocks before the tip.

Source

pub fn connect_buffered_blocks_to_canonical_hashes( &mut self, ) -> ProviderResult<()>

Reads the last N canonical hashes from the database and updates the block indices of the tree by attempting to connect the buffered blocks to canonical hashes.

N is the maximum of max_reorg_depth and the number of block hashes needed to satisfy the BLOCKHASH opcode in the EVM.

Source

pub fn find_canonical_header( &self, hash: &BlockHash, ) -> Result<Option<SealedHeader>, ProviderError>

Attempts to find the header for the given block hash if it is canonical.

Returns Ok(None) if the block hash is not canonical (block hash does not exist, or is included in a sidechain).

Note: this does not distinguish between a block that is finalized and a block that is not finalized yet, only whether it is part of the canonical chain or not.

Source

pub fn is_block_hash_canonical( &self, hash: &BlockHash, ) -> Result<bool, ProviderError>

Determines whether or not a block is canonical, checking the db if necessary.

Note: this does not distinguish between a block that is finalized and a block that is not finalized yet, only whether it is part of the canonical chain or not.

Source

pub fn make_canonical( &mut self, block_hash: BlockHash, ) -> Result<CanonicalOutcome, CanonicalError>

Make a block and its parent(s) part of the canonical chain and commit them to the database

§Note

This unwinds the database if necessary, i.e. if parts of the canonical chain have been reorged.

§Returns

Returns Ok if the blocks were canonicalized, or if the blocks were already canonical.

Source

pub fn unwind(&mut self, unwind_to: BlockNumber) -> Result<(), CanonicalError>

Unwind tables and put it inside state

Trait Implementations§

Source§

impl<N: Debug + NodeTypesWithDB, E: Debug> Debug for BlockchainTree<N, E>

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<N, E> Freeze for BlockchainTree<N, E>
where E: Freeze, <N as NodeTypesWithDB>::DB: Freeze,

§

impl<N, E> !RefUnwindSafe for BlockchainTree<N, E>

§

impl<N, E> Send for BlockchainTree<N, E>
where E: Send,

§

impl<N, E> Sync for BlockchainTree<N, E>
where E: Sync,

§

impl<N, E> Unpin for BlockchainTree<N, E>
where E: Unpin,

§

impl<N, E> !UnwindSafe for BlockchainTree<N, E>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> Conv for T

§

fn conv<T>(self) -> T
where Self: Into<T>,

Converts self into T using Into<T>. Read more
§

impl<T> FmtForward for T

§

fn fmt_binary(self) -> FmtBinary<Self>
where Self: Binary,

Causes self to use its Binary implementation when Debug-formatted.
§

fn fmt_display(self) -> FmtDisplay<Self>
where Self: Display,

Causes self to use its Display implementation when Debug-formatted.
§

fn fmt_lower_exp(self) -> FmtLowerExp<Self>
where Self: LowerExp,

Causes self to use its LowerExp implementation when Debug-formatted.
§

fn fmt_lower_hex(self) -> FmtLowerHex<Self>
where Self: LowerHex,

Causes self to use its LowerHex implementation when Debug-formatted.
§

fn fmt_octal(self) -> FmtOctal<Self>
where Self: Octal,

Causes self to use its Octal implementation when Debug-formatted.
§

fn fmt_pointer(self) -> FmtPointer<Self>
where Self: Pointer,

Causes self to use its Pointer implementation when Debug-formatted.
§

fn fmt_upper_exp(self) -> FmtUpperExp<Self>
where Self: UpperExp,

Causes self to use its UpperExp implementation when Debug-formatted.
§

fn fmt_upper_hex(self) -> FmtUpperHex<Self>
where Self: UpperHex,

Causes self to use its UpperHex implementation when Debug-formatted.
§

fn fmt_list(self) -> FmtList<Self>
where &'a Self: for<'a> IntoIterator,

Formats each item in a sequence. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

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

fn in_current_span(self) -> Instrumented<Self>

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

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

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

fn in_current_span(self) -> Instrumented<Self>

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

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
§

impl<T> Pipe for T
where T: ?Sized,

§

fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> R
where Self: Sized,

Pipes by value. This is generally the method you want to use. Read more
§

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R
where R: 'a,

Borrows self and passes that borrow into the pipe function. Read more
§

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R
where R: 'a,

Mutably borrows self and passes that borrow into the pipe function. Read more
§

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
where Self: Borrow<B>, B: 'a + ?Sized, R: 'a,

Borrows self, then passes self.borrow() into the pipe function. Read more
§

fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
where Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.borrow_mut() into the pipe function. Read more
§

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
where Self: AsRef<U>, U: 'a + ?Sized, R: 'a,

Borrows self, then passes self.as_ref() into the pipe function.
§

fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
where Self: AsMut<U>, U: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.as_mut() into the pipe function.
§

fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
where Self: Deref<Target = T>, T: 'a + ?Sized, R: 'a,

Borrows self, then passes self.deref() into the pipe function.
§

fn pipe_deref_mut<'a, T, R>( &'a mut self, func: impl FnOnce(&'a mut T) -> R, ) -> R
where Self: DerefMut<Target = T> + Deref, T: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.deref_mut() into the pipe function.
§

impl<T> Pointable for T

§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<T> Tap for T

§

fn tap(self, func: impl FnOnce(&Self)) -> Self

Immutable access to a value. Read more
§

fn tap_mut(self, func: impl FnOnce(&mut Self)) -> Self

Mutable access to a value. Read more
§

fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Immutable access to the Borrow<B> of a value. Read more
§

fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Mutable access to the BorrowMut<B> of a value. Read more
§

fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Immutable access to the AsRef<R> view of a value. Read more
§

fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Mutable access to the AsMut<R> view of a value. Read more
§

fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Immutable access to the Deref::Target of a value. Read more
§

fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Mutable access to the Deref::Target of a value. Read more
§

fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self

Calls .tap() only in debug builds, and is erased in release builds.
§

fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self

Calls .tap_mut() only in debug builds, and is erased in release builds.
§

fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Calls .tap_borrow() only in debug builds, and is erased in release builds.
§

fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Calls .tap_borrow_mut() only in debug builds, and is erased in release builds.
§

fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Calls .tap_ref() only in debug builds, and is erased in release builds.
§

fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Calls .tap_ref_mut() only in debug builds, and is erased in release builds.
§

fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Calls .tap_deref() only in debug builds, and is erased in release builds.
§

fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Calls .tap_deref_mut() only in debug builds, and is erased in release builds.
§

impl<T> TryConv for T

§

fn try_conv<T>(self) -> Result<T, Self::Error>
where Self: TryInto<T>,

Attempts to convert self into T using TryInto<T>. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more
Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
§

impl<T> ErasedDestructor for T
where T: 'static,

§

impl<T> MaybeDebug for T
where T: Debug,

§

impl<T> MaybeSendSync for T

Layout§

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.