HackerPapers

arXiv:1803.09029cs.CR

Blockclique: scaling blockchains through transaction sharding in a multithreaded block graph

Sébastien Forestier, Damir Vodenicarevic, Adrien Laversanne-Finot

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

Decentralized crypto-currencies based on the blockchain architecture under-utilize available network bandwidth, making them unable to scale to thousands of transactions per second. We define the Blockclique architecture, that addresses this limitation by sharding transactions in a block graph with a fixed number of threads. The architecture allows the creation of intrinsically compatible blocks in parallel, where each block references one previous block of each thread. The consistency of the Blockclique protocol is formally established in presence of attackers. An experimental evaluation of the architecture's performance in large realistic networks demonstrates an efficient use of available bandwidth and a throughput of thousands of transactions per second.

arXiv comments
Journal reference
DOI
Subjects
cs.CRCryptography and Security

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Feb 2021 to Feb 2021.

Comments linking this paper, per year.

Discussed in comments1 thread

    • That's still 2 orders of magnitude off: to reach something akin to Visa/Mastercard (tens of thousand tx/s) with a single-chain and a 10-min block target spacing, you'd need a block-size of tens of GB! Good luck finding people willing to run a full-node for zero compensation in…

      littlestymaarView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.