Pipelet: Practical Streamlined Blockchain Protocol
- URL: http://arxiv.org/abs/2401.07162v2
- Date: Wed, 17 Jan 2024 17:56:10 GMT
- Title: Pipelet: Practical Streamlined Blockchain Protocol
- Authors: Vivek Karihaloo, Ruchi Shah, Panruo Wu, Aron Laszka,
- Abstract summary: We introduce Pipelet, a practical streamlined consensus protocol.
It employs the same block-finalization rule as Streamlet, but attains state-of-the-art performance in terms of communication complexity.
At the same time, Pipelet retains the simplicity of Streamlet, which presents significant practical advantages.
- Score: 4.317607968278648
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Fueled by the growing popularity of proof-of-stake blockchains, there has been increasing interest and progress in permissioned consensus protocols, which could provide a simpler alternative to existing protocols, such as Paxos and PBFT. In particular, the recently proposed Streamlet protocol provides a surprisingly simple and streamlined consensus approach, which crystallizes years of research in simplifying and improving classical consensus protocols. While the simplicity of Streamlet is a major accomplishment, the protocol lacks certain practical features, such as supporting a stable block proposer, and it makes strong assumptions, such as synchronized clocks and the implicit echoing of all messages. Most importantly, it requires sending $O(N^3)$ messages per block in a network of $N$ nodes, which poses a significant challenge to its application in larger networks. To address these limitations, we introduce Pipelet, a practical streamlined consensus protocol. Pipelet employs the same block-finalization rule as Streamlet, but attains state-of-the-art performance in terms of communication complexity and provides features that are crucial for practical applications, such as clock synchronization and stable block proposers. At the same time, Pipelet retains the simplicity of Streamlet, which presents significant practical advantages, such as ease of implementation and verification.
Related papers
- The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.
Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol.
We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
arXiv Detail & Related papers (2024-07-16T20:53:04Z) - TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus [1.6364535330823093]
TetraBFT is a Byzantine fault tolerant protocol for solving consensus in partial synchrony.
We validate the correctness of TetraBFT through rigorous security analysis and formal verification.
We extend TetraBFT into a multi-shot, chained consensus protocol.
arXiv Detail & Related papers (2024-05-04T08:54:42Z) - Sequencer Level Security [2.756899615600916]
We introduce the Sequencer Level Security (SLS) protocol, an enhancement to sequencing protocols of rollups.
We describe the mechanics of the protocol for both the transactions submitted to the rollup mempool, as well as transactions originating from Layer one.
We implement a prototype of the SLS protocol, Zircuit, which is built on top of Geth and the OP stack.
arXiv Detail & Related papers (2024-05-03T02:47:40Z) - Graph Attention Network-based Block Propagation with Optimal AoI and Reputation in Web 3.0 [59.94605620983965]
We design a Graph Attention Network (GAT)-based reliable block propagation optimization framework for blockchain-enabled Web 3.0.
To achieve the reliability of block propagation, we introduce a reputation mechanism based on the subjective logic model.
Considering that the GAT possesses the excellent ability to process graph-structured data, we utilize the GAT with reinforcement learning to obtain the optimal block propagation trajectory.
arXiv Detail & Related papers (2024-03-20T01:58:38Z) - A Survey and Comparative Analysis of Security Properties of CAN Authentication Protocols [92.81385447582882]
The Controller Area Network (CAN) bus leaves in-vehicle communications inherently non-secure.
This paper reviews and compares the 15 most prominent authentication protocols for the CAN bus.
We evaluate protocols based on essential operational criteria that contribute to ease of implementation.
arXiv Detail & Related papers (2024-01-19T14:52:04Z) - A Two-Layer Blockchain Sharding Protocol Leveraging Safety and Liveness for Enhanced Performance [5.344231997803284]
Existing protocols overlook diverse adversarial attacks, limiting transaction throughput.
This paper presents Reticulum, a groundbreaking sharding protocol addressing this issue.
It comprises "control" and "process" shards in two layers.
arXiv Detail & Related papers (2023-10-17T16:15:28Z) - Cuttlefish: Expressive Fast Path Blockchains with FastUnlock [4.483666331132052]
Cuttlefish addresses limitations of existing consensus-less and consensus-minimized decentralized ledgers.
Key insight of Cuttlefish is that consensus is necessary due to contention, rather than multiple owners of an asset as suggested by prior work.
Cuttlefish introduces collective objects and multi-owner transactions that can offer most of the functionality of classic blockchains.
arXiv Detail & Related papers (2023-09-22T08:56:32Z) - Practical quantum secure direct communication with squeezed states [55.41644538483948]
We report the first table-top experimental demonstration of a CV-QSDC system and assess its security.
This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
arXiv Detail & Related papers (2023-06-25T19:23:42Z) - Data post-processing for the one-way heterodyne protocol under
composable finite-size security [62.997667081978825]
We study the performance of a practical continuous-variable (CV) quantum key distribution protocol.
We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime.
This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
arXiv Detail & Related papers (2022-05-20T12:37:09Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.