PBFT (Byzantine fault tolerance) Based on the Byzantine general problem, consistency assurance is mainly divided into these three phases: pre-preparation (Pre-prepare), preparation (prepare) and confirmation (commit). The process is shown in the following diagram:
Where c is the sending request side, 0123 is the server, 3 is the service end of the outage, the steps are as follows: 1. Request: Requester-side C sends a request to any node, here is 0 2. Pre-prepare: Server 0 received C's request to broadcast, spread to 123 3. Prepare:123, after receiving the record and broadcast again, 1->023,2->013,3 because the outage could not broadcast 4. commit:0123 node in the prepare phase, if received more than a certain number of the same request, then into the commit phase, broadcast commit request 5.reply:0123 node in the commit phase, if received more than a certain number of the same request, then the C feedback
According to the above process, in the case of N≥3F + 1 consistency is possible to resolve, N is the total number of computers, and F is the total number of problematic computers.
It can be seen that the Byzantine fault tolerance can accommodate nearly 1/3 error node errors, IBM created by the Hyperledger is the use of the algorithm as a consensus algorithm.
The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion;
products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the
content of the page makes you feel confusing, please write us an email, we will handle the problem
within 5 days after receiving your email.
If you find any instances of plagiarism from the community, please send an email to:
info-contact@alibabacloud.com
and provide relevant evidence. A staff member will contact you within 5 working days.
