We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
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
This paper appears to offer an improvement on validated broadcast. Whereas honeybadgerBFT requires O(log N) expected rounds, due to N instances of binary ABA each of which is geometric distribution of rounds, it should be possible to refactor our ACS protocol so that it uses theirs and works https://www.researchgate.net/publication/328758146_Validated_Asynchronous_Byzantine_Agreement_with_Optimal_Resilience_and_Asymptotically_Optimal_Time_and_Word_Communication
O(log N)
N
The text was updated successfully, but these errors were encountered:
No branches or pull requests
This paper appears to offer an improvement on validated broadcast. Whereas honeybadgerBFT requires
O(log N)
expected rounds, due toN
instances of binary ABA each of which is geometric distribution of rounds, it should be possible to refactor our ACS protocol so that it uses theirs and workshttps://www.researchgate.net/publication/328758146_Validated_Asynchronous_Byzantine_Agreement_with_Optimal_Resilience_and_Asymptotically_Optimal_Time_and_Word_Communication
The text was updated successfully, but these errors were encountered: