2pc protocol with par cmd #1014
Merged
+154
−390
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
shazqadeer
force-pushed
the
2pc-parallel
branch
from
9a0d78f to
9976ddb
Compare
Contributor
|
As we have learned, the proof is sound only because the the voting action does not fail. This is currently not checked by Civl so we have to manually check it with our eyes. |
shazqadeer
approved these changes
Apr 11, 2025
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.
This PR accomplishes a proof of the 2pc protocol using a proof rule for the parallel cmd for summarizing unbounded number of right mover voting actions. The resulting proof is more succinct that previous attempts based on pending asyncs. This proof also has the desirable property that it works for arbitrary number of instance of 2pc potentially running concurrently.
After this PR lands, this is the only proof of 2PC in the repository.