Fairness and Efficiency in DAG-based Cryptocurrencies
Georgios Birmpas, Elias Koutsoupias, Philip Lazos, Francisco J., Marmolejo-Coss\'io

TL;DR
This paper introduces a framework for analyzing DAG-based cryptocurrencies, revealing structural limits on fairness and efficiency under high transaction loads even with honest miners.
Contribution
It presents a new general framework for DAG-based ledgers and experimentally explores their fairness and efficiency under various network conditions.
Findings
Fundamental structural limits on DAG protocols at high transaction loads.
Fairness and efficiency can break down at specific hash rates.
Connectivity differences among miners impact protocol performance.
Abstract
Bitcoin is a decentralised digital currency that serves as an alternative to existing transaction systems based on an external central authority for security. Although Bitcoin has many desirable properties, one of its fundamental shortcomings is its inability to process transactions at high rates. To address this challenge, many subsequent protocols either modify the rules of block acceptance (longest chain rule) and reward, or alter the graphical structure of the public ledger from a tree to a directed acyclic graph (DAG). Motivated by these approaches, we introduce a new general framework that captures ledger growth for a large class of DAG-based implementations. With this in hand, and by assuming honest miner behaviour, we (experimentally) explore how different DAG-based protocols perform in terms of fairness, i.e., if the block reward of a miner is proportional to their hash power,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
