CN111405037A - Block synchronization method, device and storage medium - Google Patents
Block synchronization method, device and storage medium Download PDFInfo
- Publication number
- CN111405037A CN111405037A CN202010176344.3A CN202010176344A CN111405037A CN 111405037 A CN111405037 A CN 111405037A CN 202010176344 A CN202010176344 A CN 202010176344A CN 111405037 A CN111405037 A CN 111405037A
- Authority
- CN
- China
- Prior art keywords
- block
- transactions
- root hash
- blocks
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000004590 computer program Methods 0.000 claims description 8
- 238000010586 diagram Methods 0.000 description 8
- 230000001360 synchronised effect Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 2
- 230000007812 deficiency Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
Images
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/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
-
- 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/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
- H04L67/1078—Resource delivery mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Abstract
The invention provides a block synchronization method, a device and a storage medium, wherein the method comprises the following steps: requesting one or a consecutive plurality of blocks from a first block link point; analyzing each first transaction of the requested block according to the sequence of the transaction list in the block from small to large height of the block, judging whether each two transactions are related to each other according to the address in each first transaction, and storing the related transactions in the same group; the transactions in each group are executed in parallel, and the execution results of each group are stored. The method and the device reduce the time-consuming duration of block synchronization and improve user experience.
Description
Technical Field
The present application relates to the field of block chaining technologies, and in particular, to a block synchronization method, device, and storage medium.
Background
In the existing block synchronization mechanism, a current node synchronizes a plurality of blocks to an opposite node, and assuming that block (11) -block (15) are synchronized, all transactions in block (11) are played back first, then each transaction is processed in series, after the completion, all transactions in block (12) are played back, then each transaction is processed in series, and so on until each transaction in block (15) is completed.
The above mechanism will take a long time for block synchronization.
Disclosure of Invention
In view of the above-mentioned drawbacks and deficiencies of the prior art, it is desirable to provide a block synchronization method, apparatus, and storage medium that is less time consuming.
In a first aspect, the present invention provides a block synchronization method for a blockchain node, where the method includes:
requesting one or a consecutive plurality of blocks from a first block link point;
analyzing each first transaction of the requested block according to the sequence of the transaction list in the block from small to large height of the block, judging whether each two transactions are related to each other according to the address in each first transaction, and storing the related transactions in the same group;
the transactions in each group are executed in parallel, and the execution results of each group are stored.
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 block synchronization method provided in accordance with embodiments of the present invention.
In a third aspect, the present invention also provides a storage medium storing a computer program that causes a computer to execute the block synchronization method provided according to the embodiments of the present invention.
Embodiments of the present invention provide a block synchronization method, apparatus, and storage medium by requesting one or more consecutive blocks from a first block link point; analyzing each first transaction of the requested block according to the sequence of the transaction list in the block from small to large height of the block, judging whether each two transactions are related to each other according to the address in each first transaction, and storing the related transactions in the same group; the method for executing the transaction in each group in parallel and storing the execution result of each group reduces the time-consuming duration of block synchronization and improves the user experience.
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 block synchronization method according to an embodiment of the present invention.
Fig. 2 is a flowchart of step S16 in 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 flowchart of step S16 in a preferred embodiment of the method shown in fig. 3.
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 block synchronization method according to an embodiment of the present invention. As shown in fig. 1, in the present embodiment, the present invention provides a block synchronization method for a blockchain node, where the method includes:
s12: requesting one or a consecutive plurality of blocks from a first block link point;
s14: analyzing each first transaction of the requested block according to the sequence of the transaction list in the block from small to large height of the block, judging whether each two transactions are related to each other according to the address in each first transaction, and storing the related transactions in the same group;
s16: the transactions in each group are executed in parallel, and the execution results of each group are stored.
Specifically, assuming that there are and only transactions between users a to h in blocks (1) to (9), the execution result stored by node a before block (10) is synchronized is: the balance of a to h is 100 mmm; the node A requests the node B for 3 blocks (10) to (12) in succession, and the transaction list in the blocks (10) is as follows: tx1(a > > b,10mmm), tx2(c > > b,10mmm), the list of transactions in block (11) is: tx3(e > > f,5mmm), tx4(b > > d,5mmm), the list of transactions in block (12) is: tx5(g > > h,10mmm), tx6(d > > a,5 mmm);
the node a executes step S12 to request the node B for 3 blocks (10) to (12) in succession;
the node B returns the blocks (10) to (12) to the node A;
the node a executes step S14, parses the transactions according to the sequence of tx1, tx2, tx3, tx4, tx5, and tx6, determines whether each two transactions are related to each other according to the addresses of tx1, tx2, tx3, tx4, tx5, and tx6, and stores the transactions related to each service into the same group, which specifically includes the following operations:
because tx1 is the first transaction, no transaction exists for comparison and judgment, the node A puts tx1 into group 1;
since the address of tx2 includes addresses of c and b, the address of tx1 includes addresses of a and b, tx2 is related to tx1 traffic, and node a puts tx2 into group 1;
since the address of tx3 includes addresses of e and f, the addresses of tx1 and tx2 do not include addresses of e and f, tx3 is not related to tx1 and tx2 services, and node a puts tx3 into group 2;
since the address of tx4 includes the addresses of b and d, the address of tx1 includes the addresses of a and b, tx4 is related to tx1 traffic, and node a puts tx4 into group 1;
because the address of tx5 includes addresses of g and h, the addresses of tx1, tx2, tx3 and tx4 do not include addresses of e and f, tx5 is not related to traffic of tx1, tx2, tx3 and tx4, and node a puts tx5 into group 3;
since the address of tx6 includes the addresses of d and a, the address of tx1 includes the addresses of a and b, tx6 is related to tx1 traffic, and node a puts tx6 into group 1;
the final group1 includes: tx1, tx2, tx4, tx 6;
group2 includes: tx 3;
group3 includes: tx 5;
the node a executes S16, and executes the transactions in group1, group2 and group3 in parallel, because the execution result stored by the node a before synchronizing the blocks (10) to (12) is: the balances of a to h are all 100mmm, so the execution result of group1 is as follows: the balance of a is 105mmm, the balance of b is 115mmm, the balance of c is 90mmm, and the balance of d is 100 mmm; the execution result of group2 is: the balance of e is 95mmm, and the balance of f is 105 mmm; the execution result of group3 is: the balance of g is 90mmm, and the balance of h is 110 mmm; the node a stores the execution result of each packet.
In the above embodiment, in block (1) to block (9), there are and only transactions between users a to h, and the execution result stored by node a before block (10) is synchronized is: the balance of a to h is 100 mmm; the node A requests the node B for 3 blocks (10) to (12) in succession, and the transaction list in the blocks (10) is as follows: tx1(a > > b,10mmm), tx2(c > > b,10mmm), the list of transactions in block (11) is: tx3(e > > f,5mmm), tx4(b > > d,5mmm), the list of transactions in block (12) is: tx5(g > > h,10mmm), tx6(d > > a,5mmm) are exemplified for illustration.
In the prior block chain technology, block (10) to block (12) are synchronized, and 12s are needed for serially executing 6 transactions; in the above embodiment, the block (10) to block (12) are synchronized, and the transactions in groups 1 to 3 are executed in parallel, theoretically only 6s at most; the embodiment reduces the time consumption of the block synchronization and improves the user experience.
It can be seen that the greater the likelihood that every two transactions are business related, the fewer the number of packets and the poorer the effect, per more synchronized block. Therefore, the number of the plurality of blocks in the above embodiment is not set too high.
Fig. 2 is a flowchart of step S16 in a preferred embodiment of the method shown in fig. 1. As shown in fig. 2, in a preferred embodiment, step S16 includes:
s161: executing the transaction in each group in parallel, and generating a first root hash according to the execution result of each group;
s162: requesting a second root hash of a highest block height block of the requested blocks from the first block link points;
s163: verifying whether the first root hash is consistent with the second root hash:
if yes, go to step S164: the execution result of each packet is stored.
The above embodiment verifies whether the block data of the synchronized block is tampered by verifying the root hash. In further embodiments, the operation when the first root hash is inconsistent with the second root hash may be configured according to actual requirements, for example, configured to request one or a plurality of blocks in succession from other block nodes; or, the method is configured to add one to the failure times to update the failure times, and determine whether the failure times reaches a first threshold: if not, returning to request one or a plurality of continuous blocks from the first block link point; if yes, requesting one or a plurality of continuous blocks from other block chain nodes; the same technical effect can be achieved.
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, before step S12, the method further includes:
s10: requesting a second root hash of a block with the highest block height among the requested blocks from the plurality of block nodes;
s11: and identifying the second root hashes together, and selecting any block chain node from the block chain nodes corresponding to the identified second root hashes as a first block chain node.
The above embodiments are well suited for newly joining a block link point of a block chain network, and using the method of the above embodiments, the probability that the current node is connected to a node of a non-bifurcated chain can be increased.
Fig. 4 is a flowchart of step S16 in a preferred embodiment of the method shown in fig. 3. As shown in fig. 4, in a preferred embodiment, step S16 includes:
s166: executing the transaction in each group in parallel, and generating a first root hash according to the execution result of each group;
s167: verifying whether the first root hash is consistent with the second root hash:
if yes, go to step S168: the execution result of each packet is stored.
The above embodiment verifies whether the block data of the synchronized block is tampered by verifying the root hash. In further embodiments, the operation when the first root hash is inconsistent with the second root hash may be configured according to actual requirements, for example, configured to request one or a plurality of blocks in succession from other block nodes; or, the method is configured to add one to the failure times to update the failure times, and determine whether the failure times reaches a first threshold: if not, returning to request one or a plurality of continuous blocks from the first block link point; if yes, requesting one or a plurality of continuous blocks from other block chain nodes; the same technical effect can be achieved.
Preferably, in a preferred embodiment, requesting one or a consecutive plurality of tiles from the first tile link point comprises:
requesting a first parent hash of a lowest block height block of the requested blocks from a first block link point;
judging whether the first parent hash is consistent with the block hash of the block with the highest local block height: if so, one or more consecutive blocks are requested from the first block link point.
The above embodiments ensure that the block requested by the current node is the required block.
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.
To the I/O interface 505, AN input section 506 including a keyboard, a mouse, and the like, AN output section 507 including a keyboard such as a Cathode Ray Tube (CRT), a liquid crystal display (L CD), and the like, a speaker, and the like, a storage section 508 including a hard disk and the like, and a communication section 509 including a network interface card such as a L AN card, a modem, and the like, the communication section 509 performs communication processing via a network such as the internet, a drive 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, and 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 block synchronization 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 a method of block synchronization. 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 block synchronization methods 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 (6)
1. A block synchronization method, applied to a blockchain node, the method comprising:
requesting one or a consecutive plurality of blocks from a first block link point;
analyzing each first transaction of the requested block according to the sequence of the transaction list in the block from small to large height of the block, judging whether each two transactions are related to each other according to the address in each first transaction, and storing the related transactions in the same group;
the transactions in each group are executed in parallel, and the execution results of each group are stored.
2. The method of claim 1, wherein storing the execution results for each packet comprises:
generating a first root hash according to an execution result of each packet;
requesting a second root hash of a highest block height block of the requested blocks from the first block chain node;
verifying whether the first root hash and the second root hash are consistent:
if so, the execution result of each packet is stored.
3. The method of claim 1, wherein prior to requesting a consecutive number of blocks from a first block link point, further comprising:
requesting a second root hash of a block with the highest block height among the requested blocks from the plurality of block nodes;
and identifying the second root hashes together, and selecting any block chain node from the block chain nodes corresponding to the identified second root hashes as the first block chain node.
4. The method of claim 3, wherein storing the execution results for each packet comprises:
generating a first root hash according to an execution result of each packet;
verifying whether the first root hash and the second root hash are consistent:
if so, the execution result of each packet is stored.
5. 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-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 |
|---|---|---|---|
| CN202010176344.3A CN111405037A (en) | 2020-03-13 | 2020-03-13 | Block synchronization method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010176344.3A CN111405037A (en) | 2020-03-13 | 2020-03-13 | Block synchronization method, device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111405037A true CN111405037A (en) | 2020-07-10 |
Family
ID=71428829
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010176344.3A Pending CN111405037A (en) | 2020-03-13 | 2020-03-13 | Block synchronization method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111405037A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112202863A (en) * | 2020-09-24 | 2021-01-08 | 成都质数斯达克科技有限公司 | Data synchronization method and device, electronic equipment and readable storage medium |
| CN114422526A (en) * | 2021-12-31 | 2022-04-29 | 支付宝(杭州)信息技术有限公司 | Block synchronization method and device, electronic equipment and storage medium |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107507006A (en) * | 2017-08-11 | 2017-12-22 | 杭州秘猿科技有限公司 | A kind of common recognition bifurcated processing method based on license chain |
| CN107678865A (en) * | 2017-09-20 | 2018-02-09 | 中国银行股份有限公司 | The verification method and system of block chain based on transaction packet |
| CN108846749A (en) * | 2018-05-31 | 2018-11-20 | 杭州秘猿科技有限公司 | A kind of sliced transaction execution system and method based on block chain technology |
| CN108984662A (en) * | 2018-06-28 | 2018-12-11 | 杭州复杂美科技有限公司 | A kind of block chain method of data synchronization |
| CN109636384A (en) * | 2018-10-26 | 2019-04-16 | 阿里巴巴集团控股有限公司 | A kind of parallelization executes the method, apparatus and system of block chain transaction |
| WO2019072303A2 (en) * | 2018-12-28 | 2019-04-18 | Alibaba Group Holding Limited | Parallel execution of transactions in a blockchain network |
| CN109687953A (en) * | 2018-12-24 | 2019-04-26 | 杭州复杂美科技有限公司 | Classification of business transaction method, equipment and storage medium |
| CN110135985A (en) * | 2019-04-04 | 2019-08-16 | 杭州抖音科技有限公司 | A kind of parallel execution method and system traded on block chain |
| US20190361731A1 (en) * | 2017-02-28 | 2019-11-28 | Alibaba Group Holding Limited | Method and apparatus for writing service data into block chain and method for determining service subset |
-
2020
- 2020-03-13 CN CN202010176344.3A patent/CN111405037A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190361731A1 (en) * | 2017-02-28 | 2019-11-28 | Alibaba Group Holding Limited | Method and apparatus for writing service data into block chain and method for determining service subset |
| CN107507006A (en) * | 2017-08-11 | 2017-12-22 | 杭州秘猿科技有限公司 | A kind of common recognition bifurcated processing method based on license chain |
| CN107678865A (en) * | 2017-09-20 | 2018-02-09 | 中国银行股份有限公司 | The verification method and system of block chain based on transaction packet |
| CN108846749A (en) * | 2018-05-31 | 2018-11-20 | 杭州秘猿科技有限公司 | A kind of sliced transaction execution system and method based on block chain technology |
| CN108984662A (en) * | 2018-06-28 | 2018-12-11 | 杭州复杂美科技有限公司 | A kind of block chain method of data synchronization |
| CN109636384A (en) * | 2018-10-26 | 2019-04-16 | 阿里巴巴集团控股有限公司 | A kind of parallelization executes the method, apparatus and system of block chain transaction |
| CN109687953A (en) * | 2018-12-24 | 2019-04-26 | 杭州复杂美科技有限公司 | Classification of business transaction method, equipment and storage medium |
| WO2019072303A2 (en) * | 2018-12-28 | 2019-04-18 | Alibaba Group Holding Limited | Parallel execution of transactions in a blockchain network |
| CN110520882A (en) * | 2018-12-28 | 2019-11-29 | 阿里巴巴集团控股有限公司 | Transaction is executed parallel in block chain network |
| CN110135985A (en) * | 2019-04-04 | 2019-08-16 | 杭州抖音科技有限公司 | A kind of parallel execution method and system traded on block chain |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112202863A (en) * | 2020-09-24 | 2021-01-08 | 成都质数斯达克科技有限公司 | Data synchronization method and device, electronic equipment and readable storage medium |
| CN112202863B (en) * | 2020-09-24 | 2022-09-20 | 成都质数斯达克科技有限公司 | Data synchronization method and device, electronic equipment and readable storage medium |
| CN114422526A (en) * | 2021-12-31 | 2022-04-29 | 支付宝(杭州)信息技术有限公司 | Block synchronization method and device, electronic equipment and storage medium |
| CN114422526B (en) * | 2021-12-31 | 2024-03-15 | 支付宝(杭州)信息技术有限公司 | Block synchronization method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108984662B (en) | Block chain data synchronization method | |
| CN110392121B (en) | Parallel chain block generation method, device and storage medium | |
| CN110083745B (en) | Data query method, device and storage medium | |
| CN110852882B (en) | Packet consensus method, apparatus, device, and medium for blockchain networks | |
| CN110442580B (en) | Block chain state data storage method, equipment and storage medium | |
| CN109450987A (en) | Number generation method, apparatus and system and storage medium | |
| CN111405037A (en) | Block synchronization method, device and storage medium | |
| CN110837409A (en) | Method and system for executing task regularly | |
| CN111008249B (en) | Parallel chain block synchronization method, device and storage medium | |
| CN112925859A (en) | Data storage method and device | |
| CN110837505A (en) | State data storage method, state data synchronization device and storage medium | |
| CN111324449A (en) | Transaction storage and broadcasting method, device and storage medium of memory pool | |
| CN110210972B (en) | Method, device and storage medium for sending consensus transaction | |
| CN113127564B (en) | Parameter synchronization method and device | |
| CN111523896B (en) | Attack prevention method, apparatus and storage medium | |
| CN110322350B (en) | Method, device, equipment and storage medium for cutting hollow block in consensus network | |
| CN111951112A (en) | Intelligent contract execution method based on block chain, terminal equipment and storage medium | |
| CN112929432B (en) | Broadcasting method, equipment and storage medium based on repeated broadcasting history | |
| US10250515B2 (en) | Method and device for forwarding data messages | |
| CN115543416A (en) | Configuration updating method and device, electronic equipment and storage medium | |
| CN110019671B (en) | Method and system for processing real-time message | |
| CN111639939A (en) | Block restoring method, equipment and storage medium | |
| CN113297327A (en) | System and method for generating distributed ID | |
| CN111061712A (en) | Data connection operation processing method and device | |
| CN111523897A (en) | Anti-attack 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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200710 |