You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Adds the ability to compute the state root with state diffs overlayed on top of the persistent db. This allows for rapid, stateless incremental root calculation via a RO transaction.
Performs iterative depth first search traversal using a stack. Adds all known leaves and branch hashes in lexicographic order to a HashBuilder, which also collects the set of known branch updates along the way. These known branch updates/hashes can then be used in a future incremental state root calculation, in order to avoid recomputing all leaf-level hashes.
Adds an OverlayState struct which supports minimal-overhead subslicing and cloning by holding the underlying data within an Arc. This defines not only a set of Account and Storage value updates (Some for upsert, None for deletion), but also may include known intermediate Hashes with shorter paths (not a multiple of 64 nibbles). When a Hash is encountered in the overlay root calculation traversal, this is assumed to be authoritative, bypassing traversal of all children.
Accounts in the overlay do not override the state root of the matching persisted account, if one exists.
Review Error for and-cb @ 2025-08-20 20:07:10 UTC
User failed mfa authentication, either user does not exist or public email is not set on your github profile. \ see go/mfa-help
Review Error for and-cb @ 2025-08-21 01:27:48 UTC
User failed mfa authentication, either user does not exist or public email is not set on your github profile. \ see go/mfa-help
Review Error for and-cb @ 2025-08-21 16:34:06 UTC
User failed mfa authentication, either user does not exist or public email is not set on your github profile. \ see go/mfa-help
Review Error for and-cb @ 2025-08-21 16:37:40 UTC
User failed mfa authentication, either user does not exist or public email is not set on your github profile. \ see go/mfa-help
Only thought I had: it seems like the code mixes panic'ing and returning result, especially when dealing with potentially corrupted pages. Maybe we make a ticket to standardize this in the future for more clarity
This file contains hidden or 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
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.
Adds the ability to compute the state root with state diffs overlayed on top of the persistent db. This allows for rapid, stateless incremental root calculation via a RO transaction.
Performs iterative depth first search traversal using a stack. Adds all known leaves and branch hashes in lexicographic order to a
HashBuilder, which also collects the set of known branch updates along the way. These known branch updates/hashes can then be used in a future incremental state root calculation, in order to avoid recomputing all leaf-level hashes.Adds an
OverlayStatestruct which supports minimal-overhead subslicing and cloning by holding the underlying data within anArc. This defines not only a set of Account and Storage value updates (Some for upsert, None for deletion), but also may include known intermediate Hashes with shorter paths (not a multiple of 64 nibbles). When a Hash is encountered in the overlay root calculation traversal, this is assumed to be authoritative, bypassing traversal of all children.Accounts in the overlay do not override the state root of the matching persisted account, if one exists.