CN108305056B - Block chain-based data processing method and device and block chain node network - Google Patents
Block chain-based data processing method and device and block chain node network Download PDFInfo
- Publication number
- CN108305056B CN108305056B CN201810256936.9A CN201810256936A CN108305056B CN 108305056 B CN108305056 B CN 108305056B CN 201810256936 A CN201810256936 A CN 201810256936A CN 108305056 B CN108305056 B CN 108305056B
- Authority
- CN
- China
- Prior art keywords
- blockchain
- transaction data
- node
- network
- nodes
- 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
- 238000003672 processing method Methods 0.000 title claims abstract description 12
- 238000000034 method Methods 0.000 claims abstract description 58
- 238000003860 storage Methods 0.000 claims abstract description 21
- 230000008569 process Effects 0.000 claims description 22
- 238000004590 computer program Methods 0.000 claims description 16
- 238000012545 processing Methods 0.000 claims description 14
- 239000003999 initiator Substances 0.000 claims 1
- 230000005540 biological transmission Effects 0.000 description 19
- 238000005516 engineering process Methods 0.000 description 18
- 238000012795 verification Methods 0.000 description 18
- 230000006870 function Effects 0.000 description 14
- 238000010586 diagram Methods 0.000 description 12
- 230000007246 mechanism Effects 0.000 description 7
- 238000013507 mapping Methods 0.000 description 5
- 238000013459 approach Methods 0.000 description 4
- 230000006872 improvement Effects 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000008520 organization Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 206010000060 Abdominal distension Diseases 0.000 description 1
- 230000009471 action Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 208000024330 bloating Diseases 0.000 description 1
- 230000003139 buffering effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 239000012634 fragment Substances 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
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
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/02—Payment architectures, schemes or protocols involving a neutral party, e.g. certification authority, notary or trusted third party [TTP]
-
- 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
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/08—Payment architectures
- G06Q20/085—Payment architectures involving remote charge determination or related payment systems
- G06Q20/0855—Payment architectures involving remote charge determination or related payment systems involving a third party
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Finance (AREA)
- Computer Security & Cryptography (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses a data processing method and device based on a blockchain, a blockchain node network, a runner and a readable storage medium. The method comprises the following steps: the method comprises the steps that a blockchain node network receives transaction data to be written into a blockchain, wherein the transaction data corresponds to a blockchain identifier; determining a blockchain corresponding to the blockchain identifier from at least two blockchains according to the blockchain identifier by a blockchain node network; the blockchain node network writes the transaction data to a blockchain corresponding to the blockchain identifier. Through the technical scheme, the problem caused by bloated block chain can be solved or improved.
Description
Technical Field
The present application relates to the field of blockchain technologies, and in particular, to a blockchain-based data processing method and apparatus, a blockchain node network, a runner, and a readable storage medium.
Background
In recent years, the blockchain technology is widely spread and applied due to the remarkable characteristics of decentralization, non-tamper property, transparent process, traceability and backtracking. In the practical application process of the blockchain, massive data are usually faced, and after verification, the data are written into the maintained blockchain by the blockchain link point network to realize the function of the blockchain.
However, due to the large amount of data, the chain may be very long from the creation block of the blockchain to the current latest block, resulting in a blockchain that is too "bloated". Therefore, the method is not convenient for the block chain node network to store and transmit the block chain node network, and is also not convenient for the generation, broadcasting, verification and other works of the new block, and brings great obstacle to the application of the block chain.
Disclosure of Invention
The embodiment of the application provides a data processing method and device based on a blockchain and a blockchain link point network, which are used for solving or improving the problem caused by bloating of the blockchain in the prior art.
In one aspect, the data processing method based on the blockchain provided by the embodiment of the application comprises the following steps:
the method comprises the steps that a blockchain node network receives transaction data to be written into a blockchain, wherein the transaction data corresponds to a blockchain identifier;
determining a blockchain corresponding to the blockchain identifier from at least two blockchains according to the blockchain identifier by a blockchain node network;
the blockchain node network writes the transaction data to a blockchain corresponding to the blockchain identifier.
In another aspect, a blockchain-based data processing device provided by an embodiment of the present application is located in a blockchain link point network, including: a transaction data receiving unit, a blockchain determining unit and a transaction data writing unit, wherein:
The transaction data receiving unit is used for receiving transaction data to be written into the blockchain, and the transaction data corresponds to the blockchain identifier;
the block chain determining unit is used for determining a block chain corresponding to the block chain identifier from at least two block chains according to the block chain identifier;
the transaction data writing unit is used for writing the transaction data into the blockchain corresponding to the blockchain identifier.
In yet another aspect, an embodiment of the present application provides a blockchain link node network that maintains at least two blockchains identified by blockchain identifiers, the blockchain node network including at least two blockchain nodes, at least one of the pairs of two blockchain nodes having a distance of one hop, or at least one of the pairs of two blockchain nodes having a distance of more than one hop.
In still another aspect, an embodiment of the present application provides an operator, including: a memory, a processor and a computer program stored on the memory and executable on the processor, which when executed by the processor performs the steps of the method according to the first aspect.
In yet another aspect, an embodiment of the present application provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method according to the first aspect.
The above at least one technical scheme adopted by the embodiment of the application can achieve the following beneficial effects:
after transaction data is received, the blockchain corresponding to the identifier is determined from at least two blockchains according to the blockchain identifier corresponding to the transaction data, and then the transaction data is written into the blockchain. The scheme can "sort" a large amount of transaction data which is likely to face, find out respective attribution chains, and does not adopt a single blockchain for all data, thereby effectively reducing the bloated blockchain, being beneficial to carrying out operations such as blockchain transmission, generation, broadcasting, storage, verification and the like, and better solving or improving the problems existing in the prior art.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this specification, illustrate embodiments of the application and together with the description serve to explain the application and do not constitute a limitation on the application. In the drawings:
FIG. 1 is a schematic diagram of a blockchain organization;
FIG. 2 is a schematic diagram of a blockchain-based data processing method in accordance with an embodiment of the present application;
FIG. 3A is a schematic diagram of a data association among a plurality of transaction data;
FIG. 3B is a schematic diagram of a transaction data association in a plurality of blockchains;
FIG. 4 is a schematic diagram of a multi-layer network according to an embodiment of the present application;
FIG. 5 is a block chain based data processing apparatus according to one embodiment of the present application;
fig. 6 is a schematic structural view of an operator according to an embodiment of the present application.
Detailed Description
Before describing various embodiments of the present application fully, some basic background is described for ease of understanding. Although the blockchain technology is not long in birth time, the blockchain technology is easy to track and trace due to the remarkable characteristics of decentralization, tamper resistance and the like, so that the blockchain technology is currently ' in the way of ' in the open ' and is used in various industries. Nevertheless, the content of blockchain technology is not necessarily well known. The blockchain technology, briefly, is to load various transaction records generated on a network into each block, and each block is logically connected into a chain according to a certain rule, namely, the blockchain is formed. Thus, starting from the need for a simplified description of blockchain technology, two major segments of content can be described: firstly, organizing the structure of a block chain; and how to complete the process of the transaction data uplink.
Referring to FIG. 1, a schematic structure of a blockchain organization is shown. As shown in fig. 1, each block on the blockchain may be divided into a block and a block header according to different functions, the former is mainly used for recording transaction data information, and may contain a plurality of pieces of transaction data information, and the latter is mainly used for identifying the block and hooking other blocks. The block header contains the hash value of the last block (the hash of the parent block) and the hash value of the present block, and the present block header contains the hash value of the last block, thereby establishing the association between the present block and the last block, and the hash value of the present block is used for writing into the block header part of the next block, thereby realizing the association with the next block. Each independent block is connected through the hash data in the block header, so that a complete chain is formed, and the block chain is named. Of course, in practical applications, the block header in each block may not only include these contents, but may also include Merkle root (the value is obtained by hash value of all transaction data in the block by hash value two by two [ or possibly other manners ], and is mainly used for checking whether a transaction exists in the block), timestamp (used for recording the generation time of the block), difficulty value (used for indicating the difficulty of each block to obtain "accounting right"), random number (used for recording the answer for solving the "accounting right" problem), and so on.
The uplink operation of transaction data is more complex and more central than the organization of the blockchain itself. The formation of a blockchain as shown in fig. 1 is performed by nodes in a blockchain link point network. The blockchain point network may include a plurality of blockchain nodes that "co-assist" in collectively completing the uplink of transaction data. Firstly, when a blockchain node receives transaction data, the transaction data is broadcast to other blockchain nodes in order to be "acknowledged" by the blockchain whole network; after each blockchain node receives the transaction data, the blockchain node needs to be verified and correctly time stamped, and in order to strive for the legal account right of recording the transaction data, the blockchain node needs to be realized by solving a preset mathematical problem (namely, a workload proving mode); when a blockchain node strives for the legal accounting right through 'self effort', the blockchain node broadcasts all the transaction data with the timestamp from the last time the block is up-linked to the time before the block is up-linked, and each blockchain node checks and verifies the transaction data. After the correctness of the other block chains of the whole network are verified, the current block is uplink, and the next block uplink legal accounting right 'robbed' is entered, so that the cycle is circulated.
In understanding the basic scheme of blockchain technology, there are several points worth explaining:
one is a concept about transaction data. Transaction data, transaction records, etc. in the above process are broad, and refer not only to the business actions of completing payment and collecting money between two nodes, but also to other events with exchange value. For example, in online games, a initiates an attack event to B, and a magic event to B, but the term is also generally associated with a blockchain, that is, the transaction data is data that is to be or is willing to be processed by a blockchain link point network, as opposed to some data that is simply processed by a blockchain link point network, but does not require a direct relationship to the blockchain or to the blockchain.
And secondly, data transmission among the block chain nodes is carried out. The blockchain node network comprises a plurality of blockchain nodes, the nodes can exchange data at any time, and how to ensure the safety of the exchanged data is a problem to be considered in various data transmission technologies including blockchain technology. Within the scope of the present application, the transfer process may be generally guaranteed by a data signature technique, and the basic flow is as follows: when the node A sends a message to the node B (for example, a message is formed by transaction data), the node A adopts a hash function to carry out hash calculation on the message text, a message digest is generated, the digest is encrypted by using a private key of the node A, and the encrypted digest is used as a digital signature of the message and the message to be sent to the node B together. After the node B receives the message, a message digest is calculated from the received original message by using the same hash function as that of the node A, then the public key of the node A is used for decrypting the digital signature attached to the message, and if the two digests are the same, the node B can confirm that the digital signature is of the node A, and the message comes from the node A. For convenience and emphasis of description, the following discussion of the application will not be emphasized.
Third, other technical problems with blockchains. Since the present application will be developed around the technical solutions of the present application, technical matters having little relevance or basicity to the present application will not be mentioned in detail, and those skilled in the art should understand that the technical solutions of the present application can be implemented using the basic technical knowledge, if necessary.
Just because the blockchain technique has the specific blockchain structure and the uplink rule, the blockchain has the remarkable characteristics described above. However, as the range of network usage expands, the amount of transaction data generated based on the network increases, which results in that when the network is combined with the blockchain technology, the generated blockchain increases, each block on the blockchain contains more and more transaction data records, and the data transfer synchronization process of the blockchain node network is slower and slower, so that the further application of the blockchain technology is seriously affected. In order to solve or improve the problem existing in the prior art, the embodiment of the application provides a technical scheme of 'multi-chain parallel' and the like for data processing.
Referring to FIG. 2, a block chain based data processing method provided by the present application is shown, the method comprising: step S201: the method comprises the steps that a blockchain node network receives transaction data to be written into a blockchain, wherein the transaction data corresponds to a blockchain identifier; step S202: determining a blockchain corresponding to the blockchain identifier from at least two blockchains according to the blockchain identifier by a blockchain node network; step S203: the blockchain node network writes the transaction data to a blockchain corresponding to the blockchain identifier.
The blockchain identifier and related content cannot be narrowly understood when understanding this solution. The blockchain identifier is associated with the number of blockchains, and if there is only one blockchain, the transaction data received by the blockchain link point network will be written directly into the blockchain, and there is no room for the blockchain to be selected and determined to operate from among the blockchains, and only if there are multiple blockchains, the blockchain identifier needs to be set to distinguish between different blockchains. But still requires attention to a particular problem: the blockchain identifier for distinguishing the blockchains does not necessarily mean that a field is separately arranged in the blockchain node network for distributing and storing the blockchain identifier, and the main expression of the blockchain identifier is to distinguish different blockchains, and the distinguishing can be realized by adopting a 'dominant' blockchain identifier. For example, there is a mapping of blockchain identifiers to blockchains in a correspondence table, and the corresponding blockchain can be found using the blockchain identifiers. The distinction of blockchains may also be accomplished using "implicit" blockchain identifiers. For example, the received transaction data or some attribute of the transaction data (or the transaction data type, the attribute of the application that generated the transaction data, etc.) is computed and assigned to the corresponding blockchain based on the result of the computation. If the attribute value of a certain attribute of the transaction data is 100 or the transaction data is 100, the transaction data can be subjected to a 'surplus' operation, and if the 'modulo' is set to be 10, the transaction data can be determined to be written into the No. 0 blockchain; if the attribute value is 101 or the transaction data itself is 101, it may be determined that the transaction data is to be written to blockchain number 1, and so on. In addition, as can be seen from the above description, the blockchain identifier may be "directly indirect" in addition to "explicit" in that the blockchain identifier may be a character or a character string of an index blockchain independent of the transaction data or the blockchain, or may be a result obtained by calculating the attribute of the transaction data itself or the attribute of the transaction data, and in general, the blockchain identifier may be a blockchain index, which may be a "direct" index (e.g., the identifier in the independent mapping table established as the blockchain identifier described above), or may be an "indirect" index (e.g., the result obtained by calculating the transaction data) in which a mapping is established after a certain calculation process is performed, and the specific expression form depends on the specific manner of locating the blockchain.
According to the technical scheme, transaction data innovatively corresponds to a blockchain identifier, a blockchain is selected by utilizing the blockchain identifier, and then, certain transaction data is written into a specific blockchain, so that the prior complex and single block is changed into a long chain, a flexible and short block and a short chain, and the blockchain operation of single-hit and single-fight is changed into a collective cooperation process of separate work definition, thereby bringing a series of excellent technical effects.
First, the size of the block can be significantly reduced by using a multi-chain approach. As previously described, in the prior art, all transaction data between the previous block after the previous block is up-linked and the generation of a new block will be "packed" into the block body of one block, which will make the size of a single block extremely "bloated", whereas in the case of a multi-chain scheme, the transaction data is "categorized into chains", the data within the blocks of each chain having the same attribute, same size or same category in some respect, the amount of transaction data in that block will be reduced, thereby achieving "shrink" and "slimming" of a single block. For example, in a single chain scenario, each chunk 10M, if 10 blockchains are employed, each chunk may be as long as 1M under the same TPS (transaction per second, transaction per second, is an indicator of blockchain transaction speed) requirements.
Secondly, the memory efficiency can be effectively enhanced by adopting a multi-chain mode. Because each block is thinned, the occupied space of a single blockchain is reduced, and the storage space which is insufficient for storing a ' giant chain ' originally can be used for storing the ' shrunk blockchains, so that the small space and the ' fragment space ' in the storage device are fully utilized, and a distributed storage mode is also convenient to use. At the same time, large space and "bulk space" that would otherwise have to be occupied is used for actually storing blockchains that do require that size. Therefore, the method not only benefits the self, but also is beneficial to other blocks (blockchains), and effectively enhances the storage efficiency of the blockchain node network.
Again, the use of multiple chains can significantly improve transmission efficiency. Data exchange among the block chain nodes is carried out in the block chain node network at all times, and some data transmission is first transmission, some data transmission is retransmission after error, some data transmission is carried out, and some data transmission is associated information for verification. In the prior art, a "megablast" block chain transmission, possibly a character error, will cause a full chain error, and the transmitted block data may have additional information such as block size, height, number, etc., which all increase the transmission burden of the block link point network. The single chain is 'body building and light' in a multi-chain mode, the chain data can be transmitted after the extremely short idle of the channel is detected, and the transmission chain is small in error probability, so that the transmission chain is not required to be retransmitted in a large area even if an error occurs, and the chain is required to be retransmitted. It follows that the use of a multi-chain mechanism will significantly improve the transmission efficiency.
And moreover, the inspection efficiency can be effectively enhanced by adopting a multi-chain mode. Where there are multiple verifications in the blockchain technique, verification of the authenticity of the data will be performed when the data of the uplink is entered into the block; when block data is sent from one node to another, signature verification of the data source is faced. For example, user a sends 4 coins to user B, and then first checks whether user a has the ability to send 4 coins to ensure the authenticity of the transaction. User a may not have 4 coins in the current transaction and, when in a single long chain, may need to look up in the "cluttered" history chain whether someone else sent more than 4 coins to user a or wait for information that more than 4 coins have been sent to user a but not yet synchronized to the node, all of which would result in an extension of the verification process. If a multi-chain mode is adopted, the transaction related to the user A can be integrated into the same chain, so that historical data can be successfully found for verification; even if the information is not in the same chain, the related information can be timely obtained due to the improvement of the transmission efficiency, so that the verification time is shortened, and the aim of improving the verification efficiency is fulfilled.
The foregoing fully illustrates the good effect that the "multi-chain" mechanism brings about on blockchain technology, and in fact, the more fully functional manner of the multi-chain mechanism is "parallel", i.e., not only multi-chain, but also individual blockchains can execute in parallel. One possible "multi-chain parallel" embodiment is where smart contracts are included in the transaction data, where the blockchain link point network receives different transaction data (e.g., a first transaction data including a first smart contract and a second transaction data including a second smart contract, which may be received in the same batch or in different batches), where the different blockchain nodes in the blockchain point network each write respective transaction data to the corresponding blockchain (e.g., one blockchain node in the blockchain node network writes the first transaction data to the first blockchain and another blockchain node in the blockchain node network writes the second transaction data to the second blockchain), where the smart contracts written in the blockchain satisfy the triggering conditions, each respective smart contract is independently executed (e.g., the first smart contract automatically executes the first smart contract when the triggering conditions are satisfied, and the second smart contract automatically executes the second smart contract when the triggering conditions are satisfied). Therefore, the two blockchains respectively receive transaction data, enter the transaction data and execute the intelligent contract, are independent of each other, so that queuing and crowding are reduced, and the result is fed back in time after the intelligent contract is executed. The above is an example of intelligent combination, and even if this is not the case, the other cases need to be executed in parallel, the theory is similar, and no description is given.
The foregoing mentions the improvement in efficiency of checking by the multi-link mechanism and the improvement in efficiency of execution by the parallel mechanism on a multi-link basis, but this is merely an overall effect. The disadvantage of "cross-chain" may be exhibited when in a certain actual business process. When there is multi-chain concurrency, due to the multi-source nature of the source and multi-directional nature of the target of a transaction (see fig. 3A), complex situations may occur for some transaction data (traffic), and there may be several basic relationships between transaction data in a blockchain and other transaction data:
one is the same block located in the same blockchain, i.e., an independent block relationship, which is not associated with other transaction data, such as transaction data block 31 shown in FIG. 3B; second, a transaction data block 32 located in a different block of the same blockchain, i.e., in a cross-block relationship, as shown in FIG. 3B, which is directed to transaction data in another block below the blockchain (as shown by the arrow in the figure); third, the transaction data block 33, shown in FIG. 3B, may be sourced from a block in another blockchain (as indicated by the arrow) that is located within a block of a different blockchain, i.e., in a cross-linked relationship.
The existence of different block relationships between transaction data may make it different in terms of difficulty and speed of verification. For the first case, the verification is only performed on the block of the chain, so that the efficiency is high; for the second case, although other blocks need to be searched, the range of the block chain is not exceeded, and verification can be realized faster; for the third case, cross-chain verification is required, and the cross-chain verification requires positioning the blockchain, which may require more time depending on the manner of cross-chain. Therefore, after the scheme of multi-chain parallelism is adopted, the aspects of the generation mode of transaction data, the chain returning mode of the transaction data and the like are optimized, the cross-chain transaction is reduced as much as possible, and the troubles of cross-chain verification and waiting for verification are omitted. And will not be further described herein.
The above described blockchain-based data processing scheme is implemented and executed in a blockchain node network, as described below. Referring to fig. 4, the "pyramid" network structure is shown and is divided into a user layer, a routing node network layer and a blockchain node network layer, the blockchain node network layer is first described below, and the two subsequent layers are explained when related to the corresponding technical scheme. Within the blocklink point network layer is a blocklink point network that maintains at least two blockchains identified by blockchain identifiers, the network including a plurality of blockchain nodes. The "maintenance" of the blockchain is to complete the functional operation related to the blockchain according to the requirements of the blockchain technology, so as to realize the normal function of the blockchain. The nodes in the block link point network are connected with each other, the specific connection mode can be divided into direct jump connection and inter-jump connection, in the former mode, at least one pair of node pairs formed by every two block link points in the block link point network has a jump distance, namely, at least one node can directly reach a target node without transferring when transmitting data, and of course, the optimal mode is a full interconnection mode, namely, the full interconnection mode; in the latter way, at least one pair of nodes formed by every two block link points in the block link point network has a distance at least greater than one hop, that is, at least one node needs to reach the destination node through the transit of other nodes when transmitting data. The two modes have respective advantages and disadvantages, for the first mode, the transmission efficiency can be improved because of the 'straight jump', especially when all nodes in the block link point network adopt the mode, but the mode can increase the connection cost, and in the 'full interconnection' condition, the address of each node can be inquired, and network attack can be caused; for the second way, since most nodes adopt a 'skip' mode, although the transmission efficiency is reduced, the loose connection adopted can ensure the security and the robustness of the network.
The blockchain point network maintains a plurality of blockchains, including a plurality of blockchain nodes, which can "equitably" maintain all blockchains, robbing "accounting rights" from the plurality of nodes in a conventional manner. For example, any one of the blockchain nodes in the blockchain point network receives transaction data to be written into the blockchain, and then the blockchain node broadcasts the transaction data to all other blockchain nodes in the whole network through the one-hop distance or the multi-hop distance, so that each blockchain node can record the transaction data in a block after taking the transaction data and compete for the accounting right of the whole network on the basis of the transaction data. However, this approach may result in "waste" of computational resources because each node in the whole network performs the computation of the mathematical problem, and eventually only one node can "wish" to be paid out. To avoid the "seemingly fair, practically inefficient" mechanism hurting "whole", a variant is that specific transaction data is given to specific blockchain nodes (for the nodes, the nodes can be generated by electing other nodes, or alternatively function as the nodes according to a preset rule, or are preset according to a preset rule), the "accounting" of the blockchain is completed by the specific blockchain nodes, then the "account book" is synchronized to other blockchain nodes in the blockchain node network, that is, a mapping relation between the transaction data and the blockchain node and the blockchain is established, and the mapping relation is connected in series, that is, the transaction data corresponds to the blockchain identifier, the transaction data is forwarded to the preset blockchain node according to the blockchain identifier, and the uplink operation to the blockchain corresponding to the blockchain identifier is completed at the blockchain node. This approach avoids "competing" between block link points, but rather "each performs" and "each stands for its place". Therefore, even though the block node network comprises a plurality of block chains, each node only maintains one or a limited number of block chains, maintains own block chains, and synchronizes the latest block chains to other nodes, so that each block chain node in the whole network maintains the same block chain copy, but does not need to go to 'dye finger' by each block chain, and the efficiency of the whole block chain link point network is greatly improved.
Each node in the block link point network is said to have its own job, and although each node has its own task, each node receives its own transaction data and performs the uplink operation, this is another "equal". The actual traffic varies considerably, the number of transactions varies, and based on cost, it is further contemplated that nodes in the block link point network may be "differentiated". The specific method is that the nodes in the block chain link point network are divided into two types: one is a block chain executing node and the other is a block chain service node, and at least one node pair formed between the two types of nodes has a distance of one hop. The executing nodes keep a distance of one hop from each other, and at least one pair of the block chain service nodes keep a distance of more than one hop from each other, wherein the former is used for bearing main works of a block chain, such as generating a block and completing operations of block up-chain and the like; the latter is used for undertaking routing and the election work of the aforesaid 'predetermined blockchain node', the routing work is that the transaction data of the blockchain to be written is received by the routing work and forwarded to the blockchain executing node, and the election work is that when a certain predetermined blockchain executing node cannot work normally (or when the preset condition is met), a certain service node is changed into the executing node so as to undertake the responsibility of the original blockchain executing node.
In an optimized blockchain link point network, at least one-hop distance between a blockchain execution node and a blockchain service node ensures that transaction data is well transferred to the blockchain execution node when the blockchain service node plays a routing function. Of course, to more fully perform such functions, all blockchain executing nodes may be kept "one hop" from the corresponding blockchain service nodes according to actual requirements. In another optimized blockchain node network, because the blockchain executing nodes are at the core position in the whole network, the configuration is generally higher, and the configuration determines that the quantity of the blockchain executing nodes is impossible to be higher, therefore, the quantity of the blockchain executing nodes can be set to be less than that of the blockchain service nodes, and thus, a certain balance among cost, function and quantity is achieved.
The above describes a block link point network layer, such as the pyramid structure shown in fig. 4, which is not an isolated network, that requires the receipt of transaction data that originates at the user layer and is routed to the block link point network layer by nodes of the routing node network layer. One situation that can be appreciated by those skilled in the art is that the user layer, after generating the transaction data, directly provides the transaction data to the blockchain execution type nodes in the blockchain link point network, but this approach greatly limits the application of blockchain technology because it is "busy" or even impossible to process when faced with large amounts of data. For example, the method can be used for scenes with low real-time requirements, such as the implemented financial field and simple games. In the practical application process, the large data volume becomes trend and unavoidable reality, such as online games, which generate a large amount of transaction data in a short time, and according to the existing mode, the application scenes of extremely high real-time requirements and extremely large data volume of online games cannot be solved. Therefore, the embodiment of the application provides a feasible solution, a routing node network layer is arranged between the user layer and the block link point network layer, the routing node network layer is upwards (in the uplink message direction) connected with the block link point network layer, downwards (in the downlink message direction) connected with the user layer, transaction data are downwards received by the routing node network layer from the user layer, and are upwards transferred to the block link point network layer, the network bandwidth of the routing node network layer is good, and the accounting operation is completed without occupying a large amount of memory or hard disk space, so that the application can meet the processing requirement of big data.
Therefore, the pyramid network structure of the embodiment of the application can better solve the problems faced by the online game, and can be widely used for applications with high real-time requirements and large data volume.
Further optimizations may be made here for online gaming or similar applications. For example, in addition to transaction data, there are actually many data that do not need to be recorded in the blockchain, so that in order to make full use of the "hardware facilities" established according to the above mode, a "two-in-one" mechanism may be adopted, that is, the data processing requirements of the blockchain that need to be processed by the application of the network game, but not necessarily, are integrated in the pyramid structure described above, specifically, the file service request from the user layer is forwarded to the blockchain node network layer through forwarding of the routing node network layer, and in order to avoid the influence on the blockchain process, the file service request is processed by the service node in the blockchain node network layer, and if the processed file service request needs to return a message, the file service request is returned to the user layer through the routing node network layer. Of course, according to the thought, the service type node in the block link point network layer can not only process the file service request, but also can bear some caching operations, such as caching some graphic files needed by games for game calling, drawing and the like in the service type node, so that the processing and response of the service type node to related requests can be accelerated. Of course, another possible way is to let the routing node network layer also assume part of the buffering function.
The foregoing details various embodiments of a blockchain-based data processing method, and a blockchain node network adapted therefor. The above method can be virtualized as a blockchain-based data processing device, in the same manner as described above. Referring to fig. 5, an embodiment of a blockchain-based data processing device is shown located in a blockchain link point network, including a transaction data receiving unit U51, a blockchain determination unit U52, and a transaction data writing unit U53, wherein:
a transaction data receiving unit U51, configured to receive transaction data to be written into a blockchain, where the transaction data corresponds to a blockchain identifier;
a blockchain determination unit U52 configured to determine, from among at least two blockchains, a blockchain corresponding to the blockchain identifier according to the blockchain identifier;
and a transaction data writing unit U53, configured to write the transaction data into a blockchain corresponding to the blockchain identifier.
In addition, the embodiment of the application also provides a runner. Referring to fig. 6, there is shown a schematic structural diagram of one embodiment of an operator 60, where the operator 60 includes a memory 61, a processor 62, and a computer program stored on the memory 61 and executable on the processor 62, and the computer program implements the steps of the blockchain-based data processing method described above when executed by the processor 62. Similarly, embodiments of the present application also provide a computer readable storage medium having a computer program stored thereon, which when executed by a processor, implements the steps of the blockchain-based data processing method described above.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In one typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of computer-readable media.
Computer readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises an element.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The foregoing is merely exemplary of the present application and is not intended to limit the present application. Various modifications and variations of the present application will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. which come within the spirit and principles of the application are to be included in the scope of the claims of the present application.
Claims (21)
1. A blockchain-based data processing method, comprising:
the method comprises the steps that a blockchain node network receives transaction data of a blockchain to be written, wherein the transaction data of the blockchain to be written is data of a blockchain to be or a blockchain at will, the transaction data corresponds to blockchain identifiers, the blockchain identifiers are associated with the number of the blockchains, the blockchain node network maintains at least two blockchains corresponding to the blockchain identifiers, and each blockchain can be executed in parallel;
The blockchain node network determines the blockchain corresponding to the blockchain identifier from the at least two blockchains according to the blockchain identifier;
the blockchain node network writes the transaction data into a blockchain corresponding to the blockchain identifier, specifically comprising:
writing the transaction data into a blockchain corresponding to the blockchain identifier by one blockchain link point in the blockchain node network; the blockchain link points synchronize the blockchain to other blockchain nodes in the blockchain link point network;
or, writing the transaction data into the blockchain corresponding to the blockchain identifier by a preset blockchain point in the blockchain point network, wherein the preset blockchain point maintains the blockchain identified by the blockchain identifier corresponding to the transaction data; the predetermined blockchain link points synchronize the blockchain to other blockchain nodes in the blockchain link point network.
2. The method of claim 1, wherein the transaction data comprises smart contract data, and wherein the blockchain node network receives the transaction data to be written to the blockchain, specifically comprising:
The blockchain node network receives first transaction data comprising a first smart contract and second transaction data comprising a second smart contract;
the method further comprises the steps of:
after writing first transaction data into a corresponding blockchain in a blockchain link point network, executing a first intelligent contract when the condition of the first intelligent contract is met; and/or the number of the groups of groups,
after the blockchain node network writes the second transaction data into the corresponding blockchain, executing the second intelligent contract when the condition of the second intelligent contract is met.
3. The method according to claim 1, wherein the blockchain node network receives transaction data to be written to a blockchain, in particular comprising:
a block chain link point in the block chain node network receives transaction data to be written into a block chain;
broadcasting the transaction data to other blockchain nodes in the blockchain node network by the blockchain node through a one-hop distance;
or,
a block chain link point in the block chain node network receives transaction data to be written into a block chain;
the blockchain point broadcasting the transaction data to other blockchain nodes in the blockchain point network, the blockchain node having a distance greater than one hop from at least one of the other blockchain nodes;
Or,
the predetermined block link points in the block link point network receive transaction data of the block chain to be written, and the predetermined block link points maintain the block chain identified by the block chain identifier corresponding to the transaction data.
4. The method according to claim 1, wherein the blockchain node network is connected to a routing node network, and the blockchain node network receives transaction data to be written into a blockchain, specifically comprising:
the blockchain node network receives transaction data from a user layer routed by the routing node network according to a predetermined rule.
5. The method of claim 4, wherein the blockchain node network includes blockchain executing nodes and blockchain servicing nodes, the blockchain executing nodes are connected with the blockchain servicing nodes, the blockchain servicing nodes are connected with routing nodes in the routing node network, the blockchain node network receives transaction data to be written into the blockchain, and the method specifically includes:
the block chain service type node in the block chain node network receives transaction data from a user layer which is routed by the routing node network according to a preset rule;
A blockchain executing node in the blockchain node network receives transaction data forwarded by the blockchain service node.
6. The method according to claim 5, wherein the blockchain executing node in the blockchain node network receives transaction data forwarded by the blockchain service node, specifically comprising:
a predetermined blockchain executing node in the blockchain node network receives transaction data forwarded by a predetermined blockchain service node.
7. The method according to any one of claims 1 to 6, wherein,
the blockchain identifier includes any one of an account address of the transaction data initiator or recipient, a type of the transaction data, an attribute of an application generating the transaction data, or a result of an operation on any one thereof according to a predetermined rule.
8. The method of claim 7, wherein the transaction data from the user layer is client game event data.
9. The method of claim 7, wherein the blockchain node network receives and processes file service requests from a user layer.
10. The method of claim 9, wherein when the blockchain point network includes blockchain execution nodes and blockchain service nodes, the blockchain point network receives and processes file service requests from a user layer, specifically comprising:
A blockchain service node in the blockchain node network receives and processes file service requests from a user layer.
11. A blockchain-based data processing device, wherein the device is located in a blockchain link point network, and comprises a transaction data receiving unit, a blockchain determining unit and a transaction data writing unit, wherein:
the transaction data receiving unit is used for receiving transaction data of a to-be-written blockchain, wherein the transaction data of the to-be-written blockchain is data of a to-be-written blockchain or a willing-to-be-written blockchain, the transaction data corresponds to a blockchain identifier, the blockchain identifier is associated with the number of blockchains, at least two blockchains exist in the blockchain node network, and each blockchain can be executed in parallel;
the block chain determining unit is used for determining a block chain corresponding to the block chain identifier from at least two block chains according to the block chain identifier;
the transaction data writing unit is configured to write the transaction data into a blockchain corresponding to the blockchain identifier, and specifically includes:
writing the transaction data into a blockchain corresponding to the blockchain identifier by one blockchain link point in the blockchain node network; the blockchain link points synchronize the blockchain to other blockchain nodes in the blockchain link point network;
Or,
writing the transaction data into a blockchain corresponding to the blockchain identifier by a preset blockchain point in the blockchain point network, and maintaining the blockchain identified by the blockchain identifier corresponding to the transaction data by the preset blockchain point; the predetermined blockchain link points synchronize the blockchain to other blockchain nodes in the blockchain link point network.
12. A blockchain node network that maintains at least two blockchains that correspond to blockchain identifiers, the blockchain node network comprising at least two blockchain nodes, at least one of the pairs of two-to-two blockchain nodes having a distance of one hop, or at least one of the pairs of two-to-two blockchain nodes having a distance of at least one hop.
13. The blockchain link point network of claim 12, wherein one blockchain point in the blockchain node network maintains at least one blockchain.
14. The blockchain link point network of claim 12, wherein the blockchain node network includes blockchain executing nodes and blockchain serving nodes, the blockchain executing nodes having a distance of one hop between each other, at least one pair of blockchain serving nodes having a distance of more than one hop between each other; at least one pair of node pairs formed by the block chain executing node and the block chain service node has a distance of one hop; the block chain executing node is a node for maintaining a block chain, and the block chain service node is a node which can be changed into an executing node.
15. The blockchain link point network of claim 14, wherein the blockchain serving node is a blockchain executing node when a predetermined condition is met.
16. The blockchain link point network of claim 14, wherein the number of blockchain executing nodes is less than the blockchain servicing nodes.
17. The blockchain link point network of claim 14, wherein the blockchain servicing node is configured to receive transaction data to be written to a blockchain and route to the blockchain execution node.
18. The blockchain link point network of claim 14, wherein the blockchain service node is further configured to receive and process file service requests from a user layer.
19. The block link point network of claim 12, wherein,
the blockchain node network is connected with a routing node network, the routing node network receives transaction data from a user layer and routes the transaction data to the blockchain node network, and the routing node network also receives feedback data from the blockchain node network and routes the feedback data to the user layer.
20. An operator, comprising: memory, a processor and a computer program stored on the memory and executable on the processor, which when executed by the processor, performs the steps of the method according to any one of claims 1 to 10.
21. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, implements the steps of the method according to any one of claims 1 to 10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810256936.9A CN108305056B (en) | 2018-03-27 | 2018-03-27 | Block chain-based data processing method and device and block chain node network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810256936.9A CN108305056B (en) | 2018-03-27 | 2018-03-27 | Block chain-based data processing method and device and block chain node network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108305056A CN108305056A (en) | 2018-07-20 |
| CN108305056B true CN108305056B (en) | 2023-11-10 |
Family
ID=62847774
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810256936.9A Active CN108305056B (en) | 2018-03-27 | 2018-03-27 | Block chain-based data processing method and device and block chain node network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108305056B (en) |
Families Citing this family (40)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110807203B (en) * | 2018-08-06 | 2022-03-01 | 中国电信股份有限公司 | Data processing method, service operation center platform, system and storage medium |
| CN109658074A (en) * | 2018-08-09 | 2019-04-19 | 杭州复杂美科技有限公司 | A kind of storage of data and read system and method, equipment and storage medium |
| HK1257468A2 (en) * | 2018-08-09 | 2019-10-18 | 707 Ltd | A tag chain blockchain system |
| CN109240826B (en) * | 2018-08-15 | 2020-10-23 | 泰链（厦门）科技有限公司 | Method for allocating computing resources when nodes share computing equipment in multi-block chain network |
| CN109285005A (en) * | 2018-08-16 | 2019-01-29 | 北京京东尚科信息技术有限公司 | Method for dividing and processing, device, block chain node and the storage medium of block chain |
| CN110868440B (en) * | 2018-08-28 | 2021-03-16 | 傲为信息技术(江苏)有限公司 | Block chain male chain |
| CN109224447A (en) * | 2018-08-31 | 2019-01-18 | 广州矩阵信息科技有限公司 | The block chain library CellLink and computer equipment based on C# |
| CN109167660B (en) * | 2018-09-07 | 2021-05-14 | 腾讯科技（深圳）有限公司 | Method and device for electing representative node equipment, computer equipment and storage medium |
| CN109347917A (en) * | 2018-09-14 | 2019-02-15 | 北京沃杰知识产权有限公司 | Block chain data common recognition processing method, system, storage medium and electronic equipment |
| CN109274738B (en) * | 2018-09-14 | 2021-12-07 | 百度在线网络技术（北京）有限公司 | Control method and device for block production node |
| CN109395393B (en) * | 2018-09-29 | 2022-03-04 | 杭州复杂美科技有限公司 | Game deployment method based on parallel chain, game method, game device and storage medium |
| CN109377244B (en) * | 2018-10-24 | 2022-04-15 | 武汉珞樱联创信息科技有限公司 | Food fast traceability system and method based on multi-chain interconnection block chain network |
| CN113283905A (en) * | 2018-10-26 | 2021-08-20 | 创新先进技术有限公司 | Data storage and acquisition method and device based on block chain |
| CN109408595B (en) * | 2018-10-26 | 2020-08-11 | 全链通有限公司 | Block chain accounting method, device and computer readable storage medium |
| CN109286678B (en) * | 2018-10-30 | 2021-06-11 | 刘国勋 | Fully decentralized and closed-loop blockchain group ecosystem and readable storage medium |
| CN109462505B (en) * | 2018-11-12 | 2021-07-30 | 上海点融信息科技有限责任公司 | Method and apparatus for implementing cross-link communication between multiple blockchain networks |
| CN109274692B (en) * | 2018-11-14 | 2021-03-16 | 众安信息技术服务有限公司 | Method and device for identifying malicious nodes of block chain network |
| US20200160326A1 (en) | 2018-11-15 | 2020-05-21 | Paypal, Inc. | System and method for optimizing data writing to a blockchain |
| CN109583892A (en) * | 2018-11-21 | 2019-04-05 | 安徽高山科技有限公司 | A kind of random number selecting method in block chain |
| CN110060153B (en) | 2018-11-27 | 2020-11-17 | 创新先进技术有限公司 | Data evidence storage method and system based on multiple block chain networks |
| CN110020945B (en) * | 2018-11-27 | 2020-10-30 | 创新先进技术有限公司 | Data reading method and system based on multiple block chain networks |
| CN110060152B (en) * | 2018-11-27 | 2020-10-30 | 创新先进技术有限公司 | Data reading method and system based on multiple block chain networks |
| CN111027970B (en) * | 2018-12-07 | 2024-02-23 | 深圳市智税链科技有限公司 | Authentication management method, device, medium and electronic equipment of block chain system |
| CN109508565B (en) * | 2018-12-29 | 2021-04-09 | 西安纸贵互联网科技有限公司 | Account book accounting method of block chain network with multi-chain sharing computing power |
| CN111507706B (en) * | 2019-01-31 | 2024-04-26 | 华为技术有限公司 | Method, device, computer equipment and storage medium for browsing and storing data |
| CN110321720A (en) * | 2019-05-17 | 2019-10-11 | 杭州亦笔科技有限公司 | A kind of across the chain interaction of isomery and authentication method of block chain |
| CN110213266B (en) * | 2019-05-31 | 2021-10-22 | 联想(北京)有限公司 | Block chain cross-chain information processing method and electronic equipment |
| CN110189465B (en) * | 2019-06-13 | 2020-12-25 | 北京瑞策科技有限公司 | Random lottery method and equipment by means of block chain |
| CN110223440B (en) * | 2019-06-13 | 2020-10-02 | 北京瑞策科技有限公司 | Random number shaking method and equipment for application block chain |
| CN110443710B (en) * | 2019-08-02 | 2022-06-07 | 中国工商银行股份有限公司 | Block chain system and method for batch signature |
| CN111460489B (en) * | 2019-12-09 | 2023-06-06 | 重庆锐云科技有限公司 | IPFS-based block chain customer perpetual storage method |
| CN111212126B (en) * | 2019-12-27 | 2023-05-26 | 百度在线网络技术（北京）有限公司 | Data transmission method, device, equipment and medium of block chain network |
| CN111292192A (en) * | 2020-02-18 | 2020-06-16 | 杭州复杂美科技有限公司 | Transaction parallel execution method, device and storage medium |
| CN111400399B (en) * | 2020-03-04 | 2023-11-14 | 链农(深圳)信息科技有限公司 | Ledger synchronization method, device and hardware equipment of blockchain system |
| CN111901350B (en) * | 2020-07-30 | 2022-10-14 | 平安科技（深圳）有限公司 | Block chain system, data processing method, computer device and storage medium |
| CN112199445B (en) * | 2020-11-11 | 2023-06-23 | 山西特信环宇信息技术有限公司 | Hierarchical architecture of cone block chain |
| CN112788108A (en) * | 2020-12-29 | 2021-05-11 | 深圳前海微众银行股份有限公司 | Cross-block-chain distributed message processing method, platform and storage medium |
| CN113360504B (en) * | 2021-06-22 | 2023-08-15 | 东北大学 | Connection query optimization method based on multi-block chain environment |
| CN114255020A (en) * | 2021-12-20 | 2022-03-29 | 深圳壹账通智能科技有限公司 | Block chain transaction processing method, device, equipment and storage medium based on multiple chains |
| CN114757777A (en) * | 2022-04-29 | 2022-07-15 | 蚂蚁区块链科技(上海)有限公司 | Optimal link selection method and device for block chain and electronic equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101827421A (en) * | 2010-03-09 | 2010-09-08 | 北京交通大学 | DSR cooperative routing method based on channel state information and router |
| CN106682984A (en) * | 2016-10-27 | 2017-05-17 | 上海亿账通区块链科技有限公司 | Block chain-based transaction business processing method and system |
| CN107079058A (en) * | 2016-12-23 | 2017-08-18 | 深圳前海达闼云端智能科技有限公司 | The business of block chain node performs method, device and node device |
| CN107248076A (en) * | 2017-06-24 | 2017-10-13 | 北京天德科技有限公司 | A kind of core algorithm of the double-chain block chain the Internet model merchandised across chain |
| CN107330786A (en) * | 2017-05-19 | 2017-11-07 | 杭州云象网络技术有限公司 | A kind of block chain network node communication method based on weight |
-
2018
- 2018-03-27 CN CN201810256936.9A patent/CN108305056B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101827421A (en) * | 2010-03-09 | 2010-09-08 | 北京交通大学 | DSR cooperative routing method based on channel state information and router |
| CN106682984A (en) * | 2016-10-27 | 2017-05-17 | 上海亿账通区块链科技有限公司 | Block chain-based transaction business processing method and system |
| CN107079058A (en) * | 2016-12-23 | 2017-08-18 | 深圳前海达闼云端智能科技有限公司 | The business of block chain node performs method, device and node device |
| CN107330786A (en) * | 2017-05-19 | 2017-11-07 | 杭州云象网络技术有限公司 | A kind of block chain network node communication method based on weight |
| CN107248076A (en) * | 2017-06-24 | 2017-10-13 | 北京天德科技有限公司 | A kind of core algorithm of the double-chain block chain the Internet model merchandised across chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108305056A (en) | 2018-07-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108305056B (en) | Block chain-based data processing method and device and block chain node network | |
| CN107368259B (en) | Method and device for writing service data into block chain system | |
| CN110442652B (en) | Cross-chain data processing method and device based on block chain | |
| CN109242685B (en) | Block chain-based consensus and verification method and device | |
| CN107464112B (en) | Transaction management method and system based on block chain | |
| CN109508982B (en) | Random parallel Byzantine fault-tolerant consensus method of block chain main chain and parallel multiple sub-chains | |
| US11228570B2 (en) | Safe-transfer exchange protocol based on trigger-ready envelopes among distributed nodes | |
| CN110493148B (en) | Block processing, block consensus and block synchronization method and device | |
| CN111461723B (en) | Data processing system, method and device based on block chain | |
| CN108804706B (en) | Block chain data processing method, device, equipment and storage medium | |
| CN111681003A (en) | Resource cross-chain transfer method and device, computer equipment and storage medium | |
| CN109118230B (en) | Information processing method and device based on block chain | |
| WO2022156574A1 (en) | Blockchain-based method and apparatus for data processing, device, and readable storage medium | |
| CN111711526B (en) | Method and system for consensus of block chain nodes | |
| US20220156726A1 (en) | Blockchain-based supply chain payment network | |
| CN111552991A (en) | Block chain transaction method and device | |
| CN111814156A (en) | Data acquisition method, device and equipment based on trusted equipment | |
| CN110930152A (en) | Data processing method based on block chain and related equipment | |
| KR20200140094A (en) | Delivery system based on blockchain and the operation method thereof | |
| CN112015822B (en) | Block chain data deleting method and device | |
| CN113132459B (en) | Distributed storage method, system, storage medium, information data processing terminal | |
| CN110225110B (en) | Method and device for splitting block chain group | |
| KR102221925B1 (en) | Method for performing mining in parallel with machine learning and method for supproting the mining, in a distributed computing resource shring system based on block chain | |
| KR20170099152A (en) | Method and server for registering stockholder's list and recording transfer of stock ownership | |
| CN112765681B (en) | Block distributed block chain generation method, storage medium and electronic device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 100094 1301, building 4, area 4, courtyard 81, Beiqing Road, Haidian District, Beijing Applicant after: Beijing LANYA Box Technology Co.,Ltd. Address before: 100097 Room 303, 3rd floor, building 1, No. 25, lantianchang South Road, Haidian District, Beijing Applicant before: SOUYOU NETWORK TECHNOLOGY (BEIJING) Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |