Erasure-Coded Sharding and Proof-of-Storage for Practical Blockchain Trilemma Balance

IET Blockchain Pub Date : 2026-08-04 DOI:10.1049/blc2.70052
Saha Reno, Koushik Roy, G M Abdullah Al Kafi, Khandakar Md Shafin
{"title":"Erasure-Coded Sharding and Proof-of-Storage for Practical Blockchain Trilemma Balance","authors":"Saha Reno,&nbsp;Koushik Roy,&nbsp;G M Abdullah Al Kafi,&nbsp;Khandakar Md Shafin","doi":"10.1049/blc2.70052","DOIUrl":null,"url":null,"abstract":"<p>The simultaneous achievement of scalability, security and decentralisation remains an open problem for distributed ledger technologies. This paper introduces InternxtChain, a novel framework leveraging Internxt's decentralised storage infrastructure with zero-knowledge proofs (ZKPs) and sharded proof-of-storage (SPoS) consensus. Specifically, erasure-coded sharding ensures data availability and fault tolerance by splitting files into encoded fragments distributed across nodes; BLS-381 aggregated signatures enable efficient consensus by compressing multiple signatures into a single short proof; and zk-SNARK audits provide tamper-evident storage verification without revealing user data. InternxtChain addresses this challenge through three synergistic mechanisms: (i) erasure-coded sharding with (6,3) Reed–Solomon encoding, (ii) zk-SNARKs for storage auditability and (iii) an SPoS consensus based on BLS-381 aggregated signatures. Experimental evaluation on a testbed of 2048 nodes across 16 geographic regions shows that InternxtChain processes 2800 transactions per second (TPS) with a median latency of 420 ms, while maintaining 99.9% data integrity under up to 30% Byzantine nodes. These results establish a practical path toward harmonising Web3 principles with real-world throughput, cost and General Data Protection Regulation (GDPR) auditability requirements.</p>","PeriodicalId":100650,"journal":{"name":"IET Blockchain","volume":"6 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2026-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/blc2.70052","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Blockchain","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/blc2.70052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The simultaneous achievement of scalability, security and decentralisation remains an open problem for distributed ledger technologies. This paper introduces InternxtChain, a novel framework leveraging Internxt's decentralised storage infrastructure with zero-knowledge proofs (ZKPs) and sharded proof-of-storage (SPoS) consensus. Specifically, erasure-coded sharding ensures data availability and fault tolerance by splitting files into encoded fragments distributed across nodes; BLS-381 aggregated signatures enable efficient consensus by compressing multiple signatures into a single short proof; and zk-SNARK audits provide tamper-evident storage verification without revealing user data. InternxtChain addresses this challenge through three synergistic mechanisms: (i) erasure-coded sharding with (6,3) Reed–Solomon encoding, (ii) zk-SNARKs for storage auditability and (iii) an SPoS consensus based on BLS-381 aggregated signatures. Experimental evaluation on a testbed of 2048 nodes across 16 geographic regions shows that InternxtChain processes 2800 transactions per second (TPS) with a median latency of 420 ms, while maintaining 99.9% data integrity under up to 30% Byzantine nodes. These results establish a practical path toward harmonising Web3 principles with real-world throughput, cost and General Data Protection Regulation (GDPR) auditability requirements.

擦除编码分片和存储证明的实用区块链三难选择平衡
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.80
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书