DAP-CBR: enhancing Bitcoin block propagation efficiency using dynamic compact block relay’s prefilling of transactions

Abstract This study examines the potential of BIP-152’s Compact Block Relay (CBR) to enhance the Bitcoin network. This work explores the block propagation efficiency through dynamic prefilling of transactions. In addition, an enhanced CBR model is proposed to reduce superfluous transaction requests, thus improving the block distribution process. The analysis considers the impact of the dynamically prefilled transactions on Bitcoin network scalability, comparing the advantages and disadvantages of this approach. We also conduct a comparative study of fixed-size and dynamically sized prefilled transactions to highlight the importance of adapting to network demands. Prefilling a fixed number of transactions without considering demand can cause inefficiencies and strain the network with unnecessary bandwidth use. Indiscriminate prefilling exacerbates these issues by inflating data packets unnecessarily, increasing latency and reducing network responsiveness. Our research indicates that the proposed solution can significantly reduce the number of round-trips between network nodes by an average of 29.77% and block reconstruction latency by 39.10% when compared with the CBR.

Authors

Institutions

Publication Details

Journal
The Journal of Supercomputing
Published
2024-10-25
DOI
https://doi.org/10.1007/s11227-024-06468-0
Citations
1
Primary Topic
Blockchain Technology Applications and Security
Type
article
Field-Weighted Citation Impact
0.78

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DAP-CBR: enhancing Bitcoin block propagation efficiency using dynamic compact block relay’s prefilling of transactions

Chee Keong Tan, Ian K. T. Tan, Zi Hau Chin, Timothy Tzen Vun Yap et al.
1 citations
The Journal of Supercomputing
Blockchain Technology Applications and Security
0.78
article

DAP-CBR: enhancing Bitcoin block propagation efficiency using dynamic compact block relay’s prefilling of transactions

Chee Keong Tan, Ian K. T. Tan, Zi Hau Chin, Timothy Tzen Vun Yap, Vishnu Monn Baskaran
article en
1 citations

Abstract

Abstract This study examines the potential of BIP-152’s Compact Block Relay (CBR) to enhance the Bitcoin network. This work explores the block propagation efficiency through dynamic prefilling of transactions. In addition, an enhanced CBR model is proposed to reduce superfluous transaction requests, thus improving the block distribution process. The analysis considers the impact of the dynamically prefilled transactions on Bitcoin network scalability, comparing the advantages and disadvantages of this approach. We also conduct a comparative study of fixed-size and dynamically sized prefilled transactions to highlight the importance of adapting to network demands. Prefilling a fixed number of transactions without considering demand can cause inefficiencies and strain the network with unnecessary bandwidth use. Indiscriminate prefilling exacerbates these issues by inflating data packets unnecessarily, increasing latency and reducing network responsiveness. Our research indicates that the proposed solution can significantly reduce the number of round-trips between network nodes by an average of 29.77% and block reconstruction latency by 39.10% when compared with the CBR.

The Journal of SupercomputingVol. 81(1)
Monash University Malaysia (MY), Heriot-Watt University Malaysia (MY)
Monash University, Monash University Malaysia
Reduced inequalities
Openalex Percentile: Top 20%
Blockchain Technology Applications and Security
0.78
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.