论文标题
优化加密货币中的链付款网络
Optimizing Off-Chain Payment Networks in Cryptocurrencies
论文作者
论文摘要
离链交易通道代表了在比特币等加密货币中扩展交易吞吐量的领先技术之一。他们允许多个代理商互相付款。到目前为止，支付网络的拓扑和构建尚未得到太多探索。预计参与者将最大程度地减少由于流动性分配以及区块链创纪录的费用所致的成本。在本文中，我们研究了此类网络的维护成本的优化。我们首次提出了对称离子离子通道的封闭模型，并提供了有效的算法，用于在此模型下构建最小成本跨越树网络。我们证明，对于任何网络需求，一个简单的枢纽拓扑为最小维护成本提供了2个附属性，表明一般跨越树是有效的。当每个玩家希望通过更改网络的结构来最大程度地降低他的成本时，我们还在交易者之间的贪婪游戏中表现出无限的无政府状态价格。最后，我们模拟和比较付款网络的成本与规模自由需求拓扑。
Off-chain transaction channels represent one of the leading techniques to scale the transaction throughput in cryptocurrencies such as Bitcoin. They allow multiple agents to route payments through one another. So far, the topology and construction of payment networks has not been explored much. Participants are expected to minimize costs that are due to the allocation of liquidity as well as blockchain record fees. In this paper we study the optimization of maintenance costs of such networks. We present for the first time, a closed model for symmetric off-chain channels, and provide efficient algorithms for constructing minimal cost spanning-tree networks under this model. We prove that for any network demands, a simple hub topology provides a 2-approximation to the minimal maintenance cost showing that spanning trees in general are efficient. We also show an unbounded price of anarchy in a greedy game between the transactors, when each player wishes to minimize his costs by changing the network's structure. Finally, we simulate and compare the costs of payment networks with scale free demand topologies.
