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
目前CITA使用的共识算法是基于PBFT的,消息复杂度为O(n^2),其中n为共识节点的个数。 因此共识节点数量增加的时候,性能呈平方下降。 即8个共识节点的时候,性能只有4个共识节点的1/4。
改进共识算法,将消息复杂度降为O(n)。 以支持共识节点数量比较多的场景。
The text was updated successfully, but these errors were encountered:
目前在考察overlord 和 hotstuff。
Sorry, something went wrong.
No branches or pull requests
目前CITA使用的共识算法是基于PBFT的,消息复杂度为O(n^2),其中n为共识节点的个数。
因此共识节点数量增加的时候,性能呈平方下降。
即8个共识节点的时候,性能只有4个共识节点的1/4。
改进共识算法,将消息复杂度降为O(n)。
以支持共识节点数量比较多的场景。
The text was updated successfully, but these errors were encountered: