Strategic Users in a Priority Queue with Bulk Service on Blockchains

• URL: http://arxiv.org/abs/2606.01274v1
• Date: Sun, 31 May 2026 14:57:23 GMT
• Title: Strategic Users in a Priority Queue with Bulk Service on Blockchains
• Abstract summary: This paper analyzes transaction fees on blockchains by considering that they form a priority queue and users play a queueing game.<n>We derive semi-closed form expressions for steady-state quantities and extend the relationship between user delay costs and transaction fees to general block generation times.<n>Cross-chain analysis across Bitcoin, Dogecoin, and Litecoin reveals similarities in normalized cost structures.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper analyzes transaction fees on blockchains by considering that they form a priority queue and users play a queueing game. Using an M/G^K/1 priority queue model, we provide new insights into the dynamics governing transaction fees and their impact on user behavior. We derive semi-closed form expressions for steady-state quantities and extend the relationship between user delay costs and transaction fees to general block generation times. We apply the model to the Bitcoin network and simulate user responses under various scenarios. Cross-chain analysis across Bitcoin, Dogecoin, and Litecoin reveals similarities in normalized cost structures.

Related papers

• Blockchain Transaction Simulation Phishing [41.25322759036545]
  We present the first comprehensive study of transaction simulation phishing.<n>We detect over 4,000 phishing contracts deployed between August 2024 and June 2025.<n>Our analysis identifies more than 5,700 victims and approximately $3.48 million USD in losses, 91.5% of which occurred on clustering.
  arXiv  Detail & Related papers  (2026-07-30T18:09:56Z)
• A Model and Estimation of the Bitcoin Transaction Fee [0.0]
  We estimate a structural model of Bitcoin fee choice that treats the mempool as a market for scarce blockspace.<n>We characterize the fee market as a Vickery-Clarke-Groves mechanism and derive an equation to estimate fees.
  arXiv  Detail & Related papers  (2026-04-19T00:56:35Z)
• 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)
• BlockScan: Detecting Anomalies in Blockchain Transactions [16.73896087813861]
  BlockScan is a customized Transformer for anomaly detection in blockchain transactions.<n>This work sets a new benchmark for applying Transformer-based approaches in blockchain data analysis.
  arXiv  Detail & Related papers  (2024-10-05T05:11:34Z)
• T-Watch: Towards Timed Execution of Private Transaction in Blockchains [3.3887950601672086]
  This paper proposes T-Watch, a decentralized and cost-efficient approach for users to schedule timed execution of transactions. To protect the private elements of a scheduled transaction from getting disclosed before the future time-frame, T-Watch maintains shares of the decryption key of the scheduled transaction. To reduce the cost of smart contract execution in T-Watch, we carefully design the proposed protocol to run in an optimistic mode by default and then switch to a pessimistic mode once misbehaviors occur.
  arXiv  Detail & Related papers  (2024-05-14T01:58:32Z)
• 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)
• PTTS: Zero-Knowledge Proof-based Private Token Transfer System on Ethereum Blockchain and its Network Flow Based Balance Range Privacy Attack Analysis [0.0]
  We propose a Private Token Transfer System (PTTS) for the public blockchain. For the proposed framework, zero-knowledge based protocol has been designed using Zokrates and integrated into our private token smart contract. In the second part of the paper, we provide security and privacy analysis including the replay attack and the balance range privacy attack.
  arXiv  Detail & Related papers  (2023-08-29T09:13:31Z)
• Temporal and Geographical Analysis of Real Economic Activities in the Bitcoin Blockchain [0.7874708385247353]
  We study the real economic activity in the Bitcoin blockchain that involves transactions from/to retail users rather than between organizations. We show that most real transactions involve Frequent Receivers, representing a small fraction of the total value exchanged according to the blockchain. We also conduct a weekly pattern analysis of activity, providing insights into the geographical location of Bitcoin users.
  arXiv  Detail & Related papers  (2023-07-17T16:30:56Z)
• Blockchain Large Language Models [65.7726590159576]
  This paper presents a dynamic, real-time approach to detecting anomalous blockchain transactions. The proposed tool, BlockGPT, generates tracing representations of blockchain activity and trains from scratch a large language model to act as a real-time Intrusion Detection System.
  arXiv  Detail & Related papers  (2023-04-25T11:56:18Z)
• TxAllo: Dynamic Transaction Allocation in Sharded Blockchain Systems [37.22526235663589]
  This paper focuses on the transaction allocation problem to reduce the number of cross-shard transactions. A deterministic and fast allocation scheme TxAllo is proposed to dynamically infer the allocation of accounts. For a blockchain with 60 shards, TxAllo reduces the cross-shard transaction ratio from 98% to about 12%.
  arXiv  Detail & Related papers  (2022-12-22T10:22:31Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)

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.