Transaction Fee Estimation in the Bitcoin System

• URL: http://arxiv.org/abs/2405.15293v1
• Date: Fri, 24 May 2024 07:27:00 GMT
• Title: Transaction Fee Estimation in the Bitcoin System
• Authors: Limeng Zhang, Rui Zhou, Qing Liu, Chengfei Liu, M. Ali Babar,
• Abstract summary: 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.
• Score: 11.065598886291735
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: In the Bitcoin system, transaction fees serve as an incentive for blockchain confirmations. In general, a transaction with a higher fee is likely to be included in the next block mined, whereas a transaction with a smaller fee or no fee may be delayed or never processed at all. However, the transaction fee needs to be specified when submitting a transaction and almost cannot be altered thereafter. Hence it is indispensable to help a client set a reasonable fee, as a higher fee incurs over-spending and a lower fee could delay the confirmation. 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 identify two major drawbacks in the existing works. First, the current industry products are built on explicit analytical models, ignoring the complex interactions of different factors which could be better captured by machine learning based methods; Second, all of the existing works utilize limited knowledge for the estimation which hinders the potential of further improving the estimation quality. As a result, we propose a framework FENN, which aims to integrate the knowledge from a wide range of sources, including the transaction itself, unconfirmed transactions in the mempool and the blockchain confirmation environment, into a neural network model in order to estimate a proper transaction fee. Finally, we conduct experiments on real blockchain datasets to demonstrate the effectiveness and efficiency of our proposed framework over the state-of-the-art works evaluated by MAPE and RMSE. Each variation model in our framework can finish training within one block interval, which shows the potential of our framework to process the realtime transaction updates in the Bitcoin blockchain.

Related papers

• BlockFound: Customized blockchain foundation model for anomaly detection [47.04595143348698]
  BlockFound is a customized foundation model for anomaly blockchain transaction detection. We introduce a series of customized designs to model the unique data structure of blockchain transactions. BlockFound is the only method that successfully detects anomalous transactions on Solana with high accuracy.
  arXiv  Detail & Related papers  (2024-10-05T05:11:34Z)
• Enhancing Trust and Privacy in Distributed Networks: A Comprehensive Survey on Blockchain-based Federated Learning [51.13534069758711]
  Decentralized approaches like blockchain offer a compelling solution by implementing a consensus mechanism among multiple entities. Federated Learning (FL) enables participants to collaboratively train models while safeguarding data privacy. This paper investigates the synergy between blockchain's security features and FL's privacy-preserving model training capabilities.
  arXiv  Detail & Related papers  (2024-03-28T07:08:26Z)
• Graph Attention Network-based Block Propagation with Optimal AoI and Reputation in Web 3.0 [59.94605620983965]
  We design a Graph Attention Network (GAT)-based reliable block propagation optimization framework for blockchain-enabled Web 3.0. To achieve the reliability of block propagation, we introduce a reputation mechanism based on the subjective logic model. Considering that the GAT possesses the excellent ability to process graph-structured data, we utilize the GAT with reinforcement learning to obtain the optimal block propagation trajectory.
  arXiv  Detail & Related papers  (2024-03-20T01:58:38Z)
• A Holistic Approach for Bitcoin Confirmation Times & Optimal Fee Selection [0.0]
  Bitcoin is subject to a significant pay-for-speed trade-off. Users can reduce their transaction confirmation times by increasing their transaction fee. We propose a model-based approach that can be used to determine the optimal fee.
  arXiv  Detail & Related papers  (2024-02-27T12:55:36Z)
• Designing Redistribution Mechanisms for Reducing Transaction Fees in Blockchains [10.647087323578477]
  Transaction Fee Mechanisms (TFMs) determine which user transactions to include in blocks and determine their payments. We propose Transaction Fee Redistribution Mechanisms (TFRMs) -- redistributing VCG payments as rebates to minimize transaction fees. Our results show that TFRMs provide a promising new direction for reducing transaction fees in public blockchains.
  arXiv  Detail & Related papers  (2024-01-24T07:09:32Z)
• Masquerade: Simple and Lightweight Transaction Reordering Mitigation in Blockchains [5.690884793952696]
  We propose an MEV aware protocol design called Masquerade to increase user satisfaction and confidence in the system. We introduce the notion of a "token" to mitigate the actions taken by an adversary in an attack scenario.
  arXiv  Detail & Related papers  (2023-08-29T14:42:43Z)
• 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)
• 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)
• Temporal-Amount Snapshot MultiGraph for Ethereum Transaction Tracking [5.579169055801065]
  We study the problem of transaction tracking via link prediction, which provides a deeper understanding of transactions from a network perspective. Specifically, we introduce an embedding based link prediction framework that is composed of temporal-amount snapshot multigraph (TASMG) and present temporal-amount walk (TAW) By taking the realistic rules and features of transaction networks into consideration, we propose TASMG to model transaction records as a temporal-amount network and then present TAW to effectively embed accounts via their transaction records.
  arXiv  Detail & Related papers  (2021-02-16T08:21:16Z)
• Blockchain Assisted Decentralized Federated Learning (BLADE-FL) with Lazy Clients [124.48732110742623]
  We propose a novel framework by integrating blockchain into Federated Learning (FL) BLADE-FL has a good performance in terms of privacy preservation, tamper resistance, and effective cooperation of learning. It gives rise to a new problem of training deficiency, caused by lazy clients who plagiarize others' trained models and add artificial noises to conceal their cheating behaviors.
  arXiv  Detail & Related papers  (2020-12-02T12:18:27Z)
• Jointly Modeling Intra- and Inter-transaction Dependencies with Hierarchical Attentive Transaction Embeddings for Next-item Recommendation [43.09242534398912]
  A transaction-based recommender system (TBRS) aims to predict the next item by modeling dependencies in transactional data. Most existing methods recommend next item by only modeling the intra-transaction dependency within the current transaction. We propose a novel hierarchical attentive transaction embedding (HATE) model to tackle these issues.
  arXiv  Detail & Related papers  (2020-05-30T14:04:19Z)

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.