论文标题
Sotat：没有工作的工作证明可用性和不可预测性
PoSAT: Proof-of-Work Availability and Unpredictability, without the Work
论文作者
论文摘要
工作证明（POW）区块链的一个重要特征是充分的动态可用性，使矿工可以在线和离线上线，同时只需要50％的在线矿工才能诚实。 现有的验证证明（POS），空间证明和相关协议只能部分实现该属性，要么提出一个额外的假设，即从一开始就可以在线进行对手节点，并且不再在线上进行在线，或者使用其他信任假设来实现新加入节点的额外信任假设。我们提出了一个新的POS协议，而无需其他任何动态的posat posat sast，而无需任何动态的positive。该协议基于最长的链，并为块提案彩票使用可验证的延迟函数来提供时间。协议的安全分析借鉴了最近提出的中鼠块技术以及分支随机步行的理论。 ESAT的另一个功能是，即使是获胜者本身，谁将在接下来提出一个障碍的完全不可预测性。这种不可预测性在相同的POW协议级别，并且使用可验证的随机函数的现有POS协议的强度更强。
An important feature of Proof-of-Work (PoW) blockchains is full dynamic availability, allowing miners to go online and offline while requiring only 50% of the online miners to be honest. Existing Proof-of-stake (PoS), Proof-of-Space and related protocols are able to achieve this property only partially, either putting the additional assumption that adversary nodes to be online from the beginning and no new adversary nodes come online afterwards, or use additional trust assumptions for newly joining nodes.We propose a new PoS protocol PoSAT which can provably achieve dynamic availability fully without any additional assumptions. The protocol is based on the longest chain and uses a Verifiable Delay Function for the block proposal lottery to provide an arrow of time. The security analysis of the protocol draws on the recently proposed technique of Nakamoto blocks as well as the theory of branching random walks. An additional feature of PoSAT is the complete unpredictability of who will get to propose a block next, even by the winner itself. This unpredictability is at the same level of PoW protocols, and is stronger than that of existing PoS protocols using Verifiable Random Functions.
