KR20200124634A - Method for ensuring the trust of selling probability based items - Google Patents

Abstract

Some embodiments of the present disclosure relate to a computer program stored in a computer-readable storage medium. An object of the present invention is to ensure transparent odds of winning in relation to a probability-type item using a blockchain network. The computer program includes commands for a game server to perform the following operations including: generating an Nth server secret key corresponding to N time and calculating a first hash value of the Nth server secret key; transmitting a first transaction to at least one node included in a blockchain network such that the first transaction including the first hash value and an N-1th server secret key is recorded in an Nth block; generating an N+1th server secret key corresponding to N+1 time and calculating a second hash value of the N+1th server secret key; and transmitting a second transaction to at least one node included in the blockchain network such that the second transaction including the second hash value and the Nth server secret key is recorded in an N+1th block.

Description

How to guarantee confidence in selling probabilistic items {METHOD FOR ENSURING THE TRUST OF SELLING PROBABILITY BASED ITEMS}

The present disclosure relates to a method of guaranteeing the trust of probabilistic item sales, and more specifically, to a method for guaranteeing a transparent probability of winning a probabilistic item by using a blockchain network.

Recently, the 4th Industrial Revolution, the next generation industrial revolution made by the convergence of information and communication technologies, has become an issue. In the existing industry, automation meant passively operating according to a program entered in advance, but in the 4th industrial revolution, it means that machines actively grasp the situation and operate, and this 4th industrial revolution means artificial intelligence and robots. Technology and life sciences are leading.

Among the technologies of the 4th industrial revolution, Blockchain is attracting attention as a major technology. Blockchain is a technology that provides security as a public transaction ledger. These blockchains are attracting attention, and the Bitcoin platform and ethereum platform, which are blockchain-based cryptocurrency technologies, are also attracting attention.

Bitcoin refers to a cryptocurrency that can record transaction records by blockchain technology, and Ether of Ethereum refers to a cryptocurrency that can record additional information such as contracts as well as transaction technology. In particular, Ethereum is attracting more attention by supporting a smart contract function that can record separate information.

Meanwhile, with the rapid development of IT technology, the game industry is growing together, and online-based game services use differentiated marketing strategies to gain competitiveness.

For example, an online game service provider sells a probabilistic item with an ability or ability required for game progress to a user for a fee. Here, the probability-type item is provided to users in a drawing (gacha) method, and may be classified into advanced, intermediate, and low-level items. However, a user who purchases a probability item in an online game may have a question as to whether or not the item is paid according to the probability notified by the online game service provider when receiving the item according to probability.

If the probability of a probability item is not transparently disclosed, it negatively affects the image of the game provider, which can lead to a decrease in sales for game development companies and game publishing companies, as well as games such as creativity and interest of the game. Regardless of the intrinsic characteristics of the game, it may result in a shortened game life. Therefore, methods are being sought to solve the questions of users involved in the sale of such probabilistic items.

Republic of Korea Patent Publication No. 10-2018-0017532

The present disclosure is conceived in response to the above-described background technology, and is intended to provide a method for guaranteeing a transparent probability of winning a probability item using a blockchain network.

The technical problems of the present disclosure are not limited to the technical problems mentioned above, and other technical problems that are not mentioned will be clearly understood by those skilled in the art from the following description.

According to some embodiments of the present disclosure for solving the problems as described above, a computer program stored in a computer-readable storage medium is disclosed. The computer program includes instructions for causing the game server to perform the following operations, the operations: generating an N-th server secret key corresponding to N hours, and generating the N-th server secret key. 1 calculating a hash value; Transmitting the first transaction to at least one node included in the blockchain network so that the first transaction including the N-1 th server secret key and the first hash value is recorded in the N th block; Generating an N+1 th server secret key corresponding to N+1 time, and calculating a second hash value of the N+1 th server secret key; And transmitting the second transaction to at least one node included in the blockchain network so that a second transaction including the N-th server secret key and the second hash value is recorded in the N+1-th block. And the N-th block includes a third hash value and a first time stamp of the N-th client secret key generated for purchase registration of a probability item between the N time and the N+1 time in the client terminal. And, the N+1 th block may include the N th client secret key and a second time stamp of the client terminal disclosed for use of the probabilistic item.

Further, the first time stamp corresponds to a time when the probabilistic item is registered for purchase in the client terminal, and the second time stamp corresponds to a time at which the probabilistic item registered for purchase in the client terminal is used. I can.

In addition, the operations may further include providing the probabilistic item to a client terminal based on information recorded in each of the N-th block and the N+1-th block.

In addition, the operation of providing the probabilistic item to the client terminal may include: receiving a probabilistic item payment request signal from the client terminal after the time recorded in the first time stamp; Recognizing whether or not a probability item payment condition is satisfied based on the probability type item payment request signal; And when it is recognized that the probability type item payment condition is satisfied, providing a probability type item corresponding to the probability type item payment request signal to the client terminal.

In addition, the operation of recognizing whether the probability type item payment condition is satisfied may include calculating a fourth hash value of the N-th client secret key recorded in the N+1-th block; Comparing the third hash value and the fourth hash value; And when the third hash value and the fourth hash value match, recognizing that the probability type item payment condition is satisfied.

In addition, the operation of recognizing whether the probability-type item payment condition is satisfied may include generating a seed value based on the N-th client secret key and the N-th server secret key; Calculating a result value of a random function taking the seed value as an input; Recognizing first identification information for an item corresponding to a result value of the random function; Comparing the first identification information with second identification information for the payment request item included in the probability type item payment request signal; And when the first identification information and the second identification information match, recognizing that the probability-type item payment condition is satisfied.

In addition, the operation of recognizing whether the probability type item payment condition is satisfied may include calculating a fourth hash value of the N-th client secret key recorded in the N+1-th block; Comparing the third hash value and the fourth hash value; Generating a seed value based on the N-th client secret key and the N-th server secret key when the third hash value and the fourth hash value match; Calculating a result value of a random function taking the seed value as an input; Recognizing first identification information for an item corresponding to a result value of the random function; Comparing the first identification information with second identification information for the payment request item included in the probability type item payment request signal; And when the first identification information and the second identification information match, recognizing that the probability-type item payment condition is satisfied.

In addition, the first transaction includes hash range data, information on the acquisition probability of each probability item, identification information of each probability item, and hash range data to which each identification information of each probability item is mapped. The operation of recognizing first identification information for an item corresponding to a result value of the random function further including a table may include recognizing a range value including a result value of the random function in the hash range data table ; And recognizing first identification information for an item corresponding to the range value in the hash range data table.

In addition, generating a third transaction by providing a probability item corresponding to the probability item payment request signal to the client terminal; And by transmitting the third transaction to at least one node included in the blockchain network, when the third transaction is verified through a consensus algorithm, a specific block is generated in each of a plurality of nodes, and the specific block It may further include an operation of causing the third transaction to be recorded.

In addition, the providing of the probabilistic item to the client terminal may include: recognizing whether the third hash value transmitted from the client terminal exists in the N-th block; When recognizing the N-th client secret key recorded in the N+1-th block, recognizing whether a probability type item payment condition is satisfied; And when it is recognized that the probability type item payment condition is satisfied, providing a probability type item corresponding to the purchase registration of the probability type item to the client terminal.

In addition, the operation of recognizing whether the probability type item payment condition is satisfied may include calculating a fourth hash value of the N-th client secret key recorded in the N+1-th block; Comparing the third hash value and the fourth hash value; And when the third hash value and the fourth hash value match, recognizing that the probability type item payment condition is satisfied.

In addition, the operation of providing the probability item corresponding to the purchase registration of the probability item to the client terminal may include generating a seed value based on the Nth client secret key and the Nth server secret key; Calculating a result value of a random function taking the seed value as an input; Recognizing first identification information for a probability item corresponding to a result value of the random function; And providing the probabilistic item corresponding to the first identification information to the client terminal.

In addition, the first transaction includes hash range data, information on the acquisition probability of each probability item, identification information of each probability item, and hash range data to which each identification information of each probability item is mapped. The operation of recognizing the first identification information for the probability type item corresponding to the result value of the random function further comprising a table further includes, in the hash range data table, recognizing a range value including the result value of the random function Action; And recognizing first identification information for an item corresponding to the range value in the hash range data table.

According to some embodiments of the present disclosure for solving the problems as described above, a computer program stored in a computer-readable storage medium is disclosed. The computer program includes instructions for causing the client terminal to perform the following operations, the operations: generating an N-th client secret key for probabilistic item purchase registration, and the N-th client secret key Calculating a first hash value of; Transmitting the first transaction to at least one node included in the blockchain network so that the first transaction including the first hash value is recorded in the N-th block; And transmitting the second transaction to at least one node included in the blockchain network so that a second transaction including the N-th client secret key is recorded in the N+1-th block for use of the probabilistic item. Including ;, the N-th block includes a second hash value of the N-th server secret key of the game server, the N-1 th server secret key of the game server, and a first time stamp, and the N+1 th The block may include the N-th server secret key and a second time stamp of the game server.

Further, the first time stamp corresponds to a time when the first transaction is transmitted to at least one node included in the blockchain network, and the second time stamp is included in the second transaction in the blockchain network. It may correspond to the time transmitted to at least one node.

Further, the operations may include transmitting a probability type item payment request signal to the game server based on information recorded in each of the Nth block and the N+1th block; And receiving a probability item corresponding to the probability item payment request signal from the game server.

In addition, the operation of transmitting the probability-type item payment request signal to the game server may include calculating a third hash value of the N-th server secret key recorded in the N+1-th block; Comparing the second hash value and the third hash value; And

Generating a seed value based on the N-th client secret key and the N-th server secret key when the second hash value and the third hash value match; Calculating a result value of a random function taking the seed value as an input; Recognizing first identification information for a probability item corresponding to a result value of the random function; And transmitting the probabilistic item payment request signal including the first identification information to the game server.

In addition, the N-th block includes hash range data, information on an acquisition probability of each probability item, identification information of each probability item, and hash range data to which each identification information of each probability item is mapped. The operation of recognizing the first identification information for the probability type item corresponding to the result value of the random function further comprising a table further includes, in the hash range data table, recognizing a range value including the result value of the random function Action; And recognizing first identification information for an item corresponding to the range value in the hash range data table.

In accordance with some embodiments of the present disclosure for solving the problem as described above, a game server is disclosed. The game server includes: a communication unit for transmitting a transaction to at least one node included in the blockchain network; And a control unit for generating a server secret key at preset time intervals and calculating a hash value of the server secret key, wherein the control unit includes, an N-th server secret key corresponding to N time To generate a first hash value of the N-th server secret key, and to record a first transaction including the N-1 th server secret key and the first hash value in the N-th block, the first transaction Control the communication unit to transmit to at least one node included in the blockchain network, generate an N+1th server secret key corresponding to N+1 time, and generate a second of the N+1th server secret key At least one node included in the blockchain network to calculate the hash value, and to record the second transaction including the N-th server secret key and the second hash value in the N+1-th block And the N-th block is a third hash value of the N-th client secret key generated for purchase registration of a probability item between the N time and the N+1 time in the client terminal And a first time stamp, and the N+1 th block may include the N th client secret key and a second time stamp of the client terminal disclosed for use of the probabilistic item.

According to some embodiments of the present disclosure for solving the problems as described above, a client terminal is disclosed. The client terminal: a communication unit for transmitting a transaction to at least one node included in the blockchain network; And a control unit generating a client secret key and calculating a hash value of the client secret key, wherein the control unit generates an N-th client secret key for probabilistic item purchase registration, , To calculate a first hash value of the N-th client secret key, and write the first transaction including the first hash value to the N-th block, the first transaction is at least one included in the blockchain network. Controls the communication unit to transmit to a node, and sends the second transaction to the blockchain network so that a second transaction including the Nth client secret key is recorded in the N+1th block for use of the probabilistic item. The communication unit is controlled to transmit to at least one node included, and the N-th block includes a second hash value of the N-th server secret key of the game server, the N-1 th server secret key of the game server, and a first time. A stamp is included, and the N+1 th block may include the N th server secret key and a second time stamp of the game server.

Technical solutions obtainable in the present disclosure are not limited to the above-mentioned solutions, and other solutions that are not mentioned are clearly to those of ordinary skill in the technical field to which the present disclosure belongs from the following description. It will be understandable.

The present disclosure may provide a method for guaranteeing a transparent probability of winning a probability item using a blockchain network.

The effects obtainable in the present disclosure are not limited to the effects mentioned above, and other effects not mentioned will be clearly understood by those of ordinary skill in the art from the following description. .

Various aspects are now described with reference to the drawings, wherein like reference numbers are used collectively to refer to like elements. In the examples that follow, for illustrative purposes, a number of specific details are presented to provide a holistic understanding of one or more aspects. However, it will be apparent that such aspect(s) may be practiced without these specific details.
FIG. 1 is a diagram illustrating an example of a game system based on a game server, a client terminal, and a blockchain network in which various aspects of the present disclosure may be implemented.
2 is a flowchart illustrating an example in which a game server provides a probabilistic item to a client terminal according to some embodiments of the present disclosure.
3 is a diagram illustrating a connection structure of blocks stored in a block chain network according to some embodiments of the present disclosure.
4 is a flowchart illustrating an example in which a game server transmits a transaction to at least one node included in a blockchain network according to some embodiments of the present disclosure.
5 is a flowchart illustrating an example in which a game server provides a probability item to a client terminal when a probability item payment condition is satisfied according to some embodiments of the present disclosure.
6 is a flowchart illustrating an example in which a game server recognizes whether a probability item payment condition is satisfied, according to some embodiments of the present disclosure.
7 is a flowchart illustrating another example in which a game server recognizes whether a probability item payment condition is satisfied, according to some embodiments of the present disclosure.
8 is a flowchart illustrating another example in which a game server recognizes whether a probability item payment condition is satisfied, according to some embodiments of the present disclosure.
9 is a flowchart illustrating an example in which a game server recognizes identification information of a probability type item according to some embodiments of the present disclosure.
10 is a diagram for describing an example of a hash range data table according to some embodiments of the present disclosure.
11 shows a simplified and general schematic diagram of an exemplary computing environment in which some embodiments of the present disclosure may be implemented.

Various embodiments and/or aspects are now disclosed with reference to the drawings. In the following description, for illustrative purposes, a number of specific details are disclosed to aid in an overall understanding of one or more aspects. However, it will also be appreciated by those of ordinary skill in the art that this aspect(s) may be practiced without these specific details. The following description and the annexed drawings set forth in detail certain illustrative aspects of one or more aspects. However, these aspects are exemplary and some of the various methods in the principles of the various aspects may be used, and the descriptions described are intended to include all such aspects and their equivalents. Specifically, as used herein, "an embodiment", "example", "aspect", "example" and the like are not construed as having any aspect or design being better or advantageous than other aspects or designs. May not.

In addition, various aspects and features will be presented by a system that may include one or more devices, terminals, servers, devices, components and/or modules, and the like. The devices, terminals, servers discussed in connection with the drawings, that various systems may include additional devices, terminals, servers, devices, components and/or modules, etc. It should also be understood and appreciated that it may not include all of devices, components, modules, etc.

As used herein, the terms "computer program", "component", "module", "system", etc. may be used interchangeably, and computer-related entities, hardware, firmware, software, combinations of software and hardware, Or it refers to the execution of software. For example, a component may be, but is not limited to, a process executed on a processor, a processor, an object, an execution thread, a program, and/or a computer. For example, both an application running on a computing device and a computing device may be components. One or more components may reside within a processor and/or thread of execution. A component can be localized on a single computer. A component can be distributed between two or more computers.

In addition, these components can execute from a variety of computer readable media having various data structures stored therein. Components can be, for example, via a signal with one or more data packets (e.g., data from one component interacting with another component in a local system, a distributed system, and/or a signal through another system and a network such as the Internet. Depending on the data being transmitted), it may communicate via local and/or remote processes.

Hereinafter, the same or similar components are assigned the same reference numerals regardless of the reference numerals, and redundant descriptions thereof will be omitted. In addition, in describing the embodiments disclosed in the present specification, when it is determined that detailed descriptions of related known technologies may obscure the subject matter of the embodiments disclosed in the present specification, detailed descriptions thereof will be omitted. In addition, the accompanying drawings are for easy understanding of the embodiments disclosed in the present specification, and the technical spirit disclosed in the present specification is not limited by the accompanying drawings.

The terms used in the present specification are for describing exemplary embodiments and are not intended to limit the present disclosure. In this specification, the singular form also includes the plural form unless specifically stated in the phrase. As used in the specification, “comprises” and/or “comprising” do not exclude the presence or addition of one or more other elements other than the mentioned elements.

Although the first, second, etc. are used to describe various devices or components, it is a matter of course that these devices or components are not limited by these terms. These terms are only used to distinguish one device or component from another device or component. Therefore, it goes without saying that the first device or component mentioned below may be a second device or component within the spirit of the present disclosure.

Unless otherwise defined, all terms (including technical and scientific terms) used in the present specification may be used as meanings that can be commonly understood by those of ordinary skill in the art to which this disclosure belongs. In addition, terms defined in a commonly used dictionary are not interpreted ideally or excessively unless explicitly defined specifically.

In addition, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or”. That is, unless specified otherwise or is not clear from the context, "X employs A or B" is intended to mean one of the natural inclusive substitutions. That is, X uses A; X uses B; Or, when X uses both A and B, “X uses A or B” can be applied to either of these cases. In addition, the term "and/or" as used herein should be understood to refer to and include all possible combinations of one or more of the listed related items.

In addition, the terms “information” and “data” as used herein may often be used interchangeably with each other.

The suffixes "module" and "unit" for constituent elements used in the following description are given or used interchangeably in consideration of only the ease of preparation of the specification, and do not have a distinct meaning or role by themselves.

Objects and effects of the present disclosure, and technical configurations for achieving them will become apparent with reference to the embodiments to be described later in detail together with the accompanying drawings. In describing the present disclosure, when it is determined that a detailed description of a well-known function or configuration may unnecessarily obscure the subject matter of the present disclosure, a detailed description thereof will be omitted. In addition, terms to be described later are terms defined in consideration of functions in the present disclosure and may vary according to the intention or custom of users or operators.

However, the present disclosure is not limited to the embodiments disclosed below, and may be implemented in various different forms. The present embodiments are provided only to make the present disclosure complete, and to completely inform the scope of the disclosure to those of ordinary skill in the art to which the present disclosure belongs, and the present disclosure is only defined by the scope of the claims. . Therefore, the definition should be made based on the contents throughout this specification.

The scope of rights to the actions in the claims of the present disclosure is generated by the functions and features described in each action, and unless the precedence relationship of the order in each action is specified, in the claims It is not affected by the order of description of each operation. For example, in the claims described as operations including operations A and B, even if operation A is described before operation B, the scope of the rights is not limited to that operation A must precede operation B.

FIG. 1 is a diagram illustrating an example of a game system based on a game server, a client terminal, and a blockchain network in which various aspects of the present disclosure may be implemented.

According to some embodiments of the present disclosure, a game system may include a game server 100, a client terminal 200, a blockchain network 300, and a network 400. However, the above-described components are not essential to implement the game system, and the game system may have more or fewer components than the components listed above.

Game server 100 may include any type of computer system or computer device, such as, for example, a microprocessor, mainframe computer, digital processor, portable device and device controller, and the like.

According to some embodiments of the present disclosure, the game server 100 may include a communication unit 110, a storage unit 120, and a control unit 130. However, the above-described components are not essential to implement the game server 100, and the game server 100 may have more or fewer components than the components listed above. Here, each component may be composed of a separate chip, module or device, or may be included in a single device.

The communication unit 110 of the game server 100 may include one or more modules that enable communication between the game server 100 and the client terminal 200 and between the game server 100 and the blockchain network 300. I can. In addition, the communication unit 110 may include one or more modules that connect the game server 100 to one or more networks.

The storage unit 120 of the game server 100 may store a program for the operation of the control unit 130 and may temporarily or permanently store input/output data. The storage unit 120 includes a flash memory type, a hard disk type, a multimedia card micro type, a card type memory (eg, SD or XD memory, etc.), RAM (Random Access Memory, RAM), SRAM (Static Random Access Memory), ROM (Read-Only Memory, ROM), EEPROM (Electrically Erasable Programmable Read-Only Memory), PROM (Programmable Read-Only Memory), magnetic memory, It may include at least one type of storage medium among magnetic disks and optical disks. The storage unit 120 may be operated under control by the control unit 130.

The controller 130 of the game server 100 generally controls the overall operation of the game server 100. The controller 130 may provide or process appropriate information or functions to a user by processing signals, data, information, etc. that are input or output through the above-described elements or by driving an application program stored in the storage unit 120. .

In addition, the controller 130 may control at least some of the components discussed with reference to FIG. 1 in order to drive the application program stored in the storage unit 120. Further, in order to drive the application program, the controller 130 may operate by combining at least two or more of the components included in the game server 100 with each other.

The game server 100 according to some embodiments of the present disclosure may issue a query or a transaction to at least one of the client terminal 200 and the blockchain network 300. The query in this disclosure may be used to query the client secret key and the hash value of the client secret key recorded on the blockchain network 300. The transaction in the present disclosure may be used to perform an update (modification/change/delete/add) on data recorded on the blockchain network 300.

The game server 100 may create a smart contract that can be operated on the blockchain network 300 using an arbitrary language such as Solidity. In addition, the game server 100 may generate a transaction for distributing the generated smart contract to the blockchain network 300.

The client terminal 200 may include any type of computer system or computer device, such as, for example, a microprocessor, mainframe computer, digital processor, portable device and device controller, and the like.

According to some embodiments of the present disclosure, the client terminal 200 may include a communication unit 210, a storage unit 220, and a control unit 230. However, the above-described components are not essential to implement the client terminal 200, and the client terminal 200 may have more or fewer components than the components listed above. Here, each component may be composed of a separate chip, module or device, or may be included in a single device.

The communication unit 210 of the client terminal 200 may include one or more modules that enable communication between the client terminal 200 and the game server 100, and between the client terminal 200 and the blockchain network 300. I can. In addition, the communication unit 210 may include one or more modules that connect the client terminal 200 to one or more networks.

The storage unit 220 of the client terminal 200 may store a program for the operation of the control unit 230 and may temporarily or permanently store input/output data. The storage unit 220 includes a flash memory type, a hard disk type, a multimedia card micro type, a card type memory (eg, SD or XD memory, etc.), RAM (Random Access Memory, RAM), SRAM (Static Random Access Memory), ROM (Read-Only Memory, ROM), EEPROM (Electrically Erasable Programmable Read-Only Memory), PROM (Programmable Read-Only Memory), magnetic memory, It may include at least one type of storage medium among magnetic disks and optical disks. The storage unit 220 may be operated under control by the controller 230.

The control unit 230 of the client terminal 200 generally controls the overall operation of the client terminal 200. The controller 230 may provide or process appropriate information or functions to a user by processing signals, data, information, etc. that are input or output through the above-described components or by driving an application program stored in the storage 120. .

In addition, the control unit 230 may control at least some of the constituent elements discussed with reference to FIG. 1 in order to drive the application program stored in the storage unit 220. Furthermore, in order to drive the application program, the controller 230 may operate by combining at least two or more of the components included in the client terminal 200 with each other.

The client terminal 200 according to some embodiments of the present disclosure may issue a query or a transaction to at least one of the game server 100 and the blockchain network 300. The query in this disclosure may be used to query the game server secret key and the hash value of the game server secret key recorded on the blockchain network 300. The transaction in the present disclosure may be used to perform an update (modification/change/delete/add) on data recorded on the blockchain network 300.

The client terminal 200 may create a smart contract that can be operated on the blockchain network 300 using an arbitrary language such as Solidity. In addition, the client terminal 200 may generate a transaction for distributing the generated smart contract to the blockchain network 300.

The client terminal 200 can access the game server 100 to play a game provided by the game server, and can use any type of game-related items acquired or purchased in the game in the game. . The game in the present specification may include any type of game such as a mobile game, a web game, a VR game, a P2P game, and an online/offline game.

In some embodiments of the present disclosure, the blockchain network 300 may mean a plurality of nodes operating based on blockchain technology. Here, the blockchain technology is a distributed storage technology that stores data to be managed in a plurality of nodes constituting a blockchain network using a storage structure in which blocks are connected in a chain form.

The blockchain network 300 may store transactions transmitted from the game server 100 and/or the client terminal 200 in a block form based on a predetermined consensus algorithm. Data stored in a block form may be shared by a plurality of nodes constituting the blockchain network 300.

In some exemplary embodiments of the present disclosure, nodes in the blockchain network 300 may operate by a blockchain core package according to a hierarchical structure. The hierarchical structure is: a data layer that defines the structure of data handled by the blockchain network 300 and manages the data, a fee paid to miners during the mining process, performing mining to verify the validity of blocks and generating blocks A consensus layer in charge of processing of, an execution layer that processes and executes smart contracts, a common layer that implements and manages P2P network protocols, hash functions, digital signatures, encoding and common storage, and various applications are created, processed and managed. It can include an application layer.

According to some embodiments of the present disclosure, each of the game server 100, the client terminal 200, and the blockchain network 300, through the network 400, provides data for a game system according to some embodiments of the present disclosure. Can be mutually transmitted and received.

Network 400 according to some embodiments of the present disclosure is a public switched telephone network (PSTN), x Digital Subscriber Line (xDSL), Rate Adaptive DSL (RADSL), Multi Rate DSL (MDSL), VDSL ( Various wired communication systems such as Very High Speed DSL), Universal Asymmetric DSL (UADSL), High Bit Rate DSL (HDSL), and local area network (LAN) can be used.

In addition, the network 400 presented here is CDMA (Code Division Multi Access), TDMA (Time Division Multi Access), FDMA (Frequency Division Multi Access), OFDMA (Orthogonal Frequency Division Multi Access), SC-FDMA (Single Carrier- FDMA) and other systems can be used.

The network 400 according to the embodiments of the present disclosure may be configured regardless of its communication mode, such as wired and wireless, and various types of short-range communication networks (PAN), local area networks (WAN: Wide Area Network), etc. It can be configured as a communication network. In addition, the network may be a known World Wide Web (WWW), and may use a wireless transmission technology used for short-range communication such as infrared (IrDA) or Bluetooth.

The techniques described herein may be used not only in the networks mentioned above, but also in other networks.

Various embodiments described herein may be implemented in a recording medium and a storage medium that can be read by a computer or a similar device using, for example, software, hardware, or a combination thereof.

According to hardware implementation, the embodiments described herein include application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), It may be implemented using at least one of processors, controllers, micro-controllers, microprocessors, and electrical units for performing other functions, in some cases herein. The described embodiments may be implemented by the control unit 130 of the game server 100 and/or the control unit 230 of the client terminal 200 itself.

According to the software implementation, embodiments such as procedures and functions described in the present specification may be implemented as separate software modules. Each of the software modules may perform one or more functions and operations described herein. The software code can be implemented as a software application written in an appropriate programming language. The software code is stored in the storage unit 120 of the game server 100 and/or the storage unit 220 of the client terminal 200, and the control unit 130 and/or the client terminal 200 of the game server 100 ) Can be executed by the control unit 230.

According to some embodiments of the present disclosure, the blockchain network 300 may include a plurality of nodes. In addition, at least one node included in the blockchain network 300 may receive a transaction from the game server 100 and/or the client terminal 200. In this case, each of a plurality of nodes included in the blockchain network 300 may verify a transaction through a consensus algorithm and generate a block. In addition, each of the plurality of nodes may record a transaction in the generated block.

The term “node” used in the present disclosure may be any type of computing device such as a server or terminal capable of exchanging data with at least one of “game server”, “client terminal” and “blockchain network”. . However, the present invention is not limited thereto, and the node may be any device capable of exchanging data between a plurality of nodes.

According to some embodiments of the present disclosure, a plurality of nodes included in the block chain network 300 may include a full block chain node and a light weight node.

A full block chain node can contain all block information from the first block of the block chain to a block that is currently newly created. In addition, the full blockchain node collects and stores all blockchain information, and can verify the received block to add a new block.

The lightweight node does not have the original of all block information, and may include only header information. In order for the lightweight node to verify the transaction, it can perform Simple Payment Verify (SPV).

For example, a lightweight node can request block information from a full blockchain node, and the authentication content of a transaction can be verified through Merkle Root.

However, for convenience of explanation, a plurality of nodes included in the blockchain network 300 may be described below assuming that they are full blockchain nodes.

In addition, the term “block” used in the present specification is a unit stored in a blockchain network, and can form a block chain by being connected to adjacent blocks. When the information of the game server 100, information of the client terminal 200, and information related to the information of the blockchain network 300 is issued as a transaction to the blockchain network, the transaction is included in the block and recorded in the blockchain network. I can. Depending on the settings of the blockchain network, the right to read, the right to consensus, and/or the right to verify the data stored in the block can be determined.

Smart contracts according to some embodiments of the present disclosure may be written in a digital language for probabilistic item payment and executed on any computing device. That is, when a code and/or a function included in a smart contract is executed, an arbitrary type of contract (eg, item payment according to probability) according to embodiments of the present disclosure may be executed.

A smart contract according to some embodiments of the present disclosure includes a method of creating a new smart contract, a method of executing a function on a specific smart contract, or a method of transmitting a coin operable in the blockchain network 300. It can be implemented by at least one. In addition, smart contracts can be executed by transactions or other contracts generated by externally owned accounts.

Smart contracts for paying probabilistic items according to some embodiments of the present disclosure, for example, to prevent malicious code such as infinite repetition and to ensure the integrity of data related to probabilistic item payments, a specific execution cost when executing a transaction It may be prescribed to pay. The execution cost here may mean any type of coin that can be traded on the blockchain network 300 or another type of medium that can be interlocked with the coin (eg, gas, etc.). As a non-limiting example, the base execution cost of the transaction may be set to 21,000 gas. For example, such execution costs may include the cost of processing the Elliptic Curve Digital Signature Algorithm (ECDSA) for the account address of the issuer of the transaction, the storage cost for storing the transaction, and the network bandwidth cost. If the smart contract is defined to pay a certain cost when executing the smart contract, malicious attacks such as infinite execution such as intentional DDoS attacks can be prevented.

Calls between smart contracts in order to perform probabilistic item payment according to some embodiments of the present disclosure may be implemented using a structure called a message. For example, these messages can be generated by a contract account (CA), and can be delivered to other contracts when calling a function. In one embodiment, since the message in this case is generated and processed inside the blockchain network 300, unlike transactions that occur in externally owned accounts, separate execution costs such as gas may not be incurred.

In implementing probabilistic item payment according to some embodiments of the present disclosure, when synchronizing through a blockchain by including a function of a smart contract in a transaction in the form of a compiled code, information included in the transaction is used as an input of the function. A smart contract can be implemented by executing a function expressed in code and storing the result in a separate state.

When the contents of the function and the input of the function are shared by a smart contract shared in the blockchain network 300, the integrity of the data can be guaranteed even if the result of the function is not separately shared.

In a further embodiment, the computing devices constituting the blockchain network 300 of the present disclosure for performing probabilistic item payments store a transaction storage database that changes the state of the smart contract and the latest state of the smart contract. It can also include a smart contract database. In this case, the smart contract for performing probability-type item payment in the present disclosure may be defined as an application that can change the state on the blockchain network 300 (i.e., a probability-type item payment application), The state of the smart contract can be defined as a variable used in the application (i.e., a probability item payment application), and an input value for changing it is issued from at least one of the game server 100 and the client terminal 200 Can be included in the transaction.

In a further embodiment, the database storing the state of the smart contract may be combined with the database storing the transaction to achieve a high compression rate. In addition, in order to achieve the distributed consensus of the database storing the state of the smart contract and low dependency of the smart contract, it can operate separately from the database storing the transaction.

A plurality of nodes included in the blockchain network 300 may share and store generated transactions and/or smart contracts through the network. In addition, a plurality of nodes can perform a function of recording a transaction in a block when the verification of the transaction and/or smart contract is completed through the consensus algorithm of the blockchain technology.

According to some embodiments of the present disclosure, the consensus algorithm performed in the blockchain network 300 is: PoW (Proof of Work) algorithm, PoS (Proof of Stake) algorithm, DPoS (Delegated Proof of Stake) algorithm, PBFT (Practical Byzantine Fault Tolerance) algorithm, Delegated Byzantine Fault Tolerance (DBFT) algorithm, Redundant Byzantine Fault Tolerance (RBFT) algorithm, Sieve algorithm, Tendermint algorithm, Paxos algorithm, Raft algorithm, PoA (Proof of Authority) algorithm and/or PoET (Proof of Elapsed Time) algorithm may be included.

By using the consensus algorithm of the blockchain technology, smart contracts and/or transactions including the contents of probabilistic item payments are recorded in a block, thereby creating an effect that forgery or alteration of probable item payments can be prevented.

Meanwhile, a block chain network structure according to some embodiments of the present disclosure may be of a public type or a private type. In the case of a public blockchain network, there is a disadvantage of inefficient in terms of consensus time, transaction processing speed, and efficiency of use of computing resources, as all nodes must perform verification in order to verify a transaction. Because it is possible, there may be advantages in the transparency and integrity of the stored data. In addition, in the case of a private (or consortium) block chain, since the operating entity is clear, there is an advantage of being efficient in terms of consensus time, transaction processing speed, and efficiency of use of computing resources, but transparency about the transaction processing process and results. There may be advantages in terms of

The consensus algorithm in some embodiments of the present disclosure may be a private or consortium-type blockchain network, but is not limited thereto, in order to improve the user experience through efficient use of computing resources and increase in transaction processing speed. Depending on the implementation, public type may be used as the consensus algorithm when it is desired to further emphasize the transparency of transactions or smart contracts.

A plurality of nodes included in the client terminal 200 and the blockchain network 300 may be associated with a user who wants to access the game server 100.

In the present disclosure, a plurality of nodes included in the client terminal 200 and the blockchain network 300 may access the game server 100 to perform a game provided by the game server 100. In addition, a plurality of nodes included in the client terminal 200 and the blockchain network 300 may purchase probabilistic items in the process of playing the game, and obtain game-related items in any form by using probabilistic items. I can. The game in the present disclosure may include any type of game such as a mobile game, a web game, a VR game, a P2P game, and an online/offline game. However, it is not limited thereto.

In this specification, the server secret key may be one encryption key generated by the game server 100. In addition, the client secret key may be one encryption key generated by the client terminal 200. For example, each of the server secret key and the client secret key may be made of numbers, letters, or combinations of numbers and letters. However, each of the server secret key and the client secret key is not limited thereto.

According to some embodiments to be described later in the following description, each of the server secret key and the client secret key may be used as a seed value of a random function. For example, when each of the server secret key and the client secret key consists of only numbers, an operation (sum, subtraction, or multiplication) value of the server secret key and the client secret key may be a seed value of the random function. However, the present invention is not limited thereto, and a value obtained by successively combining the server secret key and the client secret key may be the seed value of the random function.

In the present specification, the random function may be a function used to calculate a value (identification information of a probability item) corresponding to a probability item. For example, a result value (output value) of a random function having an operation value of a server secret key and a client secret key as a seed value (input value) may correspond to a probability item. Here, the random function may be, for example, a hash function. The hash function refers to a function that maps data having a specific length to data of a fixed length. As for the hash function, no matter what input value is input to the hash function, a result value of a preset length may be calculated. In addition, even if a part of the previous input value is changed, the hash function may calculate a result value not related to the previous result value. In other words, the hash function is a random function that cannot predict an input value as a result value.

According to some embodiments of the present disclosure, the game server 100 may generate an N-th server secret key corresponding to N hours. Additionally, the game server 100 may calculate a first hash value of the N-th server secret key. In addition, the game server 100 includes the first transaction in the blockchain network 300 so that the first transaction including the N-1 th server secret key and the first hash value is recorded in the N th block 320. It can be transmitted to at least one node. In this case, at least one node included in the blockchain network 300 may temporarily store the first transaction.

Here, the first transaction may be signed with the private key of the game server 100. In addition, the first transaction may include a transaction input value including identification information generated from the private key. In addition, the first transaction may include an N-1 th server secret key and a first hash value, and a transaction output value including address information in the blockchain network 300 in which the first transaction is to be stored.

According to some embodiments of the present disclosure, after N hours, the client terminal 200 may generate an N-th client secret key for probabilistic item purchase registration, and calculate a third hash value of the N-th client secret key. . In addition, the client terminal 200 may transmit the transaction to at least one node included in the blockchain network 300 so that the transaction including the third hash value is recorded in the N-th block 320.

Here, the transaction including the third hash value may be signed with the private key of the client terminal 200. In addition, the transaction including the third hash value may include a transaction input value including identification information generated from the private key. In addition, the transaction including the third hash value may include a transaction output value including address information in the blockchain network 300 in which the transaction including the third hash value and the third hash value will be stored.

On the other hand, each of the plurality of nodes included in the blockchain network 300 uses a consensus algorithm for a transaction including a first transaction received and temporarily stored from the game server 100 and a third hash value received from the client terminal. It can be verified through. In addition, each of the plurality of nodes generates an N-th block (N-th block 320) when the transaction including the first transaction and the third hash value is verified through the consensus algorithm, and is added to the N-th block. Transactions including one transaction and a third hash value can be recorded.

Specifically, in the transaction including the first transaction and the third hash value, any one node among a plurality of nodes extracts a first nonce value that satisfies a preset first condition, and the first nonce value is each of the plurality of nodes. When it is recognized as valid, it can be recognized as being verified through the consensus algorithm. Here, the preset first condition is satisfied when the hash value of the Nth block generated when the information stored in the header of the Nth block and the first nonce value are converted through a hash algorithm is less than the difficulty value of the Nth block. I can.

Here, the N-th block (N-th block 320) is a third hash value of the N-th client secret key generated for purchase registration of a probability item between N hours and N+1 hours in the client terminal 200 And a first time stamp. Here, the first time stamp may correspond to a time at which the probabilistic item is registered for purchase in the client terminal 200.

According to some embodiments of the present disclosure, the game server 100 may generate an N+1 th server secret key corresponding to N+1 time. In addition, the game server 100 may calculate a second hash value of the N+1 th server secret key. In addition, the game server 100 includes the second transaction in the blockchain network 300 so that the second transaction including the N-th server secret key and the second hash value is recorded in the N+1-th block 330. It can be transmitted to at least one node. In this case, at least one node included in the blockchain network 300 may temporarily store the second transaction.

Here, the second transaction may be signed with the private key of the game server 100. In addition, the second transaction may include a transaction input value including identification information generated from the private key. In addition, the first transaction may include an N-th server secret key and a second hash value, and a transaction output value including address information in the blockchain network 300 in which the second transaction is to be stored.

According to some embodiments of the present disclosure, after N+1 hours, the client terminal 200 performs a transaction such that a transaction including the N-th client secret key for using a probability item is recorded in the N+1-th block 330. It can be transmitted to at least one node included in the blockchain network 300.

Here, the transaction including the N-th client secret key may be signed with the private key of the client terminal 200. In addition, the transaction including the N-th client secret key may include a transaction input value including identification information generated from the private key. In addition, the transaction including the N-th client secret key includes a transaction output value including address information within the blockchain network 300 in which the transaction including the N-th client secret key and the N-th client secret key will be stored. I can.

On the other hand, each of the plurality of nodes included in the blockchain network 300 is a transaction including a second transaction received from the game server 100 and temporarily stored and an N-th client secret key received from the client terminal 200 Can be verified through the consensus algorithm. In addition, each of the plurality of nodes generates an N+1th block (N+1th block 330) when the second transaction and the transaction including the Nth client secret key are verified through a consensus algorithm, and the A transaction including the second transaction and the N-th client secret key may be recorded in the N+1th block.

Specifically, in the transaction including the second transaction and the N-th client secret key, any one node among a plurality of nodes extracts a second nonce value that satisfies a preset second condition, and the second nonce value is a plurality of nodes. When each is recognized as valid, it can be recognized as being verified through a consensus algorithm. Here, the preset second condition is that the hash value of the N+1th block generated when the information stored in the header of the N+1th block and the second nonce value are converted through a hash algorithm is the difficulty of the N+1th block. If it is less than the value, it can be satisfied.

Here, the N+1 th block (N+1 th block 330) may include an N th client secret key and a second time stamp of the client terminal 200 disclosed for use of a probability item. Here, the second time stamp may correspond to a time at which the probabilistic item registered for purchase in the client terminal 200 is used.

Using the consensus algorithm of blockchain technology, the secret key of the game server 100, the hash value of the secret key of the game server 100, the secret key of the client terminal 200, and the hash value of the secret key of the client terminal 200 Since transactions including, etc. are recorded in a block, forgery or alteration of the secret key of each of the game server 100 and the client terminal 200 can be prevented.

According to some embodiments of the present disclosure, the game server 100 may provide a probability item to a client terminal based on information recorded in the blockchain network 300. Specifically, the game server 100 is recorded in each of the Nth block 320 (the Nth block) and the N+1th block 330 (the N+1th block) included in the blockchain network 300. Based on the information, a probability type item may be provided to the client terminal 200.

For example, the game server 100 may receive a probability type item payment request signal from the client terminal 200 after the time recorded in the first time stamp. In addition, the game server 100 may recognize whether or not a probability-type item payment condition is satisfied based on a probability-type item payment request signal. In addition, when it is recognized that the probability-type item payment condition is satisfied, the game server 100 may provide a probability-type item corresponding to the probability-type item payment request signal to the client terminal 200.

That is, the game server 100 may provide a probability item to the client terminal 200 after receiving a request signal for a probability item payment from the client terminal 200.

As another example, the game server 100 may recognize whether a third hash value transmitted from the client terminal 200 exists in the N-th block 320. In addition, when the game server 100 recognizes the N-th client secret key recorded in the N+1-th block 330, it may recognize whether the probability type item payment condition is satisfied. In addition, when it is recognized that the probability-type item payment condition is satisfied, the game server 100 may provide a probability-type item corresponding to the purchase registration of the probability-type item to the client terminal 200.

That is, even if the game server 100 does not receive a separate probabilistic item payment request signal from the client terminal 200, when it recognizes the N-th client secret key recorded in the N+1-th block 330, the client terminal ( 200) can provide a probability item.

According to some embodiments of the present disclosure, the game server 100 uses the address of the N+1 th block 330, the first recorded in the N+1 th block 330 on the blockchain network 300. 2 You can search for transactions. Also, the game server 100 may recognize the N-th client secret key included in the searched second transaction.

As described above, in relation to the operation of the game server 100 transmitting a signal (query) for searching the N+1 th block 330, the communication unit 110 of the game server 100 performs the inquiry query in a block chain. It can be transmitted to the network 300, and the node receiving the query from the blockchain network 300 can perform a response thereto. In the case of such an inquiry (query) operation, since values stored in the blockchain network can be inquired without changing the blockchain data, the blockchain network 300 does not need to be synchronized separately. Therefore, the node of the blockchain network 300 can check its own DB by responding to a corresponding inquiry (query) and perform a quick response regardless of block synchronization.

The information inquiry query in the present disclosure may be used to search information recorded on the blockchain network 300. Transactions and/or smart contracts in this disclosure insert new data into the blockchain network 300 or update (modify/change/delete/add) data recorded on the blockchain network 300. Can be used.

A more detailed description of operations in which the game server 100 provides a probability item to the client terminal 200 will be described later in detail with reference to FIG. 2.

According to some embodiments of the present disclosure, the game server 100 may generate a third transaction by providing a probability item corresponding to a probability item payment request signal to the client terminal 200. In addition, the game server 100 transmits the third transaction to at least one node included in the blockchain network 300, so that when the third transaction is verified through a consensus algorithm, a specific block is generated in each of the plurality of nodes. And, it can cause the third transaction to be recorded in a specific block. Here, the third transaction may include information on the payment of a probability item to the client terminal 200 by the game server 100.

Meanwhile, each of a plurality of nodes included in the blockchain network 300 may verify a third transaction received from the game server 100 through a consensus algorithm. In addition, each of the plurality of nodes may generate a specific block and record the third transaction in the specific block when the third transaction is verified through the consensus algorithm.

Specifically, the third transaction extracts a third nonce value that satisfies a preset third condition by any one of the plurality of nodes, and uses a consensus algorithm when the third nonce value is recognized as valid in each of the plurality of nodes. It can be recognized that it has been verified through. Here, the preset third condition may be satisfied when the hash value of the specific block generated when the information stored in the header of the specific block and the third nonce value are converted through a hash algorithm is less than the difficulty value of the specific block.

Since the transaction including the payment details of the probability type item is recorded in a block using the consensus algorithm of the blockchain technology, the effect of preventing forgery or alteration of the payment details of the probability type item occurs.

2 is a flowchart illustrating an example in which a game server provides a probability item to a client terminal according to some embodiments of the present disclosure.

The controller 130 of the game server 100 may generate a server secret key at preset time intervals. In addition, the control unit 130 of the game server 100 may calculate a hash value of the server secret key generated at a preset time interval. In addition, the control unit 130 of the game server 100 includes a hash value of the server secret key generated at the previous time (eg, N-1 time) and the server secret key generated at the current time (eg, N time). The communication unit 110 may be controlled to transmit a transaction to at least one node included in the blockchain network 300.

Referring to FIG. 2, the controller 130 of the game server 100 may generate an N-th server secret key at N hours. In addition, the controller 130 may calculate a first hash value of the N-th server secret key (S101). In addition, the control unit 130 of the game server 100 includes the first transaction in the blockchain network 300 so that the first transaction including the N-1 th server secret key and the first hash value is recorded in the N th block. It may be transmitted to at least one node (S102). Here, the first transaction includes a hash range data table to which each of the hash range, information on the acquisition probability of each probability item, identification information of each of the probability items, and identification information of each of the probability items is mapped. It may contain more.

Meanwhile, at least one node included in the blockchain network 300 may temporarily store the first transaction received from the game server 100. Specifically, at least one node included in the blockchain network 300 may temporarily store the first transaction until it receives a transaction different from the first transaction from the client terminal 200 after N hours.

Here, the first transaction may be signed with the private key of the game server 100. In addition, the first transaction may include a transaction input value including identification information generated from the private key. In addition, the first transaction may include an N-1 th server secret key and a first hash value, and a transaction output value including address information in the blockchain network 300 in which the first transaction is to be stored.

According to some embodiments of the present disclosure, the control unit 230 of the client terminal 200 may generate the N-th client secret key for probabilistic item purchase registration between N hours and N+1 hours. In addition, the controller 230 may calculate a third hash value of the N-th client secret key (S103). In addition, the control unit 230 of the client terminal 200 may transmit the transaction to at least one node included in the blockchain network 300 so that the transaction including the third hash value is recorded in the N-th block (S104). .

Here, the transaction including the third hash value may be signed with the private key of the client terminal 200. In addition, the transaction including the third hash value may include a transaction input value including identification information generated from the private key. In addition, the transaction including the third hash value may include a transaction output value including address information in the blockchain network 300 in which the transaction including the third hash value and the third hash value will be stored.

According to some embodiments of the present disclosure, each of the transactions including the first transaction and the third hash value may be recorded in the N-th block by a plurality of nodes included in the blockchain network 300. Specifically, each of the plurality of nodes included in the blockchain network 300 is a transaction including a first transaction received from the game server 100 and temporarily stored and a third hash value received from the client terminal 200 Can be verified through the consensus algorithm. In addition, each of the plurality of nodes generates an N-th block when the transaction including the first transaction and the third hash value is verified through the consensus algorithm, and provides the first transaction and the third hash value to the N-th block. Containing transactions can be recorded.

Here, the N-th block includes a third hash value and a first time stamp of the N-th client secret key generated for purchase registration of a probability item between N hours and N+1 hours in the client terminal 200. I can. Here, the first time stamp may correspond to a time when a probability item is registered for purchase in the client terminal 200.

According to some embodiments of the present disclosure, at least one node included in the blockchain network 300 is an N-1 th server secret key, a first hash value of the N th server secret key, a hash range data table, and an N th client. An N-th block including the third hash value and the first time stamp of the secret key may be generated. In addition, at least one node included in the blockchain network 300 can propagate the generated N-th block to a plurality of nodes, the game server 100 and the client terminal 200 included in the blockchain network 300. Yes (S105).

According to some embodiments of the present disclosure, the controller 130 of the game server 100 may generate the N+1 th server secret key at N+1 times. In addition, the controller 130 may calculate a second hash value of the N+1 th server secret key (S106). In addition, the control unit 130 of the game server 100 includes the second transaction in the blockchain network 300 so that the second transaction including the N-th server secret key and the second hash value is recorded in the N+1-th block. It can be transmitted to at least one node (S107).

Meanwhile, at least one node included in the blockchain network 300 may temporarily store the second transaction received from the game server 100. Specifically, at least one node included in the blockchain network 300 may temporarily store the second transaction until it receives a transaction different from the second transaction from the client terminal 200 after N+1 hours.

Here, the second transaction may be signed with the private key of the game server 100. In addition, the second transaction may include a transaction input value including identification information generated from the private key. In addition, the first transaction may include an N-th server secret key and a second hash value, and a transaction output value including address information in the blockchain network 300 in which the second transaction is to be stored.

According to some embodiments of the present disclosure, the control unit 230 of the client terminal 200 blocks the transaction so that the transaction including the N-th client secret key is recorded in the N+1-th block for use of a probability item. It may be transmitted to at least one node included in the network 300 (S108).

According to some embodiments of the present disclosure, each of the second transaction and the transaction including the N-th client secret key may be recorded in the N+1-th block by a plurality of nodes included in the blockchain network 300. Specifically, each of the plurality of nodes included in the blockchain network 300 will verify through a consensus algorithm the second transaction and the transaction including the N-th client secret key that were temporarily stored and received from the game server 100. I can. In addition, each of the plurality of nodes, when the second transaction and the transaction including the N-th client secret key are verified through the consensus algorithm, generates an N+1 th block, and generates a second transaction and a second transaction in the N+1 th block. Transactions including the Nth client secret key can be recorded.

Here, the N+1th block (N+1th block) may include an Nth client secret key and a second time stamp of the client terminal 200 disclosed for use of a probability item. Here, the second time stamp may correspond to a time at which the probabilistic item registered for purchase in the client terminal 200 is used.

According to some embodiments of the present disclosure, at least one node included in the blockchain network 300 is an N-th server secret key, a second hash value of the N+1-th server secret key, a hash range data table, and an N-th client. An N+1 th block including a secret key and a second time stamp may be generated. In addition, at least one node included in the blockchain network 300 propagates the generated N+1th block to a plurality of nodes included in the blockchain network 300, the game server 100, and the client terminal 200. It can be done (S109).

According to some embodiments of the present disclosure, the control unit 230 of the client terminal 200 receives the N-th block from at least one node included in the blockchain network 300 through the communication unit 210 before N+1 hours. It can be preached. Also, the controller 230 may receive the N+1 th block from at least one node included in the blockchain network 300 through the communication unit 210 after N+1 hours. In this case, the control unit 230 of the client terminal 200 may recognize probability-type item identification information based on information recorded in each of the Nth block and the N+1th block (S110).

Specifically, the control unit 230 of the client terminal 200 may calculate a hash value of the N-th server secret key included in the N+1-th block. Also, the controller 230 may compare a hash value calculated as an N-th server secret key included in the N+1-th block with a hash value of the N-th server secret key recorded in the N-th block. Here, the hash value of the N-th server secret key recorded in the N-th block is calculated by the game server 100 at N times and transmitted to at least one node included in the blockchain network 300 to be recorded in the block. Can be a value.

That is, the control unit 230 of the client terminal 200 recognizes whether the N-th server secret key recorded in the N+1-th block matches the N-th server secret key generated by the game server 100 at N time. can do.

In addition, the control unit 230 of the client terminal 200, when the hash value calculated as the N-th server secret key included in the N+1-th block and the hash value of the N-th server secret key recorded in the N-th block match. , The seed value may be generated based on the N-th client secret key and the N-th server secret key.

According to some embodiments of the present disclosure, each of the server secret key and the client secret key may be made of a number. In this case, the control unit 230 of the client terminal 200 may determine an operation value of each of the server secret key and the client secret key as a seed value of the random function. As an example, the controller 230 may determine the seed value of the random function as a sum of the N-th client secret key and the N-th server secret key. As another example, the controller 230 may determine the seed value of the random function as an absolute value of a value obtained by subtracting the N-th client secret key and the N-th server secret key. As another example, the controller 230 may determine the seed value of the random function as a value obtained by multiplying the N-th client secret key by the N-th server secret key. However, the seed value of the random function is not limited thereto.

According to some other embodiments of the present disclosure, each of the server secret key and the client secret key may consist of a combination of numbers and letters or only letters. In this case, the controller 230 of the client terminal 200 may determine a value obtained by combining each of the server secret key and the client secret key or a value obtained by cross-combining each of the server secret key and the client secret key as a seed value of the random function. For example, when the N-th client secret key is'A1234' and the N-th server secret key is'B4584', the control unit 230 may determine'A1234B4584' combined with each secret key as a seed value of the random function. have. As another example, when the N-th client secret key is'A1B3C' and the N-th server secret key is'D4E8F', the control unit 230 determines'AD14BE38CF', which cross-links each secret key, as the seed value of the random function. I can. However, the seed value of the random function is not limited thereto.

That is, the control unit 230 of the client terminal 200 may determine the seed value of the random function using the secret value generated by each of the client terminal 200 and the game server 100 when registering an item purchase.

In addition, the control unit 230 of the client terminal 200 inputs a result value of a random function that inputs a seed value generated using a secret value generated by each of the client terminal 200 and the game server 100 when registering an item purchase. Can be calculated. In addition, the controller 230 may recognize identification information for a probability type item corresponding to a result value of the random function.

Specifically, the controller 230 may recognize a range value including a result value of the random function from the hash range data table included in the N-th block. Also, the controller 230 may recognize first identification information for an item corresponding to the range value in the hash range data table.

In the above-described operation of the control unit 230 of the client terminal 200 to recognize the identification information of the probability type item using the result value of the random function and the hash range data table, the control unit 130 of the game server 100 It may be included in an operation performed to recognize whether the type item payment condition is satisfied. That is, a more detailed description of how the game server 100 recognizes identification information of a probability item will be described later in detail with reference to FIGS. 9 and 10.

According to some embodiments of the present disclosure, the control unit 230 of the client terminal 200 may control the communication unit 210 to transmit a probability type item payment request signal including probability type item identification information to the game server 100. Can be (S111).

In this case, the control unit 130 of the game server 100 may recognize whether or not the probability type item payment condition is satisfied based on the probability type item payment request signal (S112).

In addition, when it is recognized that the probability type item payment condition is satisfied, the control unit 130 of the game server 100 provides the communication unit 110 to provide the probability type item corresponding to the probability type item request signal to the client terminal 200. It can be controlled (S113).

A more detailed description of whether the control unit 130 of the above-described game server 100 recognizes whether the probability-type item payment condition is satisfied will be described later in detail with reference to FIGS. 5 to 8.

The order of steps S101 to S113 of FIG. 2 may be changed as necessary, and at least one or more steps may be omitted or added. In addition, the above-described steps are only examples of the present disclosure, and the scope of the present disclosure is not limited thereto.

3 is a diagram illustrating a connection structure of blocks stored in a block chain network according to some embodiments of the present disclosure.

As shown in FIG. 3, blocks 30a and 30b, which are storage units in the block chain network 300, may be connected to each other in a chain form to form a block chain.

The blocks 30a and 30b may be composed of a block header and a transaction. The block header may include, for example, a hash value of a previous block header, a nonce value, and a hash value of a transaction group. The nonce value is a value that a node in the blockchain network 300 changes to generate a block, and may be used as an input value of a specific hash function along with other values of the block header. When a specific nonce value is used, if the hash value of the block header is smaller than the predetermined difficulty value (which can be stored in the block header), the hash value for the corresponding block header may be determined. The hash value of the transaction group may mean the root hash value of data included in the transaction.

As shown in FIG. 3, since the block hash value of the Nth block 30a is used as an input value to obtain the block hash value of the block header of the N+1th block 30b, the N+1th block ( 30b) and the N-th block 30a may be connected to each other. In addition, in obtaining the block hash value, since the hash value of the transaction group, which is a hash value representing transactions, is used as an input value, if any forgery behavior occurs for a transaction, the hash value of the transaction group is changed. In this way, adjacent blocks can be connected to each other, and transaction information within the block can be stored with integrity.

The transactions of the blocks 30a and 30b are transaction(s) recorded in a block among issued transactions, and when the transaction is included in the block, an operation related to the transaction may be performed in the blockchain network 300 .

As shown in FIG. 3, the transaction in the N-th block 30a is a transaction for the N-1th server secret key (Tx 1) and a transaction for the first hash value of the N-th server secret key (Tx 2 ) And a transaction (Tx 3) for a third hash value of the N-th client secret key. However, the present invention is not limited thereto, and the transaction in the N-th block 30a may include more transactions (Tx 4 to Tx7) as shown in FIG. 3, and fewer than the transactions shown in FIG. 3. It can also contain transactions.

In addition, the transaction in the N+1 th block 30b is a transaction for the N th server secret key (Tx 1), a transaction for the second hash value of the N+1 server key secret key (Tx 2), and N May include a transaction (Tx 3) for the second client secret key. However, the present invention is not limited thereto, and the transaction in the N+1 th block 30b may include more transactions (Tx 4 to Tx7) as illustrated in FIG. 3, and is more than the transactions illustrated in FIG. 3. May contain fewer transactions.

As an additional embodiment, although not shown in FIG. 3, the block headers of blocks 30a and 30b are: a hash value (ParentHash) of a parent block (previous block), an uncle block of the current block (blocks with relatively low difficulty The hash value (UncleHash) of the blocks that were not accepted as a result of mining, the account address (Coinbase) that will receive the transaction fee after mining, the hash value of the root node of the Merkle Patricia tree where the account status information is gathered (Root), all transactions in the block Merkletree's root node hash value (TxHash) for all transactions in the block, Merkletree's root node hash value (ReceiptHash) for all transactions in the block, 32-byte bloom filter information used to use log information (Bloom), transfer Block difficulty and block difficulty calculated by timestamp, current block number (Number), maximum payable gas per block (concept of cost (token) used to process transaction/smart contract) (GasLimit) , Used to ensure the number of calculations sufficient to calculate the hash value from the total of the gas used in the transaction in the block (GasUsed), the initial creation time of the block (Time), other information of the block (Extra) and/or proof of work. It can also contain values (MixDigest, Nonce). However, the present invention is not limited thereto, and the block header may include information, data, or values other than the above-described information, data, or value.

4 is a flowchart illustrating an example in which a game server transmits a transaction to at least one node included in a blockchain network according to some embodiments of the present disclosure.

The controller 130 of the game server 100 may generate a server secret key at preset time intervals. In addition, the control unit 130 of the game server 100 may calculate a hash value of the server secret key generated at a preset time interval. In addition, the control unit 130 of the game server 100 includes a hash value of the server secret key generated at the previous time (eg, N-1 time) and the server secret key generated at the current time (eg, N time). The communication unit 110 may be controlled to transmit a transaction to at least one node included in the blockchain network 300.

According to some embodiments of the present disclosure, the controller 130 of the game server 100 may generate an N-th server secret key corresponding to N times among preset time intervals. Also, the control unit 130 of the game server 100 may calculate a first hash value of the N-th server secret key.

For example, the controller 130 of the game server 100 may generate an N-th server secret key (encryption key) composed of a number or a combination of numbers and letters at N hours. Also, the controller 130 may obtain an output first hash value by inputting the N-th server secret key to the hash function. Here, the hash function refers to a function that maps data having a specific length to data of a fixed length. As for the hash function, no matter what input value is input to the hash function, a result value of a preset length may be calculated. In addition, even if a part of the previous input value is changed, the hash function may calculate a result value not related to the previous result value.

The control unit 130 of the game server 100 controls the communication unit 110 to transmit the first transaction including the N-1 th server secret key and the first hash value to at least one node included in the blockchain network. Can be (S212).

The control unit 130 of the game server 100 may generate an N+1 th server secret key corresponding to N+1 times among preset time intervals. In addition, the controller 130 may calculate a second hash value of the N+1 th server secret key (S213).

For example, the controller 130 of the game server 100 may generate an N+1 th server secret key (encryption key) composed of a number or a combination of numbers and letters at N+1 hours. Also, the controller 130 may obtain an output second hash value by inputting the N+1 th server secret key to the hash function.

The control unit 130 of the game server 100 controls the communication unit 110 to transmit a second transaction including the N-th server secret key and the second hash value to at least one node included in the blockchain network 300 It can be done (S214).

According to some embodiments of the present disclosure, the control unit 130 of the game server 100 may provide a probability type item to the client terminal 200 based on information recorded in each of the Nth block and the N+1th block. Can be (S215).

A more detailed description in which the control unit 130 of the above-described game server 100 provides a probability type item to a client terminal will be described later in detail with reference to FIGS. 5 to 10.

5 is a flowchart illustrating an example in which a game server provides a probability item to a client terminal when a probability item payment condition is satisfied according to some embodiments of the present disclosure.

According to some embodiments of the present disclosure, the control unit 130 of the game server 100 transmits the client terminal 200 through the communication unit 110 after the time recorded in the first time stamp (the time when the probability item is registered for purchase). ) From the probability type item payment request signal may be received (S221).

In this case, the control unit 130 may recognize whether or not the probability type item payment condition is satisfied based on the probability type item payment request signal (S222).

A more detailed description of whether the control unit 130 of the above-described game server 100 recognizes whether the probability-type item payment condition is satisfied will be described later in detail with reference to FIGS. 6 to 8.

The control unit 130 controls the communication unit 110 to provide a probability type item corresponding to the probability type item payment request signal to the client terminal 200 when it is recognized that the probability type item payment condition is satisfied (S222, Yes). It can be done (S223).

A more detailed description of how the control unit 130 of the game server 100 provides a probability item corresponding to a probability item payment request signal will be described later in detail with reference to FIGS. 9 and 10.

On the other hand, if the control unit 130 recognizes that the probability type item payment condition is not satisfied (S222, No), the client terminal 200 may not provide a probability type item corresponding to the probability type item payment request signal. . In addition, the control unit 130 may control the communication unit 110 to transmit a signal indicating that the probability-type item payment condition is not satisfied to the client terminal 200.

6 is a flowchart illustrating an example of recognizing whether a game server satisfies a probability-type item payment condition according to some embodiments of the present disclosure.

According to some embodiments of the present disclosure, the controller 130 of the game server 100 may calculate a fourth hash value of the N-th client secret key included in the N+1-th block (S231).

The controller 130 of the game server 100 may compare the third hash value and the fourth hash value (S232). Here, the third hash value may be a hash value obtained by calculating the N-th client secret key generated by the client terminal 200 for purchase registration of a probability item through a hash function. Here, the hash function refers to a function that maps data having a specific length to data of a fixed length. As for the hash function, no matter what input value is input to the hash function, a result value of a preset length may be calculated. In addition, even if a part of the previous input value is changed, the hash function may calculate a result value not related to the previous result value.

According to some embodiments of the present disclosure, when the third hash value and the fourth hash value match (S232, Yes), the control unit 130 of the game server 100 may recognize that the probability type item payment condition is satisfied. Yes (S233). In this case, the controller 130 may control the communication unit 110 to provide a probability type item corresponding to a probability type item payment request signal received from the client terminal 200 to the client terminal 200.

Meanwhile, when the third hash value and the fourth hash value do not match (S232, No), the control unit 130 of the game server 100 may recognize that the probability-type item payment condition is not satisfied. In this case, the controller 130 may control the communication unit 110 to transmit a signal indicating that the probability-type item payment condition is not satisfied to the client terminal 200.

That is, the control unit 130 of the game server 100 provides the original text of the hash value of the N-th secret key recorded in the previous block (N-th block) and the N-th secret key recorded in the current block (N+1-th block). Probability-type items are paid only when they match, preventing probability manipulation of probability-type items.

7 is a flowchart illustrating another example in which a game server recognizes whether a probability item payment condition is satisfied, according to some embodiments of the present disclosure.

According to some embodiments of the present disclosure, the controller 130 of the game server 100 may generate a seed value based on the N-th client secret key and the N-th server secret key (S214).

According to some embodiments of the present disclosure, each of the server secret key and the client secret key may be made of a number. In this case, the controller 130 of the game server 100 may determine an operation value of each of the server secret key and the client secret key as a seed value of the random function. As an example, the controller 130 may determine the seed value of the random function as a sum of the N-th client secret key and the N-th server secret key. As another example, the controller 130 may determine the seed value of the random function as an absolute value of a value obtained by subtracting the Nth client secret key and the Nth server secret key. As another example, the controller 130 may determine the seed value of the random function as a value obtained by multiplying the N-th client secret key by the N-th server secret key. However, the seed value of the random function is not limited thereto.

According to some other embodiments of the present disclosure, each of the server secret key and the client secret key may consist of a combination of numbers and letters or only letters. In this case, the controller 130 of the game server 100 may determine a value obtained by combining each of the server secret key and the client secret key or a value obtained by cross-combining each of the server secret key and the client secret key as a seed value of the random function. For example, when the N-th client secret key is'A1234' and the N-th server secret key is'B4584', the control unit 130 may determine'A1234B4584' combined with each secret key as the seed value of the random function. have. As another example, when the N-th client secret key is'A1B3C' and the N-th server secret key is'D4E8F', the control unit 130 determines'AD14BE38CF' by cross-linking each secret key as the seed value of the random function. I can. However, the seed value of the random function is not limited thereto.

According to some embodiments of the present disclosure, the controller 130 of the game server 100 may calculate a result value of a random function that inputs a seed value (S242). Here, the random function may be a function used to calculate a value (identification information for an item) corresponding to a probability type item. For example, the random function may be a hash function. Here, the hash function refers to a function that maps data having a specific length to data of a fixed length. As for the hash function, no matter what input value is input to the hash function, a result value of a preset length may be calculated. In addition, even if a part of the previous input value is changed, the hash function may calculate a result value not related to the previous result value.

The controller 130 of the game server 100 may recognize first identification information for an item corresponding to a result value of the random function (S243). A more detailed description of the above-described control unit 130 recognizing the first identification information for the item corresponding to the result value of the random function will be described later in detail with reference to FIGS. 9 and 10.

According to some embodiments of the present disclosure, the controller 130 of the game server 100 may compare the first identification information and the second identification information (S244). Here, the second identification information may be identification information on the payment request item included in the probability type item payment request signal received from the client terminal 200 by the control unit 130.

According to some embodiments of the present disclosure, when it is recognized that the first identification information and the second identification information match (S244, Yes), the control unit 130 of the game server 100 indicates that the probability-type item payment condition is satisfied. It can be recognized (S245). In this case, the controller 130 may control the communication unit 110 to provide a probability type item corresponding to a probability type item payment request signal received from the client terminal 200 to the client terminal 200. That is, the game server 100 may provide a probability type item corresponding to the first identification information or the second identification information to the client terminal 200.

On the other hand, when the control unit 130 of the game server 100 recognizes that the first identification information and the second identification information do not match (S244, No), it may recognize that the probability-type item payment condition is not satisfied. In this case, the controller 130 may control the communication unit 110 to transmit a signal indicating that the probability-type item payment condition is not satisfied to the client terminal 200.

That is, the control unit 130 of the game server 100 includes identification information of the probability type item recognized by the client terminal 200 through a random function and the identification information of the probability type item recognized by the control unit 130 through a random function. Probability-type items are provided only when they match, preventing false requests for probability-type items.

8 is a flowchart illustrating another example in which a game server recognizes whether a probability item payment condition is satisfied, according to some embodiments of the present disclosure.

According to some embodiments of the present disclosure, the controller 130 of the game server 100 may calculate a fourth hash value of the N-th client secret key included in the N+1-th block (S251).

The controller 130 of the game server 100 may compare the third hash value and the fourth hash value (S252). Here, the third hash value may be a hash value obtained by calculating the N-th client secret key generated by the client terminal 200 for purchase registration of a probability item through a hash function. Here, the hash function refers to a function that maps data having a specific length to data of a fixed length. As for the hash function, no matter what input value is input to the hash function, a result value of a preset length may be calculated. In addition, even if a part of the previous input value is changed, the hash function may calculate a result value not related to the previous result value.

According to some embodiments of the present disclosure, when the third hash value and the fourth hash value match (S252, Yes), the control unit 130 of the game server 100 may provide an N-th client secret key and an N-th server secret key. On the basis of, a seed value may be generated (S253).

According to some embodiments of the present disclosure, each of the server secret key and the client secret key may be made of a number. In this case, the controller 130 of the game server 100 may determine an operation value of each of the server secret key and the client secret key as a seed value of the random function. As an example, the controller 130 may determine the seed value of the random function as a sum of the N-th client secret key and the N-th server secret key. As another example, the controller 130 may determine the seed value of the random function as an absolute value of a value obtained by subtracting the Nth client secret key and the Nth server secret key. As another example, the controller 130 may determine the seed value of the random function as a value obtained by multiplying the N-th client secret key by the N-th server secret key. However, the seed value of the random function is not limited thereto.

According to some other embodiments of the present disclosure, each of the server secret key and the client secret key may consist of a combination of numbers and letters or only letters. In this case, the controller 130 of the game server 100 may determine a value obtained by combining each of the server secret key and the client secret key or a value obtained by cross-combining each of the server secret key and the client secret key as a seed value of the random function. For example, when the N-th client secret key is'A1234' and the N-th server secret key is'B4584', the control unit 130 may determine'A1234B4584' combined with each secret key as the seed value of the random function. have. As another example, when the N-th client secret key is'A1B3C' and the N-th server secret key is'D4E8F', the control unit 130 determines'AD14BE38CF' by cross-linking each secret key as the seed value of the random function. I can. However, the seed value of the random function is not limited thereto.

Meanwhile, when the third hash value and the fourth hash value do not match (S252, No), the control unit 130 of the game server 100 may recognize that the probability-type item payment condition is not satisfied. In this case, the controller 130 may control the communication unit 110 to transmit a signal indicating that the probability-type item payment condition is not satisfied to the client terminal 200.

Accordingly, the control unit 130 of the game server 100 provides the original text of the hash value of the N-th secret key recorded in the previous block (N-th block) and the N-th secret key recorded in the current block (N+1-th block). Probability-type items are paid only when they match, so that probability manipulation of probability-type items can be prevented.

According to some embodiments of the present disclosure, the controller 130 of the game server 100 may calculate a result value of a random function that inputs a seed value (S254). Here, the random function may be a function used to calculate a value (identification information for an item) corresponding to a probability type item. For example, the random function may be a hash function.

The controller 130 of the game server 100 may recognize first identification information for an item corresponding to the result value of the random function (S255). A more detailed description of the above-described control unit 130 recognizing the first identification information for the item corresponding to the result value of the random function will be described later in detail with reference to FIGS. 9 and 10.

According to some embodiments of the present disclosure, the control unit 130 of the game server 100 may compare the first identification information and the second identification information (S256). Here, the second identification information may be identification information on the payment request item included in the probability type item payment request signal received from the client terminal 200 by the control unit 130.

According to some embodiments of the present disclosure, when it is recognized that the first identification information and the second identification information match (S256, Yes), the control unit 130 of the game server 100 indicates that the probability-type item payment condition is satisfied. It can be recognized (S257). In this case, the controller 130 may control the communication unit 110 to provide a probability type item corresponding to a probability type item payment request signal received from the client terminal 200 to the client terminal 200. That is, the game server 100 may provide a probability type item corresponding to the first identification information or the second identification information to the client terminal 200.

On the other hand, when the controller 130 of the game server 100 recognizes that the first identification information and the second identification information do not match (S256, No), it may recognize that the probability-type item payment condition is not satisfied. In this case, the controller 130 may control the communication unit 110 to transmit a signal indicating that the probability-type item payment condition is not satisfied to the client terminal 200.

That is, the control unit 130 of the game server 100 provides the original text of the hash value of the N-th secret key recorded in the previous block (N-th block) and the N-th secret key recorded in the current block (N+1-th block). By providing the probability item only when the identification information of the probability item recognized by the client terminal 200 through the random function and the identification information of the probability item recognized by the control unit 130 through the random function match. , The manipulation of the seed value (or the secret key used for the seed value) is prevented, and the act of falsely requesting the probability type item is prevented, so that the reliability and integrity of the sale and purchase of the probability type item can be secured.

9 is a flowchart illustrating an example in which a game server recognizes identification information of a probability type item according to some embodiments of the present disclosure.

According to some embodiments of the present disclosure, the control unit 130 of the game server 100 may recognize a range value including a result value of a random function from the hash range data table (S261).

Specifically, the controller 130 may recognize the range value by using a preset number of digits in the hash range of the hash range data table among the result values of the random function. That is, in the hash range data table, the range value may be included in the hash range. Here, the hash range data table may be recorded in at least one of the Nth block and the N+1th block of the blockchain network 300.

According to some embodiments of the present disclosure, the controller 130 may recognize first identification information for an item corresponding to a range value in the hash range data table (S262). Specifically, the controller 130 may recognize first identification information, which is item identification information mapped to a range value, in the hash range data table.

A more detailed description of the hash range data table used by the control unit 130 of the above-described game server 100 to recognize first identification information, which is item identification information, will be described later in detail with reference to FIG. 10.

The order of the steps of FIGS. 4 to 9 described above may be changed as necessary, and at least one or more steps may be omitted or added. In addition, the above-described steps are only examples of the present disclosure, and the scope of the present disclosure is not limited thereto.

10 is a diagram for describing an example of a hash range data table according to some embodiments of the present disclosure.

For convenience of explanation, FIG. 10 will be described below by limiting the result value and the hash range of the random function to a decimal number, but the result value and the hash range of the random function are not limited thereto and may be hexadecimal numbers.

According to some embodiments of the present disclosure, the hash range data table 90 may be a data table to which each of the hash range 91, the range value 92, the item identification information 93, and the acquisition probability 94 is mapped. .

According to some embodiments of the present disclosure, the hash range 91 may be ten digits. That is, the hash range 91 may be 00 to 99. Also, the range value 92 may be included in the hash range 91 of 00 to 99. However, the number of digits of the hash range 91 is not limited thereto, and may be a digit of 100, a digit of 1000, or more.

As shown in FIG. 10, when the hash range 91 is '00 to 09', the range value 92 is'A', and when the hash range 91 is '10 to 29', the range value 92 is 'B', if the hash range 91 is '30 to 59', the range value 92 is'C', and if the hash range 91 is '60 to 99', the range value 92 is'D' Can be.

For example, when the result value of the random function is '7635732166423168', the control unit 130 may recognize that the range value 92 is'D' by using '68' which is the number of digits of 10. Further, the controller 130 may recognize the item identification information mapped to the range value'D' as'F54486', and recognize that the first identification information of the random function result value '7635732166423168' is'F54486'.

As another example, when the result value of the random function is '8569412314713201', the control unit 130 may recognize that the range value 92 is'A' by using the number of digits of 10 '01'. Further, the controller 130 may recognize the item identification information mapped to the range value'A' as'A35781' and recognize that the first identification information of the random function result value '8569412314713201' is'A35781'.

According to some embodiments of the present disclosure, each of the range values 92 may be mapped to item identification information 93.

As shown in FIG. 10, the range value 92 may be'A','B','C', and'D'. In addition, the range value 92'A' is mapped to the item identification information 93'A35781', the range value 92'B' is mapped to the item identification information 93'S58426', and the range value 92 )'C' may be mapped to item identification information 93'D51857', and a range value 92'D' may be mapped to item identification information 93'F54486'.

As an example, when the result value of the random function is '7635732166423168', the control unit 130 recognizes the range value'D' by using '68' which is the number of digits of 10, and the first value corresponding to the result value of the random function The identification information can be recognized as'F54486'. As another example, when the result value of the random function is '8569412314713201', the control unit 130 recognizes the range value'A' using the number of digits '01' of 10, and the first value corresponding to the result value of the random function The identification information can be recognized as'A35781'.

According to some embodiments of the present disclosure, each item identification information 93 may be mapped with an acquisition probability 94.

As illustrated in FIG. 10, item identification information 93'A35781' mapped to a range value 92'A' may be mapped to an acquisition probability 94 '10%'. Also, the item identification information 93'S58426' mapped to the range value 92'B' may be mapped to the acquisition probability 94 '20%'. Also, the item identification information 93'D51857' mapped to the range value 92'C' may be mapped to the acquisition probability 94 '30%'. Also, the item identification information 93'F54486' mapped to the range value 92'D' may be mapped to the acquisition probability 94 '40%'.

According to some embodiments of the present disclosure, the grade of the item may be different according to the acquisition probability 94 of the probability type item.

For example, if the probability-type item has the lowest acquisition probability of 10%, it may be a myth grade item with the highest grade. In addition, the probability-type item may be a general grade item having the lowest grade when the acquisition probability is 40%.

The above-described hash range data table 90 is only a few examples to help the controller 130 of the game server 100 recognize the identification information of the probability type item, and is not limited thereto.

11 shows a simplified and general schematic diagram of an exemplary computing environment in which embodiments of the present disclosure may be implemented.

While the present disclosure has generally been described above with respect to computer-executable instructions that can be executed on one or more computers, those skilled in the art will appreciate that the present disclosure may be implemented in combination with other program modules and/or as a combination of hardware and software. will be.

In general, modules herein include routines, procedures, programs, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Further, to those skilled in the art, the method of the present disclosure is not limited to single-processor or multiprocessor computer systems, minicomputers, mainframe computers, as well as personal computers, handheld computing devices, microprocessor-based or programmable household appliances, and the like (each of which It will be appreciated that it may be implemented with other computer system configurations, including one or more associated devices).

The described embodiments of the present disclosure may also be practiced in a distributed computing environment where certain tasks are performed by remote processing devices that are connected through a communication network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.

Computers typically include a variety of computer-readable media. Computer-readable media can be any computer-readable media, including volatile and non-volatile media, transitory and non-transitory media, removable and non-transitory media. Includes removable media. By way of example, and not limitation, computer-readable media may include computer-readable storage media and computer-readable transmission media.

Computer-readable storage media include volatile and nonvolatile media, transitory and non-transitory media, removable and non-removable media implemented in any method or technology for storing information such as computer-readable instructions, data structures, program modules or other data. Includes the medium. Computer-readable storage media include RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital video disk (DVD) or other optical disk storage, magnetic cassette, magnetic tape, magnetic disk storage, or other magnetic storage. Devices, or any other medium that can be accessed by a computer and used to store desired information.

Computer-readable transmission media typically implement computer-readable instructions, data structures, program modules or other data on a modulated data signal such as a carrier wave or other transport mechanism. Includes all information transmission media. The term modulated data signal refers to a signal in which one or more of the characteristics of the signal is set or changed to encode information in the signal. By way of example, and not limitation, computer-readable transmission media include wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared, and other wireless media. Combinations of any of the above-described media are also intended to be included within the scope of computer-readable transmission media.

An exemplary environment 1100 is shown that implements various aspects of the present disclosure, including a computer 1102, which includes a processing device 1104, a system memory 1106, and a system bus 1108. do. System bus 1108 couples system components, including but not limited to, system memory 1106 to processing device 1104. The processing unit 1104 may be any of a variety of commercially available processors. Dual processors and other multiprocessor architectures may also be used as processing unit 1104.

The system bus 1108 may be any of several types of bus structures that may be additionally interconnected to a memory bus, a peripheral bus, and a local bus using any of a variety of commercial bus architectures. System memory 1106 includes read-only memory (ROM) 1110 and random access memory (RAM) 1112. The basic input/output system (BIOS) is stored in non-volatile memory 1110 such as ROM, EPROM, EEPROM, etc. This BIOS is a basic input/output system that helps transfer information between components in the computer 1102, such as during startup. Includes routines. RAM 1112 may also include high speed RAM such as static RAM for caching data.

Computer 1102 also includes internal hard disk drive (HDD) 1114 (e.g., EIDE, SATA)-This internal hard disk drive 1114 can also be configured for external use within a suitable chassis (not shown). Yes--, magnetic floppy disk drive (FDD) 1116 (for example, to read from or write to removable diskette 1118), and optical disk drive 1120 (e.g., CD-ROM For reading the disk 1122 or reading from or writing to other high-capacity optical media such as DVD). The hard disk drive 1114, magnetic disk drive 1116, and optical disk drive 1120 are each connected to the system bus 1108 by a hard disk drive interface 1124, a magnetic disk drive interface 1126, and an optical drive interface 1128. ) Can be connected. The interface 1124 for implementing an external drive includes, for example, at least one or both of USB (Universal Serial Bus) and IEEE 1394 interface technologies.

These drives and their associated computer readable media provide non-volatile storage of data, data structures, computer executable instructions, and the like. In the case of computer 1102, drives and media correspond to storing any data in a suitable digital format. Although the description of the computer-readable storage medium above refers to a removable optical medium such as a HDD, a removable magnetic disk, and a CD or DVD, those skilled in the art may include a zip drive, a magnetic cassette, a flash memory card, a cartridge, It will be appreciated that other types of computer-readable storage media, such as etc., may also be used in the exemplary operating environment and that any such media may contain computer-executable instructions for performing the methods of the present disclosure. .

A number of program modules, including the operating system 1130, one or more application programs 1132, other program modules 1134, and program data 1136, may be stored in the drive and RAM 1112. All or part of the operating system, applications, modules, and/or data may also be cached in RAM 1112. It will be appreciated that the present disclosure may be implemented on a number of commercially available operating systems or combinations of operating systems.

A user may input commands and information to the computer 1102 through one or more wired/wireless input devices, for example, a pointing device such as a keyboard 1138 and a mouse 1140. Other input devices (not shown) may include a microphone, IR remote control, joystick, game pad, stylus pen, touch screen, and the like. These and other input devices are often connected to the processing unit 1104 through the input device interface 1142, which is connected to the system bus 1108, but the parallel port, IEEE 1394 serial port, game port, USB port, IR interface, It can be connected by other interfaces such as etc.

A monitor 1144 or other type of display device is also connected to the system bus 1108 through an interface such as a video adapter 1146. In addition to the monitor 1144, the computer generally includes other peripheral output devices (not shown) such as speakers, printers, etc.

Computer 1102 may operate in a networked environment using logical connections to one or more remote computers, such as remote computer(s) 1148 via wired and/or wireless communication. The remote computer(s) 1148 may be a workstation, server computer, router, personal computer, portable computer, microprocessor-based entertainment device, peer device, or other common network node, and is generally referred to as a computer 1102. Although including many or all of the described components, only memory storage device 1150 is shown for simplicity. The logical connections shown include wired/wireless connections to a local area network (LAN) 1152 and/or to a larger network, eg, a wide area network (WAN) 1154. Such LAN and WAN networking environments are common in offices and companies, and facilitate an enterprise-wide computer network such as an intranet, all of which can be connected to a worldwide computer network, for example the Internet.

When used in a LAN networking environment, the computer 1102 is connected to the local network 1152 via a wired and/or wireless communication network interface or adapter 1156. Adapter 1156 may facilitate wired or wireless communication to LAN 1152, which also includes a wireless access point installed therein to communicate with wireless adapter 1156. When used in a WAN networking environment, the computer 1102 may include a modem 1158, connected to a communication server on the WAN 1154, or through the Internet, etc. to establish communication through the WAN 1154 Have means. The modem 1158, which may be an internal or external and a wired or wireless device, is connected to the system bus 1108 through a serial port interface 1142. In a networked environment, program modules described for the computer 1102 or portions thereof may be stored in the remote memory/storage device 1150. It will be appreciated that the network connections shown are exemplary and other means of establishing communication links between computers may be used.

Computer 1102 is associated with any wireless device or entity deployed and operated in wireless communication, e.g., a printer, scanner, desktop and/or portable computer, portable data assistant (PDA), communication satellite, wireless detectable tag. It operates to communicate with any device or place and phone. This includes at least Wi-Fi and Bluetooth wireless technologies. Thus, the communication may be a predefined structure as in a conventional network or may simply be ad hoc communication between at least two devices.

Wi-Fi (Wireless Fidelity) allows you to connect to the Internet, etc. without wires. Wi-Fi is a wireless technology such as a cell phone that allows such devices, for example computers, to transmit and receive data indoors and outdoors, ie anywhere within the coverage area of a base station. Wi-Fi networks use a wireless technology called IEEE 802.11 (a,b,g, etc.) to provide a secure, reliable and high-speed wireless connection. Wi-Fi can be used to connect computers to each other, to the Internet and to a wired network (using IEEE 802.3 or Ethernet). Wi-Fi networks can operate in unlicensed 2.4 and 5 GHz radio bands, for example at 11 Mbps (802.11a) or 54 Mbps (802.11b) data rates, or in products that include both bands (dual band). have.

A person of ordinary skill in the art of the present disclosure includes various exemplary logical blocks, modules, processors, means, circuits and algorithm steps described in connection with the embodiments disclosed herein, electronic hardware, (convenience). For the sake of clarity, it will be appreciated that it may be implemented by various forms of program or design code or a combination of both (referred to herein as "software"). To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends on the particular application and design constraints imposed on the overall system. A person of ordinary skill in the art of the present disclosure may implement the described functions in various ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

The various embodiments presented herein may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques. The term “article of manufacture” includes a computer program, carrier, or media accessible from any computer-readable device. For example, computer-readable storage media include magnetic storage devices (e.g., hard disks, floppy disks, magnetic strips, etc.), optical disks (e.g., CD, DVD, etc.), smart cards, and flash Memory devices (e.g., EEPROM, card, stick, key drive, etc.). The term “machine-readable medium” includes, but is not limited to, wireless channels and various other media capable of storing, holding, and/or transmitting instruction(s) and/or data.

It is to be understood that the specific order or hierarchy of steps in the presented processes is an example of exemplary approaches. Based on the design priorities, it is to be understood that within the scope of the present disclosure a specific order or hierarchy of steps in processes may be rearranged. The appended method claims provide elements of the various steps in a sample order, but are not meant to be limited to the specific order or hierarchy presented.

The description of the presented embodiments is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these embodiments will be apparent to those of ordinary skill in the art, and general principles defined herein may be applied to other embodiments without departing from the scope of the present disclosure. Thus, the present disclosure is not limited to the embodiments presented herein, but is to be interpreted in the widest scope consistent with the principles and novel features presented herein.

Claims (1)

A computer program stored on a computer-readable storage medium.

Images