Pith. sign in

REVIEW 1 cited by

Scalability limitations of Kademlia DHTs when enabling Data Availability Sampling in Ethereum

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 2402.09993 v1 pith:XGWV7ZWX submitted 2024-02-15 cs.NI cs.DC

Mikel Cortes-Goicoechea , Csaba Kiraly , Dmitriy Ryajov , Jose Luis Muñoz-Tapia , Leonardo Bautista-Gomez This is my paper · ORCID
classification cs.NIcs.DC
keywords availabilityethereumlimitationsdatadata-shardingdiscusskademlianetwork
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Scalability in blockchain remains a significant challenge, especially when prioritizing decentralization and security. The Ethereum community has proposed comprehensive data-sharding techniques to overcome storage, computational, and network processing limitations. In this context, the propagation and availability of large blocks become the subject of research to achieve scalable data-sharding. This paper provides insights after exploring the usage of a Kademlia-based DHT to enable Data Availability Sampling (DAS) in Ethereum. It presents a DAS-DHT simulator to study this problem and validates the results of the simulator with experiments in a real DHT network, IPFS. Our results help us understand what parts of DAS can be achieved based on existing Kademlia DHT solutions and which ones cannot. We discuss the limitations of DHT solutions and discuss other alternatives.

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