Skip to content

Commit 0a2e4a1

Browse files
committed
minor
1 parent 7a041a8 commit 0a2e4a1

File tree

1 file changed

+6
-3
lines changed

1 file changed

+6
-3
lines changed

README.md

+6-3
Original file line numberDiff line numberDiff line change
@@ -1,15 +1,18 @@
1-
COMING SOON
2-
==
3-
41
# HoneyBadgerBFT
52
The Honey Badger of BFT Protocols
63

74

85
<img width=200 src="http://i.imgur.com/wqzdYl4.png"/>
96

7+
COMING SOON
8+
==
9+
1010
Most fault tolerant protocols (including RAFT, PBFT, Zyzzyva, Q/U) don't guarantee good performance when there are Byzantine faults.
1111
Even the so-called "robust" BFT protocols (like UpRight, RBFT, Prime, Spinning) have hard-coded timeout parameters (or at least a gradually increasing back-off policy), and only guarantee liveness when the network behaves as expected.
1212

1313
HoneyBadgerBFT is fault tolerance for the *wild*. Badger nodes can even stay hidden behind anonymizing relays like Tor, and the purely-asynchronous protocol makes progress at whatever rate the network provides.
1414

1515
Read more at https://eprint.iacr.org/2016/199
16+
17+
18+

0 commit comments

Comments
 (0)