Back to Search Start Over

Ursa

Authors :
Dongli Zhou
Na Ruan
Weijia Jia
Source :
ACM Transactions on Internet Technology. 20:1-26
Publication Year :
2020
Publisher :
Association for Computing Machinery (ACM), 2020.

Abstract

With the increasing number of users in blockchain-based cryptocurrencies, the public has raised the demand for transaction throughput, and many protocols are designed to improve the throughput following the Nakamoto consensus. Although astonishing progress has been made in the on-chain throughput improvement, high throughput makes the blockchains suffer from the increasing blockchain size, hard forks, and possible attacks. In this work, we propose a quantitative model to describe and analyze the Nakamoto consensus. We then design a robust scheme named Ursa to reduce storage requirements and to reduce the forks by automatically adjusting block size according to users’ needs.

Details

ISSN :
15576051 and 15335399
Volume :
20
Database :
OpenAIRE
Journal :
ACM Transactions on Internet Technology
Accession number :
edsair.doi...........a5a366a4417ecabad6cfce4ade5a5313
Full Text :
https://doi.org/10.1145/3412341