wholesale jewelry to sell
1 thought on “wholesale jewelry to sell Several consensus mechanisms and advantages and disadvantages of blockchain”
Leave a Comment
You must be logged in to post a comment.
wholesale jewelry to sell
You must be logged in to post a comment.
wholesale cowrie jewelry First of all, no consensus mechanism is perfect, and each consensus mechanism has its own advantages and disadvantages. Some consensus mechanisms are born to solve some specific problems.
1.pow (proof of work) The workload proof
Introduction to one sentence: the more dry, the more you receive.
The dependent machines for mathematical computing to obtain accounting rights. The resource consumption is higher than other consensus mechanisms and weak regulatory. At the same time, the consensus requires the entire network to participate in the operation. The 50%node on the entire network is wrong.
advantages:
1) The algorithm is simple and easy to achieve;
2) The consensus can be achieved without exchanging information between nodes;
3) The destruction system needs to invest a lot of cost;
Disadvantages:
1) Waste energy;
2) The confirmation time of the block is difficult to shorten;
3) The new blockchain must find a different sketch algorithm, otherwise it will face a Bit Bit The computing power attack of the currency;
4) It is easy to produce a fork, and you need to wait for multiple confirmations;
5) There is never the final nature, and the checkpoint mechanism needs to make up for the final nature;
2.pos proof of stake , Introduction to one sentence: the more I hold, the more I get.
The main idea is to obtain the difficulty of node accounts to obtain the right ratio of node holding. Compared with POW, the resource consumption brought by mathematical computing has been reduced to a certain extent. Based on the way of getting the right to get the accounting rights for hash computing competition, it can be regulated. The fault tolerance of this consensus mechanism is the same as POW. It is an upgrade consensus mechanism for POW. According to the ratio and time of the tokens occupied by each node, the difficulty of mining is reduced, thereby speeding up the speed of finding random numbers
The time of consensus; no need to consume a large amount of energy mining.
Disadvantages: still need mining, which is essentially not to solve the pain point of commercial applications; all confirmations are just an expression of probability, not a certainty, in theory that there may be other attack effects. For example, Ethereum's DAO attack incident caused Ethereum hard fork, and ETC appeared from this incident, which actually proved the failure of the hard fork.
DPOS is the same as the POS principle, but I have selected some "People's Congress representatives".
bitShares community first proposed the DPOS mechanism. The main difference between
This and POS is several agents election, verified and bookkeeping by the agent. Its compliance supervision, performance, resource consumption and fault tolerance are similar to POS. Similar to the board of directors, the currency holders vote for a certain number of nodes, and the agent processes them to verify and account for accounting.
DPOS's working principle is:
The decentralization indicates that each shareholder has influence according to its shareholding ratio. The result of 51%of shareholders' voting will be irreversible and binding. Its challenge is to reach 51%of approval through timely and efficient methods. To achieve this goal, each shareholder can grant a vote right to a representative. The top 100 votes to generate blocks according to the established timetable. Each representative is allocated to a time period to block the block. All representatives will receive 10%of the transaction fee equivalent to a average block as a reward. If a average block contains 100 shares as a transaction fee, a representative will receive 1 shares as remuneration.
The network delay may make some representatives fail to broadcast their blocks in time, which will cause blockchain tok. However, this is unlikely to happen, because the representative of the manufacturing block can be directly connected to the representative of the block and after manufacturing. The direct connection of this representative (maybe also includes the subsequent representatives) to ensure that you can get compensation.
The new block can be generated every 30 seconds, and the possibility of blockchain fork is extremely small under normal network conditions, and it can be solved within a few minutes even if it happens.
The representative:
The representative, you must register your public key on the Internet, and then allocate a 32 -bit unique identifier. The identifier is then cited by the "head" of each transaction data.
authorized votes:
each wallet has a parameter setting window. In this window, users can choose one or more representatives and classify them. Once set, each transaction made by the user will transfer the votes from the "input representative" to the "output representative". Under normal circumstances, users will not create a special transaction for voting, as they will spend a trading fee. But in an emergency, some users may feel that it is worth changing their voting by paying a more positive way.
maintaining representative honesty:
each wallet will display a state indicator, letting users know how their representatives perform. If they miss too many blocks, the system will recommend users to change a new representative. If any representative is found to issue an invalid block, then all standard wallets will be selected for a new representative before each wallet for more transactions.
The resistance attack:
The on the resistance attack, because the power obtained by the top 100 representatives is the same, and each representative has an equal voting right. Therefore, power cannot be concentrated on a single representative by obtaining more than 1%of votes. Because there are only 100 representatives, you can imagine that an attacker rejects service attacks on the production block. Fortunately, because the identity of each representative is its public key rather than an IP address, the threat of this specific attack is easily reduced. This will make it more difficult to determine the DDOS attack target. The potential direct connection between the representatives will make it more difficult to prevent them from producing blocks.
advantages: greatly narrowing the number of participating verification and bookkeeping nodes can reach second -level consensus verification.
Disadvantages: The entire consensus mechanism still depends on token, and many commercial applications do not need tokens.
3.pbft: Practatory byzantine fault tolerance, practical Byzantine
Introduction: (N-1)/3 fault tolerance of vitality and safety.
In distributed computing, different computers are trying to reach a consensus through information exchange; but sometimes, the system coordinate the computer ( / Commander) or member computer (MEMBER /) on the system. , Resulting in the final system consistency.
The general Byzantine problem finds possible solutions based on the number of errors. This cannot find an absolute answer, but it can only be used to verify the validity of a mechanism.
The possible solutions to the Byzantine problem are:
The consistency in the case of N ≥ 3F 1 is possible. Among them, n is the total number of computers, and f is the total number of computer computer. After the information is exchanged between the computer, the computers list all the information obtained, and uses most of the results as a solution.
1) The operation of the system can be separated from the coin. Each node of the PBFT algorithm consensus is composed of business participants or regulators. The security and stability are guaranteed by the business -related parties.
2) The delay of consensus is about 2 to 5 seconds, and the requirements of commercial real -time processing are basically met.
3) High consensus efficiency can meet the needs of high -frequency transaction volume.
Disadvantages:
1) When there are 1/3 or more accountants stop working, the system will not be able to provide services;
2) When there are 1/3 or more bookkeepers jointly do evil, and and the evil, and it is the evil, and the other is the evil, and the other is the evil, and the other is the evil, and the other is the evil, and the other is the evil, and the evil, and When all other bookkeepers are just divided into two online islands, malicious bookkeepers can make the system split, but they will leave cryptographic evidence
.DBFT: Delegated BFT authorized Byzantine Rong Obligation Algorithm
Introduction: The DBFT mechanism adopted by the small ants is to select the bookkeeper by equity, and then the bookkeeper reached a consensus through the Byzantine 错 algorithm.
This this algorithm has been improved on the basis of PBFT:
The request response mode of the C/S architecture to improve the peer node mode suitable for the P2P network;
Improved dynamic consensus participation nodes with dynamic entry and exit;
In the generation of consensus participation nodes to design a set of voting mechanisms based on holding rights and interests, and determine consensus participation nodes (accounting nodes) through voting;
The digital certificates in the blockchain solve the problem of authentication of the true identity of the bookkeeping node in the voting.
advantages:
1) Professional bookkeeper;
2) can tolerate any type of errors;
3) The bookkeeping is completed by multiple people, and each block is final. Sexual, not to split;
4) The reliability of the algorithm has strict mathematical proof;
Disadvantages:
1) When there are 1/3 or more bookkeepers stop working, the system will not be able to cannot Provide services;
2) When there are 1/3 or more bookkeeper joints, and all other bookmakers are just divided into two online islands, malicious bookkeepers can make the system split, but The password evidence will be left;
It's summary, the core point of the DBFT mechanism is to maximize the final nature of the system, enabling the blockchain to apply to the real financial application scenario.
5.pool verification pool
The traditional distributed consistency technology, plus data verification mechanism.
: It can work if you do n’t need tokens. On the basis of mature distributed consistency algorithms (PASOX, RAFT), second -level consensus verification is implemented.
Disadvantages: decentralization is not as good as BICTOIN; more suitable for multi -central business models that are more suitable for multiple parties.