DAG-Sword: A Simulator for DAG-Oriented Proof-of-Work Blockchains with Realistic Network Topologies
Identifikátory výsledku
Kód výsledku v 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>
Výsledek na webu
<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>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
DAG-Sword: A Simulator for DAG-Oriented Proof-of-Work Blockchains with Realistic Network Topologies
Popis výsledku v původním jazyce
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.
Název v anglickém jazyce
DAG-Sword: A Simulator for DAG-Oriented Proof-of-Work Blockchains with Realistic Network Topologies
Popis výsledku anglicky
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.
Klasifikace
Druh
D - Stať ve sborníku
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Návaznosti výsledku
Projekt
—
Návaznosti
S - Specificky vyzkum na vysokych skolach
Ostatní
Rok uplatnění
2024
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název statě ve sborníku
Proceedings of the 57th Annual Hawaii International Conference on System Sciences
ISBN
978-0-9981331-7-1
ISSN
—
e-ISSN
—
Počet stran výsledku
10
Strana od-do
1-10
Název nakladatele
IEEE Computer Society
Místo vydání
Waikiki
Místo konání akce
Hawaii
Datum konání akce
3. 1. 2024
Typ akce podle státní příslušnosti
WRD - Celosvětová akce
Kód UT WoS článku
—