CN114827167B - Node selection and transaction transmission method, device and storage medium - Google Patents
Node selection and transaction transmission method, device and storage medium Download PDFInfo
- Publication number
- CN114827167B CN114827167B CN202210204834.9A CN202210204834A CN114827167B CN 114827167 B CN114827167 B CN 114827167B CN 202210204834 A CN202210204834 A CN 202210204834A CN 114827167 B CN114827167 B CN 114827167B
- Authority
- CN
- China
- Prior art keywords
- parallel chain
- consensus
- height
- transaction
- chain block
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
- H04L67/1051—Group master selection mechanisms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1059—Inter-group management mechanisms, e.g. splitting, merging or interconnection of groups
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application provides a node selection and transaction transmission method, equipment and a storage medium, wherein the method comprises the following steps: when the parallel chain block height of the current parallel chain reaches the first parallel chain block height of the rotatable leader node, the following operation is performed on each first parallel chain block of the first parallel chain block height section taking the first parallel chain block height as a starting height and taking the sum of the first parallel chain block height and the second value as an ending height: generating a first consensus transaction of the first parallel chain block, transmitting the first consensus transaction to a main chain, and acquiring node information selected as a first leader node from the main chain; the first leader node is configured to perform the following operations on the plurality of second parallel chain blocks after the ending of the height: an aggregate consensus transaction is generated based on the second parallel chain block and transmitted to the backbone. The application ensures that the leader node is clear, saves the commission and keeps the parallel chain consensus simple and stable.
Description
Technical Field
The application relates to the technical field of parallel chains, in particular to a node selection and transaction sending method, equipment and a storage medium.
Background
In the existing main chain-parallel chain mechanism, if only one parallel chain link is allowed to send the aggregate consensus transaction, only the commission of the node is consumed, which is quite unfair. The applicant tries to negotiate the leader node for sending the aggregate consensus transaction according to a certain rule, but in the negotiation process of executing the rule, there may be a case that a plurality of parallel chain nodes consider themselves as the leader node and send the aggregate consensus transaction, which still causes waste of commission.
Disclosure of Invention
In view of the foregoing drawbacks or shortcomings in the prior art, it is desirable to provide a node selection and transaction transmission method, apparatus, and storage medium that is explicit in the leader node, cost-effective, and maintains a compact and stable parallel link consensus.
In a first aspect, the present application provides a node selection and transaction transmission method applicable to parallel link nodes, where the method includes:
when the parallel chain block height of the current parallel chain reaches the first parallel chain block height of the rotatable leader node, the following operation is performed on each first parallel chain block of the first parallel chain block height section taking the first parallel chain block height as a starting height and taking the sum of the first parallel chain block height and the second value as an ending height:
generating a first consensus transaction for the first parallel chain block and transmitting the first consensus transaction to the backbone for the backbone node:
consensus is carried out on the first parallel chain block according to the first consensus transaction and a plurality of second consensus transactions; wherein the second consensus transaction is a consensus transaction of the first parallel chain block generated by other parallel chain link points of the current parallel chain;
when the fact that the first parallel chain blocks are high in consensus success is monitored, selecting a first parallel chain node for sending a first consensus transaction which contributes to the success of the consensus as a first leader node;
acquiring node information selected as a first leader node from a main chain;
the first leader node is configured to perform the following operations on the plurality of second parallel chain blocks after the ending of the height: and generating an aggregate consensus transaction according to the second parallel chain blocks and sending the aggregate consensus transaction to the main chain so that the main chain node can perform consensus on a plurality of second parallel chain blocks according to the aggregate consensus transaction.
In a second aspect, the present application also provides an apparatus comprising one or more processors and a memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform the node selection and transaction transmission method provided according to embodiments of the present application.
In a third aspect, the present application also provides a storage medium storing a computer program for causing a computer to execute the node selection and transaction transmission method provided according to the embodiments of the present application.
According to the node selection and transaction transmission method, device and storage medium provided by the embodiments of the application, when the parallel chain block height of the current parallel chain reaches the first parallel chain block height of the rotatable leader node, the following operations are executed on each first parallel chain block in a first parallel chain block height section taking the first parallel chain block height as a starting height and taking the sum of the first parallel chain block height and a second value as an ending height: generating a first consensus transaction of the first parallel chain block, transmitting the first consensus transaction to a main chain, and acquiring node information selected as a first leader node from the main chain; the first leader node is configured to perform the following operations on the plurality of second parallel chain blocks after the ending of the height: and generating an aggregate consensus transaction according to the second parallel chain block and sending the aggregate consensus transaction to the main chain, so that the leader node is clear, the handling cost is saved, and the parallel chain consensus is kept simple and stable.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the detailed description of non-limiting embodiments, made with reference to the accompanying drawings in which:
fig. 1 is a flowchart of a node selection and transaction transmission method according to an embodiment of the present application.
Fig. 2 is a schematic structural diagram of an apparatus according to an embodiment of the present application.
Detailed Description
The application is described in further detail below with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the application and are not limiting of the application. It should be noted that, for convenience of description, only the portions related to the application are shown in the drawings.
It should be noted that, without conflict, the embodiments of the present application and features of the embodiments may be combined with each other. The application will be described in detail below with reference to the drawings in connection with embodiments.
Fig. 1 is a flowchart of a node selection and transaction transmission method according to an embodiment of the present application. As shown in fig. 1, in this embodiment, the present application provides a node selection and transaction transmission method applicable to parallel link nodes, where the method includes:
s11: when the parallel chain block height of the current parallel chain reaches the first parallel chain block height of the rotatable leader node, the following operation is performed on each first parallel chain block of the first parallel chain block height section taking the first parallel chain block height as a starting height and taking the sum of the first parallel chain block height and the second value as an ending height:
generating a first consensus transaction for the first parallel chain block and transmitting the first consensus transaction to the backbone for the backbone node:
consensus is carried out on the first parallel chain block according to the first consensus transaction and a plurality of second consensus transactions; wherein the second consensus transaction is a consensus transaction of the first parallel chain block generated by other parallel chain link points of the current parallel chain;
when the fact that the first parallel chain blocks are high in consensus success is monitored, selecting a first parallel chain node for sending a first consensus transaction which contributes to the success of the consensus as a first leader node;
s13: acquiring node information selected as a first leader node from a main chain;
the first leader node is configured to perform the following operations on the plurality of second parallel chain blocks after the ending of the height: and generating an aggregate consensus transaction according to the second parallel chain blocks and sending the aggregate consensus transaction to the main chain so that the main chain node can perform consensus on a plurality of second parallel chain blocks according to the aggregate consensus transaction.
Specifically, when the parallel chain block height of the current parallel chain reaches the first parallel chain block height of the rotatable leader node, the following operations are performed on each first parallel chain block in the first parallel chain block height section, which takes the first parallel chain block height as a starting height and takes the sum of the first parallel chain block height and the second value as an ending height, including "whether the remainder of the first selected interval information of the current parallel chain registration and the parallel chain block height is 1: if so, performing the following operation on each first parallel chain block in a first parallel chain block height section with the first parallel chain block height as a starting height and the sum of the first parallel chain block height and the second value as an ending height; wherein the second parallel chain blocks are parallel chain blocks of ending height plus one to the first parallel chain block height plus the first selection interval information minus one; and the first leader node is used for executing the following operations on the second parallel chain blocks after the height is finished: generating an aggregate consensus transaction according to the second parallel chain blocks and sending the aggregate consensus transaction to the main chain, wherein the main chain node performs consensus on a plurality of second parallel chain blocks according to the aggregate consensus transaction, and the aggregate consensus transaction comprises the following operations of a first leader node for executing the following operations on each second parallel chain block respectively: generating a third consensus transaction for the second parallel chain block; receiving a fourth consensus transaction generated by removing a number of other parallel chain nodes of the first leader node; wherein the fourth consensus transaction is a consensus transaction of a second parallel chain block generated excluding other parallel chain link points of the first leader node; generating a first aggregate consensus transaction of the second parallel chain block according to the third aggregate transaction and each fourth aggregate transaction aggregate, and sending the first aggregate consensus transaction to the main chain, so that the main chain node carries out consensus' for the second parallel chain block according to the first aggregate consensus transaction for example;
assuming that parallel chain nodes n 1-n 10 are arranged on the paramchain 1, wherein the second numerical value is 4, and the selection interval information of the paramchain 1 registered in the main chain is 1000; and assume that the first parallel chain block height is 2001;
n1 to n10 perform step S11 to determine whether the remainder of 2001 and 1000 is 1:
with 1, n1 performs the following operations on blocks (2001_pc1_n1) to (2005_pc1_n1) and n2 performs the following operations on blocks (2001_pc1_n5) to (2005_pc1_n5) and (… … n 5) respectively:
taking n1 pair block (2001_pc1_n1) as an example;
n1 generates a consensus transaction tx (201_n1) according to block (2001_pc1_n1) and sends the consensus transaction tx to the main chain;
similarly, n2 generates tx (2001_n2), n3 generates tx (2001_n2) … … n10 generates tx (2001_n10) and transmits to the main chain;
assuming that consensus transactions generated from parallel chain blocks of parallel chain block height 2002 are tx (2002_n1) to tx (2002_n10), respectively, consensus transactions generated from parallel chain blocks of parallel chain block height 2003 are tx (2003_n1) to tx (2003_n10) … …, respectively, and consensus transactions generated from parallel chain blocks of parallel chain block height 2005 are tx (2005_n1) to tx (2005_n10), respectively; and assuming that the common information in tx (2001_n1) to tx (2001_n10) is the same, the common information in tx (2002_n1) to tx (2002_n10) is the same as that in … … tx (2005_n1) to tx (2005_n10);
and the packing order of tx (2001_n1) to tx (2005_n10) is tx (2001_n1), tx (2001_n2), …, tx (2005_n9), tx (2005_n10);
since the consensus information in tx (2001_n1) to tx (2001_n10) is the same, the consensus information in tx (2002_n1) to tx (2002_n10) is the same and … … tx (2005_n1) to tx (2005_n10) is the same, and then 2001 to 2005 are the same, the main chain node determines n1 as the leading node of the parallel chain block with the parallel chain block height of 2006 to 3000;
n1 to n10 execute step S13 to acquire, from the main chain, information of the leader node of the parallel chain block selected as the parallel chain block having the parallel chain block height of 2006 to 3000 from n1;
for parallel chain blocks with parallel chain block heights of 2006-3000:
taking the example of parallel chain blocks with a parallel chain block height of 2999:
n1 generates a consensus transaction tx (2999_n1) from the block (2999_pc1_n1); similarly, n2 generates a consensus transaction tx (2999_pc1_n2) according to the block (2999_pc1_n2), and … … n10 generates a consensus transaction tx (2999_n10) according to the block (2999_pc1_n10);
n1 receives tx (2999_n2) to tx (2999_n10) generated by n2 to n10 respectively;
n1 generates 2999 aggregate consensus transactions from tx (2999_n1) to tx (2999_n10);
n1 transmits the aggregate consensus transaction to the backbone;
the backbone node shares parallel chain blocks having a parallel chain block height of 2999 in accordance with the aggregate consensus transaction.
In further embodiments, the above method may be accomplished by only consensus nodes n 1-n 4, provided that the parallel chains are configured with consensus nodes n 1-n 4 and non-consensus nodes n 5-n 10.
In more embodiments, step S11 may be configured according to actual requirements, for example, configured to: judging whether the remainder of the first selection interval information of the parallel chain block height and the current parallel chain registration is 0: if so, performing the following operation on each first parallel chain block in a first parallel chain block height section with the first parallel chain block height as a starting height and the sum of the first parallel chain block height and the second value as an ending height; wherein the plurality of second parallel chain blocks are parallel chain blocks from the end height plus one to the first parallel chain block height plus the first selection interval information minus one; the same technical effects can be achieved.
In more embodiments, the first leader node may not be the third consensus transaction, the first consensus information msg (2999_n1) may be generated according to the actual requirement, and similarly, n2 to n10 are respectively generated as the second consensus information msg (2999_n2) to msg (2999_n10), and n1 generates the aggregate consensus transaction with the parallel chain block height 2999 according to msg (2999_n1) to msg (2999_n10), so that the same technical effect may be achieved.
In further embodiments, if n1 finds that tx (2001_n1) is generated, then n1 no longer sends tx (2001_n1) to the backbone to save the commission of n1 after the parallel chain block height has increased to 2005.
In further embodiments, even after the parallel chain block height grows to 2005, the parallel chain node may still send a consensus transaction, in particular (in the case of n 1), if n1 finds that the consensus transaction between 2001-2005 received on the backbone is insufficient to facilitate the consensus of 2001 of paramchain 1, n1 still sends tx (2001_n1) to the backbone to further facilitate the consensus of 2001 of paramchain 1; at this time, the main chain node may be configured according to actual requirements, and after facilitating the consensus of 2001 of paramchain 1, some rewards are also sent to n 1. However, after the successful election, assuming that n1 is determined as the lead node of 2006-3000, the main chain does not assign rewards to the other parallel link points after receiving the consensus transaction of the corresponding height generated according to 2006-2999 transmitted by the other parallel link nodes or the aggregate consensus transaction.
It will be appreciated by those skilled in the art that after the parallel link points generate a consensus transaction, for network reasons, the packing order recorded on the backbone is not directly related to the actual parallel link points before and after the generation of the consensus transaction, for example, in this embodiment, the packing order of tx (2001_n1) to tx (2005_n10) may be tx (2002_n1), tx (2003_n3), tx (2001_n1), … …; then node n1 contributing to the first transaction (i.e., tx (2002_n1)) in which all 201-205 were successful is determined to be the leader node as long as all last 201-205 were successful.
The embodiment ensures that the leader node is clear, saves the commission and keeps the parallel chain consensus simple and stable.
Preferably, determining the first parallel chain node that sent the first consensus transaction contributing to the success of the consensus as the first leader node comprises:
determining whether the first parallel chain node is a parallel chain node that generated a second aggregate consensus transaction:
if so, determining a second parallel link node as the first leader node when the second parallel link node that will send a second consensus transaction that will cause the success of the consensus is not the first parallel link node;
wherein the second aggregate consensus transaction is an aggregate consensus transaction of the first parallel chain block height minus the block height of one.
The same node can be configured to not be cicada connected when competing to become a leading node; for example, if the leader node of 1006-2000 is n1, then the leader node of 2006-3000 is also n1, then a second parallel link node that sent a second consensus transaction that contributed to the success of the consensus (the second parallel link node cannot be the same node as n1, e.g., the second parallel link node is n 2) may be determined to be the leader node of 2006-3000.
Assume a third parallel chain block height = second parallel chain block height +20;
assuming that the block height of the second parallel chain block is 2010, n 1-n 10 generate tx (2010_n1) to tx (2010_n10), respectively;
then other nodes may re-compete the leader node if there is no n1 generated aggregate consensus transaction of 2001 on the backbone before the parallel chain block height goes to 2030.
If more nodes in n 2-n 10 are not smooth, n1 cannot timely receive the consensus transaction generated by n 2-n 10, and n1 cannot generate an aggregate consensus transaction and send the aggregate consensus transaction to a main chain; in this case, other consensus nodes may initiate an election transaction instead of n1;
the problem caused by the first scenario described above can be solved by the method of the following embodiments;
preferably, the first leader node is further configured to:
generating an incomplete first aggregate consensus transaction for a second parallel chain block height;
transmitting the incomplete first aggregate consensus transaction to the backbone for the backbone node to document the incomplete first aggregate consensus transaction;
before reaching the height of the fourth main chain block, if enough fourth consensus transactions which are enough to promote the success of the second parallel chain block high consensus are collected, generating complete first aggregate consensus transactions according to the third consensus transactions and the aggregation of the fourth consensus transactions, and sending the complete first aggregate consensus transactions to the main chain; wherein the complete first aggregate consensus transaction comprises a hash value of the incomplete first aggregate consensus transaction, and the fourth backbone block height is less than the third backbone block height.
The triggering condition of the "generating the incomplete first aggregate consensus transaction of the second parallel chain block height" may be configured according to actual requirements, for example, configured to generate (in any case) the incomplete first aggregate consensus transaction of the second parallel chain block height; or, if the fourth consensus transaction which is enough to promote the successful second main chain block high consensus is not collected in the first time period, generating the incomplete first aggregate consensus transaction with the second parallel chain block high, and realizing the same technical effect.
The embodiment allows the leader node to timely send incomplete aggregate consensus transactions, and allows the leader node to communicate with other parallel chain nodes as soon as possible within a certain height interval to acquire corresponding consensus transactions so as to generate complete aggregate consensus transactions as soon as possible.
Further preferably, if sufficient fourth consensus transactions are collected to facilitate a high degree of success of the second parallel chain block, aggregating each fourth consensus transaction based on the third consensus transaction to generate a complete first aggregate consensus transaction comprises:
if fourth consensus transactions sufficient to promote the high success of the second parallel chain block are collected, generating a complete first aggregate consensus transaction according to the third consensus transaction and each fourth consensus transaction aggregate and transmitting the complete first aggregate consensus transaction to the main chain for the main chain node:
when a complete first aggregate consensus transaction is received, judging whether the incomplete first aggregate consensus transaction exists on the main chain according to the hash value of the incomplete first aggregate consensus transaction:
if so, placing the complete first aggregate consensus transaction into an aggregate consensus transaction queue of a memory pool; wherein transactions in the aggregate consensus transaction queue are to be preferentially packed.
The above embodiment ensures that the complete first aggregate consensus transaction is packaged as soon as possible.
Fig. 2 is a schematic structural diagram of an apparatus according to an embodiment of the present application.
As shown in fig. 2, as another aspect, the present application also provides an apparatus 200 including one or more Central Processing Units (CPUs) 201, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 202 or a program loaded from a storage portion 208 into a Random Access Memory (RAM) 203. In the RAM203, various programs and data required for the operation of the apparatus 200 are also stored. The CPU201, ROM202, and RAM203 are connected to each other through a bus 204. An input/output (I/O) interface 205 is also connected to bus 204.
The following components are connected to the I/O interface 205: an input section 206 including a keyboard, a mouse, and the like; an output portion 207 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker, and the like; a storage section 208 including a hard disk or the like; and a communication section 209 including a network interface card such as a LAN card, a modem, and the like. The communication section 209 performs communication processing via a network such as the internet. The drive 210 is also connected to the I/O interface 205 as needed. A removable medium 211 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is installed on the drive 210 as needed, so that a computer program read out therefrom is installed into the storage section 208 as needed.
In particular, according to embodiments of the present disclosure, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing any of the methods described above. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 209, and/or installed from the removable medium 211.
As still another aspect, the present application also provides a computer-readable storage medium, which may be a computer-readable storage medium contained in the apparatus of the above-described embodiment; or may be a computer-readable storage medium, alone, that is not assembled into a device. The computer-readable storage medium stores one or more programs for use by one or more processors to perform the methods described herein.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules involved in the embodiments of the present application may be implemented in software or in hardware. The described units or modules may also be provided in a processor, for example, each of the units may be a software program provided in a computer or a mobile smart device, or may be separately configured hardware devices. Wherein the names of the units or modules do not in some cases constitute a limitation of the units or modules themselves.
The above description is only illustrative of the preferred embodiments of the present application and of the principles of the technology employed. It will be appreciated by persons skilled in the art that the scope of the application referred to in the present application is not limited to the specific combinations of the technical features described above, but also covers other technical features formed by any combination of the technical features described above or their equivalents without departing from the spirit of the application. Such as the above-mentioned features and the technical features disclosed in the present application (but not limited to) having similar functions are replaced with each other.
Claims (6)
1. A method of node selection and transaction transmission, the method being applicable to parallel chain nodes, the method comprising:
when the parallel chain block height of the current parallel chain reaches the first parallel chain block height of the rotatable leader node, executing the following operation on each first parallel chain block in a first parallel chain block height section taking the first parallel chain block height as a starting height and taking the sum of the first parallel chain block height and a second value as an ending height:
generating a first consensus transaction for the first parallel chain block and sending the first consensus transaction to a backbone for a backbone node:
consensus is carried out on the first parallel chain block according to the first consensus transaction and a plurality of second consensus transactions; wherein the second consensus transaction is a consensus transaction of the first parallel chain block generated by other parallel chain link points of the current parallel chain;
when the fact that the first parallel chain blocks are high in consensus success is monitored, selecting a first parallel chain node for sending a first consensus transaction which facilitates the consensus success as a first leader node;
acquiring node information selected as the first leader node from a main chain;
the first leader node is configured to perform the following operations on the second parallel chain blocks after the ending height: and generating an aggregate consensus transaction according to the second parallel chain blocks and sending the aggregate consensus transaction to a main chain so that a main chain node can perform consensus on the plurality of second parallel chain blocks according to the aggregate consensus transaction.
2. The method of claim 1, wherein each parallel chain has a selected interval information registered with the main chain, and wherein when the parallel chain block height of the current parallel chain is monitored to reach the first parallel chain block height of the rotatable leader node, performing the following operation on each first parallel chain block of the first parallel chain block height section with the first parallel chain block height as a starting height and the sum of the first parallel chain block height and the second value as an ending height comprises:
judging whether the remainder of the first selection interval information of the parallel chain block height and the current parallel chain registration is 1:
if so, performing the following operation on each first parallel chain block in a first parallel chain block height section with the first parallel chain block height as a starting height and the sum of the first parallel chain block height and a second value as an ending height;
the first parallel chain block height is equal to the end height plus one, and the second parallel chain block height is equal to the end height plus one, and the first selection interval information is equal to the end height plus one.
3. The method of claim 2, wherein the first leader node is configured to perform the following operations on the second parallel chain blocks after the ending altitude: generating an aggregate consensus transaction according to the second parallel chain blocks and sending the aggregate consensus transaction to a main chain for a main chain node to consensus the plurality of second parallel chain blocks according to the aggregate consensus transaction comprises:
the first leader node is configured to perform the following operations on each of the second parallel chain blocks:
generating a third consensus transaction for the second parallel chain block;
receiving a fourth consensus transaction generated by removing a number of other parallel chain nodes of the first leader node; wherein the fourth consensus transaction is a consensus transaction of the second parallel chain block generated by excluding other parallel chain nodes of the first leader node;
and generating a first aggregate consensus transaction of the second parallel chain block according to the third aggregate transaction and each fourth aggregate transaction aggregate, and transmitting the first aggregate consensus transaction to a main chain so that a main chain node can perform consensus on the second parallel chain block according to the first aggregate consensus transaction.
4. The method of claim 2, wherein determining a first parallel chain node that sent a first consensus transaction that contributed to the success of the consensus as a first leader node comprises:
determining whether the first parallel chain node is a parallel chain node that generates a second aggregate consensus transaction:
if so, determining a second parallel link node that will send a second consensus transaction that will facilitate the success of the consensus as a first leader node when the second parallel link node is not the first parallel link node;
wherein the second aggregate consensus transaction is an aggregate consensus transaction of the first parallel chain block height minus a block height.
5. A computer device, the device comprising:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-4.
6. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210204834.9A CN114827167B (en) | 2022-03-03 | 2022-03-03 | Node selection and transaction transmission method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210204834.9A CN114827167B (en) | 2022-03-03 | 2022-03-03 | Node selection and transaction transmission method, device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114827167A CN114827167A (en) | 2022-07-29 |
| CN114827167B true CN114827167B (en) | 2023-10-17 |
Family
ID=82529684
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210204834.9A Active CN114827167B (en) | 2022-03-03 | 2022-03-03 | Node selection and transaction transmission method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114827167B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108182635A (en) * | 2017-12-18 | 2018-06-19 | 深圳前海微众银行股份有限公司 | Block chain common recognition method, system and computer readable storage medium |
| CN110866826A (en) * | 2018-08-28 | 2020-03-06 | 傲为信息技术(江苏)有限公司 | Transaction method based on parallel chain and block chain system |
| CN111242780A (en) * | 2020-01-12 | 2020-06-05 | 杭州复杂美科技有限公司 | Method, device and storage medium for sending consensus transaction |
| CN111798238A (en) * | 2020-07-03 | 2020-10-20 | 杭州复杂美科技有限公司 | Parallel chain consensus method, device and storage medium |
| CA3141042A1 (en) * | 2019-06-13 | 2020-12-17 | Luis Eduardo Gutierrez-Sheris | System and method using a fitness-gradient blockchain consensus and providing advanced distributed ledger capabilities via specialized data records |
| CN112819625A (en) * | 2021-02-01 | 2021-05-18 | 杭州复杂美科技有限公司 | Parallel chain arbitration consensus method, computer device and storage medium |
| CN112839091A (en) * | 2021-01-11 | 2021-05-25 | 杭州复杂美科技有限公司 | Block generation method, computer device and storage medium |
| WO2021139534A1 (en) * | 2020-01-12 | 2021-07-15 | 江苏复杂美科技有限公司 | Segment-based consensus method, apparatus, and storage medium |
| CN113572825A (en) * | 2021-07-09 | 2021-10-29 | 中国科学院计算技术研究所 | Access control and resource access control method and system for relay chain cross-link architecture |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111522648B (en) * | 2020-07-03 | 2020-10-09 | 支付宝(杭州)信息技术有限公司 | Transaction processing method and device for block chain and electronic equipment |
-
2022
- 2022-03-03 CN CN202210204834.9A patent/CN114827167B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108182635A (en) * | 2017-12-18 | 2018-06-19 | 深圳前海微众银行股份有限公司 | Block chain common recognition method, system and computer readable storage medium |
| CN110866826A (en) * | 2018-08-28 | 2020-03-06 | 傲为信息技术(江苏)有限公司 | Transaction method based on parallel chain and block chain system |
| CA3141042A1 (en) * | 2019-06-13 | 2020-12-17 | Luis Eduardo Gutierrez-Sheris | System and method using a fitness-gradient blockchain consensus and providing advanced distributed ledger capabilities via specialized data records |
| CN111242780A (en) * | 2020-01-12 | 2020-06-05 | 杭州复杂美科技有限公司 | Method, device and storage medium for sending consensus transaction |
| WO2021139534A1 (en) * | 2020-01-12 | 2021-07-15 | 江苏复杂美科技有限公司 | Segment-based consensus method, apparatus, and storage medium |
| CN111798238A (en) * | 2020-07-03 | 2020-10-20 | 杭州复杂美科技有限公司 | Parallel chain consensus method, device and storage medium |
| CN112839091A (en) * | 2021-01-11 | 2021-05-25 | 杭州复杂美科技有限公司 | Block generation method, computer device and storage medium |
| CN112819625A (en) * | 2021-02-01 | 2021-05-18 | 杭州复杂美科技有限公司 | Parallel chain arbitration consensus method, computer device and storage medium |
| CN113572825A (en) * | 2021-07-09 | 2021-10-29 | 中国科学院计算技术研究所 | Access control and resource access control method and system for relay chain cross-link architecture |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114827167A (en) | 2022-07-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110852882B (en) | Packet consensus method, apparatus, device, and medium for blockchain networks | |
| CN111798316B (en) | Parallel chain consensus method, apparatus and storage medium | |
| CN110287196B (en) | Block storage method, parallel chain transaction acquisition method, equipment and storage medium | |
| CN112583585B (en) | Transaction execution method, apparatus and storage medium | |
| US11734077B2 (en) | Evaluation device, evaluation method and evaluation program | |
| US11102320B2 (en) | Post-delivery dynamic control of notifications in a push notification life-cycle | |
| CN111008249B (en) | Parallel chain block synchronization method, device and storage medium | |
| CN112131013A (en) | Monitoring method, device, equipment and storage medium of call chain in distributed system | |
| CN109995787A (en) | A kind of data processing method and relevant device | |
| CN109861922B (en) | Method and apparatus for controlling flow | |
| CN110928952A (en) | Data synchronization method and device based on block chain | |
| CN114827167B (en) | Node selection and transaction transmission method, device and storage medium | |
| CN112711624A (en) | Data packaging control method and device, electronic equipment and storage medium | |
| CN112053154B (en) | Transaction broadcasting method, apparatus and storage medium | |
| CN110740138A (en) | Data transmission method and device | |
| US10250515B2 (en) | Method and device for forwarding data messages | |
| CN112346661B (en) | Data processing method and device and electronic equipment | |
| CN112819625B (en) | Parallel chain arbitration consensus method, computer device, and storage medium | |
| US20230068467A1 (en) | Monitoring system, monitoring method, agent program and manager program | |
| CN114493876A (en) | Transaction sending method, computer device and storage medium | |
| CN107707383B (en) | Put-through processing method and device, first network element and second network element | |
| CN113498040B (en) | Method and device for stopping sending scheduling request | |
| CN115333675B (en) | Message sending method and device, electronic equipment and storage medium | |
| CN108089823B (en) | Information output method and device for storage system | |
| CN111314189B (en) | Service message sending method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |