Analysis of variance of graph-clique mining for scalable proof of work

DOI10.1007/978-3-030-14234-6_6MaRDI QIDQ2331941zbMATH OpenOpenAlexFDO

Authors Hiroaki Anada, Tomohiro Matsushima, Weizhi Meng, Junpei Kawamoto, Samiran Bag, Kouichi Sakurai, Chun-hua Su

Publication date 31 October 2019

Full work available at URL https://backend.orbit.dtu.dk/ws/files/240388983/64.pdf

zbMATH Keywords

Bitcoinblockchaingraph-clique miningmining competitionproof of work

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On the application of clique problem for proof-of-work in cryptocurrencies
• The Bitcoin backbone protocol with chains of variable difficulty
• Ignore the extra zeroes: variance-optimal mining pools
• Modeling and analysis of block arrival times in the Bitcoin blockchain
• Socially optimal mining pools

Cited in

(1)

• On the application of clique problem for proof-of-work in cryptocurrencies

This page was built for publication: Analysis of variance of graph-clique mining for scalable proof of work

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331941)