Nowadays Blockchain has become an important technology which promotes business development. So whoever can manage well core technologies may become the leader in this field. However, while using blockchain technology we still can experience some shortcomings. For example, most blockchain systems still adopt a single linked list structure and on chain commercial applications. The privacy and security of the company might be limited because of the performance of a single chain. So for this issue some public chain projects proposed a multi chain system structure. Unfortunately a multi chain system structure has the low efficiency between cross chain interoperability and the simple multi-chain structure. The commercial demand of monetary valued enterprises indirectly leads to some issues like: ineffective connection of traditional user groups and commercial institutions, the problem of weak liquidity, the low user trust caused by the lack of effective supervision methods in the existing blockchain. All of the problems mentioned above deeply limit the desire of enterprises in various fields to use blockchain technology.
As the world’s first scalable blockchain infrastructure based on IPv8 technology, BitCherry has built an innovative physical layer network protocol which is P2Plus end-to-end encryption. Current innovative network protocol has already achieved some improvements like: an improved spectrum from the high scalable hash map data architecture, improved smart contracts, cross chain consensus and other operating mechanisms. The innovative network protocol can provide global businesses with a high performance, high security, and high underlying technical support. Current services might be involved in different fields like: finance, product traceability, asset digitization, commercial consumption, e-commerce, cloud computing and also in many other fields.
The article above gives a quick introduction of project- BitCherry. The detailed explanation about aBFT+PoUc consensus algorithm will be explained on the following text content.
1. aBFT+PoUc consensus mechanism
Basic consensus algorithm of aBFT
BitCherry uses a distributed blockchain system; the consensus algorithm running environment is similar to the execution environment of distributed systems. It ensures the safety and reliability of the consensus algorithm. aBFT is the basis of consensus algorithm which is fully asynchronous by BitCherry. It does not have to waste a lot of energy for PoW problems caused by nor node PoS / DPoS bugs. The system has also inherited the advantages of aBFT distributed consensus algorithm in solving the problem of fault tolerance and malicious nodes. But it also has the following shortcomings:
1. There is no complete certainty of consensus. It is just operates by timing, the probability of tampering becomes smaller and smaller, forming final certainty, so the time for consensus determination is also related to the number of nodes;
2. All nodes participating in the transaction participate in the consensus as well, this also limits the TPS of the hash graph from both the network bandwidth and the CPU/GPU computing power.
Safe and efficient consensus algorithm: aBFT+PoUc consensus mechanism
On a consensus algorithm, BitCherry’s data structure is based on the hash map. It is the block chain pioneering technology with six degrees of separation theory, which demonstrates the value of PoUc user, selects consensus nodes, optimizes the network propagation consensus process. Current system is combined with BitCherry original P2Plus network protocols, and multiple types of applications BitCherry side chains which allows to create a unique aBFT + PoUc consensus.
It is different from the DPoS method; all users can participate in the PoUc consensus. The algorithm automatically selects neighboring nodes and non-neighboring nodes to virtual voting according to the relationship graph algorithm, and refers to their weights for virtual voting. The selected nodes will receive accounting rewards. The selection rule of the neighboring endorsed nodes is based on the node network bandwidth/delay, the close centrality of the main/side chain relationship map and the node’s Bit-U value. The node network connection and relationship map are only calculated by level. The Bit-U value of the node is selected first; the selection rule for the large V node gives priority to the Bit-U value of the node when the node bandwidth/delay threshold is met. In the node selection process, the degree of deduplication and randomness between rounds are specified. The nodes that are repeated between two adjacent rounds do not exceed 1/3 and are randomly selected. Newly selected nodes are randomly selected according to 1/3 of the number of candidate nodes.
In simple terms, BitCherry consensus algorithm is based on aBFT, so any node that satisfy the condition (based on the unique value of Bit-U prefers the neighbor node) can participate in the process of the whole PoUc consensus and almost all important nodes in the circle will also participate in the PoUc consensus process.
2. Incentive Mechanism Bit-U
Although Hashgraph is based on the aBFT algorithm and treats all nodes equally and can be decentralized to the greatest extent, it also lacks incentives for the entire economic system. Thus, BitCherry uses Bit-U incentives, Bit-U formed by the superposition of four dimensions, the user will have any dimension obtained for excitation, the excitation multidimensional is greater. T is the time dynamics, R for the user relevance, A is for user activeness and C is for user’s contribution.
Time Dynamics T: Determined by the length of time the user holds to pass. This indicator is mainly determined by the time the user holds the pass. We believe that long-term pass holders are more credible than non-holders and have less motivation for evil.
User relevance R: It is determined by the user relationship circle and relationship activity. The relationship map includes: social relationship, e-commerce relationship, knowledge sharing relationship, and resource sharing relationship;
User Activeness A: It is composed of user online time/frequency, social activeness, transaction activeness, and sharing activeness;
User contribution C is divided into two categories:
Cloud computing mining machine resource Cm: In addition to mining participation, cloud computing mining machine resource Cm also includes: IPFS storage resources, gateway bandwidth resources, and CPU/GPU computing resources;
External interface resource Cb: External resource Cb mainly refers to the provision of external resources for the public chain, including: advertising/sales and other commercial intermediary services, arbitration/mantra services, etc., mainly for the public chain to open up information about the external physical world, the traditional Internet, and the Internet of Things , Funds, equipment, and services that goods to provide.