CN110839056B - Data processing method and device based on block chain and node network - Google Patents

Data processing method and device based on block chain and node network Download PDF

Info

Publication number
CN110839056B
CN110839056B CN201810945703.XA CN201810945703A CN110839056B CN 110839056 B CN110839056 B CN 110839056B CN 201810945703 A CN201810945703 A CN 201810945703A CN 110839056 B CN110839056 B CN 110839056B
Authority
CN
China
Prior art keywords
node
network
node network
processing result
block chain
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
Application number
CN201810945703.XA
Other languages
Chinese (zh)
Other versions
CN110839056A (en
Inventor
谢成鸿
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Lanya Box Technology Co ltd
Original Assignee
Beijing Lanya Box Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Lanya Box Technology Co ltd filed Critical Beijing Lanya Box Technology Co ltd
Priority to CN201810945703.XA priority Critical patent/CN110839056B/en
Publication of CN110839056A publication Critical patent/CN110839056A/en
Application granted granted Critical
Publication of CN110839056B publication Critical patent/CN110839056B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/14—Session management
    • H04L67/141—Setup of application sessions
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
    • A63F13/30—Interconnection arrangements between game servers and game devices; Interconnection arrangements between game devices; Interconnection arrangements between game servers
    • A63F13/35—Details of game servers
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
    • A63F13/70—Game security or game management aspects
    • A63F13/79—Game security or game management aspects involving player-related data, e.g. identities, accounts, preferences or play histories
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/131—Protocols for games, networked simulations or virtual reality
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F2300/00—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game
    • A63F2300/50—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game characterized by details of game servers
    • A63F2300/53—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game characterized by details of game servers details of basic data processing
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F2300/00—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game
    • A63F2300/50—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game characterized by details of game servers
    • A63F2300/55—Details of game data or player data management
    • A63F2300/5546—Details of game data or player data management using player registration data, e.g. identification, account, preferences, game history

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Hardware Design (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • General Business, Economics & Management (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The application discloses a data processing method and device based on a block chain, a block chain link point network, an operator and a readable storage medium. The method comprises the following steps: the node network processes the data processing request by using a functional program to obtain a processing result, wherein the functional program is obtained by the node network from a distributed resource storage system according to a service ID, and the service ID is contained in a connection request for establishing connection between the terminal equipment and the node network, which is received by the node network; the node network verifies the processing result to be verified and stores the processing result passing the verification; and after receiving a preset instruction, the node network writes the processing result to be stored into a block chain corresponding to the node network. Through the technical scheme, the problem that the block chain TPS cannot meet the high-frequency interaction requirement in the high-frequency data processing process can be solved or improved.

Description

Data processing method and device based on block chain and node network
Technical Field
The present application relates to the field of block chain technologies, and in particular, to a data processing method and apparatus based on a block chain, a block chain node network, an operator, and a readable storage medium.
Background
In recent years, the block chain technology has been widely spread and applied due to its obvious characteristics of decentralization, non-tamper-ability, transparent process, traceability, and the like. In the actual application process of the blockchain, a large amount of transaction data is usually encountered, and after the transaction data is verified, the transaction data is written into the blockchain by the blockchain network so as to realize the function of the blockchain.
However, when processing massive data, the blockchain (especially public chain) is susceptible to processing capacity bottlenecks, which affect the "landing" of the blockchain technique. For example, in a current "royal glory" network game with a relatively hot fire, there is a high-frequency interaction between a terminal device operated by a player and a game server network on the network side: the player plays a ' royal glory ', the average number of interactions between the terminal equipment and the server reaches 3 times per second, the average number of interactions between the terminal equipment and the server reaches 7 times per second, and playing a ' Multiplayer Online Battle sports game ' (Multiplayer Online Battle sports game) '. However, when data generated by high frequency interactive behaviors is processed, the current online game adopting the blockchain technology (public chain) is "unable to do so", and the advancing development speed is very slow, even if the game network is deployed by adopting the most advanced EOS (blockchain 3.0 era), after a user pays GAS (fuel cost required by public chain to execute transaction), the TPS (Transactions Per Second) of the online game can only reach 2 times Per Second on average, and the requirement of real application on the TPS cannot be met at all. In the prior art, various ways of increasing the TPS times exist to improve the embarrassment, but the effect is little, the actual requirement cannot be met, the wide application of the block chain technology is prevented, and the situation is more prominent particularly under the scene of high-frequency interactive behaviors such as online games.
Disclosure of Invention
The embodiment of the application provides a data processing method and device based on a block chain, a node network and the like, which are used for solving or improving the problem that a block chain TPS in the prior art cannot meet the requirement of high-frequency interaction.
On one hand, the data processing method based on the block chain provided by the embodiment of the application comprises the following steps:
the node network processes the data processing request by using a functional program to obtain a processing result, wherein the functional program is obtained by the node network from a distributed resource storage system according to a service ID, and the service ID is contained in a connection request for establishing connection between the terminal equipment and the node network, which is received by the node network;
the node network verifies the processing result and stores the processing result passing the verification;
and after receiving a preset instruction, the node network writes the stored processing result into a block chain corresponding to the node network.
On the other hand, the node network provided in the embodiment of the present application includes: one or more logical nodes, a plurality of supervisory nodes, and a plurality of storage nodes, wherein:
the logic node is used for processing the data processing request by using the function program according to the function program obtained by the service ID from the distributed resource storage system, obtaining a processing result and sending the processing result to the monitoring node for verification, wherein the service ID is contained in a connection request for establishing connection between the terminal equipment and the node network received by the node network; after the monitoring node verifies the processing result, writing the processing result passing the verification into the storage node; after receiving a preset instruction, writing the stored processing result into a block chain associated with the node network;
the supervision node is used for verifying the processing result needing to be verified;
and the storage node is used for storing the processing result passing the verification.
In another aspect, an embodiment of the present application provides a method for processing online game data, where the method includes:
the method comprises the steps that terminal equipment sends a login request to a guide node server in a network game server network, wherein the login request comprises a game ID and a player ID;
the guide node server transmits the login request to a central node server in a network game server network;
the central node server distributes servers in a network game server network to the terminal equipment as a logic node server and a supervision node server, and feeds back the distributed logic node server to a guide node server so that the guide node server can synchronize the information of the logic node server to the terminal equipment; and issuing a random number to the logic node server;
the logic node server acquires the logic script code of the game from a distributed resource storage system according to the game ID;
the terminal equipment sends disconnection information to the guide node server so as to disconnect the connection with the guide node server and establish long connection with the logic node server;
the logic node server reads the player data of the player from a block chain serving the network of the network game server according to the player ID, and processes a data processing request according to the player data by using a logic script code to obtain the current data of the player; the current data of the player is bound with the random number and then is sent to a supervision node server in the network of the network game server for verification;
the supervision node server verifies the current data of the player bound with the random number, and sends confirmation and signature information to the logic node server after the verification is passed;
when the confirmation and the signature information received by the logic node server meet the preset conditions, the logic node server stores the confirmation and the signature information to a storage node server in the network of the network game server; and after receiving a preset instruction, the logic node server writes the stored current data of the player into a block chain serving the network of the network game server.
In 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, the computer program, when executed by the processor, implementing the steps of the method according to the first aspect.
In yet another aspect, the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps of the method according to the first aspect.
The embodiment of the application adopts at least one technical scheme which can achieve the following beneficial effects:
according to the technical scheme provided by the embodiment of the application, the processing results of the data processing request are verified and stored in the node network range, and at least two processing results are written into the corresponding block chains of the node network after a preset instruction is received. Compared with the prior art, the block chain write operation method has the advantages that the block chain write operation method does not directly and immediately write a processing result into the block chain corresponding to the node network after each processing result is generated, but stores the processing result in the node network firstly, and ensures that the stored processing result can obtain partial or all effects of the block chain write chain through a verification mechanism, and only writes the accumulated processing result or a part of the accumulated processing result into the block chain corresponding to the node network after a preset instruction is received, so that the number of block chain write operation times is smaller than the number of the processing results, the block chain TPS requirement degree is reduced, and the block chain write operation method also has the effect similar to that of writing the block chain every time. In addition, under the same condition, the embodiment of the application reduces the writing times of the block chain, avoids the consumption of GAS and improves the economic benefit. Moreover, the node network in the embodiment of the present application is a brand new network interfacing with the blockchain, and is not limited by the bottleneck of the write-in capability of the blockchain, and in addition, the program code for processing the data processing request comes from the distributed resource storage system, rather than from the blockchain, so that a third party can freely deploy the data processing network, which is beneficial to enhancing the flexibility, expansibility and universality of such processing systems.
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 application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
FIG. 1 is a schematic diagram of a blockchain organization;
FIG. 2a is a schematic diagram illustrating an embodiment of a block chain-based data processing method according to the present application;
FIG. 2b is a schematic diagram of a connection relationship between a node network and an external component according to the present application;
FIG. 3 is a schematic diagram of a node network according to the present application;
FIG. 4a is a flowchart of a block chain-based network game data processing method according to the present application;
FIG. 4b is a signaling diagram of the present application for block chain-based network game data processing;
FIG. 4c shows a scenario of a network game (LAYA cloud network);
FIG. 5 is a schematic block diagram of an embodiment of a data processing apparatus according to the present invention;
fig. 6 is a schematic structural diagram of an embodiment of the runner of the present application.
Detailed Description
Before fully describing the various embodiments of the present application, some basic background will be presented for ease of understanding. Although the block chain technology has a short birth time, the block chain technology has the remarkable characteristics of decentralization, tamper resistance, easy tracking and backtracking and the like, so that the block chain technology is 'fantod' at present and has the climax of application in various industries. However, the contents of the block chain technique are not necessarily known to all people. The block chain technology is simply to load various transaction records generated on the network into each block, and the blocks are logically connected into a chain according to a certain rule, namely, a block chain is formed. Therefore, for the purpose of briefly introducing the block chain technique, the following description is divided into two major parts: the first is the organization structure of the block chain; the second is how to complete the process of transaction data uplink.
Referring to fig. 1, a schematic structure of a blockchain organization is shown. As shown in fig. 1, each block in the blockchain can be divided into a block and a block header according to different functions, the block is mainly used for recording transaction data information and can contain multiple pieces of transaction data information, and the block is mainly used for identifying the block and linking other blocks. The block header comprises the hash value of the previous block (parent block hash) and the hash value of the block, the block header comprises the hash value of the previous block, so that the connection between the block and the previous block is established, and the hash value of the block is used for writing the block header part of the next block, so that the connection with the next block is realized. The hash data in the block head is connected with each independent block, 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 contain these contents, but also contain Merkle root (the value is obtained by performing a two-by-two step hash calculation on the hash values of all transaction data in the block [ or may be obtained in other ways ]) and is mainly used for verifying whether a certain transaction exists in the block), timestamp (for recording the generation time of the block), difficulty value (for indicating the difficulty of acquiring "accounting right" for each block), random number (for recording the answer to "accounting right" puzzle), and so on.
The uplink operation of transaction data is more complex and more core than the organizational structure of the blockchain itself. The block forming block chain as shown in fig. 1 is performed by nodes in a block-link point network. A blockchain node network may include a plurality of blockchain nodes that "assist" with each other to collectively complete the uplink of transaction data. Firstly, after a block chain node receives transaction data, in order to enable the transaction data to obtain the 'acknowledgement' of the whole block chain network, the transaction data is broadcasted to each other block chain node; after each block link point receives the transaction data, the transaction data is verified and correctly stamped, and in order to strive for recording the legal accounting right of the transaction data, the block link point needs to be realized by solving a preset 'mathematical problem' (namely a workload proving mode); when a certain block chain node strives for the legal accounting right through self-effort, all the transaction data with time stamp from the last block chain loading to the block before the block finishes chain loading are broadcasted to the whole network, and the transaction data are checked and verified by each block chain link point. After the other block chains in the whole network verify the correctness, the uplink of the current block is realized, and the 'robbing' of the legal accounting right of the next block uplink is entered, so that the process is circulated.
It is due to the block chain technology having the above-mentioned specific block chain structure and uplink rule that the block chain has the above-mentioned significant features. However, as the network usage range is expanded, the transaction data volume generated based on the network is larger and larger, which will result in that when the network is combined with the blockchain technology, the generated blockchain is longer and longer, each block on the blockchain contains more and more transaction data records, and at the same time, the massive data processing is still faced, which results in that the data transfer synchronization process between the blockchain network itself and the network and other node networks is slower and slower, and further application of the blockchain technology is seriously affected. In order to solve or improve the problem in the prior art, the embodiments of the present application propose a new technical solution to perform data processing.
Referring to fig. 2a, this figure shows a block chain-based data processing method provided in the present application, where the method includes: step S201: the node network processes the data processing request by using a functional program to obtain a processing result, wherein the functional program is obtained by the node network from a distributed resource storage system according to a service ID, and the service ID is contained in a connection request for establishing connection between the terminal equipment and the node network, which is received by the node network; step S202: the node network verifies the processing result to be verified and stores the processing result passing the verification; step S203: and after receiving a preset instruction, the node network writes the processing result to be stored into the block chain corresponding to the node network.
Through the foregoing technical solutions, it can be seen that the data processing method based on a blockchain in the embodiment of the present application relates to a main body such as a terminal device, a node network, a distributed resource storage system, and a blockchain (external chain), and each part is briefly introduced with reference to the schematic diagram shown in fig. 2b, and then a data flow of each step is described in detail. In fig. 2b, the terminal device is controlled by a user who operates various services, for example, in a network game, the terminal device is a mobile phone operated by a player playing the network game, and of course, the terminal device itself may also be embodied as various information processing devices such as a PC terminal and an iPAD, as long as it can be connected to a node network and complete corresponding service functions through interaction with the node network, and the specific form of the terminal device is not particularly limited in the embodiment of the present application. In addition, in a service processing process, the number of terminal devices may be more or less according to actual service conditions, but these devices are not isolated entities, and can implement interactive behaviors such as message communication, data transmission and the like through a node network. The distributed resource storage system is an open (data can be uploaded and downloaded, and is not closed), open (data can be inquired by a third party or other users according to needs), transparent storage platform, and allows the third party to store the developed functional programs on the storage platform and provide downloading services for clients (users) of terminal equipment. The distributed resource storage System may be embodied in various forms, such as an IPFS (internet File System), a Content Delivery server CDN (Content Delivery Network), a Network disk, and a cloud storage. For convenience of description, the IPFS is described as an example, and as another important part of the node network connection, the IPFS is a distributed protocol of content addressable, versioned, peer-to-peer hypermedia, and can implement permanent, decentralized saving and sharing of files, and the part is placed with various functional programs for implementing services, such as a script program in a network game. When the node network needs to acquire the functional programs of the corresponding services, the functional programs can be downloaded from the node network or actively transmitted to the node network by the IPFS. Because the IPFS has higher independence, the third-party development platform can develop an independent service program of the third-party development platform and then deploy the independent service program on the IPFS for the user of the terminal equipment to use through the node network. Located between the terminal equipment and the IPFS is a node network, and the node network bears the "burden" of implementing the embodiment of the present application: the method comprises the steps of receiving a service ID sent by terminal equipment, acquiring a function program (module) corresponding to the service ID from an IPFS according to the service ID, and processing a data processing request by using the function program (module) to acquire a processing result; after the processing results are obtained, since the processing results may be generated by different nodes in the node network, and some nodes may have malicious behaviors such as counterfeiting, tampering, and the like, in order to avoid this situation, the processing results need to be verified, and only the processing results that pass the verification, for example, the processing results confirmed by the nodes in most of the node networks, can be stored by the node network. When a certain condition is satisfied, for example, the user of the current service terminates the processing of the service, the node network writes the processing data into the block chain connected with the node network.
In understanding the above technical solution of the present application, the following points need to be noted: one is the internal composition of the nodal network. It goes without saying that the node network has a plurality of nodes therein, but how each node functions and functions, how the nodes are classified, split, and specifically operated, does not constitute a limitation to the present application, and as long as it(s) can complete the steps mentioned in the above technical solutions of the present application, it can be implemented in any technically realizable manner, and it is not necessary to pay attention in the above embodiments of the present application. The second is the problem of the operation mechanism of the block chain (external chain) itself. Although the processing result is finally written into the blockchain connected to the node network in the embodiment of the present application, how to specifically complete the conventional operations of the blockchain, such as writing and verifying the blockchain, is not described in detail in the present application, and those skilled in the art can understand the basic description of the blockchain in combination with the foregoing description. Similarly, there is no limitation on the specific properties of the blockchain. Since the number of terminal devices connected into the node network is necessarily large, and may be hundreds, thousands or tens of thousands, it is impossible for each terminal device to have a blockchain that serves only its own, and therefore, the terminal devices may share a blockchain, and how many terminal devices or node networks are shared for each common blockchain depends on the actual local network situation. And thirdly, the problem of data processing. After the node network obtains the functional program from the distributed resource storage system, the functional program is used for data processing, and the problems of which data are specifically processed, how the data are processed, how the processed data belong to or respond to and the like can be configured and set in advance by the functional program. In general, in a service implementation process, a client of a terminal device may send a data processing request as long as there is a data processing requirement, the request is used as an input of a "function program", and the function program may operate according to a pre-configured or designed program mode after receiving the "input", so as to implement processing on the data processing request, so as to obtain a processing result. The results of this treatment will then be subjected to two progressive split screens: the first level is the verification, storage, split selection. There may be many data processing requests initiated by the terminal device client, and the destination of the processing result of each data processing request may also be various, for example, some processing results will be sent to a client on another terminal device participating in the same service with the terminal device client, some processing results need to be sent to the client on another terminal device, and the results may also need to be scored (saved), such as those with a final locality or those needing to be saved according to a predetermined arrangement (collectively referred to as processing results that need to be saved), and the processing results to be saved will be verified. In this way, the node network sends all or a part of the processing results to other nodes in the node network for verification according to the actual situation, and the processing results passing the verification are stored by the node network. During specific storage, the following characteristics of the stored processing result are ensured through various mechanisms: the single-point risk (for example, the same processing result is stored in a plurality of nodes simultaneously through a distributed mode), the recovery (when the result of one node is damaged, the recovery can be carried out through other nodes), the falsification is avoided (when the data is read out, the identity verification can be carried out on the read data), and the like. After the node network receives a predetermined instruction, the processing result stored in the node network faces an action of writing or not writing the block chain, that is, the second-level offloading selection. For the block chain needing to be written, the node network reads the block chain from the node network stored previously, and the writing operation is performed according to the block chain operation mode mentioned above at the second point. It can be seen that the processing results may have a two-degree screening of whether verification, storage within the node network is required and whether writing to the blockchain is required, thus forming three gradients of hierarchical data.
To more clearly illustrate the above data processing situation, the following description will take the client A, B of two terminal devices as an example of the network chess: after the long connection is established at the client A, B, the two parties can start the network chess playing game. When the client A plays the chess, the chess pieces on the movable chessboard are moved, and each time a chess piece is moved, the information is sent to the node network in the form of a data processing request, after the node network receives the request, the information is processed according to a function program preset by the network chess game (for example, corresponding movement is carried out on the basis of the original chess pieces, the chess game situation is judged, the integral of both parties is increased and decreased, the time from the last game to the current game is recorded, and the like), the processing result is sent to the client B, and under certain preset conditions, the result of the step can be stored (for example, the step is just one step for indicating the local game success of the client A), at the moment, other nodes in the node network verify the result, and after the verification is passed, the result is stored. The client A, B may play the next round, and so on. When the client A, B no longer wants to play the network game, it may send an instruction to terminate the game, and after receiving the instruction, the node network writes the stored processing results of each game or the accumulated processing results of the last game into the uplink of the block chain.
The technical scheme is a novel scheme for solving the bottleneck of the block chain, and compared with the prior art, the technical scheme can achieve a series of excellent technical results.
First, since the above-mentioned embodiment does not directly and immediately write a data processing request into the block link corresponding to the node network after the data processing request is processed and a processing result is generated, but stores the data in the node network and ensures that the stored processing result can have the characteristics of non-tamper property, distribution and the like of the block link without centralization through the verification mechanism, the accumulated processing result or a part of the accumulated processing result is written into the block link corresponding to the node network after a predetermined instruction is received. On the premise of not discarding the inherent advantages of the blockchain, the method ensures that the number of times of the blockchain write operation is necessarily less than the number of actual processing results, so that the requirement on the blockchain write operation (TPS) is reduced, and thus, the node network does not need to spend longer time waiting for the response of the blockchain any more, so that the data processing efficiency is improved to a greater extent, and the user experience of a user positioned at the terminal equipment side is also obviously improved.
Secondly, before the predetermined instruction is reached, the above-mentioned embodiment of the present application performs the read-write operation of the processing result data only in the range of the node network, and writes the processing result in the node network into the block chain after the predetermined instruction is received, so that it can be seen that, in this embodiment, taking the arrival or non-arrival of the "predetermined instruction" as a boundary, the "logical interaction data" operation between the terminal device and the node network, and each node in the node network is effectively separated from the "asset data" operation between the node network and the block chain, thereby effectively breaking away the bottleneck limitation of the block chain write-read operation on the whole network.
Third, in the prior art, a handling charge (GAS) needs to be paid every time a block chain "uplink" operation is performed, but in the above embodiment of the present application, under the condition that the same or better overall technical effect is ensured, write-in and read operations to the block chain can be significantly reduced, so that the number of times of GAS payment is reduced, the cost for deploying a node network is reduced, and the economic benefit is significantly improved.
Fourth, in the prior art, the centers of gravity are all in the blockchain, and the logic executed in the node network and the related data are all specified in the intelligent contract of the blockchain, whereas in the above-mentioned embodiment of the present application, the node network is used as a completely new network interfacing with the blockchain, and is no longer limited by the bottleneck of the blockchain write-in capability, and the program code for processing the data processing request is not from the intelligent contract of the blockchain having the common attribute, but from the IPFS connected to the node network, so that a third party can freely deploy the data processing network and set the data processing logic having its own characteristics, which is beneficial to enhancing the flexibility, extensibility, and universality of such processing systems.
It is particularly emphasized that the above-described embodiments of the present application are new concepts that have been explored on the way to solve the problems of the prior art. The conventional improvement direction of the prior art to the aforementioned problems is to improve the TPS throughput capacity of the public block chain by thousands of ways, and hopefully, by improving the TPS capacity, the massive application requirements on the public block chain can be met, but the practical effect shows that the TPS capacity is a wrong road under the guidance of a "correct idea", and the improvement of the TPS capacity is little in effect after the effort. The above embodiments of the present application skillfully avoid the "trouble" of the throughput capability of the common block link TPS, but focus on the modification of the node network itself and the modification between the node network and the block link, so that the node network inherits the characteristics of non-tamper property, fairness, and the like, which are the same as those of writing data into the block link, to a certain extent. It is this unique idea that the embodiments of the present application achieve the above-mentioned excellent technical effects.
In the introduction process of the above embodiment, based on the point of improvement of the present application, it is mentioned that the node network processes the data processing request by using the functional program in step S201, and actually, before the node network completes the step and the subsequent steps, there should be contents of establishing the connection between the node network and the terminal device, except that the connection between the node network and the terminal device can be established in the same manner as the prior art, and thus, is not described in detail. However, the inventor of the present application further proposes a new way of establishing a connection between a terminal device and a node network, which constitutes yet another major inventive point of the present application. The following is described: first, the terminal device sends a connection request (login request) to the node network, the connection request including a service ID of a service that the terminal device is about to log in or connect to, and possibly including a user ID of a user operating the terminal device. And then, after receiving the connection request, the node network analyzes the connection request to obtain a service ID, and then acquires a corresponding function program from the IPFS according to the service ID, wherein the function program comprises data processing logic and is a 'core' soul for completing the service. After or before the function is obtained, the node network may send a response message to the terminal device, thereby establishing a long connection between the terminal device and the node network. Through the long connection, various data interaction can be carried out between the terminal equipment and the node network. The connection mode avoids the problem of ' one data one connection ' link ' swelling phenomenon and the problem of repeated resource consumption for initiating connection establishment for multiple times, and once a long connection is established, messages can be sent and received through the channel before the terminal device is not offline (or corresponding services are terminated). The above-mentioned manner of establishing the connection device between the terminal device and the node network may have some details different under the condition that the internal structures of the node networks are different, but if the node network looks at an integral "black box", as long as the connection can be completed to the outside, the above-mentioned manner can be used for implementing the technical solution of the above-mentioned embodiment of the present application.
Step S201 in the above embodiment refers to the node network processing the data processing request by using a functional program, and in the specific processing process, the processing mode may be different due to different data types and service requirements. For example, the network of nodes may complete the processing of data processing requests with only a functional program. But in some cases other data may need to be obtained. For example, when a player plays a network game, the player may not only run the script program code obtained from the IPFS, but also obtain the player data of the player during the running process, in this case, the user data needs to be read out from the block chain corresponding to the node network according to the user ID, and then, the processing of the data processing request is completed in combination with the user data during the processing, so as to obtain the processing effect. It should be noted here that the node network may read the user data from the blockchain by using the smart contract. Compared with the prior art, the intelligent contract in the embodiment no longer contains the service processing logic code, so that the intelligent contract is specially used for reading and writing operations of the block chain and the like.
The embodiment of the application can reduce the multiple block chain read-write operations, even change the operations into two block chain read-write operations before the start and when the end of the service, and mainly benefit from the guarantee function of the verification mechanism in the node network. After the node network obtains the processing result data, the data is not stored immediately, but needs to be verified to ensure that the node performing the data processing in the node network does not "do bad". When the verification is carried out, the node which obtains the data processing result in the node network sends the processing result to other nodes in the node network, after other nodes adopt preset verification measures to carry out verification, the other nodes send confirmation messages to the node, the node finally determines whether the processing result can be stored according to the condition of obtaining the confirmation messages, and if the predetermined verification conditions are met, the processing result can be stored on the nodes in the node network in a distributed storage mode. In order to track the stored result, in some embodiments, a random number is further pre-allocated by the node network, the random number is bound with the processing result data, the processing result bound with the random number is verified, and after the storage is completed, the node network obtains signature data for the random number.
In step S203 of the above embodiment of the present application, after receiving the predetermined instruction, the node network writes at least two stored processing results into the block chain corresponding to the node network. In the prior art, each time a data processing operation is completed, since no predetermined instruction exists, the read-write operation of the block chain is naturally performed like a 'pipeline', but the application can wait for the arrival of the predetermined instruction and perform the operation after receiving the instruction, so that the requirement on the block chain TPS can be controlled as required. The predetermined instruction of the present application may be embodied in various forms, for example, the predetermined instruction may be an instruction that the terminal device terminates a currently processed service, which is received by the node network, or may also be an instruction that the terminal device goes off the line for the service, and the node network will obtain this notification and further know that no more data processing results will be generated subsequently, so that the previous data processing results are linked into the block chain; for example, the predetermined instruction may be an instruction received by the node network to terminate the currently processed service according to a predetermined rule, which is different from the predetermined instruction, where the former is to actively terminate the service processing by the terminal device, and the latter is to make a decision to terminate the service processing by the node network after a predetermined condition is satisfied, and both of the two may form a form of the predetermined instruction itself; for another example, the predetermined instruction may store a certain number of processing results for the node network, and then perform uplink operation, and write the stored processing results or the processing results that are less than the number of the processing results into the block chain in batches, where the foregoing refers to that the processing results of each time are not "written as soon as possible", but rather, the processing results are accumulated to a certain extent, and then uplink is performed at a suitable time. It should be noted that, before the predetermined instruction arrives, in order to avoid the data in the block chain from changing, the user data of the user ID in the block chain may be set in a locked state, so as to avoid the other nodes operating the user data of the user ID in the block chain, and to avoid or reduce the possibility of data errors. Here, before the predetermined instruction comes, there can be divided into two cases: firstly, the node network needs to read data from the block chain, and then the time interval when the user data is in the locked state can be after the node network reads the user data to which the user ID belongs through the intelligent contract of the block chain until the user data processed by the node network is written into the data through the intelligent contract of the block chain; the node network can be in a locked state before an appointed instruction arrives and can be unlocked only when data needs to be written in order to ensure that user data is not modified even if the data does not need to be read from the blockchain.
In the process of describing the embodiment of the present application, the node network is regarded as a "black box", and as long as the "black box" has the related functions of the present application, the corresponding service processing can be completed. However, in order to better understand the overall technical solution of the present application, an embodiment of a node network is provided below. Referring to fig. 3, a possible implementation structure of the node network is shown. The following is presented from different perspectives:
from the functional category of nodes, although there are many nodes in a node network, the node network can be divided into four major categories: the first logic node is mainly used for completing processing tasks of a core, and specifically may include: receiving a long connection request and a data processing request of terminal equipment; acquiring a function program from the IPFS according to the service ID, and processing a data processing request by using the function program; after the data processing request is processed to form a processing result, the processing result is sent to other nodes for verification; after the verification is passed, writing the processing result into the storage node; when a preset instruction is received, writing a processing result into a block chain connected with a node network; the block chain can ensure fairness and tamper resistance, and an important mechanism is self-processing and others verification, the monitoring node is in the position in a node network, verifies the processing result processed by the logic node and sends the verification result to the logic node, so that the logic node can confirm the accuracy and fairness of the processing result according to the number of the received confirmation messages from the monitoring node; the storage node is used for storing the processing result after verification, and can be stored in a distributed mode during storage, so that the stability and the reproducibility of data are ensured; fourthly, the central node completes some critical actions in the node network, provides non-data security status and contact services, takes a network game as an example, and can be used as a node load and task distribution center, an online player status query center, a game matching center (selects a proper game opponent) and the like, wherein the specific action can be, for example, a random number is distributed when a processing result is stored, and then the random number is bound with the processing result; and distributing a logic node, a supervision node, a storage node and the like corresponding to the current service to the terminal equipment. The logic nodes, the matched or corresponding supervision nodes and storage nodes form a whole set of node group system serving a certain service.
From the aspect of node function, the four functions or some functions may be integrated in one node or may be distributed to a plurality of independent nodes; it is possible to exert the function (or other functions) of the central logic node in the current service processing and exert the function (or other functions) of the supervisory node in the next service processing; the absolute number of the nodes may be increased at a certain time, or the absolute number of the nodes may be decreased at a certain time; there may be a node that is "rogue" in the sense that the function of a certain node may not be performed normally in a certain traffic process, etc. However, it should be noted that although some nodes may have various functions and may be regarded as rogue nodes, they may normally provide better services as a whole node network. The better service is realized on the assumption that the nodes are all untrusted nodes, and a set of trust guarantee mechanism is provided based on the assumption, because the logical nodes of the 'picking beam' or the 'law enforcement supervision' or even the 'data falling to the ground' can be 'not doing harm' in some cases, so that the logical nodes are sent to a plurality of supervision nodes for supervision after being processed to form processing results, and the consistency of instructions executed by the logical nodes, input configuration, output states and the like is ensured. Similarly, when the logic node receives the feedback confirmation result of the supervision node, the logic node not only adopts the feedback result of one supervision node, but also can aggregate the consensus of most supervision nodes by executing a consensus mechanism such as a Byzantine consensus algorithm, so as to avoid the malignancy of the supervision nodes. For the storage nodes, the same multi-node storage of the same user data, the execution of consensus algorithm and other ways are also adopted to ensure the identity and validity of the data.
From the aspect of node function implementation, each node may be implemented by the same information processing device, for example, all of the nodes are PC devices, and may also be implemented by different information processing devices; one node may correspond to one information processing apparatus, or one node may correspond to one cluster composed of a plurality of information processing apparatuses. These homogeneous or heterogeneous nodes are effective nodes meeting the purpose of the present invention as long as they can satisfy the external needs of the node network as a whole.
The technical scheme of the application is explained below by taking a specific online game as a scene. In the network game, a terminal side is provided with a plurality of or tens of or even hundreds of players, the players can be close in geographic position or can be separated by ten thousands of places, and if the players play the same game, the players are connected to the same node network according to the actual situation of network construction, and the node network provides services; the network side comprises a node network, an IPFS, a common block chain and the like. For convenience, a terminal device is taken as an example for description, and referring to fig. 4, fig. 4a shows a network game data processing process, fig. 4b shows a signaling interaction process of the network game data processing, and fig. 4c shows a scene of the network game (LAYA cloud network).
S401: the method comprises the steps that terminal equipment sends a login request to a guide node server in a network game server network, wherein the login request comprises a game ID and a player ID;
s402: the guide node server forwards the login request to a central node server in the network game server network;
s403: s403 (a) the central node server allocates servers in the network game server network to the terminal device as a logic node server, a supervision node server and a storage node server, and S403 (b) feeds back the allocated logic node server information to a guide node server, so that the guide node server synchronizes the logic node server information to the terminal device; s403 (c) sending the random number to the logic node server;
s404: the logic node server acquires a logic script code of the game from the IPFS according to the game ID;
s405: the terminal equipment sends disconnection information to the guide node server so as to disconnect the connection with the guide node server and establish long connection with the logic node server;
s406: the logic node server reads the player data of the player from a block chain connected with the game network server according to the player ID, and processes a data processing request according to the player data by using a logic script code to obtain the current data of the player; the current data of the player is bound with the random number and then is sent to a supervision node server in the network of the network game server for verification; taking ETH as an example, after the logic node server reads the player data from the block chain according to the player ID, the game data is locked in a contract through an intelligent contract of ETH, and the game network server reads the player data to complete the continuous game process until the game is finished.
S407: the supervision node server verifies the current data of the player bound with the random number, and sends confirmation and signature information to the logic node server after the verification is passed;
s408: when the confirmation and the signature information received by the logic node server meet the preset conditions, the logic node server stores the confirmation and the signature information to a storage node server in the network of the network game server; taking ETH (Ether Fair) as an example, the logical node reports the result to 3 storage nodes corresponding to the game.
S409: and after receiving a preset instruction, the logic node server writes the stored current data of the player into a block chain connected with the network of the network game server. Taking ETH as an example, after receiving an instruction to terminate a game, writing results with data consistent with 3 storage nodes into corresponding player accounts on corresponding public chains respectively, and unlocking.
The foregoing has detailed various embodiments of a blockchain-based data processing method, and a blockchain link point network adapted thereto. In the same manner as described above, the method described above can be assumed to be a data processing apparatus based on a block chain. Referring to fig. 5, an embodiment of a blockchain-based data processing apparatus is shown to be located in a blockchain link point network, and the apparatus is located in a node network and includes a data processing unit U51, a verification storage unit U52 and a blockchain writing unit U53, wherein:
a data processing unit U51, configured to process a data processing request by using a functional program, to obtain a processing result, where the functional program is obtained by a node network from a distributed resource storage system according to a service ID, and the service ID is included in a connection request for establishing a connection between a terminal device and the node network, where the connection request is received by the node network;
the verification storage unit U52 is used for verifying the processing result needing to be verified and storing the processing result passing the verification;
and the block chain writing unit U53 is configured to write the processing result to be stored into the block chain corresponding to the node network after receiving the predetermined instruction.
In addition, the embodiment of the application also provides an operator. Referring to fig. 6, the diagram shows a schematic structural diagram of an embodiment of an runner, where the runner 60 includes a memory 61, a processor 62, and a computer program stored on the memory 61 and capable of running on the processor 62, and the computer program, when executed by the processor 62, implements the steps of the above-mentioned block chain-based data processing method. In this way, embodiments of the present application further provide a computer-readable storage medium, where a computer program is stored, and the computer program, when executed by a processor, implements the steps of the above-mentioned block chain-based data processing method.
As will be appreciated by one skilled in the art, 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 flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams 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 a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
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 computer storage media 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 Disks (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. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
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 described by the phrase "comprising a. -" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
As will be appreciated by one skilled in the art, 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 above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement or the like made within the spirit and principle of the present application shall be included in the scope of the claims of the present application.

Claims (17)

1. A data processing method based on a block chain is characterized by comprising the following steps:
the node network processes the data processing request by using a functional program to obtain a processing result, wherein the functional program is obtained from a distributed resource storage system according to a service ID when the node network needs to obtain the functional program of a corresponding service, the service ID is contained in a connection request for establishing connection between terminal equipment and the node network received by the node network, the node network is positioned between the terminal equipment and the distributed resource storage system, and the terminal equipment uses the distributed resource storage system through the node network;
the node network verifies the processing result to be verified and stores the processing result passing the verification;
and after receiving a preset instruction, the node network writes the accumulated processing result or part of the accumulated processing result which needs to be stored into the block chain corresponding to the node network.
2. The method of claim 1, wherein establishing a connection between the terminal device and the network of nodes comprises:
a node network receives a connection request sent by a terminal device, wherein the connection request comprises a service ID of a service logged by the terminal device;
the node network acquires a corresponding functional program from the distributed resource storage system according to the service ID in the connection request;
and the node network sends a response message responding to the connection request to the terminal equipment to establish long connection with the terminal equipment.
3. The method according to claim 1, wherein the connection request further includes a user ID, and the node network processes the data processing request by using a function program to obtain a processing result, specifically including:
the node network reads out user data from a block chain corresponding to the node network according to the user ID;
and the node network processes the data processing request by using the functional program or the functional program and the user data to obtain a processing result.
4. The method of claim 3,
the node network reads out user data from a block chain corresponding to the node network according to the user ID, and the specific steps are as follows: the node network reads out user data from a block chain corresponding to the node network according to the user ID through an intelligent contract; and/or the presence of a gas in the gas,
the node network writes the stored processing result into a block chain corresponding to the node network, specifically: and the node network writes the stored processing result into a block chain corresponding to the node network through an intelligent contract.
5. The method according to claim 1, wherein the node network verifies the processing result and stores the processing result that passes the verification, and specifically includes:
the node network binds the random number generated by the network carrying the node with the processing result to be verified, and verifies the processing result bound with the random number;
when the verification in the node network meets a preset rule, storing the processing result;
after the storage is completed, the node network obtains signature data for the random number.
6. The method according to any one of claims 1 to 5,
the predetermined instruction is an instruction received by the node network that the terminal device terminates the currently processed service, or,
the predetermined instruction is an instruction received by the node network to terminate the current processing service according to a predetermined rule, or,
the predetermined instruction is a write instruction which is received after the node network stores a first predetermined number of processing results and writes a second predetermined number of stored processing results into the block chain, wherein the second predetermined number is greater than or equal to two and less than or equal to the first predetermined number.
7. The method of claim 6, wherein the user data of the user ID in the corresponding block chain of the node network is in a locked state before the predetermined command is received.
8. A network of nodes associated with a blockchain, the network of nodes comprising one or more logical nodes, a plurality of supervisory nodes, and a plurality of storage nodes, wherein:
the logic node is used for acquiring a function program from the distributed resource storage system according to a service ID when the node network needs to acquire the function program of a corresponding service, processing a data processing request by using the function program to acquire a processing result, and sending the processing result needing to be verified to the monitoring node for verification, wherein the service ID is contained in a connection request for establishing connection between the terminal equipment and the node network received by the node network, the node network is positioned between the terminal equipment and the distributed resource storage system, and the terminal equipment uses the distributed resource storage system through the node network; after the monitoring node verifies the processing result, writing the processing result passing the verification into the storage node; after receiving a preset instruction, writing the accumulated processing result or a part of the accumulated processing result which needs to be stored into a block chain associated with the node network;
the supervision node is used for verifying the processing result needing to be verified;
and the storage node is used for storing the processing result passing the verification.
9. The node network of claim 8, further comprising a bootstrap node and a central node, wherein:
the guide node is used for receiving a connection request sent by the terminal equipment and forwarding the connection request to the central node, wherein the connection request comprises a service ID of a service logged by the terminal equipment, and the logical node information which is fed back by the central node and distributed to the terminal equipment is synchronized to the terminal equipment so that the terminal equipment can establish long connection with the logical node;
and the central node is used for distributing a logic node, a supervision node and a storage node to the terminal equipment after receiving the connection request.
10. The node network of claim 9, wherein the central node is configured to generate a random number and send the random number to the logical node, so that the logical node binds the random number with the processing result;
the supervision node is configured to verify the processing result that needs to be verified, and specifically includes: the random number binding module is used for verifying the processing result bound with the random number;
and the central node is further used for receiving the signature data for the random number submitted by the logic node after the storage node stores the processing result.
11. The node network according to claim 8, wherein the connection request further includes a user ID, and the logic node is further configured to read user data from a block chain corresponding to the node network according to the user ID, and process the data processing request by using the functional program or the functional program and the user data, so as to obtain a processing result.
12. The node network of claim 11,
the logical node is configured to read out user data from a block chain corresponding to the node network according to the user ID, and specifically includes: the intelligent contract is used for reading out user data from the block chain corresponding to the node network according to the user ID;
the logical node is configured to write the processing result to be stored into a block chain associated with a node network, and specifically includes: the intelligent contract is used for writing the processing result required to be stored into a block chain associated with the node network.
13. A method for processing network game data is characterized by comprising the following steps:
the method comprises the steps that terminal equipment sends a login request to a guide node server in a network game server network, wherein the login request comprises a game ID and a player ID;
the guide node server forwards the login request to a central node server in the network game server network;
the central node server distributes servers in a network game server network to the terminal equipment as a logic node server, a supervision node server and a storage node server, and feeds back the distributed logic node servers to a guide node server so that the guide node server can synchronize the information of the logic node servers to the terminal equipment; and issuing a random number to the logic node server;
the logic node server acquires the logic script code of the game from a distributed resource storage system according to the game ID;
the terminal equipment sends disconnection information to the guide node server so as to disconnect the connection with the guide node server and establish long connection with the logic node server;
the logic node server reads the player data of the player from a block chain serving the network of the network game server according to the player ID, and processes a data processing request according to the player data by using a logic script code to obtain the current data of the player; the current data of the player is bound with the random number and then is sent to a supervision node server in the network of the network game server for verification;
the supervision node server verifies the current data of the player bound with the random number, and sends confirmation and signature information to the logic node server after the verification is passed;
when the confirmation and the signature information received by the logic node server meet the preset conditions, the logic node server stores the confirmation and the signature information to a storage node server in the network of the network game server; and after receiving a preset instruction, the logic node server writes the stored current data of the player into a block chain serving the network of the network game server.
14. A blockchain-based data processing apparatus, the apparatus being located in a node network and comprising a data processing unit, a verification storage unit, and a blockchain writing unit, wherein:
the data processing unit is used for processing a data processing request by using a functional program to obtain a processing result, wherein the functional program is obtained by the node network from the distributed resource storage system according to a service ID when the node network needs to obtain the functional program of a corresponding service, the service ID is contained in a connection request for establishing connection between terminal equipment and the node network received by the node network, the node network is positioned between the terminal equipment and the distributed resource storage system, and the terminal equipment uses the distributed resource storage system through the node network;
the verification storage unit is used for verifying the processing result needing to be verified and storing the processing result passing the verification;
and the block chain writing unit is used for writing the accumulated processing result or a part of the accumulated processing result which needs to be stored into the block chain corresponding to the node network after receiving a preset instruction.
15. A runner, comprising: memory, processor and computer program stored on the memory and executable on the processor, which when executed by the processor implements the steps of the method according to any of claims 1 to 7.
16. The runner of claim 15, wherein the processor comprises a virtual machine to run a computer program of logical script code.
17. A computer-readable storage medium, characterized in that a computer program is stored on the computer-readable storage medium, which computer program, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 7.
CN201810945703.XA 2018-08-17 2018-08-17 Data processing method and device based on block chain and node network Active CN110839056B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810945703.XA CN110839056B (en) 2018-08-17 2018-08-17 Data processing method and device based on block chain and node network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810945703.XA CN110839056B (en) 2018-08-17 2018-08-17 Data processing method and device based on block chain and node network

Publications (2)

Publication Number Publication Date
CN110839056A CN110839056A (en) 2020-02-25
CN110839056B true CN110839056B (en) 2023-03-10

Family

ID=69573913

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810945703.XA Active CN110839056B (en) 2018-08-17 2018-08-17 Data processing method and device based on block chain and node network

Country Status (1)

Country Link
CN (1) CN110839056B (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111327602B (en) * 2020-01-21 2021-09-28 腾讯科技（深圳）有限公司 Equipment access processing method, equipment and storage medium
CN111858089B (en) * 2020-06-29 2024-01-23 北京百度网讯科技有限公司 Method and device for calling Ethernet nodes
CN113965336B (en) * 2020-07-03 2024-08-27 航天信息股份有限公司 Data processing method and device
CN112019350B (en) * 2020-08-31 2024-02-02 光大科技有限公司 Block verification method and device for block chain
CN112258320B (en) * 2020-09-21 2023-06-20 西安电子科技大学 Block chain-based payment center placement method, system, medium and equipment
CN112733198B (en) * 2020-11-02 2023-06-13 迅鳐成都科技有限公司 Block chain light node data acquisition method and device
CN118093613B (en) * 2024-03-21 2024-08-30 杭州高新区(滨江)区块链与数据安全研究院 Data interaction processing method, block construction node, terminal equipment and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105573828A (en) * 2015-12-17 2016-05-11 布比（北京）网络技术有限公司 Operation processing method and device
US20170243212A1 (en) * 2016-02-22 2017-08-24 Bank Of America Corporation System for implementing a distributed ledger across multiple network nodes
CN107423124A (en) * 2017-07-27 2017-12-01 中链科技有限公司 A kind of method for being used to carry out transaction data parallel processing
CN107563761A (en) * 2017-08-26 2018-01-09 复旦大学 Game account management method based on block chain

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105573828A (en) * 2015-12-17 2016-05-11 布比（北京）网络技术有限公司 Operation processing method and device
US20170243212A1 (en) * 2016-02-22 2017-08-24 Bank Of America Corporation System for implementing a distributed ledger across multiple network nodes
CN107423124A (en) * 2017-07-27 2017-12-01 中链科技有限公司 A kind of method for being used to carry out transaction data parallel processing
CN107563761A (en) * 2017-08-26 2018-01-09 复旦大学 Game account management method based on block chain

Also Published As

Publication number Publication date
CN110839056A (en) 2020-02-25

Similar Documents

Publication Publication Date Title
CN110839056B (en) Data processing method and device based on block chain and node network
Yang et al. Integrated blockchain and edge computing systems: A survey, some research issues and challenges
CN109639521B (en) Block chain performance testing method, device, equipment and storage medium
CN110868439B (en) Block chain system
CN110417558B (en) Signature verification method and device, storage medium and electronic device
Yuan et al. CSEdge: Enabling collaborative edge storage for multi-access edge computing based on blockchain
JP7211977B2 (en) Method and system for mining blockchain transactions provided by validator nodes
CN111062044B (en) Model joint training method and device based on block chain
CN112541758A (en) Multi-round voting type fault-tolerant sequencing consensus mechanism and method based on block chain
CN113395363B (en) Data processing method, device and equipment based on block chain and storage medium
CN108810137A (en) A kind of alliance's block catenary system
CN112235420B (en) Data synchronization method, system and related equipment based on block chain
US20230289782A1 (en) Smart contract-based data processing
CN110071897B (en) Block chain system based on mobile terminal
Zhang et al. Blockchain-incentivized D2D and mobile edge caching: A deep reinforcement learning approach
CN110933173B (en) Block chain technology-based networking method and device
CN111798234B (en) Lightweight block chain system and construction method
CN111290965B (en) Test method, test device, computer equipment and storage medium
CN113037824B (en) Cloud computing-oriented high-performance block chain construction method
CN112231415B (en) Data synchronization method and system of block chain network, electronic device and readable medium
CN111667255B (en) Digital asset transfer system and method based on alliance chain
Decker On the scalability and security of bitcoin
Pustišek et al. Blockchain: Technology and Applications for Industry 4.0, Smart Energy, and Smart Cities
CN115842866A (en) Data processing method and device, computer readable medium and electronic equipment
WO2020042932A1 (en) Public chain-based blockchain information storage method and system

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
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.

GR01 Patent grant
GR01 Patent grant