This commit is contained in:
parent
e66f6de458
commit
d3c5a34d27
1 changed files with 0 additions and 4 deletions
|
@ -61,8 +61,6 @@ discussing Byzantine-tolerant systems, which seem to be the main focus of
|
|||
*Leaderless Consensus*, even though the authors also propose an algorithm for
|
||||
non-Byzantine systems (the one we are interested in).
|
||||
|
||||
---
|
||||
|
||||
## Main takeaways of *Leaderless Consensus*
|
||||
|
||||
To be able to meaningfully say that an algorithm is *leaderless*, one has to first
|
||||
|
@ -115,8 +113,6 @@ in only 42 lines of very understandable pseudocode. There is also a BFT
|
|||
variant of Archipelago, which is not of interest to us in the context of Garage
|
||||
as we are making the hypothesis that all nodes are trusted.
|
||||
|
||||
---
|
||||
|
||||
## Where to go from now?
|
||||
|
||||
Before an algorithm such as OFT-Archipelago can be added to Garage, a few fundamental
|
||||
|
|
Loading…
Reference in a new issue