2026-09-20T19:22:12Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/109389 2023-07-11 col_2142_5131 col_2142_8888 com_2142_5130 com_2142_8887 com_2142_234

Viswanath, Pramod Rana, Ranvir 2021-03-05T21:38:06Z 2021-03-05T21:38:06Z 2020-11-30 2020-12 Blockchain is a database of storing sequential events as a chain of blocks consistently across a distributed set of nodes. A fundamental problem in doing so is to decide where to put the next block and who should do it in a Sybil-resistant manner. To solve this problem, typically, a node is elected randomly as a leader to append a new block to the end of a chain stored locally by the leader. Ideally, this should extend the chain of blocks, however in practice, due to network imperfections, the local blockchain of the leader might not be synced entirely, thus resulting in forking, a scenario when a new block is appended in the middle of the blockchain, thus creating a fork. These network imperfections create a structure like a tree rather than a chain, where blocks not part of the main chain are abandoned, thus reducing the system’s efficiency. We propose a new peer-to-peer (P2P) protocol called Barracuda, where the leader polls l − 1 random nodes for their blocktree information before proposing a new block and show that this policy has an effect equivalent to having a network that is l times faster under a stochastic network model inspired by Decker and Wattenhofer (2013). We also show via simulations that Barracuda is robust to several real-world factors in the network model. Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2021-03-04 without embargo terms The student, Ranvir Rana, accepted the attached license on 2020-11-25 at 13:34. The student, Ranvir Rana, submitted this Thesis for approval on 2020-11-25 at 13:46. This Thesis was approved for publication on 2020-11-30 at 13:55. DSpace SAF Submission Ingestion Package generated from Vireo submission #15963 on 2021-03-04 at 15:35:07 Made available in DSpace on 2021-03-05T21:38:06Z (GMT). No. of bitstreams: 2 RANA-THESIS-2020.pdf: 417595 bytes, checksum: 71e22018253d4241a1d45fe56b81dc22 (MD5) LICENSE.txt: 4208 bytes, checksum: a6dc8d18ce09cbd3c540c3a69c265e39 (MD5) Previous issue date: 2020-11-30 application/pdf http://hdl.handle.net/2142/109389 en Copyright 2020 Ranvir Rana Blockchain Distributed, Parallel, and Cluster Computing Cryptography and Security Information Theory Barracuda: The power of l-polling in proof of stake blockchains text Thesis University of Illinois at Urbana-Champaign Electrical & Computer Eng Electrical & Computer Engr Thesis M.S.