Overview

BitCherry is the world’s first commercial scalable blockchain infrastructure based on IPv8 technology. BitCherry public chain mainnet was officially launched, user will experience: token issue, DApp deploys and operation, pledge to vote, digital asset transfer and so on. Since the blockchain runs in a decentralized network environment, and the creation and storage of data is not dependent on by cryptography, thus BitCherry public chain is considered to be one of the most secure public chain systems. At the same time, thanks to good architecture design and programming skills, operational efficiency and stability, BitCherry public chain is far ahead of other public chains.

Technical Realization

BitCherry public chain using the highly abstract idea of modular design, the system is divided based network, database storage, consensus algorithms, network protocols, transaction processors, virtual machines, application layer interfaces, and several core modules.

P2Plus Protocol In terms of technical implementation, one of the core technologies of the P2Plus protocol is the virtual network card technology. The virtual network card is the host computer that simulates a network card driver at the operating system level. It can be configured like other physical network cards or can be configured in the service program. The application layer sends and receives data to the virtual network card. For this reason, P2Plus can implement a virtual network card driver in the Windows/macOS/Linux operating system on the host side, thereby achieving cross-platform access on the host side. At the network protocol level, P2Plus refers to mainstream VPN technologies such as PPP, PPTP, L2TP, IPSec, and SSLVPN, especially OpenVPN technology. OpenVPN is inherently equipped with many security features. It runs in userspace and does not need to modify the kernel and network protocol stack. After the initial completion, it runs in chroot mode, giving up root permissions and using mlockall to prevent sensitive data from being exchanged to disk.

HashRelationshipSpectrum DAG represented by IOTA, with the name "Directed Acyclic Graph", can achieve 100,000+ TPS from the start, and the transaction cost can be meagre. "Directed" refers to a direction, and to be precise, it should be the same direction. "Acyclic" does not constitute a closed-loop. In DAG, there is no concept of a block. Its constituent unit is a transaction, and each company records the trade of a single user, which saves the time for packing and generating blocks. The verification method relies on the verification of the previous transaction by the next marketing. In other words, if you want to make a transaction, you must verify the prior transaction, and verify several transactions in detail, according to different rules. This verification method allows DAG to write many transactions asynchronously and concurrently, and finally constitute a topological tree structure, which can significantly improve scalability. But its shortcomings are: the transaction duration is uncontrollable and does not support strong consistency.

Hashgraph HashGraph is a DAG with a unique structure. The current transaction of each node must rely on its last trade, and the previous commerce synchronized by other nodes. The consensus synchronization between nodes is through the GossipofGossip protocol so that each node maintains the communication history between all nodes and other nodes. When each node completes the Byzantine protocol, it does not need to go through multiple rounds of network communication. The Byzantine agreement can be simulated directly. Besides, unlike DAG, which does not provide consistency, Hashgraph guarantees final consistency through a virtual voting mechanism.

Consensuses Algorithm aBFT Hashgraph uses the Byzantine fault-tolerant algorithm in a peer-to-peer distributed network, and the rights and interests of nodes are entirely equal. Therefore, there is no large amount of energy waste caused by PoW proof of work, and no evil node, excessive centralization and forerunner Matthew effect caused by PoS/DPoS rights and interests. It inherits the aBFT distributed consensus algorithm in solving fault tolerance and Advantages of malicious nodes.

Fully asynchronous Byzantine fault-tolerant aBFT, which means that it does not make any assumptions about how fast the message is transmitted on the Internet, thus solving the problem of the traffic multiplier effect caused by the traditional synchronous aBFT algorithm network broadcast, and it also eliminates the impact of the PBFT algorithm. The number of nodes is limited, and it can also resist DDoS attacks, botnets and firewalls.

Consensus mechanism aBFT+PoUc The disadvantage of the aBFT algorithm is that it does not achieve the complete certainty of the consensus. It just becomes less and less likely to be tampered with over time, forming absolute certainty. Therefore, the time for consensus determination is also related to the number of nodes; All nodes participating in the transaction experience in the consensus, which also limits the TPS of the hash graph from both the network bandwidth and CPU/GPU computing power.

Thus, the consensus mechanism, BitCherry data structure based on the hash map, the blockchain pioneering technology with six degrees of separation theory, demonstrated the value of PoUc user, selection of consensus nodes, the network propagation consensus process optimization, combined with BitCherry original P2Plus network protocols, and BitCherry applications side-chain:

• Electricity supplier in the transaction chain
• The chain of social relationships
• Knowledge sharing chain
• Cloud computing chain (storage/gateway/computing / AI)
• Creating a unique aBFT+PoUc consensus

Different from DPoS, all users can participate in the PoUc consensus. The algorithm automatically selects neighbouring nodes and non-neighbouring nodes according to the relationship graph algorithm and refers to their weights for virtual voting. The selected node will receive an accounting reward.

The selection rule of the neighbouring endorsed nodes is based on the node network bandwidth/delay, the relative centrality of the primary/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 of the large V node is to give 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 games do not exceed 1/3 and are selected randomly. The newly chosen nodes are chosen randomly according to 1/3 of the number of candidate nodes. From this algorithm, it can be seen that almost all large V nodes that meet the network conditions can participate in the PoUc process of the entire network, and practically all nodes in the circle of friends will also participate in the PoUc consensus process of a friend.

Incentive Mechanism Bit-U BitCherry using Bit-U incentives to reward contribution to the entire user base set up and blockchain through economic and ecological certificate

Bit-U is composed of 4 dimensions superimposed, and users will be motivated if they have any size. The more dimensions, the greater the incentive:

① Time activity T is determined by the length of time the user holds the token, and a logarithmic formula is used to avoid the Matthew effect of first-mover advantage (FMA);

② User relevance R is determined by the user relationship circle and related activity. The relationship map includes: social relationship, e-commerce relationship, knowledge sharing relationship, and resource sharing relationship;

③ User activity A consists of user online duration/frequency, social action, transaction activity, and sharing activity;

④ User contribution C is divided into two categories: cloud computing mining machine resources Cm and external interface resources Cb. In addition to mining participation consensus, cloud computing mining machine resources Cm also includes IPFS storage resources, gateway bandwidth resources, and CPU/GPU computing resources, external resources Cb mainly refers to the provision of external resources including BitCherry: advertising/sale of other commercial intermediary services, arbitration/mantra services, mostly for BitCherry open up the outer physical world, the traditional Internet, the information of things, money, equipment, goods available service.

Hash Ring (sharding) BitCherry fragmentation is achieved by dividing the map of the relationship between the range of slicing hash rings if the external lateral side chain is a blockchain extension. The fragment is the inner longitudinal sections of the blockchain. Commonly used fragmentation techniques include storage fragmentation, transaction fragmentation, and state fragmentation. The biggest problem with fragmentation is cross-shard transactions. Since cross-shard synchronous transactions will lose performance, asynchronous transactions will harm security. Therefore, even for ETH2.0, there are currently restrictions on cross-shard transactions, that is, the transaction must specify the shard in which it is located, so the actual application scenarios are minimal.

The BitCherry is based on a hash map showing the relationship; therefore, by six degrees of separation theory, the same type of relationship usually concentrated in a small circle around in a similar process of friends, both large and small fragments form a relationship Hash circle, cross Fragmentation transactions will be significantly reduced.

Hash body (side chain) Technical hashing is divided by the type of side chain DApp technology, a side chain for improving the technique originally TPS, and in BitCherry, the transaction is based on the actual underlying data hash to the neighbour node for the associated structure of FIG. The traditional side chain technology has multiple side chains anchoring the main chain, which is a numerous one-way linked list structure with intersection points in the unit of block. DAG is a directed acyclic graph structure with the transaction as the unit. DAG is a structure limited by adjacent nodes. The hash body is a three-dimensional structure that is sliced by DApp type, and the interface is a hash graph.

Zero-knowledge proof ZKP Zero-knowledge proof means that it can fully prove that oneself is the legal owner of an absolute right, but also does not disclose relevant information, which means that the "knowledge" to the outside world is "zero". For example: If A wants to prove to B that he has the key to a particular room, suppose that the room can only be opened with the resolution, and cannot be opened by any other method. There are two methods:

Method one: A shows the key to B, and B uses this key to unlock the room to prove that A has the correct access to the room.

Method Two: B confirms that there is an object in the room, and A uses the key he owns to open the door of the room, and then takes the item out and shows it to B, thereby proving that he does have the key to the room.

Cross-chain Although BitCherry backbone + pendant + fragmentation, it has been able to provide high performance. But BitCherry other public chain and chain technology alliances, uphold openness, cooperation and healthy competition posture, build eco-development, information sharing, and high-performance relationship map TPS external output BitCherry, so BitCherry support standard protocols and inter-chain cross-chain Technology, such as IBC, etc.

✅ BitCherry Testnet “DApp Development Contest” Officially Launched, Join and win the USDT now

✅ JOIN BITCHERRY DEVELOPER COMMUNITY
Discord: https://discord.gg/nNY9A9tn2D
Telegram: https://t.me/BitCherryDevelopersGroupEN