-
Notifications
You must be signed in to change notification settings - Fork 239
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
Bloom filter acceleration for deposit processing #5982
Conversation
CI linting has issues with this. Leaving for now not to distract from core PR, since it's not yet mergeable anyway. |
7aad3f2
to
6d03be7
Compare
9937d6d
to
791f154
Compare
Checking across the 30 testing fleet Holesky hosts, comparing
When there are deposits,
to
By comparison, without deposits, timtings for
for
for |
Inspired by #5212
This takes ~10ms on my laptop to construct such a Bloom filter from 1.5M random pubkeys, and the crossover point for where it's as fast to build-then-check then just linearly check each time is about 3 deposits/block.
Since blocks are typically 0 or 16 (with one edge case at the end of each burst), this is reasonable.