最终性计算器：分析和量化Filecoin的最终性保证
The Finality Calculator: Analyzing and Quantifying Filecoin's Finality Guarantees
AI总结：
本文分析Filecoin网络的最终性，提出动态计算区块永久性概率的方法，实现更高效的最终性评估，证明在典型条件下可将错误概率降至2^-30，提升网络性能。
摘要：
本文分析Filecoin网络的最终性，重点关注典型链上区块永久性的动态概率保证。我们的方法不同于仅考虑最坏情况的静态分析，而是通过实时链历史动态计算每轮的错误概率，提供更准确高效的评估。我们提出一个仅需查看诚实参与者生成区块的实用算法，可由客户端或链下应用实现，不改变Filecoin共识机制。我们证明，在典型运行条件下，所需的错误概率2^-30可在约30轮内实现，比网络当前编码的固定阈值900轮提升了30倍。这一发现立即加快了交易速度，提升了Filecoin网络的可用性，并为进一步分析其他DAG结构区块链奠定了基础。
英文摘要：
In this paper, we analyze the finality of the Filecoin network, focusing on dynamic probabilistic guarantees of tipset permanence in the canonical chain. Our approach differs from static analyses that consider only the worst-case scenario; instead, we dynamically compute the error probability at each round using the live chain history, providing a more accurate and efficient assessment. We provide a practical algorithm that only requires visibility into the blocks produced by honest participants, which can be implemented by clients or off-chain applications without any change to Filecoin's consensus mechanisms.We demonstrate that, under typical operating conditions, the sought-after error probability of $2^{-30}$ is achievable in approximately 30 rounds, a 30x improvement over the 900 rounds that the network currently encodes as a fixed threshold. This finding immediately expedites transactions and enhances usability of the Filecoin network, while laying the foundation for further analysis of other DAG-structured blockchains.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
