My implementation of Tailstorm does not align with what is described in the paper draft. This PR closes this gap.
[x] Honest nodes should disambiguate between strong blocks based on the heaviest chain rule. Currently it's doing longest chain. Change required to embed A_k in Tailstorm.
[x] When proposing a new strong block, honest nodes should disambiguate between sub blocks such that their own reward is maximized. Anything else would be irrational. The optimization should be implemented using a brute-force approach.
[x] Point two implies that the behaviour of the node depends on the reward function in use. This is new and requires some changes to the experiments.
My implementation of Tailstorm does not align with what is described in the paper draft. This PR closes this gap.
[x] Honest nodes should disambiguate between strong blocks based on the heaviest chain rule. Currently it's doing longest chain. Change required to embed
A_kin Tailstorm.[x] When proposing a new strong block, honest nodes should disambiguate between sub blocks such that their own reward is maximized. Anything else would be irrational. The optimization should be implemented using a brute-force approach.
[x] Point two implies that the behaviour of the node depends on the reward function in use. This is new and requires some changes to the experiments.