The reviewed record of science sign in
Pith

arxiv: 2507.00824 · v1 · pith:BOSNWFGX · submitted 2025-07-01 · cs.DC · cs.NI· cs.PF

PANDAS: Peer-to-peer, Adaptive Networking for Data Availability Sampling within Ethereum Consensus Timebounds

Reviewed by Pithpith:BOSNWFGXopen to challenge →

classification cs.DC cs.NIcs.PF
keywords dataethereumlayer-2availabilityconsensuspandassamplingnode
0
0 comments X
read the original abstract

Layer-2 protocols can assist Ethereum's limited throughput, but globally broadcasting layer-2 data limits their scalability. The Danksharding evolution of Ethereum aims to support the selective distribution of layer-2 data, whose availability in the network is verified using randomized data availability sampling (DAS). Integrating DAS into Ethereum's consensus process is challenging, as pieces of layer-2 data must be disseminated and sampled within four seconds of the beginning of each consensus slot. No existing solution can support dissemination and sampling under such strict time bounds. We propose PANDAS, a practical approach to integrate DAS with Ethereum under Danksharding's requirements without modifying its protocols for consensus and node discovery. PANDAS disseminates layer-2 data and samples its availability using lightweight, direct exchanges. Its design accounts for message loss, node failures, and unresponsive participants while anticipating the need to scale out the Ethereum network. Our evaluation of PANDAS's prototype in a 1,000-node cluster and simulations for up to 20,000 peers shows that it allows layer-2 data dissemination and sampling under planetary-scale latencies within the 4-second deadline.

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.