An implementation of Brahms: Byzantine resilient random membership sampling. It describes a byzantine resilient gossip protocol that creates a well-connected overlay network with each member only needing to knowing at most O(∛n) other peers.
An implementation of Brahms: Byzantine resilient random membership sampling. It describes a byzantine resilient gossip protocol that creates a well-connected overlay network with each member only needing to knowing at most O(∛n) other peers.