Breaking Blockchain's Communication Barrier with Coded Computation
Canran Wang, Netanel Raviv

TL;DR
This paper introduces a novel blockchain design that leverages coded computation and 2D sharding to significantly reduce communication complexity, improve fault tolerance, and support cross-shard transactions.
Contribution
It presents a new blockchain architecture combining coded computation, information dispersal, and a 2D sharding strategy to enhance scalability and resilience.
Findings
Communication complexity grows logarithmically with network size.
System achieves Byzantine fault tolerance with linear message complexity.
Supports cross-shard transactions without complex protocols.
Abstract
Although blockchain, the supporting technology of various cryptocurrencies, has offered a potentially effective framework for numerous decentralized trust management systems, its performance is still sub-optimal in real-world networks. With limited bandwidth, the communication complexity for nodes to process a block scales with the growing network size and hence becomes the limiting factor of blockchain's performance. In this paper, we suggest a re-design of existing blockchain systems, which addresses the issue of the communication burden. First, by employing techniques from Coded Computation, our scheme guarantees correct verification of transactions while reducing the bit complexity dramatically such that it grows logarithmically with the number of nodes. Second, with the adoption of techniques from Information Dispersal and State Machine Replication, the system is resilient to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlockchain Technology Applications and Security · Cryptography and Data Security · Ferroelectric and Negative Capacitance Devices
