Blockchains Meet Distributed Hash Tables: Decoupling Validation from State Storage

March 07, 2019 Β· Declared Dead Β· πŸ› DLT@ITASEC

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Matteo Bernardini, Diego Pennino, Maurizio Pizzonia arXiv ID 1904.01935 Category cs.DC: Distributed Computing Cross-listed cs.CR Citations 18 Venue DLT@ITASEC Last Checked 4 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Distributed Computing

Died the same way β€” πŸ‘» Ghosted