Abstract

This paper logically continues the paper about possible approaches to solving the “useful proof-of-work for blockchains” problem. We propose some alternative lines of searching for useful tasks for proof-of-work. These approaches are based on a fact that solving the hash puzzle is close to the multiple and independent repetition of the following experiment: assume that there is a fairly large set defined (for example, consisting of 2ⁿ elements for a fairly high n), and only a minor portion of the elements have a certain property. The experiment consists in uniformly choosing an element from this set and then checking whether this element has the indicated property. Thus the hash puzzle solution process can be replaced, for example, with searching for rare astronomical objects or positions in a game of Go that meet certain conditions. Moreover, we describe a possible attack against the blockchain system in which the task instance generation algorithm is replaced with the algorithm of choosing instances from the available database by unscrupulous task instance suppliers in case of their public collection. In addition, some ways of protecting against this attack are discussed.

中文翻译：

---

使用有用的任务进行区块链系统的工作量证明

摘要

从逻辑上讲，本文继续探讨解决“区块链有用的工作量证明”问题的可行方法的论文。我们提出了一些替代的方法来搜索有用的任务以进行工作量证明。这些方法是基于一个事实，即解决散列难题是靠近多和下面的实验的独立重复：假定有定义（例如一个相当大的集合，由2个^Ñ元件在相当高Ñ），并且只有一小部分元素具有特定属性。实验包括从该集合中均匀选择一个元素，然后检查该元素是否具有指定的属性。因此，例如，可以通过在满足特定条件的围棋游戏中搜索稀有的天文物体或位置来代替哈希拼图解决方案过程。此外，我们描述了针对区块链系统的一种可能的攻击，其中不道德的任务实例提供者在公开收集的情况下，将任务实例生成算法替换为从可用数据库中选择实例的算法。此外，还讨论了一些防止这种攻击的方法。