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.

Sign up for GitHub

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

Jump to bottom

Investigate "Byzantine Agreement, Made Trivial" #4

Closed

amiller opened this issue May 31, 2018 · 2 comments

Contributor

amiller commented May 31, 2018

Silvio Micali seems to have dug into the Binary Agreement routine and found a way to make it work using any unique signature scheme, not necessarily a threshold scheme. But I don't fully understand it yet.
https://www.semanticscholar.org/paper/Byzantine-Agreement%2C-Made-Trivial-Micali/732313849ee46dd92647e19c4ef9473eb0f08e0e

Contributor Author

amiller commented May 31, 2018 •

edited

Loading

Some observations:

This protocol is for a synchronous rather than asynchronous network. This is critical to the argument that nodes will with high probability be in an agreement about the value of the coin.

Contributor Author

amiller commented Jun 1, 2018

Closing this although recorded some notes in amiller/HoneyBadgerBFT#63

amiller closed this as completed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment