You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Nov 11, 2022. It is now read-only.
Let's try to optimize the gossip a bit by sending votes for last round to all peers that we know (like right now),
but let's limit the number of peers that we send votes from rounds [last-5; last-1] to sqrt(peers).
This should reduce excessive gossip, but without being super complicated to implement.
The text was updated successfully, but these errors were encountered:
@ordian it makes totally sense to adapt the GRANDPA gossip limiting / reducing strategies for BEEFY as well. We are planing to do that gradually over time.
Currently, we can not reduce gossip too aggressively because we first have to hook into the block import queue in order to be able to ask for / process missing justifications.
Let's try to optimize the gossip a bit by sending votes for last round to all peers that we know (like right now),
but let's limit the number of peers that we send votes from rounds
[last-5; last-1]
tosqrt(peers)
.This should reduce excessive gossip, but without being super complicated to implement.
The text was updated successfully, but these errors were encountered: