mirror of https://github.com/poanetwork/quorum.git
5b283663b4
Assuming the following scenario where a miner has 15% of all hashing power and the ability to exert a moderate control over the network to the point where if the attacker sees a message A, it can't stop A from propagating, but what it **can** do is send a message B and ensure that most nodes see B before A. The attacker can then selfish mine and augment selfish mining strategy by giving his own blocks an advantage. This change makes the time at which a block is received less relevant and so the level of control an attacker has over the network no longer makes a difference. This change changes the current td algorithm `B_td > C_td` to the new algorithm `B_td > C_td || B_td == C_td && rnd < 0.5`. |
||
|---|---|---|
| .. | ||
| files | ||
| block_test.go | ||
| block_test_util.go | ||
| init.go | ||
| rlp_test.go | ||
| rlp_test_util.go | ||
| state_test.go | ||
| state_test_util.go | ||
| transaction_test.go | ||
| transaction_test_util.go | ||
| util.go | ||
| vm_test.go | ||
| vm_test_util.go | ||