Our implementation of the underlying set reconciliation primitive is probably of more general interest to HN. I submitted it previously ( https://news.ycombinat

Our implementation of the underlying set reconciliation primitive is probably of more general interest to HN. I submitted it previously ( https://news.ycombinator.com/item?id=18645790 https://news.ycombinator.com/item?id=18645790 ) but it got no love. Erlay itself is not terribly interesting except in the context of the specific robusness requirements such as exist in Bitcoin. When robustness against malicious parties isn't a major concern O(N) gossip can also be achieved by more obvious protocols such as computing a spanning tree between nodes and forwarding along it. Erlay is interesting because it achieves the low bandwidth usage while preserving the robustness of "send everything to everyone you're connected to".