WO2020096072A1

WO2020096072A1 - Method and system for efficiently processing, in block-chain, high transaction throughput required by dapp

Info

Publication number: WO2020096072A1
Application number: PCT/KR2018/013315
Authority: WO
Inventors: 장호진; 이지홍; 이혜진; 소홍섭; 김재석; 장은호; 이홍규
Original assignee: 라인플러스 주식회사
Priority date: 2018-11-05
Filing date: 2018-11-05
Publication date: 2020-05-14
Also published as: JP2022520141A; KR102553877B1; KR20210071962A; JP7339335B2

Abstract

Provided are a method and a system for efficiently processing, in a block-chain, a high transaction throughput required by a Decentralized Application (DApp). A method for processing a transaction, according to embodiments of the present invention, may comprise the steps of: receiving a transaction requested by a decentralized application (DApp); generating a transaction identifier for the transaction; transmitting a response including the generated transaction identifier to the DApp; and transmitting, to a queue server, the transaction to which the generated transaction identifier is assigned such that the transaction to which the generated transaction identifier is assigned is stored in a queue included in the queue server and then is sequentially recorded in a block-chain by a consumer server.

Description

Method and system for efficiently processing high transaction throughput required by DApp on the blockchain

The following description relates to a transaction processing method and system for efficiently processing a high transaction throughput required by a decentralized application (DApp) in a blockchain.

Block-chain is an electronic ledger, implemented as a computer-based distributed, peer-to-peer (P2P) system composed of blocks for transactions. Each transaction (Tx) is a data structure that encodes a control transmission of a digital asset between participants in a blockchain system, and includes at least one input and at least one output. Each block is linked together, including the hash of the previous block, to create a permanent, unalterable record of all transactions recorded on the blockchain from the beginning. For example, Korean Patent Publication No. 10-2018-0113143 discloses a blockchain-based user-defined currency transaction system and its operation method.

Meanwhile, a decentralized application (DApp) refers to an application in which the backend code runs on a decentralized peer-to-peer network (or makes data calls and registrations to the blockchain database) and provides it as an interface in the front end. At this time, the writing of the transaction in the blockchain is too slow because the process of creating a block and connecting it to the chain through consensus among nodes on the blockchain network is required, and the blockchain itself does not scale out. Does not. For example, adding a node to create a block in the blockchain network increases the cost of consensus for block creation, but does not increase the rate of block creation for transactions. Therefore, there is a problem in that it is difficult to handle the high transaction throughput required by the DApp on the blockchain.

Provides a transaction processing method and system for efficiently processing high transaction throughput required by a decentralized application (DApp) on the blockchain.

By sending a unique transaction identifier from the receiving server to the transaction requested by the DApp and sending it to the queue server, it is queued, and by sequentially recording the queued transaction in a separate consumer server on the blockchain, scale out It provides a transaction processing method and system that can handle the high transaction throughput required by DApp even for impossible blockchains.

By returning the transaction identifier to the DApp, the DApp provides a transaction processing method and system that can inquire whether the final commit is made to the block in the blockchain for the corresponding transaction.

Receiving a transaction requested by a decentralized application; Generating a transaction identifier for the transaction; Transmitting a response including the generated transaction identifier to the D-App; And after the transaction to which the generated transaction identifier is assigned is stored in a queue included in the queue server, sequentially written to the blockchain by the consumer server, the transaction to which the generated transaction identifier is assigned is the It provides a transaction processing method comprising the step of transmitting to the queue server.

In combination with a computer device, a computer program stored in a computer readable recording medium is provided to execute a transaction processing method on the computer device.

Disclosed is a computer readable recording medium characterized in that a computer program for executing a transaction processing method is recorded on a computer device.

A computer device, comprising at least one processor implemented to execute instructions readable by a computer, by the at least one processor, receiving a transaction requested by a decentralized application, and obtaining a transaction identifier for the transaction. After generating, sending a response including the generated transaction identifier to the dApp, and after the transaction to which the generated transaction identifier is assigned is stored in a queue included in the queue server, sequentially by a consumer server It provides a computer device, characterized in that for transmitting to the queue server, the transaction to which the generated transaction identifier is assigned, so as to be recorded on the blockchain.

Receives a transaction requested by a decentralized application, generates a transaction identifier for the transaction, sends a response including the generated transaction identifier to the dApp, and transmits a transaction given the generated transaction identifier server; A queue server that receives and stores the generated transaction identifier in a queue; And it provides a transaction processing system including a consumer (consumer) server that sequentially records the transactions stored in the queue of the queue server on the blockchain.

The high transaction throughput required by the decentralized application (DApp) can be efficiently processed on the blockchain.

By receiving a unique transaction identifier from the receiving server to the transaction requested by the DApp, it is sent to the queue server for queuing, and the transaction queued in a separate consumer server is sequentially recorded on the blockchain, thereby scaling out (scale) Blockchain that cannot be out) can handle the high transaction throughput required by DApp.

By returning the transaction identifier to the DApp, the DApp can inquire whether the final commit is made to the block in the blockchain for the corresponding transaction.

1 is a diagram showing an example of a network environment according to an embodiment of the present invention.

2 is a block diagram showing an example of a computer device according to an embodiment of the present invention.

3 is a diagram illustrating a schematic example of a transaction processing system according to an embodiment of the present invention.

4 is a flowchart illustrating an example of a transaction processing method in an embodiment of the present invention.

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

A transaction processing system according to embodiments of the present invention may be implemented by at least one computer device to be described later. A computer program according to an embodiment of the present invention may be installed and driven in the computer device, and the computer device may perform a transaction processing method according to an embodiment of the present invention under control of the driven computer program. The above-described computer program may be stored in a computer-readable recording medium in combination with a computer device to execute a transaction processing method on the computer device.

1 is a diagram showing an example of a network environment according to an embodiment of the present invention. The network environment of FIG. 1 shows an example including a plurality of

electronic devices

110, 120, 130, 140, a plurality of

servers

150, 160, and a network 170. 1 is an example for explaining the invention, and the number of electronic devices or the number of servers is not limited as shown in FIG. 1. In addition, the network environment of FIG. 1 is merely an example of one of the environments applicable to the embodiments, and the environment applicable to the embodiments is not limited to the network environment of FIG. 1.

The plurality of

electronic devices

110, 120, 130, and 140 may be a fixed terminal or a mobile terminal implemented as a computer device. For example, a plurality of electronic devices (110, 120, 130, 140), smart phones (smart phone), mobile phones, navigation, computers, notebooks, digital broadcasting terminals, PDA (Personal Digital Assistants), PMP (Portable Multimedia Player) ), Tablet PC, etc. For example, although the shape of a smartphone is shown as an example of the electronic device 1 110 in FIG. 1, in the embodiments of the present invention, the electronic device 1 110 substantially uses the wireless or wired communication method to connect the network 170. It may mean one of various physical computer devices capable of communicating with other

electronic devices

120, 130, 140 and / or

servers

150, 160.

The communication method is not limited, and a communication method using a communication network (for example, a mobile communication network, a wired Internet, a wireless Internet, and a broadcasting network) that the network 170 may include may include short-range wireless communication between devices. For example, the network 170 includes a personal area network (PAN), a local area network (LAN), a campus area network (CAN), a metropolitan area network (MAN), a wide area network (WAN), and a broadband network (BBN). , Any one or more of the networks such as the Internet. Further, the network 170 may include any one or more of a network topology including a bus network, a star network, a ring network, a mesh network, a star-bus network, a tree, or a hierarchical network. It is not limited.

Each of the

servers

150 and 160 communicates with a plurality of

electronic devices

110, 120, 130, and 140 through a network 170 to provide commands, codes, files, contents, services, or the like, or a plurality of computers. It can be implemented with devices. For example, the server 150 is a service (for example, a video call service, a financial service, a payment service, a social network service) with a plurality of

electronic devices

110, 120, 130, and 140 accessed through the network 170. , Messaging service, search service, mail service, content provision service, question and answer service, etc.).

2 is a block diagram showing an example of a computer device according to an embodiment of the present invention. Each of the plurality of

electronic devices

110, 120, 130, 140 described above or each of the

servers

150, 160 may be implemented by the computer device 200 shown through FIG. 2, and an embodiment of the present invention The method according to the field may be performed by the computer device 200.

At this time, as shown in FIG. 2, the computer device 200 may include a memory 210, a processor 220, a communication interface 230, and an input / output interface 240. The memory 210 is a computer-readable recording medium, and may include a non-permanent mass storage device such as random access memory (RAM), read only memory (ROM), and a disk drive. Here, a non-destructive large-capacity recording device such as a ROM and a disk drive may be included in the computer device 200 as a separate permanent storage device separate from the memory 210. In addition, an operating system and at least one program code may be stored in the memory 210. These software components may be loaded into the memory 210 from a computer-readable recording medium separate from the memory 210. Such a separate computer-readable recording medium may include a computer-readable recording medium such as a floppy drive, disk, tape, DVD / CD-ROM drive, and memory card. In other embodiments, software components may be loaded into memory 210 through communication interface 230 rather than a computer-readable recording medium. For example, software components can be loaded into the memory 210 of the computer device 200 based on a computer program installed by files received over the network 170.

The processor 220 may be configured to process instructions of a computer program by performing basic arithmetic, logic, and input / output operations. Instructions may be provided to processor 220 by memory 210 or communication interface 230. For example, the processor 220 may be configured to execute a received command according to program code stored in a recording device such as the memory 210.

The communication interface 230 may provide a function for the computer device 200 to communicate with other devices (eg, the storage devices described above) through the network 170. For example, requests, commands, data, files, etc. generated by the processor 220 of the computer device 200 according to program codes stored in a recording device such as the memory 210 are controlled by the communication interface 230. 170) to other devices. Conversely, signals, commands, data, files, etc. from other devices may be received through the network 170 to the computer device 200 through the communication interface 230 of the computer device 200. Signals, commands, data, etc. received through the communication interface 230 may be transferred to the processor 220 or the memory 210, and files and the like may be further stored by the computer device 200 (described above) Permanent storage device).

The input / output interface 240 may be a means for interfacing with the input / output device 250. For example, the input device may include a device such as a microphone, keyboard, camera or mouse, and the output device may include a device such as a display or speaker. As another example, the input / output interface 240 may be a means for interfacing with a device in which functions for input and output are integrated into one, such as a touch screen. The input / output device 250 may be configured as a computer device 200 and a single device.

Further, in other embodiments, the computer device 200 may include fewer or more components than those in FIG. 2. However, there is no need to clearly show most prior art components. For example, the computer device 200 may be implemented to include at least some of the input / output devices 250 described above, or may further include other components such as a transceiver, a database, and the like.

3 is a diagram illustrating a schematic example of a transaction processing system according to an embodiment of the present invention. 3 illustrates a decentralized application (DApp) 310, a receiving server 320, a node 330, a queue server 340, and a consumer server 350. In this case, the receiving server 320, the node 330, the queue server 340, and the consumer server 350 may be implemented by the computer device 200 described above, respectively. Depending on the embodiment, at least two or more of the receiving server 320, the node 330, the queue server 340, and the consumer server 350 may be implemented to be included in one computer device 200.

The D-app 310 is an example of a decentralized application, and may be an application service that operates as a smart contract on a platform based on a blockchain. The dApp 310 may register (or record) data on the blockchain and call it. For example, the D-App 310 may attempt to register transaction data on the blockchain by passing a transaction (Tx) to the receiving server 320.

The receiving server 320 may receive a transaction from the D-App 310 and attempt to register with the blockchain. At this time, the d-app 310 may process the data (transactions) to be processed for a certain period or a certain amount at a time. In other words, a situation in which the receiving server 320 needs to receive and process a certain amount of transactions for a certain period of time from the DApp 310 at a time may occur. However, since the throughput per a certain period of time (eg, minutes or seconds) of the blockchain is limited, and the scale-out for increasing such throughput has a feature that is impossible, the receiving server 320 may block the blockchain. In the case of attempting to register transactions exceeding the throughput all at once, there is a problem in that registration of all transactions fails from the moment when it exceeds the throughput of the blockchain.

In order to solve this problem, the receiving server 320 may transmit the transactions to the queue server 340 instead of transmitting them directly to the node 350 of the blockchain. To this end, the receiving server 320 may generate a transaction identifier (TxID) for each transaction requested by the DApp 310. For example, the receiving server 310 may generate a hash value for a transaction as a transaction identifier for the corresponding transaction. At this time, the receiving server 320 may respond to the request of the DApp 310 by sending a response including the transaction identifier to the DApp 310, and may transmit a transaction to which the transaction ID is assigned to the queue server 340. .

At this time, the receiving server 320 may generate a transaction identifier (sign (TxID)) signed with the private key by signing the transaction identifier with the private key of the user of the transaction, and the signed transaction identifier is granted It is also possible to send the transaction to the queue server 340. For example, the receiving server 320 may include an electronic wallet for at least one user. Such an electronic wallet may include information such as a user identifier in the user's D-App 310, a user's private key, and a public address for the blockchain. At this time, the receiving server 320 may sign the transaction identifier of a specific user using the private key of the user.

The queue server 340 may store the transaction transmitted from the receiving server 320 in the queue 341. In this case, the consumer server 350 sequentially records the transactions stored in the queue 341 of the queue server 340 (transactions each of which is given a unique transaction identifier (or signed transaction identifier)) to the blockchain. , Transactions can be transmitted to the node 350 of the blockchain. As such, since the DApp 310 is stored in the queue 341 of the queue server 340 for a certain period of time or a certain amount of transactions delivered at once, and is registered in the blockchain sequentially through the consumer server 350, the present The transaction processing system according to the embodiment can help to efficiently process the high transaction throughput required by the DApp 310 on the blockchain.

The node 350 may be one of nodes participating in the blockchain network. At this time, when receiving the transaction, the node 350 may be implemented to create a block for the received transaction through agreement between the nodes and add it to the blockchain. For example, in the blockchain network, when all of the nodes for consensus (or nodes above a predetermined ratio) agree, the node 350 creates a block for a transaction, and also creates a block for nodes for consensus. You can instruct them to do. In this case, a block can be created at each node and added to the blockchain stored by the nodes. The nodes for consensus may be all nodes of the blockchain network, but may be some nodes selected among all nodes of the blockchain network according to an embodiment.

4 is a flowchart illustrating an example of a transaction processing method in an embodiment of the present invention. The transaction processing method according to the present embodiment may be performed by the computer device 200 described above. For example, the processor 220 of the computer device 200 may be implemented to execute control instructions according to code of an operating system included in the memory 210 or code of at least one program. Here, the processor 220 is the computer device 200 to perform the steps (410 to 440) included in the method of Figure 4, the computer device 200 according to the control command provided by the code stored in the computer device 200 Can be controlled.

In step 410, the computer device 200 may receive the transaction requested by the D-App. As described above, the D-App may transmit data (transactions) to be processed in a predetermined period or a predetermined amount at a time, and the computer device 200 may receive a certain amount of transactions or a certain amount of transactions from the D-App at a time. At this time, since the throughput for a certain period of the blockchain is limited and cannot be scaled out, the computer device 200 is a subsequent step so that the blockchain can efficiently process the high transaction throughput required by the DApp on the blockchain. Fields 420 to 440 may be performed.

In step 420, the computer device 200 may generate a transaction identifier for the transaction. At this time, the computer device 200 may generate a hash value for the transaction as a transaction identifier. For example, the contents of the transaction may be an input parameter of a predetermined hash function, and a hash value that is an output value of the hash function may be used as a transaction identifier.

In step 430, the computer device 200 may transmit a response including the generated transaction identifier to the DApp. At this time, the transaction identifier included in the response sent to the DApp may be used to inquire whether or not a final commit is made to the block for the transaction requested by the DApp in the blockchain.

In step 440, the computer device 200 generates a transaction with the generated transaction identifier, so that the transaction with the generated transaction identifier is stored in the queue included in the queue server, and then sequentially written to the blockchain by the consumer server. Can be sent to the queue server. According to an embodiment, the computer device 200 may store the user's user identifier and the user's private key in advance, and sign the generated transaction identifier with the user's private key to generate a signed transaction identifier. In this case, the computer device 200 may transmit the transaction identifier signed with the user's private key in step 440 to the queue server along with the transaction.

At this time, the queue server may be implemented to sequentially store the received transactions in a queue, and the consumer server is implemented to transmit the transaction to one of the first nodes of the blockchain network so that the transactions stored in the queue are sequentially recorded on the blockchain. Can be. At this time, each of the first nodes of the blockchain network may be implemented to create a block for a transaction received from the consumer server through an agreement between the first nodes and add it to the blockchain. As such, rather than directly requesting the high transaction throughput required by the DApp to the blockchain at once, the blockchain is efficiently processed by storing transactions in the queue included by the queue server and sequentially processing them through the consumer server. Can help you do it.

As described above, according to embodiments of the present invention, a high transaction throughput required by a decentralized application (DApp) can be efficiently processed in a blockchain. By receiving a unique transaction identifier from the receiving server to the transaction requested by the DApp, it is sent to the queue server for queuing, and the transaction queued in a separate consumer server is sequentially recorded on the blockchain, thereby scaling out (scale) Blockchain that cannot be out) can handle the high transaction throughput required by DApp. By returning the transaction identifier to the DApp, the DApp can inquire whether the final commit is made to the block in the blockchain for the corresponding transaction.

The system or device described above may be implemented as a hardware component, a software component, or a combination of hardware components and software components. For example, the devices and components described in the embodiments include, for example, processors, controllers, arithmetic logic units (ALUs), digital signal processors (micro signal processors), microcomputers, field programmable gate arrays (FPGAs). , A programmable logic unit (PLU), microprocessor, or any other device capable of executing and responding to instructions, may be implemented using one or more general purpose computers or special purpose computers. The processing device may perform an operating system (OS) and one or more software applications running on the operating system. In addition, the processing device may access, store, manipulate, process, and generate data in response to execution of the software. For convenience of understanding, a processing device may be described as one being used, but a person having ordinary skill in the art, the processing device may include a plurality of processing elements and / or a plurality of types of processing elements. It can be seen that may include. For example, the processing device may include a plurality of processors or a processor and a controller. In addition, other processing configurations, such as parallel processors, are possible.

The software may include a computer program, code, instruction, or a combination of one or more of these, and configure the processing device to operate as desired, or process independently or collectively You can command the device. Software and / or data may be interpreted by a processing device, or to provide instructions or data to a processing device, of any type of machine, component, physical device, virtual equipment, computer storage medium or device. Can be embodied in The software may be distributed over networked computer systems, and stored or executed in a distributed manner. Software and data may be stored on one or more computer-readable recording media.

The method according to the embodiment may be implemented in the form of program instructions that can be executed through various computer means and recorded on a computer-readable medium. The computer-readable medium may include program instructions, data files, data structures, or the like alone or in combination. The program instructions recorded on the medium may be specially designed and configured for the embodiments or may be known and usable by those skilled in computer software. Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks and magnetic tapes, optical media such as CD-ROMs, DVDs, and magnetic media such as floptical disks. -Hardware devices specifically configured to store and execute program instructions such as magneto-optical media, and ROM, RAM, flash memory, and the like. Such a recording medium may be various recording means or storage means in the form of a combination of single or several hardware, and is not limited to a medium directly connected to a computer system, but may be distributed on a network. Examples of program instructions include high-level language codes that can be executed by a computer using an interpreter, etc., as well as machine language codes produced by a compiler.

As described above, although the embodiments have been described by a limited embodiment and drawings, those skilled in the art can make various modifications and variations from the above description. For example, the described techniques are performed in a different order than the described method, and / or the components of the described system, structure, device, circuit, etc. are combined or combined in a different form from the described method, or other components Alternatively, even if replaced or substituted by equivalents, appropriate results can be achieved.

Therefore, other implementations, other embodiments, and equivalents to the claims are also within the scope of the following claims.

Claims

Receiving a transaction requested by a decentralized application;

Generating a transaction identifier for the transaction;

Transmitting a response including the generated transaction identifier to the D-App; And

After the transaction to which the generated transaction identifier is assigned is stored in the queue included in the queue server, the transaction to which the generated transaction identifier is assigned is queued so that the transaction is sequentially recorded on the blockchain by the consumer server. Steps to send to the server

Transaction processing method comprising a.
According to claim 1,

Generating a transaction identifier for the transaction,

A transaction processing method characterized by generating a hash value for the transaction as a transaction identifier.
According to claim 1,

Storing the user's user identifier and the user's private key; And

Signing the generated transaction identifier with the user's private key

Further comprising,

The step of transmitting the generated transaction identifier-granted transaction to the queue server is:

Sending a transaction identifier signed with the user's private key to the queue server along with the transaction

Transaction processing method characterized in that.
According to claim 1,

The queue server is implemented to sequentially store the received transactions in the queue,

The consumer server is implemented to transmit the transaction to one of the first nodes of the blockchain network so that the transactions stored in the queue are sequentially recorded on the blockchain.

Transaction processing method characterized in that.
The method of claim 4,

Each of the first nodes of the blockchain network is implemented to create a block for a transaction received from the consumer server through an agreement between the first nodes and add it to the blockchain.

Transaction processing method characterized in that.
According to claim 1,

Transaction processing method characterized in that whether the final commit (commit) is made to the block for the transaction requested by the DApp in the blockchain through the transaction identifier included in the response sent to the DApp.
A computer program stored in a computer-readable recording medium in combination with a computer device for executing the method of any one of claims 1 to 6 in a computer device.
A computer readable recording medium characterized in that a computer program for executing the method of any one of claims 1 to 6 is recorded on a computer device.
In the computer device,

At least one processor implemented to execute computer readable instructions

Including,

By the at least one processor,

Decentralized Application receives the requested transaction,

Create a transaction identifier for the transaction,

Send a response including the generated transaction identifier to the D-app,

After the transaction to which the generated transaction identifier is assigned is stored in the queue included in the queue server, the transaction to which the generated transaction identifier is assigned is queued so that the transaction is sequentially recorded on the blockchain by the consumer server. Send to server

Computer device characterized in that.
The method of claim 9,

By the at least one processor,

Generating a hash value for the transaction as a transaction identifier

Computer device characterized in that.
The method of claim 9,

By the at least one processor,

Stores the user's user identifier and the user's private key,

Sign the generated transaction identifier with the user's private key,

Sending a transaction identifier signed with the user's private key to the queue server along with the transaction

Computer device characterized in that.
The method of claim 9,

The queue server is implemented to sequentially store the received transactions in the queue,

The consumer server is implemented to transmit the transaction to one of the first nodes of the blockchain network so that the transactions stored in the queue are sequentially recorded on the blockchain.

Computer device characterized in that.
The method of claim 12,

Each of the first nodes of the blockchain network is implemented to create a block for a transaction received from the consumer server through an agreement between the first nodes and add it to the blockchain.

Computer device characterized in that.
The method of claim 9,

Whether or not a final commit is made to the block for the transaction requested by the D-App in the blockchain is searched through the transaction identifier included in the response sent to the D-App.

Computer device characterized in that.
Receives a transaction requested by a decentralized application, generates a transaction identifier for the transaction, sends a response including the generated transaction identifier to the dApp, and transmits a transaction given the generated transaction identifier server;

A queue server that receives and stores the generated transaction identifier in a queue; And

A consumer server that sequentially records the transactions stored in the queue of the queue server on the blockchain

Transaction processing system comprising a.
The method of claim 15,

The consumer server transmits the transaction to one of the first nodes of the blockchain network so that the transactions stored in the queue of the queue server are sequentially recorded on the blockchain,

Each of the first nodes of the blockchain network is implemented to create a block for a transaction received from the consumer server through an agreement between the first nodes and add it to the blockchain.

Transaction processing system, characterized by.