优化加密货币的链下支付网络
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
