SoK: Preconfirmations

• URL: http://arxiv.org/abs/2510.02947v1
• Date: Fri, 03 Oct 2025 12:41:41 GMT
• Title: SoK: Preconfirmations
• Authors: Aikaterini-Panagiota Stouka, Conor McMenamin, Demetris Kyriacou, Lin Oshitani, Quentin Botha,
• Abstract summary: This article presents a Systematization of Knowledge (SoK) on preconfirmations.<n>We present the core terms and definitions needed to understand preconfirmations, outline a general framework for preconfirmation protocols, and explore the economics and risks of preconfirmations.
• Score: 0.4893345190925178
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In recent years, significant research efforts have focused on improving blockchain throughput and confirmation speeds without compromising security. While decreasing the time it takes for a transaction to be included in the blockchain ledger enhances user experience, a fundamental delay still remains between when a transaction is issued by a user and when its inclusion is confirmed in the blockchain ledger. This delay limits user experience gains through the confirmation uncertainty it brings for users. This inherent delay in conventional blockchain protocols has led to the emergence of preconfirmation protocols -- protocols that provide users with early guarantees of eventual transaction confirmation. This article presents a Systematization of Knowledge (SoK) on preconfirmations. We present the core terms and definitions needed to understand preconfirmations, outline a general framework for preconfirmation protocols, and explore the economics and risks of preconfirmations. Finally, we survey and apply our framework to several implementations of real-world preconfirmation protocols, bridging the gap between theory and practice.

Related papers

• 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)
• Cross-Chain Sealed-Bid Auctions Using Confidential Compute Blockchains [12.944520640892316]
  Sealed-bid auctions ensure fair competition and efficient allocation but are often deployed on centralized infrastructure.<n>Public blockchains eliminate central control, yet their inherent transparency conflicts with the confidentiality required for sealed bidding.<n>We present a sealed-bid auction protocol that executes sensitive bidding logic on a confidential compute blockchain.
  arXiv  Detail & Related papers  (2025-10-22T11:35:51Z)
• Time Tells All: Deanonymization of Blockchain RPC Users with Zero Transaction Fee (Extended Version) [29.846192259039455]
  We propose a novel deanonymization attack that can link an IP address of a RPC user to this user's blockchain pseudonym.<n>By monitoring network traffic and analyzing public ledgers, the attacker can link the IP address of the TCP packet to the pseudonym of the transaction initiator.<n>Our attack achieves a high success rate of over 95% against normal RPC users on various blockchain networks.
  arXiv  Detail & Related papers  (2025-08-29T09:08:16Z)
• Epass: Efficient and Privacy-Preserving Asynchronous Payment on Blockchain [39.093148638790346]
  Buy Now Pay Later (BNPL) is a rapidly proliferating e-commerce model, offering consumers to get the product immediately and defer payments.<n>Emerging blockchain technologies endow BNPL platforms with digital currency transactions, allowing BNPL platforms to integrate with digital wallets.<n>However, the transparency of transactions causes critical privacy concerns because malicious participants may derive consumers' financial statuses from on-chain asynchronous payments.
  arXiv  Detail & Related papers  (2025-06-11T04:32:54Z)
• Zaptos: Towards Optimal Blockchain Latency [52.30047458198369]
  We introduce Zaptos, a parallel pipelined architecture designed to minimize end-to-end latency.<n>Zaptos achieves a throughput of 20,000 transactions per second with sub-second latency.
  arXiv  Detail & Related papers  (2025-01-18T00:22:22Z)
• Validation of the Results of Cross-chain Smart Contract Based on Confirmation Method [0.3807314298073301]
  We propose a method for validating cross-chain smart contract results. Our approach emphasizes consumer blockchain execution of cross-chain smart contracts of producer blockchain. Our verification results highlight the feasibility of cross-chain validation at the smart contract level.
  arXiv  Detail & Related papers  (2024-08-19T13:05:32Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Transaction Fee Estimation in the Bitcoin System [11.065598886291735]
  In the Bitcoin system, transaction fees serve as an incentive for blockchain confirmations. In this work, we focus on estimating the transaction fee for a new transaction to help with its confirmation within a given expected time. We propose a framework FENN, which aims to integrate the knowledge from a wide range of sources, including the transaction itself, into a neural network model in order to estimate a proper transaction fee.
  arXiv  Detail & Related papers  (2024-05-24T07:27:00Z)
• Sequencer Level Security [2.756899615600916]
  We introduce the Sequencer Level Security (SLS) protocol, an enhancement to sequencing protocols of rollups. We describe the mechanics of the protocol for both the transactions submitted to the rollup mempool, as well as transactions originating from Layer one. We implement a prototype of the SLS protocol, Zircuit, which is built on top of Geth and the OP stack.
  arXiv  Detail & Related papers  (2024-05-03T02:47:40Z)
• VELLET: Verifiable Embedded Wallet for Securing Authenticity and Integrity [0.6144680854063939]
  This paper proposes a new protocol to enhance the security of embedded wallets. Our VELLET protocol introduces a wallet verifier that can match the audit trail of embedded wallets on smart contracts.
  arXiv  Detail & Related papers  (2024-04-05T03:23:19Z)
• Transaction Capacity, Security and Latency in Blockchains [35.16231062731263]
  We analyze how secure a block is after the block becomes k-deep, i.e., security-latency, for Nakamoto consensus. We compare our results for Nakamoto consensus under bounded network delay models and obtain analogous bounds for safety violation threshold.
  arXiv  Detail & Related papers  (2024-02-15T17:43:13Z)
• Light Clients for Lazy Blockchains [12.330989180881701]
  We devise a protocol that enables the creation of efficient light clients for lazy blockchains. Our construction is based on a bisection game that traverses the Merkle tree containing the ledger of all - valid or invalid - transactions.
  arXiv  Detail & Related papers  (2022-03-30T00:58:40Z)

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.