Paper 2019/649 Original: eprint.iacr.org/2019/649 ↗
Txilm: Lossy Block Compression with Salted Short Hashing
Abstract
Current blockchains are restricted by the low throughput. Aimed at this problem, we propose Txilm, a protocol that compresses the size of transaction presentation in each block and thus saves the bandwidth of the blockchain network. In this protocol, a block carries short hashes of TXIDs instead of complete transactions. Combined with the transaction list sorted by TXIDs, Txilm realizes 80 times of data size reduction compared with the original blockchains. We also evaluate the probability of hash collisions, and provide methods of resolving such collisions. Finally, we design strategies to protect against possible attacks on Txilm.
Metadata
- Available format(s)
PDF- Category
- Applications
- Publication info
- Preprint.
- History
- 2019-06-12: last updated
- 2019-06-04: published
- Short URL
- https://ia.cr/2019/649
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2019/649,
author = {Donghui Ding and Xin Jiang and Jiaping Wang and Hao Wang and Xiaobing Zhang and Yi Sun},
title = {Txilm: Lossy Block Compression with Salted Short Hashing},
howpublished = {Cryptology {ePrint} Archive, Paper 2019/649},
year = {2019},
url = {https://eprint.iacr.org/2019/649}
}