Corpus ID: 202677571

# Barracuda: The Power of $\ell$-polling in Proof-of-Stake Blockchains.

@article{Fanti2019BarracudaTP,
title={Barracuda: The Power of \$\ell\$-polling in Proof-of-Stake Blockchains.},
author={Giulia C. Fanti and Jiantao Jiao and Ashok Vardhan Makkuva and Sewoong Oh and Ranvir Rana and Pramod Viswanath},
journal={arXiv: Cryptography and Security},
year={2019}
}
• G. Fanti, +3 authors P. Viswanath
• Published 2019
• Computer Science, Mathematics
• arXiv: Cryptography and Security
A blockchain is a database of sequential events that is maintained by a distributed group of nodes. A key consensus problem in blockchains is that of determining the next block (data element) in the sequence. Many blockchains address this by electing a new node to propose each new block. The new block is (typically) appended to the tip of the proposer's local blockchain, and subsequently broadcast to the rest of the network. Without network delay (or adversarial behavior), this procedure would… Expand
5 Citations

#### Figures and Topics from this paper

Barracuda: The Power of ℓ-polling in Proof-of-Stake Blockchains
• Computer Science
• MobiHoc
• 2019
A new P2P protocol for blockchains called Barracuda is proposed, in which each proposer, prior to proposing a block, polls ℓ other nodes for their local blocktree information, and it is proved that this lightweight primitive improves throughput as if the entire network were a factor ofℓ faster. Expand
The Longest-Chain Protocol Under Random Delays
• Computer Science
• ArXiv
• 2021
This work shows that the longest-chain protocol has good security guarantees when delays are sporadically large and possibly unbounded, which is reflective of real-world network conditions. Expand
Enhancing the power of two choices load balancing algorithm using round robin policy
• Computer Science
• Cluster Computing
• 2020
A theoretical approximation is demonstrated with a theoretical approximation of this approach that this new version of the power of two choices, SQ(d), load balancing algorithm improves the performance obtained with the classical solution in all situations, including systems at 99% capacity. Expand
Construction of urban agricultural health informatics safety supervision system based on imaging and deep learning
• Zhanyu Liu
• Computer Science
• Concurr. Comput. Pract. Exp.
• 2021
The designed UAHISS is based on computerized medical image information processing, and reduces the daily reporting and writing work as well as providing timely image information to the clinicians, and can detect the health informatics safety supervision information accurately. Expand
Layout Optimization of Landscape Architecture based on Intelligent Visual Scene Recognition and Saliency Analysis
• Yulan Li
• 2021 Third International Conference on Intelligent Communication Technologies and Virtual Mobile Networks (ICICV)
• 2021
Layout optimization of the landscape architecture based on intelligent visual scene recognition and saliency analysis is studied in this article. Among the many scenaiios, the core behavior analysisExpand

#### References

SHOWING 1-10 OF 27 REFERENCES
Barracuda: The Power of ℓ-polling in Proof-of-Stake Blockchains
• Computer Science
• MobiHoc
• 2019
A new P2P protocol for blockchains called Barracuda is proposed, in which each proposer, prior to proposing a block, polls ℓ other nodes for their local blocktree information, and it is proved that this lightweight primitive improves throughput as if the entire network were a factor ofℓ faster. Expand
Stochastic Models and Wide-Area Network Measurements for Blockchain Design and Analysis
• Computer Science
• IEEE INFOCOM 2018 - IEEE Conference on Computer Communications
• 2018
Stochastic network models are developed to capture the Blockchain evolution and dynamics and analyze the impact of the block dissemination delay and hashing power of the member nodes on Blockchain performance in terms of the overall block generation rate and required computational power for launching a successful attack. Expand
Bitcoin blockchain dynamics: The selfish-mine strategy in the presence of propagation delay
• Computer Science
• Perform. Evaluation
• 2016
The models indicate that both the dishonest and the honest miners were worse off than they would have been if no dishonest mining were present, and that it is possible for the mining community to detect block-hiding behaviour, such as that used in selfish-mine, by monitoring the rate of production of orphan blocks. Expand
Bitcoin-NG: A Scalable Blockchain Protocol
• Computer Science
• NSDI
• 2016
This paper implements Bitcoin-NG, a new blockchain protocol designed to scale, which is Byzantine fault tolerant, is robust to extreme churn, and shares the same trust model obviating qualitative changes to the ecosystem. Expand
Deconstructing the Blockchain to Approach Physical Limits
• Computer Science, Mathematics
• IACR Cryptol. ePrint Arch.
• 2018
Transaction throughput, confirmation latency and confirmation reliability are fundamental performance measures of any blockchain system in addition to its security. In a decentralized setting, theseExpand
Inclusive Block Chain Protocols
• Computer Science
• Financial Cryptography
• 2015
The mechanics of the block chain and block propagation are constrained: if blocks are created at a high rate compared to their propagation time in the network, many conflicting blocks arecreated and performance suffers greatly, and transactions take long to securely confirm, and their throughput is greatly limited. Expand
SPECTRE: A Fast and Scalable Cryptocurrency Protocol
• Computer Science
• IACR Cryptol. ePrint Arch.
• 2016
SPECTRE is presented, a new protocol for the consensus core of crypto-currencies that remains secure even under high throughput and fast confirmation times, and can operate at high block creation rates, which implies that its transactions confirm in mere seconds. Expand
Information propagation in the Bitcoin network
• Computer Science
• IEEE P2P 2013 Proceedings
• 2013
This paper analyzes how Bitcoin uses a multi-hop broadcast to propagate transactions and blocks through the network to update the ledger replicas, and verifies the conjecture that the propagation delay in the network is the primary cause for blockchain forks. Expand
Scaling Nakamoto Consensus to Thousands of Transactions per Second
• Computer Science
• ArXiv
• 2018
Conflux is a fast, scalable and decentralized blockchain system that optimistically process concurrent blocks without discarding any as forks and achieves a transaction throughput of 5.76GB/h while confirming transactions in 4.5-7.4 minutes. Expand
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol
• Computer Science
• CRYPTO
• 2016
“Ouroboros” is presented, the first blockchain protocol based on proof of stake with rigorous security guarantees and it is proved that, given this mechanism, honest behavior is an approximate Nash equilibrium, thus neutralizing attacks such as selfish mining. Expand