KR102466411B1 - System for providing blockchain based game service - Google Patents

Abstract

Provided is a system for providing a blockchain-based game service, comprising: a user terminal opening a one-on-one or one-on-two or more tournament game, conducting a game with an opponent of the opened game for obtaining the prize for participation cost by a winner-takes-it-all method; one or more opponent terminals participating in the game opened by the user terminal by paying the participation cost, and conducting the game for obtaining the prize for participation cost by a winner-takes-it-all method; and a game service provision server including a game opening unit receiving the selection of the type of the tournament game from the user terminal and opening the game when the user terminal opens the one-on-one or one-on-two or more tournament game, a transaction unit which, when the opponent terminals participate in the game, transfers money for the participation cost from an electronic wallet of the opponent terminals to an electronic wallet of the user terminal, and a payment unit paying the prize for participation cost to the final winner after conducting the game between the user terminal and the one or more opponent terminals in a tournament type. The present invention is able to zero the possibility of forgery and the manipulation of game.

Description

Blockchain-based game service providing system {SYSTEM FOR PROVIDING BLOCKCHAIN BASED GAME SERVICE}

The present invention relates to a blockchain-based game service providing system, and provides a platform for conducting tournament games and lottery games based on blockchain.

According to the tournament theory, if the vertical reward gap widens in a Zero-Sum Game, which is implemented within the total reward amount set at a certain level, the more reward someone gets, the less money the rest will have to take. . This winner-takes-all structure makes tournament participants struggle to win in competition with each other. This makes people more voluntarily immersed in their work and provides an incentive to continuously participate in tournaments. The Sorting Effect in tournament theory naturally provides high performers with an incentive to remain in the game, and tournament survivors are motivated to play harder and harder because the opportunity to win high rewards increases. likely to become stronger.

At this time, a method for a user to host a tournament game or to play a tournament game has been researched and developed. In this regard, prior art Korean Patent No. 10-1014271 (published on February 16, 2011) and Korean Registered Patent No. In No. 10-1211313 (announcement on December 11, 2012), the number of people and the participation amount are set from the user, the application for opening a tournament game is received, the game room with the specified number of people is allocated to the user, and after receiving the application for participation, the number of people If the condition is satisfied, the game money of each gamer in the game room is set equal based on the participation amount, and then the tournament game is played. After receiving the participation application from the game terminal, extracting the game of the lowest depth, randomly participating Thus, configurations for proceeding with the next game are disclosed.

However, in the former case, only the configuration in which the game cannot be played if the number of players is not met, and even in the latter case, it is not a one-on-one tournament, but the score is calculated after participating in the game one by one. It is not an ongoing configuration. Recently, thanks to the popularity of the squid game, a tournament-type game in which people directly participate to determine the winner is in vogue, and game manipulation that changes the outcome or changes the winner by the intervention of the organizer or platform while the game is in progress is taking place. In addition, in the case of lottery games, the number of inflows is declining due to controversy over fairness that the winner has already been decided or that the organizer gives the number to relatives and plays their own game. Therefore, it is required to research and develop a platform that can eliminate the controversy over the fairness of a game in which a human tournament is conducted.

An embodiment of the present invention is to generate and record the results of each game in real time when a tournament or lottery game is played based on a block chain, thereby reducing the possibility of forgery to zero and game operation, and when each game is played, the game operation is zero. It creates a one-on-one matchup so that a person-to-person match can be made, not a person-to-person match, and it does not start after people gather, but only the application deadline and start date are set. As a matter of course, the conditions can be fulfilled accordingly, so that if the game is hosted and the application is made, the game can start on that date. It can provide a blockchain-based game service providing system that can However, the technical problem to be achieved by the present embodiment is not limited to the technical problem as described above, and other technical problems may exist.

As a technical means for achieving the above technical problem, an embodiment of the present invention is a game in which a one-to-one or one-to-many tournament game is opened, and then a game is played with an opponent of the opened game to obtain a participation fee in a winner-takes-all method. In the case of opening a one-to-one or one-to-many tournament game in a user terminal, at least one counterpart terminal playing a game in which participation fees are paid and participated in games opened by the user terminal, and participation fees are obtained in a winner-takes-all method, and a tournament A game opening unit that selects and opens a game type from the user terminal, a transaction unit that transfers the participation fee from the electronic wallet of the counterpart terminal to the electronic wallet of the user terminal when participating in the game from the counterpart terminal, and the user terminal and at least one counterpart terminal and a game service providing server including a payment unit for paying a participation fee to a final winner after the game is played in a tournament format.

According to any one of the above-described problem solving means of the present invention, when a tournament or lottery game is played based on a block chain, the result of each game is generated and recorded in real time, thereby reducing the possibility of forgery and reducing game operation to zero, When each game is played, a one-to-one match is created so that a person-to-person match, not a game-person match, is created. It is not started after people gather, but only the application deadline and start date are set, and conditions are determined by the person. By making sure that the conditions are fulfilled according to the date, not the fulfillment, if you host the game and apply for participation, you can start on that date. Existing members may be encouraged to remain.

1 is a diagram for explaining a blockchain-based game service providing system according to an embodiment of the present invention.
FIG. 2 is a block diagram illustrating a game service providing server included in the system of FIG. 1 .
3 and 4 are diagrams for explaining an embodiment in which a blockchain-based game service is implemented according to an embodiment of the present invention.
5 is an operational flowchart for explaining a method for providing a blockchain-based game service according to an embodiment of the present invention.

Hereinafter, embodiments of the present invention will be described in detail so that those skilled in the art can easily practice the present invention with reference to the accompanying drawings. However, the present invention may be embodied in many different forms and is not limited to the embodiments described herein. And in order to clearly explain the present invention in the drawings, parts irrelevant to the description are omitted, and similar reference numerals are attached to similar parts throughout the specification.

Throughout the specification, when a part is said to be "connected" to another part, this includes not only the case where it is "directly connected" but also the case where it is "electrically connected" with another element interposed therebetween. . In addition, when a part "includes" a certain component, this means that it may further include other components, not excluding other components, unless otherwise stated, and one or more other characteristics. However, it should be understood that it does not preclude the possibility of existence or addition of numbers, steps, operations, components, parts, or combinations thereof.

As used throughout the specification, the terms "about", "substantially", etc., are used at or approximating that value when manufacturing and material tolerances inherent in the stated meaning are given, and do not convey an understanding of the present invention. Accurate or absolute figures are used to help prevent exploitation by unscrupulous infringers of the disclosed disclosure. The term "step of (doing)" or "step of" as used throughout the specification of the present invention does not mean "step for".

In this specification, a "unit" includes a unit realized by hardware, a unit realized by software, and a unit realized using both. Further, one unit may be realized using two or more hardware, and two or more units may be realized by one hardware. On the other hand, '~ unit' is not limited to software or hardware, and '~ unit' may be configured to be in an addressable storage medium or configured to reproduce one or more processors. Thus, as an example, '~unit' refers to components such as software components, object-oriented software components, class components, and task components, processes, functions, properties, and procedures. , subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays and variables. Functions provided within components and '~units' may be combined into smaller numbers of components and '~units' or further separated into additional components and '~units'. In addition, components and '~units' may be implemented to play one or more CPUs in a device or a secure multimedia card.

In this specification, some of the operations or functions described as being performed by a terminal, device, or device may be performed instead by a server connected to the terminal, device, or device. Likewise, some of the operations or functions described as being performed by the server may also be performed by a terminal, apparatus, or device connected to the server.

In this specification, some of the operations or functions described as mapping or matching with the terminal mean mapping or matching the terminal's unique number or personal identification information, which is the terminal's identifying data. can be interpreted as

Hereinafter, the present invention will be described in detail with reference to the accompanying drawings.

1 is a diagram for explaining a blockchain-based game service providing system according to an embodiment of the present invention. Referring to FIG. 1 , a blockchain-based game service providing system 1 may include at least one user terminal 100, a game service providing server 300, and at least one counterpart terminal 400. However, since the blockchain-based game service providing system 1 of FIG. 1 is only one embodiment of the present invention, the present invention is not limitedly interpreted through FIG. 1 .

At this time, each component of FIG. 1 is generally connected through a network (Network, 200). For example, as shown in FIG. 1 , at least one user terminal 100 may be connected to a game service providing server 300 through a network 200 . Also, the game service providing server 300 may be connected to at least one user terminal 100 and at least one counterpart terminal 400 through the network 200 . Also, at least one counterpart terminal 400 may be connected to the game service providing server 300 through the network 200 .

Here, the network refers to a connection structure capable of exchanging information between nodes such as a plurality of terminals and servers, and examples of such networks include a local area network (LAN) and a wide area network (WAN: Wide Area Network), the Internet (WWW: World Wide Web), wired and wireless data communications networks, telephone networks, and wired and wireless television communications networks. Examples of wireless data communication networks include 3G, 4G, 5G, 3rd Generation Partnership Project (3GPP), 5th Generation Partnership Project (5GPP), Long Term Evolution (LTE), World Interoperability for Microwave Access (WIMAX), Wi-Fi , Internet (Internet), LAN (Local Area Network), Wireless LAN (Wireless Local Area Network), WAN (Wide Area Network), PAN (Personal Area Network), RF (Radio Frequency), Bluetooth (Bluetooth) network, NFC ( A Near-Field Communication (Near-Field Communication) network, a satellite broadcasting network, an analog broadcasting network, a Digital Multimedia Broadcasting (DMB) network, etc. are included, but not limited thereto.

In the following, the term at least one is defined as a term including singular and plural, and even if at least one term does not exist, each component may exist in singular or plural, and may mean singular or plural. It will be self-evident. In addition, the singular or plural number of each component may be changed according to embodiments.

At least one user terminal 100 may be a terminal that plays a game using a web page, app page, program, or application related to a blockchain-based game service. In this case, the game may be a tournament game or a lottery game. The user terminal 100 may host a game and may be a terminal that receives a transfer of an participation fee from the other party terminal 400 that participates through an electronic wallet. The user terminal 100 may be a terminal that pays the participation fee to the winner when the game starts after setting the application deadline and start date, or transfers the collected participation fee to the electronic wallet address of the game service providing server 300. .

Here, at least one user terminal 100 may be implemented as a computer capable of accessing a remote server or terminal through a network. Here, the computer may include, for example, a laptop, a desktop, a laptop, and the like equipped with a navigation system and a web browser. In this case, at least one user terminal 100 may be implemented as a terminal capable of accessing a remote server or terminal through a network. At least one user terminal 100 is, for example, a wireless communication device that ensures portability and mobility, navigation, PCS (Personal Communication System), GSM (Global System for Mobile communications), PDC (Personal Digital Cellular), PHS (Personal Handyphone System), PDA (Personal Digital Assistant), IMT (International Mobile Telecommunication)-2000, CDMA (Code Division Multiple Access)-2000, W-CDMA (W-Code Division Multiple Access), Wibro (Wireless Broadband Internet ) may include all types of handheld-based wireless communication devices such as terminals, smartphones, smart pads, tablet PCs, and the like.

The game service providing server 300 may be a server that provides a blockchain-based game service web page, app page, program or application. In addition, when the game service providing server 300 hosts a game in the user terminal 100, the participation application deadline date and start date are input, and the type or rule of the game is input or selected, and the other party terminal 400 It may be a server that counts the number of applications for participation in Further, the game service providing server 300 may be a server that allows the game to proceed by providing a one-to-one matchup on the start date after closing the application on the due date. In addition, the game service providing server 300 may be a server that pays an NFT trophy to the final winner and delivers prize money to the winner with respect to the remainder excluding the platform fee and game recommender fee from the total participation fee.

Here, the game service providing server 300 may be implemented as a computer capable of accessing a remote server or terminal through a network. Here, the computer may include, for example, a laptop, a desktop, a laptop, and the like equipped with a navigation system and a web browser.

At least one counterpart terminal 400 may be a counterpart's terminal participating in a game using a web page, app page, program, or application related to a blockchain-based game service. Although the counterpart terminal 400 can host a game like the user terminal 100, in an embodiment of the present invention, for convenience of description, the user is limited to the host and the counterpart is a participant.

Here, at least one counterpart terminal 400 may be implemented as a computer capable of accessing a remote server or terminal through a network. Here, the computer may include, for example, a laptop, a desktop, a laptop, and the like equipped with a navigation system and a web browser. At this time, at least one counterpart terminal 400 may be implemented as a terminal capable of accessing a remote server or terminal through a network. At least one counterpart terminal 400 is, for example, a wireless communication device that ensures portability and mobility, and includes navigation, PCS (Personal Communication System), GSM (Global System for Mobile communications), PDC (Personal Digital Cellular), PHS (Personal Handyphone System), PDA (Personal Digital Assistant), IMT (International Mobile Telecommunication)-2000, CDMA (Code Division Multiple Access)-2000, W-CDMA (W-Code Division Multiple Access), Wibro (Wireless Broadband Internet ) may include all types of handheld-based wireless communication devices such as terminals, smartphones, smart pads, tablet PCs, and the like.

2 is a block diagram illustrating a game service providing server included in the system of FIG. 1, and FIGS. 3 and 4 describe an embodiment in which a blockchain-based game service is implemented according to an embodiment of the present invention. It is a drawing for

Referring to FIG. 2, the game service providing server 300 includes a game opening unit 310, a transaction unit 320, a payment unit 330, a deadline setting unit 340, a rule providing unit 350, and a trophy payment unit. It may include a unit 360, a fee distribution unit 370 and a lottery game unit 380.

The game service providing server 300 according to an embodiment of the present invention or another server (not shown) operating in conjunction with a blockchain-based game service to at least one user terminal 100 and at least one counterpart terminal 400 When transmitting an application, program, app page, web page, etc., at least one user terminal 100 and at least one counterpart terminal 400 transmit a blockchain-based game service application, program, app page, web page, etc. can be installed or opened. Also, the service program may be driven in at least one user terminal 100 and at least one counterpart terminal 400 by using a script executed in a web browser. Here, the web browser is a program that allows users to use the web (WWW: World Wide Web) service, and means a program that receives and displays hypertext described in HTML (Hyper Text Mark-up Language). For example, Netscape , Explorer, Chrome, and the like. In addition, an application means an application on a terminal, and includes, for example, an app running on a mobile terminal (smart phone).

Referring to FIG. 2 , when opening a one-to-one or one-to-many tournament game in the user terminal 100, the game opening unit 310 may receive a type of tournament game selected from the user terminal 100 and open it. The one-to-one or one-to-many tournament game includes a rock-paper-scissors game and a squid game, and the game is based on a blockchain, and at least one process of the game is recorded in at least one block and stored in at least one node constituting the blockchain. can Of course, the types of games are not limited to those described above and are not excluded for reasons not listed.

When the counterpart terminal 400 participates in a game, the transaction unit 320 may transfer the participation fee from the electronic wallet of the counterpart terminal 400 to the electronic wallet of the user terminal 100 . The user terminal 100 may establish a one-to-one or one-to-many tournament game. At least one counterpart terminal 400 may participate in a game opened in the user terminal 100 by paying a participation fee. In addition to the user who is the organizer, the participation fee can also be paid directly to the platform. In order to prevent a fraudulent crime in which a user, who is an organizer, disappears after receiving only the participation fee, the organizer may set a condition as a person who satisfies a predetermined condition.

The payment unit 330 may pay a participation fee to a final winner after playing a game between the user terminal 100 and at least one counterpart terminal 400 in a tournament format. The user terminal 100 may proceed with a game in which participation fees are obtained in a winner-takes-all manner by playing a game with an opponent of an opened game. At least one counterpart terminal 400 may proceed with a game in which a participation fee is obtained in a winner-takes-all manner.

When opening and hosting a game in the user terminal 100, the deadline setting unit 340 sets a game participation deadline and a tournament start date, and allows at least one counterpart terminal 400 to participate in the game within the game participation deadline. ), the game can be played on the start date. That is, by setting the stop condition to the date rather than limiting the number of players, the game, which was naturally stopped when the date arrives, can be set to start.

The rule providing unit 350 starts a game by one-to-one matching between the user terminal 100 and at least one counterpart terminal 400, and may process a participant who does not have a one-to-one matching target as a by-win. At this time, a genetic algorithm can be used to generate the match table. Genetic algorithm is a type of search algorithm based on the survival of the fittest and the mechanism of inheritance. In other words, an initial chromosome group coded in the form of a gene (minimum unit expressing chromosomes: Gene) is created by expressing the initial estimate of the solution in letters, binary strings, real numbers, etc. repeat the process During this repetitive process, chromosomes approaching a certain area according to the survival of the fittest appear, and the chromosome group to be obtained can be estimated. An actual solution to be obtained can be obtained through a decoding process of the estimated chromosome. At this time, approaching to a certain area is called convergence, and in some cases, there is a problem of not converging. In the present invention, since there is a final survivor in a winner-takes-all structure, only the problem of convergence is dealt with.

Chromosome selection, which is very important for the performance of genetic algorithms, is a process for leaving chromosomes close to the year in question among chromosomes existing in a population to the next generation. The reason why selection is important is that it is a process of searching for an appropriate solution group by discarding chromosomes that are not close to the solution according to the survival of the fittest principle and increasing the number of chromosomes that are close to the solution. That is, if the selection is wrong, the desired solution group cannot be obtained because the search method is wrong. The selection technique refers to a method of approaching a solution by leaving more chromosomes (dominant) suitable for the solution in the next generation and fewer chromosomes (recessive) not suitable for the solution. The well-known proportional selection technique, rank-based selection technique, tournament selection technique, etc. there is In one embodiment of the present invention, a tournament selection technique is used.

The tournament technique goes through a similar process to determining the final winner after randomly playing matches when selecting a winner in an athletic event. In other words, after randomly selecting N genes, the dominant gene is left and repeated until the desired population number is reached, and finally the next generation chromosome group is formed. However, while this tournament technique is simple, it has the following disadvantages. First, there is a problem in that the probability of passing on a dominant chromosome to the next generation is high, so that the case with a recessive dominant gene has a high probability of being excluded from selection, resulting in a local optimal solution. This problem is called the Deceptive Problem, and it is mainly solved by finding ways to increase the diversity of genes. Second, when a recessive trait is selected by probability, there is a problem in that it cannot be guaranteed that a new chromosome generated by crossing the recessive chromosome with another chromosome in the next generation always contributes to the convergence speed improvement. Accordingly, in an embodiment of the present invention, a novel tournament-mating selection technique can be used to solve the second problem. At this time, the methods to be described later are selected by a genetic algorithm, but in one embodiment of the present invention, only the process of creating a participant bracket is used, and "selection" by a genetic algorithm is not performed. In other words, by playing a one-on-one game, "selection" is made in which the winner goes up.

<Selection technique>

In order to make a selection according to the principle of survival of the fittest in the selection technique, there must be a numerical value that serves as a standard. This refers to a value calculated according to a fitness function for determining the degree to which the selected chromosome is suitable for a given problem. Depending on the fitness function and various techniques used, selection techniques can be classified as follows.

<Proportionate Selection>

As a method of using the ratio of the fitness of each chromosome to the sum of the overall fitness as the probability of chromosome selection, it is the most basic selection technique in genetic algorithms. However, since the suitability of all chromosomes in a group is obtained and each is selected according to probability, it is difficult to apply to a group with a large population. In particular, if the population is too small because each selection probability is not continuous and appears in the form of a step, it is difficult to use it because it harms diversity.

<Tournament Selection>

A certain number of chromosomes are randomly selected, and among them, the chromosome with the best fit is left, and the selection is repeated up to the desired population. Since this technique simply extracts a certain number of chromosomes and selects the best one from among the fitness calculations, it can determine which chromosomes to leave in the next generation faster than other selection techniques. The tournament selection technique has the first problem described in the introduction. In other words, all chromosomes in the current group are dominantly unified, preventing convergence to a better solution that does not exist in the group. Of course, after repeating several times, a new gene is obtained through mutation operation, and the algorithm proceeds, but it results in deterioration of performance. In order to solve these disadvantages, a tournament selection technique that leaves moderate enthusiasm using selection pressure can be used.

For example, assume that the size of a group of chromosomes is 4 and each chromosome contains 3 genes. For example, assume that chromosome A is composed of genes ‘1’, ‘1’, and ‘0’. When A and D are randomly selected among chromosomes A, B, C, and D, they are divided into dominant and recessive according to the degree of fitness. Then, a random number between 0 and 1 is generated, compared to the pre-determined selection pressure, and a dominant value is selected if the value is small, and a recessive force is finally selected if the value is large. This process is repeated until the size of the group is equal. This selection technique solves the first problem described in the introduction, the lack of diversity, by allowing an appropriate amount of recessive chromosomes to be passed on to the next generation. However, there is a problem in that it is not guaranteed that the recessive chromosome left at this time always improves the convergence speed into the solution group.

<Rank Selection>

It is a selection method that ranks chromosomes according to the order of magnitude of fitness and determines the probability of leaving a chromosome accordingly. In order to compensate for the disadvantages caused by the non-continuous selection probabilities of chromosomes in the proportional selection technique, linear selection probabilities are applied to gene groups ranked according to fitness.

<Elitist Preserving Selection>

In order to prevent a particularly good solution from being excluded from selection, chromosomes with the highest fitness are preferentially retained, and are generally used together with other selection techniques.

<Improved tournament selection technique>

When a given problem is a convergence problem, it can be seen that the solution group approaches within a specific solution area according to the performance of the algorithm. The speed of this convergence is one of the criteria for finding a good solution. Convergence that is too fast destroys the diversity of the solution group, resulting in obtaining a locally optimal solution or reducing the precision of the solution. Therefore, the genetic algorithm has a control parameter related to the convergence speed. By adjusting these parameters, a more precise solution can be obtained. The control parameters used when implementing the tournament-mating selection method are described.

① Chromosome length (l) refers to the size of the gene linkage expressed at this time, which is called a chromosome when there is a solution expressed by several genes. It is usually measured as the length of a string. If the length is long, the performance is degraded, so an appropriate length should be selected. If a binary string gene is used, it can be defined as l ≥ log2 [(search area maximum - search area minimum) 10d + 1]. However, d represents precision as the number of decimal places. ② Population size (p) refers to the number of chromosomes in the population for which chromosome selection will be performed. This affects the performance and precision of the solution. In other words, if the size of the group is too small, the solution can be obtained quickly, but the precision of the solution is low, and if the size of the group is large, the calculation speed is slow but the precision of the solution is high. ③ The selection pressure (t) is a constant that defines the probability to adjust the ratio of overcoming dominant and recessive traits. If it is increased, convergence is fast due to lack of group diversity, but there is a high possibility of reaching a local optimal solution. If it is low, the diversity of the group increases, so the speed of convergence is slow, but the possibility of reaching the optimal solution is high. A suitable selection pressure of 0.6 or more is recommended.

④ The mutation rate (m) is a constant that defines the probability of a new genetic trait being changed in a chromosome. If it is too large, it will result in a random search, which degrades performance, and if it is too small, it will lose the opportunity to acquire new genes in the population and fail to maintain diversity. An appropriate mutation rate is recommended to be between 0.5 and 1. ⑤ The mating rate (c) is a constant that defines the probability that the chromosomes of a population participate in mating. Larger values result in faster searching of the search space. If it is small, the appearance of a new type of gene may be hindered, and the search may be stagnant.

<Tournament-breeding selection technique>

The tournament selection technique described above solves the first problem in the introduction, but to solve the second problem, a procedure for verifying whether a dominant gene is included in a recessive chromosome is required. Suppose that according to the current tournament selection technique, two chromosomes A and B are randomly extracted and fitness is checked, and A is dominant and B is recessive. At this time, the verification procedure is as follows. ① The currently selected two chromosomes (A, B) are crossed. ② Compare the chromosome (A') obtained by crossing with the recessive chromosome (B). ③ In step ②, select the dominant chromosome (A' or B). After going through this procedure, if there is a better gene than the dominant chromosome in the recessive chromosome, this gene is reflected in the newly created chromosome due to crossover.

For example, a dominant region is performed when a dominant chromosome is selected, and a recessive region is performed when a recessive chromosome is selected. In the dominance area, the method used in the existing tournament technique is used as it is. In the recessive region, which is executed when a recessive chromosome is selected, the fitness function values for recessive chromosome B and A obtained by crossing A and B are compared with each other to leave a dominant chromosome. This process is repeated until the desired population number is reached. Of course, there may be various methods other than the method of making a matchup in the above-described method, and it is not limited to the above-mentioned ones.

The trophy giving unit 360 may pay a non-fungible token (NFT) trophy to the final winner and set it to be traded in a pre-established NFT market. For the issuance of NFT, a transaction is created and transmitted to a blockchain network through a dApp (Decentralized Application) connected to the Hyperledger Fabric, and a hash for downloading the content after uploading the content through IPFS (Inter Planet File System) Hash) value is returned and passed to Hyperledger Fabric so that the content can be recorded on the blockchain. At this time, the block chain may be a private block chain of Hyperledger Fabric or a permissioned block chain. Permissioned blockchains use contracts called smart contracts for transaction processing and transaction execution. A smart contract is a program that can be developed in a programming language, and functions that process contracts are written as functions.

Smart contract is one of the core concepts along with the ledger in the implementation of the block chain. Therefore, a method is needed to support the management and optimization of smart contracts on a permissioned blockchain platform. In one embodiment of the present invention, as a method for effectively managing smart contracts, a smart contract management method of setting priorities based on the execution time and importance of functions and performing function sorting can be used. An embodiment of the present invention can be used for performance improvement in transaction verification and assurance stages as well as smart contract management in a permissioned blockchain platform.

<Smart Contract in Hyperledger Fabric>

The chaincode used in Hyperledger Fabric, a representative permissioned blockchain platform, has multiple smart contracts inside. Smart contracts have various functions that correspond to the contents of the contract. Smart contract functions can be developed in a language that supports JVM (Java Virtual Machine) or Node.js runtime, and there are various functions that process data or status and control statements such as IF-ELSE or WHILE.

<Permissioned Blockchain>

When a client requests a transaction, the index file is searched first. It finds the function corresponding to the requested transaction through the index file, sorts the transaction according to the priority of each function, and delivers the transaction to the guarantee peer. After the guarantee process is over, the result is returned to the client, and the client requests the blockchain network to create a block based on the result received. The elements defined to determine the execution cost of a smart contract function according to an embodiment of the present invention are as follows. Operation represents the sorting criterion element of the function. ① As for code length, a cost of 1 is allocated for every N lines. Since the lengths of functions belonging to smart contracts vary, N is arbitrarily set so that functions can be distinguished. ② In the case of control statements, since they directly affect function execution, they can be included in the calculation of execution cost. ③ Data processing refers to a function that changes data according to the desired format or reads and writes values from the ledger. Data processing functions can also affect execution time, so they can be included in the calculation of execution cost.

④ Execution cost is the cost assigned to each element. Set the cost of all elements to 1 and add the cost whenever the element appears. The lower the sum of all costs, the shorter the execution time. ⑤ Weight is the weight for comparing each element. If the final cost is the same, each operation with the largest weight is compared. Function sorting criteria can be set by assigning a large weight in the order of having the most impact on the execution time. After extracting the cost and prioritizing it, encryption is performed. Due to the nature of the permissioned blockchain, which requires approval from the administrator to participate in the transaction, if the information of the smart contract function is exposed, a security threat may be imposed. To hide the function from the outside, an encryption algorithm is applied to the function name. Based on the cost and priority of each function, an index file is created to manage the entire smart contract.

⑥ Index File is created in json format and shows the extracted smart contract function information divided into Total Cost, Function Name, Code_List_Cost, Control_Statement_Cost, and Data_Process_Cost. Total Cost represents the total cost. Function Name represents the name of each function in the smart contract. Code_List_Cost, Control_Statement_Cost, and Data_Process_Cost for each function name indicate the cost of code length, control statement, and data processing, respectively. Transactions requested by the client are executed after being sorted based on the priority defined in the index file. Of course, it is not excluded that it may be a public blockchain rather than a permissioned blockchain.

When a game is played on the user terminal 100 and at least one counterpart terminal 400, the fee distribution unit 370 provides a fee according to a preset ratio of the participation fee to the game service providing server 300 and the game recommender, respectively. can be sorted out For example, it may be 30% for the platform, that is, the game service providing server 300, and 5% for the recommender, but is not limited thereto.

The lottery game unit 380 receives a lottery ticket purchase amount from the electronic wallet of the user terminal 100 and at least one counterpart terminal 400 as a coin, which is a virtual currency, matches and stores the lottery number and the address of the electronic wallet, and The prize money is paid in coins to the winner in real time on the set lottery date, and if there is no winner, the prize money can be carried over and continued until a winner is found. Lottery games can also be conducted based on blockchain.

Hereinafter, an operation process according to the configuration of the above-described game service providing server of FIG. 2 will be described in detail with reference to FIGS. 3 and 4 as examples. However, it will be apparent that the embodiment is only any one of various embodiments of the present invention, and is not limited thereto.

Referring to FIG. 3 , (a) When a game service providing server 300 hosts a game in a user terminal 100, after receiving an application for participation from at least one counterpart terminal 400, the game service server 300 plays the game on a date set by the user. advance (b) The game service providing server 300 may pair each participant in a tournament format to play a one-to-one game, and record the current status in the blockchain in real time. (c) The game service providing server 300 also drives the participation fee in a winner-takes-all manner when the final winner comes out, and at this time, the trophy can be issued and provided as an NFT, and the trophy can also be traded as in (d) do. As shown in (a) of FIG. 4, in the case of a lottery game, when buying a lottery ticket with a coin, a lottery number is entered and recorded in the block chain. (b) When a winner is drawn, the game service providing server 300 pays the winner excluding the fee, and (c) when there is no winner, the game service continues to be carried forward until a winner is obtained.

Matters not described for the blockchain-based game service providing method of FIGS. 2 to 4 are the same as those described for the blockchain-based game service providing method through FIG. 1 or can be easily inferred from the described content. Therefore, the following description is omitted.

5 is a diagram illustrating a process of transmitting and receiving data between components included in the system for providing a game service based on the blockchain of FIG. 1 according to an embodiment of the present invention. Hereinafter, an example of a process of transmitting and receiving data between each component will be described through FIG. 5, but the present application is not limited to such an embodiment, and according to various embodiments described above, It is obvious to those skilled in the art that a process of transmitting and receiving data may be changed.

Referring to FIG. 5 , when a one-to-one or one-to-many tournament game is opened in a user terminal, the game service providing server receives a type of tournament game selected from the user terminal and opens it (S5100).

In addition, the game service providing server transfers the participation fee from the electronic wallet of the counterpart terminal to the electronic wallet of the user terminal when the counterpart terminal participates in the game (S5200).

In addition, the game service providing server proceeds with a game between the user terminal and at least one counterpart terminal in a tournament format and pays a participation fee to the final winner (S5300).

The order between the above-described steps (S5100 to S5300) is only an example, and is not limited thereto. That is, the order of the above-described steps (S5100 to S5300) may be mutually changed, and some of the steps may be simultaneously executed or deleted.

Matters that have not been described for the blockchain-based game service providing method of FIG. 5 are the same as or easily inferred from those described for the blockchain-based game service providing method through FIGS. 1 to 4 above. Therefore, the following description is omitted.

The blockchain-based game service providing method according to an embodiment described with reference to FIG. 5 may also be implemented in the form of a recording medium containing instructions executable by a computer, such as an application or program module executed by a computer. . Computer readable media can be any available media that can be accessed by a computer and includes both volatile and nonvolatile media, removable and non-removable media. Also, computer readable media may include all computer storage media. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data.

The aforementioned blockchain-based game service providing method according to an embodiment of the present invention can be executed by an application basically installed in the terminal (which may include a program included in a platform or operating system, etc., which is basically installed in the terminal). and may be executed by an application (that is, a program) directly installed in the master terminal by a user through an application providing server such as an application store server, an application or a web server related to the corresponding service. In this sense, the blockchain-based game service providing method according to an embodiment of the present invention described above is implemented as an application (i.e., a program) that is basically installed in a terminal or directly installed by a user and can be read by a computer such as a terminal. can be recorded on a recording medium.

The above description of the present invention is for illustrative purposes, and those skilled in the art can understand that it can be easily modified into other specific forms without changing the technical spirit or essential features of the present invention. will be. Therefore, the embodiments described above should be understood as illustrative in all respects and not limiting. For example, each component described as a single type may be implemented in a distributed manner, and similarly, components described as distributed may be implemented in a combined form.

The scope of the present invention is indicated by the following claims rather than the detailed description above, and all changes or modifications derived from the meaning and scope of the claims and equivalent concepts should be construed as being included in the scope of the present invention. do.

Claims (7)

A user terminal that opens a one-to-one or one-to-many tournament game and then plays a game with an opponent of the opened game to obtain a participation fee in a winner-takes-all method;
at least one counterpart terminal that pays and participates in the game opened by the user terminal and proceeds with a game in which the participation fee is obtained in the winner-takes-all method; and
When the user terminal opens the one-to-one or one-to-many tournament game, a game opening unit that opens the tournament game after receiving the type of tournament game selected from the user terminal; A game service providing server including a transaction unit for transferring money from a wallet to an electronic wallet of the user terminal, and a payment unit for paying the participation fee to a final winner after playing a game between the user terminal and the at least one counterpart terminal in a tournament format;
Including,
The one-to-one or one-to-many tournament game includes a rock-paper-scissors game and a squid game,
The game is a blockchain-based game service providing system, characterized in that at least one process of the game is recorded in at least one block based on a blockchain and distributed and stored in at least one node constituting the blockchain.
delete According to claim 1,
The game service providing server,
When opening and hosting a game on the user terminal, a game participation deadline and a tournament start date are set, and at least one opponent terminal participating in the game within the game participation deadline is determined, and then the game is played on the start date. deadline setting unit to do;
Blockchain-based game service providing system further comprising a.
According to claim 3,
The game service providing server,
a rule providing unit that starts a game by one-to-one matching between the user terminal and at least one counterpart terminal, and treats a participant who does not have a one-to-one matching target as a by-win;
Blockchain-based game service providing system further comprising a.
According to claim 1,
The game service providing server,
A trophy payment unit for paying a NFT (Non-Fungible Token) trophy to the final winner and setting it to be traded in a pre-established NFT market;
Blockchain-based game service providing system further comprising a.
According to claim 1,
The game service providing server,
When a game is played in the user terminal and at least one counterpart terminal, a fee distribution unit for calculating a fee according to a predetermined ratio of the participation fee to the game service providing server and the game recommender, respectively;
Blockchain-based game service providing system further comprising a.
According to claim 1,
The game service providing server,
The lottery purchase amount is transferred from the electronic wallet of the user terminal and at least one counterpart terminal to a coin, which is virtual currency, and the lottery number and the address of the electronic wallet are matched and stored, and the winnings are transferred to the winner in real time on a preset lottery date in the coin A lottery game unit that pays, and if there is no winner, the winnings are carried over and continued until the winner appears;
Blockchain-based game service providing system further comprising a.

Images