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.
翻译:中本共识在扶持稳健的连锁系统方面影响极大,其组成部分之一是所谓的 " 最重链规则 " (HCR)。在这一规则中,对链端重量的计算是通过将困难临界值加到先前的总困难中来进行的。目前基于困难的加权系统没有考虑到固有的块积重量。本文研究一种基于恒温差异的新机制,称为 " 微粒 " 证明,它包含固有的块积重量,从而大大降低链端的孤儿比率,同时加速最终完成。最后,POEM帮助理解块链是一固定的、时间独立的一系列已决事件。</s>