Nakamoto consensus has been incredibly influential in enabling robust blockchain systems, and one of its components is the so-called heaviest chain rule (HCR). Within this rule, the calculation of the weight of the chain tip is performed by adding the difficulty threshold value to the previous total difficulty. Current difficulty based weighting systems do not take the intrinsic block weight into account. This paper studies a new mechanism based on entropy differences, named proof of entropy minima (POEM), which incorporates the intrinsic block weight in a manner that significantly reduces the orphan rate of the blockchain while simultaneously accelerating finalization. Finally, POEM helps to understand blockchain as a static time-independent sequence of committed events.
翻译:Nakamoto 共识在实现强大的区块链系统方面发挥了极大的影响,其中一个组成部分是最重链规则 (HCR)。在这个规则中,链尖重量的计算是通过将难度阈值值加到以前的总难度中进行的。当前基于难度的加权系统不考虑内在的块重量。本文研究了一种基于熵差异的新机制,称为熵极小值证明 (POEM),其以一种显着减少区块链孤块率的方式纳入内在块重量,并同时加速最终确认。最后,POEM 帮助理解区块链作为一系列静态不依赖时间的承诺事件。