This repository has been archived by the owner on Oct 31, 2023. It is now read-only.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Very basic simulation to test how much advantage an adversary can win by getting a "headstart" from the honest chain. So when the adversary is elected leader at the same time as the honest players, they will start the attack by referencing the honest blocks and their own but mining privately.
The binomial vector corresponds to the leader election. We toss a coin for each player controlled by the adversary or the honest participants to see how many players each chain gets.