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），该机制通过纳入区块内在权重，显著降低了区块链的孤块率，同时加速了终局性确认。最终，POEM有助于将区块链理解为一种静态、无关时间顺序的承诺事件序列。