KR102140635B1 - Method for lottery using blockchain - Google Patents

Abstract

According to one embodiment of the present invention, disclosed is a computer program stored in a computer-readable storage medium. The computer program stored in a computer-readable storage medium includes instruction for enabling a management server to perform the following operations. The operations include: transmitting a hash value of a winning value related with Nth lot drawing to at least one node constituting a blockchain network; recognizing the number of entries of each of at least one entry terminal when determining at least one winner terminal on the Nth lot drawing; obtaining first information about added points of each of the at least one entry terminal based on the number of entries of each of at least one entry terminal; determining the at least one winner terminal based on the first winning value related with the Nth lot drawing, an entry value of each of the at least one entry terminal and the first information; and transmitting personal identification information of the at least one winning terminal and the first winning value to the at least one node constituting the blockchain network as the at least one winning terminal is determined. Therefore, the method is capable of guaranteeing the fairness of lot drawing through a blockchain.

Description

Lottery method using blockchain {METHOD FOR LOTTERY USING BLOCKCHAIN}

The present disclosure is for guaranteeing the fairness of the lottery, and specifically relates to guaranteeing the fairness of the lottery using a blockchain and reflecting the applicant's application efforts in the lottery results.

Recently, the 4th Industrial Revolution, the next-generation industrial revolution through convergence of information and communication technologies, has become an issue. Automation in the existing industry meant to operate manually according to a pre-entered program, but in the 4th industrial revolution, it means that the machine actively recognizes and operates the situation, and this 4th industrial revolution includes artificial intelligence, robots Technology and life science are leading the way.

Among these technologies of the 4th Industrial Revolution, Blockchain is attracting attention as the main technology. Blockchain is a technology that provides security as a public transaction ledger. These blockchains are attracting attention, and the blockchain-based cryptocurrency technology Bitcoin platform and Ethereum platform are also attracting attention.

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

On the other hand, in the lottery industry, in the case of paper lottery, the purchase ticket is mostly discarded after purchasing the lottery, which not only causes waste of resources, but also has a problem in that a large amount of money is unnecessaryly consumed according to the implementation of the lottery business. In order to prevent this, a method of providing a lottery service through online has been proposed. However, in the case of a conventional online lottery, the reliability of the operation and the security of the system may be a problem depending on the operating institution. In addition, in the case of a conventional online lottery, the winning result, payment result, etc. can be checked only by the information provided by the operating institution, so if the provided information is distorted or there is an error, the user who purchased the lottery cannot check it. There was. Accordingly, a method of ensuring fairness of the lottery in a lottery such as a lottery is being sought.

Republic of Korea Patent No. 10-1928087 discloses a blockchain-based online lottery management method and a server using the same.

Korea registered patent KR No. 10-0494660

The present disclosure has been devised in response to the above-described background technology, and intends to guarantee fairness of the lottery by utilizing a blockchain.

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

In accordance with 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 the management server to perform the following operations, which include:

Transmitting a hash value of the first winning value associated with the N-th round to at least one node constituting the blockchain network; Recognizing the number of entries of each of the at least one entry terminal; Acquiring first information about an additional point of each of the at least one entry terminal based on the number of entries of each of the at least one entry terminal; Determining at least one winner terminal using the first winning value associated with the N-th lottery, the entry value of each of the at least one entry terminal, and the first information; And as the at least one winner terminal is determined, transmitting the first winning value and personal identification information of the at least one winner terminal to the at least one node constituting the blockchain network; It may include.

In addition, the operation of transmitting the hash value of the first winning value associated with the N-th round to at least one node constituting the blockchain network includes: generating a random number using a seed value generated by a preset method; And determining the random number as the first winning value. It may include.

In addition, the operation of recognizing the number of entries of each of the at least one entry terminal,

Transmitting a first signal to check the number of entries to the at least one node constituting the blockchain network; Receiving a second signal in response to the first signal from the at least one node-the second signal is the at least one applicant terminal generated by searching from the genesis block recorded in the blockchain network to the current block And second information indicating the number of times of each application -; And recognizing the number of entries of each of the at least one entry terminal based on the second information included in the second signal.

The operation of acquiring the first information for each additional point of each of the at least one applicant terminal may include: determining a value obtained by multiplying the number of entries of each of the at least one applicant terminal by a predetermined value; It may further include.

The operations include receiving application information from each of the at least one application terminal; And transmitting the third information corresponding to the application information to at least one node constituting the blockchain network, so that the third information is based on the consensus algorithm in the plurality of nodes constituting the blockchain network. Causing it to be recorded on; It may further include.

The application information and the third information may include personal identification information of each of the at least one application terminal and an application value of each of the at least one application terminal.

In addition, the third information may include a time stamp corresponding to information on the application time when the application information is received from each of the at least one application terminal.

The operation of determining the at least one winner terminal calculates a predetermined adjustment entry value based on the first winning value, the entry value of each of the at least one entry terminal, and the first information about each additional point of the at least one entry terminal Determining an adjusted entry value for each of the entry terminals by entering in an expression; It may further include.

Further, the determining of the at least one winner terminal may include: calculating a difference value between the adjusted entry value and the winning value for each of the at least one winner terminal; And when determining the at least one winner terminal, determining the winner terminal having the smallest difference among the at least one winner terminal in order as the at least one winner terminal; It may include.

Also, the determining of the at least one winner terminal may include: checking fourth information on the number of terminals that can be set as the winner terminal; Recognizing the number of terminals that can be set as the winner terminal based on the fourth information; If there are a plurality of applicant terminals having the same difference value, determining an applicant terminal having the fastest application time among the plurality of application terminals as the winner terminal; It may include.

In addition, when there are a plurality of applicant terminals having the same difference value, the operation of determining the winner terminal having the fastest application time among the plurality of applicant terminals is the winner terminal,

If the first entry time of the first entry terminal is earlier than the second entry time of the second entry terminal, prioritizing the first entry terminal when determining the winner terminal; It may further include.

In addition, when there are a plurality of applicant terminals having the same difference value, the operation of determining the winner terminal having the fastest application time among the plurality of applicant terminals is the winner terminal: application information of each of the plurality of applicant terminals is included Checking the block height of the applied block; Determining an applicant terminal corresponding to the personal identification information recorded in the application block having the lowest block height as a winner terminal; It may include.

In addition, the operations include: when the at least one winner terminal is determined, initializing the added points set in the at least one winner terminal in the first information; It may further include.

According to some embodiments of the present disclosure for solving the above-described problems, a computing device constituting a blockchain network is disclosed. The computing device constituting the blockchain network includes: a communication unit; When the hash value of the first winning value related to the Nth lottery is received from the management server through the communication unit, it is determined to record the hash value in the storage unit based on the consensus algorithm of the blockchain network, and the management When the first winning value and personal identification information of at least one winner terminal are received from the server through the communication unit, the first winning value and the at least one winner terminal based on the consensus algorithm of the blockchain network A processor that determines to record personal identification information in the storage unit; And a storage unit that stores a computer program executable by the processor. It includes.

In accordance with some embodiments of the present disclosure for solving the above-described problems, a management server is disclosed. The management server includes: a communication unit capable of communicating with at least one node constituting a blockchain network; And controlling the communication unit to transmit the hash value of the first winning value associated with the N-th round to at least one node constituting the blockchain network, recognize the number of entries of each of the at least one entry terminal, and recognize the at least one entry. Based on the number of entries of each applicant terminal, the first information about the added points of each of the at least one applicant terminal is obtained, the first winning value associated with the Nth lottery, the application value of each of the at least one applicant terminal, and the Determining at least one winner terminal using the first information, and as the at least one winner terminal is determined, configure the blockchain network with the first winning value and personal identification information of the at least one winner terminal A processor that controls the communication unit to transmit to the at least one node; It includes.

The processor may determine the first winning value associated with the N-th lottery as a random number generated using a seed value generated by a predetermined method.

Further, the processor controls the communication unit to transmit a first signal for confirming the number of entries to the at least one node constituting the blockchain network in order to recognize the number of entries of each of the at least one entry terminal. And receiving a second signal in response to the first signal from the at least one node through the communication unit-the second signal is generated by searching from the genesis block recorded in the blockchain network to the current block Includes second information indicating the number of times of application of each of the at least one application terminal-based on the second information included in the second signal, the number of applications of each of the at least one application terminal can be recognized.

In addition, the processor receives the application information from each of the at least one application terminal through the communication unit, and transmits third information corresponding to the application information to at least one node constituting the blockchain network, It is possible to cause the third information to be recorded in the blockchain network based on a consensus algorithm in a plurality of nodes constituting the blockchain network.

The additional points may be obtained by multiplying the number of entries of each of the at least one entry terminal by a predetermined value.

The technical solutions that can be obtained in the present disclosure are not limited to the solutions mentioned above, and other solutions that are not mentioned are clearly understood by those skilled in the art from the description below. Will be understandable.

The present disclosure can guarantee the fairness of the lottery by utilizing a blockchain.

The effects obtainable in the present disclosure are not limited to the above-mentioned effects, and other effects not mentioned may be clearly understood by those skilled in the art from the following description. .

Various aspects are now described with reference to the drawings, in which like reference numerals are used collectively to refer to similar components. In the following examples, 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.
1 is a view showing an example of a system for performing a drawing according to some embodiments of the present disclosure.
2 is a diagram showing an example of a configuration of a computing device constituting a management server and a blockchain network according to some embodiments of the present disclosure.
3 is a flowchart illustrating an example of a method in which a processor of a management server according to some embodiments of the present disclosure determines at least one winner terminal in a drawing.
4 is a flowchart illustrating an example of an operation performed by a processor of a management server to determine a first winning value according to some embodiments of the present disclosure.
5 is a flowchart illustrating an example of a method in which a processor of a management server acquires the number of entries of each of at least one entry terminal from a blockchain network according to some embodiments of the present disclosure.
6 is a flowchart illustrating an example of a method for causing a processor of a management server to cause application information to be written to a blockchain network according to some embodiments of the present disclosure.
7 is a diagram illustrating an example of a type and structure of a block connected on a blockchain network according to some embodiments of the present disclosure.
8 is a flowchart illustrating an example in which a processor of a management server determines at least one winner terminal according to some embodiments of the present disclosure.
9 is a flowchart illustrating an example of a method of determining a winner based on an application time when a plurality of applicant terminals having the same difference between the adjustment entry value and the winning value exist, according to some embodiments of the present disclosure .
10 is a flowchart illustrating an example in which the processor of the management server according to some embodiments of the present disclosure initializes the first information about the added points set in the winner terminal.
11 shows a simplified and general schematic diagram of an example computing environment in which some embodiments of the present disclosure can be implemented.

Various embodiments and/or aspects are now disclosed with reference to the drawings. In the following description, for purposes of explanation, a number of specific details are disclosed to assist in the overall understanding of one or more aspects. However, it will also be appreciated by those skilled in the art of this disclosure that this aspect(s) can be practiced without these specific details. The following description and the annexed drawings set forth in detail certain illustrative aspects of the 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, "an embodiment", "example", "a good", "an example", etc., as used herein is not to be construed as any aspect or design described being better or more advantageous than another aspect or designs. It may not.

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

Although the first, second, etc. are used to describe various elements or components, it goes without saying that these elements or components are not limited by these terms. These terms are only used to distinguish one element or component from another element or component. Therefore, it goes without saying that the first element or component mentioned below may be the second element or component within the technical spirit of the present invention.

Unless otherwise defined, all terms (including technical and scientific terms) used in the present specification may be used as meanings commonly understood by those skilled in the art to which the present invention pertains. In addition, terms defined in the commonly used dictionary are not ideally or excessively interpreted unless specifically defined.

In addition, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or”. That is, unless specified otherwise or unclear in context, "X uses A or B" is intended to mean one of the natural inclusive substitutions. That is, X uses A; X uses B; Or, if X uses both A and B, "X uses A or B" can be applied in either of these cases. It should also be understood that the term "and/or" as used herein refers to and includes all possible combinations of one or more of the listed related items.

Also, the terms “comprises” and/or “comprising” mean that the feature and/or component is present, but excludes the presence or addition of one or more other features, elements, and/or groups thereof. It should be understood as not. In addition, unless otherwise specified or contextually unclear as indicating a singular form, the singular in the specification and claims should generally be construed to mean "one or more."

In addition, the terms "information" and "data" as used herein can often be used interchangeably with each other.

The suffixes "modules" and "parts" for components used in the following description are given or mixed only considering the ease of writing the specification, and do not have meanings or roles that are distinguished from each other.

The objectives and effects of the present disclosure, and technical configurations for achieving them, will be clarified with reference to embodiments described below in detail together with the accompanying drawings. In describing the present disclosure, when it is determined that a detailed description of known functions or configurations may unnecessarily obscure the subject matter of the present disclosure, the detailed description will be omitted. In addition, terms to be described later are terms defined in consideration of functions in the present disclosure, which may vary according to a user's or operator's intention or practice.

However, the present disclosure is not limited to the embodiments disclosed below, and may be implemented in various different forms. Only the present embodiments are provided to make the present disclosure complete, and to fully disclose the scope of the disclosure to those skilled in the art to which this 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.

1 is a view showing an example of a system for performing a drawing according to some embodiments of the present disclosure.

As shown in FIG. 1, a system for performing a lottery may include a management server 100, a blockchain network 200, an applicant terminal 300a, 300b and 300c: 300, and a communication network 400. have. The components shown in FIG. 1 are exemplary, and additional components may be present or some of the components shown in FIG. 1 may be omitted.

The management server 100 according to an embodiment of the present disclosure 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. . Although not illustrated in FIG. 1, the management server 100 may include a memory, a communication unit, and a processor. The management server 100 may allow the applicant terminal 300 to apply for the lottery. Additionally, the management server 100 may operate as a node constituting the blockchain network 200.

For convenience of description, it is assumed hereafter that the management server 100 is a separate subject from the blockchain network 200. However, in the present disclosure, it should be interpreted that all operations performed by the nodes constituting the blockchain network 200 can also be performed by the management server.

In some embodiments of the present disclosure, the blockchain network 200 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 200 may store transactions transmitted from at least one of the management server 100, the applicant terminal 300, and the nodes constituting the blockchain network 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 200.

In FIG. 1, the blockchain network 200 is expressed as a separate entity, but according to an embodiment of the present disclosure, the blockchain network 200 may be implemented in a form included in the management server 100.

The blockchain network 200 may include a public blockchain network where arbitrary nodes can perform a consensus operation or a private blockchain network where only predetermined nodes can perform a consensus operation, depending on the implementation form. .

Consensus algorithms performed on the blockchain network 200 according to some embodiments of the present disclosure include: a Proof of Work (PoW) algorithm, a Proof of Stake (PoS) algorithm, a Delegated Proof of Stage (DPoS) algorithm, and a PBFT (Practical) Byzantine Fault Tolerance (DBFT) algorithm, Delegated Byzantine Fault Tolerance (DBFT) algorithm, Redundant Byzantine Fault Tolerance (RBFT) algorithm, Sieve algorithm, Tendermint algorithm, Paxos algorithm, Raft algorithm, Proof of Authority (PoA) algorithm, and/or Proof of PoET Elapsed Time) algorithm.

In some demonstrative embodiments of the present disclosure, nodes in the blockchain network 200 may operate by a blockchain core package according to a hierarchical structure. The hierarchical structure is: a data layer defining the structure of data to be handled in the blockchain network 200, a data layer that manages the data, and a mining fee that verifies the validity of blocks and creates blocks, and is paid to miners in the mining process Consensus layer in charge of processing, execution layer for processing and executing smart contracts, P2P network protocol, hash function, digital signature, common layer for implementing and managing common storage, and various applications are created, processed, and managed Application layer may be included.

Smart contracts according to embodiments of the present disclosure may be written in a digital language for performing a lottery process and executed on any computing device. That is, when the codes and/or functions included in the smart contract are executed, any form of lottery process according to the embodiments of the present disclosure (eg, generation of a first winning value and a hash value of the first winning value, Adjustment application value calculation, addition point calculation, storage and initialization, prioritization, etc.) may be performed.

The smart contract according to the embodiments of the present disclosure may include at least one of a method of generating 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 200. Can be executed by Also, the smart contract may be executed by a transaction generated by an externally owned account or other contract. A smart contract for performing a lottery according to embodiments of the present disclosure is stipulated to pay a specific execution cost when executing a transaction, to prevent malicious code such as infinite repetition and to protect the integrity of data related to the lottery. You may. Here, the execution cost may mean any type of coin that can be traded in the blockchain network 200 or another form of mediator (eg, gas) that can be linked with the coin. As a non-limiting example, the basic execution cost of a transaction can be set to 21,000 gas. For example, the execution cost may include a cost for processing an elliptic curve digital signature algorithm (ECDSA) for the transaction issuer's account address, a storage cost for transaction storage, and a network bandwidth cost. When such a smart contract is defined to pay a specific cost when executing, a malicious attack such as an infinite execution such as an intentional DDoS attack can be prevented. In order to perform a drawing according to embodiments of the present disclosure, calls between smart contracts may be implemented using a structure called a message. For example, such a message may be generated by a contract account (CA), and may be delivered to other contracts when a function is called. In one embodiment, since the message in this case is generated and processed inside the blockchain network 200 unlike a transaction occurring in an externally owned account, a separate execution cost such as gas may not be incurred. In implementing a lottery according to embodiments of the present disclosure, when a function of a smart contract is included in a transaction in a compiled code form and synchronized through a blockchain, information contained in the transaction is input as a function input to a code. Function

After execution, the smart contract can be implemented by storing the result in a separate state.

have. When the content of the function and the input of the function are shared by a smart contract shared in the blockchain network 200, data integrity can be ensured even if the result of the function is not separately shared. In a further embodiment, computing devices constituting the blockchain network 200 of the present disclosure for performing a lottery, a transaction storage database that changes the state of the smart contract and a smart contract database that stores the latest state of the smart contract It may include. In this case, the smart contract for lottery in the present disclosure may be defined as an application (ie, lottery application) that can change the state on the blockchain network 200, and the state of the smart contract is the corresponding application. It can be defined as a variable used in (ie, lottery application), and the input value for changing it is issued from at least one of the management server 100, the applicant terminal 300, and a plurality of nodes constituting the blockchain network. It 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, it may operate separately from the database storing the transaction in order to achieve the distributed agreement of the database storing the state of the smart contract and the low dependency of the smart contract.

According to some embodiments of the present disclosure, by using the blockchain network 200 in the process of lottery, convenience of the entrant for lottery entry, transparency and integrity of the lottery result may be provided.

The applicant terminal 300 has a mechanism for communicating with the management server 100 or another node through the communication network 400, and may mean any type of node in the system for performing the lottery. For example, the applicant terminal 300 may include a PC, laptop computer, workstation, terminal, and/or any electronic device with network connectivity. Also, the applicant terminal 300 may include any server implemented by at least one of an agent, an application programming interface (API), and a plug-in. In addition, the applicant terminal 300 may include an application source and/or a client application.

The applicant terminal 300 may be any entity capable of processing and storing arbitrary data, including a processor and a storage unit (memory and permanent storage media).

The applicant terminal 300 in FIG. 1 may be associated with an applicant who wants to access at least one of the management server 100 and the blockchain network 200.

The applicant terminal 300 may generate a smart contract that can be operated on the blockchain network 200 using any language, such as solidity. In addition, the applicant terminal 300 may generate a transaction for distributing the generated smart contract to the blockchain network 200.

The applicant terminal 300 may operate as a node constituting the blockchain network 200. In this example, the applicant terminal 300 may implement at least one of a wallet function, a miner function, and a storage function of a full blockchain data. For example, when the applicant terminal 300 includes only the wallet function, it may operate as a node that performs transaction and validation (for example, an SPV (Simplified Payment Verification) node).

The applicant terminal 300 may issue a query or a transaction with at least one of the management server 100 and the blockchain network 200. The query in the present disclosure can be used to query the personal identification information and the number of entries of the applicants registered on the blockchain network 200. The transaction in the present disclosure can be used to perform an update (modify/change/delete/add) of data recorded on the blockchain network 200.

Applicant terminal 300 may transmit and receive application sources written in a programming language. For example, the applicant terminal 300 may compile the application source to generate a client application. For example, the generated client application may be executed after being delivered to at least one of the management server 100 and the blockchain network 200.

The applicant terminal 300 may access the management server 100 and apply for a lottery provided by the management server, and transmit application information to the management server 100 in the process of applying for the lottery.

The lottery in this specification may include lottery in real estate subscriptions, including prizes, limited edition merchandise, and apartments. However, the present invention is not limited thereto, and all events for drawing at least one lottery among a plurality of entries may be lottery.

In addition, when the applicant terminal 300 is included in a node constituting the blockchain network 200, the applicant terminal 300 generates a transaction related to a lottery and at least one of the management server 100 and the blockchain network 200 Can be delivered as one. In addition, the applicant terminal 300 may receive data related to the lottery from at least one of the management server 100 and the blockchain network 200. For convenience of description, it is assumed that the applicant terminal 300 is a separate subject from the blockchain network 200. However, in the present disclosure, it should be interpreted that all operations performed by the nodes constituting the blockchain network can also be performed by the applicant terminal 300.

The applicant terminal 300 has a display, and can receive an input of the applicant and provide an arbitrary form of output to the applicant in confirming the lottery application and/or lottery information.

Communication network 400 according to an embodiment 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 communication network 400 presented in the present disclosure is Code Division Multi Access (CDMA), Time Division Multi Access (TDMA), Frequency Division Multi Access (FDMA), Orthogonal Frequency Division Multi Access (OFDMA), SC-FDMA Various wireless communication systems such as (Single Carrier-FDMA) and other systems can be used. The techniques described in this disclosure can be used in the networks mentioned above, as well as in any form of other communication networks.

2 is a diagram showing an example of a configuration of a computing device constituting a management server and a blockchain network according to some embodiments of the present disclosure.

2, the management server 100 may include a communication unit 110 and a processor 120.

The processor 120 may be composed of one or more cores, a central processing unit (CPU) of a computing device, a general purpose graphics processing unit (GPGPU), and a tensor processing unit (TPU). unit), and any type of processor for performing a lottery by executing instructions stored in the memory. The processor may read a computer program stored in memory to perform a lottery method according to some embodiments of the present disclosure. The processor may control overall operations of components of the management server 100 in order to proceed with the lottery process.

The communication unit 110 may include a wired/wireless Internet module for network access. The communication unit 110 may perform communication with at least one of the applicant terminal 300, the blockchain network 200, and other servers. Wireless Internet technology (Wireless LAN) (Wi-Fi), Wibro (Wireless broadband), Wimax (World Interoperability for Microwave Access), HSDPA (High Speed Downlink Packet Access) may be used. As a wired Internet technology, digital subscriber line (XDSL), fibers to the home (FTTH), and power line communication (PLC) may be used. Also, the transceiver 203 may include a short range communication module. Bluetooth, Bluetooth, Radio Frequency Identification (RFID), infrared data association (IrDA), ultra-wideband (UWB), and ZigBee can be used as short-range communication technology.

The components described above are exemplary and the scope of the present disclosure is not limited to the components described above. That is, additional components may be included or some of the aforementioned components may be omitted according to an implementation aspect of the embodiments of the present disclosure.

Meanwhile, although not illustrated in FIG. 2, the management server 100 may further include a memory. The memory may store a program for the operation of the processor, and may temporarily or permanently store input/output data. The memory includes a flash memory type, hard disk type, multimedia card micro type, card type memory (for example, SD or XD memory, etc.), and RAM (Random Access). Memory, RAM), Static Random Access Memory (SRAM), Read-Only Memory (ROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Programmable Read-Only Memory (PROM), magnetic memory, magnetic disk, optical disk It may contain at least one type of storage medium. This memory can be operated under control of the processor. Also, in the present disclosure, a memory and a storage unit may be used interchangeably with each other.

The processor 120 may control overall operations of the components of the management server 100 in order to proceed with the lottery process.

According to some embodiments of the present disclosure, the processor 120 controls the communication unit 110 to transmit the hash value of the first winning value associated with the N-th round to at least one node constituting the blockchain network 200. Can. When determining the at least one winner terminal in the N-th round, the processor 120 may recognize the number of entries of each of the at least one applicant terminal. The processor 120 may determine at least one winner terminal using the first winning value associated with the N-th lottery, the entry value of each of the at least one entry terminal, and the first information. Then, as the at least one winner terminal is determined, the processor 120 transmits a first winning value and personal identification information of at least one winner terminal to at least one node constituting the blockchain network 200 ( 110) can be controlled. A detailed description thereof will be described later with reference to FIG. 3.

3 is a flowchart illustrating an example of a method in which a processor of a management server according to some embodiments of the present disclosure determines at least one winner terminal in a drawing. 3 and 2, the contents overlapping with those described above with reference to FIGS. 1 to 2 will not be described again, and will be mainly described below.

The steps shown in FIG. 3 are exemplary steps, and it will be apparent to those skilled in the art that some of the steps in FIG. 3 may be omitted or additional steps may be present without departing from the scope of the spirit of the present disclosure.

Referring to FIG. 3, the processor 120 of the management server 100 may generate a hash value of the first winning value of the Nth lottery (S1100).

Specifically, the processor 120 may generate a first winning value before the start of the Nth lottery (eg, before the start of the application for the Nth lottery).

According to some embodiments, the processor 120 may generate an arbitrary value and use it as the first winning value.

According to some other embodiments, the processor 120 may use the random number generated by the random number generation algorithm as the first winning value. Here, the random number generation algorithm may generate a random number through a pseudo-random number generation method (for example, a central square method, a linear congruence method, a Mercentwister, XOR shift) or a hardware random number generator (HRNG). Detailed description thereof will be described later with reference to FIG. 4.

Meanwhile, the processor 120 may generate a hash value of the first winning value using a hash function stored in the memory after generating the first winning value of the Nth lottery. Here, the processor 120 is stored in memory Message (Digest) 1, MD4, MD5, SHS (Secure Hash Standard), SHA (Secure Hash Algorithm)-256, SHA-512, HAS-160 (Hash Algorithm Standard- 160), a hash value of a first winning value may be generated using a hash function such as a hashing algorithm with variable length of output (HAVAL), and a RIPEMD (RACE Integrity Primitives Evaluation Message Digest)-160.

Meanwhile, when the hash value of the first winning value is generated in step S1100, the processor 120 may control the communication unit to transmit the hash value of the first winning value to the blockchain network 200 (S1200). . As at least one node constituting the blockchain network 200 receives the hash value of the first winning value, the hash value of the first winning value may be recorded on the blockchain network 200 through the consensus algorithm. (S1300).

In some embodiments of the present disclosure, as the processor 120 transmits the hash value of the first winning value through the communication unit 110 to at least one node constituting the blockchain network 200, the blockchain network 200 At least one node constituting) may issue a transaction including a hash value of the first winning value. When a transaction including the hash value of the first winning value is issued by at least one node constituting the blockchain, the transaction including the hash value of the first winning value is determined based on the consensus algorithm, and the blockchain network ( 200) A hash value of the first winning value may be recorded.

As described above, by generating the hash value of the first winning value and recording it on the blockchain network 200, all of the plurality of nodes constituting the blockchain network 200 receive the same hash value of the first winning value. Will be shared. In addition, due to the nature of the blockchain technology, a block is created once for any subject, including a management server, a node constituting the blockchain network 200, and an applicant node, and a transaction is generated (in some embodiments of the present disclosure, the first winning value is Once the hash value information is included), it is difficult to change the confirmed transaction. Therefore, the lottery proceeding subject can ensure the transparency and fairness of the lottery. In addition, lottery applicants can secure confidence in the result of the lottery.

On the other hand, when the management server 100 is a node constituting the blockchain network 200, the processor 120 of the management server 100 may issue a transaction including information about a hash value of the first winning value. have.

Meanwhile, the processor 120 may determine at least one winner terminal of the Nth lottery after the hash value of the first winning value is recorded on the blockchain network 200. Then, when determining the at least one winner terminal of the Nth lottery, the processor 120 may recognize the number of entries of each of the at least one applicant terminal (S1400). The process in which the processor 120 recognizes the number of entries of each of the at least one entry terminal will be described in detail in FIG. 5.

On the other hand, the processor 120 recognizes the number of entries of each of the at least one applicant terminal in step S1400, and then determines the added points for each of the at least one applicant terminal based on the recognized number of applications of each of the at least one applicant terminal. 1 Information can be obtained (S1500). The first information for each additional point of at least one entry terminal may be determined by a predetermined calculation method stored in a memory in the management server 100.

As one of various embodiments of a predetermined point-of-spot calculation method stored in a memory in the management server 100, the processor 120 multiplies a value obtained by multiplying a predetermined value by the number of entries of each of the at least one application terminal, and each of the at least one application terminal. It can be decided as an additional point. However, the present invention is not limited thereto, and the processor 120 may determine additional points through various calculation methods.

Meanwhile, the processor 120 may store the first information on the determined added point in the memory. For convenience of description below, each additional point of the applicant terminal is expressed as'additional point', and the additional point information for the entire applicant terminal is expressed as'first information' or'at least one first point of each applicant terminal'. .

By determining the additional points based on the number of entries as described above, it is possible to reflect the individual application efforts of each entrant in the lottery result in the lottery process. In addition, it is possible to secure the fairness of the lottery by preventing bias of the result of winning by giving such additional points, and to raise the desire to apply.

In addition, the processor 120 may determine at least one winner terminal using the first winning value associated with the N-th lottery, the entry value of each of the at least one entry terminal, and the first information (S1600). Some specific embodiments in which the management server determines the winner terminal are described in FIGS. 8 and 9.

On the other hand, if at least one winner terminal is determined in step S1600, the processor 120 transmits a first winning value and personal identification information of at least one winner terminal through the communication unit 110 to the blockchain network 200. It may be transmitted to the at least one node constituting (S1700).

Here, the personal identification information of the at least one winner terminal means information capable of identifying the subject who entered the lottery through the terminal determined as the winner terminal.

For example, the personal identification information of the at least one winner terminal may include the wallet address of the winner (applicant), a resident registration number, and the like entered by the user of the winner terminal when applying for the Nth lottery.

On the other hand, the blockchain network 200, in step S1700, when receiving the first winning value and the personal identification information of the at least one winner terminal, the first winning value and the personal identification of the at least one winner terminal through the consensus algorithm Information can be recorded on the blockchain network 200 (S1800).

In some embodiments of the present disclosure, the processor 120 transmits personal identification information of the at least one winner terminal and the first winning value to at least one node constituting the blockchain network 200 through the communication unit 110. Accordingly, at least one node constituting the blockchain network 200 may issue a transaction including personal identification information of at least one winner terminal and information regarding the first winning value. When a transaction relating to the personal identification information and the first winning value of the winner terminal is issued by at least one node constituting the blockchain, the transaction regarding the personal identification information and the first winning value of the winner terminal is determined based on the consensus algorithm. By doing so, the corresponding information can be recorded on the blockchain network 200.

As described above, by recording each information of the first winning value and at least one winner terminal on the blockchain network 200, all of the plurality of nodes constituting the blockchain network 200 are the same first winning value. And information of at least one winner terminal. In addition, due to the nature of the blockchain technology, a block is created once for any subject, including a management server, a node constituting the blockchain network 200, and an applicant node, and a transaction is generated (in some embodiments of the present disclosure, the first winning value is Once the hash value information is included), it is difficult to change the confirmed transaction. Therefore, all subjects participating in the lottery can compare the hash value of the first winning value and the first winning value to determine whether the first winning value is authentic. And since the terminal information of the winner is recorded on the blockchain, the result of calculating the additional points in the future drawing can also be confirmed by all the drawing subjects. Therefore, the lottery proceedings can ensure the transparency and fairness of the lottery, and the lottery applicants can secure the confidence in the lottery results.

4 is a flowchart illustrating an example of an operation performed by a processor of a management server to determine a first winning value according to some embodiments of the present disclosure. 4 and 3, the overlapping contents described above with reference to FIGS. 1 to 3 will not be described again, and the following description will focus on differences.

Referring to FIG. 4, the processor 120 of the management server 100 may generate a seed value for generating the first winning value by a predetermined method (S1110).

Specifically, an algorithm for generating a seed value may be stored in the memory of the management server 100. Then, the processor 120 may generate a seed value using the algorithm.

In one example, the processor 120 may use the height, block creation time, and block hash value of the N-th lottery block as a seed value for generating the first winning value.

Here, the height of the N-th lottery block means the number of blocks made from the Genesis block (the first generated block recorded on the blockchain) to the current block (in this case, the N-th lottery block). In addition, the block creation time refers to the time when the N-th lottery block is generated through an agreement algorithm in at least one node constituting the blockchain. In addition, the block hash value means a value obtained by converting values obtained by combining elements of the N-th lottery start block header through a hash function. As described above, when generating a seed for random number generation from the characteristics of a block existing in the blockchain, the characteristics of the corresponding block may be adjusted by the subject (miner) generating the block (minor dependency).

As another example, the processor 120 may generate a seed value for generating a first winning value by combining a hashing seed existing in the smart contract and an arbitrary seed value provided by the management server to the smart contract. Here, the hashing seed existing in the smart contract refers to a value that the smart contract creator converts an arbitrary value through a hash function and provides it to a random number requestor (in this case, a management server). The hashing seed existing in the smart contract may be granted to the smart contract by the smart contract creator (in this case, the management server).

Due to the nature of the blockchain technology, information about the properties of the block is disclosed to all of at least one node constituting the blockchain network 200, so there is a risk that the seed value will be disclosed to the lottery. Therefore, when generating a seed value using a smart contract as described above, it is possible not only to overcome the minor dependency, but also to make it impossible for the lottery applicant to find out the first winning value, so that trust in the fairness of the lottery can be secured. Can.

Meanwhile, the processor 120 may generate a random number by using the seed value generated in step S1110 as an input to the random number generation algorithm (S1120). Here, as the random number generation algorithm, a central square method, a linear joint method, a Mersenne twister, an XOR shift, and a hardware random number generator (HRNG) may be used.

Meanwhile, the processor 120 may determine the random number generated in step S1120 as the first winning value (S1130).

Since the random number generated by converting the seed value by the random number generation algorithm is determined as the first winning value, the reliability of the selection method of the winning value can be improved from the viewpoint of the applicant.

5 is a flowchart illustrating an example of a method in which a processor of a management server acquires the number of entries of each of at least one entry terminal from a blockchain network according to some embodiments of the present disclosure. 5, the overlapping contents described above with reference to FIGS. 1 to 4 will not be described again, and will be mainly described below.

Referring to FIG. 5, when the processor 120 of the management server 100 checks the number of entries of each of the at least one entry terminal, it checks the number of entries to at least one node constituting the blockchain network 200. A first signal (application confirmation signal) may be transmitted (S1410). Here, the first signal may include information capable of identifying each of the at least one entrant who participated in the Nth round. For example, the first signal may include at least one resident registration number of each applicant, a mobile phone contact number, a blockchain wallet address, and a serial number of the applicant terminal.

At least one node on the blockchain network 200 receiving the first signal may search from the current block to the Genesis block (S1420).

Specifically, among blocks constituting the block chain, there may be a block recording application information received from the applicant terminal 300. Here, the application information may include personal identification information of the applicant's terminal (for example, the resident registration number of the applicant, the serial number of the terminal, etc.). Accordingly, at least one node constituting the blockchain network 200 can determine the number of entries of each of the at least one entry terminal by checking personal identification information of the entry terminal included in the block.

In addition, a method for at least one node constituting the blockchain network 200 to search from the current block to the Genesis block is as follows.

For example, at least one node on the blockchain network 200 receiving the first signal may sequentially traverse from the current block of the blockchain to the genesis block to check the number of times each of the at least one application terminal is applied. Here, traversing the blockchain may mean checking the previous block sequentially or non-sequentially based on the current block.

Meanwhile, at least one node manages a second signal including second information indicating information on the number of entries of each of the at least one applicant terminal when the number of entries of each of the at least one applicant terminal is recognized in step S1420. It may be transmitted to the server 100 (S1430). In this case, the second information may be transmitted by being included in the second signal in plain text or encrypted form. As a method for encrypting the second information, a symmetric key encryption system (for example, DES: Data Encryption Standard, AES: Advanced Encryption Standard, etc.) and a public key encryption system (RSA encryption algorithm, elliptic curve encryption, etc.) can be used.

For example, at least one node constituting the blockchain network 200 may include the second information encrypted using the symmetric key in the second signal and transmit it to the management server 100. The processor 120 of the management server 100 may decrypt the encrypted second information using the same symmetric key used for encryption, and recognize the number of entries of each of the at least one entry terminal.

As another example, at least one node constituting the blockchain network 200 may encrypt the second information with the private key of the node and send it to the management server 100. In this case, the processor 120 of the management server 100 may decrypt the encrypted second information through the public key of the node transmitting the second information, thereby recognizing the number of times of application of each of the at least one applicant terminal.

As another example, at least one node constituting the blockchain network 200 may transmit the encrypted second information together with the original text when the second information is encrypted with the private key and transmitted to the management server 100. have. The processor 120 of the management server 100 decrypts the encrypted second information through the public key of the node transmitting the second information, and compares it with the original data to recognize whether the second information has been forged or falsified. can do.

However, the method of encrypting the second information is not limited to the above-described examples, and the second information may be encrypted through various methods.

When the second information on the number of entries is encrypted and transmitted as described above, manipulation of the additional point information calculated based on this is impossible. Therefore, trust can be established between the lottery subjects regarding the fairness of the lottery results.

Meanwhile, the processor 120 may recognize the number of entries of each of the at least one entry terminal through the second information included in the second signal received in step S1430 (S1440).

Meanwhile, the processor 120 may determine, as an additional point, a value obtained by multiplying the number of entries of each of the recognized at least one entry terminal by a predetermined value. However, the present invention is not limited thereto, and the processor 120 may determine additional points through various calculation methods.

When the additional points for at least one application terminal are determined, the processor 120 may store the first information about the additional points in a memory located inside or outside the management server.

For example, the processor 120 may generate a data structure (eg, an array, a list, etc.) to store the first information about the additional point using the personal identification information of the applicant terminal. As the data structure is generated, the processor 120 may store the first information about the added point in the memory by correlating the individual identification information of each of the individual applicant terminals with the individual identification information of the applicant terminal.

Further, the predetermined value multiplied by the number of entries may be pre-stored in the memory of the management server 100.

By determining the additional points based on the number of entries as described above, it is possible to reflect the individual application efforts of each entrant in the lottery result in the lottery process. In addition, it is possible to secure the fairness of the lottery by preventing bias of the result of winning by giving such additional points, and to raise the desire to apply.

6 is a flowchart illustrating an example of a method for causing a processor of a management server to cause application information to be written to a blockchain network according to some embodiments of the present disclosure. 6, the overlapping contents described above with reference to FIGS. 1 to 5 will not be described again, and will be mainly described below.

Referring to FIG. 6, the applicant terminal 300 may transmit the application information to the management server 100 (S2100). The processor 120 of the management server 100 may receive application information from each of the at least one application terminal through the communication unit 110.

Here, the application information may include all information necessary for determining the winner and recording the winner information in performing the lottery process.

Specifically, the application information may include personal identification information (for example, the wallet address of the application terminal or the resident registration number of the application) and the application value of each application terminal. Here, the entry value may be any value input from each entry terminal. However, the present invention is not limited thereto, and the entry value may be a random number value generated using a seed generated on a smart contract or a hash value for the random number value.

When the application information is received through the communication unit 110 in step S2100, the processor 120 of the management server 100 may generate third information corresponding to the application information (S2200).

Specifically, the third information may be information including a transaction, a smart contract, etc. for transmitting the application information received from the application terminal 300 to the blockchain network.

In addition, the third information is a time stamp corresponding to information on the application time when the management server 100 receives the application information from each of the at least one application terminal, personal identification information of each application terminal, and the application value of the application terminal. Information may be included.

Meanwhile, when the third information is generated in step S2200, the processor 120 may control the communication unit 110 to transmit the generated third information to at least one node constituting the blockchain network 200. Yes (S2300).

At least one node constituting the blockchain network 200 may generate a new block based on the consensus algorithm to determine and record the received third information on the blockchain. When a new block is generated, the third information is recorded and confirmed in the block, so that it can be recorded on the blockchain network 200 (S2400).

That is, in step S2300, the processor 120 transmits the third information to the blockchain network, so that the third information is written to the blockchain network based on the consensus algorithm at a plurality of nodes constituting the blockchain network. It can be caused.

As described above, as the application information is recorded on the blockchain network 200, the lottery subjects share the application information of all applicants. In addition, once recorded on the blockchain network 200, forgery and alteration of the record is virtually impossible due to the nature of the blockchain technology. Thanks to these characteristics, trust between lottery participants can be established regarding the lottery process and results.

Here, when the third information is recorded in the block on the blockchain network 200, it is recorded in the form of a transaction or a smart contract in the body part of the application block. The form in which the third information is recorded on the blockchain will be described in detail in FIG. 7 below.

7 is a diagram illustrating an example of a type and structure of a block connected on a blockchain network according to some embodiments of the present disclosure. The overlapping contents described above with reference to FIGS. 1 to 6 in connection with FIG. 7 will not be described again, and description will be focused on differences below.

Referring to FIG. 7, a block connected to the blockchain may include an N-th lottery start block 510, an application block 520, and an N-th lottery result block 530.

The N-th lottery start block 510 may be a block generated when the N-th lottery starts. The application block 520 may be a block that is generated as the application for the lottery is performed through the application terminal 300 and transmitted to the management server 100 to at least one node constituting the blockchain network 200. have. In addition, the N-th lottery result block 530 may be a block generated at the end of the N-th lottery. Here, the start and end of the Nth lottery may be performed at a preset time.

The N-th lottery start block 510 may include a block header 511 and a transaction 512. In addition, the transaction 512 included in the N-th lottery start block 510 may include a hash value 512a of the first winning value of the N-th lottery.

Here, the block header 511 means a portion in which information not related to a lottery is recorded, and the block header is specifically a hash value of a previous block header, a nonce value, and a version value (not shown) indicating the version of the lottery program Hour), when a block is generated, may include a bit value (not shown), a merkleroot value, and the like used to adjust the difficulty level of the proof of work.

Here, the merkle root value means a result value of inputting lottery-related information included in the block body into hashley.

A hash value 512a of the first winning value may be recorded as a transaction 512 in the body portion of the N-th lottery start block 510.

The hash value 512a of the first winning value may be issued in the form of a transaction or a smart contract by at least one node constituting the blockchain network 200. The blockchain network 200 may record a transaction or smart contract including the hash value 512a of the first winning value on the blockchain network 200 through an agreement algorithm.

As described above, by generating the hash value 512a of the first winning value and recording it on the blockchain network 200, all of the plurality of nodes constituting the blockchain network 200 are of the same first winning value. It will share the hash value. In addition, due to the nature of the blockchain technology, a block is created once for any subject, including a management server, a node constituting the blockchain network 200, and an applicant node, and a transaction is generated (in some embodiments of the present disclosure, the first winning value is After the hash value information is determined, it is difficult to change the determined transaction (in this case, the transaction that records the hash value of the first winning value). Therefore, the lottery proceeding subject can ensure the transparency and fairness of the lottery. In addition, lottery applicants can secure confidence in the result of the lottery.

The application block 520 may include a block header 521 and a transaction 522. Here, since the block header 521 of the entry block 520 is the same as the block header 511 of the N-th lottery start block 510, information related to the lottery is recorded. Omitted.

The transaction 522 included in the entry block 520 may include personal identification information of the entry terminal, entry values of the entry terminal, and time stamps 522a to 522c.

The personal identification information 522c of the applicant terminal recorded in the application block 520 means information that enables the applicant to be recognized through the applicant terminal.

As an example, the personal identification information 522a of the applicant terminal may include the wallet address of the applicant terminal, the resident registration number of the applicant, and the like.

As another example, the personal identification information 522a of the applicant terminal may include a terminal serial number of the applicant terminal.

Meanwhile, when the application block 520 is recorded in the blockchain network 200, the application value 522b may be recorded in the form of a plain text, a cipher text, or a hash value.

The time stamp 522c indicates an application time at which the management server has received the application information, and may correspond to information about the application time of the applicant terminal.

As described above, the personal identification information 522a of the applicant terminal, the application value 522b of the applicant terminal and the time stamp 522c are recorded as the application block 520 on the blockchain network 200, thereby blocking the blockchain network. All nodes constituting the 200 may recognize a specific entrant by matching the entry value and the entry time information. Once the transaction is confirmed and recorded on the blockchain, the participants in the lottery can trust that the application information has not been falsified or falsified due to the nature of the blockchain technology, which is difficult to forge and falsify the information recorded on the blockchain. . Therefore, the effect that trust in the lottery process and results is formed between the lottery subjects.

The N-th lottery result block 530 may include a block header 531 and a transaction 532. Here, since the block header 531 of the N-th lottery result block 530 is the same as the block header 511 of the N-th lottery start block 510, it means a part in which information not related to the lottery is recorded. Detailed description is omitted. The transaction 532 may include a first winning value and personal identification information 532a to 532d of the N-th winner terminal.

By recording the personal identification information 532b to 532d of at least one winner terminal on the blockchain network 200, reliability of the temporary initialization process, which will be described later in FIG. 10, can be ensured. In addition, when a new lottery process is performed in the future, all subjects participating in the lottery can recognize the number of entries and calculate the score.

As described above, by providing the first winning value recorded on the blockchain as a hash value (512a) at the start of the lottery, and providing the original value (512c) of the first winning value recorded on the blockchain at the time of lottery result announcement In addition, it is possible to secure the confidence of the results of the lottery.

Specifically, at the start of the lottery, since the first winning value is provided as a hash value, applicants participating in the lottery participate in the lottery without knowing the first winning value due to the nature of the hash function that cannot determine the original value as the result value. do. In addition, applicants participating in the lottery can determine whether the first winning value is authentic by comparing the hash value 512a and the first winning value 532a of the first winning value of the Nth lottery when the drawing is finished. Moreover, since individual transactions are issued on the blockchain in the form of an electronic signature, applicants can check if the first winning value has been forged or falsified, and once a block is created, it is impossible to change the confirmed transaction by the nature of the blockchain technology. It is also very unlikely that the transaction regarding the winning value will change. Therefore, all lottery subjects can be trusted in the lottery process by sharing all records that the whole lottery process was performed without manipulation by some subjects.

On the other hand, the configuration included in the body of the block is not limited to the above-described configuration, and may include more or less than the above-described configuration according to the type and content of the lottery.

8 is a flowchart illustrating an example in which a processor of a management server determines at least one winner terminal according to some embodiments of the present disclosure. Regarding FIG. 8, contents overlapping with those described above with reference to FIGS. 1 to 7 will not be described again, and will be described below with reference to differences.

Referring to FIG. 8, the processor 120 may recognize the number of terminals that can be set as the winner terminal by checking the fourth information on the number of terminals that can be set as the winner terminal (S1610 ).

Specifically, the fourth information on the number of terminals that can be set as the winner terminal may be included in a transaction and recorded as a block on the blockchain network. Accordingly, the processor 120 may control the communication unit 110 to transmit a request signal requesting the fourth information to the blockchain network 200 in order to recognize the number of terminals that can be set as a winner terminal. At least one node constituting the blockchain network may check the block recorded in the blockchain network 200 upon receipt of the request signal to check fourth information on the number of terminals that can be set as the winner terminal. . Also, at least one node may transmit the fourth information to the management server 100. In this case, the processor 120 may receive and confirm the fourth information through the communication unit 110 to recognize the number of terminals that can be set as the winner terminal.

On the other hand, the processor 120 may input the first information about the application value and the additional point of each of the at least one application terminal into a predetermined adjustment application value calculation formula to determine the adjustment application value for each application terminal (S1620). . Here, the processor 120 may first obtain first information about the added points of each of the at least one applicant terminal before determining the adjustment entry value. As described above, a detailed description of the above is omitted in FIG. 3.

The adjustment application value calculation formula may mean an expression that calculates a specific value by inputting information related to the determination of the winner (for example, first information about the application value and the added score). The processor 120 may input information related to the determination of the winner in the above-described formula to calculate the adjustment application value used when determining the winner terminal.

For convenience of description, it will be assumed and described below as a specific numerical value derived from the adjustment application value calculation formula used to determine the winner terminal. However, it may be interpreted that the adjustment entry value used when determining the winner terminal may include various data types (for example, a matrix) suitable for the content of the lottery.

According to some embodiments of the present disclosure, the processor 120 may calculate an adjusted entry value by subtracting an additional point from the entry value when the entry value of the entry terminal is greater than the first winning value. However, when the value obtained by subtracting the score from the entry value becomes smaller than the first prize value, the processor 120 may recognize the first prize value as the adjusted entry value.

According to some other embodiments of the present disclosure, the predetermined adjustment application value calculation formula may calculate an adjustment application value by adding a point to the application value when the application value of the applicant terminal is smaller than the first winning value. However, when the value obtained by adding the point of addition to the entry value is greater than the first prize value, the processor 120 may recognize the first prize value as the adjusted entry value.

Meanwhile, the adjustment application value calculation formula may be issued as a transaction or may be recorded in the blockchain network 200 through a smart contract. As described above, when the adjustment application value calculation formula is recorded as a block on the blockchain network and disclosed to all nodes constituting the blockchain network, all subjects participating in the lottery can confirm the process in which the adjustment application value is calculated. The transparency of the result lottery can be guaranteed. As a result, applicants will be more reliable in the drawing process and in the drawing process.

When the adjustment entry value is calculated in step S1620, the processor 120 may recognize the relationship between the adjustment entry value for each of the at least one entry terminal and the first entry value to determine the winner terminal. Here, the relationship between the adjusted entry value and the first winning value means data that is the basis for the processor 120 to determine the winner terminal.

In one example, the processor 120 may calculate a difference value between the adjusted entry value of each of the at least one entry terminal and the first winning value (S1630). Then, the processor 120 may use the difference value as a criterion for determining the winner terminal.

Meanwhile, when the difference value is calculated in step S16300, the processor 120 may recognize whether there are a plurality of applicant terminals having the minimum difference value (S1640).

When the processor 120 recognizes that there is only one applicant terminal having the minimum difference value (S1640, No), the processor terminal having the smallest difference value between the adjusted entry value and the winning value may be determined as the winner terminal (S1650).

On the other hand, when the processor 120 recognizes that there are a plurality of application terminals having a minimum difference value (S1640, Yes), it can determine a priority terminal among a plurality of application terminals having a minimum difference value as a winner terminal. Yes (S1660).

Here, the priority for the plurality of applicant terminals having the minimum difference value may be determined based on a sequential relationship of the application time of each of the at least one application terminal.

Specifically, the processor 120 may give priority to each of the plurality of applicant terminals having the minimum difference value according to the selection of the entry time of the applicant terminal. A detailed description thereof will be described later with reference to FIG. 9.

As described above, when a priority is given based on the application time of the entry time of the entry terminal, a fair lottery can be expected among entries having the same adjustment entry value.

On the other hand, if the priority is determined using the timestamp 522c recorded in the blockchain network 200, the possibility that the priority may fluctuate due to the intervention by the lottery subject due to a feature that is virtually impossible to forge or tamper with the blockchain. This is extremely slim. Therefore, when determining the winner according to the present disclosure, there is an effect that trust in the lottery results of the lottery subjects can be secured.

If the adjusted entry value is the same, a detailed method of assigning priority based on the entry time information will be described in more detail in FIG. 9 below.

Meanwhile, the processor 120 may compare the number of terminals that can be set as the recognized winner terminal and the number of winners determined from the Nth round to the current time (S1670). Then, the processor 120 repeats the steps (S1640 and S1670) of determining the winner terminal described above until the number of terminals that can be set as the winner terminal and the number of terminals determined as the winner terminal in the N-th round are the same. It can be done.

Meanwhile, as described above, the processor 120 determining the winner terminal based on the difference value is only one embodiment of a method of determining the winner terminal through the relationship between the adjustment entry value and the winning value, and determining the winner terminal The method is not limited to the above-described embodiment.

9 is a flowchart illustrating an example of a method of determining a winner based on an application time when a plurality of applicant terminals having the same difference between the adjustment entry value and the winning value exist, according to some embodiments of the present disclosure . 9 and 8, descriptions overlapping with those described above with reference to FIGS. 1 to 8 will not be described again.

Referring to FIG. 9, the processor 120 of the management server 100 may recognize an application time of each of at least one entry terminal having the same difference value between the adjustment entry value and the first winning value (S1661).

Specifically, a time stamp indicating the sequential relationship of the entry time of the entry terminal may be included in the transaction and recorded as a block on the blockchain network. Therefore, the processor 120 transmits a request signal for requesting a time stamp for each of a plurality of application terminals having the same difference value to the blockchain network 200 when setting the priority for a plurality of application terminals having the same difference value. The communication unit 110 can be controlled to do so. Here, the request signal may include personal identification information of each of the plurality of applicant terminals having the same difference value.

Meanwhile, at least one node constituting the blockchain network 200 may search for at least one application block including personal identification information included in the request signal on the blockchain. And, at least one node constituting the blockchain network 200 may check time stamps for each of a plurality of applicant terminals having the same difference value within at least one searched application block. Then, at least one node constituting the blockchain network 200 may transmit time stamps for each of the plurality of entry terminals having the same difference value to the management server. In this case, the processor 120 may receive and confirm a time stamp for each of the plurality of applicant terminals having the same difference value through the communication unit 110 to recognize the application time of each of the at least one applicant terminal having the same difference value. .

As another example, the processor 120 checks the personal identification information 522a of the applicant terminal recorded in the application block, and each of the at least one application block including identification information of each of the plurality of applicant terminals having the same difference value, respectively It is possible to relatively recognize application time information of each of the at least one entry terminal based on the height of. Specifically, information on the time when an event (for example, an application for a lottery) occurs in a block chain that is a P2P network may be recognized through a sequential relationship of block connection. Therefore, it can be seen that if the block has a fast creation time, it is first connected to the blockchain. When these features are applied to the present disclosure, it can be seen that the earlier the application block is generated, the earlier the application is made. Accordingly, the processor 120 may recognize the application time information of each of the plurality of application terminals having the same difference value by using the height of at least one application block including the identification information of each of the plurality of application terminals having the same difference value. .

On the other hand, as the processor 120 recognizes the application time information of each of the at least one application terminal, it compares the application time information of each of the recognized at least one application terminal, and prioritizes the application terminal having the fastest application time. It can be given (S1662).

According to some embodiments of the present disclosure, the processor 120 may arrange at least one applicant terminal having the same difference value by using the application time information as a key value. Specifically, the processor 120 may use an internal sorting method such as selective sorting, insert sorting, quick sorting, and heap sorting. And, when the memory is located outside the management server 100, the processor 120 may use an external alignment method.

According to some other embodiments of the present disclosure, when the first application time of the first applicant terminal is faster than the second application time of the second applicant terminal, the processor 120 may transmit the first application terminal to the first application terminal. Priority can be given. Here, since the first applicant terminal and the second applicant terminal are merely exemplary representations of two applicant terminals for which comparison is performed in the sorting process for prioritization, it should not be interpreted to mean any special sorting method.

The processor 120 may give priority to the terminal having the fastest entry time based on the alignment result, as at least one entry terminal having the same difference value sorts the entry time information as a key value. have.

On the other hand, after the priority is given in step S1662, the processor 120 may determine the high-priority applicant terminal as the winner terminal.

According to at least one of the above-described embodiments, it is possible to expect a fair lottery among applicants having the same adjusted entry value by giving priority according to the selection of entry time information. In the present disclosure, in particular, information about the application time is recorded in the blockchain network 200 and shared equally among all lottery subjects. In addition, since the information contained in the contents once confirmed as a transaction on the blockchain is virtually impossible to falsify or falsify, the possibility of intervention by the lottery is extremely rare. Therefore, when determining the winner according to the present disclosure, there is an effect that trust in the lottery results of the lottery subjects can be secured.

10 is a flowchart illustrating an example in which the processor of the management server according to some embodiments of the present disclosure initializes the first information about the added points set in the winner terminal. 10, the overlapping contents described above with reference to FIGS. 1 to 9 will not be described again, and will be described below with reference to differences.

Referring to FIG. 10, the processor 120 of the management server 100 may recognize whether at least one winner terminal has been determined (S3100).

When it is recognized that at least one winner terminal has not been determined (S3100, No), the processor 120 may check whether the winner terminal has been periodically or aperiodically determined.

On the other hand, when the processor 120 of the management server 100 recognizes that at least one winner terminal has been determined (S3100, Yes), it initializes the first information about the additional points recorded in the memory for each of the at least one winner terminal. It can be done (S3200).

Specifically, the processor 120 may recognize personal identification information of the terminal determined as the winner terminal. Upon recognizing the personal identification information of the terminal determined as the winner terminal, the processor 120 may retrieve the first information for each additional point of at least one applicant terminal stored from the memory. The processor 120 may initialize the additional point information corresponding to the personal identification information of the terminal determined as the recognized winner terminal. In addition, initialization of additional points for each of the winner terminals may occur periodically or aperiodically.

As described above, it is possible to prevent the bias of the result of the lottery by initializing the first information about the additional points for the terminal determined as the winner. Therefore, it is possible to prevent the relative deprivation of the applicants due to the bias of the result of the lottery, and to make the application effort negligent. Such application efforts can have a positive effect on the activation of the lottery itself in the long term, which can have a positive effect on the subjects managing the lottery.

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

The computer 1102 illustrated in FIG. 11 may correspond to at least one of the management server 100, at least one node (computing device) constituting the blockchain network 200, and the applicant terminal 300.

Although the present disclosure has been described above in general with respect to computer-executable instructions that can be executed on one or more computers, it is well understood by those skilled in the art that the present disclosure can be implemented in combination with other program modules and/or as a combination of hardware and software. You will know.

Generally, modules herein include routines, procedures, programs, components, data structures, etc. that perform particular tasks or implement particular abstract data types. In addition, those of ordinary skill in the art may find that the methods of the present disclosure include single-processor or multiprocessor computer systems, minicomputers, mainframe computers, as well as personal computers, handheld computing devices, microprocessor-based or programmable consumer electronics, and the like (each of which is). It will be appreciated that it may be implemented with other computer system configurations, including those that may operate in conjunction with one or more associated devices.

The described embodiments of the present disclosure can also be practiced in distributed computing environments where certain tasks are performed by remote processing devices that are linked through a communications 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-accessible media includes volatile and non-volatile media, transitory and non-transitory media, removable and non-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 are volatile and non-volatile media, temporary and non-transitory media, removable and non-removable, implemented in any method or technology for storing information such as computer readable instructions, data structures, program modules or other data Includes media. Computer-readable storage media may include RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital video disk (DVD) or other optical disk storage device, magnetic cassette, magnetic tape, magnetic disk storage device or other magnetic storage Device, or any other medium that can be accessed by a computer and used to store desired information.

Computer readable transmission media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and Includes all information delivery media. The term modulated data signal means a signal in which one or more of the characteristics of the signal are set or changed to encode information in the signal. By way of example, and not limitation, computer readable transmission media includes 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, and the computer 1102 includes a processing device 1104, a system memory 1106, and a system bus 1108. do. System bus 1108 connects system components, including, but not limited to, system memory 1106 to processing device 1104. The processing device 1104 can be any of a variety of commercial processors. Dual processor and other multiprocessor architectures may also be used as the processing unit 1104.

The system bus 1108 can be any of several types of bus structures that can be further interconnected to a memory bus, peripheral bus, and 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 a non-volatile memory 1110 such as ROM, EPROM, EEPROM, etc., and this BIOS is basic to help transfer information between components in the computer 1102 at the same time as during startup. Contains routines. The RAM 1112 may also include high-speed RAM, such as static RAM for caching data.

Computer 1102 also has an internal hard disk drive (HDD) 1114 (eg, 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 (eg, for reading from or writing to removable diskette 1118), and optical disk drive 1120 (eg, CD-ROM Disc 1122 for reading or reading from or writing to other high-capacity optical media such as a DVD). The hard disk drive 1114, the magnetic disk drive 1116, and the optical disk drive 1120 are respectively connected to the system bus 1108 by the hard disk drive interface 1124, the magnetic disk drive interface 1126, and the optical drive interface 1128. ). The interface 1124 for implementing an external drive includes, for example, at least one of USB (Universal Serial Bus) and IEEE 1394 interface technology, or both.

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 above description of computer readable storage media refers to HDDs, removable magnetic disks, and removable optical media such as CDs or DVDs, those of ordinary skill in the art can use a zip drive, magnetic cassette, flash memory card, cartridge, It will be appreciated that other types of storage media readable by computers, etc., may also be used in the exemplary operating environment and that any such media may include computer-executable instructions for performing the methods of the present disclosure. .

A number of program modules may be stored in the drive and RAM 1112, including the operating system 1130, one or more application programs 1132, other program modules 1134, and program data 1136. 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 can be implemented in various commercially available operating systems or combinations of operating systems.

The user may input commands and information to the computer 1102 through one or more wired/wireless input devices, for example, pointing devices 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, etc. These and other input devices are often connected to the processing unit 1104 through an input device interface 1142 connected to the system bus 1108, but the parallel port, IEEE 1394 serial port, game port, USB port, IR interface, And other interfaces.

The 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, and the like.

The computer 1102 can 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 conventional network node, generally for computer 1102. It includes many or all of the described components, but for simplicity, only the memory storage device 1150 is shown. The illustrated logical connections include wired/wireless connections to a local area network (LAN) 1152 and/or a larger network, such as a wide area network (WAN) 1154. Such LAN and WAN networking environments are common in offices and companies, and facilitate enterprise-wide computer networks such as intranets, all of which can be connected to computer networks around the world, such as 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. The adapter 1156 can facilitate wired or wireless communication to the LAN 1152, which also includes a wireless access point installed therein to communicate with the wireless adapter 1156. When used in a WAN networking environment, the computer 1102 may include a modem 1158, connect to a communication server on the WAN 1154, or otherwise establish communication over the WAN 1154, such as through the Internet. Have a means The modem 1158, which may be an internal or external and 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 illustrated network connection is exemplary and other means of establishing a communication link between computers can be used.

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

Wi-Fi (Wireless Fidelity) enables a connection to the Internet or the like without a wired connection. Wi-Fi is a wireless technology such as a cell phone that allows a computer, for example, to send and receive data indoors and outdoors, ie anywhere within the base station's coverage area. 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.

Those of ordinary skill in the art of the present disclosure may use various examples of logical blocks, modules, processors, means, circuits and algorithm steps described in connection with the embodiments disclosed herein in electronic hardware, (convenience For the sake of understanding, it may be implemented by various forms of program or design code (referred to herein as “software”) or a combination of both. 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. Those skilled in the art of the present disclosure may implement the functions described in various ways for each particular application, but such implementation decisions should not be interpreted as falling outside the scope of the present disclosure.

Various embodiments presented herein can be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques. The term "manufactured article" includes a computer program, carrier, or media accessible from any computer-readable device. For example, computer-readable storage media include magnetic storage devices (eg, hard disks, floppy disks, magnetic strips, etc.), optical disks (eg, CDs, DVDs, etc.), smart cards, and flashes. Memory devices (eg, EEPROMs, cards, sticks, key drives, etc.), but are not limited to these. The term “machine-readable medium” includes, but is not limited to, wireless channels and various other media capable of storing, retaining, and/or transferring command(s) and/or data.

It is understood that the specific order or hierarchy of steps in the processes presented is an example of exemplary approaches. Based on design priorities, it is understood that within the scope of the present disclosure, a specific order or hierarchy of steps in the processes may be rearranged. The accompanying 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.

Descriptions of the presented embodiments are 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 skilled in the art of the present disclosure, and the general principles defined herein can be applied to other embodiments without departing from the scope of the present disclosure. Thus, the present disclosure should not be limited to the embodiments presented herein, but should be interpreted in the broadest scope consistent with the principles and novel features presented herein.

Claims (20)

A computer program stored on a computer readable storage medium,
The computer program includes instructions for the management server to perform the following operations, the operations;
Transmitting a hash value of the first winning value associated with the N-th round to at least one node constituting the blockchain network;
When determining at least one winner terminal in the N-th lottery, recognizing the number of entries of each of the at least one applicant terminal;
Acquiring first information about an additional point of each of the at least one entry terminal based on the number of entries of each of the at least one entry terminal;
Determining the at least one winner terminal using the first winning value associated with the N-th lottery, the entry value of each of the at least one applicant terminal, and the first information;
As the at least one winner terminal is determined, transmitting the first winning value and personal identification information of the at least one winner terminal to the at least one node constituting the blockchain network; And
If the at least one winner terminal is determined, initializing the added points set in the at least one winner terminal in the first information;
Containing,
A computer program stored on a computer readable storage medium.
According to claim 1,
The operation of transmitting the hash value of the first winning value associated with the N-th lottery to at least one node constituting the blockchain network,
Generating a random number using a seed value generated by a preset method; And
Determining the random number as the first winning value;
Containing,
A computer program stored on a computer readable storage medium.
According to claim 1,
The operation of recognizing the number of entries of each of the at least one entry terminal,
Transmitting a first signal to check the number of entries to the at least one node constituting the blockchain network;
Receiving a second signal in response to the first signal from the at least one node-the second signal is the at least one applicant terminal generated by searching from the genesis block recorded in the blockchain network to the current block And second information indicating the number of times of each application -; And
Recognizing the number of entries of each of the at least one entry terminal based on the second information included in the second signal;
Containing,
A computer program stored on a computer readable storage medium.
According to claim 1,
The operation of acquiring the first information about the additional points of each of the at least one entry terminal,
Determining a value multiplied by a predetermined value by a number of entries of each of the at least one application terminal;
Containing more,
A computer program stored on a computer readable storage medium.
According to claim 1,
Receiving application information from each of the at least one application terminal; And
By transmitting the third information corresponding to the application information to at least one node constituting the blockchain network, the third information is transmitted to the blockchain network based on an agreement algorithm in a plurality of nodes constituting the blockchain network. The action causing it to be recorded;
Containing more,
A computer program stored on a computer readable storage medium.
The method of claim 5,
The third information,
And a time stamp corresponding to information on an application time at which the application information is received from each of the at least one application terminal,
A computer program stored on a computer readable storage medium.
The method of claim 6,
The application information and the third information,
The personal identification information of each of the at least one entry terminal and the entry value of each of the at least one entry terminal,
A computer program stored on a computer readable storage medium.
The method of claim 7,
Determining the at least one winner terminal,
Adjustment application for each of the applicant terminals by inputting the first winning value, the application value of each of the at least one application terminal, and the first information about the additional points of each of the at least one application terminal into a predetermined adjustment application value calculation formula Determining a value;
Containing more,
A computer program stored on a computer readable storage medium.
The method of claim 8,
Determining the at least one winner terminal,
Calculating a difference value between the adjusted entry value and the first winning value for each of the at least one entry terminal; And
When determining the at least one winner terminal, determining an applicant terminal having the smallest difference value among the at least one applicant terminal in order as the at least one winner terminal;
Containing,
A computer program stored on a computer readable storage medium.
The method of claim 8,
Determining the at least one winner terminal,
Checking fourth information on the number of terminals that can be set as a winner terminal;
Recognizing the number of terminals that can be set as the winner terminal based on the fourth information;
Calculating a difference value between the adjusted entry value and the first winning value for each of the at least one entry terminal; And
Determining a winner terminal having the earliest application time among a plurality of applicant terminals having the same difference value, if the plurality of applicant terminals have the same difference value;
Containing,
A computer program stored on a computer readable storage medium.
The method of claim 10,
When there are a plurality of applicant terminals having the same difference value, the operation of determining the winner terminal having the earliest application time among the plurality of applicant terminals having the same difference value,
If the first entry time of the first entry terminal is earlier than the second entry time of the second entry terminal, prioritizing the first entry terminal when determining the winner terminal;
Containing more,
A computer program stored on a computer readable storage medium.
The method of claim 10,
When there are a plurality of applicant terminals having the same difference value, the operation of determining the winner terminal having the earliest application time among the plurality of applicant terminals having the same difference value,
Checking a block height of an application block including application information of each of a plurality of application terminals having the same difference value; And
Determining an applicant terminal corresponding to the personal identification information recorded in the application block having the lowest block height as a winner terminal;
Containing,
A computer program stored on a computer readable storage medium.
delete delete A communication unit capable of communicating with at least one node constituting a blockchain network; And
Processor;
Including,
The processor,
The communication unit is controlled to transmit the hash value of the first winning value associated with the N-th round to at least one node constituting the blockchain network,
When determining at least one winner terminal in the N-th round, the number of entries of each of the at least one entry terminal is recognized,
Based on the number of entries of each of the at least one entry terminal, obtain first information about the added points of each of the at least one entry terminal,
At least one winner terminal is determined by using a first winning value associated with the N-th lottery, each entry value of the at least one entry terminal, and the first information,
As the at least one winner terminal is determined, the communication unit is controlled to transmit the first winning value and personal identification information of the at least one winner terminal to the at least one node constituting the blockchain network,
If the at least one winner terminal is determined, in the first information to initialize the determined points to at least one winner terminal,
Management server.
The method of claim 15,
The processor,
Determining a first winning value associated with the N-th lottery as a random number generated using a seed value generated by a predetermined method,
Management server.
The method of claim 15,
The processor,
Control the communication unit to transmit a first signal for checking the number of entries to the at least one node constituting the blockchain network in order to recognize the number of entries of each of the at least one entry terminal,
Receiving the second signal in response to the first signal from the at least one node through the communication unit-the second signal is the at least one generated by searching from the genesis block recorded in the blockchain network to the current block Contains the second information indicating the number of times each application terminal of the-
Recognizing the number of entries of each of the at least one entry terminal based on the second information included in the second signal,
Management server.
The method of claim 15,
The above points are
Obtained by multiplying the number of entries of each of the at least one entry terminal by a predetermined value,
Management server.
The method of claim 15,
The processor,
Receiving application information from each of the at least one entry terminal through the communication unit,
By controlling the communication unit to transmit the third information corresponding to the application information to at least one node constituting the blockchain network, the third information is based on the consensus algorithm at a plurality of nodes constituting the blockchain network. Causing it to be recorded on the blockchain network,
Management server.
The method of claim 19,
The third information,
And a time stamp corresponding to information on an application time at which the application information is received from each of the at least one application terminal,
Management server.

Images