SoK: Speedy Secure Finality

• URL: http://arxiv.org/abs/2512.20715v1
• Date: Tue, 23 Dec 2025 19:25:02 GMT
• Title: SoK: Speedy Secure Finality
• Authors: Yash Saraswat, Abhimanyu Nag,
• Abstract summary: This paper surveys the state of the art in fast finality protocol design.<n>We introduce the core theoretical primitives underlying this space.<n>We then analyze the communication and aggregation bottlenecks faced by single-slot finality protocols.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: While Ethereum has successfully achieved dynamic availability together with safety, a fundamental delay remains between transaction execution and immutable finality. In Ethereum's current Gasper protocol, this latency is on the order of 15 minutes, exposing the network to ex ante reorganization attacks, enabling MEV extraction, and limiting the efficiency of economic settlement. These limitations have motivated a growing body of work on Speedy Secure Finality (SSF), which aims to minimize confirmation latency without weakening formal security guarantees. This paper surveys the state of the art in fast finality protocol design. We introduce the core theoretical primitives underlying this space, including reorganization resilience and the generalized sleepy model, and trace their development from Goldfish to RLMD-GHOST. We then analyze the communication and aggregation bottlenecks faced by single-slot finality protocols in large validator settings. Finally, we survey the 3-slot finality (3SF) protocol as a practical synthesis that balances fast finality with the engineering constraints of the Ethereum network.

Related papers

• RAIN: Secure and Robust Aggregation under Shuffle Model of Differential Privacy [46.52109845749167]
  We present Robust Aggregation in Noise (RAIN), a framework that reconciles privacy, robustness, and verifiability under Shuffle-DP.<n>RAIN adopts sign-space aggregation to robustly measure update consistency and limit malicious influence under noise and anonymization.<n>We show that RAIN maintains strong privacy guarantees under Shuffle-DP and remains robust to poisoning attacks with negligible degradation in accuracy and convergence.
  arXiv  Detail & Related papers  (2026-03-03T15:41:54Z)
• Sedna: Sharding transactions in multiple concurrent proposer blockchains [42.71280924071485]
  We present Sedna, a user-facing protocol that replaces naive transaction replication with verifiable, rateless coding.<n>We prove Sedna guarantees liveness and emphuntil-decode privacy, significantly reducing MEV exposure.
  arXiv  Detail & Related papers  (2025-12-18T20:12:55Z)
• QADR: A Scalable, Quantum-Resistant Protocol for Anonymous Data Reporting [0.0]
  The security of future large-scale IoT networks is critically threatened by the Harvest Now, Decrypt Later'' attack paradigm.<n>This paper introduces the Quantum Anonymous Data Reporting protocol, a hybrid framework that provides a theoretical benchmark and high-performance architecture for this challenge.<n>We prove the protocol's critical advantage as a performance benchmark, establishing a high-performance goal for future quantum-secured anonymity systems.
  arXiv  Detail & Related papers  (2025-11-19T09:37:19Z)
• Universally Composable Termination Analysis of Tendermint [3.6181225888186055]
  This paper presents the first universally composable (UC) security analysis of Tendermint.<n>It demonstrates its resilience against strategic message-delay attacks.<n>Our main result proves that the Tendermint protocol UC-realizes the ideal Tendermint model.
  arXiv  Detail & Related papers  (2025-10-01T16:44:23Z)
• Odontoceti: Ultra-Fast DAG Consensus with Two Round Commitment [0.0]
  Odontoceti is the latest in DAG-based consensus, operating with a 20% fault tolerance instead of the established 33% level.<n>It is the first DAG-based protocol to achieve commitment in just two communication rounds, delivering median latency of 300 milliseconds.<n>This paper establishes the practical viability of lower fault tolerance consensus protocols for blockchains.
  arXiv  Detail & Related papers  (2025-09-19T15:22:28Z)
• Secure and Scalable Face Retrieval via Cancelable Product Quantization [48.58859061524146]
  homomorphic encryption (HE) offers strong security guarantees by enabling arithmetic computations in the cipher space.<n>We propose Cancelable Product Quantization, a highly efficient framework for secure face representation retrieval.
  arXiv  Detail & Related papers  (2025-08-31T10:19:55Z)
• Voting-Based Semi-Parallel Proof-of-Work Protocol [45.776687601070705]
  We first consider the existing parallel PoW protocols and develop hard-coded incentive attack structures.<n>We introduce a voting-based semi-parallel PoW protocol that outperforms both Nakamoto consensus and the existing parallel PoW protocols.
  arXiv  Detail & Related papers  (2025-08-08T17:57:35Z)
• Commit-Reveal$^2$: Securing Randomness Beacons with Randomized Reveal Order in Smart Contracts [25.885166716453153]
  We present Commit-Reveal$2$, a layered design for blockchain deployments that cryptographically randomizes the final reveal order.<n>The protocol is architected as a hybrid system, where routine coordination runs off chain for efficiency.<n>We release a publicly verifiable prototype and evaluation artifacts to support replication and adoption in blockchain applications.
  arXiv  Detail & Related papers  (2025-04-04T21:05:51Z)
• Application of $α$-order Information Metrics for Secure Communication in Quantum Physical Layer Design [45.41082277680607]
  We study the $alpha$-order information-theoretic metrics based on R'enyi entropy.<n>We apply our framework to a practical scenario involving BPSK modulation over a lossy bosonic channel.
  arXiv  Detail & Related papers  (2025-02-07T03:44:11Z)
• Your Trust, Your Terms: A General Paradigm for Near-Instant Cross-Chain Transfer [26.61748905524824]
  We introduce the Delegated Ownership Transfer (DOT) paradigm to enable secure, high-performance cross-chain payments.<n>DOT decouples key ownership from value ownership to enable secure, high-performance cross-chain payments.<n>Our prototype shows that cross-chain payments complete in under 16.70 ms and atomic swaps in under 33.09 ms, with costs fully decoupled from Layer-1 gas fees.
  arXiv  Detail & Related papers  (2024-03-22T13:21:09Z)
• Transaction Capacity, Security and Latency in Blockchains [45.776687601070705]
  We analyze how secure a block is after the block becomes $k$-deep, i.e., security-latency, for Nakamoto consensus.<n>We connect the security-latency analysis to sustainable transaction rate of the queue system.
  arXiv  Detail & Related papers  (2024-02-15T17:43:13Z)
• A Survey and Comparative Analysis of Security Properties of CAN Authentication Protocols [92.81385447582882]
  The Controller Area Network (CAN) bus leaves in-vehicle communications inherently non-secure. This paper reviews and compares the 15 most prominent authentication protocols for the CAN bus. We evaluate protocols based on essential operational criteria that contribute to ease of implementation.
  arXiv  Detail & Related papers  (2024-01-19T14:52:04Z)
• Short Paper: Accountable Safety Implies Finality [10.589723476970443]
  Two key desiderata have been studied for Byzantine-fault tolerant (BFT) state-machine replication (SMR) consensus protocols. We show that accountable safety implies finality, thereby unifying earlier results.
  arXiv  Detail & Related papers  (2023-08-31T17:58:38Z)
• Resilient Output Consensus Control of Heterogeneous Multi-agent Systems against Byzantine Attacks: A Twin Layer Approach [23.824617731137877]
  We study the problem of cooperative control of heterogeneous multi-agent systems (MASs) against Byzantine attacks. Inspired by the concept of Digital Twin, a new hierarchical protocol equipped with a virtual twin layer (TL) is proposed.
  arXiv  Detail & Related papers  (2023-03-22T18:23:21Z)
• Finite-Size Security for Discrete-Modulated Continuous-Variable Quantum Key Distribution Protocols [4.58733012283457]
  We present a composable finite-size security proof against independently and identically distributed collective attacks for a general DM CV-QKD protocol. We extend and apply a numerical security proof technique to calculate tight lower bounds on the secure key rate. Results show that our security proof method yields secure finitesize key rates under experimentally viable conditions up to at least 72km transmission distance.
  arXiv  Detail & Related papers  (2023-01-20T17:16:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.