CN114358938A - Transaction, block broadcasting method, device and storage medium - Google Patents
Transaction, block broadcasting method, device and storage medium Download PDFInfo
- Publication number
- CN114358938A CN114358938A CN202111661906.4A CN202111661906A CN114358938A CN 114358938 A CN114358938 A CN 114358938A CN 202111661906 A CN202111661906 A CN 202111661906A CN 114358938 A CN114358938 A CN 114358938A
- Authority
- CN
- China
- Prior art keywords
- transaction
- consensus
- nodes
- node
- broadcasting
- 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
Images
Abstract
The invention provides a broadcasting method, equipment and a storage medium of a transaction and a block, wherein the method comprises the following steps: broadcasting the first transaction to other consensus nodes when the first transaction is generated by the current node or received through the rpc port, and subscribing to each first non-consensus node of the current node; upon receiving the second transaction through the p2p port, broadcasting the second transaction to the other consensus nodes, and, each first non-consensus node; the first block is broadcast to other common nodes and each first non-common node. The present application improves blockchain network throughput.
Description
Technical Field
The present application relates to the field of blockchain technologies, and in particular, to a method, device, and storage medium for broadcasting transactions and blocks.
Background
After the blockchain node starts the blockchain service and is connected to the blockchain network, operations such as transaction broadcasting, blockchain downloading and the like can be carried out.
As long as the communication protocols are consistent or some identification measures such as the consistency of the ChainIDs of the block chains are added, the nodes can freely join the block chain network. With the increase of the number of nodes, the network will expand rapidly, which results in the gradual decrease of the transmission efficiency of the transaction data, some nodes need a longer time to receive the transaction data, and the network bandwidth will expand accordingly, which is not favorable for the throughput of the whole blockchain network.
Disclosure of Invention
In view of the above-mentioned deficiencies or inadequacies in the prior art, it would be desirable to provide a transaction, block broadcast method, apparatus, and storage medium that improves blockchain network throughput.
In a first aspect, the present invention provides a method for broadcasting a transaction and a block suitable for a consensus node, where a block chain network is configured with a consensus node and a non-consensus node, the consensus nodes can communicate with each other, and the consensus nodes form a consensus network, where the method includes:
broadcasting the first transaction to other consensus nodes when the first transaction is generated by the current node or received through the rpc port, and subscribing to each first non-consensus node of the current node for each first non-consensus node:
broadcasting the first transaction to each second non-consensus node subscribing to the first non-consensus node and each second non-consensus node subscribing to the first non-consensus node;
upon receiving the second transaction through the p2p port, broadcasting the second transaction to the other consensus nodes, and each first non-consensus node for each first non-consensus node:
broadcasting the second transaction to each second consensus node and each second non-consensus node;
broadcasting the first block to other common nodes, and each first non-common node for each first non-common node:
the first block is broadcast to each second non-common node.
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 broadcasting a transaction, block, provided according to 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 a method of broadcasting a transaction, block, provided according to embodiments of the present invention.
Embodiments of the present invention provide methods, apparatuses, and storage media for broadcasting transactions and blocks by broadcasting a first transaction to other common node and each first non-common node subscribing to a current node when the first transaction is generated by the current node or received through rpc port; upon receiving the second transaction through the p2p port, broadcasting the second transaction to the other consensus nodes, and, each first non-consensus node; the first block is broadcast to other common nodes, and the throughput of the block chain network is improved by the method of each first non-common node.
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 and block broadcasting method according to an embodiment of the present invention.
Fig. 2 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 and block broadcasting method according to an embodiment of the present invention. As shown in fig. 1, in the present embodiment, the present invention provides a transaction and block broadcasting method suitable for consensus nodes, where a block chain network is configured with consensus nodes and non-consensus nodes, each of the consensus nodes can communicate with each other, and each of the consensus nodes forms a consensus network, where the method includes:
s12: broadcasting the first transaction to other consensus nodes when the first transaction is generated by the current node or received through the rpc port, and subscribing to each first non-consensus node of the current node for each first non-consensus node:
broadcasting the first transaction to each second non-consensus node subscribing to the first non-consensus node and each second non-consensus node subscribing to the first non-consensus node;
s14: upon receiving the second transaction through the p2p port, broadcasting the second transaction to the other consensus nodes, and each first non-consensus node for each first non-consensus node:
broadcasting the second transaction to each second consensus node and each second non-consensus node;
s16: broadcasting the first block to other common nodes, and each first non-common node for each first non-common node:
the first block is broadcast to each second non-common node.
Specifically, before S12, the method further includes "subscribe to a plurality of third non-consensus nodes when the blockchain service is started", S14 includes "broadcast the second transaction at the third non-consensus node, or broadcast the second transaction to other consensus nodes when the second transaction broadcast by other consensus nodes is received, and each first non-consensus node" as an example;
the block chain network is assumed to have consensus nodes N1-N4 and non-consensus nodes N1-N5;
at this point, the consensus node N5 initiates blockchain service;
n5 subscribes to several non-consensus nodes, assuming subscription N5;
thereafter, N5 is also subscribed by several non-consensus nodes, assuming N5 is also subscribed by N5;
in addition, it is assumed that N1 and N1 subscribe bidirectionally at this time, N2 and N2 subscribe … … N4 and N4 subscribe bidirectionally; and n1 has subscribed to n2, n2 has subscribed to n3, n3 has subscribed to n4, n4 has subscribed to n5 and n1, n5 has subscribed to n 1;
n5 performs step S12, broadcasting tx1 to N1 to N4, and N5 when tx1 is generated by N5 or received through rpc port (i.e. after the client of the user generates tx1, N5 is the tile link point of the first received tx 1);
n5 broadcasts tx1 to N5, and, N4;
n4 broadcasts tx1 to N4, and, N3;
… … the broadcast principle of other non-consensus nodes is similar and will not be described again;
n5 performs step S14, broadcasting tx2 to N1-N4 and N5 when tx2 is received through p2p port (i.e. tx2 is generated by other common node, or non-common node, or tx2 is generated by user' S client, then tx2 arrives at any one of N1-N4 before tx2 arrives at N5, or N5 arrives first);
n5 broadcasts tx2 to N5, and, N4;
n4 broadcasts tx2 to N4, and, N3;
… … the broadcast principle of other non-consensus nodes is similar and will not be described again;
n5 executing step S16, broadcasting block (X) to N1-N4, and N5; as will be appreciated by those skilled in the art, block (X) is generated by any one of nodes N1-N5;
n5 broadcasts block (X) to n 4;
n4 broadcasts block (X) to n 3;
… … the broadcast principle of other non-consensus nodes is similar and will not be described again;
those skilled in the art should understand that the consensus node can count the timeliness of the transaction broadcast by the subscribed non-consensus node (whether there is a missed broadcast transaction or a delayed broadcast transaction), so as to replace the subscribed non-consensus node periodically;
the above-described embodiments bring the following advantages:
1. introducing a subscription mode, and determining and controlling the randomness of network broadcast messages acquired by all nodes of the block chain network;
2. the number of times of network data repeated transmission is reduced, and the bandwidth occupation is effectively reduced;
3. dividing the block chain network into a consensus network and a non-consensus network; meanwhile, the two layers of networks are connected with each other, and the transaction is spread in the two layers of networks in parallel, so that the spreading efficiency is improved, and the consensus node can receive the transaction in the fastest time;
4. and the double-layer network isolation ensures that the consensus network can normally trade and broadcast and normally block under the condition that the non-consensus network is congested. The consensus node is a little node of a block chain network node, and is characterized by being small in number of nodes, high in broadcasting speed and capable of spreading hierarchical transactions on a limited consensus layer, so that the problem that the consensus node generates a block slowly due to the fact that the broadcast data cannot be normally received all the time under the condition of network imbalance is solved.
Preferably, the first block is broadcasted to other common nodes, and each first non-common node comprises:
broadcasting the first block to other common nodes, and broadcasting a first light block of the first block to each first non-common node; wherein the first light chunk broadcasts a first chunk header for the first chunk and a transaction hash list for the first chunk;
broadcasting the first block to each second non-consensus node comprises:
finding corresponding third transactions from the transaction pool according to the transaction hash list;
restoring the first block body of the first light block according to each third transaction;
restoring the first block according to the first block head and the first block body;
the first light block is broadcast to each second non-consensus node.
Block (X) is assumed to be generated according to tx 1-tx 10;
specifically, N5 broadcasts block (x) to N1 to N4, and broadcasts block head (x), hash (tx1) to hash (tx10) to N5;
n5 finds tx1 to tx10 from the trading pool according to hash (tx1) to hash (tx 10);
n5 reducing blockbody (X) according to the found tx 1-tx 10;
n5 reducing block (X) according to block body (X), block head (X);
n5 broadcasts block (X) to n 4.
It should be understood by those skilled in the art that N5 may also broadcast block head (x), hash (tx1) to hash (tx10) to N1 to N4, and the principle of reducing block (x) by N1 to N4 is the same as that of N5, and will not be described again.
The embodiment reduces the broadcast network data volume and effectively reduces the bandwidth occupation.
Further preferably, finding out the corresponding third transactions according to the transaction hash list includes:
performing the following operations on each transaction hash of the transaction hash list:
judging whether a third transaction corresponding to the transaction hash exists in the transaction pool:
if not, caching the transaction hash;
and sending each cached transaction hash to the current node to request to acquire each missing third transaction.
Specifically, assume that n5 caches hash (tx9) and hash (tx 10);
n5 sends a hash (tx9) and a hash (tx10) to N5 to obtain tx9 and tx 10.
Further preferably, the sending each cached transaction hash to the current node to request to obtain each missing third transaction includes:
performing the following operations on each cached transaction hash:
the following operations are periodically performed: judging whether a third transaction corresponding to the cached transaction hash exists in the transaction pool: if yes, updating the transaction hash of each cache;
after the first duration, the latest each cached transaction hash is sent to the current node to request to obtain each missing third transaction.
The above embodiment introduces a waiting mechanism, n5 may periodically (e.g., 100ms) check whether tx9 and tx10 exist in the transaction pool, and if tx9 is checked, update the cached transaction hash to: hash (tx 10); after a first duration (e.g., 300ms), a hash (tx10) is sent to N5 to obtain tx 10.
The block chain network environment is complex, and the bandwidth capacity of each node is different; the absolute sequence of the transaction and the broadcast of the block cannot be guaranteed, when the non-consensus node receives the light block, the missing transaction may exist in the transaction pool, and at this time, if the non-consensus node directly requests the missing transaction from the consensus node, extra bandwidth overhead is brought. The embodiment can avoid delayed transaction reception caused by complicated and unstable network.
Preferably, the two consensus nodes communicate through protocol …/p2p/net/consensus protocol, the two non-consensus nodes communicate through protocol …/p2p/net/normal protocol, and the consensus nodes communicate with the non-consensus nodes through protocol …/p2p/net/cross protocol.
Further preferably, before the first transaction is generated by the current node or received through the rpc port, the method further comprises:
when the block chain service is started, subscribing a plurality of third non-consensus nodes;
upon receiving the second transaction through the p2p port, broadcasting the second transaction to other consensus nodes, and each first non-consensus node comprises:
and broadcasting the second transaction to other consensus nodes and each first non-consensus node when the second transaction broadcasted by the third non-consensus node is received through a proto: …/p2p/net/cross protocol or when the second transaction is received through a proto ═ …/p2p/net/consensus protocol.
A transaction may be generated by a consensus node, a non-consensus node, or a client of the user; and, when a transaction is generated by a client of a user and sent into the blockchain network, the first node to receive the transaction may be a consensus node or a non-consensus node.
The above embodiments ensure that transactions can be broadcast to consensus nodes of the consensus network as quickly as possible.
Further preferably, when the blockchain service is started, subscribing to the third non-consensus nodes includes:
when the block chain service is started, a first number of non-consensus nodes are connected through a protocol proto:/chain33/p2p/net/cross, and the non-consensus nodes are selected as a number of third non-consensus nodes for subscription according to a pre-configured subscription rule.
Those skilled in the art should understand that the subscription rule may be configured according to actual requirements, for example, configured to select a number of non-consensus nodes with the fastest response speed as a number of third non-consensus nodes for subscription, or select a number of non-consensus nodes with the closest logical distance as a number of third non-consensus nodes for subscription, and so on.
And, those skilled in the art should understand that how to discover and connect other consensus nodes when a consensus node initiates a blockchain service may be configured according to actual needs, for example, configured to connect a first number of non-consensus nodes through a protocol proto:/chain33/p2p/net/cross, guided by a built-in consensus seed node;
correspondingly, the consensus node is guided by a built-in consensus seed node and is connected with other consensus nodes through a protocol prot ocol …/p2 p/net/consensus;
correspondingly, the non-consensus node is guided by the built-in non-consensus seed node and communicates through the protocol …/p2p/net/normal protocol.
The seed nodes are divided into consensus seed nodes and non-consensus seed nodes, and the method has the advantages that:
1. for the block chain nodes configured as the consensus nodes, the nodes can quickly enter the consensus network after being started according to the guidance of the consensus seed nodes, meanwhile, other non-consensus node lists can be obtained through the non-consensus seed nodes, and certain parts of nodes are selected for subscription after being connected so as to quickly obtain transactions in the non-consensus network.
2. For the block chain nodes configured as the non-consensus nodes, the nodes can access the non-consensus network only by being guided by the non-consensus seed nodes after being started. And acquiring a plurality of consensus nodes through the consensus seed node to connect and subscribe, so as to quickly acquire transactions and blocks in the consensus network.
Preferably, the broadcasting the first transaction to other consensus nodes, and each first non-consensus node subscribing to the current node comprises:
verifying the performability of the first transaction, signing the first transaction according to the held private key when the first transaction passes the verification, broadcasting the signed first transaction to other common knowledge nodes, and subscribing each first non-common knowledge node of the current node;
broadcasting the first transaction to each second non-consensus node subscribing to the first non-consensus node, and wherein each second non-consensus node subscribing to the first non-consensus node comprises:
verifying the signed first transaction according to the public key of the current node:
when the verification is passed, broadcasting the signed first transaction to each second non-consensus node subscribed to the first non-consensus node and each second non-consensus node subscribed to the first non-consensus node;
when the verification fails, the steps of broadcasting the signed first transaction to each second non-consensus node subscribed to the first non-consensus node and subscribing to the first non-consensus node are not executed; and the number of the first and second groups,
the current node is marked as an illegal node to reject other transactions or blocks broadcast by the current node.
In the prior art, all block link points need to verify the performability of tx1 locally before being able to broadcast tx1, so that the broadcasting rate is reduced;
in the above embodiment, only N5 needs to verify the performability of tx1 (including verifying the signature of tx1, verifying whether tx1 can be correctly pre-executed, etc.) first, and when the verification is successful, pri (N5) is used to sign tx 1; after receiving the tx1 of the broadcast, the N1-N4 and N5 only need to verify whether pub (N5) can verify the tx1 signed by pri (N5), namely, verify the matching between pub (N5) and pri (N5), and when the verification is passed, broadcast tx 1; if the verification is not passed, the N5 is considered as an illegal node, and other transactions or blocks which are subsequently broadcast by the N5 are shielded.
The embodiment improves the broadcasting efficiency of the block chain network; and the blocking broadcast source can be marked in time, and the safety of the block chain network is maintained.
Fig. 2 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 2, as another aspect, the present application also provides an apparatus 200 including one or more Central Processing Units (CPUs) 201 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)202 or a program loaded from a storage section 208 into a Random Access Memory (RAM) 203. In the RAM203, various programs and data necessary for the operation of the apparatus 200 are also stored. The CPU201, ROM202, and RAM203 are connected to each other via a bus 204. An input/output (I/O) interface 205 is also connected to bus 204.
The following components are connected to the I/O interface 205: an input portion 206 including a keyboard, a mouse, and the like; an output section 207 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 208 including a hard disk and the like; and a communication section 209 including a network interface card such as a LAN card, a modem, or the like. The communication section 209 performs communication processing via a network such as the internet. A drive 210 is also connected to the I/O interface 205 as needed. A removable medium 211 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 210 as necessary, so that a computer program read out therefrom is mounted into the storage section 208 as necessary.
In particular, according to an embodiment of the present disclosure, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing any of the methods described above. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 209 and/or installed from the removable medium 211.
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 methods described in the present application.
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 (10)
1. A transaction and block broadcasting method, wherein a block chain network is configured with common nodes and non-common nodes, each of the common nodes can communicate with each other, each of the common nodes constitutes a common network, and the method is applied to the common nodes, and the method comprises:
broadcasting a first transaction to other consensus nodes when the first transaction is generated by a current node or received through an rpc port, and subscribing to each first non-consensus node of the current node for each of the first non-consensus nodes:
broadcasting the first transaction to each second non-consensus node subscribing to the first non-consensus node and each second non-consensus node subscribing to the first non-consensus node;
upon receiving a second transaction through the p2p port, broadcasting the second transaction to other consensus nodes, and each of the first non-consensus nodes, for each of the first non-consensus nodes:
broadcasting the second transaction to each of the second consensus nodes and each of the second non-consensus nodes;
broadcasting the first block to other common nodes, and each of the first non-common nodes for each of the first non-common nodes:
broadcasting the first block to each of the second non-common nodes.
2. The method of claim 1, wherein the broadcasting the first block to other co-located nodes, and wherein each of the first non-co-located nodes comprises:
broadcasting the first block to other common nodes, and broadcasting a first light block of the first block to each of the first non-common nodes; wherein the first light tile broadcasts a first tile header of the first tile and a transaction hash list of the first tile;
the broadcasting the first block to each of the second non-consensus nodes comprises:
finding corresponding third transactions from a transaction pool according to the transaction hash list;
restoring the first block body of the first light block according to each third transaction;
restoring the first block according to the first block head and the first block body;
broadcasting the first light block to each of the second non-consensus nodes.
3. The method of claim 2, wherein the finding respective third transactions from the transaction hash list comprises:
performing the following operations on each transaction hash of the transaction hash list:
judging whether a third transaction corresponding to the transaction hash exists in a transaction pool:
if not, caching the transaction hash;
sending each cached transaction hash to a current node to request retrieval of each missing third transaction.
4. The method of claim 3, wherein sending the transaction hash for each cache to the current node to request retrieval of the missing third transactions comprises:
performing the following operations on the transaction hashes for each cache:
the following operations are periodically performed: judging whether a third transaction corresponding to the cached transaction hash exists in a transaction pool: if yes, updating the transaction hash of each cache;
after a first time period, sending the latest transaction hashes of the caches to the current node to request to acquire the missing third transactions.
5. The method of claim 1, wherein two common nodes communicate via protocol …/p2p/net/consensus protocol, wherein two non-common nodes communicate via protocol ol …/p2p/net/normal protocol, and wherein the common nodes communicate via proto …/p2p/net/cross protocol.
6. The method of claim 5, wherein before the first transaction is generated by the current node or received through the rpc port, further comprising:
when the block chain service is started, subscribing a plurality of third non-consensus nodes;
broadcasting a second transaction to other consensus nodes upon receipt of the second transaction through a p2p port, and each of the first non-consensus nodes comprising:
broadcasting the second transaction to other consensus nodes and each of the first non-consensus nodes when the second transaction broadcasted by the third non-consensus node is received through a proto: …/p2p/net/cross protocol or when the second transaction is received through a proto ═ …/p2p/net/consensus protocol.
7. The method of claim 6, wherein subscribing to the third non-consensus nodes when initiating the blockchain service comprises:
when the block chain service is started, a first number of non-consensus nodes are connected through a protocol proto:/chain33/p2p/net/cross, and the non-consensus nodes are selected as a number of third non-consensus nodes for subscription according to a pre-configured subscription rule.
8. The method of claim 1, wherein broadcasting the first transaction to other consensus nodes, and wherein subscribing to each first non-consensus node of the current node comprises:
verifying the performability of the first transaction, signing the first transaction according to a held private key when the first transaction passes the verification, broadcasting the signed first transaction to other common knowledge nodes, and subscribing each first non-common knowledge node of the current node;
the broadcasting the first transaction to each second non-consensus node subscribed to the first non-consensus node, and the subscribing to each second non-consensus node of the first non-consensus node comprising:
verifying the signed first transaction according to the public key of the current node:
when the first transaction passes the verification, broadcasting the signed first transaction to each second non-consensus node subscribed to the first non-consensus node and each second non-consensus node subscribed to the first non-consensus node;
when the verification fails, the step of broadcasting the signed first transaction to each second non-consensus node subscribed to the first non-consensus node and each second non-consensus node subscribed to the first non-consensus node is not executed; and the number of the first and second groups,
the current node is marked as an illegal node to reject other transactions or blocks broadcast by the current node.
9. 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-8.
10. 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-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111661906.4A CN114358938A (en) | 2021-12-31 | 2021-12-31 | Transaction, block broadcasting method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111661906.4A CN114358938A (en) | 2021-12-31 | 2021-12-31 | Transaction, block broadcasting method, device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114358938A true CN114358938A (en) | 2022-04-15 |
Family
ID=81104752
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111661906.4A Pending CN114358938A (en) | 2021-12-31 | 2021-12-31 | Transaction, block broadcasting method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114358938A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115086320A (en) * | 2022-06-13 | 2022-09-20 | 杭州复杂美科技有限公司 | Layered block chain network, and consensus method, device and storage medium thereof |
-
2021
- 2021-12-31 CN CN202111661906.4A patent/CN114358938A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115086320A (en) * | 2022-06-13 | 2022-09-20 | 杭州复杂美科技有限公司 | Layered block chain network, and consensus method, device and storage medium thereof |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7721110B2 (en) | System and method for secure and verified sharing of resources in a peer-to-peer network environment | |
| US7620816B1 (en) | System and method for automatic selection of service provider for efficient use of bandwidth and resources in a peer-to-peer network environment | |
| US6983326B1 (en) | System and method for distributed function discovery in a peer-to-peer network environment | |
| CN109347968B (en) | Method, equipment and system for downloading data blocks of resource file | |
| CN111464630B (en) | Transaction broadcasting method, apparatus and storage medium | |
| CN107277134B (en) | Data transmission method and system based on peer-to-peer network | |
| US20060224670A1 (en) | File distribution method and client terminal implementing the same | |
| JP5805934B2 (en) | Distributed control method and apparatus using URL | |
| US20100174806A1 (en) | Data Processing Method, Apparatus And System | |
| KR20020079426A (en) | System and method to verify trusted status of peer in a peer-to-peer network environment | |
| CN112118315A (en) | Data processing system, method, device, electronic equipment and storage medium | |
| CN112261172A (en) | Service addressing access method, device, system, equipment and medium | |
| US20130185329A1 (en) | Distributed database | |
| CN108289055B (en) | Distributed real-time chat system and method based on Redis subscription service | |
| CN114358938A (en) | Transaction, block broadcasting method, device and storage medium | |
| US20130318244A1 (en) | System and method for assigning server to terminal and efficiently delivering messages to the terminal | |
| CN112055077B (en) | Block link access method, device and storage medium | |
| WO2017128713A1 (en) | Method and device for publishing subscription message | |
| CN113765774B (en) | Method, device, electronic equipment and medium for synchronizing messages in real time | |
| CN111131470B (en) | Terminal device, data processing method thereof and data processing system | |
| CN112131014A (en) | Decision engine system and business processing method thereof | |
| WO2017032110A1 (en) | Application message processing system and method, and application device | |
| CN113596105B (en) | Content acquisition method, edge node and computer readable storage medium | |
| US10334023B2 (en) | Content distribution method, system and server | |
| CN111639944B (en) | Transaction broadcasting method, apparatus 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 |