CN110210972B - Method, device and storage medium for sending consensus transaction - Google Patents
Method, device and storage medium for sending consensus transaction Download PDFInfo
- Publication number
- CN110210972B CN110210972B CN201910470244.9A CN201910470244A CN110210972B CN 110210972 B CN110210972 B CN 110210972B CN 201910470244 A CN201910470244 A CN 201910470244A CN 110210972 B CN110210972 B CN 110210972B
- Authority
- CN
- China
- Prior art keywords
- height
- consensus
- node
- transaction
- consensus transaction
- 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
Images
Classifications
-
- 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
Abstract
The invention provides a consensus transaction sending method, a device and a storage medium, which are suitable for consensus nodes of parallel chains, wherein the first height is the height of a parallel chain block of a consensus transaction or a consensus transaction group which is successfully packed and executed by a main chain, and the second height is the consensus height of the parallel chains, the method comprises the following steps: judging whether the first height of the current node is greater than the second height: if yes, the method of sending the consensus transaction or the consensus transaction group to the main chain node is stopped until the first height of the current node is equal to the second height, the consensus transaction or the consensus transaction group is not sent under the condition that the first height and the second height are synchronous, and the expenditure of commission fees is reduced.
Description
Technical Field
The application relates to the technical field of block chains, in particular to a method, equipment and a storage medium for sending a consensus transaction.
Background
The consensus nodes of the parallel chains need to send consensus transactions to the main chain for packaging and consensus, and the consensus transactions also need to spend commission charge; for example, the parallel chain consensus node m sends the consensus transaction tx100 of the parallel chain block with the block height of 100 to the main chain node, and before tx100 is packed by the main chain node but is not yet identified, the node m continues to send the consensus transaction tx101 of the parallel chain block with the block height of 101 to the main chain node, which causes the waste of commission fees; for another example, the parallel chain consensus node n is a consensus node newly added into the parallel chain, and since the consensus height of the parallel chain reaches 100, if the node n continues to send tx 1-tx 100 to the main chain, the commission fee is wasted;
for another example, in the existing block chain technology, as long as a parallel chain consensus node generates a consensus transaction, the consensus transaction is sent to a main chain node, in order to improve the consensus efficiency of the consensus transaction, multiple transactions are packed into a transaction group and then sent to the main chain, and in this scenario, if different main chain nodes are branched and roll back, the parallel chain link point rolls back along with the main chain, which may cause part of the consensus transaction to be missed, resulting in the consequence of consensus stopping.
Disclosure of Invention
In view of the above-mentioned drawbacks and deficiencies of the prior art, it is desirable to provide a consensus transaction transmitting method, apparatus and storage medium that are non-disruptive and save commission fees.
In a first aspect, the present invention provides a consensus transaction sending method, adapted to a consensus node of a parallel chain, where a first height is a parallel chain block height of a consensus transaction or a consensus transaction group successfully packed and executed by a main chain, and a second height is a consensus height of the parallel chain, the method including:
judging whether the first height of the current node is greater than the second height:
if so, sending the consensus transaction or the group of consensus transactions to the master node is suspended until the first height of the current node is equal to the second height.
In a second aspect, the present invention also provides an apparatus comprising one or more processors and memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform a method of consensus transaction transmission provided according to embodiments of the present invention.
In a third aspect, the present invention also provides a storage medium storing a computer program for causing a computer to execute the consensus transaction transmitting method according to the embodiments of the present invention.
The method, the device and the storage medium for sending the consensus transaction provided by the embodiments of the present invention determine whether the first height of the current node is greater than the second height: if yes, the method of sending the consensus transaction or the consensus transaction group to the main chain node is stopped until the first height of the current node is equal to the second height, the consensus transaction or the consensus transaction group is not sent under the condition that the first height and the second height are synchronous, and the expenditure of commission fees is reduced.
The consensus transaction sending method, device, and storage medium provided by some embodiments of the present invention further determine whether a third height of the current node is greater than the second height by responding to a rollback of the current node: if so, the third height is configured to be the method of adding one to the second height, so that after rollback, the consensus transaction is sent from the consensus height closest to the bifurcation height, and the consensus transaction is ensured not to be missed.
Some embodiments of the present invention provide a method, an apparatus, and a storage medium for consensus transaction, further comprising determining whether the third height is less than the second height: if yes, the sending of the consensus transaction or the consensus transaction group to the main chain node is stopped, and the third height is configured to be the second height plus one, so that the consensus node newly added into the parallel chain does not repeatedly send the consensus transaction to the main chain node, and the expenditure of the commission charge is reduced.
Some embodiments of the present invention provide a method, apparatus and storage medium for consensus transaction, further comprising determining whether the third height is greater than the second height plus one: if so, stopping sending the consensus transaction or the consensus transaction group to the main chain node, and configuring the third height as the second height plus one, so that the common consensus transaction which is already known is not repeatedly sent to the main chain node when the parallel chain common consensus node is down to reconnect the main chain, thereby reducing the expenditure of commission fees.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a flowchart of a method for sending a consensus transaction according to an embodiment of the present invention.
FIG. 2 is a flow diagram of a preferred embodiment of the method shown in FIG. 1.
FIG. 3 is a flow diagram of a preferred embodiment of the method shown in FIG. 1.
FIG. 4 is a flow diagram of a preferred embodiment of the method shown in FIG. 1.
Fig. 5 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 is a flowchart of a method for sending a consensus transaction according to an embodiment of the present invention. As shown in fig. 1, in the present embodiment, the invention provides a method for sending a consensus transaction, where a first height (H1) is a parallel chain block height of a consensus transaction or a group of consensus transactions successfully packed and executed by a main chain, and a second height (H2) is a consensus height of parallel chains, the method includes:
s12: judging whether the first height of the current node is greater than the second height:
if yes, go to step S14: sending the consensus transaction or the group of consensus transactions to the master node is aborted until the first elevation of the current node equals the second elevation.
Assuming a first application scenario, the first application scenario is as follows:
the consensus node of the parallel chain needs to send a consensus transaction to the main chain for packaging and consensus, the consensus transaction also needs to spend commission charge, and the current parallel chain consensus node is assumed to be a node a, and the main chain node corresponding to the node a is assumed to be a node A; before the node a sends the common transaction tx30 of the parallel chain block with the block height of 30 to the main chain node, and tx30 is packaged by the main chain node and is not identified yet, the node a continues to send the common transaction tx31 of the parallel chain block with the block height of 31 to the node A, so that the commission fee is wasted;
the problem generated by the first application scenario can be solved through steps S12 and S14;
in step S12, the node a determines whether H1 is greater than H2:
since H1 is 31 and H2 is 30, step S14 is performed: node a aborts sending the consensus transaction or group of consensus transactions to node a until node a's H1 equals H2 equals 31.
The above-mentioned embodiment ensures that the first and second heights are synchronized to send the consensus transaction or the group of consensus transactions, thereby reducing the expenditure of commission fees.
FIG. 2 is a flow diagram of a preferred embodiment of the method shown in FIG. 1. As shown in fig. 2, in a preferred embodiment, the third height (H3) is a parallel chain block height of the consensus transaction to be sent or a minimum parallel chain block height of the consensus transaction group to be sent, and the method further comprises:
s22: responding to the rollback of the current node, and judging whether the third height of the current node is greater than the second height:
if yes, go to step S24: the third height is configured to be the second height plus one.
Assuming a second application scenario, the second application scenario is as follows:
the main chain node branches and rolls back, so that the parallel chain link points roll back. When the main chain node rolls back, all original data are erased, and a parallel chain block corresponding to the block (main _60) is assumed to be block (flat _45), and a parallel chain block corresponding to the block (main _50) is assumed to be block (flat _ 42); after rollback, H2 recorded on the main chain node is 40;
according to the transaction group transmission method in the prior art, transmission should be started from a consensus transaction with a parallel chain block height of 43, i.e., in the prior art, H3 is configured as 43; however, since the recorded H2 on the main chain node is 40 after rolling back, it should be sent from the consensus transaction with the parallel chain block height of 41, i.e. in this solution, H3 is configured as 41; if the transaction group sending method in the prior art is adopted, the common transaction with the height of the parallel chain block of 41 and the height of the parallel chain block of 42 is finally missed in the main chain.
The problem generated by the second application scenario can be solved through steps S22 and S24; assuming that the current parallel chain consensus node is a node b;
in step S22, the node b responds to the rollback of the current node, and determines whether the H3 of the node b is larger than H2:
since H3 of node b is 42, H2 is 40, and H3 is greater than H2, step S24 is executed, and node b configures H3 to be H2+1 equal to 41.
The embodiment enables the consensus transaction to be sent from the consensus height closest to the bifurcation height after rollback, and ensures that the consensus transaction is not missed.
FIG. 3 is a flow diagram of a preferred embodiment of the method shown in FIG. 1. As shown in fig. 3, in a preferred embodiment, the third height (H3) is a parallel chain block height of the consensus transaction to be sent or a minimum parallel chain block height of the consensus transaction group to be sent, and the method further comprises:
s32: judging whether the third height is smaller than the second height:
if yes, go to step S34: the sending of the consensus transaction or the group of consensus transactions to the backbone node is aborted and the third height is configured as the second height plus one.
Assuming a third application scenario, the third application scenario is as follows:
the node C is a consensus node newly added into the parallel chain, and a main chain node corresponding to the node C is the node C; h3 for node c is now 0; the main chain records the consensus height of the parallel chain, the consensus height of the parallel chain is 50, which indicates that other consensus nodes in the parallel chain have sent a plurality of consensus transactions or consensus transaction groups to the main chain node, and the consensus transactions or consensus transaction groups have agreed, and if the node C sends the consensus transactions tx 1-tx 50 to the node C, the commission charge is wasted.
The problem generated by the third application scenario can be solved through steps S32 and S34;
in step S32, the node c determines whether H3 is smaller than H2 in response to the current node starting the parallel chain service for the first time:
since H3 is 0 and less than H2 is 50, step S34 is executed, and node C suspends sending the consensus transaction or group of consensus transactions to node C, configuring H3 to be H2+1 equal to 51.
The embodiment enables the consensus node newly added into the parallel chain not to repeatedly send the consensus transaction which is already known to the main chain node, and reduces the expenditure of commission charge.
FIG. 4 is a flow diagram of a preferred embodiment of the method shown in FIG. 1. As shown in fig. 4, in a preferred embodiment, the third height (H3) is a parallel chain block height of the consensus transaction to be sent or a minimum parallel chain block height of the consensus transaction group to be sent, and the method further comprises:
s42: determining whether the third height is greater than the sum of the second height plus one:
if yes, go to step S44: the sending of the consensus transaction or the group of consensus transactions to the backbone node is aborted and the third height is configured as the second height plus one.
Assuming a fourth application scenario, the fourth application scenario is as follows:
assuming that a current parallel chain consensus node is a node D, and a main chain node corresponding to the node D is a node D; before node d is down, H2 is 60; when the node D crashes to reconnect the main chain, H2 on the node D is found to be updated to 63, H3 of the node D should be configured to 64, and at the moment, if the node D sends the commonly recognized transactions tx61 to tx63 to the node D, the commission charge is wasted.
The problem generated by the fourth application scenario can be solved through steps S42 and S44;
in step S42, the node d, in response to the current node restarting the parallel chain service, determines whether H3 is greater than H2+ 1:
since H3 of node D is 64 and H2+1 is 61, step S44 is executed, node D suspends sending consensus transaction or group of consensus transactions to node D, and configures H3 such that H2+1 equals 64.
The embodiment ensures that the common consensus transaction which is already known is not repeatedly sent to the main chain node when the parallel chain common consensus node is down to reconnect the main chain, thereby reducing the expenditure of the commission charge.
In further embodiments, the various proposed scenarios for the problem generated by the first application scenario, the problem generated by the second application scenario, the problem generated by the third application scenario, and the problem generated by the fourth application scenario may be combined in any way.
In a preferred embodiment, the method further comprises:
sending first request information for acquiring a first height to a main chain node to acquire the first height;
and sending second request information for acquiring the second height to the main chain node to acquire the second height.
In further embodiments, the same technical effect can be achieved by traversing the data recorded in the main chain block to obtain the first height and the second height.
Fig. 5 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 5, as another aspect, the present application also provides an apparatus 500 including one or more Central Processing Units (CPUs) 501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM503, various programs and data necessary for the operation of the apparatus 500 are also stored. The CPU501, ROM502, and RAM503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
In particular, according to an embodiment of the present disclosure, the consensus transaction sending 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 containing program code for performing a method of consensus transaction transmission. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the consensus transaction sending method described herein.
The flowchart 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 invention. 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 described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, for example, each of the described units may be a software program provided in a computer or a mobile intelligent device, or may be a separately configured hardware device. Wherein the designation of a unit or module does not in some way constitute a limitation of the unit or module itself.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the present application. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (8)
1. A method for sending consensus transaction, wherein the method is applied to consensus nodes of parallel chains, a first height is a parallel chain block height of a consensus transaction or a group of consensus transactions successfully packed and executed by a main chain, and a second height is a consensus height of the parallel chains, the method comprising:
judging whether the first height of the current node is greater than the second height:
if yes, sending the consensus transaction or the group of consensus transactions to the main chain node is stopped until the first height of the current node is equal to the second height.
2. The method of claim 1, wherein the third height is a parallel chain block height of the consensus transaction to be sent or a minimum parallel chain block height of the consensus transaction group to be sent, the method further comprising:
responding to the rollback of the current node, and judging whether the third height of the current node is greater than the second height:
if so, the third height is configured to be the second height plus one.
3. The method of claim 1, wherein the third height is a parallel chain block height of the consensus transaction to be sent or a minimum parallel chain block height of the consensus transaction group to be sent, the method further comprising:
responding to the initial starting of the parallel chain service of the current node, and judging whether the third height is smaller than the second height:
if yes, the sending of the consensus transaction or the group of consensus transactions to the main chain node is stopped, and the third height is configured to be the second height plus one.
4. The method of claim 1, wherein the third height is a parallel chain block height of the consensus transaction to be sent or a minimum parallel chain block height of the consensus transaction group to be sent, the method further comprising:
in response to the current node restarting parallel chain service, determining whether the third height is greater than the sum of the second height plus one:
if yes, the sending of the consensus transaction or the group of consensus transactions to the main chain node is stopped, and the third height is configured to be the second height plus one.
5. The method according to any one of claims 1-4, further comprising:
sending first request information for acquiring the first height to the main chain node to acquire the first height;
and sending second request information for acquiring the second height to the main chain node to acquire the second height.
6. The method of claim 5, wherein the consensus transaction set comprises a plurality of consensus transactions, each consensus transaction comprising a block height of a corresponding parallel chain block, a block hash of a corresponding parallel chain block, a block height of a main chain block corresponding to a corresponding parallel chain block, and a block hash of a main chain block corresponding to a corresponding parallel chain block.
7. 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 recited in any of claims 1-6.
8. 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-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910470244.9A CN110210972B (en) | 2019-05-31 | 2019-05-31 | Method, device and storage medium for sending consensus transaction |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910470244.9A CN110210972B (en) | 2019-05-31 | 2019-05-31 | Method, device and storage medium for sending consensus transaction |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110210972A CN110210972A (en) | 2019-09-06 |
| CN110210972B true CN110210972B (en) | 2021-04-13 |
Family
ID=67789904
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910470244.9A Active CN110210972B (en) | 2019-05-31 | 2019-05-31 | Method, device and storage medium for sending consensus transaction |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110210972B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111275437B (en) * | 2020-01-12 | 2023-05-30 | 杭州复杂美科技有限公司 | Parallel chain consensus method, apparatus and storage medium |
| CN111242780A (en) * | 2020-01-12 | 2020-06-05 | 杭州复杂美科技有限公司 | Method, device and storage medium for sending consensus transaction |
| CN113110934A (en) * | 2021-04-09 | 2021-07-13 | 杭州复杂美科技有限公司 | Parallel chain block generation method, computer device, and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109271446A (en) * | 2018-08-30 | 2019-01-25 | 杭州复杂美科技有限公司 | A kind of parallel chain method of data synchronization, equipment and storage medium |
| CN109474676A (en) * | 2018-10-18 | 2019-03-15 | 尚维斯 | A kind of arbitrary node can all form the block chain of alliance's chain or private chain |
| CN109587271A (en) * | 2018-12-29 | 2019-04-05 | 杭州复杂美科技有限公司 | Main chain parallel chain architecture system and block synchronous method, equipment and storage medium |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160098723A1 (en) * | 2014-10-01 | 2016-04-07 | The Filing Cabinet, LLC | System and method for block-chain verification of goods |
| CN109410045B (en) * | 2018-08-30 | 2020-08-14 | 杭州复杂美科技有限公司 | Parallel chain consensus method, equipment and storage medium |
| CN109508982B (en) * | 2018-11-21 | 2022-11-29 | 北京蓝石环球区块链科技有限公司 | Random parallel Byzantine fault-tolerant consensus method of block chain main chain and parallel multiple sub-chains |
| CN109584072B (en) * | 2018-11-28 | 2023-01-13 | 杭州复杂美科技有限公司 | Transaction sending method, device and storage medium for parallel chain consensus |
-
2019
- 2019-05-31 CN CN201910470244.9A patent/CN110210972B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109271446A (en) * | 2018-08-30 | 2019-01-25 | 杭州复杂美科技有限公司 | A kind of parallel chain method of data synchronization, equipment and storage medium |
| CN109474676A (en) * | 2018-10-18 | 2019-03-15 | 尚维斯 | A kind of arbitrary node can all form the block chain of alliance's chain or private chain |
| CN109587271A (en) * | 2018-12-29 | 2019-04-05 | 杭州复杂美科技有限公司 | Main chain parallel chain architecture system and block synchronous method, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110210972A (en) | 2019-09-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110210972B (en) | Method, device and storage medium for sending consensus transaction | |
| CN109271446B (en) | Parallel chain data synchronization method, equipment and storage medium | |
| CN110113408B (en) | Block synchronization method, equipment and storage medium | |
| US20220253458A1 (en) | Method and device for synchronizing node data | |
| JP6557323B2 (en) | Data storage in case of database failure | |
| CN110083745B (en) | Data query method, device and storage medium | |
| CN111861471A (en) | Parallel chain consensus method, parallel chain block rollback method, device and storage medium | |
| CN110392121B (en) | Parallel chain block generation method, device and storage medium | |
| CN111798316B (en) | Parallel chain consensus method, apparatus and storage medium | |
| CN111242780A (en) | Method, device and storage medium for sending consensus transaction | |
| CN110287196B (en) | Block storage method, parallel chain transaction acquisition method, equipment and storage medium | |
| CN108549592A (en) | A kind of monitoring method and monitoring device, application server of database connection pool | |
| CN114385353A (en) | Resource scheduling method and device, electronic equipment and storage medium | |
| CN111008249B (en) | Parallel chain block synchronization method, device and storage medium | |
| CN110445843B (en) | Parallel chain block pushing method, device and storage medium | |
| CN111259074A (en) | Block synchronization method, device and storage medium | |
| CN110287263B (en) | Parallel chain self-consensus method, device and storage medium | |
| CN111274313A (en) | Segment consensus method, device and storage medium | |
| CN111405037A (en) | Block synchronization method, device and storage medium | |
| CN110298756B (en) | Parallel chain self-consensus method, device and storage medium | |
| CN112839091B (en) | Block generation method, computer device and storage medium | |
| CN110535922B (en) | State data storage method and parallel chain block generation method | |
| CN111858772A (en) | Parallel chain transaction group execution method, device and storage medium | |
| CN110990490B (en) | Method, device, equipment and medium for checking in blockchain network | |
| CN111797086A (en) | Data clipping method, device and storage medium |
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 |