-
Notifications
You must be signed in to change notification settings - Fork 1.2k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
perf(tree): re-use intermediate nodes #9836
Conversation
6564040
to
29a4823
Compare
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
lgtm
let mut trie_updates = TrieUpdates::default(); | ||
for block in &in_memory { | ||
hashed_post_state.extend(block.hashed_state.as_ref().clone()); | ||
trie_updates.extend(block.trie.as_ref().clone()); | ||
} |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
can avoid the clones here?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
we can use Arc
around the trie update and hashed post state in the ExecutedBlock
type
973a602
to
318c938
Compare
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
only have questions re todos
43ee877
to
ea67709
Compare
Description
Computation of overlay root with cached intermediate nodes. Will likely be broken down into smaller PRs.