Name
Abstract | ||
|---|---|---|
The main problem faced by smart contract platforms is the amount of time and computational power required to reach consensus. In a classical blockchain model, each operation is in fact performed by each node, both to update the status and to validate the results of the calculations performed by others. In this short survey we sketch some state-of-the-art approaches to obtain an efficient and scalable computation of smart contracts. Particular emphasis is given to sharding, a promising method that allows parallelization and therefore a more efficient management of the computational resources of the network. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.33166/AETiC.2019.05.002 | arXiv: Cryptography and Security |
DocType | Volume | Issue |
Journal | abs/1904.00731 | 5 |
ISSN | Citations | PageRank |
Annals of Emerging Technologies in Computing (AETiC) - 2019 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alessio Meneghetti | 1 | 2 | 5.58 |
| Tommaso Parise | 2 | 0 | 0.34 |
| Massimiliano Sala | 3 | 32 | 20.29 |
| Daniele Taufer | 4 | 0 | 0.68 |