Mining in Logarithmic Space with Variable Difficulty
Résumé
This paper addresses both the storage and communication complexity issues of the blockchain. Techniques exist to optimize application data, whose size may grow or shrink over time. On the other hand, consensus data is vital to guarantee the trust we have in the blockchain, and is kept in its entirety. The Non-Interactive Proof of Proof-of-Work primitive addresses this scalability issue assuming a fixed computational power. We present for the first time a construction that provably satisfies the requirements of a non-interactive proof of proof-of-work that is secure against a 1/3 adversary in a dynamic environment. Succinctness, security and onlineness of the scheme are proven, while experimental results confirm the exponential reduction of the Bitcoin blockchain.
Domaines
Informatique [cs]Origine | Fichiers produits par l'(les) auteur(s) |
---|