It has been identified that votes, block parts and transaction propagation in the mempool use more data than what should be needed to reach a decision (RFC 027)

In this task we determine by which factor this inefficiencies happen on each kind of message (which will let us prioritize optimization of each of them) and what are the sources of the inefficiencies (which will point the direction to the fixes).

Some questions to be answered

• do nodes forget having send messages and send them again?
• do all nodes needlessly send the same messages to the same nodes?
• is the "has votes" message effective?

Tasks:

• Add metrics to track how many times a node receives duplicate votes
• Add metric to track how many times a node receives duplicate block parts
• Add metric to track how many times a node receives duplicate transactions (present in mempool cache)
• Compile the results
• Add logs to identify the sources of duplicate votes
• Add logs to identify the sources of duplicate block parts
• Add logs to identify the sources of duplicate duplicate transactions (present in mempool cache)

DoD:

• We identified which message types suffer more duplication.
• We identified why duplication happens.
• This information serves as input to optimizing the message exchange (Link to bandwidth optimizations task)