The reviewed record of science sign in
Pith

arxiv: 2306.11456 · v1 · pith:HLBACPPK · submitted 2023-06-20 · cs.NI · cs.CR

Data Availability Sampling in Ethereum: Analysis of P2P Networking Requirements

Micha{\l} Kr\'ol , Onur Ascigil , Sergi Rene , Etienne Rivi\`ere , Matthieu Pigaglio , Kaleem Peeroo , Vladimir Stankovic , Ramin Sadre
show 1 more author
Felix Lange
This is my paper

Reviewed by Pithpith:HLBACPPKopen to challenge →

classification cs.NI cs.CR
keywords dataethereumavailabilitynetworkingrequirementssamplingvalidationamount
0
0 comments X
read the original abstract

Despite their increasing popularity, blockchains still suffer from severe scalability limitations. Recently, Ethereum proposed a novel approach to block validation based on Data Availability Sampling (DAS), that has the potential to improve its transaction per second rate by more than two orders of magnitude. DAS should also significantly reduce per-transaction validation costs. At the same time, DAS introduces new communication patterns in the Ethereum Peer-to-Peer (P2P) network. These drastically increase the amount of exchanged data and impose stringent latency objectives. In this paper, we review the new requirements for P2P networking associated with DAS, discuss open challenges, and identify new research directions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Polynomial Multiproofs for Scalable Data Availability Sampling in Blockchain Light Clients

    cs.CR 2026-04 unverdicted novelty 6.0

    Polynomial multiproofs verify multiple sampled cells with one aggregated proof over a shared micro-domain, cutting proof bytes, verifier resources, and infrastructure costs by up to 45% in the Avail case study.