FairDAG: Consensus Fairness over Concurrent Causal Design

• URL: http://arxiv.org/abs/2504.02194v1
• Date: Thu, 03 Apr 2025 00:38:03 GMT
• Title: FairDAG: Consensus Fairness over Concurrent Causal Design
• Authors: Dakai Kang, Junchao Chen, Tien Tuan Anh Dinh, Mohammad Sadoghi,
• Abstract summary: Research has shown that adversaries exploit transaction ordering to extract profits.<n>This issue affects both permissionless and permissioned blockchains.<n>We propose FairDAG-AB and FairDAG-RL, which leverage DAG-based consensus protocols.
• Score: 4.261985028097139
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The rise of cryptocurrencies like Bitcoin and Ethereum has driven interest in blockchain technology, with Ethereum's smart contracts enabling the growth of decentralized finance (DeFi). However, research has shown that adversaries exploit transaction ordering to extract profits through attacks like front-running, sandwich attacks, and liquidation manipulation. This issue affects both permissionless and permissioned blockchains, as block proposers have full control over transaction ordering. To address this, a more fair approach to transaction ordering is essential. Existing fairness protocols, such as Pompe and Themis, operate on leader-based consensus protocols, which not only suffer from low throughput but also allow adversaries to manipulate transaction ordering. To address these limitations, we propose FairDAG-AB and FairDAG-RL, which leverage DAG-based consensus protocols. We theoretically demonstrate that FairDAG protocols not only uphold fairness guarantees, as previous fairness protocols do, but also achieve higher throughput and greater resilience to adversarial ordering manipulation. Our deployment and evaluation on CloudLab further validate these claims.

Related papers

• Demystifying Private Transactions and Their Impact in PoW and PoS Ethereum [43.548299433042835]
  Private transactions, a specialized transaction type employed to evade public Peer-to-Peer (P2P) network broadcasting, remain largely unexplored.<n>We analyze large-scale datasets comprising 14,810,392 private transactions within a 15.5-month Proof-of-Work (PoW) dataset and 30,062,232 private transactions within a 15.5-month Proof-of-Stake (PoS) dataset.
  arXiv  Detail & Related papers  (2025-03-30T16:45:18Z)
• Order Fairness Evaluation of DAG-based ledgers [0.0]
  Order fairness in distributed ledgers refers to properties that relate the order in which transactions are sent or received to the order in which they are finalized.<n>This paper aims to quantify the capability of DAG-based ledgers to achieve order fairness.
  arXiv  Detail & Related papers  (2025-02-24T15:54:02Z)
• Privacy-Preserving Smart Contracts for Permissioned Blockchains: A zk-SNARK-Based Recipe Part-1 [1.7265013728931]
  This work proposes a solution utilizing zk-SNARKs to provide privacy in smart contracts and blockchains.<n>The proposal includes a new type of transactions, called delegated transactions, which enable use cases like Delivery vs Payment (DvP)
  arXiv  Detail & Related papers  (2025-01-06T21:16:33Z)
• 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. Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol. We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Flashback: Enhancing Proposer-Builder Design with Future-Block Auctions in Proof-of-Stake Ethereum [27.386337024680245]
  Auction mechanisms used between searchers, builders and proposers are crucial to the overall health of the blockchain. In this paper, we consider PBS design in as a game between searchers, builders and proposers. A key novelty in our design is the inclusion of future block proposers, as all proposers of an epoch are decided ahead of time in proof-of-stake (PoS) Our analysis shows the existence of alternative auction mechanisms that result in a better equilibrium to players compared to state-of-the-art.
  arXiv  Detail & Related papers  (2024-05-15T15:58:21Z)
• Heuristics for Detecting CoinJoin Transactions on the Bitcoin Blockchain [23.23031523964561]
  This research delves into the intricacies of Bitcoin, a decentralized peer-to-peer network, and its associated blockchain. To address this concern, users have adopted CoinJoin, a method that amalgamates multiple transaction intents into a single, larger transaction. Our exhaustive analysis covers up to block 760,000, offering a comprehensive insight into CoinJoin transactions.
  arXiv  Detail & Related papers  (2023-11-21T10:05: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)
• Analyzing Geospatial Distribution in Blockchains [15.432313954857106]
  We analyze blockchain decentralization's often-overlooked but quantifiable dimension: geospatial distribution of transaction processing. Minority validators tend not to meet the performance requirements, often misidentified as crash failures. We develop a solution that easily integrates with consensus protocols.
  arXiv  Detail & Related papers  (2023-05-28T16:35:01Z)
• 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)
• BERT4ETH: A Pre-trained Transformer for Ethereum Fraud Detection [29.518411879700263]
  BERT4ETH is a pre-trained Transformer account representation extractor for detecting various fraud behaviors. BERT4ETH features the superior modeling capability of Transformer to capture the dynamic sequential patterns inherent in transactions. Our empirical evaluation demonstrates that BERT4ETH outperforms state-of-the-art methods with significant enhancements in terms of the phishing account detection and de-anonymization tasks.
  arXiv  Detail & Related papers  (2023-03-29T20:30:52Z)
• Resilient Consensus Sustained Collaboratively [6.090550359575682]
  We present the design of our Power-of-Collaboration protocol, which guards existing PoS/BFT blockchains against long-range attacks. PoC guarantees fairness and accountability and only marginally degrades the throughput of the underlying system.
  arXiv  Detail & Related papers  (2023-02-05T07:33:57Z)
• ACon$^2$: Adaptive Conformal Consensus for Provable Blockchain Oracles [31.439376852065713]
  Power of smart contracts is enabled by interacting with off-chain data, which in turn opens the possibility to undermine the block state consistency. We propose an adaptive conformal consensus (ACon$2$) algorithm, which derives consensus from multiple oracle contracts. In particular, the proposed algorithm returns a consensus set, which quantifies the uncertainty of data and achieves a desired correctness guarantee.
  arXiv  Detail & Related papers  (2022-11-17T04:37:24Z)

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.