DAG-Sword: A Simulator for DAG-Oriented Proof-of-Work Blockchains with Realistic Network Topologies

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F24%3APU149349" target="_blank" >RIV/00216305:26230/24:PU149349 - isvavai.cz</a>

Result on the web

<a href="https://hdl.handle.net/10125/107101" target="_blank" >https://hdl.handle.net/10125/107101</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.24251/HICSS.2023.716" target="_blank" >10.24251/HICSS.2023.716</a>

Result language

angličtina

Original language name

DAG-Sword: A Simulator for DAG-Oriented Proof-of-Work Blockchains with Realistic Network Topologies

Original language description

Interesting blockchain properties have received considerable attention in research and practical applications. However, some properties, such as the transaction throughput, remained limited, especially in Proof-of-Work blockchains. Therefore, several promising directions, such as DAG-based protocols, emerged to respond to the throughput bottleneck. In this paper, we present a discrete-event simulator of DAG-based consensus protocols. Our simulator can simulate realistic blockchain networks created from data collected from a Bitcoin network, while its network configuration can be customized. The simulated network consists of honest and malicious miners. Malicious miners do not make any attack on consensus but they use a different than honest (random) transaction selection strategy to include transactions in the block to earn more profits than honest miners. This harms the performance of some DAG-based protocols, such as PHANTOM and GHOSTDAG, and thus decreases the overall throughput, which we demonstrate in our experiments and confirm the results of the related work achieved on a small network of 10 nodes. Next, we empirically compare different algorithms implementing the random transaction selection strategy from the mempool structure, and we propose a composite mempool structure that is memory-efficient and thus convenient for simulations of various transaction selection strategies over large-scale realistic networks.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2024

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of the 57th Annual Hawaii International Conference on System Sciences

ISBN

978-0-9981331-7-1

ISSN

—

e-ISSN

—

Number of pages

10

Pages from-to

1-10

Publisher name

IEEE Computer Society

Place of publication

Waikiki

Event location

Hawaii

Event date

Jan 3, 2024

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—