Tilikum: Transaction Fair Ordering on a DAG without Weak Edges

• URL: http://arxiv.org/abs/2606.27250v1
• Date: Thu, 25 Jun 2026 16:34:44 GMT
• Title: Tilikum: Transaction Fair Ordering on a DAG without Weak Edges
• Abstract summary: 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.
• Score: 0.8924669503280332
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Decentralized Finance (DeFi) applications rely heavily on the order in which transactions are executed, making them susceptible to reordering attacks that enable adversaries to extract Blockchain Extractable Value (BEV). While linear blockchain systems such as Ethereum have inspired extensive research into fair ordering mechanisms, DAG-based consensus protocols have remained largely unprotected despite their growing adoption for scalability and performance. In this paper, we introduce Tilikum, a DAG-based ledger protocol that ensures fair transaction ordering without relying on weak edges. Tilikum achieves ordering linearizability by leveraging median-based timestamp aggregation, or batch order fairness, while maintaining low data redundancy and robust garbage collection. We implemented Tilikum in Rust and evaluated it against representative baselines, namely Narwhal/Tusk, Pompē, Themis and FairDAG. Our results show that Tilikum achieves up to $39\times$ higher throughput than other fair-ordering baselines, while fully blocking state-of-the-art DAG-specific reordering attacks.

Related papers

• Proof of Source of Funds: Efficient On-chain Provenance of Cryptoassets [5.222265639534245]
  We introduce Proof of Source of Funds (PoSoF), a novel cryptographic framework that shifts the burden to the user.<n>PoSoF provides verifiable cryptographic provenance; it guarantees the legitimacy of the funds without leaking the intermediate transaction topology.<n>Our benchmarks demonstrate that fully private, proactive compliance is highly practical.
  arXiv  Detail & Related papers  (2026-06-08T21:07:02Z)
• 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)
• Verifier-Free RL for LLMs via Intrinsic Gradient-Norm Reward [69.99652051809737]
  In this work, we propose Verifier-free Intrinsic Gradient-Norm Reward (VIGOR)<n>VIGOR is a simple reward that uses only the policy model itself.<n>It exhibits cross-domain transfer to code benchmarks when trained only on math data.
  arXiv  Detail & Related papers  (2026-05-11T03:15:37Z)
• GoAT-X: A Graph of Auditing Thoughts for Securing Token Transactions in Cross-Chain Contracts [52.51342355102833]
  Cross-chain bridges, the critical infrastructure of the multi-chain ecosystem, have become a primary target for attackers.<n>Existing defenses, such as bytecode-level static analysis, are ill-equipped to handle the semantic complexity of cross-chain interactions.<n>We propose GoAT-X, a framework that shifts automated cross-chain smart contracts auditing from pattern matching toward systematic first-principles verification.
  arXiv  Detail & Related papers  (2026-04-27T11:34:21Z)
• Lifefin: Escaping Mempool Explosions in DAG-based BFT [16.7429292215009]
  Lifefin is a generic and self-stabilizing protocol designed to integrate seamlessly with DAG-based BFT protocols.<n>Lifefin allows nodes to escape mempool explosions by committing transactions with bounded resource usage even in adverse conditions.<n>Lifefin achieves comparable transaction throughput while introducing only minimal additional latency to resist similar attacks.
  arXiv  Detail & Related papers  (2025-11-20T00:00:26Z)
• 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)
• FairDAG: Consensus Fairness over Multi-Proposer Causal Design [4.261985028097139]
  Research has shown that adversaries exploit transaction ordering to extract profits through attacks like front-running, sandwich attacks, and liquidation manipulation.<n>This issue affects blockchain databases in which block proposers have full control over transaction ordering.<n>Existing fairness protocols operate on leader-based consensus protocols, which not only suffer from low throughput, but also allow adversaries to manipulate transaction ordering.<n>We propose FairDAG-AB and FairDAG-RL that run fairness protocols on top of DAG-based consensus protocols, which improve protocol performance in both throughput and fairness quality.
  arXiv  Detail & Related papers  (2025-04-03T00:38:03Z)
• 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)
• Advancing Generalized Transfer Attack with Initialization Derived Bilevel Optimization and Dynamic Sequence Truncation [49.480978190805125]
  Transfer attacks generate significant interest for black-box applications. Existing works essentially directly optimize the single-level objective w.r.t. surrogate model. We propose a bilevel optimization paradigm, which explicitly reforms the nested relationship between the Upper-Level (UL) pseudo-victim attacker and the Lower-Level (LL) surrogate attacker.
  arXiv  Detail & Related papers  (2024-06-04T07:45:27Z)
• 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)
• Byzantine-Robust Learning on Heterogeneous Data via Gradient Splitting [58.91947205027892]
  Federated learning has exhibited vulnerabilities to Byzantine attacks. Byzantine attackers can send arbitrary gradients to a central server to destroy the convergence and performance of the global model. A wealth of robust AGgregation Rules (AGRs) have been proposed to defend against Byzantine attacks.
  arXiv  Detail & Related papers  (2023-02-13T03:31:50Z)

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.