triedb/pathdb: introduce lookup structure to optimize state access #30971
+3,918
−256
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
With this PR (on top of #30661), the block execution performance matches the current master branch. The state access (storage, account) is slightly faster. The triedb commit is about 2ms slower due to the lookup overhead. Bench07: PR 
Without this PR, #30661 vs master, the state access is significantly slower 
|
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
This pull request introduces a mechanism to enhance state lookup efficiency in the pathdb by maintaining a lookup structure that bypasses unnecessary diff layer iterations.
Performance data is provided below.