viewstamped-replication-made-famous
viewstamped-replication-made-famou
viewstamped-replication-made-famous | viewstamped-replication-made-famou | |
---|---|---|
3 | 1 | |
93 | - | |
- | - | |
4.8 | - | |
almost 2 years ago | - | |
Zig | ||
- | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
viewstamped-replication-made-famous
- A $20k distributed consensus protocol challenge
- A $20k distributed consensus protocol bug bounty challenge
-
Caches, Modes, and Unstable Systems
As an example of this in distributed systems:
There's a classic metastability issue in probably most implementations of state machine replication protocols such as Raft, where a lagging follower, if it sees an op that's newer than what it's expecting, must first repair and catch up its state (FIFO) before it can ACK back to the leader.
Apart from introducing latency in the critical path, this can lead to really bad queueing behavior where the lagging follower queues the latest request from the leader while it first catches up, but because this catch up can take seconds or minutes, in that time the pending request queue has also overflowed, and now we're back to state transfer catch up all over again, a vicious cycle.
Raft requires this bimodal latency distribution for correctness.
However, there is a new approach that we developed for TigerBeetle [1] to eliminate this bimodality and achieve constant ACK latencies from all followers, no matter their state, that we'll be sharing as part of Viewstamped Replication Made Famous [2], a $20,000 consensus challenge launching in September.
[1] https://www.tigerbeetle.com
[2] https://github.com/coilhq/viewstamped-replication-made-famou...
viewstamped-replication-made-famou
-
Caches, Modes, and Unstable Systems
As an example of this in distributed systems:
There's a classic metastability issue in probably most implementations of state machine replication protocols such as Raft, where a lagging follower, if it sees an op that's newer than what it's expecting, must first repair and catch up its state (FIFO) before it can ACK back to the leader.
Apart from introducing latency in the critical path, this can lead to really bad queueing behavior where the lagging follower queues the latest request from the leader while it first catches up, but because this catch up can take seconds or minutes, in that time the pending request queue has also overflowed, and now we're back to state transfer catch up all over again, a vicious cycle.
Raft requires this bimodal latency distribution for correctness.
However, there is a new approach that we developed for TigerBeetle [1] to eliminate this bimodality and achieve constant ACK latencies from all followers, no matter their state, that we'll be sharing as part of Viewstamped Replication Made Famous [2], a $20,000 consensus challenge launching in September.
[1] https://www.tigerbeetle.com
[2] https://github.com/coilhq/viewstamped-replication-made-famou...
What are some alternatives?
tigerbeetle - A distributed financial accounting database designed for mission critical safety and performance. [Moved to: https://github.com/tigerbeetledb/tigerbeetle]
viewstamped-replication-made-famous - A $20k consensus challenge based on TigerBeetle's implementation of the pioneering Viewstamped Replication protocol.
consensus - Entry point for consensus algorithm
Awesome-Hacking - A collection of various awesome lists for hackers, pentesters and security researchers
SPOW - Safe Proof of Work
POUW - Safe Proof of Work
tigerbeetle - The distributed financial transactions database designed for mission critical safety and performance.
DistributedSystemNotes - Notes on Lindsey Kuper's lectures on Distributed Systems