Paper Info
Title
Sketches for Blockchains
Abstract
Blockchains suffer from a critical scalability problem where traditionally each network node maintains all network state, including records since the establishment of the blockchain. Sketches are popular hash-based data structures used to represent a large amount of data while supporting particular queries such as on set membership, cardinality estimation and identification of large elements. Often, to achieve time and memory savings, sketches allow potential inaccuracies in answers to the queries. The design of popular blockchain networks such as Bitcoin and Ethereum makes use of sketches for various tasks such as summarization of transaction blocks or declaring the interests of light nodes. Similarly, they seem natural to deal with the size of the state in blockchains. In this paper, we study existing and potential future applications of sketches in blockchains. We first summarize current blockchain use cases of sketches. Likewise, we explore how this coupling can be generalized to a wider range of sketches and additional functionalities. In particular, we explain how sketches can detect anomalies based on efficient an summary of the state or traffic.
Year
DOI
Venue
2021
10.1109/COMSNETS51098.2021.9352944
2021 International Conference on COMmunication Systems & NETworkS (COMSNETS)
Keywords
DocType
ISSN
current blockchain,popular blockchain networks,popular hash-based data structures,network state,network node,critical scalability problem
Conference
2155-2487
ISBN
Citations 
PageRank 
978-1-7281-9128-7
1
0.35
References 
Authors
0
1
Name
Order
Citations
PageRank
Ori Rottenstreich197.31