Digital property pop consensus method based on alliance chain and related equipment

Abstract

The application provides a digital property PoP consensus method based on a consortium chain and related equipment, wherein nodes in the consortium block chain include common nodes, nominated nodes and accounting nodes, the method comprises the following steps: in response to the existence of new transaction data, the accounting node packages the new transaction data to form block data, records the block data and initiates a first consensus verification; in response to the fact that the nominated node completes the first consensus verification, the nominated node records the block data and initiates a second consensus verification; and in response to the fact that the common node completes the second consensus verification, the common node records the block data. The digital property PoP consensus method based on the consortium chain and the related equipment provided by the application guarantee the characteristics of the block chain, take into account safety and fairness, improve performance, and solve the problem of the decrease of the overall data link processing capacity caused by the increase of the number of nodes in the consortium chain.

Description

Technical Field

[0001] This application relates to the field of blockchain technology, and in particular to a digital property rights PoP consensus method and related equipment based on consortium blockchain. Background Technology

[0002] Blockchain technology, due to its decentralized nature, has become an option for solving centralized problems in the socio-economic field. In the operation of a decentralized system, managing a large number of nodes is required, necessitating addressing the increasing management difficulty as the number of nodes grows. On the one hand, it breaks the traditional centralized management and authorization control model; on the other hand, it adopts a star-network distributed system architecture to ensure the integrity and eventual consistency of data from each node participating in distributed management.

[0003] In existing consensus methods, as the number of nodes increases, the computational difficulty of each node gradually increases, resulting in low throughput, excessive resource consumption, and increased risks due to resource concentration. Ultimately, it is difficult to guarantee the fairness required for decentralization. Summary of the Invention

[0004] In view of this, the purpose of this application is to propose a digital property rights PoP consensus method and related equipment based on consortium blockchain.

[0005] To achieve the above objectives, this application provides a digital property rights PoP consensus method based on a consortium blockchain, comprising:

[0006] In response to the presence of new transaction data, the ledger node packages the new transaction data into block data, records the block data, and broadcasts the first consensus verification information in the consortium blockchain;

[0007] In response to receiving the first consensus verification information, the plurality of nominated nodes perform the first consensus verification on the block data;

[0008] In response to the completion of the first consensus verification, each of the nominated nodes broadcasts the second consensus verification information and records the block data within its organization;

[0009] In response to receiving the second consensus verification information, all the ordinary nodes within the organization perform a second consensus verification on the block data;

[0010] In response to all the ordinary nodes within each organization completing the second consensus verification, the multiple ordinary nodes record the block data.

[0011] Furthermore, in response to the presence of new transaction data, the process further includes using a recommendation algorithm to elect the plurality of recommendation nodes and the accounting node from the plurality of ordinary nodes, specifically including:

[0012] Based on the current performance index, the FTS algorithm is used to elect the multiple recommended nodes from the multiple ordinary nodes;

[0013] Based on the current performance index, the FTS algorithm is used to elect the ledger node from the plurality of recommended nodes, wherein,

[0014] The current performance index corresponds one-to-one with each of the multiple ordinary nodes.

[0015] Furthermore, the response after all the ordinary nodes within each organization have completed the second consensus verification includes:

[0016] The election algorithm is used to elect new election nodes and new ledger nodes from the plurality of ordinary nodes, and the current performance index is updated.

[0017] Furthermore, the current performance index is specifically as follows:

[0018]

[0019] Where Y represents the performance index, X i W represents the i-th evaluation value. i This represents the weighting coefficient corresponding to the i-th evaluation value.

[0020] Furthermore, the step of selecting the multiple recommended nodes from the multiple ordinary nodes using the FTS algorithm based on the current performance index includes:

[0021] An FTS performance tree is constructed based on the current performance index of all ordinary nodes in each organization. The FTS algorithm is used to elect and determine the recommended node corresponding to each organization to obtain the plurality of recommended nodes.

[0022] Furthermore, the step of electing the accounting node from the plurality of recommended nodes using the FTS algorithm based on the current performance index includes:

[0023] An FTS performance tree is constructed based on the performance index of each of the nominated nodes, and the FTS algorithm is used to elect and determine the accounting node.

[0024] Furthermore, the nodes in the consortium blockchain include multiple ordinary nodes, multiple electoral nodes, and one ledger node. The consortium blockchain includes multiple organizations, each of which includes multiple ordinary nodes and one electoral node. The method includes:

[0025] For each round of consensus in the multi-round consensus process

[0026] In response to the existence of new transaction data, the ledger node packages the new transaction data into block data, records the block data, and broadcasts the first consensus verification information in the consortium blockchain;

[0027] In response to receiving the first consensus verification information, the plurality of nominated nodes perform the first consensus verification on the block data;

[0028] In response to the completion of the first consensus verification, each of the nominated nodes broadcasts the second consensus verification information and records the block data within its organization;

[0029] In response to receiving the second consensus verification information, all the ordinary nodes within the organization perform a second consensus verification on the block data;

[0030] In response to all the ordinary nodes within each of the organizations completing the second consensus verification, the multiple ordinary nodes record the block data to complete this round of consensus;

[0031] The recommended node is selected as the new accounting node from the pre-built list of recommended nodes according to the performance index. The multi-round consensus ends when all recommended nodes in the list have been used as accounting nodes.

[0032] Based on the same inventive concept, this application also provides a digital property rights PoP consensus device based on a consortium blockchain, comprising:

[0033] The first broadcast module is configured to, in response to the existence of newly added transaction data, package the newly added transaction data into block data, record the block data, and broadcast the first consensus verification information in the consortium blockchain;

[0034] The first consensus module is configured to, in response to receiving the first consensus verification information, perform the first consensus verification on the block data by the plurality of electoral nodes.

[0035] The second broadcast module is configured to, in response to the completion of the first consensus verification, broadcast the second consensus verification information and record the block data within its organization;

[0036] The second consensus module is configured to, in response to receiving the second consensus verification information, all the ordinary nodes within the organization perform a second consensus verification on the block data.

[0037] The first recording module is configured to record the block data in response to all the ordinary nodes within each organization completing the second consensus verification.

[0038] Based on the same inventive concept, this application also provides another digital property rights PoP consensus device based on consortium blockchain, including:

[0039] The third broadcast module is configured to, in response to the existence of newly added transaction data, package the newly added transaction data into block data, record the block data, and broadcast the first consensus verification information in the consortium blockchain;

[0040] The third consensus module is configured to, in response to receiving the first consensus verification information, have the plurality of electoral nodes perform a first consensus verification on the block data;

[0041] The fourth broadcast module is configured to, in response to the completion of the first consensus verification, each of the nominated nodes broadcasts the second consensus verification information and records the block data within its organization;

[0042] The fourth consensus module is configured to, in response to receiving the second consensus verification information, all the ordinary nodes within the organization perform a second consensus verification on the block data;

[0043] The second recording module is configured to record the block data in response to all the ordinary nodes within each organization completing the second consensus verification, so as to complete this round of consensus.

[0044] The multi-round consensus module is configured to select one of the recommended nodes of the accounting node from a pre-built list of recommended nodes in order of performance index as the new accounting node, and the multi-round consensus ends when all recommended nodes in the list of recommended nodes have been selected as accounting nodes.

[0045] Based on the same inventive concept, this application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable by the processor, wherein the processor implements the method described above when executing the computer program.

[0046] As can be seen from the above, the digital property rights PoP consensus method and related equipment based on a consortium blockchain provided in this application, in response to the existence of newly added transaction data, the accounting node packages the newly added transaction data into block data, records the block data, and initiates the first consensus verification; in response to the elector node completing the first consensus verification, the elector node records the block data and initiates the second consensus verification; in response to the ordinary node completing the second consensus verification, the ordinary node records the block data. This application, while ensuring the characteristics of blockchain, also takes into account security and fairness, achieves performance improvement, and mitigates the problem of reduced overall data link processing capacity caused by an increase in the number of nodes in a consortium blockchain. Attached Figure Description

[0047] To more clearly illustrate the technical solutions in this disclosure or related technologies, the accompanying drawings used in the description of the embodiments or related technologies will be briefly introduced below. Obviously, the accompanying drawings described below are only embodiments of this disclosure. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0048] Figure 1 This is a flowchart illustrating the digital property rights PoP consensus method based on consortium blockchain, as described in an embodiment of this application.

[0049] Figure 2 This is a schematic diagram of the node function state rotation in an embodiment of this application;

[0050] Figure 3 This is a flowchart of the batch consensus process in an embodiment of this application;

[0051] Figure 4 This is a schematic diagram of the structure of a consortium blockchain-based digital property rights PoP consensus device according to an embodiment of this application.

[0052] Figure 5 This is a schematic diagram of the structure of a digital property rights PoP consensus device based on a consortium blockchain, according to another embodiment of this application.

[0053] Figure 6 This is a schematic diagram of the structure of an electronic device according to an embodiment of this application. Detailed Implementation

[0054] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with specific embodiments and the accompanying drawings.

[0055] It should be noted that, unless otherwise defined, the technical or scientific terms used in the embodiments of this application should have the ordinary meaning understood by one of ordinary skill in the art to which this application pertains. The terms "first," "second," and similar terms used in the embodiments of this application do not indicate any order, quantity, or importance, but are merely used to distinguish different components. Terms such as "comprising" or "including" mean that the element or object preceding the word covers the element or object listed following the word and its equivalents, without excluding other elements or objects. Terms such as "connected" or "linked" are not limited to physical or mechanical connections, but can include electrical connections, whether direct or indirect.

[0056] Currently, among blockchain consensus methods, the Proof-of-Work (PoW) consensus algorithm suffers from low throughput and excessive resource consumption due to its difficulty coordination issues; the Byzantine Fault Tolerance (BFT) consensus algorithm requires significant network bandwidth for data transmission and authentication, as well as high computational processing power; and the Delegated Proof-of-Stake (DPOS) consensus algorithm is prone to increased risk due to resource concentration, ultimately failing to guarantee the fairness required for decentralization. This application utilizes the Post Office Protocol (PoP), employing the idea of ​​group governance. It constructs an FTS tree based on current performance index evaluation for election, achieving performance improvement while ensuring blockchain characteristics and balancing security and fairness. This addresses the issue of reduced overall data link processing capacity in consortium blockchains due to an increase in the number of nodes.

[0057] The embodiments of this application will be described in detail below with reference to the accompanying drawings.

[0058] refer to Figure 1 This application provides a digital property rights PoP consensus method based on consortium blockchain, including the following steps:

[0059] Step S101: In response to the existence of newly added transaction data, the ledger node packages the newly added transaction data into block data, records the block data, and broadcasts the first consensus verification information in the consortium blockchain.

[0060] Specifically, when the nominating node discovers that it has been elected as the ledger node, the ledger node needs to encapsulate and package all the newly added transaction data it has recorded to complete the process of generating and broadcasting a new block for consensus verification.

[0061] Step S102: In response to receiving the first consensus verification information, the plurality of nominated nodes perform the first consensus verification on the block data.

[0062] Specifically, when the multiple nominating nodes receive the first consensus verification information from the accounting node, the multiple nominating nodes need to perform a first consensus verification on the accuracy of the block data and update the accounting node data. Assuming there are r nominating nodes in the first consensus verification, successful consensus verification requires at least x nominating nodes to verify and sign the block data. The successful verification process is as follows:

[0063] sign[i](0≤i≤x, r / 2≤x≤(r-1)), r>3.

[0064] Step S103: In response to the completion of the first consensus verification, each of the nominated nodes broadcasts the second consensus verification information and records the block data within its organization.

[0065] Specifically, once the multiple nominating nodes have completed consensus verification of the block data, each nominating node will update the block data to all ordinary nodes in its organization.

[0066] Step S104: In response to receiving the second consensus verification information, all the ordinary nodes within the organization perform a second consensus verification on the block data.

[0067] Specifically, when the multiple ordinary nodes receive the second consensus verification information sent by the multiple electoral nodes, the multiple ordinary nodes need to perform a second consensus verification on the accuracy of the block data.

[0068] Step S105: In response to all the ordinary nodes within each organization completing the second consensus verification, the multiple ordinary nodes record the block data.

[0069] Specifically, when all the ordinary nodes within each organization complete the second consensus verification, the multiple ordinary nodes update the block data.

[0070] By following the above methods and steps, the accuracy of consensus data between nodes can be achieved. While ensuring the characteristics of blockchain, security and fairness are also taken into account, and performance is improved. This also helps to mitigate the problem of reduced overall data link processing capacity in consortium blockchains due to the increase in the number of nodes.

[0071] In some embodiments, the response to the presence of new transaction data further includes using a recommendation algorithm to elect the plurality of recommendation nodes and the accounting node from the plurality of ordinary nodes, including:

[0072] Based on the current performance index, the FTS algorithm is used to elect the multiple recommended nodes from the multiple ordinary nodes;

[0073] Based on the current performance index, the FTS algorithm is used to elect the ledger node from the plurality of recommended nodes, wherein,

[0074] The current performance index corresponds one-to-one with each of the multiple ordinary nodes.

[0075] Specifically, nodes in a blockchain network are divided into ordinary nodes, elected nodes, and ledger nodes. These three types of nodes correspond to three roles in the system, each with its own specific functions. Ordinary nodes are the basic unit of the consortium blockchain. All ordinary nodes must first obtain a digital signature certificate for network node communication proof by interacting with a unified CA server. Through the existence of the consensus protocol and the execution of smart contracts, they collectively maintain a backup of the consortium blockchain data, preventing tampering. Elected nodes are jointly elected by all ordinary nodes within the same organization. Only elected nodes can participate in the ledger node election and begin the subsequent consensus process. Ledger nodes are jointly elected by all elected nodes in this round, and all elected nodes have the potential to become ledger nodes.

[0076] like Figure 2 As shown, in a consortium blockchain, each node acts like a state machine. The state machine represented by a node can cycle through multiple state outcomes depending on its environment and time. Examples include the state transition between a regular node and a nominating node, and between a nominating node and a ledger node. Under this state transition mechanism, nodes need to interact based on the RPC (Remote Procedure Call) network communication protocol to perform the corresponding state transitions within the node network.

[0077] In some embodiments, the response after all the ordinary nodes within each organization have completed the second consensus verification includes:

[0078] The election algorithm is used to elect new election nodes and new ledger nodes from the plurality of ordinary nodes, and the current performance index is updated.

[0079] Specifically, after a consensus round, the current performance index is updated based on the node's evaluation in this round of consensus, and the results are broadcast to the blockchain network. To prevent information storms and ensure rapid convergence, the number of broadcast messages is limited and deduplicated. During consensus elections, the election information list is continuously updated based on the received broadcast messages until the vote results exceed a threshold, at which point the broadcast data is stopped, and the election confirmation results are broadcast. Afterwards, new nominating nodes and new ledger nodes are elected from among the multiple ordinary nodes, preventing the risk of centralized control due to weakened decentralization of the network.

[0080] In some embodiments, the current performance index is specifically:

[0081]

[0082] Where Y represents the performance index, X i W represents the i-th evaluation value. i This represents the weighting coefficient corresponding to the i-th evaluation value.

[0083] Specifically, the first evaluation value X1 is configured as the number of consensus communications successfully completed by a node with other nodes within the organization within a limited time; the second evaluation value X2 is configured as the time spent by a node processing and completing the POW (Proof of Work) consensus task distributed by the currently elected node; and the third evaluation value X3 is configured as the time spent by a node reading and writing data from the previous block. Since there are no previous elected nodes to distribute performance and evaluation tasks in the network when the blockchain network first starts voting, X1 = X2 = X3 = 1 is used as the initial value to begin the evaluation.

[0084] In some embodiments, the election of the plurality of recommended nodes from the plurality of ordinary nodes using the FTS algorithm based on the current performance index includes:

[0085] An FTS performance tree is constructed based on the current performance index of all ordinary nodes in each organization. The FTS algorithm is used to elect and determine the recommended node corresponding to each organization to obtain the plurality of recommended nodes.

[0086] Specifically, before the election of all ordinary nodes in each organization, an FTS performance tree is constructed using the current performance index. The FTS performance tree structure satisfies the Merkle tree structure. The FTS algorithm election method is as follows:

[0087] Step S201: Based on the random number seed, input it into the random number generator to obtain a random number ξRanSeed.

[0088] Step S202: Based on the random number, determine whether it is the first time to perform a comparison with the FTS performance tree node. If yes, start from the root node of the FTS performance tree; if no, start from the node determined after the previous comparison.

[0089] Step S203: Determine whether the random number is greater than the node performance index. If yes, select the left subtree node; if no, select the right subtree node. After selecting a node, record the node as the selection result.

[0090] Step S204: Check whether the recorded node is a leaf node of the FTS performance tree. If yes, broadcast the node as a recommended node in the blockchain network. If no, jump to step S202 and then execute S203 sequentially until the node selected for recording in step S204 is a leaf node of the FTS performance tree. Then broadcast the node as a recommended node in the blockchain network.

[0091] The random number ξRanSeed obtained by the random number generator is generated as follows:

[0092]

[0093] Where Term represents the timestamp that distinguishes different rounds, Timestamp represents the timestamp recorded in the block data, sign[i] is the consensus verification signature information, and F is defined. getseed The input requires x merged signature information, Term round information, and Timestamp information. A hash function is used to obtain the hash value of the three input data: signature information, Term round information, and Timestamp information. The hash value is then converted to binary to obtain binary hash data. The last 32 bits of the obtained binary hash value are truncated and then encoded into an integer. The positive integer mapped to this integer is the function F. getseed The final result is as follows. ξRanSeed satisfies the numerical domain U(1,n), and the corresponding probability density f(x) is uniformly distributed, specifically:

[0094]

[0095] In some embodiments, the election of the ledger node from the plurality of recommended nodes using the FTS algorithm based on the current performance index includes:

[0096] An FTS performance tree is constructed based on the performance index of each of the nominated nodes, and the FTS algorithm is used to elect and determine the accounting node.

[0097] Specifically, the process of constructing an FTS tree to determine the accounting node based on the current performance index of each of the nominated nodes can be specifically represented by the nomination function F. vote The calculation process, F vote The definition is as follows:

[0098] F vote (R, ξ) Ranseed → P i ∈(P1P2…P k )

[0099] Where R = {(V k1 ,P r1 ),…,(V kn ,P rn )}, V ki P represents the public key address used by the i-th nominating node for external signature verification. ri P represents the current performance index of the i-th nominated node. i ξRanSeed represents the accounting node determined by the recommendation function, and ξRanSeed represents the random number generated by the random number seed. In this embodiment, the method of generating the random number ξRanSeed and the election method of the FTS algorithm are the same as in the previous embodiment, and will not be repeated here.

[0100] In some embodiments, the nodes in the consortium blockchain include multiple ordinary nodes, multiple electoral nodes, and one ledger node. The consortium blockchain includes multiple organizations, each of which includes multiple ordinary nodes and one electoral node. The method includes the following steps:

[0101] For each round of consensus in the multi-round consensus process

[0102] Step S301: In response to the existence of newly added transaction data, the ledger node packages the newly added transaction data into block data, records the block data, and broadcasts the first consensus verification information in the consortium blockchain;

[0103] Specifically, when the nominating node discovers that it has been elected as the ledger node, the ledger node needs to encapsulate and package all the newly added transaction data it has recorded to complete the process of generating and broadcasting a new block for consensus verification.

[0104] Step S302: In response to receiving the first consensus verification information, the plurality of nominated nodes perform the first consensus verification on the block data;

[0105] Specifically, when the multiple nominating nodes receive the first consensus verification information from the accounting node, the multiple nominating nodes need to perform a first consensus verification on the accuracy of the block data and update the accounting node data. Assuming there are r nominating nodes in the first consensus verification, successful consensus verification requires at least x nominating nodes to verify and sign the block data. The successful verification process is as follows:

[0106] sign[i](0≤i≤x, r / 2≤x≤(r-1)), r>3.

[0107] Step S303: In response to the completion of the first consensus verification, each of the nominated nodes broadcasts the second consensus verification information and records the block data within its organization;

[0108] Specifically, once the multiple nominating nodes have completed consensus verification of the block data, each nominating node will update the block data to all ordinary nodes in its organization.

[0109] Step S304: In response to receiving the second consensus verification information, all the ordinary nodes within the organization perform a second consensus verification on the block data;

[0110] Specifically, when the multiple ordinary nodes receive the second consensus verification information sent by the multiple electoral nodes, the multiple ordinary nodes need to perform a second consensus verification on the accuracy of the block data.

[0111] Step S305: In response to all the ordinary nodes within each organization completing the second consensus verification, the multiple ordinary nodes record the block data to complete this round of consensus.

[0112] Specifically, when all the ordinary nodes within each organization complete the second consensus verification, the multiple ordinary nodes update the block data.

[0113] Step S306: Select one of the recommended nodes from the pre-built list of recommended nodes in order of performance index as the new accounting node. In response to the fact that all recommended nodes in the list of recommended nodes have been used as accounting nodes, the multi-round consensus ends.

[0114] Specifically, to improve consensus efficiency and control network latency, this embodiment employs a method of sequentially granting accounting rights to nominated nodes to increase batch consensus processing performance. During each consensus round, the timestamps of block data recordings are verified; only blocks that complete consensus confirmation within a valid time threshold are ultimately recognized. At the end of each consensus round, the system selects a new nominated node as the next accounting node to initiate subsequent consensus based on the order of the nominated node list, until all nominated nodes have exercised their accounting rights. The nominated node list is generated based on the current performance index of each nominated node, arranged from highest to lowest.

[0115] like Figure 3 As shown, the specific process of batch consensus is as follows: Assuming that each organization in the consortium blockchain has selected four nominating nodes, these four nodes are arranged in descending order of their current performance index to generate a nominating node list PR = {PR1, PR2, PR3, PR4}. The nominating nodes select new accounting nodes according to the order of the nominating node list. Each accounting node can generate and reach consensus on one block of data. One round consists of four consensus phases. In the PR1 consensus phase, PR1 acts as the accounting node, packaging the newly added transaction data into block data and broadcasting the block data to the three nominating nodes PR2, PR3, and PR4. The three nominating nodes verify the block data, and after verification, record and update the block data of accounting node PR1. Afterwards, PR2, PR3, and PR4 sequentially use their block-producing rights and record block data. Therefore, a total of four blocks are generated after one round of nomination.

[0116] It should be noted that the method in this embodiment can be executed by a single device, such as a computer or server. The method can also be applied in a distributed scenario, where multiple devices cooperate to complete the task. In such a distributed scenario, one of these devices may execute only one or more steps of the method in this embodiment, and the multiple devices will interact with each other to complete the method described.

[0117] It should be noted that the above description describes some embodiments of this application. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in a different order than that shown in the above embodiments and still achieve the desired result. Furthermore, the processes depicted in the drawings do not necessarily require a specific or sequential order to achieve the desired result. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0118] Based on the same inventive concept, and corresponding to any of the above embodiments, this application also provides a digital property rights PoP consensus device based on a consortium blockchain.

[0119] refer to Figure 4 The aforementioned digital property rights PoP consensus device based on consortium blockchain includes:

[0120] The first broadcast module 401 is configured to, in response to the existence of newly added transaction data, package the newly added transaction data into block data, record the block data, and broadcast the first consensus verification information in the consortium blockchain;

[0121] The first consensus module 402 is configured to, in response to receiving the first consensus verification information, perform the first consensus verification on the block data by the plurality of electoral nodes.

[0122] The second broadcast module 403 is configured to, in response to the completion of the first consensus verification, broadcast the second consensus verification information and record the block data within its organization;

[0123] The second consensus module 404 is configured to, in response to receiving the second consensus verification information, all the ordinary nodes within the organization perform a second consensus verification on the block data.

[0124] The first recording module 405 is configured to record the block data in response to all the ordinary nodes within each organization completing the second consensus verification.

[0125] Based on the same inventive concept, and corresponding to any of the above embodiments, this application also provides another digital property rights PoP consensus device based on consortium blockchain.

[0126] refer to Figure 5 The aforementioned digital property rights PoP consensus device based on consortium blockchain includes:

[0127] The third broadcast module 501 is configured to, in response to the existence of newly added transaction data, package the newly added transaction data into block data, record the block data, and broadcast the first consensus verification information in the consortium blockchain;

[0128] The third consensus module 502 is configured to, in response to receiving the first consensus verification information, perform the first consensus verification on the block data by the plurality of electoral nodes.

[0129] The fourth broadcast module 503 is configured to, in response to the completion of the first consensus verification, each of the nominated nodes broadcasts the second consensus verification information and records the block data within its organization;

[0130] The fourth consensus module 504 is configured to, in response to receiving the second consensus verification information, all the ordinary nodes within the organization perform a second consensus verification on the block data;

[0131] The second recording module 505 is configured to record the block data in response to all the ordinary nodes within each organization completing the second consensus verification, so as to complete this round of consensus.

[0132] The multi-round consensus module 506 is configured to select one of the recommended nodes of the accounting node from a pre-built list of recommended nodes in order of performance index as the new accounting node, and the multi-round consensus ends when all recommended nodes in the list of recommended nodes have been selected as accounting nodes.

[0133] For ease of description, the above devices are described in terms of function, divided into various modules. Of course, in implementing this application, the functions of each module can be implemented in one or more software and / or hardware.

[0134] The apparatus described above is used to implement the privacy computing method based on smart contracts in the blockchain in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0135] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, this application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, it implements the privacy computing method based on smart contracts in a blockchain as described in any of the above embodiments.

[0136] Figure 6 This embodiment illustrates a more specific hardware structure of an electronic device, which may include a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, memory 1020, input / output interface 1030, and communication interface 1040 are interconnected internally via the bus 1050.

[0137] The processor 1010 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.

[0138] The memory 1020 can be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage device, dynamic storage device, etc. The memory 1020 can store the operating system and other applications. When the technical solutions provided in the embodiments of this specification are implemented by software or firmware, the relevant program code is stored in the memory 1020 and is called and executed by the processor 1010.

[0139] The input / output interface 1030 is used to connect input / output modules to realize information input and output. Input / output modules can be configured as components within the device (not shown in the figure) or externally connected to the device to provide corresponding functions. Input devices may include keyboards, mice, touchscreens, microphones, various sensors, etc., while output devices may include displays, speakers, vibrators, indicator lights, etc.

[0140] The communication interface 1040 is used to connect a communication module (not shown in the figure) to enable communication between this device and other devices. The communication module can communicate via wired means (such as USB, Ethernet cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.).

[0141] Bus 1050 includes a pathway for transmitting information between various components of the device, such as processor 1010, memory 1020, input / output interface 1030, and communication interface 1040.

[0142] It should be noted that although the above-described device only shows the processor 1010, memory 1020, input / output interface 1030, communication interface 1040, and bus 1050, in specific implementations, the device may also include other components necessary for normal operation. Furthermore, those skilled in the art will understand that the above-described device may only include the components necessary for implementing the embodiments of this specification, and not necessarily all the components shown in the figures.

[0143] The electronic devices described above are used to implement the privacy computing methods based on smart contracts in the blockchain in any of the foregoing embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0144] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, this application also provides a non-transitory computer-readable storage medium that stores computer instructions for causing the computer to execute the privacy computing method based on smart contracts in a blockchain as described in any of the above embodiments.

[0145] The computer-readable medium of this embodiment includes permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.

[0146] The computer instructions stored in the storage medium of the above embodiments are used to cause the computer to execute the privacy computing method based on smart contracts in the blockchain as described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0147] Those skilled in the art should understand that the discussion of any of the above embodiments is merely exemplary and is not intended to imply that the scope of this application (including the claims) is limited to these examples; within the framework of this application, the technical features of the above embodiments or different embodiments can also be combined, the steps can be implemented in any order, and there are many other variations of different aspects of the embodiments of this application as described above, which are not provided in the details for the sake of brevity.

[0148] Additionally, to simplify the description and discussion, and to avoid obscuring the embodiments of this application, the well-known power / ground connections to integrated circuit (IC) chips and other components may or may not be shown in the provided drawings. Furthermore, the apparatus may be shown in block diagram form to avoid obscuring the embodiments of this application, and this also takes into account the fact that the details of the implementation of these block diagram apparatuses are highly dependent on the platform on which the embodiments of this application will be implemented (i.e., these details should be fully understood by those skilled in the art). While specific details (e.g., circuits) have been set forth to describe exemplary embodiments of this application, it will be apparent to those skilled in the art that the embodiments of this application can be implemented without these specific details or with variations thereof. Therefore, these descriptions should be considered illustrative rather than restrictive.

[0149] Although this application has been described in conjunction with specific embodiments thereof, many substitutions, modifications, and variations of these embodiments will be apparent to those skilled in the art from the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may be used with the embodiments discussed.

[0150] The embodiments of this application are intended to cover all such substitutions, modifications, and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the embodiments of this application should be included within the protection scope of this application.

Claims

1. A PoP consensus method based on a consortium chain for digital property, characterized in that, The nodes in the alliance blockchain include a plurality of normal nodes, a plurality of endorsing nodes and an accounting node, the alliance blockchain includes a plurality of organizations, each organization includes a plurality of normal nodes and an endorsing node, and the method comprises: In response to the existence of new transaction data, the accounting node packages the new transaction data to form block data, records the block data and broadcasts first consensus verification information in the alliance blockchain; In response to receiving the first consensus verification information, the plurality of endorsing nodes perform first consensus verification on the block data; In response to completing the first consensus verification, each endorsing node broadcasts second consensus verification information within the organization it belongs to and records the block data; In response to receiving the second consensus verification information, all normal nodes in the organization perform second consensus verification on the block data; In response to all normal nodes in each organization completing the second consensus verification, the plurality of normal nodes record the block data; Before the response to the existence of new transaction data, the method further comprises electing the plurality of endorsing nodes and the accounting node from the plurality of normal nodes using an endorsing algorithm, specifically comprising: Electing the plurality of endorsing nodes from the plurality of normal nodes based on a current performance index using an FTS algorithm; Electing the accounting node from the plurality of endorsing nodes based on the current performance index using an FTS algorithm, wherein, The current performance index corresponds to each normal node in the plurality of normal nodes one by one; the current performance index is determined according to an evaluation value and a weight proportion coefficient corresponding to the evaluation value; the evaluation value includes at least one of the following: the number of successful consensus communications between the normal node in the organization and other nodes in the organization within a limited time, the time taken by the normal node in the organization to complete the proof of work consensus task distributed by the current endorsing node, and the time taken by the normal node in the organization to complete reading and writing of the last block data.

2. The method of claim 1, wherein, After the response to all normal nodes in each organization completing the second consensus verification, the method further comprises: Electing new plurality of endorsing nodes and new accounting node from the plurality of normal nodes using the endorsing algorithm, and updating the current performance index.

3. The method of claim 1, wherein, The current performance index is specifically: wherein Y represents a performance index, X i represents the ith evaluation value, W i represents the weight proportion coefficient corresponding to the ith evaluation value.

4. The method of claim 1, wherein, The method of electing the plurality of endorsing nodes from the plurality of normal nodes based on a current performance index using an FTS algorithm comprises: Constructing an FTS performance tree based on the current performance index of all normal nodes in each organization, and electing the endorsing node corresponding to each organization using an FTS algorithm to obtain the plurality of endorsing nodes.

5. The method of claim 1, wherein, The method of electing the accounting node from the plurality of endorsing nodes based on the current performance index using an FTS algorithm comprises: Constructing an FTS performance tree based on the performance index of each endorsing node, and electing the accounting node using an FTS algorithm. 6.A PoP consensus method for digital property based on a consortium chain, characterized in that, The nodes in the alliance blockchain include a plurality of normal nodes, a plurality of proposer nodes and an accounting node, the alliance blockchain includes a plurality of organizations, each organization includes a plurality of normal nodes and a proposer node, and the method comprises: For each round of consensus in multiple rounds of consensus, In response to the existence of new transaction data, the accounting node packages the new transaction data to form block data, records the block data and broadcasts first consensus verification information in the alliance blockchain; In response to receiving the first consensus verification information, the plurality of proposer nodes perform first consensus verification on the block data; In response to completing the first consensus verification, each proposer node broadcasts second consensus verification information within the organization it belongs to and records the block data; In response to receiving the second consensus verification information, all normal nodes in the organization perform second consensus verification on the block data; In response to all normal nodes in each organization completing the second consensus verification, the plurality of normal nodes record the block data to complete this round of consensus; Select a proposer node as a new accounting node from a pre-constructed proposer node list in the order of performance index, and in response to all proposer nodes in the proposer node list having been an accounting node, the multiple rounds of consensus end; Before the response to the existence of new transaction data, the method further comprises selecting the plurality of proposer nodes and the accounting node from the plurality of normal nodes using a proposer algorithm, specifically comprising: Selecting the plurality of proposer nodes from the plurality of normal nodes based on the current performance index using the FTS algorithm; Selecting the accounting node from the plurality of proposer nodes based on the current performance index using the FTS algorithm, wherein The current performance index corresponds to each normal node in the plurality of normal nodes one by one; the current performance index is determined according to an evaluation value and a weight proportion coefficient corresponding to the evaluation value; the evaluation value includes at least one of the following: the number of successful consensus communications between the normal node in the organization and other nodes in the organization within a limited time, the time spent by the normal node in the organization to complete the proof-of-work consensus task distributed by the current proposer node, and the time spent by the normal node in the organization to complete reading and writing the last block data.

7. A digital property PoP consensus device based on a consortium chain, characterized in that, The nodes in the alliance blockchain include a plurality of normal nodes, a plurality of proposer nodes and an accounting node, the alliance blockchain includes a plurality of organizations, each organization includes a plurality of normal nodes and a proposer node, and the method comprises: A first broadcast module configured to, in response to the existence of new transaction data, the accounting node packages the new transaction data to form block data, records the block data and broadcasts first consensus verification information in the alliance blockchain; A first consensus module configured to, in response to receiving the first consensus verification information, the plurality of proposer nodes perform first consensus verification on the block data; The second broadcast module is configured to, in response to the completion of the first consensus verification, broadcast the second consensus verification information and record the block data within its organization; The second consensus module is configured to, in response to receiving the second consensus verification information, all the ordinary nodes within the organization perform a second consensus verification on the block data. The first recording module is configured to record the block data in response to all the ordinary nodes within each organization completing the second consensus verification. The response to the existence of new transaction data further includes using a recommendation algorithm to elect the plurality of recommendation nodes and the accounting node from the plurality of ordinary nodes, specifically including: Based on the current performance index, the FTS algorithm is used to elect the multiple recommended nodes from the multiple ordinary nodes; Based on the current performance index, the FTS algorithm is used to elect the ledger node from the plurality of recommended nodes, wherein, The current performance index corresponds one-to-one with each of the plurality of ordinary nodes; the current performance index is determined based on the evaluation value and the weighting coefficient corresponding to the evaluation value; the evaluation value includes at least one of the following: the number of times the ordinary node in the organization successfully completes consensus communication with other nodes in the organization within a limited time, the time spent by the ordinary node in the organization to complete the proof-of-work consensus task distributed by the current elector node, and the time spent by the ordinary node in the organization to complete reading and writing the previous block data. 8.A PoP consensus device based on a consortium chain for digital property, characterized in that, The nodes in the consortium blockchain include multiple ordinary nodes, multiple election nodes, and one ledger node. The consortium blockchain includes multiple organizations, each of which includes multiple ordinary nodes and one election node. The device includes: For each round of consensus in the multi-round consensus process The third broadcast module is configured to, in response to the existence of newly added transaction data, package the newly added transaction data into block data, record the block data, and broadcast the first consensus verification information in the consortium blockchain; The third consensus module is configured to, in response to receiving the first consensus verification information, have the plurality of electoral nodes perform a first consensus verification on the block data; The fourth broadcast module is configured to, in response to the completion of the first consensus verification, each of the nominated nodes broadcasts the second consensus verification information and records the block data within its organization; The fourth consensus module is configured to, in response to receiving the second consensus verification information, all the ordinary nodes within the organization perform a second consensus verification on the block data; The second recording module is configured to record the block data in response to all the ordinary nodes within each organization completing the second consensus verification, so as to complete this round of consensus. The multi-round consensus module is configured to select one of the recommended nodes of the accounting node from a pre-built list of recommended nodes in order of performance index as the new accounting node. The multi-round consensus ends when all recommended nodes in the list of recommended nodes have been selected as accounting nodes. The response to the existence of new transaction data further includes using a recommendation algorithm to elect the plurality of recommendation nodes and the accounting node from the plurality of ordinary nodes, specifically including: Based on the current performance index, the FTS algorithm is used to elect the multiple recommended nodes from the multiple ordinary nodes; Based on the current performance index, the FTS algorithm is used to elect the ledger node from the plurality of recommended nodes, wherein, The current performance index corresponds one-to-one with each of the plurality of ordinary nodes; the current performance index is determined based on the evaluation value and the weighting coefficient corresponding to the evaluation value; the evaluation value includes at least one of the following: the number of times the ordinary node in the organization successfully completes consensus communication with other nodes in the organization within a limited time, the time spent by the ordinary node in the organization to complete the proof-of-work consensus task distributed by the current elector node, and the time spent by the ordinary node in the organization to complete reading and writing the previous block data.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable by the processor, wherein the processor, when executing the computer program, implements the method according to any one of claims 1 to 6.

Images