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

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

arXiv (Cornell University) · 2018 · 13 citations · 0 references

DOIFull text

Open access

Concepts

Abstract

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