feat(FLP): show that asynchronous distributed consensus is possible when there is no fault#619
Open
ctchou wants to merge 9 commits into
Open
feat(FLP): show that asynchronous distributed consensus is possible when there is no fault#619ctchou wants to merge 9 commits into
ctchou wants to merge 9 commits into
Conversation
Contributor
|
I recommend editing the title to "asynchronous distributed systems". In synchronous and partially synchronous systems, consensus is achievable with for a fraction of nodes being Byzantinely faulty nodes. |
ctchou
changed the title
Collaborator
Author
|
Good point. I have updated the doc-strings, commit message, and this PR's title accordingly. |
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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 presents an asynchronous distributed consensus algorithm and proves that it achieves consensus when there is no fault. This result is not needed for proving the FLP impossibility result, but is included to show that the notion of an algorithm defined in
Algorithm.leanis not vacuous, in the sense that it does allow a working asynchronous consensus algorithm when there is no fault.Zulip discussion:
https://leanprover.zulipchat.com/#narrow/channel/513188-CSLib/topic/Impossibility.20of.20distributed.20consensus/with/592462001