Weight-Based Nakamoto-Style Blockchains

Simon Holmgaard Kamp, Bernardo Magri, Christian Matt, Jesper Buus Nielsen, Søren Eller Thomsen, and Daniel Tschudi

Abstract

We propose a framework for building Nakamoto-style proof-of-work blockchains where blocks are treated differently in the longest chain rule''. The crucial parameter is a weight function assigning different weights to blocks according to their hash value. Our framework enables the analysis of different weight functions while proving all statements at the appropriate level of abstraction. This allows us to quickly derive protocol guarantees for different weight functions. We exemplify the usefulness of our framework by capturing the classical Bitcoin protocol as well as exponentially growing functions as special cases. We show the typical properties---chain growth, chain quality and common prefix---for both, and further show that the latter provide an additional guarantee, namely a weak form of optimistic responsiveness. More precisely, we prove for a certain class of exponentially growing weight functions that in periods without corruption, the confirmation time only depends on the unknown actual network delay instead of the known upper bound.

Available format(s)
Category
Cryptographic protocols
Publication info
Published elsewhere. MINOR revision.Latincrypt 2021
Keywords
blockchain
Contact author(s)
kamp @ cs au dk
magri @ cs au dk
cm @ concordium com
jbn @ cs au dk
sethomsen @ cs au dk
dt @ concordium com
History
2021-07-22: last of 2 revisions
See all versions
Short URL
https://ia.cr/2020/328

CC BY

BibTeX

@misc{cryptoeprint:2020/328,
author = {Simon Holmgaard Kamp and Bernardo Magri and Christian Matt and Jesper Buus Nielsen and Søren Eller Thomsen and Daniel Tschudi},
title = {Weight-Based Nakamoto-Style Blockchains},
howpublished = {Cryptology ePrint Archive, Paper 2020/328},
year = {2020},
note = {\url{https://eprint.iacr.org/2020/328}},
url = {https://eprint.iacr.org/2020/328}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.