BrokerChain: A Blockchain Sharding Protocol by Exploiting Broker Accounts

• URL: http://arxiv.org/abs/2412.07202v1
• Date: Tue, 10 Dec 2024 05:41:59 GMT
• Title: BrokerChain: A Blockchain Sharding Protocol by Exploiting Broker Accounts
• Authors: Huawei Huang, Zhaokang Yin, Qinde Chen, Guang Ye, Xiaowen Peng, Yue Lin, Zibin Zheng, Song Guo,
• Abstract summary: We propose BrokerChain, a cross-shard protocol dedicated to account-based state sharding. We show that BrokerChain outperforms other baselines in terms of transaction throughput, transaction confirmation latency, the queue size of the transaction pool, and workload balance.
• Score: 30.62752646978089
• License:
• Abstract: State-of-the-art blockchain sharding solutions such as Monoxide, can cause severely imbalanced distribution of transaction (TX) workloads across all blockchain shards due to the deployment policy of their accounts. Imbalanced TX distributions then produce hot shards, in which the cross-shard TXs may experience an unlimited confirmation latency. Thus, how to address the hot-shard issue and how to reduce crossshard TXs become significant challenges of blockchain sharding. Through reviewing the related studies, we find that a crossshard TX protocol that can achieve workload balance among all shards and simultaneously reduce the quantity of crossshard TXs is still absent from the literature. To this end, we propose BrokerChain, which is a cross-shard blockchain protocol dedicated to account-based state sharding. Essentially, BrokerChain exploits fine-grained state partition and account segmentation. We also elaborate on how BrokerChain handles cross-shard TXs through broker accounts. The security issues and other properties of BrokerChain are analyzed rigorously. Finally, we conduct comprehensive evaluations using an opensource blockchain sharding prototype named BlockEmulator. The evaluation results show that BrokerChain outperforms other baselines in terms of transaction throughput, transaction confirmation latency, the queue size of the transaction pool, and workload balance.

Related papers

• Zaptos: Towards Optimal Blockchain Latency [52.30047458198369]
  We introduce Zaptos, a parallel pipelined architecture designed to minimize end-to-end latency. Zaptos achieves a throughput of 20,000 transactions per second with sub-second latency.
  arXiv  Detail & Related papers  (2025-01-18T00:22:22Z)
• 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)
• Manifoldchain: Maximizing Blockchain Throughput via Bandwidth-Clustered Sharding [8.782016890474873]
  Bandwidth limitation is the major bottleneck that hinders scaling throughput of proof-of-work blockchains. We propose Manifoldchain, a sharding protocol that alleviates the impact of slow miners to maximize blockchain throughput.
  arXiv  Detail & Related papers  (2024-07-23T08:52:51Z)
• 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)
• SpiralShard: Highly Concurrent and Secure Blockchain Sharding via Linked Cross-shard Endorsement [9.81571913553477]
  Existing sharding systems require large shard sizes to ensure security. We propose SpiralShard to allow the existence of some shards with a larger fraction of malicious nodes. SpiralShard achieves around 19x throughput gain under a large network size with 4,000+ nodes.
  arXiv  Detail & Related papers  (2024-07-09T15:14:44Z)
• 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)
• TxAllo: Dynamic Transaction Allocation in Sharded Blockchain Systems [37.22526235663589]
  This paper focuses on the transaction allocation problem to reduce the number of cross-shard transactions. A deterministic and fast allocation scheme TxAllo is proposed to dynamically infer the allocation of accounts. For a blockchain with 60 shards, TxAllo reduces the cross-shard transaction ratio from 98% to about 12%.
  arXiv  Detail & Related papers  (2022-12-22T10:22:31Z)
• Light Clients for Lazy Blockchains [12.330989180881701]
  We devise a protocol that enables the creation of efficient light clients for lazy blockchains. Our construction is based on a bisection game that traverses the Merkle tree containing the ledger of all - valid or invalid - transactions.
  arXiv  Detail & Related papers  (2022-03-30T00:58:40Z)
• 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.