The Finality Calculator: Analyzing and Quantifying Filecoin's Finality Guarantees
This work addresses the need for more efficient transaction finality in the Filecoin blockchain, which is incremental as it builds on existing consensus mechanisms.
The paper tackles the problem of analyzing finality guarantees in the Filecoin network by dynamically computing error probabilities for tipset permanence, achieving a 30x improvement from 900 to approximately 30 rounds to reach an error probability of 2^{-30} under typical conditions.
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 promises to expedite transactions and enhance network efficiency, and lays the foundation for further analysis of other DAG-structured blockchains.