A Two-Layer Blockchain Sharding Protocol Leveraging Safety and Liveness for Enhanced Performance

• URL: http://arxiv.org/abs/2310.11373v5
• Date: Fri, 12 Jul 2024 18:12:21 GMT
• Title: A Two-Layer Blockchain Sharding Protocol Leveraging Safety and Liveness for Enhanced Performance
• Authors: Yibin Xu, Jingyi Zheng, Boris Düdder, Tijs Slaats, Yongluan Zhou,
• Abstract summary: 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.
• Score: 5.344231997803284
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Sharding is essential for improving blockchain scalability. Existing protocols overlook diverse adversarial attacks, limiting transaction throughput. This paper presents Reticulum, a groundbreaking sharding protocol addressing this issue, boosting blockchain scalability. Reticulum employs a two-phase approach, adapting transaction throughput based on runtime adversarial attacks. It comprises "control" and "process" shards in two layers. Process shards contain at least one trustworthy node, while control shards have a majority of trusted nodes. In the first phase, transactions are written to blocks and voted on by nodes in process shards. Unanimously accepted blocks are confirmed. In the second phase, blocks without unanimous acceptance are voted on by control shards. Blocks are accepted if the majority votes in favor, eliminating first-phase opponents and silent voters. Reticulum uses unanimous voting in the first phase, involving fewer nodes, enabling more parallel process shards. Control shards finalize decisions and resolve disputes. Experiments confirm Reticulum's innovative design, providing high transaction throughput and robustness against various network attacks, outperforming existing sharding protocols for blockchain networks.

Related papers

• BlockFound: Customized blockchain foundation model for anomaly detection [47.04595143348698]
  BlockFound is a customized foundation model for anomaly blockchain transaction detection. We introduce a series of customized designs to model the unique data structure of blockchain transactions. BlockFound is the only method that successfully detects anomalous transactions on Solana with high accuracy.
  arXiv  Detail & Related papers  (2024-10-05T05:11:34Z)
• 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)
• Advancing Blockchain Scalability: An Introduction to Layer 1 and Layer 2 Solutions [0.24578723416255752]
  This paper examines the components of the Layer 1 protocol and the scale-up methods that directly improve the lower level blockchain. Layer 1 solutions encounter inherent limitations although improvements were applied due to layer 1 storage costs and latency are high. Our findings indicate that Layer 2 protocols, with their various implementations such as rollups and channels, significantly outperform Layer 1 solutions in terms of transaction throughput and efficiency.
  arXiv  Detail & Related papers  (2024-06-19T21:30:16Z)
• Optimal Sharding for Scalable Blockchains with Deconstructed SMR [6.432440366479941]
  Arete is an optimally scalable blockchain sharding protocol designed to resolve a size-security dilemma. The key idea of Arete is to improve the security resilience/threshold of shards by dividing the blockchain's State Machine Replication (SMR) process itself. We implement Arete and evaluate it on a AWS environment by running up to 500 nodes, showing that Arete outperforms the state-of-the-art sharding protocol.
  arXiv  Detail & Related papers  (2024-06-12T14:23:53Z)
• SoK: Public Blockchain Sharding [19.82054462793622]
  This study provides a systemization of knowledge of public blockchain sharding. It includes the core components of sharding systems, challenges, limitations, and mechanisms of the latest sharding protocols.
  arXiv  Detail & Related papers  (2024-05-30T22:38:40Z)
• On Fairness Concerns in the Blockchain Ecosystem [0.0]
  We audit the Bitcoin and blockchains to investigate the norms followed by miners in determining the transaction prioritization. Our findings have significant implications for future developments of blockchains and decentralized applications.
  arXiv  Detail & Related papers  (2024-05-29T08:35:37Z)
• Blockchains for Internet of Things: Fundamentals, Applications, and Challenges [38.29453164670072]
  Not every blockchain system is suitable for specific IoT applications. Public blockchains are not suitable for storing sensitive data. We explore the blockchain's application in three pivotal IoT areas: edge AI, communications, and healthcare.
  arXiv  Detail & Related papers  (2024-05-08T04:25:57Z)
• Blockchain Large Language Models [65.7726590159576]
  This paper presents a dynamic, real-time approach to detecting anomalous blockchain transactions. The proposed tool, BlockGPT, generates tracing representations of blockchain activity and trains from scratch a large language model to act as a real-time Intrusion Detection System.
  arXiv  Detail & Related papers  (2023-04-25T11:56:18Z)
• Resilient Consensus Sustained Collaboratively [6.090550359575682]
  We present the design of our Power-of-Collaboration protocol, which guards existing PoS/BFT blockchains against long-range attacks. PoC guarantees fairness and accountability and only marginally degrades the throughput of the underlying system.
  arXiv  Detail & Related papers  (2023-02-05T07:33:57Z)
• Quantum-resistance in blockchain networks [46.63333997460008]
  This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
  arXiv  Detail & Related papers  (2021-06-11T23:39:25Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)

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.