Dynamic committee #347
Closed
Dynamic committee #347
Conversation
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
The max. number of vertices per round depends on the committee size and with potentially multiple committees the check needs to take the relevant one into consideration. Now the consensus module contains the debug assertions.
For the time being we assume the exact round number is already known and focus on the actual handling of a committee change: - For Sailfish consensus the node information needs to be updated because it depends on the committee size and keys. - RBC just needs to add the committee to the committee sequence. It will be selected by producers of messages. TODO: network changes, decryption phase changes and block building.
|
Superseded by #360. |
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.
Lays the groundwork for having a sequence of$$[i, j)$$ each mapped to one $$i, j : I$$ and $$I$$ is any type that is an instance of $$[k, \infty)$$ , will move the current committee to the end of the previously active committees and makes $$k$$ it's exclusive upper bound.
Committees, mostly in in themultisigcrate. The typeCommitteeSeq<I>represents such a sequence, consisting of non-overlapping intervalsCommittee, whereIndexed. Adding a new committee fromThe class of types that implement
Indexedhave a way to provide an index value which is used to select the committee that covers it. The canonical example for an index type would beRoundNumberand types such asVertexcan implementIndexedby returning their current round.Work in progress ...