logos-blockchain/logos-blockchain-specs
1
0
Fork 0
mirror of https://github.com/logos-blockchain/logos-blockchain-specs.git synced 2026-01-09 08:33:09 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge branch 'master' into committee-sizes-AM

Browse Source
This commit is contained in:
Alexander Mozeika 2023-06-27 18:28:29 +01:00 committed by GitHub
commit 380af083ea
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
carnot/committee_sizes.py
View File

@ -8,7 +8,6 @@ Initially, all number_of_nodes are in one committee, and in subsequent iteration
A more detailed description of the algorithm, and of its mathematical aspects, is provided in the "Carnot paper" available at https://www.notion.so/Nomos-Specification-419bfb7a939648e9b3894a90d188c3be?pvs=4
"""
import math
from scipy.stats import binom
@ -24,10 +23,12 @@ def compute_optimal_number_of_committees_and_committee_size(
network_adversary_threshold: float
):
assert failure_threshold > 0
# number_of_nodes is the number of nodes in the network
# failure_threshold is the prob. of failure which can be tolerated
# adversaries_threshold_per_committee is the fraction of Byzantine modes in a committee
# network_adversary_threshold is the fraction of Byzantine nodes in the network
number_of_committees = 1
committee_size = number_of_nodes
remainder = 0
@ -60,6 +61,8 @@ def compute_optimal_number_of_committees_and_committee_size(
)
else:
current_probability = 1 - committee_size_probability ** number_of_committees
# return the number_of_committees, committee_size, remainder and current_probability
# computed at the previous iteration.
return previous_number_of_committees, previous_committee_size, previous_remainder, previous_probability