The Revolutionary Effects Of Thinkium Consensus Protocol Implementations Plan
Introduction
Blockchain is a distributed, transparent, immutable ledger. Consensus protocol forms the core of blockchain. They decide how a blockchain works. With the advent of new possibilities in blockchain technology, researchers are keen to find a well-optimized Byzantine fault tolerant consensus protocol. This article is going to give comprehensive details of the revolutionary effects of Thinkium consensus implementation process.
In the Thinkium core engine, there are three types of nodes in each chain: data nodes, consensus nodes, and ordinary nodes. The data node is responsible for the storage of all the data in its chain and the interaction of information between the chains. The main responsibility of the consensus node is the calculation, packaging, and consensusm of the chain. Ordinary nodes do not participate in consensus and verification data and are generally used to carry services. Each participating consensus node is randomly assigned, and they will continue to be re-selected over time.
1. Committee selection:
To resist witch attacks on unauthorized systems that mimic multiple identities, we use a proof-of-stake (PoS) -based election algorithm. In the PoS mechanism, the accounting rights of consensus participants depend on the assets they own. In the consensus algorithm, consensus participants prove their rights and interests by submitting a deposit. The system uses a random algorithm to periodically select a certain number of participants according to the proportion of the deposit to form a committee responsible for block production for a period of time.
Since only the selected committee members are required to participate in each block production, in a multi-chain system, the committees of each chain can coexist and run independently of each other. As the number of nodes in the network increases, more simultaneous operations can be supported by subchains to efficiently use the resources of the nodes.
The selection algorithm requires the following security attributes.
- The honesty ratio of the committee members elected in each election cannot be lower than the security requirements of the consensus algorithm. The algorithm should be fair. The more input each participant has, the probability of being selected.
- Committee members should be fluid and unpredictable so that adversaries cannot attack the system by corrupting committee members (assuming the time of corruption exceeds the life of the committee).
First of all, before the election, since all nodes only monitor the main chain, when the next committee needs to be selected, the subchain must send a signal on the main chain. The election of all the chains is conducted on the main chain. Through the summary information on the main chain, the main chain can collect the election status of each chain for summary publication. At the same time, a random seed is periodically generated on the main chain to ensure the randomness of each chain election.
2. Committee consensus
We assume that there is a partial synchronous communication model within the committee, where an effective Byzantine fault-tolerant algorithm exists, and a tailor-made PBFT variant TBFT algorithm is designed for this purpose. The committee occupies only a small part of the entire network nodes, and they will form a scale of their own smaller networks to reduce the delay of broadcasting so that the block can be produced stably and efficiently.
The execution of nodes can be divided into rounds. Each round consists of three phases:
- Proposal stage: The head of the committee broadcasts the proposed motion to other committee members.
- Preparation stage: After each committee member receives the proposed block, a message containing the signature of the ock is broadcast. If a timeout is triggered before the proposed block is received, the committee members sign and broadcast a special message to the other committee members (indicating the leader is flawed).
- Confirmation phase: At the end of the preparation phase, each committee member signs and broadcasts a signature received during the preparation phase. Signature aggregation can be used to significantly reduce the message size in the confirmation phase.
Based on the information received during the confirmation phase, each committee members can decide whether an agreement on the block has been reached and broadcast the agreed block or empty block and evidence of its decision.
3.Security Analysis
Assume is the number of nodes, is the expected number of nodes in the committee, is the number of committees.
The number of malicious nodes is when the nodes in the committee that exceed the ratio ρ are malicious nodes and we say the committee election failed.
For news and updates about Thinkium, follow Thinkium via this channels:
