Geodesic
On the issue of using “Useful” tasks for proof of works in blockchain
Modelirovanie i analiz informacionnyh sistem, Tome 26 (2019) no. 2, pp. 244-255 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

This paper is a logical continuation of the paper about possible approaches to solving the “Useful Proof-of-work for blockchains” problem. We suggest some alternative ways for searching useful tasks for Proof-of-work systems. These ways are based on the process of the multiple and independent repetition of a simple experiment. The experiment is to chose an element independently and uniformly from a quite large set and then to check if the chosen element has a specific rare property. In the classic blockchain of Bitcoin this experiment is a so-called hash-puzzle. In these terms the process of solving a hash-puzzle may be replaced by searching rare astronomical objects or Go positions with specific conditions. Moreover, we describe a possible attack on the blockchain systems in which the task instance generation algorithm is replaced by the algorithm of selecting the task instance from the existing database with public access for publication of task instances and discuss the way of protection.
Keywords: proof-of-work, blockchain, algorithm. 
@article{MAIS_2019_26_2_a4,
     author = {D. M. Murin and V. N. Knyazev},
     title = {On the issue of using {{\textquotedblleft}Useful{\textquotedblright}} tasks for proof of works in blockchain},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {244--255},
     year = {2019},
     volume = {26},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2019_26_2_a4/}
}
TY  - JOUR
AU  - D. M. Murin
AU  - V. N. Knyazev
TI  - On the issue of using “Useful” tasks for proof of works in blockchain
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2019
SP  - 244
EP  - 255
VL  - 26
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MAIS_2019_26_2_a4/
LA  - ru
ID  - MAIS_2019_26_2_a4
ER  - 
%0 Journal Article
%A D. M. Murin
%A V. N. Knyazev
%T On the issue of using “Useful” tasks for proof of works in blockchain
%J Modelirovanie i analiz informacionnyh sistem
%D 2019
%P 244-255
%V 26
%N 2
%U http://geodesic.mathdoc.fr/item/MAIS_2019_26_2_a4/
%G ru
%F MAIS_2019_26_2_a4
D. M. Murin; V. N. Knyazev. On the issue of using “Useful” tasks for proof of works in blockchain. Modelirovanie i analiz informacionnyh sistem, Tome 26 (2019) no. 2, pp. 244-255. http://geodesic.mathdoc.fr/item/MAIS_2019_26_2_a4/

[1] Durnev V. G., Murin D. M., Sokolov V. A., Chalyy D. Ju., “On Some Approaches to the Solution of the Problem “Useful Proof-of-work for Blockchains””, Modeling and Analysis of Information Systems, 25:4 (2018), 402–410 (in Russian) | MR

[2] Hash Rate. The estimated number of tera hashes per second (trillions of hashes per second) the Bitcoin network is performing, , 2018 https://www.blockchain.com/ru/charts/hash-rate

[3] Hashrate quantity distribution, 2018 (in Russian)

[4] Shannon C., “Programming a Computer for Playing Chess”, The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, 41:314 (1950), 256–275 | DOI | MR | Zbl

[5] Number of legal Go positions, , 2016 https://tromp.github.io/go/legal.html | MR

[6] Nakamoto S., Bitcoin: A Peer-to-Peer Electronic Cash System, , 2008 https://bitcoin.org/bitcoin.pdf

[7] Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan, Proofs of Useful Work, , 2017 https://eprint.iacr.org/2017/203.pdf

[8] Problem 11. Useful Proof-of-work for blockchains, , 2017 https://nsucrypto.nsu.ru/archive/2017/round/2/section/0/task/11/