Controlling Transaction Rate in Tangle Ledger

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.

Block diagram

Block diagram for our proposed transaction rate control mechanism in Tangle. For simplicity, the block diagram illustrates the case when the different types of agents are equal to 2.
Block diagram for our proposed transaction rate control mechanism in Tangle. For simplicity, the block diagram illustrates the case when the different types of agents are equal to 2.

Results

PoW difficulty level vs. number of agents for our proposed transction rate control mechanism. As number of agents increases, PoW difficulty level increases for all agents but the marginal increase in PoW difficulty level decreases with number of agents. So, our proposed transaction rate control mechanism does not incur a substantial increase in computation cost to agents with an increase in the number of agents.
PoW difficulty level vs. number of agents for our proposed transction rate control mechanism. As number of agents increases, PoW difficulty level increases for all agents but the marginal increase in PoW difficulty level decreases with number of agents. So, our proposed transaction rate control mechanism does not incur a substantial increase in computation cost to agents with an increase in the number of agents.
WoT vs. number of agents for our proposed transaction rate control mechanism. WoT increases with number of agents to compensate for the increase in PoW difficulty level. Marginal increase in WoT decreases with number of agents. Hence, our proposed transaction rate control mechanism ensures that the relative WoT of agents with small computing power (with respect to the WoT of agents with high computing power) does not degrade rapidly with the number of agents
WoT vs. number of agents for our proposed transaction rate control mechanism. WoT increases with number of agents to compensate for the increase in PoW difficulty level. Marginal increase in WoT decreases with number of agents. Hence, our proposed transaction rate control mechanism ensures that the relative WoT of agents with small computing power (with respect to the WoT of agents with high computing power) does not degrade rapidly with the number of agents
Cumulative weight of transactions vs. the number of agents for our proposed transaction rate control mechanism solved by the PAP. The cumulative weights are calculated after 200 new transactions have been added in Tangle (100 simulations). Agents assigned difficult PoW have to wait for a lesser time on average for approval of their tip transactions. This is because they are assigned a higher WoT. Agents assigned lower PoW difficulty levels have to wait for longer on average for approval of their transactions. This is because they are assigned a lower WoT. Hence, the cumulative weight of agents with higher computation power increases at a faster rate.
Cumulative weight of transactions vs. the number of agents for our proposed transaction rate control mechanism solved by the PAP. The cumulative weights are calculated after 200 new transactions have been added in Tangle (100 simulations). Agents assigned difficult PoW have to wait for a lesser time on average for approval of their tip transactions. This is because they are assigned a higher WoT. Agents assigned lower PoW difficulty levels have to wait for longer on average for approval of their transactions. This is because they are assigned a lower WoT. Hence, the cumulative weight of agents with higher computation power increases at a faster rate.
Comparison of WoT vs. PoW assigned to agents by the proposed transaction rate controller, and a fixed transaction rate control scheme. The fixed transaction rate control schemes assign WoT as a linear function of the PoW difficulty level and is independent of the total number of agents. This does not guarantee that agents will perform a difficult PoW and hence, the transaction rate increases with an increase in the number of agents. The transaction rate control mechanism assigns WoT as a non-linear function of PoW difficulty level and the total number of agents 𝑁 . The non-linearity incentivizes agents to perform difficult PoW, i.e., agents obtain a higher utility by truthfully solving the PoW at a difficulty level assigned to them. A higher PoW difficulty level is desirable as it makes it difficult for an adversary to tamper transactions in Tangle; this makes Tangle more secure. Also, a higher PoW difficulty level brings down the transaction rate.
Comparison of WoT vs. PoW assigned to agents by the proposed transaction rate controller, and a fixed transaction rate control scheme. The fixed transaction rate control schemes assign WoT as a linear function of the PoW difficulty level and is independent of the total number of agents. This does not guarantee that agents will perform a difficult PoW and hence, the transaction rate increases with an increase in the number of agents. The transaction rate control mechanism assigns WoT as a non-linear function of PoW difficulty level and the total number of agents 𝑁 . The non-linearity incentivizes agents to perform difficult PoW, i.e., agents obtain a higher utility by truthfully solving the PoW at a difficulty level assigned to them. A higher PoW difficulty level is desirable as it makes it difficult for an adversary to tamper transactions in Tangle; this makes Tangle more secure. Also, a higher PoW difficulty level brings down the transaction rate.

Reference

Controlling Transaction Rate in Tangle Ledger: A Principal Agent Problem Approach

Author

Anurag Gupta is an M.S. graduate in Electrical and Computer Engineering from Cornell University. He also holds an M.Tech degree in Systems and Control Engineering and a B.Tech degree in Electrical Engineering from the Indian Institute of Technology, Bombay.

Comment

* Required information
1000
Drag & drop images (max 3)
Captcha Image
Powered by Commentics

Past Comments

No comments yet. Be the first!

Similar content

$topic->title

Minimize Wastage of Foam Board for Building a RC Airplane
$topic->title

Room Allocation and Rent Division
$topic->title

Remote Controlled (RC) Airplane
$topic->title

Optimal Travel Route | OpenStreetMap, OR-Tools
$topic->title

Binomial Theorem
$topic->title

Sequence and Series