Order Fairness Evaluation of DAG-based ledgers

• URL: http://arxiv.org/abs/2502.17270v2
• Date: Fri, 14 Mar 2025 22:43:17 GMT
• Title: Order Fairness Evaluation of DAG-based ledgers
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 eventually finalized, i.e., totally ordered. The study of such properties is relatively new and has been especially stimulated by the rise of Maximal Extractable Value (MEV) attacks in blockchain environments. Indeed, in many classical blockchain protocols, leaders are responsible for selecting the transactions to be included in blocks, which creates a clear vulnerability and opportunity for transaction order manipulation. Unlike blockchains, DAG-based ledgers allow participants in the network to independently propose blocks, which are then arranged as vertices of a directed acyclic graph. Interestingly, leaders in DAG-based ledgers are elected only after the fact, once transactions are already part of the graph, to determine their total order. In other words, transactions are not chosen by single leaders; instead, they are collectively validated by the nodes, and leaders are only elected to establish an ordering. This approach intuitively reduces the risk of transaction manipulation and enhances fairness. In this paper, we aim to quantify the capability of DAG-based ledgers to achieve order fairness. To this end, we define new variants of order fairness adapted to DAG-based ledgers and evaluate the impact of an adversary capable of compromising a limited number of nodes (below the one-third threshold) to reorder transactions. We analyze how often our order fairness properties are violated under different network conditions and parameterizations of the DAG algorithm, depending on the adversary's power. Our study shows that DAG-based ledgers are still vulnerable to reordering attacks, as an adversary can coordinate a minority of Byzantine nodes to manipulate the DAG's structure.

Related papers

• Themis Consensus Extension v1: MEV Mitigation by Randomized Delayed Execution and Intent-Hiding Transactions in Application-Specific Blockchains [0.0]
  We analyze the Themis Consensus Extension v1, first published by Mangata in 2021.<n>The design separates value extraction by reordering from value extraction by denial.<n>We analyze probabilistic extraction, spam, dependent transactions, decryption liveness, session boundaries, total denial, and threshold coalitions.
  arXiv  Detail & Related papers  (2026-07-23T15:05:09Z)
• Ordered Action Tokens for Visuomotor Policy Learning [47.37773778249323]
  Action tokenization maps continuous robot action chunks to discrete tokens.<n>We introduce Ordered Action Tokenization (OAT), a learned action tokenizer that satisfies high compression, total decodability, and an ordered token space.<n>OAT consistently delivers strong policy performance while offering significantly greater flexibility at inference time.
  arXiv  Detail & Related papers  (2026-07-23T07:04:51Z)
• Tilikum: Transaction Fair Ordering on a DAG without Weak Edges [0.8924669503280332]
  We introduce Tilikum, a DAG-based ledger protocol that ensures fair transaction ordering without relying on weak edges.<n>Tilikum achieves linearizability by leveraging median-based timestamp aggregation, or batch order, while maintaining low data redundancy and robust garbage collection.<n>Our results show that Tilikum achieves up to $39times$ higher throughput than other fair-ordering baselines, while fully blocking state-of-the-art DAG-specific reordering attacks.
  arXiv  Detail & Related papers  (2026-06-25T16:34:44Z)
• Temporal Motif-aware Graph Test-time Adaptation for OOD Blockchain Anomaly Detection [55.18577006122169]
  We propose a novel framework termed textbfTEmporal textbfMotif-aware textbfGraph textbfTest-textbfTime textbfAdaptation (textbfTEMG-TTA)<n>First, we comprehensively capture the 3-node temporal motif distribution of each active address using an efficient computational mechanism.<n>Second, we design a simple yet effective test-time adaptation strategy to facilitate the sharing of common patterns between training and testing graphs.
  arXiv  Detail & Related papers  (2026-05-28T07:43:20Z)
• Game-Theoretic Analysis of Transaction Selection in DAG-Based Distributed Ledgers [48.17065660350331]
  Transaction selection in DAG-based distributed ledger technologies (DLTs) is a crucial challenge that directly impacts throughput, fairness, and validator incentives.<n>We analyze two fee allocation mechanisms used in practice: Random Fee Allocation (RFA) and Collaborative Fee Sharing (CFS)<n> Numerical simulations demonstrate that the NE of CFS consistently achieves higher throughput and rewards compared to the NE of RFA, particularly under skewed fee distributions.<n>These findings may provide actionable insights into the design of transaction selection and incentive mechanisms, enabling more robust and high-performance DAG-based DLTs.
  arXiv  Detail & Related papers  (2026-05-08T07:42:42Z)
• Outcome-Grounded Advantage Reshaping for Fine-Grained Credit Assignment in Mathematical Reasoning [60.00161035836637]
  Group Relative Policy Optimization has emerged as a promising critic-free reinforcement learning paradigm for reasoning tasks.<n>We introduce Outcome-grounded Advantage Reshaping (OAR), a fine-grained credit assignment mechanism that redistributes advantages based on how much each token influences the model's final answer.<n>OAR-G achieves comparable gains with negligible computational overhead, both significantly outperforming a strong GRPO baseline.
  arXiv  Detail & Related papers  (2026-01-12T10:48:02Z)
• Ordered Consensus with Equal Opportunity [12.29987996667885]
  We show how randomness can be leveraged to keep bias in check in SMR-based blockchains.<n>We introduce the secret random oracle (SRO), a system component that generates randomness in a fault-tolerant manner.
  arXiv  Detail & Related papers  (2025-09-11T21:43:13Z)
• Advanced DAG-Based Ranking (ADR) Protocol for Blockchain Scalability [2.6649708444847677]
  This paper proposes the Advanced DAG-based Ranking protocol to enhance blockchain scalability and throughput.<n>It follows a three-step approach to secure the network against double-spending and enhance performance.<n> Simulation results demonstrate that ADR significantly improves transaction throughput and network liveness compared to existing DAG-based blockchains.
  arXiv  Detail & Related papers  (2025-08-06T01:27:33Z)
• Efficient Blockchain-based Steganography via Backcalculating Generative Adversarial Network [105.47203971578871]
  We propose a generic blockchain-based steganography framework (GBSF)<n>The sender generates the required fields such as amount and fees, where the additional covert data is embedded to enhance the channel capacity.<n>Based on GBSF, we design a reversible generative adversarial network (R-GAN)<n>We propose R-GAN with Counter-intuitive data preprocessing and Custom activation functions, namely CCR-GAN.
  arXiv  Detail & Related papers  (2025-06-19T04:43:41Z)
• FairDAG: Consensus Fairness over Concurrent Causal Design [4.261985028097139]
  Research has shown that adversaries exploit transaction ordering to extract profits. This issue affects both permissionless and permissioned blockchains. We propose FairDAG-AB and FairDAG-RL, which leverage DAG-based consensus protocols.
  arXiv  Detail & Related papers  (2025-04-03T00:38:03Z)
• Fuzzychain: An Equitable Consensus Mechanism for Blockchain Networks [12.433289572707212]
  Fuzzychain is a proposed solution to the drawbacks of Proof of Stake (PoS) It introduces the use of fuzzy sets to define stake semantics, promoting decentralised and distributed processing control. Our results indicate that Fuzzychain not only matches PoS in functionality but also ensures a fairer distribution of stakes among validators.
  arXiv  Detail & Related papers  (2024-04-20T10:01:40Z)
• Robust and Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents [52.75161794035767]
  We introduce a class of bandit algorithms that meet the two objectives of performance incentivization and robustness simultaneously. We show that settings where the principal has no information about the arms' performance characteristics can be handled by combining ideas from second price auctions with our algorithms.
  arXiv  Detail & Related papers  (2023-12-13T06:54:49Z)
• Towards Stronger Blockchains: Security Against Front-Running Attacks [10.220888127527152]
  We show that total ordering is not strong enough to preserve application semantics under Byzantine fault model. This is due to the fact that malicious miners and clients can collaborate to add their own transactions ahead of correct clients' transactions in order to gain application level and financial advantages. We propose preserving causality preserving total order as a solution.
  arXiv  Detail & Related papers  (2023-11-17T00:50:49Z)
• Towards a Theory of Maximal Extractable Value II: Uncertainty [4.07926531936425]
  Maximal Extractable Value (MEV) is value extractable by temporary monopoly power commonly found in decentralized systems. This extraction stems from a lack of user privacy upon transaction submission and the ability of a monopolist validator to reorder, add, and/or censor transactions. We show that neither fair ordering techniques nor economic mechanisms can individually mitigate MEV for arbitrary payoff functions.
  arXiv  Detail & Related papers  (2023-09-25T15:01:11Z)
• Transaction Fraud Detection via an Adaptive Graph Neural Network [64.9428588496749]
  We propose an Adaptive Sampling and Aggregation-based Graph Neural Network (ASA-GNN) that learns discriminative representations to improve the performance of transaction fraud detection. A neighbor sampling strategy is performed to filter noisy nodes and supplement information for fraudulent nodes. Experiments on three real financial datasets demonstrate that the proposed method ASA-GNN outperforms state-of-the-art ones.
  arXiv  Detail & Related papers  (2023-07-11T07:48:39Z)
• Graph Agent Network: Empowering Nodes with Inference Capabilities for Adversarial Resilience [50.460555688927826]
  We propose the Graph Agent Network (GAgN) to address the vulnerabilities of graph neural networks (GNNs)<n>GAgN is a graph-structured agent network in which each node is designed as an 1-hop-view agent.<n>Agents' limited view prevents malicious messages from propagating globally in GAgN, thereby resisting global-optimization-based secondary attacks.
  arXiv  Detail & Related papers  (2023-06-12T07:27:31Z)
• Enhancing Few-shot NER with Prompt Ordering based Data Augmentation [59.69108119752584]
  We propose a Prompt Ordering based Data Augmentation (PODA) method to improve the training of unified autoregressive generation frameworks. Experimental results on three public NER datasets and further analyses demonstrate the effectiveness of our approach.
  arXiv  Detail & Related papers  (2023-05-19T16:25:43Z)
• Group-aware Label Transfer for Domain Adaptive Person Re-identification [179.816105255584]
  Unsupervised Adaptive Domain (UDA) person re-identification (ReID) aims at adapting the model trained on a labeled source-domain dataset to a target-domain dataset without any further annotations. Most successful UDA-ReID approaches combine clustering-based pseudo-label prediction with representation learning and perform the two steps in an alternating fashion. We propose a Group-aware Label Transfer (GLT) algorithm, which enables the online interaction and mutual promotion of pseudo-label prediction and representation learning.
  arXiv  Detail & Related papers  (2021-03-23T07:57:39Z)
• Detecting Malicious Accounts in Permissionless Blockchains using Temporal Graph Properties [4.506782035297339]
  temporal nature of modeling accounts as nodes and transactions as directed edges in a directed graph -- for a blockchain. Motivated by this, we introduce temporal features such as burst and attractiveness on top of several already used graph properties. We train various Machine Learning (ML) algorithms to identify the algorithm that performs the best in detecting which accounts are malicious.
  arXiv  Detail & Related papers  (2020-07-10T05:15:26Z)
• AN-GCN: An Anonymous Graph Convolutional Network Defense Against Edge-Perturbing Attack [53.06334363586119]
  Recent studies have revealed the vulnerability of graph convolutional networks (GCNs) to edge-perturbing attacks. We first generalize the formulation of edge-perturbing attacks and strictly prove the vulnerability of GCNs to such attacks in node classification tasks. Following this, an anonymous graph convolutional network, named AN-GCN, is proposed to counter edge-perturbing attacks.
  arXiv  Detail & Related papers  (2020-05-06T08:15: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.