Difficulty control for blockchain-based consensus systems
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-ra...
Saved in:
Published in | Peer-to-peer networking and applications Vol. 9; no. 2; pp. 397 - 413 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
New York
Springer US
01.03.2016
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | 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. |
---|---|
AbstractList | 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. |
Author | Kraft, Daniel |
Author_xml | – sequence: 1 givenname: Daniel surname: Kraft fullname: Kraft, Daniel email: daniel.kraft@uni-graz.at organization: Institute of Mathematics, NAWI Graz, University of Graz |
BookMark | eNp9kE1LwzAYgINMcJv-AG8FL16iSfO1HmV-wsCLnkOaD-3smpm3he3f21IRGegpgfd5kpdnhiZNbDxC55RcUULUNdCcLBgmVGDCuMK7IzSlBZNYckEmP3een6AZwJoQSZnIp6i4rUKobFe3-8zGpk2xzkJMWVlH-2HfTdXg0oB3wxB8Ax1ksIfWb-AUHQdTgz_7Pufo9f7uZfmIV88PT8ubFbaMFy0OxFNplPfBCZoLRwx3lHLHAuWlc4R7JST3YdHPmTGWBsFKYpxQhTNUBjZHl-O72xQ_Ow-t3lRgfV2bxscONFUFy9lCMdKjFwfoOnap6bfrKZlLxhmXPUVHyqYIkHzQ21RtTNprSvQQU48xdR9TDzH1rnfUgWOr1rTVUMxU9b9mPprQ_9K8-fRrpz-lLzQmi7A |
CitedBy_id | crossref_primary_10_1057_s41302_023_00235_4 crossref_primary_10_32604_cmc_2023_034668 crossref_primary_10_17671_gazibtd_547122 crossref_primary_10_1016_j_array_2022_100225 crossref_primary_10_1016_j_future_2019_07_008 crossref_primary_10_1109_TCCN_2019_2914052 crossref_primary_10_1007_s11280_019_00735_4 crossref_primary_10_1016_j_tele_2018_11_006 crossref_primary_10_1108_MEDAR_11_2018_0406 crossref_primary_10_1186_s13638_022_02130_6 crossref_primary_10_1007_s12083_018_0685_6 crossref_primary_10_1007_s11518_021_5515_3 crossref_primary_10_2478_amns_2021_2_00230 crossref_primary_10_1080_09537287_2022_2058997 crossref_primary_10_1007_s12599_017_0506_0 crossref_primary_10_1002_ett_70087 crossref_primary_10_1016_j_compeleceng_2023_108832 crossref_primary_10_1016_j_compeleceng_2023_108959 crossref_primary_10_1088_1742_6596_1168_3_032080 crossref_primary_10_1016_j_rineng_2024_103825 crossref_primary_10_1088_1757_899X_1110_1_012011 crossref_primary_10_1186_s40561_017_0050_x crossref_primary_10_2139_ssrn_3234933 crossref_primary_10_1587_transfun_2021EAP1099 crossref_primary_10_3389_fbloc_2020_567175 crossref_primary_10_1002_int_22375 crossref_primary_10_4236_jssm_2021_141008 crossref_primary_10_1155_2021_6648012 crossref_primary_10_2139_ssrn_4801113 crossref_primary_10_1007_s12083_021_01102_9 crossref_primary_10_1007_s12083_023_01469_x crossref_primary_10_3390_s22082844 crossref_primary_10_1016_j_jbi_2019_103140 crossref_primary_10_12677_CSA_2018_81011 crossref_primary_10_1007_s12083_020_00895_5 crossref_primary_10_1109_TNET_2023_3244962 crossref_primary_10_1109_TSC_2019_2948010 crossref_primary_10_1051_itmconf_20257402004 crossref_primary_10_1109_JIOT_2021_3123333 crossref_primary_10_1109_ACCESS_2020_3041317 crossref_primary_10_1016_j_ipm_2020_102393 crossref_primary_10_1016_j_comnet_2022_109118 crossref_primary_10_1002_spy2_213 crossref_primary_10_1109_TSUSC_2023_3325881 crossref_primary_10_37467_revhuman_v11_4373 crossref_primary_10_4018_IJITN_299370 crossref_primary_10_1007_s10639_021_10797_5 crossref_primary_10_1088_1742_6596_1948_1_012044 crossref_primary_10_1016_j_suscom_2021_100587 crossref_primary_10_1155_2021_4663147 crossref_primary_10_1016_j_swevo_2021_100891 crossref_primary_10_1080_17517575_2021_1939426 crossref_primary_10_1145_3688813 crossref_primary_10_1155_2021_8851121 crossref_primary_10_1109_TII_2019_2942211 crossref_primary_10_1155_2019_4769870 crossref_primary_10_3390_math11112415 crossref_primary_10_1108_JKM_02_2021_0099 crossref_primary_10_1016_j_engappai_2025_110390 crossref_primary_10_1155_2020_8874862 crossref_primary_10_1016_j_jnca_2020_102635 crossref_primary_10_1108_JIABR_02_2022_0033 crossref_primary_10_1016_j_cor_2021_105365 crossref_primary_10_1109_ACCESS_2021_3050241 crossref_primary_10_1016_j_aej_2020_08_019 crossref_primary_10_1016_j_comcom_2022_06_044 crossref_primary_10_1007_s11042_022_13500_z crossref_primary_10_1109_TII_2019_2922039 crossref_primary_10_1002_cpe_7253 crossref_primary_10_1587_transfun_2020MAI0001 crossref_primary_10_1186_s40854_019_0147_z crossref_primary_10_3390_jrfm14040170 crossref_primary_10_1145_3292384_3292388 crossref_primary_10_1088_1755_1315_645_1_012031 crossref_primary_10_1109_ACCESS_2019_2922442 crossref_primary_10_1186_s13635_021_00122_5 crossref_primary_10_36548_jismac_2020_4_006 crossref_primary_10_1007_s00779_021_01588_3 crossref_primary_10_1007_s42438_019_00091_6 crossref_primary_10_1007_s11704_018_6345_4 crossref_primary_10_1109_LCSYS_2020_3043834 crossref_primary_10_1016_j_segan_2022_100807 crossref_primary_10_1109_ACCESS_2020_3010980 crossref_primary_10_3390_en14248292 crossref_primary_10_1007_s10489_020_01866_2 crossref_primary_10_1007_s11276_020_02345_9 crossref_primary_10_1109_JSYST_2023_3248685 crossref_primary_10_1080_20421338_2019_1624009 crossref_primary_10_1109_TSMC_2018_2854904 crossref_primary_10_1155_2021_3457967 crossref_primary_10_3390_app8101919 crossref_primary_10_1186_s13638_019_1473_6 crossref_primary_10_1515_ajle_2020_0052 crossref_primary_10_23919_cje_2023_00_004 crossref_primary_10_1007_s11277_018_5434_x crossref_primary_10_1016_j_giq_2017_09_007 crossref_primary_10_1587_nolta_13_233 crossref_primary_10_1109_ACCESS_2019_2896108 crossref_primary_10_1109_TPDS_2019_2900238 crossref_primary_10_24193_subbeng_2022_1_12 crossref_primary_10_4018_IJEGR_2018010103 crossref_primary_10_1109_COMST_2022_3204702 crossref_primary_10_4018_JBE_295555 crossref_primary_10_1109_ACCESS_2018_2881953 crossref_primary_10_1109_JSYST_2020_3004468 crossref_primary_10_4018_IJFSA_296593 crossref_primary_10_1002_jsc_2146 crossref_primary_10_4018_IJISP_295868 crossref_primary_10_1109_ACCESS_2022_3181186 crossref_primary_10_1088_1742_6596_2066_1_012016 |
Cites_doi | 10.1007/978-3-662-45472-5_28 10.1016/B978-0-12-415825-2.00002-4 10.1111/j.2517-6161.1955.tb00188.x 10.1109/P2P.2013.6688704 10.1007/978-1-4757-0602-4_18 10.18637/jss.v005.i08 |
ContentType | Journal Article |
Copyright | Springer Science+Business Media New York 2015 Springer Science+Business Media New York 2016 |
Copyright_xml | – notice: Springer Science+Business Media New York 2015 – notice: Springer Science+Business Media New York 2016 |
DBID | AAYXX CITATION 3V. 7SC 7XB 88I 8AL 8AO 8FD 8FE 8FG 8FK 8G5 ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ GUQSH HCIFZ JQ2 K7- L7M L~C L~D M0N M2O M2P MBDVC P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS Q9U |
DOI | 10.1007/s12083-015-0347-x |
DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Research Library ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One Community College ProQuest Central Korea ProQuest Central Student Research Library Prep SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Research Library Science Database Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic |
DatabaseTitle | CrossRef Research Library Prep Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College Research Library (Alumni Edition) ProQuest Pharma Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Research Library ProQuest Central (New) Advanced Technologies Database with Aerospace Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Science Journals (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) |
DatabaseTitleList | Computer and Information Systems Abstracts Research Library Prep |
Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EISSN | 1936-6450 |
EndPage | 413 |
ExternalDocumentID | 3943342451 10_1007_s12083_015_0347_x |
Genre | Feature |
GroupedDBID | -5B -5G -BR -EM -Y2 -~C .4S .86 .DC 06D 0R~ 0VY 123 1N0 203 29O 29~ 2JN 2JY 2KG 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 5VS 67Z 6NX 875 88I 8AO 8FE 8FG 8G5 8TC 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBXA ABDZT ABECU ABFTD ABFTV ABHQN ABJNI ABJOX ABKCH ABMNI ABMQK ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALFXC ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR ANMIH AOCGG ARAPS ARCSS AUKKA AXYYD AYJHY AZQEC B-. BA0 BDATZ BENPR BGLVJ BGNMA BPHCQ CAG CCPQU COF CS3 CSCUP DDRTE DNIVK DPUIP DWQXO EBLON EBS EIOEI EJD ESBYG FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GUQSH GXS H13 HCIFZ HF~ HG5 HG6 HLICF HMJXF HQYDN HRMNR HZ~ I0C IJ- IKXTQ IWAJR IXC IXD IZIGR IZQ I~X J-C J0Z JBSCW JCJTX JZLTJ K6V K7- KOV LLZTM M0N M2O M2P M4Y MA- NPVJJ NQJWS NU0 O9- O93 O9J OAM P62 P9P PQQKQ PROAC PT4 Q2X QOS R89 RIG RLLFE RNS ROL RPX RSV S16 S1Z S27 S3B SAP SDH SEG SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE T13 TH9 TSG TSK TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W48 WK8 YLTOR Z45 Z7X Z83 Z88 ZMTXR ~A9 AAPKM AAYXX ABBRH ABDBE ABFSG ACSTC AEZWR AFDZB AFHIU AFOHR AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT 7SC 7XB 8AL 8FD 8FK ABRTQ JQ2 L7M L~C L~D MBDVC PKEHL PQEST PQGLB PQUKI PRINS Q9U |
ID | FETCH-LOGICAL-c349t-f0e16a7eefd5125d0a4d114d3f14bdd04e7564ef8fd53aac1f53b0ad579da16f3 |
IEDL.DBID | U2A |
ISSN | 1936-6442 |
IngestDate | Fri Jul 11 11:48:58 EDT 2025 Fri Jul 25 09:43:54 EDT 2025 Thu Apr 24 23:02:50 EDT 2025 Tue Jul 01 01:29:09 EDT 2025 Fri Feb 21 02:34:37 EST 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 2 |
Keywords | Namecoin Bitcoin mining Poisson process Crypto-currency Nakamoto blockchain |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c349t-f0e16a7eefd5125d0a4d114d3f14bdd04e7564ef8fd53aac1f53b0ad579da16f3 |
Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
PQID | 1762634346 |
PQPubID | 54523 |
PageCount | 17 |
ParticipantIDs | proquest_miscellaneous_1793238730 proquest_journals_1762634346 crossref_primary_10_1007_s12083_015_0347_x crossref_citationtrail_10_1007_s12083_015_0347_x springer_journals_10_1007_s12083_015_0347_x |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 20160300 2016-3-00 20160301 |
PublicationDateYYYYMMDD | 2016-03-01 |
PublicationDate_xml | – month: 3 year: 2016 text: 20160300 |
PublicationDecade | 2010 |
PublicationPlace | New York |
PublicationPlace_xml | – name: New York – name: Norwell |
PublicationTitle | Peer-to-peer networking and applications |
PublicationTitleAbbrev | Peer-to-Peer Netw. Appl |
PublicationYear | 2016 |
Publisher | Springer US Springer Nature B.V |
Publisher_xml | – name: Springer US – name: Springer Nature B.V |
References | Eyal I, Sirer E G (2014) Majority is not enough: Bitcoin mining is vulnerable. In: 18th international conference on financial cryptography and data security. Barbados Antonopoulos AM (2014) Mastering Bitcoin: unlocking digital cryptocurrencies. O’Reilly Media Evans LC, Gariepy R F (1992) Measure theory and fine properties of functions. Studies in advanced mathematics. CRC Press Moore GE (1965) Cramming more components onto integrated circuits. Electron Mag Eaton JW, Bateman D, Hauberg S (2009) GNU Octave version 3.0.1 manual: a high-level interactive language for numerical computations. CreateSpace independent publishing platform. https://www.gnu.org/software/octave/doc/interpreter. ISBN 1441413006 Marsaglia G, Tsang WW (2000) The Ziggurat method for generating random variables. J Stat Softw 5 Ross S M (2013) Simulation, 5th edn. Academic Press Wilcox-O’Hearn Z Names: decentralized, secure, human-meaningful: choose two NIST digital library of mathematical functions. http://dlmf.nist.gov/, Release 1.0.9 of 2014-08-29. Online companion to [15] Chaum D (1983) Blind signatures for untraceable payments. In: Advances in cryptology proceedings, vol 82, pp 199–203 Nakamoto S Bitcoin: A peer-to-peer electronic cash system. https://bitcoin.org/bitcoin.pdf Bahack L (2013) Theoretical Bitcoin attacks with less than half of the computational power. arXiv: 1312.7013 Shomer A (2014) On the phase space of block-hiding strategies. Cryptology ePrint Archive, Report 2014/139. http://eprint.iacr.org Back A A partial hash collision based postage scheme. http://www.hashcash.org/papers/announce.txt Decker C, Wattenhofer R (2013) Information Propagation in the Bitcoin Network. In: Proceedings of the 13-th IEEE international conference on peer-to-peer computing OlverFWJLozierDWBoisvertRFClarkCWNIST handbook of mathematical functions2010New YorkCambridge University Press1198.00002Print companion to [8] Namecoin. https://www.namecoin.org Swartz A (2011) Squaring the triangle: secure, decentralized, human-readable names Rosenfeld M (2014) Analysis of hashrate-based double spending. arXiv: http://arxiv.org/abs/1402.2009 CoxDRSome statistical methods connected with series of eventsJ Royal Stat Soc Ser B19551721291570067.37403 347_CR20 347_CR10 347_CR16 347_CR17 347_CR18 347_CR9 347_CR11 DR Cox (347_CR6) 1955; 17 347_CR8 347_CR12 347_CR13 347_CR14 (347_CR15) 2010 347_CR5 347_CR4 347_CR7 347_CR1 347_CR19 347_CR3 347_CR2 |
References_xml | – reference: Eaton JW, Bateman D, Hauberg S (2009) GNU Octave version 3.0.1 manual: a high-level interactive language for numerical computations. CreateSpace independent publishing platform. https://www.gnu.org/software/octave/doc/interpreter. ISBN 1441413006 – reference: Marsaglia G, Tsang WW (2000) The Ziggurat method for generating random variables. J Stat Softw 5 – reference: Wilcox-O’Hearn Z Names: decentralized, secure, human-meaningful: choose two – reference: Decker C, Wattenhofer R (2013) Information Propagation in the Bitcoin Network. In: Proceedings of the 13-th IEEE international conference on peer-to-peer computing – reference: Swartz A (2011) Squaring the triangle: secure, decentralized, human-readable names – reference: Back A A partial hash collision based postage scheme. http://www.hashcash.org/papers/announce.txt – reference: Eyal I, Sirer E G (2014) Majority is not enough: Bitcoin mining is vulnerable. In: 18th international conference on financial cryptography and data security. Barbados – reference: Bahack L (2013) Theoretical Bitcoin attacks with less than half of the computational power. arXiv: 1312.7013 – reference: CoxDRSome statistical methods connected with series of eventsJ Royal Stat Soc Ser B19551721291570067.37403 – reference: Evans LC, Gariepy R F (1992) Measure theory and fine properties of functions. Studies in advanced mathematics. CRC Press – reference: Nakamoto S Bitcoin: A peer-to-peer electronic cash system. https://bitcoin.org/bitcoin.pdf – reference: Namecoin. https://www.namecoin.org/ – reference: OlverFWJLozierDWBoisvertRFClarkCWNIST handbook of mathematical functions2010New YorkCambridge University Press1198.00002Print companion to [8] – reference: Antonopoulos AM (2014) Mastering Bitcoin: unlocking digital cryptocurrencies. O’Reilly Media – reference: Ross S M (2013) Simulation, 5th edn. Academic Press – reference: Shomer A (2014) On the phase space of block-hiding strategies. Cryptology ePrint Archive, Report 2014/139. http://eprint.iacr.org/ – reference: Chaum D (1983) Blind signatures for untraceable payments. In: Advances in cryptology proceedings, vol 82, pp 199–203 – reference: NIST digital library of mathematical functions. http://dlmf.nist.gov/, Release 1.0.9 of 2014-08-29. Online companion to [15] – reference: Moore GE (1965) Cramming more components onto integrated circuits. Electron Mag – reference: Rosenfeld M (2014) Analysis of hashrate-based double spending. arXiv: http://arxiv.org/abs/1402.2009 – ident: 347_CR11 doi: 10.1007/978-3-662-45472-5_28 – ident: 347_CR9 – ident: 347_CR8 – ident: 347_CR17 doi: 10.1016/B978-0-12-415825-2.00002-4 – volume: 17 start-page: 129 issue: 2 year: 1955 ident: 347_CR6 publication-title: J Royal Stat Soc Ser B doi: 10.1111/j.2517-6161.1955.tb00188.x – ident: 347_CR19 – ident: 347_CR18 – ident: 347_CR14 – ident: 347_CR1 – ident: 347_CR7 doi: 10.1109/P2P.2013.6688704 – ident: 347_CR13 – volume-title: NIST handbook of mathematical functions year: 2010 ident: 347_CR15 – ident: 347_CR16 – ident: 347_CR3 – ident: 347_CR2 – ident: 347_CR10 – ident: 347_CR4 – ident: 347_CR5 doi: 10.1007/978-1-4757-0602-4_18 – ident: 347_CR20 – ident: 347_CR12 doi: 10.18637/jss.v005.i08 |
SSID | ssj0061352 |
Score | 2.4875746 |
Snippet | 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... 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... |
SourceID | proquest crossref springer |
SourceType | Aggregation Database Enrichment Source Index Database Publisher |
StartPage | 397 |
SubjectTerms | Blocking Communications Engineering Computer Communication Networks Control systems Currencies Digital currencies Engineering Information Systems and Communication Service Mathematical models Mining Names Networks Peer to peer computing Signal,Image and Speech Processing Simulation |
SummonAdditionalLinks | – databaseName: ProQuest Central dbid: BENPR link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LSwMxEB60vehBfGK1ygqelODu5rG7J_HRUgSLiIXeluwmi6C01W2h_ntn2mxbBT0n-2CSzPdNJvkG4FzlikRLLIsyIZiQsWXahAmTJtOByBGELN13fuyqTk889GXfbbiV7lhl5RNnjtoMc9ojvwoi0k0RXKjr0QejqlGUXXUlNNahji44jmtQv211n54rX4xYNau5gyxFMUT-sMprzi7PhUg_MJSWzOciYtOfyLSkm78ypDPgaW_DlmOM3s18iHdgzQ52YXNFR3APknvaeSERjS_PnT33kIx6GSLVW_6KwT8jtDLUWFJti9KbKziX-9Brt17uOszVRGA5F8mYFb4NlI6sLQxCtTS-FgZDGsOLQGTG-MJGUglbxNjOtc6DQvLM10ZGidGBKvgB1AbDgT0ETwYco6UwJ44jqE4frmUeJTaMAxkbIRvgV_ZIcycYTnUr3tOl1DGZMEUTpmTCdNqAi8Ujo7laxn-dm5WRU7dwynQ5zA04WzTjlKc8hh7Y4YT6IOnEf-d-Ay6rwVl5xV8fPPr_g8ewgWxIzQ-YNaE2_pzYE2Qc4-zUTatvFd_RWw priority: 102 providerName: ProQuest |
Title | Difficulty control for blockchain-based consensus systems |
URI | https://link.springer.com/article/10.1007/s12083-015-0347-x https://www.proquest.com/docview/1762634346 https://www.proquest.com/docview/1793238730 |
Volume | 9 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB50vehBfGJ1XSp4UgJt82h7XHVX8YWoC3oqaZMiKF2xu6D_3plu66qo4CmHpGmZPL5vOsk3ALsqUyRaYlmYCsGEjCzTJoiZNKn2RYYgZOm-88WlOhmI0zt5V9_jLpvT7k1Istqpp5fdAqQL6PpK5nERMiSOcxJddzrHNQi6zfaL8FSl2UFiohiCfdCEMn_q4isYTRnmt6BohTX9JVisSaLbnYzqMszYYgUWPkkHrkJ8RD9bSDfjza2Pm7vIP90Uwekxe0B_nxFAGaosKZ1F6U5Em8s1GPR7t4cnrE6DwDIu4hHLPesrHVqbG0RnaTwtDHoxhue-SI3xhA2lEjaPsJ5rnfm55KmnjQxjo32V83VoFcPCboArfY4OUpARrRGUmg-XLw9jG0S-jIyQDniNPZKs1ginVBVPyVTdmEyYoAkTMmHy6sDexyPPE4GMvxq3GyMn9VopEz8kRRzBhXJg56MaZzmFLnRhh2NqgzwTv517Duw3g_Opi99euPmv1lswj3xITY6YtaE1ehnbbeQco7QDs1H_uANz3aOL8xsqj-_Pelge9C6vrjvVDHwHGLfSoA |
linkProvider | Springer Nature |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LLwRBEK54HHAQz1gWI-FCOmamH7NzEBGs9TyRuI2e6Z4QMotZYf-U36hqHhYJN-fu6Z5UV1d93dX1FcC6ShSRllgWxEIwIVuWaeOHTJpYeyJBJ2Qp3_n8QnWuxMm1vB6C9zoXhp5V1jaxMNSmm9Ad-bYXEG-K4ELtPj4xqhpF0dW6hEapFqe2_4pHtnzn-ADXd8P324eX-x1WVRVgCRdhj6Wu9ZQOrE0NOjtpXC0MHgoMTz0RG-MKG0glbNrCdq514qWSx642MgiN9lTKcdxhGBUcPTllprePasuPnrGo8IOYSDHEGX4dRS1S9XwEO3hwl8zlImBv3_3gANz-iMcWbq49BZMVPnX2SoWahiGbzcDEF9bCWQgP6J6HKDv6TvXS3UHo68ToF--TW32XMfKNhhpzqqSROyVfdD4HV_8iq3kYybqZXQBHehzPZn5CiEpQVUC0HDwIrd_yZMsI2QC3lkeUVPTkVCXjIRoQK5MIIxRhRCKM3hqw-fnJY8nN8VfnZi3kqNqmeTRQqgasfTbjBqOoic5s94X6IMTFf-duA7bqxfkyxG8TLv494SqMdS7Pz6Kz44vTJRhHHKbKp21NGOk9v9hlxDq9eKVQMAdu_lujPwA5Pg7O |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LS8QwEB50BdGD-MT1WUEvSrBtHt0eRNR18bmIKHiraZOiKF21K-pf89c5s21dFfTmOWlSJpPMN5nJNwCrKlFEWmJZEAvBhGxYpo0fMmli7YkEjZCl986nbXVwKY6u5NUAvFdvYSitsjoTewe16SR0R77pBcSbIrhQm2mZFnHWbG0_PDKqIEWR1qqcRqEix_btBd23fOuwiWu95vut_Yu9A1ZWGGAJF2GXpa71lA6sTQ0aPmlcLQw6CIannoiNcYUNpBI2bWA71zrxUsljVxsZhEZ7KuU47iAMBeQV1WBod799dl7ZAbSTvXo_iJAUQ9ThVzHV3sM9H6EPuvGSuVwE7PW7VexD3R_R2Z7Ra43DWIlWnZ1CvSZgwGaTMPqFw3AKwibd-hCBx5tT5r07CISdGK3kXXKjbzNGltJQY051NXKnYI_Op-HyX6Q1A7Wsk9lZcKTH0VPzE8JXgmoE4jnCg9D6DU82jJB1cCt5RElJVk41M-6jPs0yiTBCEUYkwui1DuufnzwUTB1_dV6ohByVmzaP-ipWh5XPZtxuFEPRme08Ux8EvPjv3K3DRrU4X4b4bcK5vydchmHU5ujksH08DyMIylSR57YAte7Ts11E4NONl0oNc-D6v5X6A1ylFGA |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Difficulty+control+for+blockchain-based+consensus+systems&rft.jtitle=Peer-to-peer+networking+and+applications&rft.au=Kraft%2C+Daniel&rft.date=2016-03-01&rft.pub=Springer+US&rft.issn=1936-6442&rft.eissn=1936-6450&rft.volume=9&rft.issue=2&rft.spage=397&rft.epage=413&rft_id=info:doi/10.1007%2Fs12083-015-0347-x&rft.externalDocID=10_1007_s12083_015_0347_x |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1936-6442&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1936-6442&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1936-6442&client=summon |