Electronic device, method, and non-transitory computer-readable storage medium for determining consensus participating node among ledger nodes in network for blockchain

Abstract

This electronic device may comprise: a memory for storing instructions; a communication circuit; and at least one processor. The instructions, when executed by the at least one processor, may cause the electronic device to: determine to connect a first block for a transaction to a second block in nodes storing a ledger; request the nodes to connect the first block to the second block; determine, according to an average hash value calculation time of each of the nodes, a first node and a second node as nodes for verifying validity; transmit a request to transmit a first hash value and a request to transmit a second hash value; receive information on the first hash value from the first node and information on the second hash value from the second node; and transmit, to the nodes, a signal indicating that the connection of the first block is maintained, on the basis of the second hash value equal to the first hash value.

Description

Electronic device, method, and non-transitory computer-readable storage medium for determining consensus participating nodes among ledger nodes within a network for blockchain

[0001] The present disclosure relates to an electronic device, a method, and a non-transitory computer-readable storage medium for determining a consensus participating node among ledger nodes within a network for a blockchain.

[0002] Blockchain is a distributed data storage technology that links blocks containing data into a chain, replicates them across numerous computers, and stores these blocks simultaneously. Blockchain is stored in a distributed data storage environment, making it impossible to arbitrarily modify it and allowing anyone to view the results of any changes.

[0003] The above information may be provided as background art to aid in understanding the present disclosure.

[0004] No claim or determination is made as to whether any of the above is applicable as prior art to the present disclosure.

[0005] An electronic device is described. The electronic device may include a memory storing instructions and including one or more storage media. The electronic device may include communication circuitry. The electronic device may include at least one processor including a processing circuit. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to determine to link a first block for a transaction to at least one second block within each of nodes storing a ledger. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to, based on the determination, request each of the nodes to link the first block to the at least one second block, and, based on an average hash value calculation time of each of the nodes, determine a first node and a second node among the nodes as nodes for verifying the validity of the transaction. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit, using the communication circuitry, a request to the first node to transmit a first hash value obtained by connecting the first block within the first node to the at least one second block. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit, using the communication circuitry, a request to the second node to transmit a second hash value obtained by connecting the first block within the second node to the at least one second block.The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to receive, using the communication circuitry, information about the first hash value from the first node. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to receive, using the communication circuitry, information about the second hash value from the second node. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit, using the communication circuitry, a signal to each of the nodes indicating that the at least one second block is maintained connected to the first block based on the second hash value being the same as the first hash value.

[0006] A method is provided. The method can be executed in an electronic device having a communication circuit. The method can include an operation of determining to link a first block for a transaction to at least one second block within each of nodes storing a ledger. The method can include an operation of requesting each of the nodes to link the first block to the at least one second block based on the determination, and determining a first node and a second node among the nodes as nodes for verifying the validity of the transaction based on an average hash value calculation time of each of the nodes. The method can include an operation of transmitting, using the communication circuit, a request to the first node to transmit a first hash value obtained by linking the first block within the first node to the at least one second block. The method can include an operation of transmitting, using the communication circuit, a request to the second node to transmit a second hash value obtained by linking the first block within the second node to the at least one second block. The method may include receiving information about the first hash value from the first node using the communication circuit. The method may include receiving information about the second hash value from the second node using the communication circuit. The method may include transmitting a signal, using the communication circuit, to each of the nodes, indicating that the first block is maintained connected to the at least one second block, based on the second hash value being the same as the first hash value.

[0007] A non-transitory computer-readable storage medium is provided. The non-transitory computer-readable storage medium may store one or more programs. The one or more programs may include instructions that, when executed by an electronic device having a communication circuit, cause the electronic device to determine to link a first block for a transaction to at least one second block within each of nodes storing a ledger. The one or more programs may include instructions that, when executed by the electronic device, cause the electronic device to request each of the nodes to link the first block to the at least one second block based on the determination, and to determine a first node and a second node among the nodes as nodes for verifying the validity of the transaction based on an average hash value calculation time of each of the nodes. The one or more programs may include instructions that, when executed by the electronic device, cause the electronic device to transmit, using the communication circuit, a request to the first node to transmit a first hash value obtained by connecting the first block within the first node to the at least one second block. The one or more programs may include instructions that, when executed by the electronic device, cause the electronic device to transmit, using the communication circuit, a request to the second node to transmit a second hash value obtained by connecting the first block within the second node to the at least one second block. The one or more programs may include instructions that, when executed by the electronic device, cause the electronic device to receive, using the communication circuit, information about the first hash value from the first node.The one or more programs may include instructions that, when executed by the electronic device, cause the electronic device to receive, using the communication circuit, information about the second hash value from the second node. The one or more programs may include instructions that, when executed by the electronic device, cause the electronic device to transmit, using the communication circuit, a signal to each of the nodes indicating that the first block is maintained connected to the at least one second block based on the second hash value being the same as the first hash value.

[0008] Figure 1 illustrates an example of how blocks are added within each node within a network for a blockchain.

[0009] Figures 2a and 2b illustrate examples of receiving information about hash values ​​from each of the nodes determined to verify the validity of a transaction.

[0010] Figure 3 is a simplified block diagram of an exemplary electronic device.

[0011] Figure 4 illustrates an example of a TQ (transaction queue) node, an electronic device, and operations executed within the nodes.

[0012] Figure 5 illustrates an example of determining the reputation of each node.

[0013] Figure 6 illustrates an example of determining the participation level of each node.

[0014] Figure 7 illustrates an example of determining which nodes to verify a transaction type based on the share of coins held by each node.

[0015] FIG. 8 is a flowchart illustrating exemplary operations performed within an electronic device to further verify the validity of a transaction based on a second hash value that is different from the first hash value.

[0016] Figure 9 illustrates an example of discarding the first block.

[0017] Figure 10 illustrates an example of verifying the validity of a transaction according to practical byzantine fault tolerance.

[0018] Figure 1 illustrates an example of how blocks are added within each node within a network for a blockchain.

[0019] Referring to FIG. 1, the first node (110-1) to the Nth node (110-N) (N is a natural number greater than or equal to 3) may represent devices usable for the blockchain. For example, the first node (110-1) to the Nth node (110-N) may each store a first block (100). The first block (100) may include information about a transaction. For example, the first node (110-1) to the Nth node (110-N) may each obtain and provide a hash value by connecting the first block (100) to a block (e.g., which may be described as an existing block) stored within the first node (110-1) to the Nth node (110-N) before the first block (100). For example, the first node (110-1) may obtain and provide a first hash value (111-1). For example, a second node (110-2) can obtain and provide a second hash value (111-2). For example, an Nth node (110-N) can obtain and provide an Nth hash value (111-N).

[0020] The first node (110-1) to the Nth node (110-N) can transmit hash values ​​to other nodes to verify the validity of the first block (100) (or a transaction related to the first block (100)). For example, the first node (110-1) can transmit the first hash value (111-1) to each of the second node (110-2) to the Nth node (110-N). For example, the second node (110-2) can transmit the second hash value (111-2) to each of the first node (110-1) and the third node (110-3) (not shown) to the Nth node (110-N). For example, the Nth node (110-N) may transmit the Nth hash value (111-N) to each of the first node (110-1) to the Nth node (110-(N-1)) (not shown). As a non-limiting example, since such transmission includes each of the first node (110-1) to the Nth node (110-N) transmitting hash values ​​to nodes other than itself, the time consumed to verify the validity of a transaction associated with the first block (100) may increase as the number of the first node (110-1) to the Nth node (110-N) increases. For example, the increase in time may reduce the quality of service provided by the network for the blockchain including the first node (110-1) to the Nth node (110-N). As a non-limiting example, the increase in time may prevent the network for the blockchain from providing services in real time. For example, the increase in the above time may hinder the provision of services for games using the network for blockchain.

[0021] The descriptions below may provide methods for reducing the above time. As a non-limiting example, the methods may be implemented within a network for a blockchain used for gaming services.

[0022] Figures 2a and 2b illustrate examples of receiving information about hash values ​​from each of the nodes determined to verify the validity of a transaction.

[0023] Referring to FIGS. 2A and 2B , the electronic device (200) may represent a device available for verifying the validity of a block for a transaction. The electronic device (200) may represent a device available for determining which nodes among the first node (210-1) to the Nth node (210-N), which are ledger nodes within a network for a blockchain, will be used for verifying the validity of the block. For example, the electronic device (200) may be described as a brain node.

[0024] For example, the server (280) may be described as a server for executing a game. For example, the server (280) may be a server for executing a game software application using a blockchain. The server (280) may transmit a transaction occurring in the game software application to the platform node (290). For example, the platform node (290) may transmit the transaction to the TQ (transaction queue) node (400). For example, the platform node (290) may transmit the transaction to the TQ node (400) via a socket. For example, the first block (100) may be provided from the transaction queue (TQ) node (400) to each of the first node (210-1), the second node (210-2), the third node (210-3) to the N-1-th node (210-(N-1)), and the N-th node (210-N) based on the electronic device (200) determining to connect the first block (100) to at least one second block. For example, the first block (100) may be connected to other blocks within each of the nodes. For example, the first block (100) may be connected to at least one second block (222) within the first node (210-1).

[0025] For example, the electronic device (200) may determine some of the first node (210-1) to the Nth node (210-N) as nodes (e.g., consensus participating nodes) for verifying the validity of the first block (100) for the transaction. For example, the electronic device (200) may request each of the nodes that are some of the first node (210-1) to the Nth node (210-N) to transmit a hash value for the first block (100). For example, each of the nodes that are some of the first node (210-1) to the Nth node (210-N) may obtain a hash value for the first block (100) and transmit information about the obtained hash value to the electronic device (200). As a non-limiting example, the number of the nodes that are some of the first node (210-1) to the Nth node (210-N) may be 2. For example, the electronic device (200) may determine the first node (210-1) and the second node (210-2) as the nodes that are part of the first node (210-1) to the Nth node (210-N). For example, the first node (210-1) may transmit to the electronic device (200) information about the first hash value (211) obtained by connecting the first block (100) to at least one second block (222) within the first node (210-1). For example, the second node (210-2) may transmit to the electronic device (200) information about the second hash value (212) obtained by connecting the first block (100) to at least one second block (not shown) within the second node (210-2). Referring to FIG. 2B, it is illustrated that the first node (210-1) and the second node (210-2) are determined as nodes for verifying the validity of the first block (100) for a transaction, but the present disclosure is not limited thereto. For example, the number of nodes for verifying the validity of the first block (100) for a transaction may be f (where f is a natural number greater than or equal to 2 and a natural number less than or equal to N). For example, f may include 3.For example, f can contain 5.

[0026] For example, the electronic device (200) can verify the validity of the first block (100) based on whether the first hash value (211) and the second hash value (212) are the same. For example, a network for a blockchain, including the electronic device (200) and the first node (210-1) to the Nth node (210-N), can reduce the time consumed for verifying the validity of a transaction related to the first block (100) through operations of the electronic device (200) that determine some of the first node (210-1) to the Nth node (210-N) as nodes for verifying the validity of a transaction related to the first block (100). For example, the electronic device (200) can include hardware components used to perform or execute the above operations. The hardware components are described and exemplified with reference to FIG. 3.

[0027] Figure 3 is a simplified block diagram of an exemplary electronic device.

[0028] Referring to FIG. 3, the electronic device (200) may include at least one processor (307), a communication circuit (305), and a memory (306).

[0029] At least one processor (307) may include a hardware component for processing data using instructions stored in the memory (306). The hardware component for processing data may include a central processing unit (CPU) (e.g., including processing circuitry). The hardware component for processing data may include a neural processing unit (NPU) (e.g., including processing circuitry).

[0030] At least one processor (307) may include one or more cores. For example, at least one processor (307) may have a multi-core processor structure such as a dual core, a quad core, or a hexa core.

[0031] The memory (306) may include hardware components for storing data and / or instructions input to and / or output from at least one processor (307). The memory (306) may include, for example, volatile memory such as random-access memory (RAM) and / or non-volatile memory such as read-only memory (ROM). The volatile memory may include, for example, at least one of dynamic RAM (DRAM), static RAM (SRAM), cache RAM, and pseudo SRAM (PSRAM). The non-volatile memory may include, for example, at least one of programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM), flash memory, hard disk, compact disc, and embedded multimedia card (EMMC).

[0032] The communication circuit (305) may include hardware components for supporting transmission and / or reception of signals between the electronic device (200) and an external electronic device. The communication circuit (305) may include, for example, at least one of a modem, an antenna, and an optical / electronic (O / E) converter. The communication circuit (305) may support transmission and / or reception of signals based on various types of protocols, such as Ethernet, a local area network (LAN), a wide area network (WAN), wireless fidelity (WiFi), Bluetooth, Bluetooth low energy (BLE), zigbee, long term evolution (LTE), and 5G new radio (NR).

[0033] Figure 4 illustrates an example of a TQ (transaction queue) node, an electronic device, and operations executed within the nodes.

[0034] Referring to FIG. 4, a network for a blockchain may include a TQ node (400), an electronic device (200), and a first node (210-1) to an Nth node (210-N). Although not illustrated in FIG. 4, the network may further include a platform node (290). For example, the platform node (290) may be a device available for linking the network with an external electronic device (e.g., a game-related server) outside the network. For example, the platform node (290) may transmit a transaction (e.g., corresponding to the first block (100) exemplified below) to the TQ node (400).

[0035] The electronic device (200), at operation 405, may determine to link the first block (100) for the transaction to at least one second block within each of the first node (210-1) to the Nth node (210-N). As a non-limiting example, the electronic device (200) may determine to link the first block (100) to at least one second block based on identifying that the number of transactions sequentially arranged within the TQ node (400) exceeds a reference number.

[0036] The electronic device (200) may, at operation 410, transmit a signal to provide a block for the transaction to each of the nodes storing the ledger, using the communication circuit (305). For example, the electronic device (200) may transmit a signal to provide (or distribute) the first block (100) for the transaction to each of the first node (210-1) to the Nth node (210-N), using the communication circuit (305). For example, the TQ node (400) may receive a signal to provide the first block (100) for the transaction to each of the first node (210-1) to the Nth node (210-N).

[0037] For example, the TQ node (400) may sequentially sort transactions and provide (or distribute) a block for one of the sequentially sorted transactions to each of the nodes (e.g., the first node (210-1) to the Nth node (210-N)) that store the ledger. For example, the TQ node (400) may, in operation 420, provide (or distribute) a first block (100) for one of the sequentially sorted transactions within the TQ node (400) to each of the first node (210-1) to the Nth node (210-N).

[0038] The electronic device (200) may, at operation 430, request each of the nodes to connect the first block to at least one second block. For example, each of the first node (210-1) to the Nth node (210-N) may receive the request from the electronic device (200) and, based on (or in response to) the request, connect the first block (100) to (or to) the at least one second block.

[0039] For example, in operation 431, the first node (210-1) may connect the first block (100) with at least one second block that was previously connected to the first block (100). For example, the second node (210-2) may connect the first block (100) with at least one second block, in operation 432. For example, the N-1 node (210-(N-1)) may connect the first block (100) with at least one second block, in operation 434. For example, the N-th node (210-N) may connect the first block (100) with at least one second block, in operation 435.

[0040] The electronic device (200), at operation 440, may determine some of the nodes including the first node (210-1) to the Nth node (210-N) as nodes for verifying the validity of the transaction based on the decision performed at operation 405 and / or the request performed at operation 430. For example, the number of nodes for verifying the validity of the transaction may be f (where f is a natural number greater than or equal to 2 and a natural number less than or equal to N). For example, the number of nodes for verifying the validity of the transaction may be 2. For example, the number of nodes for verifying the validity of the transaction may be 5. For example, the electronic device (200), based on the average hash value calculation time of each of the nodes, may determine the first node (210-1) and the second node (210-2) among the nodes as nodes for verifying the validity of the transaction. The average hash value calculation time may represent the time consumed within each of the nodes prior to the transaction to transmit information about the hash value in relation to the linking of one block to the electronic device (200). For example, the average hash value calculation time may be determined as a value within a range between 0 and 1, depending on the time consumed within each of the nodes to obtain a hash value by linking a block for a transaction to at least one other block and to transmit information about the hash value to the electronic device (200). As a non-limiting example, the average hash value calculation time may be determined as 1 when the time is less than 0.5 seconds, 0.9 when the time is greater than or equal to 0.5 seconds and less than 1 second, 0.7 when the time is greater than or equal to 1.5 seconds and less than 1.5 seconds, and 0.5 when the time is greater than or equal to 1.5 seconds and less than 2 seconds.

[0041] For example, other parameters distinct from the average hash value calculation time may be utilized by the electronic device (200) for operation 440. For example, the electronic device (200) may determine, among the nodes, a first node (210-1) and a second node (210-2) as nodes for verifying the validity of the transaction, based on the reputation of each of the nodes, the participation of each of the nodes, and / or the stake of each of the nodes. For example, the electronic device (200) may determine, among the nodes, a first node (210-1) and a second node (210-2) as nodes for verifying the validity of the transaction, based on the average hash value calculation time, the reputation, the participation, and / or the stake.

[0042] For example, the electronic device (200) may determine, among the nodes, a first node (210-1) and a second node (210-2) as nodes for verifying the validity of the transaction, based on the average hash value calculation time and the reputation. For example, the electronic device (200) may determine, among the nodes, a first node (210-1) and a second node (210-2) as nodes for verifying the validity of the transaction, based on the average hash value calculation time and the participation. For example, the electronic device (200) may determine, among the nodes, a first node (210-1) and a second node (210-2) as nodes for verifying the validity of the transaction, based on the average hash value calculation time and the stake. These operations are described and exemplified in more detail with reference to FIGS. 5 to 7.

[0043] Figure 5 illustrates an example of determining the reputation of each node.

[0044] Figure 6 illustrates an example of determining the participation level of each node.

[0045] Figure 7 illustrates an example of determining which nodes to verify a transaction type based on the share of coins held by each node.

[0046] Referring to FIG. 5, the electronic device (200) may determine the first node and the second node among the nodes as nodes for verifying the validity of the transaction based on the reputation of each of the nodes, which is determined based on whether each of the hash values ​​received (or obtained) from each of the nodes was true or false, and the average hash value calculation time of each of the nodes. For example, if a node (500) representing one (or any one) of the nodes provides (or obtains) a hash value a different from the agreed-upon hash value b based on the verification of the validity of another transaction prior to the transaction related to the first block (100) illustrated in FIG. 4, the reputation of the node (500) may be decreased. As a non-limiting example, the reputation may be determined as a value within the range of 0 and 1. For example, since the hash value a provided from the node (500) is false, the reputation of the node (500) may be determined to be 0. For example, the reputation may increase over time. For example, the reputation may increase at a rate of 1 / 86400 per second within the above range.

[0047] For example, the electronic device (200) may transmit a signal indicating that the block associated with the other transaction is to be discarded to the node (500) that provided a hash value different from the hash value b, as in operation 510. For example, the node (500) may discard the block associated with the other transaction based on the signal. For example, since the reputation of the node (500) is 0, the node (500) may not be determined as a node for verifying the validity of the transaction associated with the first block (100), unlike the first node (210-1) and the second node (210-2).

[0048] Referring to FIG. 6, the electronic device (200) may determine the first node and the second node among the nodes as nodes for verifying the validity of the transaction based on the participation of each of the nodes, which indicates the number of times each of the nodes has been used in relation to at least one block (e.g., including the at least one second block) prior to the first block (100), and the average hash value calculation time of each of the nodes. For example, if the number of times that a node (600) representing one (or any one) of the nodes has been used to verify the validity of a block is 5, and the number of times that a node (610) representing another of the nodes has been used to verify the validity of a block is 10, the electronic device (200) may determine the participation of the node (600) to be a lower value than the participation of the node (610). As a non-limiting example, the participation may be determined to be a value within a range between 0 and 1. For example, the participation of a node (e.g., node (600) or node (610)) may be determined as the number of times the node has been used to verify the validity of a block divided by 86400. For example, the participation of node (600) may be 5 / 86400 and the participation of node (610) may be 10 / 86400.

[0049] Referring to FIG. 7, the electronic device (200) may determine the first node (210-1) and the second node (210-2) among the nodes as nodes for verifying the validity of the transaction, based on the coin shares each node holds and the average hash value calculation time. As a non-limiting example, the shares may be determined as a value within the range of 0 and 1. For example, if the coin holding share of node (700) is 15% and the coin holding share of node (710) is 30%, the electronic device (200) may determine the share of node (700) as 0.15 and the share of node (710) as 0.30.

[0050] Referring back to FIG. 4, if the average hash value calculation time of each of the nodes, the reputation, the participation, and the stake are all used to determine nodes for verifying the validity of the transaction, the electronic device (200) may calculate a contribution score of each of the nodes by multiplying the average hash value calculation time of each of the nodes, the reputation of each of the nodes, the participation of each of the nodes, and the stake of each of the nodes, and determine the nodes for verifying the validity of the transaction based on the calculated contribution score of each of the nodes. As a non-limiting example, the electronic device (200) may obtain a total contribution score by adding the contribution scores of the nodes. For example, the electronic device (200) may obtain a contribution coefficient by dividing the contribution score of each of the nodes by the total contribution score. For example, the electronic device (200) can obtain the round score of each of the nodes within the first round to verify the validity of the transaction by multiplying the contribution coefficient by a predetermined value (e.g., a base score).

[0051] For example, the electronic device (200) can obtain a deduction score by dividing the predetermined value by the number of nodes (e.g., the first node (210-1) and the second node (210-2)) used to verify the validity of another transaction (e.g., a transaction prior to the transaction) in a second round prior to the first round. For example, if the number of nodes used to verify the validity of another transaction in the second round is 2 and the predetermined value is 100, the deduction score can be 50, which is 100 divided by 2. The electronic device (200) can obtain the first value of each of the nodes by adding up the round scores of each of the nodes calculated in rounds prior to the first round (e.g., including the second round) and the round scores of each of the nodes within the first round. The electronic device (200) may obtain the second value of each node in the first round by subtracting the deduction score of each round from the first value of each node based on whether each node was determined as a node for verifying the validity of a transaction (e.g., including the other transaction) prior to the transaction in rounds prior to the first round. For example, the electronic device (200) may determine nodes for verifying the validity of the transaction among the nodes based on the second value of each node.

[0052] The electronic device (200) may, at operation 451, transmit a request to transmit a first hash value obtained by connecting the first block (100) to the at least one second block within the first node (210-1) to the first node (210-1), which is determined as a node for verifying the validity of the transaction among the nodes at operation 440, using the communication circuit (305). The electronic device (200), at operation 452, may transmit a request to transmit a first hash value obtained by connecting the first block (100) to the at least one second block within the second node (210-2), which is determined as a node for verifying the validity of the transaction among the nodes at operation 440, using the communication circuit (305). For example, a first node (210-1) may receive a request from an electronic device (200) to transmit a first hash value obtained by connecting a first block (100) to at least one second block. For example, a second node (210-2) may receive a request from an electronic device (200) to transmit a second hash value obtained by connecting a first block (100) to at least one second block.

[0053] The first node (210-1) may transmit, at operation 461, information about a first hash value obtained by connecting the first block (100) to at least one second block to the electronic device (200). The second node (210-2) may transmit, at operation 462, information about a second hash value obtained by connecting the first block (100) to at least one second block to the electronic device (200). For example, the electronic device (200) may receive information about the first hash value from the first node (210-1) using the communication circuit (305). For example, the electronic device (200) may receive information about the second hash value from the second node (210-2) using the communication circuit (305).

[0054] The electronic device (200) can identify whether the first hash value and the second hash value are the same in operation 470. For example, the electronic device (200) can perform (or execute) operation 480 under the condition that the first hash value and the second hash value are the same. For example, the electronic device (200) can perform (or execute) operation 490 under the condition that the first hash value and the second hash value are different from each other.

[0055] For example, the electronic device (200) may, at operation 480, transmit a signal, using the communication circuit, to each of the nodes including the first node (210-1) to the Nth node (210-N), indicating that the first block (100) is maintained to be connected to at least one second block, based on the second hash value being the same as the first hash value. For example, the signal may include information to commit the first block (100) to the blockchain. For example, each of the nodes including the first node (210-1) to the Nth node (210-N) may receive a signal indicating that the first block (100) is maintained to be connected.

[0056] The electronic device (200) may, at operation 490, determine to further verify the validity of the transaction if the first hash value and the second hash value are different. This operation is described and illustrated in more detail with reference to FIG. 8.

[0057] FIG. 8 is a flowchart illustrating exemplary operations performed within an electronic device to further verify the validity of a transaction based on a second hash value that is different from the first hash value.

[0058] Referring to FIG. 8, the electronic device (200) may, at operation 800, determine to further verify the validity of the transaction. For example, the electronic device (200) may determine to perform a secondary verification of the transaction. For example, the electronic device (200) may determine to initiate secondary verification to further verify the validity of the transaction. For example, secondary verification may be referred to as further verifying the validity of the transaction. Operation 800 may correspond to operation 490.

[0059] In operation 810, the electronic device (200) may determine nodes for secondary verification among the remaining nodes. For example, if the number of nodes for verifying the validity of a transaction in the first verification is f, the number of nodes for secondary verification may be 2f+1. For example, if f is 2, the number of nodes for secondary verification may be 5. For example, the total number of nodes for verifying a transaction may be 3f+1. However, the present invention is not limited thereto. The electronic device (200) may determine a third node among the remaining nodes as a node for further verifying the validity of a transaction, based on the average hash value calculation time of each of the remaining nodes, excluding the first node (210-1) and the second node (210-2), based on the second hash value that is different from the first hash value. For example, the electronic device (200) may further utilize the reputation of each of the remaining nodes to determine the third node. For example, the electronic device (200) may further utilize the participation of each of the remaining nodes to determine the third node. For example, the electronic device (200) may further utilize the stake of each of the remaining nodes to determine the third node.

[0060] In operation 820, the electronic device (200) may transmit a signal including a request to each node for secondary verification to transmit information about a hash value through the communication circuit (305). However, the present invention is not limited thereto. The electronic device may transmit a request to the third node to transmit a third hash value obtained by connecting the first block (100) to the at least one second block within the third node using the communication circuit (305). For example, the third node may receive the request to transmit the third hash value from the electronic device (200). For example, the third node may transmit information about the third hash value to the electronic device (200) based on the request.

[0061] In operation 830, the electronic device (200) may receive information about a hash value from each of the nodes for secondary verification via the communication circuit (305). However, this is not limited thereto. Information about a third hash value may be received from the third node using the communication circuit (305).

[0062] In operation 840, the electronic device (200) can identify whether 2f+1 or more hash values ​​among the hash values ​​received from each of the nodes for secondary verification are the same. The electronic device (200) can execute operation 845 under the condition that 2f+1 or more hash values ​​among the hash values ​​are the same, and can execute operation 860 under the condition that 2f+1 or more hash values ​​among the hash values ​​are not the same. For example, the electronic device (200) can execute operation 845 under the condition that the hash values ​​of 2f+1 or more nodes among the total participating nodes are the same, and can execute operation 860 under the condition that the hash values ​​of 2f+1 or more nodes among the total participating nodes are not the same. For example, the total participating nodes (e.g., the first node (210-1) to the Nth node (210-N)) can be referenced as nodes that store the ledger. However, this is not limited thereto. For example, the electronic device (200) can identify whether the first hash value is identical to the third hash value. The electronic device (200) can execute operation 845 under the condition that the first hash value and the third hash value are identical, and can execute operation 860 under the condition that the first hash value and the third hash value are different from each other.

[0063] In operation 845, the electronic device (200) may transmit, using the communication circuit (305), a signal including a true hash value to each of the nodes including the first node (210-1) to the Nth node (210-N) based on the fact that at least 2f+1 of the 3f+1 hash values ​​are identical, to indicate that the connection of the first block to the at least one second block is maintained. For example, if at least 2f+1 of the 3f+1 hash values ​​are identical, the true hash value may be described as the identical 2f+1 or more hash values. For example, based on the fact that at least 2f+1 of the 3f+1 hash values ​​are identical, the electronic device (200) may perform operation 845. As a non-limiting example, the signal transmitted in operation 845 may include information to commit the first block (100) to the blockchain.

[0064] The electronic device (200) may, in operation 860, transmit another signal, through the communication circuit (305), to each of the nodes including the first node (210-1) to the Nth node (210-N), indicating that the first block (100) connected to the at least one second block is discarded, based on the fact that 2f+1 or more hash values ​​among the 3f+1 hash values ​​are not identical.

[0065] The electronic device (200) can identify whether the second hash value is identical to the third hash value. Based on the third hash value being identical to the second hash value, the electronic device (200) can transmit a signal including the first hash value to each of the nodes, including the first node (210-1) to the Nth node (210-N), using the communication circuit (305) to indicate that the first block is maintained to be connected to the at least one second block. For example, the signal can include information to commit the first block (100) to the blockchain.

[0066] For example, the electronic device (200) may determine, in operation 810, the sixth node together with the third node as nodes for further verifying the validity of the transaction. For example, the remaining nodes excluding the first node (210-1) and the second node (210-2) among the first node (210-1) to the Nth node (210-N) may be described as fourth nodes. For example, the remaining nodes excluding the third node among the fourth nodes may be described as fifth nodes. For example, the electronic device (200) may determine, in operation 810, the third node and the sixth node among the fourth nodes as nodes for further verifying the validity of the transaction, or, under the condition that the third hash value is different from the first hash value and the second hash value, determine the sixth node among the fifth nodes as nodes for further verifying the validity of the transaction.

[0067] For example, the electronic device (200) may transmit, using the communication circuit (305), to the sixth node determined according to the above description, a request to transmit a fourth hash value obtained by connecting the first block (100) to at least one second block within the sixth node. For example, the sixth node may receive a request to transmit the fourth hash value. For example, the sixth node may transmit information about the fourth hash value to the electronic device (200). For example, the electronic device (200) may receive information about the fourth hash value from the sixth node using the communication circuit (305). The electronic device (200) may transmit, through the communication circuit (305), a signal indicating that it maintains connecting the first block (100) connected to at least one second block to each of the nodes based on the fourth hash value being the same as the third hash value. For example, the signal may include information to commit the first block (100) to the blockchain. For example, another signal may be transmitted via the communication circuit (305) to each of the nodes, indicating that the first block (100) linked to at least one second block is to be discarded, based on a fourth hash value different from the third hash value. This other signal is described and exemplified in more detail with reference to FIG. 9.

[0068] Figure 9 illustrates an example of discarding the first block.

[0069] Referring to FIG. 9, a first block (900) may be connected to at least one second block (910). For example, the first block (900) may correspond to the first block (100) illustrated in FIG. 1. For example, the at least one second block (910) may correspond to at least one second block (222) illustrated in FIG. 2B. Referring again to FIG. 8, the electronic device (200) may, at operation 860, transmit a signal to the nodes indicating that the first block (100) is discarded. As a non-limiting example, the first node (210-1) may receive another signal indicating that the first block (900) is discarded. Based on the other signal, the first node (210-1) may disconnect the connection between the first block (900) and the at least one second block (910), and based on the disconnection, discard or delete the first block (100).

[0070] For example, the electronic device (200) may perform operations 840 and 850 according to practical Byzantine fault tolerance for operations 845, 855, and 860. These operations are described and illustrated with reference to FIG. 10.

[0071] Figure 10 illustrates an example of verifying the validity of a transaction according to practical byzantine fault tolerance.

[0072] Referring to FIG. 10, in the first verification where the electronic device (200) verifies the validity of the transaction related to the first block (100), the first hash value obtained from the first node (210-1) may be x, and the second hash value obtained from the second node (210-2) may be y, which is different from x. For example, the electronic device (200) may utilize practical Byzantine fault tolerance to additionally verify the validity of the transaction related to the first block (100) based on the second hash value, which is different from the first hash value. For example, when the number of nodes providing false hash values ​​is f, the total number of nodes required to utilize practical Byzantine fault tolerance may be 3f+1. When more than 2 / 3 of the hash values ​​provided from each of the 3f+1 nodes are the same, the hash values ​​may be true.

[0073] For example, if the number of nodes used for primary verification is f, the electronic device (200) can determine 2f+1 nodes as nodes for secondary verification. The nodes used for primary verification can be referred to as nodes for verifying the validity of the transaction. For example, if the number of nodes used for primary verification is f, the electronic device (200) can determine 2f+1 nodes as nodes for further verifying the validity of the transaction. For example, the electronic device (200) can receive information about hash values ​​from each of the 3f+1 nodes through the communication circuit (305). For example, based on the fact that 2f+1 or more of the received hash values ​​are the same, the electronic device (200) can transmit a signal indicating that the first block (100) is maintained to be connected to at least one second block to each of the nodes through the communication circuit (305). For example, if f is 3, the number of nodes to further verify the validity of the transaction may be 7. For example, if f is 3, hash values ​​of 7 or more may be required to be identical in order to transmit a signal to each of the nodes indicating that they maintain linking the first block (100) to at least one second block.

[0074] For example, since the first node (210-1) and the second node (210-2) may be nodes that provided false hash values ​​according to the first verification, f may be 2. For example, since f is 2, the number of nodes required to utilize Byzantine fault tolerance may be 7. For example, the number of nodes required to further verify the validity of the transaction may be 5. For example, the electronic device (200) may identify node (1030), node (1040), node (1050), node (1060), and node (1070) among the nodes according to the Byzantine fault tolerance in order to further verify the validity of the first block (100). For example, the electronic device (200) may determine nodes (1030), (1040), (1050), (1060), and (1070) as nodes for further verifying the validity of the transaction based on the average hash value calculation time of each of the remaining nodes. However, the present invention is not limited thereto. For example, the electronic device (200) may determine nodes (1030), (1040), (1050), (1060), and (1070) based on the reputation of each of the nodes, which is determined based on whether each of the hash values ​​received from each of the remaining nodes was true or false. For example, the electronic device (200) may determine nodes (1030), (1040), (1050), (1060), and (1070) based on the participation of each of the remaining nodes, which indicates the number of times each of the remaining nodes has been used in relation to at least one block prior to the first block (100). For example, the electronic device (200) may determine nodes (1030), (1040), (1050), (1060), and (1070) based on the share of coins held by each of the remaining nodes.For example, the electronic device (200) may determine nodes (1030), (1040), (1050), (1060), and (1070) based on the average hash value calculation time of each of the remaining nodes, the reputation of each of the nodes determined based on whether each of the hash values ​​received from each of the remaining nodes was true or false, the participation of each of the remaining nodes indicating the number of times each of the remaining nodes was used in relation to at least one block prior to the first block (100), and / or the share of coins held by each of the remaining nodes. As a non-limiting example, nodes (1030), (1040), (1050), (1060), and (1070) may include the third node and the sixth node.

[0075] For example, the electronic device (200) may transmit a request to each of nodes (1030), (1040), (1050), (1060), and (1070) to transmit a hash value obtained by connecting the first block (100) to at least one second block (222) using the communication circuit (305). For example, the electronic device (200) may receive information about the hash value from each of nodes (1030), (1040), (1050), (1060), and (1070) using the communication circuit (305). For example, each of nodes (1030), (1040), (1050), (1060), and (1070) may provide information about the hash value to the electronic device (200).

[0076] For example, according to the practical Byzantine fault tolerance, if five or more hash values ​​among the hash values ​​provided from the first node (210-1), the second node (210-2), the node (1030), the node (1040), the node (1050), the node (1060), and the node (1070) are the same, the five or more hash values ​​can be true. For example, if the five or more hash values ​​are the same, the hash values ​​can be described as true hash values. For example, based on the fact that five or more hash values ​​among the hash values ​​provided from the first node (210-1), the second node (210-2), the node (1030), the node (1040), the node (1050), the node (1060), and the node (1070) are identical, the electronic device (200) may transmit a signal to each of the first node (210-1) to the Nth node (210-N) indicating that the first block (100) is maintained connected to the at least one second block. For example, the signal may include information about a true hash value. For example, if a hash value provided from a node (1030) in relation to a first block (100), a hash value provided from a node (1040) in relation to a first block (100), a hash value provided from a node (1050) in relation to a first block (100), and a hash value provided from a node (1060) in relation to a first block (100) is x, and a hash value provided from a node (1070) in relation to a first block (100) is z, which is different from x and y, then the number of nodes that provided each of the hash values ​​x is 5, and therefore, the electronic device (200) can determine that the hash value x is true, according to the practical Byzantine fault tolerance. For example, the electronic device (200) may, according to the above decision, transmit a signal to each of the first node (210-1) to the Nth node (210-N) that includes information about a hash value x and indicates that the first block (100) is maintained connected to at least one second block.For example, if the hash value provided from node (1030) in relation to the first block (100), the hash value provided from node (1040) in relation to the first block (100), the hash value provided from node (1050) in relation to the first block (100), the hash value provided from node (1060) in relation to the first block (100), and the hash value provided from node (1070) in relation to the first block (100) are z different from x and y, then the number of nodes that provided the hash values ​​z is 5, and therefore, the electronic device (200) can determine the hash value z as the true hash value according to the practical Byzantine fault tolerance. For example, the electronic device (200) may, according to the above decision, transmit a signal to each of the first node (210-1) to the Nth node (210-N) that includes information about a hash value of z and indicates that the first block (100) is maintained connected to at least one second block.

[0077] For example, when hash values ​​less than 5 are the same among the hash values ​​provided from the first node (210-1), the second node (210-2), the node (1030), the node (1040), the node (1050), the node (1060), and the node (1070), the electronic device (200) can transmit a signal indicating that at least one first block (100) connected to the second block is to be discarded to each of the first node (210-1) to the Nth node (210-N) using the communication circuit (305).

[0078] As described above, an electronic device may include a memory storing instructions. The electronic device may include a communication circuit. The electronic device may include at least one processor. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to determine to link a first block for a transaction to at least one second block within each of nodes storing a ledger. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to request each of the nodes to link the first block to the at least one second block based on the determination, and to determine a first node and a second node among the nodes as nodes for verifying the validity of the transaction, based on an average hash value calculation time of each of the nodes. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit, using the communication circuitry, a request to the first node to transmit a first hash value obtained by connecting the first block within the first node to the at least one second block. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit, using the communication circuitry, a request to the second node to transmit a second hash value obtained by connecting the first block within the second node to the at least one second block. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to receive, using the communication circuitry, information about the first hash value from the first node.The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to receive, using the communication circuitry, information about the second hash value from the second node. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit, using the communication circuitry, a signal to each of the nodes indicating that the at least one second block is maintained connected to the first block based on the second hash value being the same as the first hash value.

[0079] In one embodiment, the transaction may include a transaction within a game provided via a game software application.

[0080] In one embodiment, the average hash value calculation time may represent the time consumed within each of the nodes prior to the transaction to transmit information about the hash value in relation to the connection of one (a) block to the electronic device.

[0081] According to one embodiment, the instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to determine the first node and the second node among the nodes based on a reputation of each of the nodes and an average hash value calculation time of each of the nodes, which is determined based on whether each of the hash values ​​received from each of the nodes was true or false.

[0082] According to one embodiment, the instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to determine the first node and the second node among the nodes based on a participation degree of each of the nodes indicating a number of times each of the nodes has been utilized in relation to at least one block prior to the first block and an average hash value calculation time of each of the nodes.

[0083] According to one embodiment, the instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to determine the first node and the second node among the nodes based on the share of coins each node holds and the average hash value calculation time.

[0084] According to one embodiment, the instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to determine a third node, a fourth node, a fifth node, a sixth node, and a seventh node among the remaining nodes as nodes for further verifying the validity of the transaction, based on the second hash value being different from the first hash value, and according to an average hash value calculation time of each of the remaining nodes excluding the first node and the second node among the nodes. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit, using the communication circuitry, a request to the third node, a third hash value obtained by connecting the first block to the at least one second block within the third node, a request to the fourth node, a fourth hash value obtained by connecting the first block to the at least one second block within the fourth node, a request to the fifth node, a fifth hash value obtained by connecting the first block to the at least one second block within the fifth node, a request to the sixth node, a sixth hash value obtained by connecting the first block to the at least one second block within the sixth node, and a request to the seventh node, a seventh hash value obtained by connecting the first block to the at least one second block within the seventh node.The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to receive, using the communication circuitry, information about the third hash value from the third node, information about the fourth hash value from the fourth node, information about the fifth hash value from the fifth node, information about the sixth hash value from the sixth node, and information about the seventh hash value from the seventh node. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit, using the communication circuitry, the signal including the five or more hash values ​​to each of the nodes to indicate that the at least one second block maintains connection to the first block based on the equality of five or more hash values ​​among the first hash value, the second hash value, the third hash value, the fourth hash value, the fifth hash value, the sixth hash value, and the seventh hash value. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit, using the communication circuitry, another signal to each of the nodes, indicating that the first block connected to the at least one second block is to be discarded, based on the fact that less than five hash values ​​among the first hash value, the second hash value, the third hash value, the fourth hash value, the fifth hash value, the sixth hash value, and the seventh hash value are identical.

[0085] According to one embodiment, the instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to determine a third node, a fourth node, a fifth node, a sixth node, and a seventh node among the remaining nodes as nodes for further verifying the validity of the transaction, based on a reputation of each of the nodes and an average hash value calculation time of each of the nodes, which is determined based on whether each of the hash values ​​received from each of the nodes was true or false.

[0086] According to one embodiment, the instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to determine a third node, a fourth node, a fifth node, a sixth node, and a seventh node among the remaining nodes as nodes for further verifying the validity of the transaction, based on a participation degree of each of the nodes indicating a number of times each of the nodes has been used in relation to at least one block prior to the first block and an average hash value calculation time of each of the nodes.

[0087] According to one embodiment, the instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to determine a third node, a fourth node, a fifth node, a sixth node, and a seventh node among the remaining nodes as nodes for further verifying the validity of the transaction, based on the share of coins each node holds and the average hash value calculation time.

[0088] In one embodiment, the instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to determine a third node among the remaining nodes as a node for further verifying the validity of the transaction, based on an average hash value calculation time of each of the remaining nodes excluding the first node and the second node, based on the second hash value being different from the first hash value. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit, using the communication circuit, a request to the third node to transmit a third hash value obtained by linking the first block to the at least one second block within the third node. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to receive, using the communication circuit, information about the third hash value from the third node. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit, using the communication circuitry, the signal including the second hash value to each of the nodes to indicate that the at least one second block maintains a connection to the first block based on the third hash value that is different from the first hash value and equal to the second hash value.The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit, via the communication circuitry, a signal comprising the first hash value to indicate to each of the nodes that the first block is to be maintained connected to the at least one second block, based on the third hash value being the same as the first hash value and different from the second hash value. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit, via the communication circuitry, another signal to each of the nodes that the first block is to be discarded connected to the at least one second block, based on the third hash value being different from the first hash value and different from the second hash value, or to transmit, via the communication circuitry, the signal to each of the nodes that the first block is to be maintained connected to the at least one second block.

[0089] In one embodiment, the remaining nodes are fourth nodes, and the instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to determine a sixth node among the fifth nodes as a node for further verifying the validity of the transaction, based on an average hash value calculation time of each of the fifth nodes, excluding the third node, among the fourth nodes, based on the second hash value being different from the first hash value. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit, using the communication circuit, a request to the sixth node to transmit a fourth hash value obtained by linking the first block to the at least one second block within the sixth node. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to receive, using the communication circuit, information about the fourth hash value from the sixth node. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit, using the communication circuitry, a signal to each of the nodes indicating that the first block is to remain connected to the at least one second block, based on the fourth hash value being the same as the third hash value. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit, using the communication circuitry, another signal to each of the nodes indicating that the first block connected to the at least one second block is to be discarded, based on the fourth hash value being different from the third hash value.

[0090] In one embodiment, the instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit the signal in accordance with practical Byzantine fault tolerance based on the third hash value that is different from the first hash value and equal to the second hash value. The instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to transmit the signal in accordance with practical Byzantine fault tolerance based on the third hash value that is different from the first hash value and equal to the second hash value.

[0091] According to one embodiment, the instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to determine the third node from among the remaining nodes based on a reputation of each of the nodes and an average hash value calculation time of each of the nodes, which is determined based on whether each of the hash values ​​received from each of the nodes was true or false.

[0092] According to one embodiment, the instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to determine the third node from among the remaining nodes based on a participation degree of each of the nodes, the participation degree indicating the number of times each of the nodes has been used in relation to at least one block prior to the first block, and an average hash value calculation time of each of the nodes.

[0093] According to one embodiment, the instructions, when individually or collectively executed by the at least one processor, may cause the electronic device to determine the third node among the remaining nodes based on the share of coins each of the nodes holds and the average hash value calculation time.

[0094] A method performed by an electronic device having a communication circuit as described above may include an operation of determining to link a first block for a transaction to at least one second block within each of nodes storing a ledger. The method may include an operation of requesting each of the nodes to link the first block to the at least one second block based on the determination, and determining a first node and a second node among the nodes as nodes for verifying the validity of the transaction based on an average hash value calculation time of each of the nodes. The method may include an operation of transmitting, using the communication circuit, a request to the first node to transmit a first hash value obtained by linking the first block within the first node to the at least one second block. The method may include an operation of transmitting, using the communication circuit, a request to the second node to transmit a second hash value obtained by linking the first block within the second node to the at least one second block. The method may include receiving information about the first hash value from the first node using the communication circuit. The method may include receiving information about the second hash value from the second node using the communication circuit. The method may include transmitting a signal, using the communication circuit, to each of the nodes, indicating that the first block is maintained connected to the at least one second block, based on the second hash value being the same as the first hash value.

[0095] In one embodiment, the transaction may include a transaction within a game provided via a game software application.

[0096] In one embodiment, the average hash value calculation time may include an operation representing the time consumed within each of the nodes prior to the transaction to transmit information about the hash value in relation to the connection of one (a) block to the electronic device.

[0097] According to one embodiment, the method may include an operation of determining the first node and the second node among the nodes based on a reputation of each of the nodes and an average hash value calculation time of each of the nodes, which is determined based on whether each of the hash values ​​received from each of the nodes was true or false.

[0098] According to one embodiment, the method may include an operation of determining the first node and the second node among the nodes based on a participation degree of each of the nodes indicating the number of times each of the nodes has been used in relation to at least one block prior to the first block and an average hash value calculation time of each of the nodes.

[0099] According to one embodiment, the method may include an operation of determining the first node and the second node among the nodes based on the share of coins held by each of the nodes and the average hash value calculation time.

[0100] According to one embodiment, the method may include an operation of determining a third node, a fourth node, a fifth node, a sixth node, and a seventh node among the remaining nodes as nodes for further verifying the validity of the transaction, based on the second hash value being different from the first hash value, and based on an average hash value calculation time of each of the remaining nodes excluding the first node and the second node among the nodes. The method may include an operation of transmitting, using the communication circuit, a request to the third node to transmit a third hash value obtained by connecting the first block to the at least one second block within the third node, a request to the fourth node to transmit a fourth hash value obtained by connecting the first block to the at least one second block within the fourth node, a request to the fifth node to transmit a fifth hash value obtained by connecting the first block to the at least one second block within the fifth node, a request to the sixth node to transmit a sixth hash value obtained by connecting the first block to the at least one second block within the sixth node, and a request to the seventh node to transmit a seventh hash value obtained by connecting the first block to the at least one second block within the seventh node. The method may include an operation of receiving, using the communication circuit, information about the third hash value from the third node, information about the fourth hash value from the fourth node, information about the fifth hash value from the fifth node, information about the sixth hash value from the sixth node, and information about the seventh hash value from the seventh node.The method may include an action of transmitting, using the communication circuit, the signal including the five or more hash values ​​to indicate to each of the nodes that the first block is maintained connected to the at least one second block based on the fact that five or more hash values ​​among the first hash value, the second hash value, the third hash value, the fourth hash value, the fifth hash value, the sixth hash value, and the seventh hash value are the same. The method may include an action of transmitting, using the communication circuit, another signal to each of the nodes that indicates to discard the first block connected to the at least one second block based on the fact that less than five hash values ​​among the first hash value, the second hash value, the third hash value, the fourth hash value, the fifth hash value, the sixth hash value, and the seventh hash value are the same.

[0101] According to one embodiment, the method may include an operation of determining a third node, a fourth node, a fifth node, a sixth node, and a seventh node among the remaining nodes as nodes for further verifying the validity of the transaction, based on the reputation of each of the nodes and the average hash value calculation time of each of the nodes, which is determined based on whether each of the hash values ​​received from each of the nodes was true or false.

[0102] According to one embodiment, the method may include an operation of determining a third node, a fourth node, a fifth node, a sixth node, and a seventh node among the remaining nodes as nodes for further verifying the validity of the transaction, based on a participation degree of each of the nodes, which indicates the number of times each of the nodes has been used in relation to at least one block prior to the first block, and an average hash value calculation time of each of the nodes.

[0103] According to one embodiment, the method may include an operation of determining a third node, a fourth node, a fifth node, a sixth node, and a seventh node among the remaining nodes as nodes for further verifying the validity of the transaction, based on the share of coins held by each of the nodes and the average hash value calculation time.

[0104] In one embodiment, the method may include an operation of determining a third node among the remaining nodes as a node for further verifying the validity of the transaction based on an average hash value calculation time of each of the remaining nodes excluding the first node and the second node among the nodes based on the second hash value being different from the first hash value. The method may include an operation of transmitting, using the communication circuit, a request to the third node to transmit a third hash value obtained by linking the first block to the at least one second block within the third node. The method may include an operation of receiving, using the communication circuit, information about the third hash value from the third node. The method may include an operation of transmitting, using the communication circuit, the signal including the second hash value to each of the nodes to indicate that linking the first block to the at least one second block is maintained based on the third hash value being different from the first hash value and equal to the second hash value. The method may include transmitting, using the communication circuit, a signal including the first hash value to each of the nodes to indicate that the at least one second block is connected to the first block based on the third hash value being the same as the first hash value and different from the second hash value.The method may include transmitting, through the communication circuit, another signal indicating to each of the nodes to discard the first block connected to the at least one second block, or transmitting, through the communication circuit, the signal indicating to each of the nodes to maintain the connection of the first block connected to the at least one second block, based on the third hash value being different from the first hash value and different from the second hash value.

[0105] In one embodiment, the remaining nodes are fourth nodes, and the method may include an operation of determining a sixth node among the fifth nodes as a node for further verifying the validity of the transaction based on an average hash value calculation time of each of the fifth nodes, excluding the third node, among the fourth nodes, based on the second hash value being different from the first hash value. The method may include an operation of transmitting, using the communication circuit, a request to the sixth node to transmit a fourth hash value obtained by linking the first block to the at least one second block within the sixth node. The method may include an operation of receiving, using the communication circuit, information about the fourth hash value from the sixth node. The method may include an operation of transmitting, using the communication circuit, a signal indicating to each of the nodes that linking the first block to the at least one second block is maintained, based on the fourth hash value being the same as the third hash value. The method may further include transmitting, using the communication circuit, another signal to each of the nodes, based on the fourth hash value being different from the third hash value, indicating that the first block connected to the at least one second block is to be discarded.

[0106] In one embodiment, the method may include transmitting the signal in accordance with practical Byzantine fault tolerance based on the third hash value, which is different from the first hash value and identical to the second hash value. The method may include transmitting the signal in accordance with practical Byzantine fault tolerance based on the third hash value, which is different from the first hash value and identical to the second hash value.

[0107] According to one embodiment, the method may include an operation of determining the third node among the remaining nodes based on the reputation of each of the nodes and the average hash value calculation time of each of the nodes, which is determined based on whether each of the hash values ​​received from each of the nodes was true or false.

[0108] According to one embodiment, the method may include an operation of determining the third node among the remaining nodes based on a participation degree of each of the nodes, which indicates the number of times each of the nodes has been used in relation to at least one block prior to the first block, and an average hash value calculation time of each of the nodes.

[0109] According to one embodiment, the method may include an operation of determining the third node among the remaining nodes based on the share of coins held by each of the nodes and the average hash value calculation time.

[0110] In a computer-readable storage medium having one or more programs stored thereon, as described above, the one or more programs may include instructions that, when executed by an electronic device having a communication circuit, cause the electronic device to determine to link a first block for a transaction to at least one second block within each of nodes storing a ledger. The one or more programs may include instructions that, when executed by the electronic device, cause the electronic device to, based on the determination, request each of the nodes to link the first block to the at least one second block, and determine a first node and a second node among the nodes as nodes for verifying the validity of the transaction, based on an average hash value calculation time of each of the nodes. The one or more programs may include instructions that, when executed by the electronic device, cause the electronic device to transmit, using the communication circuit, a request to the first node to transmit a first hash value obtained by linking the first block within the first node to the at least one second block. The one or more programs may include instructions that, when executed by the electronic device, cause the electronic device to transmit, using the communication circuit, a request to the second node to transmit a second hash value obtained by connecting the first block within the second node to the at least one second block. The one or more programs may include instructions that, when executed by the electronic device, cause the electronic device to receive, using the communication circuit, information about the first hash value from the first node.The one or more programs may include instructions that, when executed by the electronic device, cause the electronic device to receive, using the communication circuit, information about the second hash value from the second node. The one or more programs may include instructions that, when executed by the electronic device, cause the electronic device to transmit, using the communication circuit, a signal to each of the nodes indicating that the first block is maintained connected to the at least one second block based on the second hash value being the same as the first hash value.

[0111] In one embodiment, the transaction may include a transaction within a game provided via a game software application.

[0112] In one embodiment, the average hash value calculation time may represent the time consumed within each of the nodes prior to the transaction to transmit information about the hash value in relation to the connection of one (a) block to the electronic device.

[0113] According to one embodiment, the one or more programs may include instructions that cause the electronic device to determine the first node and the second node among the nodes based on a reputation of each of the nodes and an average hash value calculation time of each of the nodes, which is determined based on whether each of the hash values ​​received from each of the nodes was true or false.

[0114] According to one embodiment, the one or more programs may include instructions that cause the electronic device to determine the first node and the second node among the nodes based on a participation degree of each of the nodes, which indicates the number of times each of the nodes has been used in relation to at least one block prior to the first block, and an average hash value calculation time of each of the nodes.

[0115] According to one embodiment, the one or more programs may include instructions that cause the electronic device to determine the first node and the second node among the nodes based on the share of coins each node holds and the average hash value calculation time.

[0116] According to one embodiment, the one or more programs may include instructions that cause the electronic device to determine a third node, a fourth node, a fifth node, a sixth node, and a seventh node among the remaining nodes as nodes for further verifying the validity of the transaction, based on the second hash value being different from the first hash value, and based on an average hash value calculation time of each of the remaining nodes excluding the first node and the second node among the nodes. The one or more programs may include instructions that cause the electronic device to transmit, using the communication circuit, a request to the third node, a third hash value obtained by connecting the first block to the at least one second block within the third node, a request to the fourth node, a fourth hash value obtained by connecting the first block to the at least one second block within the fourth node, a request to the fifth node, a fifth hash value obtained by connecting the first block to the at least one second block within the fifth node, a request to the sixth node, a sixth hash value obtained by connecting the first block to the at least one second block within the sixth node, and a request to the seventh node, a seventh hash value obtained by connecting the first block to the at least one second block within the seventh node. The one or more programs may include instructions that cause the electronic device to receive, using the communication circuit, information about the third hash value from the third node, information about the fourth hash value from the fourth node, information about the fifth hash value from the fifth node, information about the sixth hash value from the sixth node, and information about the seventh hash value from the seventh node.The one or more programs may include instructions that cause the electronic device to transmit, using the communication circuitry, the signal including the five or more hash values ​​to each of the nodes to indicate that the at least one second block maintains connection to the first block based on five or more hash values ​​being identical among the first hash value, the second hash value, the third hash value, the fourth hash value, the fifth hash value, the sixth hash value, and the seventh hash value. The one or more programs may include instructions that cause the electronic device to transmit, using the communication circuitry, another signal to each of the nodes, indicating that the first block connected to the at least one second block is to be discarded, based on the fact that less than five hash values ​​among the first hash value, the second hash value, the third hash value, the fourth hash value, the fifth hash value, the sixth hash value, and the seventh hash value are identical.

[0117] According to one embodiment, the one or more programs may include instructions that cause the electronic device to determine a third node, a fourth node, a fifth node, a sixth node, and a seventh node among the remaining nodes as nodes for further verifying the validity of the transaction, based on a reputation of each of the nodes and an average hash value calculation time of each of the nodes, which is determined based on whether each of the hash values ​​received from each of the nodes was true or false.

[0118] According to one embodiment, the method may include instructions that cause the electronic device to determine a third node, a fourth node, a fifth node, a sixth node, and a seventh node among the remaining nodes as nodes for further verifying the validity of the transaction, based on a participation degree of each of the nodes indicating the number of times each of the nodes has been used in relation to at least one block prior to the first block and an average hash value calculation time of each of the nodes.

[0119] According to one embodiment, the one or more programs may include instructions that cause the electronic device to determine a third node, a fourth node, a fifth node, a sixth node, and a seventh node among the remaining nodes as nodes for further verifying the validity of the transaction, based on the share of coins each of the nodes holds and the average hash value calculation time.

[0120] According to one embodiment, the one or more programs may include instructions that cause the electronic device to determine a third node among the remaining nodes as a node for further verifying the validity of the transaction based on an average hash value calculation time of each of the remaining nodes excluding the first node and the second node among the nodes based on the second hash value that is different from the first hash value. The one or more programs may include instructions that cause the electronic device to transmit, using the communication circuit, a request to the third node to transmit a third hash value obtained by connecting the first block to the at least one second block within the third node. The one or more programs may include instructions that cause the electronic device to receive, using the communication circuit, information about the third hash value from the third node. The one or more programs may include instructions that cause the electronic device to transmit, using the communication circuitry, the signal comprising the second hash value to indicate to each of the nodes that the connection of the first block to the at least one second block is maintained based on the third hash value that is different from the first hash value and equal to the second hash value. The one or more programs may include instructions that cause the electronic device to transmit, using the communication circuitry, the signal comprising the first hash value to indicate to each of the nodes that the connection of the first block to the at least one second block is maintained based on the third hash value that is different from the first hash value and equal to the second hash value.The one or more programs may include instructions that cause the electronic device to transmit, through the communication circuitry, another signal indicating to each of the nodes to discard the first block connected to the at least one second block, or to transmit, through the communication circuitry, the signal indicating to each of the nodes to maintain the connection of the first block connected to the at least one second block, based on the third hash value being different from the first hash value and different from the second hash value.

[0121] According to one embodiment, the remaining nodes are fourth nodes, and the one or more programs may include instructions that cause the electronic device to determine a sixth node among the fifth nodes as a node for further verifying the validity of the transaction based on an average hash value calculation time of each of the fifth nodes, excluding the third node, among the fourth nodes, based on the second hash value that is different from the first hash value. The one or more programs may include instructions that cause the electronic device to transmit, using the communication circuit, a request to the sixth node to transmit a fourth hash value obtained by connecting the first block to the at least one second block within the sixth node. The one or more programs may include instructions that cause the electronic device to receive, using the communication circuit, information about the fourth hash value from the sixth node. The one or more programs may include instructions that cause the electronic device to transmit, using the communication circuitry, a signal indicating to each of the nodes to maintain the connection of the first block to the at least one second block based on the fourth hash value that is the same as the third hash value. The one or more programs may include instructions that cause the electronic device to transmit, using the communication circuitry, another signal indicating to each of the nodes to discard the first block connected to the at least one second block based on the fourth hash value that is different from the third hash value.

[0122] In one embodiment, the one or more programs may include instructions that cause the electronic device to transmit the signal according to practical Byzantine fault tolerance based on the third hash value that is different from the first hash value and the same as the second hash value. The one or more programs may include instructions that cause the electronic device to transmit the signal according to practical Byzantine fault tolerance based on the third hash value that is different from the first hash value and the same as the second hash value.

[0123] According to one embodiment, the one or more programs may include instructions that cause the electronic device to determine the third node from among the remaining nodes based on the reputation of each of the nodes and the average hash value calculation time of each of the nodes, which is determined based on whether each of the hash values ​​received from each of the nodes was true or false.

[0124] According to one embodiment, the one or more programs may include instructions that cause the electronic device to determine the third node from among the remaining nodes based on a participation degree of each of the nodes, which indicates the number of times each of the nodes has been used in relation to at least one block prior to the first block, and an average hash value calculation time of each of the nodes.

[0125] According to one embodiment, the one or more programs may include instructions that cause the electronic device to determine the third node among the remaining nodes based on the share of coins each of the nodes holds and the average hash value calculation time.

[0126] The devices described above may be implemented as hardware components, software components, and / or a combination of hardware components and software components. For example, the devices and components described in the embodiments may be implemented using one or more general-purpose computers or special-purpose computers, such as a processor, a controller, an arithmetic logic unit (ALU), a digital signal processor, a microcomputer, a field programmable gate array (FPGA), a programmable logic unit (PLU), a microprocessor, or any other device capable of executing instructions and responding to them. The processing device may execute an operating system (OS) and one or more software applications running on the operating system. The processing device may also access, store, manipulate, process, and generate data in response to the execution of the software. For ease of understanding, the processing device is sometimes described as being used alone; however, one of ordinary skill in the art will recognize that the processing device may include multiple processing elements and / or multiple types of processing elements. For example, a processing unit may include multiple processors, or a processor and a controller. Other processing configurations, such as parallel processors, are also possible.

[0127] Software may include a computer program, code, instructions, or a combination of one or more of these, which may configure a processing device to perform a desired operation or may independently or collectively command the processing device. The software and / or data may be embodied in any type of machine, component, physical device, computer storage medium, or device for interpretation by the processing device or for providing instructions or data to the processing device. The software may also be distributed over networked computer systems and stored or executed in a distributed manner. The software and data may be stored on one or more computer-readable recording media.

[0128] The method according to the embodiment may be implemented in the form of program commands that can be executed through various computer means and recorded on a computer-readable medium. In this case, the medium may be one that continuously stores a computer-executable program or one that temporarily stores it for execution or download. In addition, the medium may be various recording or storage means in the form of a single or multiple hardware combinations, and is not limited to a medium directly connected to a computer system, but may also be distributed over a network. Examples of the medium may include magnetic media such as hard disks, floppy disks, and magnetic tapes, optical recording media such as CD-ROMs and DVDs, magneto-optical media such as floptical disks, and those configured to store program commands, including ROM, RAM, and flash memory. In addition, examples of other media may include recording or storage media managed by app stores that distribute applications, sites that supply or distribute various software, servers, etc.

[0129] Although the embodiments described above have been described by way of limited examples and drawings, those skilled in the art will appreciate that various modifications and variations can be made based on the above teachings. For example, appropriate results can still be achieved even if the described techniques are performed in a different order than described, and / or components of the described systems, structures, devices, circuits, etc. are combined or combined in a different manner than described, or are replaced or substituted with other components or equivalents.

[0130] Therefore, other implementations, other embodiments, and equivalents to the claims also fall within the scope of the claims described below.

Claims

1. In electronic devices, A memory that stores instructions and includes one or more storage media; communication circuit; and At least one processor comprising processing circuitry, The above instructions, when individually or collectively executed by the at least one processor, Decide to link the first block for the transaction to at least one second block within each of the nodes storing the ledger, Based on the above decision: Requesting each of the above nodes to connect the first block to at least one second block, Based on the average hash value calculation time of each of the above nodes, the first node and the second node among the above nodes are determined as nodes for verifying the validity of the transaction; Transmitting, to the first node using the communication circuit, a request to transmit a first hash value obtained by connecting the first block to the at least one second block within the first node; Transmitting a request to the second node to transmit a second hash value obtained by connecting the first block to the at least one second block within the second node, using the communication circuit; Receive information about the first hash value from the first node using the communication circuit, Receive information about the second hash value from the second node using the communication circuit, and Using the communication circuit, transmit a signal to each of the nodes indicating that the first block is connected to at least one second block based on the second hash value that is the same as the first hash value. causing the above electronic device, Electronic devices.

2. In claim 1, The above transaction is, Including transactions within games provided through game software applications; Electronic devices.

3. In claim 1, The above average hash value calculation time is, Indicates the time consumed within each of the nodes prior to the transaction to transmit information about the hash value in relation to the connection of one (a) block to the electronic device; Electronic devices.

4. In claim 1, the instructions, when individually or collectively executed by the at least one processor, Determine the first node and the second node among the nodes based on the reputation of each of the nodes and the average hash value calculation time of each of the nodes, which is determined based on whether each of the hash values ​​received from each of the nodes was true or false. causing the above electronic device, Electronic devices.

5. In claim 1, the instructions, when individually or collectively executed by the at least one processor, To determine the first node and the second node among the nodes based on the participation of each of the nodes, which indicates the number of times each of the nodes has been used in relation to at least one block prior to the first block, and the average hash value calculation time of each of the nodes, causing the above electronic device, Electronic devices.

6. In claim 1, the instructions, when individually or collectively executed by the at least one processor, To determine the first node and the second node among the nodes according to the share of coins held by each of the nodes and the average hash value calculation time, causing the above electronic device, Electronic devices.

7. In claim 1, The above instructions, when individually or collectively executed by the at least one processor, Based on the second hash value that is different from the first hash value, and according to the average hash value calculation time of each of the remaining nodes excluding the first node and the second node among the nodes, the third node, the fourth node, the fifth node, the sixth node, and the seventh node among the remaining nodes are determined as nodes for further verifying the validity of the transaction, Using the communication circuit, transmit to the third node a request to transmit a third hash value obtained by connecting the first block to the at least one second block within the third node, to the fourth node a request to transmit a fourth hash value obtained by connecting the first block to the at least one second block within the fourth node, to the fifth node a request to transmit a fifth hash value obtained by connecting the first block to the at least one second block within the fifth node, to the sixth node a request to transmit a sixth hash value obtained by connecting the first block to the at least one second block within the sixth node, and to the seventh node a request to transmit a seventh hash value obtained by connecting the first block to the at least one second block within the seventh node, Receive information about the third hash value from the third node, information about the fourth hash value from the fourth node, information about the fifth hash value from the fifth node, information about the sixth hash value from the sixth node, and information about the seventh hash value from the seventh node using the communication circuit, Based on the fact that five or more hash values ​​among the first hash value, the second hash value, the third hash value, the fourth hash value, the fifth hash value, the sixth hash value, and the seventh hash value are identical, transmitting the signal including the five or more hash values ​​to each of the nodes using the communication circuit to indicate that the first block is maintained to be connected to the at least one second block, and Using the communication circuit, transmit to each of the nodes another signal indicating that the first block connected to the at least one second block is discarded based on the fact that less than 5 hash values ​​among the first hash value, the second hash value, the third hash value, the fourth hash value, the fifth hash value, the sixth hash value, and the seventh hash value are the same. causing the above electronic device, Electronic devices.

8. In claim 7, the instructions, when individually or collectively executed by the at least one processor, Based on the reputation of each of the nodes and the average hash value calculation time of each of the nodes, which is determined based on whether each of the hash values ​​received from each of the nodes was true or false, the third node, the fourth node, the fifth node, the sixth node, and the seventh node among the remaining nodes are determined as nodes for further verifying the validity of the transaction. causing the above electronic device, Electronic devices.

9. In claim 7, the instructions, when individually or collectively executed by the at least one processor, According to the participation of each of the nodes indicating the number of times each of the nodes has been used in relation to at least one block prior to the first block and the average hash value calculation time of each of the nodes, among the remaining nodes, determine the third node, the fourth node, the fifth node, the sixth node, and the seventh node as nodes for further verifying the validity of the transaction. causing the above electronic device, Electronic devices.

10. In claim 7, the instructions, when individually or collectively executed by the at least one processor, Based on the share of coins held by each of the above nodes and the average hash value calculation time, the third node, the fourth node, the fifth node, the sixth node, and the seventh node among the remaining nodes are determined as nodes for further verifying the validity of the transaction. causing the above electronic device, Electronic devices.

11. In claim 1, The above instructions, when individually or collectively executed by the at least one processor, Based on the second hash value that is different from the first hash value, a third node among the remaining nodes is determined as a node to further verify the validity of the transaction, based on the average hash value calculation time of each of the remaining nodes excluding the first node and the second node among the nodes, Transmitting, using the communication circuit, a request to the third node to transmit a third hash value obtained by connecting the first block to the at least one second block within the third node, Receive information about the third hash value from the third node using the communication circuit, transmitting, using the communication circuit, the signal including the second hash value to each of the nodes to indicate that the first block is connected to the at least one second block based on the third hash value that is different from the first hash value and is the same as the second hash value; transmitting, using the communication circuit, the signal including the first hash value to each of the nodes to indicate that the first block is maintained to be connected to the at least one second block based on the third hash value that is identical to the first hash value and different from the second hash value; Based on the third hash value, which is different from the first hash value and different from the second hash value, transmit another signal, through the communication circuit, to each of the nodes, indicating to discard the first block connected to the at least one second block, or transmit, through the communication circuit, to each of the nodes, the signal indicating to maintain the connection of the first block connected to the at least one second block. causing the above electronic device, Electronic devices.

12. In claim 11, the remaining nodes are: The 4th nodes, The above instructions, when individually or collectively executed by the at least one processor, Based on the second hash value that is different from the first hash value, and based on the average hash value calculation time of each of the fifth nodes excluding the third node among the fourth nodes, the sixth node among the fifth nodes is determined as a node for further verifying the validity of the transaction. Transmitting, using the communication circuit, a request to the sixth node to transmit a fourth hash value obtained by connecting the first block to at least one second block within the sixth node, Receive information about the fourth hash value from the sixth node using the communication circuit, Using the communication circuit, transmit a signal to each of the nodes indicating that the first block is maintained to be connected to at least one second block based on the fourth hash value, which is the same as the third hash value; To transmit, using the communication circuit, another signal indicating to each of the nodes that the first block connected to the at least one second block is to be discarded based on the fourth hash value that is different from the third hash value; causing the above electronic device, Electronic devices.

13. In claim 11, the instructions, when individually or collectively executed by the at least one processor, Transmitting the signal according to practical byzantine fault tolerance based on the third hash value that is different from the first hash value and is the same as the second hash value, To transmit the signal according to practical byzantine fault tolerance based on the third hash value, which is identical to the first hash value and different from the second hash value. causing the above electronic device, Electronic devices.

14. In claim 11, the instructions, when individually or collectively executed by the at least one processor, Determine the third node among the remaining nodes based on the reputation of each of the nodes and the average hash value calculation time of each of the nodes, which is determined based on whether each of the hash values ​​received from each of the nodes was true or false. causing the above electronic device, Electronic devices.

15. In claim 11, the instructions, when individually or collectively executed by the at least one processor, Determine the third node among the remaining nodes based on the participation of each of the nodes, which indicates the number of times each of the nodes has been used in relation to at least one block prior to the first block, and the average hash value calculation time of each of the nodes. causing the above electronic device, Electronic devices.

16. In claim 11, the instructions, when individually or collectively executed by the at least one processor, Determine the third node among the remaining nodes based on the share of coins held by each of the nodes and the average hash value calculation time. causing the above electronic device, Electronic devices.

17. In a non-transitory computer-readable storage medium storing one or more programs, the one or more programs, when executed by an electronic device including a communication circuit, Decide to link the first block for the transaction to at least one second block within each of the nodes storing the ledger, Based on the above decision: Requesting each of the above nodes to connect the first block to at least one second block, Based on the average hash value calculation time of each of the above nodes, the first node and the second node among the above nodes are determined as nodes for verifying the validity of the transaction; Transmitting, to the first node, a request to transmit a first hash value obtained by connecting the first block to at least one second block within the first node, using the communication circuit; and Transmitting a request to the second node to transmit a second hash value obtained by connecting the first block to the at least one second block within the second node, using the communication circuit; Receive information about the first hash value from the first node using the communication circuit, Receive information about the second hash value from the second node using the communication circuit, and Using the communication circuit, transmit a signal to each of the nodes indicating that the first block is connected to at least one second block based on the second hash value that is the same as the first hash value. comprising instructions causing the electronic device to operate; Non-transitory computer-readable storage medium.

18. In claim 17, The above average hash value calculation time is, Indicate the time consumed within each of said nodes prior to said transaction to transmit information about the hash value in relation to the connection of one (a) block to said electronic device; comprising instructions causing the electronic device to operate; Non-transitory computer-readable storage medium.

19. In claim 17, The above one or more programs, when executed by the electronic device, Determine the first node and the second node among the nodes based on the reputation of each of the nodes and the average hash value calculation time of each of the nodes, which is determined based on whether each of the hash values ​​received from each of the nodes was true or false. comprising instructions causing the electronic device to operate; Non-transitory computer-readable storage medium.

20. In claim 17, The above one or more programs, when executed by the electronic device, To determine the first node and the second node among the nodes based on the participation of each of the nodes, which indicates the number of times each of the nodes has been used in relation to at least one block prior to the first block, and the average hash value calculation time of each of the nodes, comprising instructions causing the electronic device to operate; Non-transitory computer-readable storage medium.

Images