(ANN)PonD(Proof of network Dispersity) BlockChain Project

(ANN)PonD(Proof of network Dispersity) BlockChain Project

Project IntroductionThis project is aimed to build a set of blockchains with a new consensus protocol: Proof of network Dispersity, which could solve some common problems of existing POW and POS protocol to make it more environment friendly and fairer. On top of that, a series of blockchains with different tasks and functions will be established, necessary rewards will be distributed to developers within the protocol layer and simplify the business model of side-chain projects, which eventually makes this project as an open scalable system, and provides a safer, fairer and more flexible platform in the blockchain, especially cryptocurrency industry.Design BackgroundMy initial design intention is to create an unduplicated proof of capability by making use of the feature of network lantency to realize POW consensus with low energy consumption.The "Proof of work" protocol is being criticized because of the energy consumption. But regardless of the energy problem, POW is still the most essential and effective method of the blockchain system. With the logic of "able people should get more pay", proof-of-work is the first consensus protocol that makes a total decentralized system work. All of the other protocols are following the same logic, like Proof of Activity, Proof of Burn, Proof of Storage, Proof of Elasped Time, and so on. "Proof of stake" is the most popular one of them because it doesn’t need any external resources and consumes low energy by expanding the main logic from "able people should get more pay" to "rich people should get more pay", which makes the mining competition is only among the static inner states and there is no need for power consumption. But "POS" mode has its own flaw such as "nothing at stake" which can casue multiple voting problem, "stake grinding attack" and so on. An inevitable problem of "POS" is caused by the logic: "rich people should get more pay". Whenever the miners spend the same amount of time, the richer ones earn more, so that the rich miners tend to spend more time to work than others. In that case, the rich miners will gradually become richer and richer and this process will be ever-accelerated until there are only some richest users left in the system. By the way, some POS protocols offer "interests" to every stake holders to replace the mining process. It seems that they resolved the problem above but those protocols are vulnerable for lack of incentive to maintain the network.The original intention of this article is to find another low energy consumption "proof of ability" to replace "proof of stake". Considering the following fact: Because of the network lantency, the more online terminals work together, the faster they pick up randomly distributed information in the network. And this is a kind of "ability" that I called “network dispersity”. Which can not be improved by enhancing the performance of a single machine or using more electric power. In the process of the designing, I realized that the "stake" property is inextricable and the best choice is to use both "ability" and "stake" at the same time and users could determine by themselves whether to use "stake" or "ability". By Guiding the users with appropriate profit distribution to ensure the most fairness and safety.BenifitsCompared with "POW" and "POS", this model has the following benefits: No hashpower competition and no high-energy-consumption; →No "nothing at stake" and "stake grinding" attack;→Optimized wealth distribution based on "stake" and Miners replace all the inactive nodes to maintain the network;→The new way of mining competition helps change the environment of App or website development and improve the user experience of them.→(note: Because this article is only discussing the situation of fully decentralized systems, protocols like "PBFT", "DPOS", "Ripple" will not be involved.)

Share your thoughts, add a comment!

You must be logged in in order to place a comment.

Article comments

Loading...
No comments yet, be the first to comment this article