CN111522561A - Method, computer-readable storage medium, and DBFT network for smooth backward compatible upgrades in DBFT distributed networks - Google Patents
Method, computer-readable storage medium, and DBFT network for smooth backward compatible upgrades in DBFT distributed networks Download PDFInfo
- Publication number
- CN111522561A CN111522561A CN202010152017.4A CN202010152017A CN111522561A CN 111522561 A CN111522561 A CN 111522561A CN 202010152017 A CN202010152017 A CN 202010152017A CN 111522561 A CN111522561 A CN 111522561A
- Authority
- CN
- China
- Prior art keywords
- dbft
- bifurcation
- new version
- node
- version
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/60—Software deployment
- G06F8/65—Updates
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1415—Saving, restoring, recovering or retrying at system level
- G06F11/1433—Saving, restoring, recovering or retrying at system level during software upgrading
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Quality & Reliability (AREA)
- Computer Security & Cryptography (AREA)
- Stored Programmes (AREA)
Abstract
The invention relates to a smooth backward compatible upgrading method in a DBFT distributed network, which comprises the following steps: upgrading, namely upgrading the version of the DBFT node, wherein the upgraded DBFT node is compatible with a new version and an old version and submits a new version block to participate in DBFT consensus; and a judging step, namely judging that the new version runs successfully and abandons the old version when the number of the new version blocks branched out from a certain branched-out area in the set branching height interval exceeds a set branching threshold value, and otherwise judging that the new version runs unsuccessfully and returns to the old version. The invention also relates to a computer readable storage medium and a DBFT distributed network. By implementing the method for smoothly backwards compatible upgrading in the DBFT distributed network, the computer readable storage medium and the DBFT distributed network, the consensus of two versions can be operated simultaneously, wherein the new version is backwards compatible with the old version, so that the smooth backwards compatible upgrading is realized.
Description
Technical Field
The present invention relates to the field of distributed networks, and more particularly, to a method for smooth backward compatible upgrade in a DBFT distributed network, a computer readable storage medium, and a DBFT network.
Background
DBFT (delayed Byzantine failure Tolerance) is a general consensus mechanism module, and an improved Byzantine Fault-tolerant algorithm is provided, so that the DBFT (delayed Byzantine failure Tolerance) can be suitable for a block chain system. The consensus mechanism is based on a Practical Byzantine Fault tolerant algorithm (Practical Byzantine faultTolerance) proposed by Castro and Liskov, and can be applied to a block chain system after improvement. Byzantine fault tolerance techniques are widely used in distributed systems, such as distributed file systems, distributed collaboration systems, cloud computing, and the like. The DBFT is mainly modified as follows: 1) the request response mode of the C/S architecture is improved to a peer node mode suitable for a P2P network; 2) the static consensus node is improved into a dynamic consensus node which can enter and exit dynamically; 3) a set of voting mechanism based on the ratio of ownership and interest is designed for the generation of the consensus participation node, and the consensus participation node (accounting node) is decided through voting; 4) and a digital certificate is introduced into the block chain, so that the problem of authenticating the real identity of the accounting node in voting is solved.
Because the DBFT mechanism selects the bookkeeper by the rights and interests, and the bookkeeper achieves consensus through a Byzantine fault-tolerant algorithm, the method has the advantages that: 1) a specialized bookkeeper; 2) any type of error can be tolerated; 3) the bookkeeping is completed by multiple persons in a coordinated mode, and each block has the finality and cannot be forked; 4) the reliability of the algorithm has strict mathematical proof.
However, the DBFT mechanism has the disadvantage of poor compatibility between the old and new versions, which makes upgrading very difficult and affects user experience.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a method, a computer readable storage medium and a DBFT distributed network that can run a consensus of two versions simultaneously, wherein a new version is backward compatible with an old version, thereby smoothly backward compatible with an upgrade, in view of the above-mentioned drawbacks of the prior art.
The technical scheme adopted by the invention for solving the technical problems is as follows: a method for constructing smooth backward compatibility upgrading in a DBFT distributed network comprises the following steps:
upgrading, namely upgrading the version of the DBFT node, wherein the upgraded DBFT node is compatible with a new version and an old version and submits a new version block to participate in DBFT consensus;
and a judging step, namely judging that the new version runs successfully and abandons the old version when the number of new version blocks newly emerged from a certain bifurcation value in a set bifurcation height interval exceeds a set bifurcation threshold, otherwise judging that the new version runs unsuccessfully and returns to the old version.
In the method for smooth backward compatible upgrade in a DBFT distributed network according to the present invention, the upgrade step further includes;
s1, judging whether the DBFT node rejects any new version, and if yes, directly judging that the new version fails to operate; otherwise, executing step S2;
s2, judging whether the DBFT node is configured with a node bifurcation threshold, if so, executing a step S3, otherwise, executing a step S4;
s3, judging whether the threshold value of the block received by the DBFT node is larger than or equal to the node bifurcation threshold value, if so, executing the step S4, and if not, directly judging that the operation of the new version fails;
and S4, upgrading the version of the DBFT node, wherein the upgraded DBFT node is compatible with the new version and the old version and submits a new version block to participate in the DBFT consensus.
In the method for smooth backward compatibility upgrade in a DBFT distributed network according to the present invention, in the step S2, the node bifurcation threshold includes a minimum bifurcation execution height interval and/or a minimum bifurcation activation threshold, and the block threshold includes a block bifurcation execution height interval and/or a block bifurcation activation threshold.
In the method for smooth backward compatible upgrade in a DBFT distributed network according to the present invention, the step S3 further includes:
s31, judging whether the block bifurcation execution height interval received by the DBFT node is larger than the minimum bifurcation execution height interval, if so, executing the step S4, and if not, directly judging that the new version fails to operate.
In the method for smooth backward compatible upgrade in a DBFT distributed network according to the present invention, the step S3 further includes:
s32, judging whether the block bifurcation activation threshold value received by the DBFT node is larger than the minimum bifurcation activation threshold value, if so, executing the step S4, otherwise, directly judging that the operation of the new version fails.
In the method for smooth backward compatible upgrade in a DBFT distributed network according to the present invention, the determining step further includes:
and Sa, when the number of new version blocks with a certain bifurcation value in a bifurcation height interval between the bifurcation execution starting height and the bifurcation execution ending height is greater than or equal to a set bifurcation block threshold value, determining that the new version runs successfully and abandoning the old version.
In the method for smooth backward compatible upgrade in a DBFT distributed network according to the present invention, the determining step further includes:
and Sb, when the height of the current block is higher than the bifurcation execution finishing height, but the number of the new version blocks is less than the set bifurcation block threshold value, judging that the new version fails to operate, and switching back to the old version.
Another technical solution adopted by the present invention to solve the technical problem is to construct a computer readable storage medium, on which a computer program is stored, wherein the program, when executed by a processor, implements the method for smooth backward compatibility upgrade in a DBFT distributed network.
Another technical solution adopted by the present invention to solve the technical problem is to construct a DBFT distributed network, including a plurality of DBFT nodes, where the DBFT nodes store a computer program, where the computer program is executed by a processor to implement a method for smooth backward compatible upgrade in the DBFT distributed network.
By implementing the method for smoothly backwards compatible upgrading in the DBFT distributed network, the computer readable storage medium and the DBFT distributed network, the consensus of two versions can be operated simultaneously, wherein the new version is backwards compatible with the old version, so that the smooth backwards compatible upgrading is realized.
Drawings
The invention will be further described with reference to the accompanying drawings and examples, in which:
FIG. 1 is a schematic flow chart diagram of a first preferred embodiment of a method for smooth backward compatibility upgrade in a DBFT distributed network of the present invention;
FIG. 2 is a schematic flow chart diagram illustrating a second preferred embodiment of the upgrade steps of the method for smooth backward compatible upgrade in a DBFT distributed network of the present invention;
FIG. 3 is a state machine operation diagram of the DBFT distributed network of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
In the invention, by changing the contents of a small part of reserved fields of the DBFT block, some information of a soft bifurcated version is written, then the common identification node gradually receives a new version in the common identification generation process, and finally the process that most common identification nodes admit a bifurcated version and abandon an old version is achieved. By implementing the invention, the consensus of two versions can be operated simultaneously, wherein the new version is backward compatible with the old version, thereby smoothly backward compatible upgrading.
Fig. 1 is a schematic flow chart of a first preferred embodiment of a method for smooth backward compatibility upgrade in a DBFT distributed network of the present invention. As shown in fig. 1, the method for smooth backward compatible upgrade in a DBFT distributed network of the present invention includes an upgrade step and a decision step. In the upgrading step, the version of the DBFT node is upgraded, the upgraded DBFT node is compatible with the new version and the old version, and a new version block is submitted to participate in DBFT consensus. In a preferred embodiment of the present invention, the upgrade scope includes a data type of a generation block of the DBFT, a data type of a transaction, and a consensus rule of the DBFT.
In the judging step, when the number of new version blocks which are newly generated from a certain bifurcation value in the set bifurcation height interval exceeds a set bifurcation threshold value, the new version is judged to be successfully operated and the old version is discarded, otherwise, the new version is judged to be failed to operate and the old version is returned. In the invention, the operation complexity of the DBFT network is still limited to a polynomial level and cannot become an exponential level. A small amount of variables are added through reserved fields in blocks of the DBFT, so that a consensus node in the DBFT network can run two versions of consensus at the same time, wherein the new versions are backward compatible. When the received new version block of the consensus node reaches a certain threshold value, the versions are completely incompatible. The algorithm that reaches the threshold still strictly adheres to the consistency and correctness principles of the DBFT.
By implementing the method for smoothly backwards compatible upgrading in the DBFT distributed network, the consensus of two versions can be operated simultaneously, wherein the new version is backwards compatible with the old version, so that the smooth backwards compatible upgrading is realized.
Fig. 2 is a flowchart illustrating the upgrading step of the method for smooth backward compatible upgrade in a DBFT distributed network according to a second preferred embodiment of the present invention. In step S1, it is determined whether the DBFT node rejects any new version, and if so, execution of step S4 directly determines that the new version failed to operate. Otherwise, step S2 is executed. In step S2, it is determined whether the DBFT node is configured with a node divergence threshold, and if so, step S3 is performed, otherwise, step S5 is performed. In a preferred embodiment of the present invention, the node bifurcation threshold comprises a minimum bifurcation execution altitude interval and/or a minimum bifurcation activation threshold. In step S3, it is determined whether the threshold of the block received by the DBFT node is greater than or equal to the node split threshold, if so, step S5 is executed, otherwise, step S4 is executed to directly determine that the new version fails to operate. Correspondingly, the threshold of the block comprises a block bifurcation execution height interval and/or a block bifurcation activation threshold. In step S5, the version of the DBFT node is upgraded, and the upgraded DBFT node is compatible with the new version and the old version and submits the new version to participate in the DBFT consensus.
In a further preferred embodiment of the present invention, the step S3 further includes: and judging whether the block bifurcation execution height interval received by the DBFT node is larger than the minimum bifurcation execution height interval, if so, executing a step S5, upgrading the version of the DBFT node, enabling the upgraded DBFT node to be compatible with a new version and an old version and submitting a new version block to participate in DBFT consensus, and if not, executing a step S4 to directly judge that the new version fails to operate. In a further preferred embodiment of the present invention, the step S3 further includes: and judging whether the block bifurcation activation threshold value received by the DBFT node is larger than the minimum bifurcation activation threshold value or not, if so, executing a step S5, upgrading the version of the DBFT node, enabling the upgraded DBFT node to be compatible with the new version and the old version and submitting the new version block to participate in the DBFT consensus, and if not, executing a step S4 to directly judge that the new version fails to operate.
In a preferred embodiment of the present invention, the node bifurcation threshold may include at least one of a minimum bifurcation execution height interval and a minimum bifurcation activation threshold, or both, only the minimum bifurcation execution height interval determination or the minimum bifurcation activation threshold determination may be performed, or both determinations may be performed, and may be performed in any order, or simultaneously.
In a further preferred embodiment of the present invention, the determining step further comprises: and when the height of the current block is higher than the bifurcation execution ending height but the number of the new version blocks is less than the set bifurcation block threshold value, determining that the new version operation fails and switching back to the old version.
In this embodiment, the present invention writes some information of soft bifurcated version by changing the contents of a small part of reserved fields of the DBFT block, then lets the consensus node gradually accept a new version during the consensus generation process, and finally, the process of most consensus nodes acknowledging a bifurcated version and discarding the old version is achieved. The process is as follows:
firstly, defining a new version data structure, which is different from the existing old version data structure, and meanwhile, setting a new version number, namely a bifurcated version number, in a reserved field of a block, and further defining the following parameters:
fork execution start height
Fork execution end height
Bifurcated block threshold
Checking the value of the bifurcation signal, i.e. the number of blocks of new version whose bifurcation value is newer
Wherein
In the preferred embodiment, the version of the DBFT node is upgraded, and the upgraded DBFT node is compatible with the new version and the old version and submits a new version block to participate in the DBFT consensus. New version tiles may be rejected by other DBFT nodes, but as the network of DBFTs operates, more and more nodes start upgrading new versions and agree on a new version tile each time the DBFT passes, although it may still fail to eventually pass. But blocks packed by nodes of the old version will still be approved by the new version. When more than a certain number of DBFT nodes, e.g., 2/3, run a new version, there will be both versions of blocks in the network, while the remaining old versions of nodes can still go out of blocks.
In the present embodiment, the height is set when the fork is executed at the start of execution
And fork execution end height
Between the branch height sections
Of (i) examining the value of the bifurcation signal
) Outgoing new version block exceeding bifurcated block threshold
And when the new version is successful, the old version is abandoned. If the current block height exceeds the fork execution start height
But is up-to-date
The new version block does not reach the bifurcation block threshold
And if so, the soft fork is considered to fail, namely the new version fails to operate, and the old version is switched back.
FIG. 3 is a state machine operation diagram of the DBFT distributed network of the present invention. Further preferred embodiments of the present invention are described below with reference to fig. 3.
As shown in FIG. 3, the corresponding DBFT node receives the new version v at itforkA new context is created for the version and the context state is set to the D (defined) state. If the DBFT node is willing to perform the fork, the fork execution start height is reached at the current block height
The fork context state is then set to the s (start) state and observation of the result of fork execution begins.
If a bifurcated version (i.e., new version) is executed, the bifurcated context state is now set to the A (Aactive) state and at bifurcated execution end height
Last fork before checking the fork signal value
Out-of-new version block exceeds bifurcation block threshold
Then the new version v is consideredforkThe forking is successful and at this point the DBFT node can still accept the new version vforkThe previous version.
If at fork execution end height
Then any branch execution check interval is carried out, and the new version block exceeds the branch block threshold value
And if the new version is successfully operated, the DBFT node rejects the previous old version, and the bifurcation context state is set to be an FI (Final) state.
In a preferred embodiment of the invention, if the DBFT node is configured to reject any bifurcated version, the fa (failed) state is entered directly, i.e. the DBFT node rejects any updates and the new version fails to update.
In a preferred embodiment of the present invention, the DBFT node can configure the minimum fork execution altitude interval by itself
Then it is determined whether the block split execution height interval received by the DBFT node is greater than the minimum split execution height interval
If so, the DBFT node is willing to perform the fork, and the fork execution start height is reached at the current block height
And then setting the forked context state to be an S (Start) state, starting to observe the result of the forked execution, and if not, refusing to execute the forked version and entering an FA (failed) state.
In a preferred embodiment of the invention, the DBFT node can configure the minimum bifurcation activation threshold value by itself
Determining that the block split activation threshold received by the DBFT node is greater than the minimum split activation threshold
If so, the DBFT node is willing to perform the fork, and the fork execution start height is reached at the current block height
And then setting the forked context state to be an S (Start) state, starting to observe the result of the forked execution, and if not, refusing to execute the forked version and entering an FA (failed) state. Preferably, the minimum bifurcation activation threshold
Or may be a threshold period.
Those skilled in the art will appreciate that the fork execution starting height may be set according to various practical conditions such as the number of nodes of the DBFT network, network environment requirements, security requirements, and the like
Fork execution end height
Bifurcated block threshold
Minimum bifurcated execution height interval
Minimum bifurcation activation threshold
The specific method of arrangement is known to those skilled in the art and will not be described in detail herein.
By implementing the method for smoothly backwards compatible upgrading in the DBFT distributed network, the consensus of two versions can be operated simultaneously, wherein the new version is backwards compatible with the old version, so that the smooth backwards compatible upgrading is realized.
The invention also relates to a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the method for smooth backward compatibility upgrade in a DBFT distributed network.
The invention also relates to a DBFT distributed network, which comprises a plurality of DBFT nodes, wherein computer programs are stored on the DBFT nodes, and when the computer programs are executed by a processor, the method for smoothly and compatibly upgrading backwards in the DBFT distributed network is realized.
The computer readable storage medium and the DBFT distributed network implementing the smooth backward compatible upgrade in the DBFT distributed network of the present invention can run the consensus of two versions simultaneously, wherein a new version is backward compatible with an old version, thereby smoothly backward compatible upgrading.
Accordingly, the present invention can be realized in hardware, software, or a combination of hardware and software. The present invention can be realized in a centralized fashion in at least one computer system, or in a distributed fashion where different elements are spread across several interconnected computer systems. Any kind of computer system or other apparatus adapted for carrying out the methods of the present invention is suited. A typical combination of hardware and software could be a general purpose computer system with a computer program that, when being loaded and executed, controls the computer system such that it carries out the methods described herein.
The present invention may also be implemented by a computer program product, comprising all the features enabling the implementation of the methods of the invention, when loaded in a computer system. The computer program in this document refers to: any expression, in any programming language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following: a) conversion to other languages, codes or symbols; b) reproduced in a different format.
While the invention has been described with reference to specific embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from its scope. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed, but that the invention will include all embodiments falling within the scope of the appended claims.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.
Claims (9)
1. A method for smooth backward compatibility upgrade in a DBFT distributed network, comprising:
upgrading, namely upgrading the version of the DBFT node, wherein the upgraded DBFT node is compatible with a new version and an old version and submits a new version block to participate in DBFT consensus;
and a judging step, namely judging that the new version runs successfully and abandons the old version when the number of new version blocks newly emerged from a certain bifurcation value in a set bifurcation height interval exceeds a set bifurcation threshold, otherwise judging that the new version runs unsuccessfully and returns to the old version.
2. The method of smooth backward compatible upgrade in a DBFT distributed network according to claim 1, wherein the upgrading step further comprises;
s1, judging whether the DBFT node rejects any new version, and if yes, directly judging that the new version fails to operate; otherwise, executing step S2;
s2, judging whether the DBFT node is configured with a node bifurcation threshold, if so, executing a step S3, otherwise, executing a step S4;
s3, judging whether the threshold value of the block received by the DBFT node is larger than or equal to the node bifurcation threshold value, if so, executing the step S4, and if not, directly judging that the operation of the new version fails;
and S4, upgrading the version of the DBFT node, wherein the upgraded DBFT node is compatible with the new version and the old version and submits a new version block to participate in the DBFT consensus.
3. The method for smooth backward compatibility upgrade in DBFT distributed network of claim 2, wherein in said step S2, said node bifurcation threshold comprises a minimum bifurcation execution height interval and/or a minimum bifurcation activation threshold, and said block threshold comprises a block bifurcation execution height interval and/or a block bifurcation activation threshold.
4. The method for smooth backward compatible upgrade in a DBFT distributed network as claimed in claim 3, wherein said step S3 further comprises:
s31, judging whether the block bifurcation execution height interval received by the DBFT node is larger than the minimum bifurcation execution height interval, if so, executing the step S4, and if not, directly judging that the new version fails to operate.
5. The method for smooth backward compatible upgrade in a DBFT distributed network as claimed in claim 3, wherein said step S3 further comprises:
s32, judging whether the block bifurcation activation threshold value received by the DBFT node is larger than the minimum bifurcation activation threshold value, if so, executing the step S4, otherwise, directly judging that the operation of the new version fails.
6. The method for smooth backward compatibility upgrade in a DBFT distributed network according to any of claims 1-5, wherein said deciding step further comprises:
and Sa, when the number of new version blocks with a certain bifurcation value in a bifurcation height interval between the bifurcation execution starting height and the bifurcation execution ending height is greater than or equal to a set bifurcation block threshold value, determining that the new version runs successfully and abandoning the old version.
7. The method of smooth backward compatible upgrades in a DBFT distributed network of claim 6, wherein the step of deciding further comprises:
and Sb, when the height of the current block is higher than the bifurcation execution finishing height, but the number of the new version blocks is less than the set bifurcation block threshold value, judging that the new version fails to operate, and switching back to the old version.
8. A computer readable storage medium having stored thereon a computer program, characterized in that said program, when being executed by a processor, is adapted to carry out a method for smooth backward compatibility upgrade in a DBFT distributed network according to any of the claims 1-7.
9. A DBFT network comprising a plurality of DBFT nodes having stored thereon a computer program, wherein said program when executed by a processor implements a method for smooth backward compatible upgrade in a DBFT distributed network according to any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010152017.4A CN111522561B (en) | 2020-03-06 | 2020-03-06 | Method for smooth backward compatible upgrade in DBFT distributed network, computer readable storage medium and DBFT network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010152017.4A CN111522561B (en) | 2020-03-06 | 2020-03-06 | Method for smooth backward compatible upgrade in DBFT distributed network, computer readable storage medium and DBFT network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111522561A true CN111522561A (en) | 2020-08-11 |
| CN111522561B CN111522561B (en) | 2023-06-06 |
Family
ID=71902136
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010152017.4A Active CN111522561B (en) | 2020-03-06 | 2020-03-06 | Method for smooth backward compatible upgrade in DBFT distributed network, computer readable storage medium and DBFT network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111522561B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113438109A (en) * | 2021-06-23 | 2021-09-24 | 预言机(重庆)科技有限公司 | Block chain protocol upgrading method and system based on network nodes |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060195836A1 (en) * | 2005-02-25 | 2006-08-31 | Inventec Corporation | Computer platform operating system compatibility management method and system |
| EP2083354A1 (en) * | 2008-01-22 | 2009-07-29 | Amadeus S.A.S. | Method and system for deploying non-backward compatible server versions in a client/server computing environment |
| WO2017028375A1 (en) * | 2015-08-17 | 2017-02-23 | 中兴通讯股份有限公司 | Version upgrading method and system |
| CN109166037A (en) * | 2018-07-25 | 2019-01-08 | 上海魅联信息技术有限公司 | The common recognition method of block chain |
| US20190058581A1 (en) * | 2017-08-03 | 2019-02-21 | Gavin Wood | Methods and Systems for a Heterogeneous Multi-Chain Framework |
| CN109669709A (en) * | 2018-11-26 | 2019-04-23 | 杭州秘猿科技有限公司 | A kind of data migration method and data mover system of the upgrading of block chain |
| CN109814905A (en) * | 2019-01-17 | 2019-05-28 | 上海边界智能科技有限公司 | A kind of method for upgrading software and device based on block chain |
| CN109992285A (en) * | 2019-04-02 | 2019-07-09 | 杭州秘猿科技有限公司 | Block chain code block standalone upgrade method, apparatus and electronic equipment |
| US20190303353A1 (en) * | 2018-03-28 | 2019-10-03 | Exosite LLC | Blockchain scaling method and blockchain scaling apparatus |
| WO2019232789A1 (en) * | 2018-06-08 | 2019-12-12 | 北京大学深圳研究生院 | Voting-based consensus method |
-
2020
- 2020-03-06 CN CN202010152017.4A patent/CN111522561B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060195836A1 (en) * | 2005-02-25 | 2006-08-31 | Inventec Corporation | Computer platform operating system compatibility management method and system |
| EP2083354A1 (en) * | 2008-01-22 | 2009-07-29 | Amadeus S.A.S. | Method and system for deploying non-backward compatible server versions in a client/server computing environment |
| WO2017028375A1 (en) * | 2015-08-17 | 2017-02-23 | 中兴通讯股份有限公司 | Version upgrading method and system |
| US20190058581A1 (en) * | 2017-08-03 | 2019-02-21 | Gavin Wood | Methods and Systems for a Heterogeneous Multi-Chain Framework |
| US20190303353A1 (en) * | 2018-03-28 | 2019-10-03 | Exosite LLC | Blockchain scaling method and blockchain scaling apparatus |
| WO2019232789A1 (en) * | 2018-06-08 | 2019-12-12 | 北京大学深圳研究生院 | Voting-based consensus method |
| CN109166037A (en) * | 2018-07-25 | 2019-01-08 | 上海魅联信息技术有限公司 | The common recognition method of block chain |
| CN109669709A (en) * | 2018-11-26 | 2019-04-23 | 杭州秘猿科技有限公司 | A kind of data migration method and data mover system of the upgrading of block chain |
| CN109814905A (en) * | 2019-01-17 | 2019-05-28 | 上海边界智能科技有限公司 | A kind of method for upgrading software and device based on block chain |
| CN109992285A (en) * | 2019-04-02 | 2019-07-09 | 杭州秘猿科技有限公司 | Block chain code block standalone upgrade method, apparatus and electronic equipment |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113438109A (en) * | 2021-06-23 | 2021-09-24 | 预言机(重庆)科技有限公司 | Block chain protocol upgrading method and system based on network nodes |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111522561B (en) | 2023-06-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108683539B (en) | Block chain network management method, block chain network management device, block chain network management medium and electronic equipment | |
| US7797457B2 (en) | Leaderless byzantine consensus | |
| EP3340055A1 (en) | Communicating state information in distributed operating systems | |
| EP3340054A1 (en) | Maintaining coherency in distributed operating systems for network devices | |
| EP3340053A1 (en) | Organizing execution of distributed operating systems for network devices | |
| CN110336707A (en) | Block chain common recognition device, method and computer readable storage medium | |
| US20190287099A1 (en) | Distributed ledger update method | |
| CN109886693B (en) | Consensus realization method, device, equipment and medium for block chain system | |
| CN112148798A (en) | Data processing method and device applied to distributed system | |
| CN110784331B (en) | Consensus process recovery method and related nodes | |
| CN111522561A (en) | Method, computer-readable storage medium, and DBFT network for smooth backward compatible upgrades in DBFT distributed networks | |
| CN114157550B (en) | Alliance block chain system based on conflict-free transaction merging | |
| CN116723200B (en) | Cluster changing method and device, electronic equipment and computer readable storage medium | |
| EP3120496B1 (en) | Configuration generation based on availability-estimate | |
| CN116361271B (en) | Block chain data modification and migration method, electronic equipment and storage medium | |
| CN105391755A (en) | Method and device for processing data in distributed system, and system | |
| CN112395339A (en) | Method and device for checking data access between systems, computer equipment and storage medium | |
| WO2018166474A1 (en) | Member group change method and apparatus, medium, and computer device | |
| CN116915791A (en) | Block chain transaction conflict detection method, sequencing node and endorsement node | |
| CN112988738B (en) | Data slicing method and device for block chain | |
| CN115361141A (en) | Relay cross-link verification method and device, storage medium and electronic equipment | |
| CN110365535B (en) | Model online method and device based on secure multi-party computation | |
| CN110610241B (en) | Model training method, device and storage medium | |
| CN113704107A (en) | Application testing method, device, equipment and computer readable storage medium | |
| KR20210061245A (en) | Method for parallel block processing method in blockchain, blockcahin node device and program using the same |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 40027301 Country of ref document: HK |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |