In this paper, we introduce a new fraud-proof algorithm that offers an unprecedented combination of decentralization, security, and liveness. The resources that must be mobilized by an honest participant to defeat an adversary grow only logarithmically with what the adversary ultimately loses. As a consequence, there is no need to introduce high bonds that prevent an adversary from creating too many Sybils. This makes the system very inclusive and frees participants from having to pool resources among themselves to engage the protocol. Finally, the maximum delay to finalization also grows only logarithmically with total adversarial expenditure, with the smallest multiplicative factor to date. In summary: the entire dispute completes in 2--5 challenge periods, the only way to break consensus is to censor the honest party for more than one challenge period, and the costs of engaging in the dispute are minimal.

翻译：本文提出了一种新的欺诈证明算法，该算法实现了去中心化、安全性与活跃性前所未有的结合。诚实参与者为击败对手所需调动的资源仅随对手最终损失呈对数增长。因此，无需引入高额保证金来防止对手创建过多女巫攻击节点。这使得系统具有高度包容性，参与者无需为参与协议而自行汇集资源。最后，最终确认的最大延迟也仅随对手总支出呈对数增长，且具有迄今最小的乘法因子。总而言之：整个争议过程在2-5个挑战周期内完成，打破共识的唯一方式是审查诚实方超过一个挑战周期，且参与争议的成本极低。