Name
Abstract | ||
|---|---|---|
AbstractWith 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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1145/3412341 | ACM Transactions on Internet Technology |
Keywords | DocType | Volume |
Nakamoto consensus, throughput, consistency, decentralization | Journal | 20 |
Issue | ISSN | Citations |
4 | 1533-5399 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ruan Na | 1 | 48 | 5.63 |
| Dongli Zhou | 2 | 0 | 0.34 |
| Weijia Jia | 3 | 2656 | 221.35 |