βjust fixing the costs for each primitive operation and amountβ is not easy to do. The network chain dynamically determines the true value of its token for any value that provides a minimum of its token. For example, gas is worth what the world wants to pay for using it as a unit of calculation on a global computer. In order to accurately measure the efforts spent by the network in order to ensure the value of its token unit, we need the DMMS algorithm (as described in the paper of the side chains), and this is nothing more than a block chain with proof of operability.
Each primitive operation needs its own lock to accurately determine its value. When several markers are implemented on the same blockchain, for example, colored / custom coins, it cannot accurately measure the value of one.
In the case of a functional language, one can imagine a lisp blockchain with paul graham 7 primitives implemented as an operation code (the stack-based interpreter does not matter), which will be completed, but will suffer from the problem of determining the true value of each operation code; the cheapest will always be abused, as seen on ethereum (the low cost of the suicide function was spam).
Thus, to achieve a complete chain of a focused chain, a whole network of 7 blocks is required, each of which independently determines the true value of the effort required for this primitive calculation.
People who have alternatives to proof of work will not agree with the foregoing. Cryptocurrency is a new field, and the math is not mature enough for anyone to make specific claims.
source share