WO2019233454A1

WO2019233454A1 - Chain code upgrading method and device

Info

Publication number: WO2019233454A1
Application number: PCT/CN2019/090206
Authority: WO
Inventors: 高磊; 刘勋
Original assignee: 华为技术有限公司
Priority date: 2018-06-07
Filing date: 2019-06-05
Publication date: 2019-12-12
Also published as: CN110580624B; CN110580624A

Abstract

The present invention relates to the technical field of block chains, and provides a chain code upgrading method and device. The method comprises: an endorse node (102) obtains a first target version set corresponding to a chain code to be upgraded (S502), and performs simulation upgrading on the chain code to be upgraded according to the first target version set in an independent operation environment (S505); if a second world state of the first target version set is consistent with a first world state, the endorse node (102) upgrades the chain code to be upgraded outside the independent operation environment (S502). The first target version set comprises an upgrade package of a first target version and related configuration of the upgrade package; the independent operation environment does not affect the operation environment outside of the independent operation environment; the first world state is the world state of the chain code to be upgraded before simulation upgrading, and the second world state is the world state of the chain code to be upgraded after simulation upgrading.

Description

Method and device for upgrading chain code

This application claims the priority of a Chinese patent application filed with the State Intellectual Property Office on June 7, 2018, with application number 201810591924.1, and with the invention name "chain code upgrade method and device", the entire contents of which are incorporated herein by reference. .

Technical field

The present application relates to the field of blockchain technology, and in particular, to a method and device for upgrading a chain code.

Background technique

In the blockchain technology, all participating nodes jointly verify each transaction, and each node stores the transaction ledger, so that the two parties that have reached an agreement can directly conduct transactions without endorsement by a third party. Specifically, the chain code is used to indicate the logic of the transaction and the rules of transaction processing. The node includes the relevant records of at least one transaction (including the payer and receiver of the transaction funds, the amount of the transaction funds, etc.) in the area by executing the chain code. Within the block, the block acts as an account page. The transactions existing in the blockchain network can be recorded in multiple blocks. Each block is connected together in a certain order to form a blockchain. The formed blockchain is also the transaction recorded in the blockchain network. Ledger.

When users need to conduct different types of transactions, different chain codes (that is, smart contracts) need to be deployed. Furthermore, after the nodes obtain the deployed new chain codes, they can execute the new chain codes to process each transaction to meet user needs. In addition, users can also upgrade the version of the chain code, and the node processes each transaction by executing a higher version of the chain code. Currently, the client can initiate a chaincode upgrade process. Specifically, the client sends a chain code upgrade command to the preset node to indicate which version the chain code is upgraded to. The preset node verifies the client's certificate and signature. If the client's identity is confirmed to be valid, the corresponding version of the chain code is updated. Upgrade packages and related configurations are stored in the state database. Subsequently, when the client initiates a transaction, the node can call the upgraded chain code in the state database and execute the upgraded chain code to process the transaction, so that the client's transaction proceeds smoothly.

However, in the prior art, because the node only confirms the identity of the client, it cannot avoid the logical defect chain code from the legitimate client. In this way, when the node processes the transaction according to the logical defect chain code, it is easy to generate errors and misplace the world of the transaction Status, reducing the accuracy of blockchain transactions.

Summary of the Invention

The embodiments of the present application provide a method and device for upgrading a chain code, which can improve the accuracy of blockchain transactions.

To achieve the above purpose, the embodiments of the present application adopt the following technical solutions:

In a first aspect, an embodiment of the present application provides a method for upgrading a chain code. The method includes: an endorsement node (Endorse) obtains a first target version set corresponding to a chain code to be upgraded, and in an independent operating environment according to the first A target version set simulates the upgrade of the chain code to be upgraded. If the second world state world state of the first target version set is consistent with the first world state, the endorsing node upgrades the upgrade chain code outside of the independent operating environment. The first world state is the world state before the upgrade of the chain code to be upgraded, and the second world state is the world state after the upgrade of the chain code to be upgraded. The first target version set includes the upgrade package and upgrade of the first target version. Related configuration of the package, independent operating environment does not affect the operating environment outside itself.

Compared with the prior art, which only verifies that the target version chain code comes from a legitimate client, so that the target version chain code with logic defects can tamper with the world state and increase the transaction risk, the method for upgrading the chain code provided in the embodiment of this application endorses the node. Obtain the first target version set corresponding to the chain code to be upgraded, and simulate the upgrade of the chain code to be upgraded according to the first target version set in an independent operating environment. Only when the second world state after the simulation upgrade and the first After the world status is consistent, the actual upgrade of the chain code to be upgraded is performed outside the independent operating environment. First of all, the simulation upgrade process in the memory of independent operation environment protection will not interfere with other applications outside the independent operation environment, that is, it will not cause damage to the actual transactions and blockchain data outside the independent operation environment. Secondly, the second world state after the simulation upgrade is consistent with the first world state before the simulation upgrade, indicating that the first target version of the chain code has not tampered with the world state. The feasibility of the chain code upgrade has been verified in an independent operating environment. , Then in the actual upgrade process, the probability that the first target version chain code tampered with the world state will be correspondingly reduced, so that the accuracy of transactions based on the untampered world state after the actual upgrade is improved, and blockchain transactions are improved. Security.

In a possible design, after the endorsing node obtains the target version set corresponding to the chain code to be upgraded, the following steps may be performed: if the second world state of the first target version set is inconsistent with the first world state, the endorsing node Update the first target version set to the second target version set, the second target version set is the latest legal version set in the branch of the version tree to which the first target version set belongs, and the second world state and first world of the legal version set The status is consistent.

Based on the version tree management method provided by the embodiment of the present application, when it is necessary to roll back to a certain chain code version, it can quickly roll back to the latest valid version set according to the version tree, and the valid version set will not tamper with the state of the world. So as to ensure the success of transactions between clients.

In a possible design, when a version set of the first target version exists in a branch of a version tree to which the first target version set belongs, and the second world state of the version set of the first target version is inconsistent with the first world state, The second world state of the first target version set is inconsistent with the first world state, wherein the first target version is a version corresponding to the first target version set.

In this way, when a user repeatedly uploads an illegal version set, the endorsing node can learn the history of the illegal version set by querying the version tree, avoiding the client to call the chain code corresponding to the illegal version set for transactions, and improving transaction security. In addition, since it is known whether the version set is an illegal version set by querying the version tree, there is no need to perform operations such as identity verification (that is, from which client) and simulation upgrade, which simplifies the chain code upgrade process.

In a possible design, the version tree includes a root node and a child node, and the child node includes a first child node and a second child node. The first child node is a first-level child node of the root node, and the second child node is a division node. For other levels of child nodes outside the first-level child node, each first child node is a version root node of a domain chain code. The second root node of the domain chain code is connected to the version root node, and the first child node of the domain chain code and The second child node of the domain chain code forms a version tree branch of the domain chain code; each child node corresponds to a version set, and the version set includes the version upgrade package and the related configuration of the version upgrade package. Different domain chain codes have different chain codes. Logo.

In a possible design, the first target version set is connected after the latest version version set in the version tree branch to which it belongs.

In a possible design, the method of creating a version tree may be implemented as follows: The endorsement node determines the version tree branch to which the first target version set belongs according to the domain to which the chain code to be upgraded belongs, and connects the first target version set to the first After the latest version set in the branch of the version tree to which the target version set belongs. Optionally, in a certain branch of the version tree, the version sets of different versions are connected in the order of the update time of the versions, and the new version set is based on the old version set at a higher level.

In a possible design, after Endorse obtains the first target version set corresponding to the chain code to be upgraded, the following steps may be performed: If the second world state of the first target version set is consistent with the first world state, Endorse The first target version set is stored in the state database, or if the second world state of the first target version set is inconsistent with the first world state, Endorse stores the second target version set in the state database.

In the embodiment of the present application, the legal latest version set is stored in the state database, which means that the legal version set can be called by the client, and the illegal version set is not stored in the state database, so the client will not call the illegal version. Set the corresponding chain code to reduce the risk of calling illegal version sets for transactions.

In a second aspect, an embodiment of the present application provides a device for upgrading a chain code. The device is provided with a processor and a memory.

The memory is configured to store information including program instructions; the processor is configured to obtain a first target version set corresponding to the chain code to be upgraded, and the first target version set includes an upgrade package of the first target version and related configurations of the upgrade package. ; Simulate the upgrade of the chain code to be upgraded according to the first target version set in an independent operating environment, the independent operating environment does not affect the operating environment other than itself; if the second world state of the first target version set is the world state and the first If the world status is the same, the chain code to be upgraded is upgraded outside the independent operating environment. The first world state is to simulate the world state before the upgrade; the second world state is to simulate the world state after the upgrade. .

In a possible design, the processor is further configured to update the first target version set to the second target version set if the second world state of the first target version set is inconsistent with the first world state, and the second target The version set is the latest legal version set in the branch of the version tree to which the first target version set belongs, and the second world state of the legal version set is consistent with the first world state.

In a possible design, the processor is further configured to determine a version tree branch to which the first target version set belongs according to a domain to which the chain code to be upgraded belongs, and connect the first target version set to a version to which the first target version set belongs. After the latest version set in the tree branch. Optionally, in a certain branch of the version tree, the version sets of different versions are connected in the order of the update time of the versions, and the new version set is based on the old version set at a higher level.

In a possible design, the processor is further configured to: if the second world state of the first target version set is consistent with the first world state, Endorse stores the first target version set to a state database; or, if the first If the second world state of the target version set is inconsistent with the first world state, Endorse stores the second target version set to the state database.

According to a third aspect, a chain code upgrading device is provided, and the device has the function of implementing the method of any one of the first aspects. This function can be realized by hardware, and can also be implemented by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions.

According to a fourth aspect, a chain code upgrading device is provided, including: a processor and a memory; the memory is configured to store computer execution instructions; when the device is running, the processor executes the computer execution instructions stored in the memory, so that the The device executes the chain code upgrading method according to any one of the first aspects.

According to a fifth aspect, an apparatus is provided, including: a processor; the processor is coupled to the memory and reads instructions in the memory, and then executes the method for upgrading a chain code according to any one of the first aspects according to the instructions.

According to a sixth aspect, a computer-readable storage medium is provided. The computer-readable storage medium stores instructions that, when run on a computer, enable the computer to execute the method for upgrading a chain code according to any one of the first aspects.

According to a seventh aspect, a computer program product containing instructions is provided, which, when run on a computer, enables the computer to execute the method for upgrading a chain code according to any one of the first aspects.

According to an eighth aspect, a chip system is provided. The chip system includes a processor, and is configured to support the foregoing device to implement the functions involved in the foregoing first aspect. In a possible design, the chip system further includes a memory, which is used to store program instructions and data necessary for the device. The chip system can be composed of chips, and can also include chips and other discrete devices.

According to a ninth aspect, there is provided a circuit system including a processing circuit configured to perform a function according to the first aspect described above.

The technical effects brought by any one of the design methods in the second aspect to the ninth aspect can refer to the technical effects brought by the different design methods in the first aspect, and will not be repeated here.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic architecture diagram of a blockchain system according to an embodiment of the present application; FIG.

FIG. 2 is a first schematic structural diagram of an endorsement node according to an embodiment of the present application; FIG.

3 is a schematic flowchart of a method for obtaining a target version set according to an embodiment of the present application;

4 is a schematic diagram of a chain code upgrade process and a state of the world in the prior art;

FIG. 5 is a schematic flowchart of a chain code upgrade method according to an embodiment of the present application;

6 is a schematic diagram of a chain code upgrade process and a state of the world provided by an embodiment of the present application;

7 is a flowchart of a method for creating a version tree according to an embodiment of the present application;

8 is a schematic diagram of a version tree provided by an embodiment of the present application;

9 is a flowchart of a version tree management method according to an embodiment of the present application;

FIG. 10 is a second structural diagram of an endorsement node provided by this embodiment.

Detailed ways

In the description of this application, unless otherwise stated, "/" represents or means, for example, A / B may represent A or B; "and / or" herein is merely an association relationship describing an associated object, It means that there can be three kinds of relationships, for example, A and / or B, it can mean: there are three cases of A alone, A and B, and B alone. And, in the description of the present application, unless stated otherwise, "plurality" means two or more. In addition, in order to facilitate a clear description of the technical solutions of the embodiments of the present application, in the embodiments of the present application, words such as “first” and “second” are used to distinguish the same or similar items having substantially the same functions and functions. Those skilled in the art can understand that the words "first", "second" and the like do not limit the number and execution order, and the words "first" and "second" are not necessarily different.

In addition, the network architecture and service scenarios described in the embodiments of the present application are used to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided by the embodiments of the present application. With the evolution of the network architecture and the emergence of new service scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems.

First, the terms involved in the embodiments of the present application are introduced:

Ledger: Used to record every transaction in the blockchain system, usually including the blockchain and the current state of the world. Among them, the blockchain consists of a set of blocks connected end to end.

World State (World State): It is used to indicate the execution result and state of the transaction, and usually consists of a set of variables.

The following describes the structure of the blockchain system involved in the embodiments of the present application:

As shown in FIG. 1, it is a schematic structural diagram of a blockchain system according to an embodiment of the present application. The blockchain system 100 includes a client 101, at least one endorsing node 102 (only one is exemplarily shown in FIG. 1), at least one submitting node 103, and at least one consensus node 104 (orderer) 104 ( Figure 1 shows only one by way of example).

The client 101 and the endorsement node 102 may be connected through a wireless network (such as Wi-Fi, Bluetooth, a cellular mobile network, or the like) or a wired network (such as fiber optics), which is not limited in the embodiment of the present application.

The client 101 and the consensus node 104 may also be connected through a wireless network (such as Wi-Fi, Bluetooth, a cellular mobile network, or the like) or a wired network (such as fiber optics), which is not limited in the embodiment of the present application.

Similarly, the consensus node 104 and the endorsement node 102 may also be connected through a wireless network (such as Wi-Fi, Bluetooth, cellular mobile network, etc.) or a wired network (such as optical fiber, etc.), which is not limited in this embodiment of the present application.

The client 101 is configured to send a chain code deployment, a chain code upgrade request, and initiate a transaction request to the endorsement node 102 and the like. It is also used to send each transaction to the consensus node 104. Among them, a software development kit (SDK) is deployed in the client 101, and a user can use the SDK provided by the client 101 to create a chain code and submit a chain code upgrade request to trigger the chain code upgrade process.

It should be noted that, in the blockchain system 100, the client 101 stores a key, so that the key can be used for identity verification, so as to improve the security of the blockchain system 100.

Optionally, the clients mentioned above may include various computing devices with computing functions, personal digital assistant (PDA) computers, tablet computers, handheld devices, and laptop computers (laptops) computer), user equipment (UE), terminal equipment (terminal), and the like. For convenience of description, the devices mentioned above are collectively referred to as terminals in this application.

The endorsement node 102 is used to respond to the chaincode deployment request, chaincode upgrade request, transaction request, etc. initiated by the client 101 and verify the legitimacy of each request (including the legitimacy of the client's identity). If the request is a legitimate request, Then the endorsement node 102 performs an endorsement operation for the request, and feeds the endorsement result to the client 101, so that the client 101 sends the transaction to the consensus node 104 according to the endorsement result, so as to determine the order of the transaction in the blockchain. It is also used to respond to chain code upgrade requests, to perform simulated upgrade of the chain code to be upgraded in an independent operating environment, and only when it is determined that the chain code to be upgraded does not tamper with the current world state after the simulation upgrade (The world state is the same as the simulated world state after the upgrade), and then the actual upgrade of the chain code is performed outside the independent operating environment. And, it is also used to store a version tree of each version of the chaincode, and the version tree is used to trace back the version of the chaincode. It should be noted that a chain code is deployed in the endorsement node 102, and the endorsement node 102 executes the chain code to execute each transaction requested by the client.

Optionally, the endorsement node 102 in the embodiment of the present application may be implemented by a device or a function module in a device, which is not specifically limited in the embodiment of the present application. It can be understood that the foregoing function module may be a network element in a hardware device, a software function running on a hardware device, or a virtualized function instantiated on a platform (for example, a cloud platform).

The submitting node 103 is used to obtain an ordered block chain sorted by the consensus node 104.

Optionally, the submitting node 103 may be implemented by a device, may also be a functional module in a device, or have other implementation manners, which are not specifically limited in this embodiment of the present application.

It should be noted that the endorsement node 102 and the submission node 103 may be co-located in one device, and the device has the function of the endorsement node 102 and the function of the submission node 103. Wherein, the endorsement node 102 and the submission node 103 may be implemented as different components in a device, or may be implemented as different functional modules in a device, which is not limited in the embodiment of the present application.

The consensus node 104 is used to sort each transaction sent by the client 101 to ensure that each transaction is written into the blockchain in the correct order. It is also used to notify the submitting node 103 of the sorted transactions.

Optionally, the consensus node 104 may be implemented by a device, may also be a functional module within a device, or have other implementation manners, which are not specifically limited in this embodiment of the present application.

The chain code upgrade method provided in the embodiment of the present application is mainly applied to the above endorsement node. The endorsement node in the embodiment of the present application may have the functions of the endorsement node 101 and the submission node 102 shown in FIG. 1, and when implemented by a hardware device FIG. 2 shows a schematic diagram of the hardware structure of an exemplary endorsement node. The endorsement node 200 includes at least one processor 201, a communication line 202, a memory 203, and at least one transceiver 204.

The processor 201 may be a general-purpose central processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more processors for controlling the execution of the program of the solution of the present application. integrated circuit.

The communication line 202 may include a path for transmitting information between the aforementioned components.

The transceiver 204 is configured to communicate with other devices or communication networks, such as Ethernet, wireless access network (RAN), wireless local area networks (WLAN), and the like.

The memory 203 may be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM), or other types that can store information and instructions Dynamic storage device, can also be electrically erasable programmable read-only memory (electrically erasable programmable read-only memory (EEPROM)), read-only compact disc (compact disc-read-only memory (CD-ROM) or other optical disc storage, optical disc storage (Including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), disk storage media or other magnetic storage devices, or can be used to carry or store desired program code in the form of instructions or data structures and can be used by a computer Any other media accessed, but not limited to this. The memory may exist independently, and is connected to the processor through the communication line 202. The memory can also be integrated with the processor.

The memory 203 is configured to store a computer execution instruction for executing the solution of the present application, and the processor 201 controls execution. The processor 201 is configured to execute computer execution instructions stored in the memory 203, so as to implement the method for upgrading a chain code provided in the following embodiments of the present application. Optionally, the memory 203 stores the simulation upgrade application code, version tree management application code, endorsement application code, transaction storage application code, submission application code, block assembly application code, Chain code life cycle management (Life Code of Chain Code, LSCC) application code, etc. Among them, the simulation upgrade application code is used to provide a chain code simulation upgrade function. The version tree management application code is used to provide the corresponding management functions of the version tree. The endorsement application code is used to provide endorsement functionality. The transaction storage application code is used to provide the function of accounting for each transaction. The submission application code is used to provide the ability to submit content to other types of nodes. The block assembly application code is used to provide the function of assembling blocks into a blockchain. LSCC is used to provide the function of chain code life cycle management.

Optionally, the computer-executable instructions in the embodiments of the present application may also be referred to as application program codes, which are not specifically limited in the embodiments of the present application.

In specific implementation, as an embodiment, the processor 201 may include one or more CPUs, such as CPU0 and CPU1 in FIG. 2.

In specific implementation, as an embodiment, the endorsement node 200 may include multiple processors, such as the processor 201 and the processor 207 in FIG. 2. Each of these processors can be a single-CPU processor or a multi-CPU processor. A processor herein may refer to one or more devices, circuits, and / or processing cores for processing data (such as computer program instructions).

In a specific implementation, as an embodiment, the endorsement node 200 may further include an output device 205 and an input device 206. The output device 205 is in communication with the processor 201 and can display information in a variety of ways. For example, the output device 205 may be a liquid crystal display (LCD), a light emitting diode (LED) display device, a cathode ray tube (CRT) display device, or a projector. Wait. The input device 206 is in communication with the processor 201 and can receive user input in a variety of ways. For example, the input device 206 may be a mouse, a keyboard, a touch screen device, or a sensing device.

The above-mentioned endorsement node 200 may be a general-purpose device or a special-purpose device. In a specific implementation, the endorsement node 200 may be a desktop computer, a portable computer, a personal digital assistant (PDA), a mobile phone, a tablet computer, a wireless terminal device, or a device with a similar structure in FIG. 2. The embodiment of the present application does not limit the type of the endorsement node 200.

The technical solution implemented in the present application will be described in detail below with reference to FIGS. 1 and 2. First, as shown in Figure 3, the endorsement node obtains the target version set flow. The process of obtaining the target version set is the basis of the chain code upgrade method provided by the following embodiments of this application, and includes the following steps:

S301. The client receives an installation package upload instruction input by a user.

Here, the upgrade package is an installation package of the first target version of the chain code to be upgraded. For example, if the chain code to be upgraded needs to be upgraded to version 2.0, the installation package is a version 2.0 installation package. Since the embodiments of the present application are mainly applied to the chain code upgrade process, the installation package herein may also be referred to as an upgrade package.

Optionally, the user enters the installation package upload instruction through a subcommand, or the user enters the installation package upload instruction through a User Interface (UI) method. Of course, the user can also enter the installation package upload instruction through other methods. This application The embodiment does not limit this.

S302. In response to the installation package upload instruction, the client reports the installation package of the first target version of the chain code to be upgraded to the endorsing node.

S303. The endorsement node stores the installation package of the first target version.

Based on the process of uploading the installation package provided in this embodiment, the endorsement node stores the installation package of the first target version, and then the corresponding installation package can be used to upgrade the chain code to be upgraded to the first target version according to user needs, which meets more Demand for new business.

Taking the precious metal transaction as an example, as shown in Fig. 4, suppose that at the beginning, enterprise A and enterprise B signed a contract for precious metal transactions, and used the blockchain technology to conduct precious metal transactions. The two parties agreed that their initial account quotas were 20 Million. The blockchain system performs the initialization process of this contract (that is, the chain code). The initial world state (such as the initial account status and initial account quota) in the contract is recorded on the ledger of each endorsed node. Among them, the account limit of both parties in the initial contract is: A's account limit is 200,000, and B's account limit is 200,000.

It should be noted that in the blockchain technology, smart contracts and chain codes are the same concept, which will be described here, and will not be described in detail below.

Afterwards, Enterprise A paid RMB 20,000 to Enterprise B for the purchase of a certain precious metal. At this time, the account balance of enterprise A was 180,000, and the account balance of enterprise B was 220,000. With the changes in the trading market, Company B believes that the unit price of precious metals should be increased. Therefore, Company B and Company A re-sign a contract with a new unit price of precious metals recorded in the agreement. The blockchain system verifies whether the new chain code (contract) was submitted by enterprise A or enterprise B. If the new chain code is submitted by enterprise A or enterprise B, the blockchain system confirms that the new chain code is legal, and executes the new The chain code initialization process, the initial value of the account in the new chain code (contract) is recorded in the ledger. However, when the new chain code has logical defects, it is likely to misplace the world state of the transaction (such as account status, account initial value, account balance, etc.). Still referring to Figure 4, the account balance of enterprise A should be 220,000, but due to a logical defect in the new chain code, the account balance of enterprise A was misplaced to 200,000. Similarly, the account balance of enterprise B was misplaced to 20 Million.

It can be seen that in the prior art, when the chain code is upgraded (that is, a new contract is deployed), it is likely to cause unexpected changes to the world state of the transaction, which will cause errors in the recorded blockchain and cause damage to users' off-chain assets.

To this end, an embodiment of the present application provides a method for upgrading a chain code. As shown in FIG. 5, the method includes the following steps:

S501. The client sends a chain code upgrade request to the endorsing node. The chain code upgrade request carries an upgrade proposal, which is used to request the endorsing node to upgrade the chain code to be upgraded to the first target version. The upgrade proposal includes the first target version installation package in Endorses the path in the node and the related configuration of the installation package. Here, the related configuration of the installation package includes, but is not limited to, the name of the chain code corresponding to the installation package and the corresponding version of the chain code.

Among them, users can upgrade the chaincode through the command line or UI. Of course, users can also upgrade the chaincode in other ways. If the command line method is used, in one example, the user enters a chain code upgrade instruction through the client to trigger the client to execute S501. Specifically, after the user enters the chain code upgrade instruction on the client, the client generates a code structure (Spec) according to the chain code upgrade instruction, generates a deployment spec according to the Spec, and generates an upgrade proposal according to the deployment Spec. Here, to ensure that the upgrade proposal comes from a legitimate client, the client can digitally sign the upgrade proposal. Specifically, the client uses the private key to encrypt the upgrade proposal to implement signature of the upgrade proposal.

After that, the client sends a chain code upgrade request carrying an upgrade proposal to the endorsing node through a protocol such as Remote Procedure Call (Protocol, Protocol, RPC) to notify the endorsing node to upgrade the chain code to be upgraded to the first target version.

S502. The endorsement node obtains a first target version set corresponding to the chain code to be upgraded. The first target version set includes an upgrade package of the first target version and related configurations of the upgrade package.

Among them, as described above, an upgrade package of a version is an installation package of the version.

After receiving the chaincode upgrade request, the endorsing node calls the ProcessProposal interface to process the carried upgrade proposal and verifies the signature of the upgrade proposal. Specifically, the endorsement node uses the client's public key to verify whether the upgrade proposal comes from the client. The endorsement node can also verify the client's certificate and authority, thereby further strengthening the security of the blockchain system. If the verification is passed, the endorsement node obtains the installation package of the first target version and the related configuration of the installation package of the first target version according to the path of the installation package of the first target version in the upgrade proposal. For the convenience of description, the path of a version installation package and the related configuration of the version installation package are referred to as a version set in this article, which are described here collectively, and will not be described in detail below. In this way, the path of the first target version installation package and the related configuration of the first target version installation package are collectively referred to as the target version set.

S503. The endorsement node creates an independent operating environment.

Optionally, the independent running environment is a container, and the container is at least one application running independently and the running environment of at least one application. Of course, the independent running environment may also have other implementation forms, for example, being implemented as a running environment such as a virtual machine, which is not limited in the embodiment of the present application.

Among them, the independent operating environment does not affect the operating environment outside of itself. For example, the data of the Host file system outside the independent operating environment will not be changed, and the data in the actual state database outside the independent operating environment will not be altered.

Optionally, the endorsement node calls an application programming interface (Application Programming Interface, API) to create an independent running environment, for example, the endorsement node calls an API interface to create a container.

The endorsement node can create an independent operating environment in advance before S501, and in the future, it can directly use the independent operating environment created in advance. Alternatively, the endorsement node is created after the first target version set is obtained. Of course, the independent running environment may also be created at another time. That is, the timing of creating an independent operating environment is not limited in the embodiment of the present application.

S504. The endorsement node obtains the first world state. Among them, the first world state is the state of the chain code to be upgraded before the upgrade.

It should be noted that the embodiment of the present application does not limit the timing of obtaining the first world state. For example, the endorsing node may execute S504 after S503, and may also execute S504 before or after S502.

S505. The endorsement node performs a simulated upgrade on the chain code to be upgraded according to the first target version set in an independent operating environment.

Optionally, the endorsement node compiles the chaincode indicated by the first target version set (that is, the installation package of the first target version and the related configuration of the first target version installation package), and generates an image according to the binary file of the compiled chaincode .

After that, the endorsement node starts the above-mentioned generated image, and executes the simulation upgrade process of the chaincode in the independent operating environment according to the information of the first target version set contained in the image. Specifically, the endorsement node performs a simulated upgrade of the chain code to be upgraded in the independent operating environment according to the first target version installation package and related configuration of the installation package, and initializes the first target version chain code after the simulated upgrade. Here, the process of simulating the upgrade of the chain code is similar to the process of actually upgrading the chain code. The difference is that the simulation upgrade process is performed in an independent operating environment and does not affect other applications outside the independent operating environment in the endorsement node. The running of the program code, that is, the simulation upgrade process will not interfere with other operations outside the independent running environment, and applications outside the independent running environment cannot perceive the above simulation upgrade process.

The specific process of upgrading the chain code and initializing the chain code can be referred to the prior art, and will not be repeated here.

S506. The endorsement node obtains a second world state, and the second world state is a simulated world state of the chain code to be upgraded.

With reference to the exemplary process of chain code upgrade in FIG. 6, the second world state corresponding to the initial target version of the chain code after initialization is: the account balance of enterprise A is 180,000, and the account balance of enterprise B is 220,000.

S507. If the state of the second world is consistent with the state of the first world, the endorsing node upgrades the chain code to be upgraded outside the independent operating environment.

The upgrade here in S507 is the actual chaincode upgrade process, including the initialization process of the first target version of the chaincode.

The actions of the endorsement node in the above steps S501 to S507 can be executed by the processor 201 shown in FIG. 2 calling the application program code stored in the memory 203. For example, the processor 201 calls the simulation upgrade application program code stored in the memory 203 to perform the simulation upgrade action of S505. Of course, the above actions can also be performed in other manners, which are not limited in the embodiment of the present application.

Compared with the prior art, which only verifies that the target version chain code comes from a legitimate client, so that the target version chain code with logical defects can tamper with the world state and increase the transaction risk, the method for upgrading the chain code provided in the embodiment of this application endorses the node. Obtain the first target version set corresponding to the chain code to be upgraded, and simulate the upgrade of the chain code to be upgraded according to the first target version set in an independent operating environment. Only when the second world state after the simulation upgrade and the first After the world status is consistent, the actual upgrade of the chain code to be upgraded is performed outside the independent operating environment. First of all, the simulation upgrade process in the memory of independent operation environment protection will not interfere with other applications outside the independent operation environment, that is, it will not cause damage to the actual transactions and blockchain data outside the independent operation environment. Secondly, the second world state after the simulation upgrade is consistent with the first world state before the simulation upgrade, indicating that the first target version of the chain code has not tampered with the world state. The feasibility of the chain code upgrade has been verified in an independent operating environment. , Then in the actual upgrade process, the probability that the first target version chain code tampered with the world state will be correspondingly reduced, so that the accuracy of transactions based on the untampered world state after the actual upgrade is improved, and blockchain transactions are improved. Security.

In other embodiments of the present application, a method for managing a version tree of a chain code is also provided. As shown in FIG. 7, a process for creating a version tree is provided. The basis of the version tree management method includes the following steps:

S701. The endorsement node obtains a new version set corresponding to the chain code.

For the description of S701, refer to S502, which is not repeated here.

Optionally, the processor 201 of the endorsement node calls the LSCC in the memory 203, and the LSCC obtains a new version set corresponding to the chain code.

S702. The endorsement node determines the version tree branch to which the new version set belongs according to the domain to which the chain code corresponding to the new version set belongs.

Optionally, the processor 201 calls the version tree management application code in the memory 203, and the version tree management application code determines the version tree branch to which the new version set belongs according to the domain to which the chain code belongs.

Among them, different domain chain codes have different chain code identifiers. The version tree includes a root node and a child node. The root node is a virtual node and does not correspond to a version set with practical significance. The child node includes a first child node and a second child node. The first child node is a first-level child node of the root node. The second child node is a child node other than the first-level child node. Each first child node is a version root node of the domain chain code. The version root node directly or indirectly connects the second child node of the domain chain code, the first child node of the domain chain code and the second child of the domain chain code. Nodes constitute the version tree branch of the domain chain code. In the version tree, each child node corresponds to a version set, and a version set includes the installation package of the version and the related configuration of the installation package of the version. Optionally, in a certain branch of the version tree, the version sets of different versions are linked according to the update time of the version, and the new version set is based on the old version set at a higher level.

In the embodiments of the present application, the domain can be used to describe the function of the chain code, and can also be used to distinguish different user services. Referring to FIG. 8, the domain 1 corresponds to the chain code of the precious metal transaction, the domain 2 corresponds to the charity chain code of the charity, and the domain 3 corresponds to the chain code of the stock transaction. The version tree in FIG. 8 includes a root node and a plurality of child nodes. The precious metal field branch includes a version root node (first-level child node) and other level child nodes of the field, where the version root node corresponds to a version set of version 1.0 (that is, 1.0 version of the chaincode installation package and 1.0 version of the chaincode installation package), the second-level child node connected to the root node of this version corresponds to the version set of version 2.0, and the third-level child node corresponds to the version set of version 3.0 . Similarly, each node in the charity funds branch and the stock domain branch corresponds to a version set.

In an example, in conjunction with the examples in FIG. 4 and FIG. 6, the chain code to be upgraded is a chain code in the field of precious metal transactions between enterprise A and enterprise B, and enterprise A and enterprise B must upgrade the chain code to be upgraded to version 4.0 , The new version is version 4.0, and the branch of the version tree to which the new version set belongs is the precious metal field branch shown in FIG. 8.

S703. The endorsement node connects the acquired new version set to the latest version version set in the branch of the version tree to which the new version set belongs.

Optionally, the processor 201 of the endorsement node calls the version tree management application code in the memory 203 to connect the new version set to the branch of the version tree to which it belongs.

As shown in FIG. 8, in the branch of the version tree in the field of precious metals, the latest version set is the 3.0 version set, and the newly obtained 4.0 version set is connected after the 3.0 version set.

With reference to the embodiment shown in FIG. 5, in the embodiment shown in FIG. 7, it can also be determined whether each version set is legal. Specifically, if the endorsing node determines that the second world state after the simulated upgrade of a certain version of the chaincode is consistent with the first world state before the simulated upgrade, indicating that the version of the chaincode has not tampered with the world state, the version set is determined to be a legal version Set, that is, in the embodiment of the present application, the legal version set refers to a version set that is consistent with the state of the world before and after the simulation upgrade, and a unified description is made here. If the endorsing node determines that the second world state after the simulated upgrade of a certain version of the chaincode is inconsistent with the first world state before the simulated upgrade, it determines that the version set is an illegal version set, that is, in the embodiment of the present application, it is illegal The version set refers to a version set that is inconsistent with the state of the world before and after the simulation upgrade, and is described here uniformly. As a possible implementation manner, if the processor 201 of the endorsement node initially determines that a certain version set is a legal version set, the simulation upgrade application code shown in FIG. 2 is called in an independent operating environment, and the use of the simulation upgrade application code is simulated. Private key 1 signs the version set. Subsequently, outside the independent container, the processor 201 of the endorsing node calls the LSCC shown in Figure 2. The LSCC uses the public key 1 (the public key 1 and the private key 1 are used in pairs) to verify whether the version set has been simulated and upgraded. The application code processes, and if so, finally determines that the version set is a legal version set.

Still referring to FIG. 8, each version set of the precious metal field chain code, the 1.0 version set, 2.0, 3.0 version set is a legal version set, the 4.0 version is an illegal version set; each version set of the charity field chain code, the 1.0 version set And 2.0 version sets are legal version sets; for each version set of the chain code in the stock field, the 1.0 version set and the 2.0 version set are legal version sets.

In the embodiment of the present application, the legal version set can be stored in the state database, which means that the legal version set in the state database can be called by the client, and the illegal version set is not stored in the state database, so the client does not call To the chain code corresponding to the illegal version set, reducing the risk of calling the illegal version set for transactions.

It should be noted that the action of the endorsement node to connect the new version set to its own version tree branch (ie, a new node) can be used as a trigger condition to trigger the endorsement node to create the independent operating environment mentioned above. Of course, the triggering condition of the event of creating an independent container is not limited to this, and this embodiment of the present application does not limit this.

Based on the version tree creation process provided in this implementation, the endorsement node stores the version set of each version of the chaincode, that is, the endorsement node has a history of chaincode installation and each upgrade. The old version set is sequentially connected to the new version set, and the chain code version can be traced according to subsequent business requirements, and the appropriate version of the chain code can be selected as the chain code to provide transaction services to improve the user experience.

With reference to the embodiments shown in FIG. 5 and FIG. 7, the following describes the process of the version tree management method provided by the embodiment of the present application. As shown in FIG. 9, the method includes the following steps:

S901. The endorsement node obtains a first target version set corresponding to the chain code to be upgraded.

For a detailed description of S901, refer to the related description of S502, which is not repeated here.

S902. The endorsement node queries the version tree according to the first target version set.

Optionally, the first target version set further includes the domain to which the chain code belongs or the version tree branch to which the chain code belongs, and is used to instruct the endorsing node to query the corresponding version tree branch. Assume that the version tree of the endorsement node query is shown in FIG. 8, and the branch of the version tree to which the first target version chain code belongs is a branch in the precious metal field.

S903. The endorsement node determines whether the version set of the first target version exists in the version tree. If the version set of the first target version exists in the version tree and the version set of the first target version is an illegal version set, S904, S905, S906: If the version set of the first target version exists in the version tree and the version set of the first target version is a legal version set, execute S906; if the version set of the first target version does not exist in the version tree, perform S907.

The first target version is a version of the first target version set.

S904. The endorsement node determines that the first target version set is an illegal version set.

In one example, it is assumed that it is necessary to upgrade to version 4.0, that is, the first target version set is the 4.0 version set. As shown in FIG. 8, in the version tree branch of the precious metal field, there is a 4.0 version set, and the 4.0 version set is illegal. Version set, then the endorsement node can determine that the first target version set is also an illegal version set.

S905. The endorsement node updates the first target version set to the second target version set.

The second target version set is the latest legal version set in the branch of the version tree to which the first target version set belongs.

In combination with the above example, the first target version 4.0 is an illegal version, the endorsement node may use the latest legal version 3.0 in the precious metal field as the second target version, and accordingly, the 3.0 version set is used as the second target version set.

S906. The endorsement node uses the updated target version set as a valid version set.

In conjunction with the example in S905, the endorsement node uses the 3.0 version set (that is, the second target version set) of the precious metal field in the state database as the valid version set, and the valid version set is used by the client to complete subsequent client-to-client interactions. Transaction. As a possible implementation manner, the endorsement node sets the 3.0 version set of the precious metal field in the state database to be valid, and when subsequent clients call the chain code in the precious metal field, the 3.0 version version set is directly called.

Or, when the user specifies to upgrade the precious metal domain chain code to version 3.0, since the legal version set of version 3.0 already exists in the version tree branch of the precious metal field, the endorsement node directly sets the version 3.0 set in the state database to be valid. To be called by the client.

S907. The endorsement node simulates the upgrade of the chain code to be upgraded according to the first target version set in an independent operating environment.

In an example, the user specifies that the precious metal domain chain code is upgraded to version 5.0. Since the precious metal domain branch of version 5.0 does not exist in the version tree, the endorsement node can perform the simulated upgrade process shown in FIG. 5. When the 5.0 version chain code is determined After tampering with the state of the world, the endorsing node will use this version 5.0 chaincode as the chaincode for providing services to clients. Alternatively, after determining that the 5.0 version chain code will tamper with the state of the world, the endorsing node executes the above S905 and S906 to update the first target version set to the second target version set, so as to re-determine the available valid version set, where the second target The version set is the latest legal version set in the branch of the version tree to which the first target version set belongs. For example, as shown in Figure 8, if the second world state of the first target version set (such as the 5.0 version set) is inconsistent with the first world state, it means that the version 5.0 chain code is likely to tamper with the world state of the blockchain system. To avoid this situation, the endorsement node executes S905 and S906 to re-determine the 3.0 version set in the precious metal field shown in FIG. 8 as a valid version set, and uses the 3.0 version set to provide services to the client.

Based on the version tree management method provided by the embodiment of the present application, when it is necessary to roll back to a certain chain code version, it can quickly roll back to the latest valid version set according to the version tree, and the valid version set will not tamper with the state of the world. So as to ensure the success of transactions between clients. For example, when a user repeatedly uploads an illegal version set, the endorsing node can learn the history of the illegal version set by querying the version tree, preventing the client from calling the chain code corresponding to the illegal version set for transactions, and improving transaction security. In addition, since it is known whether the version set is an illegal version set by querying the version tree, there is no need to perform operations such as identity verification (that is, from which client) and simulation upgrade, which simplifies the chain code upgrade process.

Of course, the business scenario related to the version tree management of this application is not limited to the embodiment shown in FIG. 9. In other embodiments, the blockchain system may fail and users cannot upgrade the chain code in time. At this time, Based on the version tree management method provided by the embodiment of the present application, the endorsement node can roll back to the latest version of the valid version set according to the version tree, thereby ensuring that the client calls the latest version of the valid version set for transactions.

In the embodiment of the present application, functional modules or functional units may be divided for the endorsement nodes according to the foregoing method examples. For example, each functional module or functional unit may be divided corresponding to each function, or two or more functions may be integrated into one. Processing module. The above integrated modules may be implemented in the form of hardware, or in the form of software functional modules or functional units. The division of modules or units in the embodiments of the present application is schematic, and is only a logical function division. In actual implementation, there may be another division manner.

FIG. 10 shows a possible structure diagram of an endorsement node involved in the above embodiment. As shown in FIG. 10, the endorsement node 1000 includes a storage unit 1001, a processing unit 1002, and a communication unit 1003.

The storage unit 1001 may store, for example, a version tree corresponding to a chain code. The processing unit 1002 is configured to control and manage the actions of the endorsement node 1000 to execute the technical solution steps in the embodiment of the present application. The communication unit 1003 is configured to support the endorsement node 1000 to communicate with other devices in the communication system shown in FIG. 1. For example, the endorsement node 1000 is supported to execute S501 in FIG. 5.

It should be noted that the storage unit 1001 may be implemented as the memory 203 of the endorsement node in FIG. 2. The processing unit 1002 may be implemented as the

processor

201 or 207 of the endorsement node in FIG. 2, and the communication unit 1003 may be implemented as the transceiver 204 of the endorsement node in FIG. 2.

Wherein, all relevant content of each step involved in the above method embodiment can be referred to the functional description of the corresponding functional module in the apparatus shown in FIG. 10, which is not repeated here.

Since the endorsement node provided in the embodiment of the present application can perform the foregoing resource allocation method, the technical effects that can be obtained can refer to the foregoing method embodiment, and details are not described herein again.

An embodiment of the present application further provides a computer-readable storage medium. The computer-readable storage medium has instructions stored therein. When the endorsement node executes the instruction, the endorsement node executes the execution by the endorsement node in the method flow shown in the foregoing method embodiment. Each step.

The computer-readable storage medium may be, for example, but is not limited to, an electric, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples (non-exhaustive list) of computer-readable storage media include: electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (Read-Only Memory (ROM)), Erasable Programmable Read Only Memory (EPROM), registers, hard disk, optical fiber, portable compact disk read-only memory (Compact Disc Read-Only Memory, CD-ROM ), An optical storage device, a magnetic storage device, or any suitable combination of the foregoing, or any other form of computer-readable storage medium known in the art. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. Of course, the storage medium may also be an integral part of the processor. The processor and the storage medium may be located in an Application Specific Integrated Circuit (ASIC). In the embodiments of the present application, the computer-readable storage medium may be any tangible medium containing or storing a program, and the program may be used by or in combination with an instruction execution system, apparatus, or device.

Optionally, the embodiment of the present application further provides a chip system, which is applied to an endorsement node. The chip system includes a processor for supporting the endorsement node to implement the methods in the foregoing embodiments, for example, a chain code to be upgraded in a container. Perform a simulated upgrade. In a possible design, the chip system further includes a memory. This memory is used to store the necessary program instructions and data of the endorsement node. Of course, the memory may not be in the chip system. The chip system may be composed of a chip, and may also include a chip and other discrete devices, which are not specifically limited in the embodiments of the present application.

The above is only a specific implementation of this application, but the scope of protection of this application is not limited to this. Any person skilled in the art can easily think of changes or replacements within the technical scope disclosed in this application. It should be covered by the protection scope of this application. Therefore, the protection scope of this application shall be subject to the protection scope of the claims.

Claims

A method for upgrading a chain code, comprising:

The endorser node Endorse obtains a first target version set corresponding to the chaincode Chaincode to be upgraded, where the first target version set includes an upgrade package of the first target version and related configurations of the upgrade package;

The endorsement node simulates and upgrades the chain code to be upgraded according to the first target version set in an independent operating environment, and the independent operating environment does not affect the operating environment other than itself;

If the second world state WorldState of the first target version set is consistent with the first world state, the endorsement node upgrades the chain code to be upgraded outside the independent operating environment, and the first world The state is the world state before the upgrade of the chain code to be simulated; the second world state is the world state after the upgrade of the chain code to be simulated.
The method for upgrading a chain code according to claim 1, wherein after the endorsement node obtains a target version set corresponding to the chain code to be upgraded, the method for upgrading a chain code further comprises:

If the second world state of the first target version set is inconsistent with the first world state, the endorsement node updates the first target version set to a second target version set, and the second target version set Is the latest legal version set in the branch of the version tree to which the first target version set belongs, and the second world state of the legal version set is consistent with the first world state.
The method for upgrading a chain code according to claim 2, characterized in that when a version set of the first target version exists in a branch of a version tree to which the first target version set belongs, and the version set of the first target version is When the second world state is inconsistent with the first world state, the second world state of the first target version set is inconsistent with the first world state, wherein the first target version is a version corresponding to the first target version set .
The method for upgrading a chain code according to claim 2 or 3, wherein the version tree includes a root node and a child node, the child node includes a first child node and a second child node, and the first child node is The first-level child node of the root node, the second child node is a child node other than the first-level child node, and each first child node is a version root node of a domain chain code, so The version root node is connected to the second child node of the domain chain code, and the first child node of the domain chain code and the second child node of the domain chain code form a version tree branch of the domain chain code; each A child node corresponds to a version set, and the version set includes a version upgrade package and a related configuration of the version upgrade package, and chain codes in different fields have different chain code identifiers.
The method for upgrading a chain code according to claim 4, wherein the first target version set is connected after a version set of a latest version in a branch of a corresponding version tree.
The method for upgrading a chain code according to any one of claims 1 to 5, wherein after the endorsement node obtains a first target version set corresponding to the chain code to be upgraded, the method for upgrading a chain code further comprises:

If the second world state of the first target version set is consistent with the first world state, the endorsement node stores the first target version set to a state database;

Alternatively, if the second world state of the first target version set is inconsistent with the first world state, the endorsement node stores the second target version set to a state database.
A chain code upgrading device, characterized in that the chain code upgrading device is provided with a processor and a memory;

The memory is configured to store information including program instructions;

A processor, configured to obtain a first target version set corresponding to the chaincode Chaincode to be upgraded, where the first target version set includes an upgrade package of the first target version and related configurations of the upgrade package; in an independent operating environment, according to The first target version set simulates and upgrades the chain code to be upgraded, and the independent operating environment does not affect the operating environment other than itself; if the second world state WorldState and the first If a world state is consistent, the chain code to be upgraded is upgraded outside the independent operating environment, and the first world state is the world state before the chain code to be upgraded is simulated; the second world state Simulate the upgraded world state for the chain code to be upgraded.
The apparatus for upgrading a chain code according to claim 7, wherein:

The processor is further configured to update the first target version set to a second target version set if the second world state of the first target version set is inconsistent with the first world state, and the first The second target version set is the latest legal version set in the branch of the version tree to which the first target version set belongs, and the second world state of the legal version set is consistent with the first world state.
The device for upgrading a chain code according to claim 8, wherein, when a version set of the first target version exists in a branch of a version tree to which the first target version set belongs, and the version set of the first target version is When the second world state is inconsistent with the first world state, the second world state of the first target version set is inconsistent with the first world state, wherein the first target version is a version corresponding to the first target version set .
The device according to claim 8 or 9, wherein the version tree includes a root node and a child node, the child node includes a first child node and a second child node, and the first child node is The first-level child node of the root node, the second child node is a child node other than the first-level child node, and each first child node is a version root node of a domain chain code, so The version root node is connected to the second child node of the domain chain code, and the first child node of the domain chain code and the second child node of the domain chain code form a version tree branch of the domain chain code; each A child node corresponds to a version set, and the version set includes a version upgrade package and a related configuration of the version upgrade package, and chain codes in different fields have different chain code identifiers.
The device for upgrading a chain code according to claim 10, wherein the first target version set is connected after a version set of a latest version in a branch of a corresponding version tree.
The chain code upgrading device according to any one of claims 7 to 11, characterized in that:

The processor is further configured to store the first target version set in a state database if the second world state of the first target version set is consistent with the first world state; or, if the first target If the second world state of the version set is inconsistent with the first world state, the second target version set is stored in the state database.
A readable storage medium, comprising a program or an instruction, and when the program or the instruction is executed, the method for upgrading a chain code according to any one of claims 1 to 6 is implemented.
A circuit system, characterized in that the circuit system includes a processing circuit configured to execute the chain code upgrading method according to any one of claims 1 to 6.