Pith. sign in

REVIEW 1 cited by

Data Availability Sampling in Ethereum: Analysis of P2P Networking Requirements

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

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

Micha{l} Król , Onur Ascigil , Sergi Rene , Etienne Rivière , Matthieu Pigaglio , Kaleem Peeroo , Vladimir Stankovic , Ramin Sadre
show 1 more author
Felix Lange
This is my paper · ORCID
classification cs.NIcs.CR
keywords dataethereumavailabilitynetworkingrequirementssamplingvalidationamount
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling

    cs.DS 2025-04 conditional novelty 6.0 of 10

    A grid-of-cliques protocol is proven to realize robust distributed arrays: constant-latency store and get with per-node storage of a 1/k2 slice, secure against an unbounded number of malicious nodes.

Pith tools