Barracuda: The power of ℓ-polling in Proof-of-Stake Blockchains

Giulia Fanti, Jiantao Jiao, Ashok Makkuva, Sewoong Oh, Ranvir Rana, Pramod Viswanath

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 give a perfect chain, since each proposer would have the same view of the blockchain. A major challenge in practice is forking. Due to network delays, a proposer may not yet have the most recent block, and may therefore create a side chain that branches from the middle of the main chain. Forking reduces throughput, since only one a single main chain can survive, and all other blocks are discarded. We propose a new P2P protocol for blockchains called Barracuda, in which each proposer, prior to proposing a block, polls ℓ other nodes for their local blocktree information. Under a stochastic network model, we prove that this lightweight primitive improves throughput as if the entire network were a factor of ℓ faster. We provide guidelines on how to implement Barracuda in practice, guaranteeing robustness against several real-world factors.

Original languageEnglish (US)
Title of host publicationMobihoc 2019 - Proceedings of the 2019 20th ACM International Symposium on Mobile Ad Hoc Networking and Computing
PublisherAssociation for Computing Machinery
Pages351-360
Number of pages10
ISBN (Electronic)9781450367646
DOIs
StatePublished - Jul 2 2019
Event20th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2019 - Catania, Italy
Duration: Jul 2 2019Jul 5 2019

Publication series

NameProceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Conference

Conference20th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2019
CountryItaly
CityCatania
Period7/2/197/5/19

Fingerprint

Throughput

Keywords

  • Stochastic networks, blockchains

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications
  • Software

Cite this

Fanti, G., Jiao, J., Makkuva, A., Oh, S., Rana, R., & Viswanath, P. (2019). Barracuda: The power of ℓ-polling in Proof-of-Stake Blockchains. In Mobihoc 2019 - Proceedings of the 2019 20th ACM International Symposium on Mobile Ad Hoc Networking and Computing (pp. 351-360). (Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)). Association for Computing Machinery. https://doi.org/10.1145/3323679.3326533

Barracuda : The power of ℓ-polling in Proof-of-Stake Blockchains. / Fanti, Giulia; Jiao, Jiantao; Makkuva, Ashok; Oh, Sewoong; Rana, Ranvir; Viswanath, Pramod.

Mobihoc 2019 - Proceedings of the 2019 20th ACM International Symposium on Mobile Ad Hoc Networking and Computing. Association for Computing Machinery, 2019. p. 351-360 (Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fanti, G, Jiao, J, Makkuva, A, Oh, S, Rana, R & Viswanath, P 2019, Barracuda: The power of ℓ-polling in Proof-of-Stake Blockchains. in Mobihoc 2019 - Proceedings of the 2019 20th ACM International Symposium on Mobile Ad Hoc Networking and Computing. Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Association for Computing Machinery, pp. 351-360, 20th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2019, Catania, Italy, 7/2/19. https://doi.org/10.1145/3323679.3326533
Fanti G, Jiao J, Makkuva A, Oh S, Rana R, Viswanath P. Barracuda: The power of ℓ-polling in Proof-of-Stake Blockchains. In Mobihoc 2019 - Proceedings of the 2019 20th ACM International Symposium on Mobile Ad Hoc Networking and Computing. Association for Computing Machinery. 2019. p. 351-360. (Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)). https://doi.org/10.1145/3323679.3326533
Fanti, Giulia ; Jiao, Jiantao ; Makkuva, Ashok ; Oh, Sewoong ; Rana, Ranvir ; Viswanath, Pramod. / Barracuda : The power of ℓ-polling in Proof-of-Stake Blockchains. Mobihoc 2019 - Proceedings of the 2019 20th ACM International Symposium on Mobile Ad Hoc Networking and Computing. Association for Computing Machinery, 2019. pp. 351-360 (Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)).
@inproceedings{96d628f787474f96afa248d506130aff,
title = "Barracuda: The power of ℓ-polling in Proof-of-Stake Blockchains",
abstract = "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 give a perfect chain, since each proposer would have the same view of the blockchain. A major challenge in practice is forking. Due to network delays, a proposer may not yet have the most recent block, and may therefore create a side chain that branches from the middle of the main chain. Forking reduces throughput, since only one a single main chain can survive, and all other blocks are discarded. We propose a new P2P protocol for blockchains called Barracuda, in which each proposer, prior to proposing a block, polls ℓ other nodes for their local blocktree information. Under a stochastic network model, we prove that this lightweight primitive improves throughput as if the entire network were a factor of ℓ faster. We provide guidelines on how to implement Barracuda in practice, guaranteeing robustness against several real-world factors.",
keywords = "Stochastic networks, blockchains",
author = "Giulia Fanti and Jiantao Jiao and Ashok Makkuva and Sewoong Oh and Ranvir Rana and Pramod Viswanath",
year = "2019",
month = "7",
day = "2",
doi = "10.1145/3323679.3326533",
language = "English (US)",
series = "Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)",
publisher = "Association for Computing Machinery",
pages = "351--360",
booktitle = "Mobihoc 2019 - Proceedings of the 2019 20th ACM International Symposium on Mobile Ad Hoc Networking and Computing",

}

TY - GEN

T1 - Barracuda

T2 - The power of ℓ-polling in Proof-of-Stake Blockchains

AU - Fanti, Giulia

AU - Jiao, Jiantao

AU - Makkuva, Ashok

AU - Oh, Sewoong

AU - Rana, Ranvir

AU - Viswanath, Pramod

PY - 2019/7/2

Y1 - 2019/7/2

N2 - 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 give a perfect chain, since each proposer would have the same view of the blockchain. A major challenge in practice is forking. Due to network delays, a proposer may not yet have the most recent block, and may therefore create a side chain that branches from the middle of the main chain. Forking reduces throughput, since only one a single main chain can survive, and all other blocks are discarded. We propose a new P2P protocol for blockchains called Barracuda, in which each proposer, prior to proposing a block, polls ℓ other nodes for their local blocktree information. Under a stochastic network model, we prove that this lightweight primitive improves throughput as if the entire network were a factor of ℓ faster. We provide guidelines on how to implement Barracuda in practice, guaranteeing robustness against several real-world factors.

AB - 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 give a perfect chain, since each proposer would have the same view of the blockchain. A major challenge in practice is forking. Due to network delays, a proposer may not yet have the most recent block, and may therefore create a side chain that branches from the middle of the main chain. Forking reduces throughput, since only one a single main chain can survive, and all other blocks are discarded. We propose a new P2P protocol for blockchains called Barracuda, in which each proposer, prior to proposing a block, polls ℓ other nodes for their local blocktree information. Under a stochastic network model, we prove that this lightweight primitive improves throughput as if the entire network were a factor of ℓ faster. We provide guidelines on how to implement Barracuda in practice, guaranteeing robustness against several real-world factors.

KW - Stochastic networks, blockchains

UR - http://www.scopus.com/inward/record.url?scp=85069774129&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85069774129&partnerID=8YFLogxK

U2 - 10.1145/3323679.3326533

DO - 10.1145/3323679.3326533

M3 - Conference contribution

AN - SCOPUS:85069774129

T3 - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

SP - 351

EP - 360

BT - Mobihoc 2019 - Proceedings of the 2019 20th ACM International Symposium on Mobile Ad Hoc Networking and Computing

PB - Association for Computing Machinery

ER -