tigerbeetle
viewstamped-replication-made-famous
Our great sponsors
tigerbeetle | viewstamped-replication-made-famous | |
---|---|---|
37 | 3 | |
1,012 | 93 | |
- | - | |
9.5 | 4.8 | |
over 1 year ago | almost 2 years ago | |
Zig | Zig | |
Apache License 2.0 | - |
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.
tigerbeetle
-
SQLite Helps You Do Acid
Indeed!
I was so glad to see you cite not only the Rebello paper but also Protocol-Aware Recovery for Consensus-Based Storage. When I read your first comment, I was about to reply to mention PAR, and then saw you had saved me the trouble!
UW-Madison are truly the vanguard where consensus hits the disk.
We implemented Protocol-Aware Recovery for TigerBeetle [1], and I did a talk recently at the Recurse Center diving into PAR, talking about the intersection of global consensus protocol and local storage engine. It's called Let's Remix Distributed Database Design! [2] and owes the big ideas to UW-Madison.
[1] https://github.com/coilhq/tigerbeetle
[2] https://www.youtube.com/watch?v=rNmZZLant9o
-
20 years of payment processing problems
> It sounds like payments might be part of the larger concept of declarative programming (DP)
Yes, exactly! The idea with TigerBeetle's state machine [1] is to expose double-entry accounting as higher level financial primitives, so that developers can think in terms of declaring transfers from one account to another. The business logic behind the scenes is detailed, but the interfaces and data structures are simple.
[1] https://github.com/coilhq/tigerbeetle/blob/main/src/state_ma...
> Maybe TigerBeetle could be generalized to support any multi-step distributed process?
That's part of the plan, that the distributed database framework of TigerBeetle can be used as a ”distributed Iron Man suit” to support any kind of state machine.
-
How Safe Is Zig?
It's a pleasure. Let me know if you have any more questions about TigerBeetle. Our design doc is also here: https://github.com/coilhq/tigerbeetle/blob/main/docs/DESIGN....
- TigerStyle – TigerBeetle's coding style guide
-
Distributed Systems Shibboleths
Surprisingly, some of the most powerful distributed systems algorithms or tools are actually deterministic. They're powerful because they can "load the dice" and so make the distributed system more intuitive for humans to reason about, more resilient to real world network faults, and do all this with more performance.
For example, Barbara Liskov and James Cowling's deterministic view change [1], which isn't plagued by the latency issues of RAFT's randomized dueling leader problem. Viewstamped Replication Revisited's deterministic view change can react to a failed primary much quicker than RAFT (heartbeat timeouts don't require randomized "padding" as they do in RAFT), commence the leader election, and also ensure that the leader election succeeds without a split vote.
Determinism makes all that possible.
Deterministic testing [2][3] is also your best friend when it comes to testing distributed systems.
[1] I did a talk on VSR, including the benefits of the view change — https://www.youtube.com/watch?v=Wii1LX_ltIs
[2] FoundationDB are pioneers of deterministic testing — https://www.youtube.com/watch?v=OJb8A6h9jQQ
[3] TigerBeetle's deterministic simulation tests — https://github.com/coilhq/tigerbeetle#simulation-tests
-
Lies we tell ourselves to keep using Golang
This is the chasm problem, where people don't use a technology because people aren't using that technology, thus the technology has difficulty gaining adoption. I did see that Zig does have it's own killer app and startup that's using Zig: TigerBeattle.
-
Ask HN: Codebases with great, easy to read code?
Control flow statements should always be on their own lines, then it's easy to find all of them by visually scanning top-down, without needing to look all the way down each line.
[1]: https://github.com/coilhq/tigerbeetle/blob/main/src/vsr/repl...
-
Database functions to wrap logic and SQL queries
> In hindsight, data logic should be in the database itself.
This is the reason we are creating TigerBeetle [1] at Coil, as an open source distributed financial accounting database, with the double entry logic and financial invariants enforced through financial primitives within the database itself.
This is all the more critical for financial data, because raw data consistency is not enough for financial transactions, you also need financial consistency, not to mention immutability.
The performance of doing it this way is also easier. For example, around a million financial transactions per second on commodity hardware, with p100 latency around 10-20ms.
[1] https://github.com/coilhq/tigerbeetle
-
Building Payment systems for the World at Hackathons
You probably already know this — because we’ve mentioned it a few times — but Coil champions and supports open-source projects and is privacy-first, by default. Over the years, Developer Relations at Coil has championed and sponsored teams that write Open Web Documentations and projects that empower open-source developers to get paid. Coil has also incubated many open-source projects like Tigerbeetle and Rafiki.
-
Durability and Redo Logging
[6] Partial logical sector reads/writes even when using O_DIRECT — https://github.com/coilhq/tigerbeetle/blob/main/src/storage....
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...
What are some alternatives?
zig - General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.
viewstamped-replication-made-famous - A $20k consensus challenge based on TigerBeetle's implementation of the pioneering Viewstamped Replication protocol.
raft - Golang implementation of the Raft consensus protocol
consensus - Entry point for consensus algorithm
Co-dfns - High-performance, Reliable, and Parallel APL
Awesome-Hacking - A collection of various awesome lists for hackers, pentesters and security researchers
raft-grpc-example - Example code for how to get hashicorp/raft running with gRPC
viewstamped-replication-made-famou
LevelDB - LevelDB is a fast key-value storage library written at Google that provides an ordered mapping from string keys to string values.
SPOW - Safe Proof of Work
async-std - Async version of the Rust standard library
POUW - Safe Proof of Work