At present, although the block chain that has entered into real technology and applications is slowly being accepted by the public, it is clear that there is still a long way to go before it is widely used. One of the biggest obstacles to the blockchain.
The response speed itself.
More and more companies are coming into contact with, understanding and accepting the concept of virtual currency payment transactions, such as Bitcoin and Ethernet Square, but if you really want to use virtual currency as a formal and universal payment method and occupy the cross-border transaction market.
Its performance and corresponding technical basis need to reach the level of active competition between traditional payment methods such as Visa and Mastercard. Judging from the current facts, the blockchain is still too backward. At present, the performance of block chain can not meet this requirement. Bitcoin can only handle less than 10 transactions per second. Ethernet Square can only process less than 40 transactions per second at its peak. By contrast, Visa can handle 2000 to 5000 transactions per second, and the gap is significant. At present, several blockchain projects try to solve the performance problem of blockchain in different ways.
Etay Square has put forward its own expansion plan-Ethernet Square 2.0, but the current development progress is very slow, and expansion and upgrade are nowhere to be seen.
In the field of blockchain, in order to improve performance, it is usually necessary to sacrifice its security or dispersion.
This is the block theory of “impossible triangles”, which is often accepted and widely accepted.
As the latest extension solution, fragment technology is the only way to break through impossible triangles.
As far as the fragments of the block chain are concerned, it is divided and ruled, and the whole block chain is horizontally divided into smaller books. In fact, traditional centralized information systems have begun to use fragmentation technology, but until recently, this technology began to attract the attention of the blockchain world. Although this is a period of split technology, the fragmentation technology of AMBG and Zilliqa is obviously different. Zilliqa only segments the network and transactions, and AMBG further divides the block chain state on this basis.
In short, Zilliqa divides network nodes into different shards, and each shard contains hundreds of nodes (that is, network shards), allowing each shard to process different transactions at the same time (that is, transaction fragmentation).
However, in order to handle cross-chip transactions, each node of each slice needs to store the entire ledger data of the block chain, which makes some poor performance nodes unable to participate in the network, thus weakening the dispersion.
In contrast, AMBG also performs fragmentation (that is, state fragmentation) on the ledger data of the blockchain.
The team named this summary scheme all aspects of fragmentation technology and called it “deep fragmentation.”
Deep slicing is a multi-layer slicing of networks, transactions, and states.
At the same time, in the data transmission protocol of the network layer, the block data is segmented by erasure code technology, so that the network pressure of the broadcaster is less.
In addition, the Kademlia routing protocol is introduced to allow block data to be transmitted to the destination through the shortest path.
On this basis, small nodes can be added to ensure maximum dispersion.
PBFT consensus mechanism / PBFT consensus mechanism.
In the past, the consensus mechanism of Zilliqa was called PBFT (Practical Byzantine Fault Tolerance) protocol.
In this protocol, one node is selected as the “leader” and the other nodes are selected as the “verifier”.
Each consensus process consists of two stages: preparation and submission. At each stage, the leader broadcasts the proposal to all inspectors. After all the verifiers received the proposal, they then broadcast their votes to others. Finally, each verifier must calculate all other votes received.
This process results in a total message complexity of O (n * n), where n is the total number of nodes.
From the simple calculation, we can see that the algorithm is not practical in the network with hundreds of nodes.
AMBG makes many improvements based on the PBFT algorithm to create the FBFT algorithm (fast Byzantine algorithm).
In this new algorithm, the verifier does not need to broadcast their vote, but simply sends the vote to the leader through a digital signature, and the leader synthesizes the received digital signature into the amount of data O (1).
Multiple signatures are then broadcast, reducing the message complexity of the entire consensus process from O (n * n) to O (n).
In addition, the selection of verifiers is done through the PoS adjunct tagging mechanism.
Nodes that want to be witnesses need to mortgage a certain number of tokens to participate in the consensus.
PoS is more energy efficient than PoW.
At this point, PoS-based AMBG has an advantage over PoW-based Zilliqa. The more tokens are guaranteed, the more likely they are to be chosen as leaders, but precisely because there are more mortgage tokens, they will not easily do evil, because once they are censored online, their mortgage tokens will be completely confiscated.
Contact Detail:
Company Name: AMBG
Contact Person: Zoji
Email: Send Email
Phone No: +16265395098
Country: United States
Source: www.PRExhibition.com
Be First to Comment