The reviewed record of science sign in
Pith

arxiv: 1803.09029 · v9 · pith:3YWC7HXP · submitted 2018-03-24 · cs.CR

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

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:3YWC7HXPrecord.jsonopen to challenge →

classification cs.CR
keywords architectureblockblockcliquetransactionsavailablebandwidthgraphsecond
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.