Parallelize lookup message collection#52
Merged
Conversation
Replace the serial loop that computes per-lookup messages with a rayon parallel iteration over a preallocated flat slice of lookup references. Flattening serially first lets `collect` write straight into the output Vec without tree-reducing worker buffers.
samuelburnham
force-pushed
the
sb/parallel-lookups
branch
from
139e4c4 to
80aba97
Compare
samuelburnham
requested review from
arthurpaulino and
gabriel-barrett
and removed request for
arthurpaulino
arthurpaulino
approved these changes
May 12, 2026
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
Reduces lookup collection time from 8s to 719ms when proving
lake exe bench-blake3 --num-hashes 1000 --input-size=1024with 32 threads in Aiur