-
Notifications
You must be signed in to change notification settings - Fork 736
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
Maximum clique enumeration for attestation aggregation in op pool #3733
Comments
I plan to participate in the 4th cohort of the Ethereum Protocol Fellowship and am highly interested in picking this up as my project for the cohort. |
I think @GeemoCandama was also interested in working on this, would you two be open to working together? |
Yes, I am interested in working on this. |
Excited to work on this together @GeemoCandama ! |
I'm also participating in the cohort and was thinking about working on this @ankurdubey521 @GeemoCandama are you guys down to collaborate? |
@PatStiles I don't think more people working on this would be beneficial. I think we would have a too many cooks in the kitchen type situation. If you have a different idea feel free to message me on Discord though: @geemo_candama. |
No worries, @michaelsproul I Dm'd you regarding other projects. |
Hey @PatStiles I'm on leave for the next 2 weeks, please reach out to @paulhauner |
Description
Presently Lighthouse uses an opportunistic strategy for aggregating attestations added to the op pool. Any new attestation which can be aggregated with an existing one will be aggregated here:
lighthouse/beacon_node/operation_pool/src/attestation_storage.rs
Lines 163 to 174 in 6d5a2b5
In our collaboration with Satalia they prototyped a maximum clique enumeration algorithm for doing optimal aggregation. This issue is about adopting that optimal aggregation algorithm, while keeping our greedy algorithm for max coverage.
If you're interested in working on this issue DM me and I can provide a copy of the code written by Satalia. They wrote a pure Rust implementation of the Bron-Kerbosch algorithm which showed good performance during testing.
We would need to overhaul how we handle unaggregated attestations in the
naive_aggregation_pool
so that we keep single attestations unaggregated. This might be somewhat delicate.Version
Lighthouse v3.2.1
The text was updated successfully, but these errors were encountered: