Dope Wars, Briq, Loots, The Realms, The Ninth, and Influence, to name a few, belong to this category.In this article, we would like to explore the strengths and weaknesses of each macro-category.
Each node has to verify the validity of every computation the users send to the network on blockchains. One of the major bottlenecks of blockchains' scalability is how to increase computational bandwidth without increasing the verification cost, which is ultimately the decentralization guarantee of a blockchain. The higher the verification cost, th... See more
The network nodes can verify the attached proofs several orders of magnitude faster and cheaper than verifying the computation itself, thus enabling complex computation at a pretty cheap cost, such as gaming dynamics.
For example, Starknet's virtual machine, powered by Cairo, unleashes this true potentiality as their native programming language is not bounded by the EVM constraints.
This is a fundamental shift in blockchain scaling.Running a game completely on-chain on a monolithic blockchain is economically unfeasible and will remain so for the foreseeable future. That is why most of the blockchain games that have been released in the past few years are in a hybrid form, having only a few components of their stack on-chain wh... See more
Blockchains charge a monetary fee to the users proportional to the computational burden the nodes must verify. Thus, on this monolithic stack, the computation cost is quite high. Developers have been forced to write their code around such constraints, not being able to express the true potential of on-chain applications.
Since the advent of Optimistic Rollups (ORUs) and Zk-Rollups (ZRUs), the paradigm has changed.Computation is run off-chain by high-end machines (the provers) while posting a fraud proof (on ORUs) or a validity proof (on ZRUs) on a settlement chain, which can prove the computation integrity, or in other words, that the computation has been executed ... See more