In this task we investigate how to optimize the propagation of votes in Tendermint, using as input the results of #9922.

Votes are propagated for the current Height, for the current and previous rounds.
Once a vote has been received by a node, it informs its neighbors that such vote is no longer required.
Once a node is known to have a vote, it need not receive it again.

Tasks

• Investigate a pull-push approach to votes propagation (on each round, first ask what is needed)
• approaches by other projects

DoD:

• We identified alternatives to how to propagate votes that may be applied to Tendermint and have an initial comparison of pros and cons of each alternative. This data serves as input to an ADR to address the problem.

References:

• Under the Hood of the Ethereum Gossip Protocol