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
Make sure and prove that this threshold is correct for 3 round clique oracle
T(σ) = n/2 + t/2 - Fo(σ)
Here, Fo(σ) is a number of equivocations which is observable for any member of the given clique
Fo(σ)
https://scrapbox.io/layerx/Casper_CBC:_Observable_equivocations
The text was updated successfully, but these errors were encountered:
This turns out to be incorrect!
Sorry, something went wrong.
nrryuya
No branches or pull requests
Make sure and prove that this threshold is correct for 3 round clique oracle
T(σ) = n/2 + t/2 - Fo(σ)
Here,
Fo(σ)
is a number of equivocations which is observable for any member of the given cliquehttps://scrapbox.io/layerx/Casper_CBC:_Observable_equivocations
The text was updated successfully, but these errors were encountered: