mlsanityData to 7 Oct 2026

Blockchains Meet Distributed Hash Tables: Decoupling Validation from State Storage

arXiv 1904.01935 ↗First posted 7 Mar 2019cs.DC cs.CRcited by 1

Not on the map. Why?

Abstract (arXiv)

The first obstacle that regular users encounter when setting up a node for a public blockchain is the time taken for downloading all the data needed for the node to start operating correctly. In fact, this may last from hours to weeks for the major networks. Our contribution is twofold. Firstly, we show a design that enables mining and validation of new blocks keeping only a very small state. Secondly, we show that it is possible to store the state of the blockchain in a distributed hash table obtaining a wide spectrum of trade-offs between storage committed by the nodes and replication factor. Our proposal is independent from the consensus algorithm adopted, and copes well with transactions that involve smart contracts.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 7 Mar 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.