CN109584072B - Transaction sending method, device and storage medium for parallel chain consensus - Google Patents
Transaction sending method, device and storage medium for parallel chain consensus Download PDFInfo
- Publication number
- CN109584072B CN109584072B CN201811432852.2A CN201811432852A CN109584072B CN 109584072 B CN109584072 B CN 109584072B CN 201811432852 A CN201811432852 A CN 201811432852A CN 109584072 B CN109584072 B CN 109584072B
- Authority
- CN
- China
- Prior art keywords
- block
- height
- information
- main chain
- sending
- 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 transaction sending method, equipment and a storage medium for parallel chain consensus, wherein the method comprises the following steps: sending first block information of a first block to be identified of a first parallel chain to a corresponding main chain node for the main chain node to carry out parallel chain identification; judging whether the first block information is successfully sent, if not, sending a plurality of block information to be identified to corresponding main chain nodes according to the height of a second block of the main chain for parallel chain identification; the second block height is the block height of the first parallel chain authenticated on the main chain and confirmed by a parallel chain consensus algorithm. The invention comprehensively determines which transactions are needed by the parallel chain link points by acquiring the consensus height of the main chain and receiving and sending the feedback information of the transactions, so that the whole transaction process forms a closed loop, thereby effectively avoiding the problem that the transactions cannot be found in time due to unsuccessful sending and improving the working efficiency.
Description
Technical Field
The application relates to the technical field of block chains, in particular to a transaction sending method, equipment and a storage medium for parallel chain consensus.
Background
In the existing technology related to parallel chains, feedback information to a main chain is not provided after a transaction is sent to a main chain node, and in this way, if the main chain does not receive the transaction, the transaction may stay in a consensus state for a long time to be found, so that the working efficiency is low or congestion is caused under the condition of a large number of transactions.
Disclosure of Invention
In view of the above-mentioned deficiencies or inadequacies in the prior art, it would be desirable to provide an efficient parallel chain consensus transaction sending method, apparatus, and storage medium.
In a first aspect, the present invention provides a transaction sending method for parallel chain consensus, including: sending first block information of a first block to be identified of a first parallel chain to a corresponding main chain node for the main chain node to carry out parallel chain identification;
judging whether the first block information is successfully sent, if not, sending a plurality of block information to be identified to corresponding main chain nodes according to the height of a second block of the main chain for parallel chain identification; the second block height is the block height of the first parallel chain authenticated on the main chain and confirmed by a parallel chain consensus algorithm.
Further, the determining whether the first block information is successfully transmitted includes:
and judging whether the transaction information of the first block is confirmed in the set number of blocks, if so, sending successfully.
Further, sending a plurality of block information for the to-be-identified to the corresponding main chain node according to the second block height of the main chain for parallel chain identification comprises:
judging whether the height of the second block is larger than that of the first block:
if not, the first block information is sent to the corresponding main chain node again for parallel chain consensus; wherein, the first block height is the block height of the first block;
if yes, sending the block information after the second block height to the corresponding main chain node for parallel chain consensus.
Further, after the first block information is sent to the corresponding main chain node, the nodes of the first parallel chain are packaged to generate a plurality of pieces of second block information to be identified after the first block;
sending block information for consensus to the backbone node according to the second block height of the backbone after confirmation comprises:
judging whether the second block height is larger than the first block height:
if not, sending the first block information and a plurality of second block information to corresponding main chain nodes for parallel chain consensus; wherein, the first block height is the block height of the first block;
if yes, sending the block information after the second block height to the corresponding main chain node for parallel chain consensus.
Further, the method further comprises:
and acquiring a second block height, and determining to-be-identified block information to be sent according to the second block height.
Further, the first block information includes at least one of: state hash of the first block, block height, signature information, state information of packaged transactions;
the status information is used to identify whether each transaction packed by the first block was successful.
In a second aspect, the present invention 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 a method of parallel chain consensus transaction transmission provided according to embodiments of the present invention.
In a third aspect, the present invention further provides a storage medium storing a computer program, the computer program causing a computer to execute the transaction sending method for parallel chain consensus according to the embodiments of the present invention.
The transaction sending method, the device and the storage medium for the parallel chain consensus provided by the embodiments of the invention comprehensively determine which transactions need to be sent in batches by acquiring the consensus height of the main chain and judging whether the transactions sent by the parallel chain nodes are received, so that the whole transaction process forms a closed loop, the phenomenon that the transactions cannot be found in time due to unsuccessful sending is effectively avoided, and the working efficiency is improved.
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 transaction sending method for parallel chain consensus according to an embodiment of the present invention.
Fig. 2 is a flow chart of step S12 of a preferred embodiment of the method of fig. 1.
Fig. 3 is a flow chart of step S12 of another 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 transaction sending method for parallel chain consensus according to an embodiment of the present invention.
As shown in fig. 1, in this embodiment, the present invention provides a transaction sending method for parallel chain consensus, including:
s11, sending first block information of a first block to be identified of a first parallel chain to a corresponding main chain node for the main chain node to carry out parallel chain identification;
s12, judging whether the first block information is successfully sent, if not, sending a plurality of block information to be identified to corresponding main chain nodes according to the height of a second block of the main chain for parallel chain identification; the second block height is the block height of the first parallel chain authenticated on the main chain and confirmed by a parallel chain consensus algorithm.
Specifically, in step S11, the node of the first parallel link processes the transaction in the first block synchronized from the main chain node, and sends the processed first block information to the corresponding main chain node for the main chain node to identify in common, in step S12, after the first block information is sent to the corresponding main chain node by the first parallel link node, whether the first block information sent by the parallel link node is queried is monitored, if successful, normal sending of subsequent block information is continued, if failed, the latest block height of the first parallel link identified in common at this time on the main chain is determined, and the block information to be sent is determined according to the latest block height, where the first block information includes at least one of: state hash of the first block, block height, signature information, state information of packaged transactions;
the status information is used to identify whether each transaction packaged by the first block was successful.
In a preferred embodiment, the first parallel link node determines whether the first block information is successfully transmitted, and may determine that the first parallel link node fails to transmit and needs to retransmit if the first parallel link node is not packed and confirmed by the main link node within a set number of blocks, such as two block heights, after the transaction information of the first block is transmitted.
In the embodiment, the main chain is monitored through the parallel chain link points, whether the transaction sent by the parallel chain nodes is successfully sent or not is determined, and the subsequently sent block information is determined by combining the latest block height after the consensus confirmation on the main chain, so that the sent content is more targeted, and the low working efficiency caused by untimely discovery of the sending failure can be avoided.
Fig. 2 is a flow chart of step S12 of a preferred embodiment of the method shown in fig. 1. As shown in fig. 2, the step S12 of sending the information of the blocks to be identified to the corresponding main chain node according to the second block height of the main chain for parallel chain identification includes:
s121, judging whether the height of the second block is larger than that of the first block:
if not, the first block information is sent to the corresponding main chain node again for parallel chain consensus; wherein, the first block height is the block height of the first block;
if yes, sending the block information after the second block height to the corresponding main chain node for parallel chain consensus.
Specifically, when the block information sent before the monitoring of the first parallel link node is not confirmed on the main chain, it is determined whether the second block height, that is, the latest block height confirmed by the parallel chain consensus algorithm after the main chain agrees with the first parallel link, is greater than the block height of the currently sent first block information, that is, the first block height, and if so, the first parallel link node continues to send the block information after the second block height to the corresponding main chain node for parallel chain consensus: such as: the latest block height on the main chain is 120, and the first block height of the first block information sent by the first parallel link node is 100, then the node of the first parallel link will continue to send the block information with the block height of 121 to the corresponding main chain node for parallel link consensus.
If not, the first block information needs to be retransmitted to the corresponding main chain node for parallel chain consensus, such as: the latest block height on the main chain is 120, the first block height sent by the first parallel link node is 130, and then because the sending of the block information with the block height of 130 fails, the first parallel link node needs to resend the block information with the block height of 130 to the corresponding main chain node for parallel chain consensus, and after the main chain is confirmed, the block information with the block height of 131, 132. In this embodiment, since the block information of the block height of 130 fails to be transmitted, but the blocks before the block height of 130 are successfully transmitted, even if the latest block height (120) on the main chain after passing is lower than the first block height (130), the block information of the block height between 120 and 130 does not need to be retransmitted, thereby improving the working efficiency of the processing.
In a preferred embodiment, the number of the unsuccessfully sent block information may be several, in this case, the first parallel link node may resend the unsuccessfully sent block transaction information to the corresponding main chain node in batch, or may set the number of the sent transactions, which is not limited in this embodiment.
Fig. 3 is a flow chart of step S12 of another preferred embodiment of the method shown in fig. 1. As shown in fig. 3, after the first block information is sent to the corresponding main chain node, the nodes of the first parallel chain are packed to generate a plurality of pieces of second block information to be identified after the first block;
sending block information for consensus to the backbone node according to the second block height of the backbone after confirmation comprises:
s121', judging whether the second block height is larger than the first block height:
if not, sending the first block information and a plurality of second block information to corresponding main chain nodes for parallel chain consensus; wherein, the first block height is the block height of the first block;
if yes, sending the block information after the second block height to the corresponding main chain node for parallel chain consensus. The method comprises the following steps:
specifically, after the first block information is sent to the corresponding main chain node, block transactions on a plurality of main chains are continuously synchronized, the block transactions are packaged to generate a plurality of second block information, whether the second block height, namely the height of the last block which is identified by the main chain after the main chain identifies the first parallel chain, is larger than the block height of the first block information sent at present, namely the height of the first block is judged, if yes, the first parallel chain node continuously sends the block information after the second block height to the corresponding main chain node to perform parallel chain identification: such as: the latest block height on the main chain is 120, and the first block height of the first block information sent by the first parallel chain node is 100, so that the first parallel chain node will continue to send the block information with the block height of 121 to the corresponding main chain node for parallel chain consensus;
if not, sending the first block information and a plurality of second block information to corresponding main chain nodes for parallel chain consensus, if the latest height on the main chain is 120, the first block height sent by the first parallel chain node is 130, and after sending the block with the height of 130, continuing to synchronize the transaction of a plurality of block heights (such as 131, 132 and 133) on the main chain, packaging the transactions of the heights to generate each second block information respectively, and if the sending of the block information with the block height of 130 fails, sending the block information with the block height of 130 and the three second block information with the block heights of 131, 132 and 133 to the corresponding main chain nodes together by the first parallel chain link node for parallel chain consensus.
FIG. 4 is a flow diagram of a preferred embodiment of the method of FIG. 1.
As shown in fig. 4, in a preferred embodiment, the method further includes:
and S13, acquiring a second block height, and determining to-be-identified block information to be sent according to the second block height.
Specifically, after the problem of the first parallel link node is solved, a second block height (i.e. the latest block height) after the common identification on the main chain is obtained, a block height h of block information sent when the first parallel link node has a problem is determined, the block height h is compared with the second block height, if the second block height is higher than the block height h, it is indicated that when the first parallel link node has a problem, other first parallel link nodes have successfully sent the block information of the block height h and have passed the common identification, in this case, the first parallel link node only needs to start sending to the corresponding main chain node from a block after the second block height, for example: the second block height is 120, the block height when the first parallel link node has a problem is 100, when the problem of the first parallel link node is solved, the block information with the block height of 121 is sent to the main chain node, and the block information with the block height of 100-120 only needs to be synchronized from the main chain;
if the second block height is lower than the block height h, it means that the main chain node does not agree on the block with the successful block height between the second block height and the block height h during the node is in problem, and at this time, the first parallel chain node needs to start from the block with the second block height and resend the following block to the main chain node, for example: the second block height is 120, and the block height of the first parallel link node when the problem occurs is 130, after the problem is resolved, the first parallel link node should send the unsent block information to the main chain node in batch from the block with the block height of 120, where the batch may be set as the following 20 block information, or may be other set number of block information, and is not limited by this embodiment. In addition, the problem that occurs in the first parallel chain node described above may be that a node fails, or that a node restarts for another reason, or that network congestion occurs, and the like, and is not limited by this embodiment.
In further embodiments, this step may be performed before step S11 or before step S12, as long as the problem occurring in the node of the first parallel chain is solved, and this step is not limited by the order described in the present invention.
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 700 including one or more Central Processing Units (CPUs) 701 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 702 or a program loaded from a storage section 708 into a Random Access Memory (RAM) 703. In the RAM703, various programs and data necessary for the operation of the apparatus 700 are also stored. The CPU701, the ROM702, and the RAM703 are connected to each other via a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.
The following components are connected to the I/O interface 705: an input portion 706 including a keyboard, a mouse, and the like; an output section 707 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 708 including a hard disk and the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. The communication section 709 performs communication processing via a network such as the internet. A drive 710 is also connected to the I/O interface 705 as needed. A removable medium 711 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 710 as necessary, so that a computer program read out therefrom is mounted into the storage section 708 as necessary.
In particular, according to an embodiment of the present disclosure, the transaction transmission method of parallel chain consensus 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 parallel chain consensus transaction sending method. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 709, and/or installed from the removable medium 711.
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 transaction sending method described in the present application for parallel chain consensus.
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 that 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 transmitting a transaction with parallel chain consensus, comprising:
sending first block information of a first block to be identified of a first parallel chain to a corresponding main chain node for the main chain node to carry out parallel chain identification;
judging whether the first block information is successfully sent, if not, sending a plurality of block information to be identified to corresponding main chain nodes according to the height of a second block of the main chain for parallel chain identification; wherein the second block height is a block height of the first parallel chain authenticated on the main chain determined by a parallel chain consensus algorithm.
2. The method of claim 1, wherein the determining whether the first block information is successfully transmitted comprises:
and judging whether the transaction information of the first block is confirmed in the set number of blocks, if so, sending successfully.
3. The method of claim 1, wherein sending block information for the to-be-identified blocks to the corresponding backbone node for parallel chain identification according to the second block height of the backbone comprises:
judging whether the second block height is larger than the first block height:
if not, the first block information is sent to the corresponding main chain node again for parallel chain consensus; wherein the first block height is a block height of the first block;
if yes, sending the block information after the second block height to the corresponding main chain node for parallel chain consensus.
4. The method of claim 1, wherein after the first block information is sent to the corresponding main chain node, the nodes of the first parallel chain are packed to generate a plurality of pieces of second block information to be identified after the first block;
the sending block information for consensus to the backbone node according to the second block height of the backbone after confirmation comprises:
judging whether the second block height is larger than the first block height:
if not, sending the first block information and the plurality of second block information to corresponding main chain nodes for parallel chain consensus; wherein the first block height is a block height of the first block;
if yes, sending the block information after the second block height to the corresponding main chain node for parallel chain consensus.
5. The method according to any one of claims 1-4, further comprising:
and acquiring the second block height, and determining to-be-identified block information to be sent according to the second block height.
6. The method according to any of claims 1-4, wherein the first block information comprises at least one of: state hash, block height, signature information of the first block, and state information of each packaged transaction;
the status information is used to identify whether each transaction packed by the first block was successful.
7. An apparatus, characterized in that the apparatus comprises:
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 |
|---|---|---|---|
| CN201811432852.2A CN109584072B (en) | 2018-11-28 | 2018-11-28 | Transaction sending method, device and storage medium for parallel chain consensus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811432852.2A CN109584072B (en) | 2018-11-28 | 2018-11-28 | Transaction sending method, device and storage medium for parallel chain consensus |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109584072A CN109584072A (en) | 2019-04-05 |
| CN109584072B true CN109584072B (en) | 2023-01-13 |
Family
ID=65924726
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811432852.2A Active CN109584072B (en) | 2018-11-28 | 2018-11-28 | Transaction sending method, device and storage medium for parallel chain consensus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109584072B (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110209737B (en) * | 2019-05-22 | 2021-02-09 | 杭州复杂美科技有限公司 | Data reporting method, parallel chain creating method, equipment and storage medium |
| CN110210972B (en) * | 2019-05-31 | 2021-04-13 | 杭州复杂美科技有限公司 | Method, device and storage medium for sending consensus transaction |
| CN110298756B (en) * | 2019-06-28 | 2022-12-20 | 杭州复杂美科技有限公司 | Parallel chain self-consensus method, device and storage medium |
| CN110287196B (en) * | 2019-06-29 | 2021-11-02 | 杭州复杂美科技有限公司 | Block storage method, parallel chain transaction acquisition method, equipment and storage medium |
| CN110445843B (en) * | 2019-07-15 | 2021-11-02 | 杭州复杂美科技有限公司 | Parallel chain block pushing method, device and storage medium |
| CN110443710B (en) * | 2019-08-02 | 2022-06-07 | 中国工商银行股份有限公司 | Block chain system and method for batch signature |
| CN112910648B (en) * | 2019-12-03 | 2023-04-07 | 北京百度网讯科技有限公司 | Consensus method and device for privacy states of block chain |
| CN111274313B (en) * | 2020-01-12 | 2023-05-30 | 杭州复杂美科技有限公司 | Segment consensus method, device and storage medium |
| CN111275437B (en) * | 2020-01-12 | 2023-05-30 | 杭州复杂美科技有限公司 | Parallel chain consensus method, apparatus and storage medium |
| CN111249739B (en) * | 2020-02-18 | 2023-04-07 | 杭州复杂美科技有限公司 | Main chain node selection method, game result display method, equipment and storage medium |
| CN111260476B (en) * | 2020-02-19 | 2023-05-30 | 杭州复杂美科技有限公司 | Parallel chain segment self-consensus method, device and storage medium |
| CN111524011B (en) * | 2020-05-06 | 2023-05-30 | 杭州复杂美科技有限公司 | Parallel link consensus validation method, apparatus, and storage medium |
| CN112511309B (en) * | 2020-11-19 | 2022-07-08 | 从法信息科技有限公司 | Method and device for directionally sharing supervision-oriented information on block chain and electronic equipment |
| CN113110934A (en) * | 2021-04-09 | 2021-07-13 | 杭州复杂美科技有限公司 | Parallel chain block generation method, computer device, and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107508680A (en) * | 2017-07-26 | 2017-12-22 | 阿里巴巴集团控股有限公司 | Digital certificate management method, device and electronic equipment |
| CN108182635A (en) * | 2017-12-18 | 2018-06-19 | 深圳前海微众银行股份有限公司 | Block chain common recognition method, system and computer readable storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11182851B2 (en) * | 2016-10-20 | 2021-11-23 | International Business Machines Corporation | Inter-ledger messaging in a blockchain |
| US20180158034A1 (en) * | 2016-12-07 | 2018-06-07 | International Business Machines Corporation | Dynamic reordering of blockchain transactions to optimize performance and scalability |
| CN107040585B (en) * | 2017-02-22 | 2020-06-19 | 创新先进技术有限公司 | Service checking method and device |
-
2018
- 2018-11-28 CN CN201811432852.2A patent/CN109584072B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107508680A (en) * | 2017-07-26 | 2017-12-22 | 阿里巴巴集团控股有限公司 | Digital certificate management method, device and electronic equipment |
| CN108182635A (en) * | 2017-12-18 | 2018-06-19 | 深圳前海微众银行股份有限公司 | Block chain common recognition method, system and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109584072A (en) | 2019-04-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109584072B (en) | Transaction sending method, device and storage medium for parallel chain consensus | |
| CN109831514B (en) | Parallel chain consensus method, data exception handling method, device and storage medium | |
| CN109377365B (en) | Asset transfer method, device and storage medium | |
| CN110083745B (en) | Data query method, device and storage medium | |
| CN111242780A (en) | Method, device and storage medium for sending consensus transaction | |
| CN110796545A (en) | Batch processing method, equipment and storage medium for blockchain transaction | |
| CN112184436B (en) | Data synchronization method, electronic device and readable storage medium | |
| CN110535933B (en) | Parallel chain consensus method, device and storage medium | |
| CN111259074A (en) | Block synchronization method, device and storage medium | |
| CN110210972B (en) | Method, device and storage medium for sending consensus transaction | |
| CN110928952A (en) | Data synchronization method and device based on block chain | |
| CN111008249A (en) | Parallel chain block synchronization method, device and storage medium | |
| CN113986501A (en) | Real-time database API (application program interface) uninterrupted calling method, system, storage medium and server | |
| CN110298756B (en) | Parallel chain self-consensus method, device and storage medium | |
| CN112733202B (en) | Parallel chain supervision consensus method, computer device and storage medium | |
| CN111858772A (en) | Parallel chain transaction group execution method, device and storage medium | |
| CN110191130B (en) | Method, device and storage medium for defending against false transaction attacks | |
| CN111524010A (en) | Parallel chain consensus method, device and storage medium | |
| CN114202947B (en) | Internet of vehicles data transmission method and device and automatic driving vehicle | |
| CN113222576B (en) | Delayed transfer method, computer device and storage medium | |
| US9509780B2 (en) | Information processing system and control method of information processing system | |
| CN115118710B (en) | File transmission method and device | |
| CN113204597B (en) | Method, equipment and storage medium for horizontal extension of block chain executor | |
| CN104185204B (en) | A kind of connection status inspection method and device | |
| CN113744055B (en) | Cross-link message transmission 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 |