| Title | Towards Solving the Data Availability Problem for Sharded Ethereum |
| Publication Type | Conference Paper |
| Year of Publication | 2018 |
| Authors | Sel, Daniel, Zhang, Kaiwen, Jacobsen, Hans-Arno |
| Conference Name | Proceedings of the 2Nd Workshop on Scalable and Resilient Infrastructures for Distributed Ledgers |
| Publisher | ACM |
| Conference Location | New York, NY, USA |
| ISBN Number | 978-1-4503-6110-1 |
| Keywords | blockchain, Computing Theory and Resilience, data availability, Distributed Systems, ethereum, Proof of Stake, pubcrawl, Resiliency, Sharding |
| Abstract | The success and growing popularity of blockchain technology has lead to a significant increase in load on popular permissionless blockchains such as Ethereum. With the current design, these blockchain systems do not scale with additional nodes since every node executes every transaction. Further efforts are therefore necessary to develop scalable permissionless blockchain systems. In this paper, we provide an aggregated overview of the current research on the Ethereum blockchain towards solving the scalability challenge. We focus on the concept of sharding, which aims to break the restriction of every participant being required to execute every transaction and store the entire state. This concept however introduces new complexities in the form of stateless clients, which leads to a new challenge: how to guarantee that critical data is published and stays available for as long as it is relevant. We present an approach towards solving the data availability problem (DAP) that leverages synergy effects by reusing the validators from Casper. We then propose two distinct approaches for reliable collation proposal, state transition, and state verification in shard chains. One approach is based on verification by committees of Casper validators that execute transactions in proposed blocks using witness data provided by executors. The other approach relies on a proof of execution provided by the executor proposing the block and a challenge game, where other executors verify the proof. Both concepts rely on executors for long-term storage of shard chain state. |
| URL | http://doi.acm.org/10.1145/3284764.3284769 |
| DOI | 10.1145/3284764.3284769 |
| Citation Key | sel_towards_2018 |
Towards Solving the Data Availability Problem for Sharded Ethereum