Skip to content

Conversation

@Lorsmirq0cB
Copy link
Contributor

Spawns storage root calculation tasks in parallel instead of serially, reduces task initialization overhead.

});

// Insert all receivers into the storage_roots map
for (hashed_address, rx) in receivers {
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Is this intermediate receives Vec necessary? Could we instead insert directly into storage_roots in the for-loop above?

@Lorsmirq0cB Lorsmirq0cB force-pushed the parallel-spawn branch 2 times, most recently from 08ec6c3 to 3220ad1 Compare December 24, 2025 01:28
@Lorsmirq0cB
Copy link
Contributor Author

@mediocregopher , Good point! Much cleaner this way. Updated, please let me know if you see any other improvements needed. Thanks for the feedback!

@github-project-automation github-project-automation bot moved this from Backlog to In Progress in Reth Tracker Dec 24, 2025
@mediocregopher
Copy link
Collaborator

cc @yongkangc

@gakonst
Copy link
Member

gakonst commented Dec 24, 2025

Does this improve sparse trie / work we are optimizing rn Brian? Or is it mostly for fallback code?

@mediocregopher
Copy link
Collaborator

Does this improve sparse trie / work we are optimizing rn Brian? Or is it mostly for fallback code?

@gakonst this is in the legacy state root code path, won't affect the sparse trie

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

Status: In Progress

Development

Successfully merging this pull request may close these issues.

3 participants