Fees
Last updated
Because every transaction published into the blockchain imposes on the network the cost of needing to download and verify it, there is a need for some regulatory mechanism, typically involving transaction fees, to prevent abuse. The default approach, used in Bitcoin, is to have purely voluntary fees, relying on miners to act as the gatekeepers and set dynamic minimums. This approach has been received very favorably in the Bitcoin community particularly because it is "market-based", allowing supply and demand between miners and transaction senders to determine the price. The problem with this line of reasoning is, however, that transaction processing is not a market; although it is intuitively attractive to construe transaction processing as a service that the miner is offering to the sender, in reality, every transaction that a miner includes will need to be processed by every node in the network, so the vast majority of the cost of transaction processing is borne by third parties and not the miner that is making the decision of whether or not to include it. Hence, tragedy-of-the-commons problems are very likely to occur.
However, as it turns out, this flaw in the market-based mechanism, when given a particular inaccurate simplifying assumption, magically cancels itself out. The argument is as follows. Suppose that:
A transaction leads to operations, offering the reward to any miner that includes it where is set by the sender and kkk and are (roughly) visible to the miner beforehand.
An operation has a processing cost of to any node (i.e., all nodes have equal efficiency).
There are mining nodes, each with exactly equal processing power (i.e., 1/ of total).
No non-mining full nodes exist.
A miner would be willing to process a transaction if the expected reward is greater than the cost. Thus, the expected reward is since the miner has a 1/ chance of processing the next block, and the processing cost for the miner is simply . Hence, miners will include transactions where , or . Note that is the per-operation fee provided by the sender, and is thus a lower bound on the benefit that the sender derives from the transaction, and is the cost to the entire network together of processing an operation. Hence, miners have the incentive to include only those transactions for which the total utilitarian benefit exceeds the cost.
However, there are several important deviations from those assumptions in reality:
The miner does pay a higher cost to process the transaction than the other verifying nodes since the extra verification time delays block propagation and thus increases the chance the block will become a stale.
There do exist non-mining full nodes.
The mining power distribution may end up radically inegalitarian in practice.
Speculators, political enemies, and crazies whose utility function includes causing harm to the network do exist, and they can cleverly set up contracts where their cost is much lower than the cost paid by other verifying nodes.
(1) provides a tendency for the miner to include fewer transactions, and (2) increases 𝑁 𝐶 NC; hence, these two effects at least partially cancel each other out. (3) and (4) are the major issues; to solve them we simply institute a floating cap: no block can have more operations than times the long-term exponential moving average. Specifically:
and are constants that will be set to 65536 and 1.5 for the time being but will likely be changed after further analysis.
There is another factor disincentivizing large block sizes in Bitcoin: blocks that are large will take longer to propagate, and thus have a higher probability of becoming stales. In Arcturus, highly gas-consuming blocks can also take longer to propagate both because they are physically larger and because they take longer to process the transaction state transitions to validate. This delay disincentive is a significant consideration in Bitcoin, but less so in Arcturus because of the GHOST protocol; hence, relying on regulated block limits provides a more stable baseline.