In the real world, consensus achievement is an adaptive and evolutionary process. Tailor-made mechanisms are engaging in the light of disputes to resolve emerging contradictions between the atoms. Most of the dominant blockchain architectures tend to oversee this fact. They come integrated with rigid, overkilling consensus-achievement procedures, which, in many cases, are not necessary or significantly beneficial. They often raise overwhelming demands on the nodes and prohibit the deployment of fully distributed and peer blockchain operation in the IoT world. Still, for the IoT ecosystems and the metaverse to become self-sustainable and self-evolving, robust validity mechanisms must be embedded in the atomic scale. This work investigates the process of building and sustaining scalable consensus policies over the trivial atomic capacities of the IoT ecosystems. For this, we deploy the IoT microblockchain framework as an atomic consistency tier and we define a primary set of validity rules that every node can easily carry out. The initial concept relies on Gödel’s incompleteness theorems and K. Friston’s free energy principle and is investigated under the perspectives of graph and game theory. To study the dynamic behavior of the system, a competitive game among the nodes is run. The Proof of Existence (PoE) is utilized as a universal proofing case. Its feasibility is demonstrated, and its complexity is analyzed under various system considerations. The findings prove that finite-capacity atoms can collectively and efficiently support verifiable validity and scalable consensus in the evolutionary IoT ecosystems and the metaverse, even under conditions of high diversity, trivial capacity, and eventual consistency.
₹10000 (INR)
IEEE-2023