Tangle 账本中的交易速率控制:一种委托-代理问题方法
Controlling Transaction Rate in Tangle Ledger: A Principal Agent Problem Approach
AI总结:
本文提出用委托-代理问题框架控制 Tangle 交易速率,通过讲真话机制按计算能力分配 PoW 难度并以权重/声誉补偿,在提高安全性的同时调节交易速率,并给出混合整数优化求解及数值验证。
摘要:
Tangle 是一种分布式账本技术,以有向无环图(DAG)的形式存储数据。与区块链不同,Tangle 的运行不需要专用矿工;这使得 Tangle 适用于物联网(IoT)应用。分布式账本具有内置的交易速率控制机制,以防止拥塞和垃圾交易;这通常通过根据用户数量提高或降低工作量证明(PoW)难度级别来实现。不幸的是,这种简单化的机制给具有高计算能力的用户带来了不公平的优势。本文提出了一种来自微观经济学的委托-代理问题(PAP)框架,用于控制 Tangle 中的交易速率。以用户作为代理人、交易速率控制器作为委托人,我们设计了一种讲真话机制,根据代理人的计算能力为其分配 PoW 难度级别。PAP 的求解通过用更大的交易权重/声誉来补偿更高的 PoW 难度级别来实现。该机制有两个好处:(1)Tangle 的安全性得到提高,因为代理人被激励去执行高难度的 PoW;(2)Tangle 中新交易的速率得到调节。PAP 的解通过求解一个混合整数优化问题获得。我们证明,PAP 的最优解随着代理人计算能力的增加而增加。这些结构性结果缩小了混合整数规划的搜索空间,并使得最优机制能够高效计算。最后,通过数值示例,我们说明了交易速率控制机制,并研究了其对 Tangle 动态的影响。
英文摘要:
Tangle is a distributed ledger technology that stores data as a directed acyclic graph (DAG). Unlike blockchain, Tangle does not require dedicated miners for its operation; this makes Tangle suitable for Internet of Things (IoT) applications. Distributed ledgers have a built-in transaction rate control mechanism to prevent congestion and spamming; this is typically achieved by increasing or decreasing the proof of work (PoW) difficulty level based on the number of users. Unfortunately, this simplistic mechanism gives an unfair advantage to users with high computing power. This paper proposes a principal-agent problem (PAP) framework from microeconomics to control the transaction rate in Tangle. With users as agents and the transaction rate controller as the principal, we design a truth-telling mechanism to assign PoW difficulty levels to agents as a function of their computing power. The solution of the PAP is achieved by compensating a higher PoW difficulty level with a larger weight/reputation for the transaction. The mechanism has two benefits, (1) the security of Tangle is increased as agents are incentivized to perform difficult PoW, and (2) the rate of new transactions is moderated in Tangle. The solution of PAP is obtained by solving a mixed-integer optimization problem. We show that the optimal solution of the PAP increases with the computing power of agents. The structural results reduce the search space of the mixed-integer program and enable efficient computation of the optimal mechanism. Finally, via numerical examples, we illustrate the transaction rate control mechanism and study its impact on the dynamics of Tangle.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。