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.
-
Notifications
You must be signed in to change notification settings - Fork 0
Byzantine Resilient Gossip Protocol
License
advdv/brahms
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Byzantine Resilient Gossip Protocol