Quick Notification of Block Generation Using Bloom Filter in a Blockchain

Tsuyoshi Hasegawa, Akira Sakurai, Kazuyuki Shudo
{"title":"Quick Notification of Block Generation Using Bloom Filter in a Blockchain","authors":"Tsuyoshi Hasegawa, Akira Sakurai, Kazuyuki Shudo","doi":"10.1109/ISCC58397.2023.10218308","DOIUrl":null,"url":null,"abstract":"Forks in a blockchain sacrifice security. In this paper, we propose a protocol for quickly propagating block generation notifications in the blockchain network quickly to reduce the fork rate. Block generation notifications contain a Bloom filter that represents transactions in the generated block. Thus, when nodes receive a block generation notification, they can start mining the next block. In experiments in which a simulator is used, we compared the propagation time of a block generation notification with that of a block in the existing protocol. As a result, the propagation time of the 50 %ile is 41.1 % of an existing protocol, the 90 %ile is 39.2 % of the existing protocol, and the fork rate calculated from the average propagation time is 40.8 % of the existing protocol.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE Symposium on Computers and Communications (ISCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC58397.2023.10218308","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Forks in a blockchain sacrifice security. In this paper, we propose a protocol for quickly propagating block generation notifications in the blockchain network quickly to reduce the fork rate. Block generation notifications contain a Bloom filter that represents transactions in the generated block. Thus, when nodes receive a block generation notification, they can start mining the next block. In experiments in which a simulator is used, we compared the propagation time of a block generation notification with that of a block in the existing protocol. As a result, the propagation time of the 50 %ile is 41.1 % of an existing protocol, the 90 %ile is 39.2 % of the existing protocol, and the fork rate calculated from the average propagation time is 40.8 % of the existing protocol.
在区块链中使用Bloom过滤器生成块的快速通知
区块链中的分叉牺牲了安全性。在本文中,我们提出了一种在区块链网络中快速传播区块生成通知的协议,以快速降低分叉率。块生成通知包含一个表示生成块中的事务的Bloom过滤器。因此,当节点收到区块生成通知时,它们可以开始挖掘下一个区块。在使用模拟器的实验中,我们将块生成通知的传播时间与现有协议中的块传播时间进行了比较。因此,50%文件的传播时间为现有协议的41.1%,90%文件的传播时间为现有协议的39.2%,根据平均传播时间计算的分叉率为现有协议的40.8%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信