[WIP] Optimal Maximum Coverage using CBC MIP Solver #4542
Closed
Conversation
This file contains 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
|
|
…dundant attestations
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Issue Addressed
This PR addresses an extension to #4507 , introducing a MIP-based approach to calculate the Maximum Coverage over aggregated attestations optimally.
Proposed Changes
Allow conditionally using the Decomposition Approach for selecting the aggregated attestations to be included in a block.
Additional Info
Based on our discussions with @ michaelsproul and @paulhauner , given that this approach is very expensive computationally, this should be opt-in and not enabled by default unless a highly optimised implementation is discovered.