aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--content/blog/2023-11-thoughts-on-leaderless-consensus/index.md4
1 files changed, 0 insertions, 4 deletions
diff --git a/content/blog/2023-11-thoughts-on-leaderless-consensus/index.md b/content/blog/2023-11-thoughts-on-leaderless-consensus/index.md
index 1dce0e6..aea6210 100644
--- a/content/blog/2023-11-thoughts-on-leaderless-consensus/index.md
+++ b/content/blog/2023-11-thoughts-on-leaderless-consensus/index.md
@@ -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