CN111522561B - Method for smooth backward compatible upgrade in DBFT distributed network, computer readable storage medium and DBFT network - Google Patents

Method for smooth backward compatible upgrade in DBFT distributed network, computer readable storage medium and DBFT network Download PDF

Info

Publication number
CN111522561B
CN111522561B CN202010152017.4A CN202010152017A CN111522561B CN 111522561 B CN111522561 B CN 111522561B CN 202010152017 A CN202010152017 A CN 202010152017A CN 111522561 B CN111522561 B CN 111522561B
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.)
Active
Application number
CN202010152017.4A
Other languages
Chinese (zh)
Other versions
CN111522561A (en
Inventor
杜晓楠
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CN202010152017.4A priority Critical patent/CN111522561B/en
Publication of CN111522561A publication Critical patent/CN111522561A/en
Application granted granted Critical
Publication of CN111522561B publication Critical patent/CN111522561B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/60Software deployment
    • G06F8/65Updates
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14Error detection or correction of the data by redundancy in operation
    • G06F11/1402Saving, restoring, recovering or retrying
    • G06F11/1415Saving, restoring, recovering or retrying at system level
    • G06F11/1433Saving, 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 method for smoothly and backwards compatible upgrade in a DBFT distributed network, which comprises the following steps: upgrading, namely 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 DBFT consensus; and judging, namely judging that the new version is successfully operated and discarding the old version when the number of a certain forked new version block in the set forking height interval exceeds a set forking threshold value, otherwise judging that the new version is failed to operate and returning the old version. The invention also relates to a computer readable storage medium and a DBFT distributed network. The method, the computer readable storage medium and the DBFT distributed network for smoothly backwards compatible upgrade in the DBFT distributed network can simultaneously run the consensus of two versions, wherein the new version is backwards compatible with the old version, thereby smoothly backwards compatible upgrade.

Description

Method for smooth backward compatible upgrade in DBFT distributed network, computer readable storage medium and DBFT network
Technical Field
The present invention relates to the field of distributed networks, and more particularly, to a method for smooth backward compatible upgrades in a DBFT distributed network, a computer readable storage medium, and a DBFT network.
Background
DBFT (Delegated Byzantine Fault Tolerance) is a generic consensus mechanism module that proposes an improved bayer fault tolerance algorithm that makes it suitable for use in blockchain systems. The consensus mechanism is improved based on the 'practical Bayesian fault tolerance algorithm' (Practical Byzantine Fault Tolerance) proposed by Castro and Liskov, and is applicable to a blockchain system. The bayer fault-tolerant technology is widely applied to distributed systems, such as a distributed file system, a distributed collaboration system, cloud computing and the like. The DBFT mainly improves the following steps: 1) The request response mode of the C/S architecture is improved to be a peer-to-peer node mode suitable for the P2P network; 2) The static consensus participation node is improved to be a dynamic consensus participation node which can enter and exit dynamically; 3) Designing a voting mechanism based on the proportion of holding rights and interests for the generation of the consensus participation nodes, and determining the consensus participation nodes (accounting nodes) through voting; 4) The digital certificate is introduced into the blockchain, so that the authentication problem of the true identity of the billing node in voting is solved.
Since the DBFT mechanism selects the billing people by rights and then the billing people agree on each other through the Bayesian fault tolerance algorithm, the method has the advantages that: 1) A specialized billing person; 2) Any type of error can be tolerated; 3) Accounting is completed by cooperation of multiple people, each block has finalization and cannot be forked; 4) There is a strict mathematical proof of the reliability of the algorithm.
However, the DBFT mechanism has the disadvantage that the compatibility between the new version and the old version is poor, so that the upgrading is very difficult, and the use experience of the user is affected.
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 the new version is backward compatible with the old version, thereby smoothing backward compatible upgrades, in view of the above-mentioned drawbacks of the prior art.
The technical scheme adopted for solving the technical problems is as follows: a method of constructing a smooth backward compatible upgrade in a DBFT distributed network, comprising:
upgrading, namely 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 DBFT consensus;
and judging, namely judging that the new version is successfully operated and discarding the old version when the number of new version blocks of a certain bifurcation value in the set bifurcation height interval exceeds a set bifurcation threshold value, otherwise judging that the new version is failed to operate and returning the old version.
In the method for smooth backward compatible upgrade in a DBFT distributed network according to the present invention, the step of upgrading further includes;
s1, judging whether the DBFT node refuses any new version, and if so, directly judging that the new version fails to run; otherwise, executing the step S2;
s2, judging whether the DBFT node is configured with a node bifurcation threshold value, 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 yes, executing the step S4, otherwise, directly judging that the new version fails to run;
s4, 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 DBFT consensus.
In the method for smooth backward compatible upgrade in DBFT distributed network according to the present invention, in the step S2, the node bifurcation threshold includes a minimum bifurcation execution altitude interval and/or a minimum bifurcation activation threshold, and the block threshold includes a block bifurcation execution altitude interval and/or a block bifurcation activation threshold.
In the method for smooth backward compatible upgrade in 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, otherwise, directly judging that the new version operation fails.
In the method for smooth backward compatible upgrade in DBFT distributed network according to the present invention, the step S3 further includes:
s32, judging whether the block bifurcation activation threshold received by the DBFT node is larger than the minimum bifurcation activation threshold, if so, executing the step S4, otherwise, directly judging that the new version operation fails.
In the method for smooth backward compatible upgrade in DBFT distributed network according to the present invention, the determining step further includes:
sa, when the number of new version blocks with a certain bifurcation value in a bifurcation height interval between a bifurcation execution start height and a bifurcation execution end height is greater than or equal to a set bifurcation block threshold, determining that the new version is successful in running and discarding the old version.
In the method for smooth backward compatible upgrade in 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 ending height, and the number of new version blocks is smaller than the bifurcation block threshold value, judging that the new version fails to run 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, which when executed by a processor implements a method for smooth backward compatible upgrade in the DBFT distributed network.
The invention solves the technical problem by adopting a further technical scheme that a DBFT distributed network is constructed, the DBFT distributed network comprises a plurality of DBFT nodes, and the DBFT nodes are stored with computer programs.
The method, the computer readable storage medium and the DBFT distributed network for smoothly backwards compatible upgrade in the DBFT distributed network can simultaneously run the consensus of two versions, wherein the new version is backwards compatible with the old version, thereby smoothly backwards compatible upgrade.
Drawings
The invention will be further described with reference to the accompanying drawings and examples, in which:
FIG. 1 is a flow diagram of a first preferred embodiment of a method of smooth backward compatible upgrade in a DBFT distributed network of the present invention;
FIG. 2 is a flow chart of a second preferred embodiment of the upgrade steps of the method of smooth backward compatible upgrade in a DBFT distributed network of the present invention;
FIG. 3 is a state machine operation schematic of the DBFT distributed network of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
In the invention, by changing the content of a small part of reserved field of the DBFT block, writing some information of the soft forking version, then enabling the consensus node to gradually accept the new version in the process of generating the consensus, finally achieving the process that most of the consensus nodes acknowledge a forking version and discard the old version. 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 smoothing backward compatible upgrade.
FIG. 1 is a flow diagram of a first preferred embodiment of a method of smooth backward compatible upgrade in a DBFT distributed network of the present invention. As shown in fig. 1, the method for smooth backward compatible upgrade in 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 the new version block is submitted to participate in DBFT consensus. In a preferred embodiment of the invention, the scope of upgrades includes the data type of the generation block of the DBFT, the data type of the transaction, and the consensus rules of the DBFT.
In the judging step, when the number of new version blocks newly obtained by a certain bifurcation value in the set bifurcation height interval exceeds the set bifurcation threshold value, judging that the new version is successfully operated and discarding the old version, otherwise, judging that the new version is failed to be operated and returning the old version. In the invention, the operation complexity of the DBFT network is still limited to the polynomial level, and the DBFT network does not become an exponential level. A small number of variables are added through reserved fields in the blocks of the DBFT, so that consensus nodes in the DBFT network can run consensus of two versions simultaneously, and the new version is backwards compatible. When the received new version block of the consensus node reaches a certain threshold, the version is completely incompatible. Algorithms that reach the threshold still strictly adhere to the consistency and correctness principles of DBFT.
By implementing the method for smoothly backward compatible upgrade in the DBFT distributed network, the consensus of two versions can be operated simultaneously, wherein the new version is backward compatible with the old version, so that the backward compatible upgrade is smoothed.
FIG. 2 is a flow chart of a second preferred embodiment of the upgrade steps of the method of smooth backward compatible upgrade in a DBFT distributed network of the present invention. In step S1, it is determined whether the DBFT node refuses any new version, and if so, step S4 is executed to directly determine that the new version fails to run. Otherwise, step S2 is performed. In step S2, it is determined whether the DBFT node is configured with a node bifurcation threshold, if so, step S3 is performed, otherwise step S5 is performed. In a preferred embodiment of the 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 bifurcation threshold, if yes, step S5 is executed, and if not, step S4 is executed to directly determine that the new version fails to operate. Correspondingly, the block threshold includes a block bifurcation performed height interval and/or a block bifurcation activation threshold. In step S5, the version of the DBFT node is upgraded, the upgraded DBFT node is compatible with the new version and the old version, and the new version block is submitted to participate in 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 the new version and the old version, submitting the new version block to participate in DBFT consensus, and otherwise, 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 received by the DBFT node is larger than the minimum bifurcation activation threshold, 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, submitting the new version block to participate in DBFT consensus, and otherwise, 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 value may include at least one of a minimum bifurcation execution height interval and a minimum bifurcation activation threshold value, or both, may perform only a minimum bifurcation execution height interval determination or a minimum bifurcation activation threshold determination, may perform both determinations, and may be performed in any order, or performed simultaneously.
In a further preferred embodiment of the present invention, the determining step further comprises: when the number of new version blocks with a certain bifurcation value in a bifurcation height interval between a bifurcation execution start height and a bifurcation execution end height is larger than or equal to a bifurcation block threshold, the new version is judged to run successfully and the old version is abandoned, and when the current block height is higher than the bifurcation execution end height, but the number of new version blocks with the bifurcation value is smaller than the bifurcation block threshold, the new version is judged to run failed and the old version is switched back.
In this embodiment, the invention writes some information of soft forking version by changing the content of a small part of reserved field of DBFT block, then makes the consensus node gradually accept new version in the process of generating consensus, finally reaches the process that most consensus nodes acknowledge a forking version and discard old version. The process is as follows:
firstly, a new version of data structure is defined, which is different from the existing old version of data structure, meanwhile, a new version number, namely a bifurcation version number, is set in a reserved field of a block, and the following parameters are further defined:
bifurcation execution start height
Figure BDA0002402788190000061
Furcation execution end height
Figure BDA0002402788190000062
Bifurcated block threshold
Figure BDA0002402788190000063
Checking the number of new version blocks with forking values, i.e. checking the forking signal value, wherein the value
Figure BDA0002402788190000064
Wherein the method comprises the steps of
Figure BDA0002402788190000065
In the preferred embodiment, the version of the DBFT node is upgraded, the upgraded DBFT node is compatible with the new version and the old version, and the new version block is submitted to participate in DBFT consensus. New version blocks may be rejected by other DBFT nodes, but as the network of DBFTs operates, more and more nodes begin to upgrade new versions and pass new version block consensus among each DBFT, although it may still not be able to pass eventually. But blocks packed by old versions of nodes will still be approved by the new versions. When a certain number of DBFT nodes, such as 2/3 DBFT nodes, run new versions, two versions of blocks exist in the network at the same time, and the remaining old versions of nodes can still output blocks.
In the present embodiment, when the start height is executed at bifurcation
Figure BDA0002402788190000066
And bifurcation execution end height->
Figure BDA0002402788190000067
Bifurcation height interval between->
Figure BDA0002402788190000068
Is a branch signal value (i +.>
Figure BDA0002402788190000069
) The new version block is out of the bifurcation block threshold>
Figure BDA00024027881900000610
And if so, the new version is considered to be successfully operated, and the old version is discarded. If the current block height exceeds the bifurcation execution start height +.>
Figure BDA00024027881900000611
But latest->
Figure BDA00024027881900000612
The new version block is not up to the bifurcation block threshold +.>
Figure BDA00024027881900000613
And if so, considering that the soft bifurcation fails, namely that the new version fails to run, and switching back to the old version.
FIG. 3 is a state machine operation schematic of the DBFT distributed network of the present invention. Further preferred embodiments of the invention are described below in connection with fig. 3.
As shown in FIG. 3, the corresponding DBFT node, upon receipt of a new version v fork A 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, then the fork execution start height is reached at the current block height
Figure BDA0002402788190000071
The forking context state is then set to the S (Start) state and observation of the result of forking execution begins.
If a forking version (i.e., new version) is executed, then the forking context state is set to the A (Aaactive) state, and at the forking execution end height
Figure BDA0002402788190000072
The last furcation check furcation signal value before +.>
Figure BDA0002402788190000073
The new version block exceeds the bifurcation block threshold +.>
Figure BDA0002402788190000074
Then consider new version v fork Bifurcation is successful and the DBFT node can still accept the new version v at this time fork Previous versions.
If the end height is at bifurcation execution
Figure BDA0002402788190000075
Any subsequent bifurcation execution check interval, new version block exceeds bifurcation block threshold +.>
Figure BDA0002402788190000076
If the new version is considered to run successfully, the DBFT node refuses the old version before, and the forking context state is set to be the FI (Final) state.
In a preferred embodiment of the invention, if the DBFT node is configured to reject any forked version, the FA (Failed) state is entered directly, i.e., the DBFT node rejects any updates and the new version of the update fails.
In a preferred embodiment of the present invention, the DBFT node can self-configure the minimum bifurcated execution height interval
Figure BDA0002402788190000077
Then determining whether the block branching execution height zone received by the DBFT node is greater than the minimum branching execution height zone +.>
Figure BDA0002402788190000078
If yes, DBFT node is willing to execute the bifurcation, then the bifurcation execution start height is reached at the current block height>
Figure BDA0002402788190000079
The forking context state is then set to the S (Start) state and begins to observe the result of forking execution, and if not, refuses to execute the forking version and enters the FA (Failed) state.
In a preferred embodiment of the present invention, the DBFT node can self-configure the minimum bifurcation activation threshold
Figure BDA00024027881900000710
Then it is determined that the block furcation activation threshold received by the DBFT node is greater than the minimum furcation activation threshold +.>
Figure BDA00024027881900000711
If yes, DBFT node is willing to execute the bifurcation, then the bifurcation execution start height is reached at the current block height>
Figure BDA00024027881900000712
The forking context state is then set to the S (Start) state and begins to observe the result of forking execution, and if not, refuses to execute the forking version and enters the FA (Failed) state. Preferably, the smallest fractionFork activation threshold
Figure BDA00024027881900000713
Or may be a threshold period.
Those skilled in the art will appreciate that the above-mentioned forking execution start height may be set according to various practical conditions such as the number of nodes of the DBFT network, network environment requirements, security requirements, etc
Figure BDA0002402788190000081
Bifurcation execution end height->
Figure BDA0002402788190000082
Bifurcation block threshold->
Figure BDA0002402788190000083
Minimum bifurcation execution height zone +>
Figure BDA0002402788190000084
Minimum bifurcation activation threshold +.>
Figure BDA0002402788190000085
The specific methods of their placement are known to those skilled in the art and will not be described in detail herein. />
By implementing the method for smoothly backward compatible upgrade in the DBFT distributed network, the consensus of two versions can be operated simultaneously, wherein the new version is backward compatible with the old version, so that the backward compatible upgrade is smoothed.
The invention also relates to a computer readable storage medium having stored thereon a computer program which when executed by a processor implements a method of smooth backward compatible upgrade in a DBFT distributed network as described.
The invention also relates to a DBFT distributed network, which comprises a plurality of DBFT nodes, wherein the DBFT nodes are stored with computer programs, and the programs are executed by a processor to realize a method for smoothly and backwards compatibly upgrading in the DBFT distributed network.
A computer readable storage medium and DBFT distributed network implementing a smooth backward compatible upgrade in a DBFT distributed network of the present invention can run a consensus of both versions simultaneously, wherein the new version is backward compatible with the old version, thereby smoothing the backward compatible upgrade.
Thus, the present invention may be realized in hardware, software, or a combination of hardware and software. The invention may be implemented 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 invention is suited. The combination of hardware and software may be a general-purpose computer system with a computer program installed thereon, which, when executed, controls the computer system such that it carries out the methods of the present invention.
The present invention can also be realized by a computer program product, which comprises all the features enabling the implementation of the methods described herein, and which when installed in a computer system is able to carry out these methods. 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 foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, and alternatives falling within the spirit and principles of the invention.

Claims (8)

1. A method for smooth backward compatible upgrades in a DBFT distributed network, comprising:
upgrading, namely 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 DBFT consensus;
judging, when the number of new version blocks newly out by a certain bifurcation value in the bifurcation height interval exceeds a bifurcation threshold, judging that the new version is successfully operated and discarding the old version, otherwise, judging that the new version is failed to operate and returning the old version;
the step of upgrading further comprises;
s1, judging whether the DBFT node refuses any new version, and if so, directly judging that the new version fails to run; otherwise, executing the step S2;
s2, judging whether the DBFT node is configured with a node bifurcation threshold value, 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 yes, executing the step S4, otherwise, directly judging that the new version fails to run;
s4, 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 DBFT consensus.
2. The method of claim 1, wherein in step S2, the node forking threshold comprises a minimum forking execution altitude interval and/or a minimum forking activation threshold, and the block threshold comprises a block forking execution altitude interval and/or a block forking activation threshold.
3. The method for smooth backward compatible upgrade in a DBFT distributed network according to claim 2, wherein the 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, otherwise, directly judging that the new version operation fails.
4. The method for smooth backward compatible upgrade in a DBFT distributed network according to claim 2, wherein the step S3 further comprises:
s32, judging whether the block bifurcation activation threshold received by the DBFT node is larger than the minimum bifurcation activation threshold, if so, executing the step S4, otherwise, directly judging that the new version operation fails.
5. The method of smooth backward compatible upgrade in a DBFT distributed network according to any one of claims 1-4, wherein the determining step further comprises:
sa, when the number of new version blocks with a certain bifurcation value in a bifurcation height interval between a bifurcation execution start height and a bifurcation execution end height is greater than or equal to a set bifurcation block threshold, determining that the new version is successful in running and discarding the old version.
6. The method of smooth backward compatible upgrade in a DBFT distributed network of claim 5, wherein the determining step further comprises:
sb, when the current block height is higher than the bifurcation execution ending height, but the number of new version blocks is smaller than the bifurcation block threshold, judging that the new version fails to run, and switching back to the old version.
7. A computer readable storage medium having stored thereon a computer program, wherein the program when executed by a processor implements a method of smooth backward compatible upgrade in a DBFT distributed network according to any of claims 1-6.
8. A DBFT network comprising a plurality of DBFT nodes, the DBFT nodes having stored thereon a computer program, wherein the program, when executed by a processor, implements a method of smooth backward compatible upgrade in a DBFT distributed network according to any of claims 1-6.
CN202010152017.4A 2020-03-06 2020-03-06 Method for smooth backward compatible upgrade in DBFT distributed network, computer readable storage medium and DBFT network Active CN111522561B (en)

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 CN111522561A (en) 2020-08-11
CN111522561B true 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)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113438109B (en) * 2021-06-23 2022-06-07 预言机(重庆)科技有限公司 Block chain protocol upgrading method and system based on network nodes

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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
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
WO2019232789A1 (en) * 2018-06-08 2019-12-12 北京大学深圳研究生院 Voting-based consensus method

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7490318B2 (en) * 2005-02-25 2009-02-10 Inventec Corporation Computer platform operating system compatibility management method and system
US11146380B2 (en) * 2017-08-03 2021-10-12 Parity Technologies Ltd. Methods and systems for a heterogeneous multi-chain framework
US11030161B2 (en) * 2018-03-28 2021-06-08 Exosite LLC Blockchain scaling method and blockchain scaling apparatus

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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
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

Also Published As

Publication number Publication date
CN111522561A (en) 2020-08-11

Similar Documents

Publication Publication Date Title
CN109814905B (en) Software upgrading method and device based on blockchain
Fekete et al. Specifying and using a partitionable group communication service
US20190287099A1 (en) Distributed ledger update method
CN111199481A (en) Distributed transaction network based on asynchronous directed acyclic graph
CN112148798A (en) Data processing method and device applied to distributed system
CN111346371B (en) Information processing method and device and computer readable storage medium
CN111522561B (en) Method for smooth backward compatible upgrade in DBFT distributed network, computer readable storage medium and DBFT network
Newport et al. Fault-tolerant consensus with an abstract MAC layer
CN115361141A (en) Relay cross-link verification method and device, storage medium and electronic equipment
CN114157550B (en) Alliance block chain system based on conflict-free transaction merging
Bazzi et al. Clairvoyant state machine replication
CN114936253A (en) Block chain consensus method and device, electronic equipment and storage medium
Jannes et al. Beaufort: Robust byzantine fault tolerance for client-centric mobile web applications
CN110287267A (en) A kind of data processing method and device of cross-node
Cohen et al. Make every word count: adaptive Byzantine agreement with fewer words
CN112181599B (en) Model training method, device and storage medium
CN116723200B (en) Cluster changing method and device, electronic equipment and computer readable storage medium
CN112988738B (en) Data slicing method and device for block chain
CN117812084A (en) UTXO-based improved method for Raft consensus algorithm
CN112395339A (en) Method and device for checking data access between systems, computer equipment and storage medium
Aral et al. Reliability management for blockchain-based decentralized multi-cloud
CN108964904B (en) Group key security management method and device, electronic equipment and storage medium
US11099860B2 (en) Runtime adjustment of configuration models for consistency preservation
Hood et al. Partitionable asynchronous cryptocurrency blockchain
CN109861960B (en) Method and device for providing verification data for verifying business logic

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