Name
Abstract | ||
|---|---|---|
Payment networks, also known as channels, are a most promising solution to the throughput problem of cryptocurrencies. In this paper we study the design of capital-efficient payment networks, offline as well as online variants. We want to know how to compute an efficient payment network topology, how capital should be assigned to the individual edges, and how to decide which transactions to accept. Towards this end, we present a flurry of interesting results, basic but generally applicable insights on the one hand, and hardness results and approximation algorithms on the other hand. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Data Structures and Algorithms | Discrete mathematics,Approximation algorithm,Know-how,Communication channel,Network topology,Theoretical computer science,Blockchain,Throughput,Cryptocurrency,Payment,Mathematics |
DocType | Volume | Citations |
Journal | abs/1810.07603 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Georgia Avarikioti | 1 | 2 | 2.43 |
| Yuyi Wang | 2 | 11 | 3.69 |
| Rogert Wattenhofer | 3 | 5580 | 384.89 |