Name
Abstract | ||
|---|---|---|
Distributed ledgers have the potential to revolutionize the financial landscape by removing trusted third parties. At the heart of most distributed ledgers is their consensus protocol. The consensus protocol describes the way participants in a distributed network interact with each other to obtain and agree on a shared state. While classical Byzantine fault tolerant (BFT) algorithms are designed to work in closed, size-limited networks only, modern distributed ledgers - and blockchains in particular - often focus on open, permissionless networks. In this paper, we present a novel blockchain consensus algorithm for open, permissionless networks, called Albatross, inspired by speculative BFT algorithms. We argue that the protocol is secure under regular PBFT security assumptions and has a theoretical performance close to the maximum for single-chain Proof-of-Stake consensus algorithms. We conclude by describing our future work related to Albatross. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/CVCBT.2019.000-1 | 2019 Crypto Valley Conference on Blockchain Technology (CVCBT) |
Keywords | Field | DocType |
consensus algorithm,distributed ledger,cryptocurrency,proof of stake,pos,blockchain,optimistic consensus,byzantine | Consensus algorithm,Computer science,Ledger,Byzantine fault tolerance,Albatross,Theoretical computer science,Fault tolerance,Blockchain,Distributed ledger | Conference |
ISBN | Citations | PageRank |
978-1-7281-3670-7 | 1 | 0.39 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pascal Berrang | 1 | 33 | 5.16 |
| Philipp von Styp-Rekowsky | 2 | 151 | 8.07 |
| Marvin Wissfeld | 3 | 1 | 0.39 |
| Bruno Franca | 4 | 1 | 0.39 |
| Reto Trinkler | 5 | 1 | 0.39 |