Table of Content

Open AccessOpen Access


GaiaWorld: A Novel Blockchain System Based on Competitive PoS Consensus Mechanism

Rui Song1, Yubo Song1,*, Ziming Liu2, Min Tang2, Kan Zhou3

School of Cybersecurity, Key Laboratory of Computer Network Technology of Jiangsu Province, Southeast University, Nanjing, China.
Gaia.World Foundation, Chengdu, China.
Fortiguard Research Centre, Fortinet Technology, Vancouver, Canada.

* Corresponding Author: Yubo Song. Email: .

Computers, Materials & Continua 2019, 60(3), 973-987.


The birth of blockchain has promoted the development of electronic currencies such as Bitcoin and Ethereum. Blockchain builds a financial system based on cryptology instead of credit, which allows parties to complete the transaction on their own without the need for credible third-party intermediaries. So far, the application scenario of blockchain is mainly confined to the peer-to-peer electronic financial system, which obviously does not fully utilize the potential of blockchain.
In this paper, we introduce GaiaWorld, a new system for decentralized application. To solve the problem of resource waste and mismatch between nodes and computing power in traditional PoW mechanism, GaiaWorld introduces a new consensus mechanism called CPoS, which can improve productivity and liquidity of blockchain system. GaiaWorld constructs a new architecture based on forging committee and forging group systems, which can establish a decentralized, free and stable internet trust system, and can be utilized in multiple application scenarios and construct efficient and reliable content delivery systems.


Cite This Article

R. Song, Y. Song, Z. Liu, M. Tang and K. Zhou, "Gaiaworld: a novel blockchain system based on competitive pos consensus mechanism," Computers, Materials & Continua, vol. 60, no.3, pp. 973–987, 2019.


This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 3174


  • 1521


  • 0


Share Link