Difficulty control for blockchain-based consensus systems

被引:173
作者
Kraft, Daniel [1 ]
机构
[1] Graz Univ, NAWI Graz, Inst Math, Univ Pl 3, A-8010 Graz, Austria
基金
奥地利科学基金会;
关键词
Crypto-currency; Bitcoin mining; Namecoin; Nakamoto blockchain; Poisson process;
D O I
10.1007/s12083-015-0347-x
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Crypto-currencies like Bitcoin have recently attracted a lot of interest. A crucial ingredient into such systems is the "mining" of a Nakamoto blockchain. We model mining as a Poisson process with time-dependent intensity and use this model to derive predictions about block times for various hash-rate scenarios (exponentially rising hash rate being the most important). We also analyse Bitcoin's method to update the "network difficulty" as a mechanism to keep block times stable. Since it yields systematically too fast blocks for exponential hash-rate growth, we propose a new method to update difficulty. Our proposed method performs much better at ensuring stable average block times over longer periods of time, which we verify both in simulations of artificial growth scenarios and with real-world data. Besides Bitcoin itself, this has practical benefits particularly for systems like Namecoin. It can be used to make name expiration times more predictable, preventing accidental loss of names.
引用
收藏
页码:397 / 413
页数:17
相关论文
共 15 条
[1]  
[Anonymous], 2010, Handbook of Mathematical Functions
[2]  
[Anonymous], ADV CRYPTOLOGY CRYPT
[3]  
Antonopoulos A. M., 2014, Mastering Bitcoin: Unlocking Digital Cryptocurrencies
[4]  
Bahack L., 2013, arXiv:1312.7013
[5]  
COX DR, 1955, J ROY STAT SOC B, V17, P129
[6]  
Decker Christian, 2013, P 13 IEEE INT C PEER
[7]  
Eaton J.W., 2009, GNU Octave version 3.0.1 manual: a high-level interactive language for numerical computations
[8]  
EYAL I, 2014, 18 INT C FIN CRYPT D
[9]  
Gariepy RF., 1992, MEASURE THEORY FINE
[10]  
Marsaglia G., 2000, Journal of Statistical Soft- ware, V5