-
Notifications
You must be signed in to change notification settings - Fork 261
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
Ordered trie for trie root computations #6610
Conversation
Gives a 100x speed boost for this operation which happens during optimistic sync when computing the block hash.
d1e701a
to
13d2d8e
Compare
beacon_chain/spec/helpers.nim
Outdated
requests.withdrawals.len + | ||
requests.consolidations.len | ||
|
||
if n == 0: |
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 the EMPTY_ROOT_HASH
optimization be integrated into the OrderedTrieRootBuilder
? Then we don't need EMPTY_ROOT_HASH
in helpers
anymore.
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 the EMPTY_ROOT_HASH optimization be integrated into the OrderedTrieRootBuilder? Then we don't need EMPTY_ROOT_HASH in helpers anymore.
it's already there actually, 429bb2e
Co-authored-by: Etan Kissling <etan@nimbus.team>
Gives a 100x speed boost for this operation which happens during optimistic sync when computing the block hash.