Skip to content
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

Sort subkey lookups by VertexID when computing keys #2918

Merged
merged 1 commit into from
Dec 9, 2024

Conversation

arnetheduck
Copy link
Member

Since data is ordered by VertexID on disk, with this simple trick we can make much better use of the various rocksdb caches.

Computing the state root of the full mainnet state is down to 4 hours (from 9) on my laptop.

Since data is ordered by VertexID on disk, with this simple trick we can
make much better use of the various rocksdb caches.

Computing the state root of the full mainnet state is down to 4 hours
(from 9) on my laptop.
@arnetheduck arnetheduck merged commit a056a72 into master Dec 9, 2024
28 checks passed
@arnetheduck arnetheduck deleted the sort-computekey branch December 9, 2024 07:16
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant