Optimise block_root computation in gossip verification #5003
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Issue Addressed
N/A
Proposed Changes
Before doing gossip verification, we get the header corresponding to a block to pass to a slasher.
The
SignedBeaconBlock
and its correspondingSignedBeaconBlockHeader
have the same canonical root for the message, however, computing the root for the header is way faster since the root for the tree rooted atBeaconBlockBody
is already calculated in the header.In this PR, we reuse the header to compute the
block_root
instead of using the full block.The root computation in mainnet seems to take 10ms on average looking at the
beacon_block_processing_block_root_seconds
metric.Using the header to compute the root should take micro seconds so this seems like a low hanging fruit optimisation.