Block generation method

Abstract

Disclosed according to several embodiments of the present disclosure is a method by which a computing device comprising at least one processor generates a block. The block generation method comprises the steps of: obtaining a first transaction from a node which is included in a blockchain network and in which a transaction has occurred; and, if the first transaction is obtained, generating, on the basis of whether any one of preset conditions is satisfied, a first block for recording the first transaction, wherein the preset conditions can include a first condition that is satisfied if the number of transactions not recorded in a block reaches a preset number due to the receipt of the first transaction, and a second condition that is satisfied if the acquisition time of a second transaction acquired first from among the transactions not recorded in the block reaches a preset time.

Description

How to create a block

[0001] The present disclosure relates to a method for generating a block, and more particularly, to a method for generating a block for constructing a blockchain network.

[0002] Recently, blockchain technology has been utilized in new innovative technologies such as Web 3.0, NFTs, and Metaverse. In particular, the emergence of NFT (Non-Fungible Token) technology allows people around the world to partially own various assets by converting them into NFTs. Alternatively, people can share and use these assets, or they can be tokenized and traded as easily as individual items.

[0003] Furthermore, NFT trading, which involves trading ownership of a token, is now possible, in addition to physical transactions. And as all these social and economic activities expand into the virtual world known as the metaverse, their utility is growing even more.

[0004] However, the NFT market initially faced a surge in NFT prices due to speculative fervor, and the proliferation of numerous NFT marketplaces led to a proliferation of unverified NFTs. These NFTs presented complex challenges, including complex processes for creation, storage, and trading, as well as high fees.

[0005] The present disclosure is conceived in response to the aforementioned background technology, and aims to provide a block generation method that does not generate unnecessary resources.

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

[0007] According to one embodiment of the present disclosure for solving the above-described problem, a block generation method performed by a computing device including at least one processor is disclosed. The block generation method includes the steps of: obtaining a first transaction from a node in which a transaction has occurred included in a blockchain network; and, when the first transaction is obtained, generating a first block for recording the first transaction based on whether any one of preset conditions is satisfied; wherein the preset conditions may include a first condition that is satisfied when the number of transactions not recorded in the block reaches a preset number by receiving the first transaction, and a second condition that is satisfied when the acquisition time of a second transaction that is obtained earliest among the transactions not recorded in the block reaches a preset time.

[0008] In addition, the method may further include: a step of determining whether at least one second block corresponding to the first block exists when the first block is generated; a step of determining a sum of the numbers of the first block and the at least one second block when the at least one second block exists; a step of determining a first hash value using the first block and the at least one second block when the sum of the numbers reaches a preset number; and a step of generating a third block using the first hash value.

[0009] In addition, when the sum of the numbers reaches a preset number, the step of determining a first hash value using the first block and the at least one second block may include: a step of extracting a first block seed value from a seed value for the first block according to a preset rule; a step of extracting at least one second block seed value from a seed value for each of the at least one second blocks according to a preset rule; a step of generating an integrated seed value by connecting the first block seed value and the at least one second block seed value according to a time series order indicating a connection relationship of each block; and a step of determining the first hash value through a hash function using the integrated seed value as an input.

[0010] In addition, when the first transaction is acquired, the step of generating a first block for recording the first transaction based on whether any one of the preset conditions is satisfied may include: determining whether the first condition is satisfied; generating the first block if the first condition is satisfied; determining whether the second condition is satisfied if the first condition is not satisfied; and generating the first block if the second condition is satisfied.

[0011] In addition, the method further includes a step of determining at least one hash rate for determining a reward according to the generation of the first block; wherein the at least one hash rate may include at least one of a volume hash rate related to a quantity staked in a plurality of nodes included in the blockchain network, an additive hash rate satisfied when the quantity exceeds a preset condition, and a time hash rate related to a time staked in a plurality of nodes included in the blockchain network.

[0012] The technical solutions obtainable in the present disclosure are not limited to the solutions mentioned above, and other solutions not mentioned will be clearly understood by a person having ordinary skill in the art to which the present disclosure pertains from the description below.

[0013] According to some embodiments of the present disclosure, a method for generating blocks without causing waste of resources can be provided.

[0014] The effects that can be obtained from the present disclosure are not limited to the effects mentioned above, and other effects that are not mentioned will be clearly understood by a person having ordinary skill in the art to which the present disclosure pertains from the description below.

[0015] Various aspects are now described with reference to the drawings, wherein like reference numerals are used to refer to similar elements generally. In the following examples, for purposes of explanation, numerous specific details are set forth to provide a thorough understanding of one or more aspects. However, it will be apparent that such aspects may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form to facilitate the description of one or more aspects.

[0016] FIG. 1 illustrates an exemplary system for performing a block generation method according to some embodiments of the present disclosure.

[0017] FIG. 2 is a diagram illustrating an example of a method for generating a block by a computing device according to some embodiments of the present disclosure.

[0018] FIG. 3 is a flowchart illustrating an example of a method for a computing device according to some embodiments of the present disclosure to determine whether preset conditions are satisfied.

[0019] FIG. 4 is a flowchart illustrating an example of a method for a computing device to compress a block according to some embodiments of the present disclosure.

[0020] FIG. 5 is a flowchart illustrating an example of a method by which a computing device (100) determines a first hash value according to some embodiments of the present disclosure.

[0021] The present invention is susceptible to various modifications and embodiments. Specific embodiments are illustrated in the drawings and described in detail in the detailed description. However, this is not intended to limit the present invention to specific embodiments, but rather to encompass all modifications, equivalents, and alternatives falling within the spirit and technical scope of the present invention. Throughout the description of each drawing, similar reference numerals have been used to designate similar components.

[0022] Terms such as "first," "second," "A," and "B" may be used to describe various components, but the components should not be limited by these terms. These terms are used solely to distinguish one component from another. For example, without departing from the scope of the present invention, the first component may be referred to as the "second component," and similarly, the second component may also be referred to as the "first component." The term "and / or" includes a combination of a plurality of related items described herein or any of a plurality of related items described herein.

[0023] When a component is referred to as being "connected" or "connected" to another component, it should be understood that it may be directly connected or connected to that other component, but that there may be other components intervening. Conversely, when a component is referred to as being "directly connected" or "connected" to another component, it should be understood that there are no other components intervening.

[0024] The terminology used in this application is only used to describe specific embodiments and is not intended to limit the present invention. The singular expression includes the plural expression unless the context clearly indicates otherwise. In this application, it should be understood that the terms "comprise" or "have" indicate the presence of a feature, number, step, operation, component, part, or combination thereof described in the specification, but do not exclude in advance the possibility of the presence or addition of one or more other features, numbers, steps, operations, components, parts, or combinations thereof.

[0025] Unless otherwise defined, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art to which this invention pertains. Terms defined in commonly used dictionaries should be interpreted as having a meaning consistent with their meaning in the context of the relevant technology, and will not be interpreted in an idealized or overly formal sense unless explicitly defined herein.

[0026] In the present disclosure, a computing device can receive transactions from a node included in a blockchain network. Based on the received transactions, the computing device can determine whether to generate a block. Conventionally, the computing device would generate a block and verify the integrity of each transaction upon receiving it. However, as the computing device generated a block each time, problems such as unnecessary fees, slow transaction processes, or slow integrity verification occurred. In contrast, the computing device according to the present disclosure can generate a block based on whether preset conditions are met when a transaction is received. This can prevent unnecessary resource consumption.

[0027] Hereinafter, a block generation method according to the present disclosure will be described with reference to FIGS. 1 to 5.

[0028] FIG. 1 illustrates an exemplary system for performing a block generation method according to some embodiments of the present disclosure.

[0029] Referring to FIG. 1, a computing device (100) may include a control unit (110), a storage unit (120), and a communication unit (130). However, the above-described components are not essential for implementing the computing device (100), and thus the computing device (100) may have more or fewer components than the components listed above.

[0030] The computing device (100) may include any type of computer system or computer device, such as, for example, a microprocessor, a mainframe computer, a digital processor, a portable device, or a device controller.

[0031] A computing device (100) may achieve desired system performance by utilizing a combination of typical computer hardware (e.g., devices that may include a computer processor, memory, storage, input devices and output devices, and other components of conventional computing devices; electronic communication devices such as routers, switches, etc.; electronic information storage systems such as network-attached storage (NAS) and storage area networks (SAN)) and computer software (i.e., instructions that cause the computing device to function in a particular manner).

[0032] In this disclosure, the computing device may be a master node or server node connected to a blockchain network (200). Alternatively, the computing device may be a master node, one of the nodes that construct the blockchain network (200). A node with a certain level of performance or higher may be selected as the computing device to perform blockchain functions.

[0033] The control unit (110) can typically process the overall operation of the computing device (100). The control unit (110) can process signals, data, information, etc. input or output through components of the computing device (100) or run application programs stored in the storage unit (120), thereby providing or processing appropriate information or functions to the user.

[0034] The control unit (110) may be composed of one or more cores and may include a processor for data analysis, such as a central processing unit (CPU), a general purpose graphics processing unit (GPGPU), or a tensor processing unit (TPU).

[0035] In the present disclosure, when a transaction is acquired from at least one node included in the blockchain network (200), the control unit (110) can determine whether any one of the preset conditions is satisfied. For example, the control unit (110) can determine whether the number of transactions not recorded in a block reaches a preset number. Alternatively, the control unit (110) can determine whether the acquisition time of the earliest acquired transaction among the transactions not recorded in a block reaches a preset time. When any one of the conditions is satisfied, the control unit (110) can generate a block for recording the transaction acquired from at least one node. Accordingly, unnecessary waste of resources can be prevented. Hereinafter, an example of a method for the control unit (110) to generate a block for recording a transaction will be described with reference to FIGS. 2 and 3 .

[0036] The storage unit (120) may include memory and / or a permanent storage medium. The memory may include at least one type of storage medium among a flash memory type, a hard disk type, a multimedia card micro type, a card type memory (e.g., SD or XD memory, etc.), a random access memory (RAM), a static random access memory (SRAM), a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM), a programmable read-only memory (PROM), a magnetic memory, a magnetic disk, and an optical disk. The storage unit (120) may store transactions that are not recorded in a block.

[0037] The communication unit (130) may include one or more modules that enable communication between a computing device (100) and a communication system, between a computing device (100) and a blockchain network (200), or between a computing device (100) and a network (300).

[0038] A blockchain network (200) may be a network that launches and operates a blockchain project. The blockchain network (200) is comprised of an unspecified number of nodes and can record transactions and verify them using a blockchain protocol. The blockchain network (200) can issue tokens using a predetermined protocol and record and verify transactions regarding token ownership. While FIG. 1 illustrates a single blockchain network (200) for convenience, the embodiment is not limited thereto. The computing device (100) can communicate with multiple blockchain networks (200) of different types. Each blockchain network (200) can be operated by a blockchain protocol that supports NFTs. Blockchain protocols that support NFTs include Ethereum, WAX, FLOW, Binance Smart Chain, etc., but the embodiment is not limited thereto. NFTs can be issued according to protocols such as Ethereum, WAX, FLOW, and Binance Smart Chain described above. The issuance amount of NFTs may be limited. For example, the issuance amount of an NFT may be 1. However, the embodiment is not limited to this. The issuance amount of an NFT may be a number greater than 1. The issuance amount of an NFT may be significantly smaller than the issuance amount of a fungible token.

[0039] The network (300) may be a closed network such as a Local Area Network (LAN) or a Wide Area Network (WAN), or an open network such as the Internet. The Internet refers to a global open computer network structure that provides various services existing in the TCP / IP protocol and its upper layer, namely, Hyper Text Transfer Protocol (HTTP), Telnet, File Transfer Protocol (FTP), Domain Name System (DNS), Simple Mail Transfer Protocol (SMTP), Simple Network Management Protocol (SNMP), Network File Service (NFS), and Network Information Service (NIS).

[0040] Below, a method for a computing device (100) to generate a block is described.

[0041] FIG. 2 is a diagram illustrating an example of a method for generating a block by a computing device according to some embodiments of the present disclosure.

[0042] Referring to FIG. 2, the control unit (110) of the computing device (100) can obtain a first transaction from a node within the blockchain network (200) where a transaction occurred (S110). A transaction can be understood as a transaction history of a transaction performed by at least one node within the blockchain network (200). A transaction can also be understood as the smallest unit of indivisible work processing.

[0043] When the first transaction is acquired, the control unit (110) can determine whether any one of the preset conditions is satisfied (S120).

[0044] The preset conditions may include a first condition and a second condition.

[0045] The first condition may be a condition that is satisfied when the number of transactions not recorded in the block reaches a preset number by receiving the first transaction.

[0046] For example, the preset number may be 1,000. The control unit (110) may determine that the first condition is satisfied when the number of transactions not recorded in the block reaches 1,000 upon receipt of the first transaction. However, the preset number is not limited thereto.

[0047] The second condition may be a condition that is satisfied when the acquisition time of the second transaction that is acquired first among the transactions that are not recorded in the block reaches a preset time.

[0048] For example, the preset time may be 2 minutes. The control unit (110) may store the first transaction in the storage unit (120). Accordingly, the transactions not recorded in the block may include the first transaction. The control unit (110) may determine the second transaction that is acquired first among the transactions not recorded in the block. If the acquisition time of the second transaction reaches 2 minutes, the control unit (110) may determine that the second condition is satisfied. In other words, the control unit (110) may generate a first block to record the first transaction, the second transaction, and other transactions not recorded in the block.

[0049] In one embodiment, it may be determined whether preset conditions are satisfied in a predetermined order. An example of a method by which the control unit (110) determines whether preset conditions are satisfied in a predetermined order is described below with reference to FIG. 3.

[0050] If any one condition is satisfied (S130, Yes), the control unit (110) may generate a first block for recording the first transaction (S140). Alternatively, if any one condition is not satisfied (S130, No), the control unit (110) may not generate the first block.

[0051] According to the above-described configuration, the computing device (100) can generate a block for recording a transaction based on whether any one of the preset conditions is satisfied. Accordingly, resources wasted for block generation can be saved.

[0052] Meanwhile, according to some embodiments of the present disclosure, the control unit (110) may determine at least one hash rate for determining a reward for generating a first block. Here, the hash rate may refer to the computing power invested to support the blockchain network (200). The hash rate may affect how much reward can be obtained from mining. However, most current blockchain reward structures are such that only the node that generated the block receives the reward, which causes various problems such as unnecessary energy waste competition for block generation (POW) and a rich-get-richer competition for stake (POS). To solve this problem, the control unit (110) may determine at least one hash rate among a volume hash rate, an additive hash rate, and a time hash rate.

[0053] The volume hash rate (V-Hash / s) may be a hash rate related to the amount staked in multiple nodes included in the blockchain network (200). The volume hash rate may be an incentive indicator indicating the volume staked in the blockchain node. Staking may be an act of entrusting a certain amount of cryptocurrency held by each node to the network. The volume hash rate of the computing device (100) may be determined by adding the staking volume of the entire node, which is the sum of the volume staked in the computing device (100) and the staking volume (b-vHash / s) of the nodes of the affiliated block supporters. The volume hash rate may be determined in such a way that the higher the value, the greater the amount staked in multiple nodes included in the blockchain network (200).

[0054] The volume hash rate can be determined based on the mathematical formula below.

[0055]

[0056]

[0057] Here, may be a volume hash rate of a master node group. The master node group may be a group consisting of a master node (computing device (100)) and multiple block supporters (BS). may be a volume hash rate of the computing device (100). may be the volume hash rate of the block supporter. Is It could be. The back can be a master node or a block supporter. For example, If this has the largest volume, can become a master node and the rest of the nodes can become block supporters. For example, If has the largest volume, can become a master node and the remaining nodes can become block supporters.

[0058] For another example, the Excess Hash Rate (e-Hash / s) may be a hash rate that is satisfied when the amount staked on multiple nodes included in the blockchain network (200) exceeds a preset condition. Maintaining a stable blockchain ecosystem may be partially proportional to the amount of participants in staking. Accordingly, the computing device (100) may provide an Excess Hash Rate (e-Hash / s) as an incentive for activating the blockchain ecosystem for volumes staked in excess of the minimum staking quantity condition. The Excess Hash Rate may be determined by assigning weights to volumes staked in excess of the preset condition.

[0059] The additive hash rate can be determined based on the mathematical formula below.

[0060]

[0061]

[0062] Here, may be the additive hash rate of the master node group. can be the volume hash value of each master node group. may be a volume hash rate of the computing device (100). Is It could be.

[0063] The time hash rate may be a hash rate related to the time staked on multiple nodes included in the blockchain network (200). While the amount staked on a blockchain node is important, the time function that must be staked on the blockchain node for a certain period of time can also be a very important factor for blockchain stabilization. Accordingly, the computing device (100) may provide an incentive of the time hash rate (t-Hash / s) as an ecosystem activity for blockchain stabilization for the amount of staking that is maintained for a period exceeding a certain period of time. The time hash rate may be determined in such a way that the longer the time staked on multiple nodes included in the blockchain network (200), the higher the value.

[0064] The time hash rate can be determined based on the mathematical formula below.

[0065]

[0066] The control unit (110) can determine the hash rate for reward determination by adding the volume hash rate, the additive hash rate, and the time hash rate. This can resolve issues such as unnecessary energy waste and competition resulting from the block generation process, as well as the rich getting richer and the poor getting poorer in the competition for share.

[0067] Meanwhile, according to some embodiments of the present disclosure, the computing device (100) can determine whether preset conditions are satisfied in a predetermined order. Hereinafter, an example of a method for the computing device (100) according to the present disclosure to determine whether preset conditions are satisfied will be described with reference to FIG. 3.

[0068] FIG. 3 is a flowchart illustrating an example of a method for a computing device according to some embodiments of the present disclosure to determine whether preset conditions are satisfied.

[0069] Referring to FIG. 3, the control unit (110) of the computing device (100) can determine whether a first condition is satisfied (S210). If the first condition is satisfied (S220, Yes), the control unit (110) can generate a first block (S250).

[0070] The first condition may be a condition that is satisfied when the number of transactions not recorded in the block reaches a preset number by receiving the first transaction.

[0071] For example, the preset number may be 1,000. The control unit (110) may generate the first block when the number of transactions not recorded in the block reaches 1,000 by receiving the first transaction.

[0072] If the first condition is not satisfied, the control unit (110) can determine whether the second condition is satisfied (S210). If the second condition is satisfied (S240, Yes), the control unit (110) can generate the first block (S210).

[0073] In other words, the control unit (110) can first determine whether the first condition is satisfied, and then determine whether the second condition is satisfied.

[0074] Specifically, the first condition may be satisfied when the number of unrecorded transactions in a block reaches a preset number. The first condition may be related to the block size. Blocks exceeding the preset number presented in the first condition may be generated in a size that consumes a lot of time and resources for verification. Accordingly, the control unit (110) can determine whether the first condition is satisfied by receiving the first transaction. Conversely, the second condition may be satisfied when the number of unrecorded transactions in a block reaches a preset number. The second condition may be related to the block generation cycle. A transaction generated from at least one node can only be confirmed as a valid transaction after a block is generated. If the first condition is not satisfied and block generation is delayed, it may be difficult for a user to verify whether the transaction has been completed correctly. Accordingly, the control unit (110) can determine whether the second condition is satisfied if the first condition is not satisfied.

[0075] Meanwhile, if the second condition is not satisfied (S240, No), the control unit (110) may not generate the first block.

[0076] Meanwhile, according to some embodiments of the present disclosure, the computing device (100) can improve the bloat of accumulated blocks on a blockchain network (200). For example, the computing device (100) can improve the bloat of blocks by compressing the generated blocks. Hereinafter, an example of a method for a computing device according to the present disclosure to compress blocks will be described with reference to FIG. 4.

[0077] FIG. 4 is a flowchart illustrating an example of a method for a computing device to compress a block according to some embodiments of the present disclosure.

[0078] Referring to FIG. 4, the control unit (110) of the computing device (100) can determine whether at least one second block corresponding to the first block exists when a first block is created (S310).

[0079] Specifically, the first block may be a block generated through step S140. The first block may be a block generated when the first condition or the second condition is satisfied. At least one second block corresponding to the first block may also be a block generated when the first condition or the second condition is satisfied.

[0080] If at least one second block exists, the control unit (110) can determine the sum of the numbers of the first block and at least one second block (S320). If the sum of the numbers reaches a preset number, the control unit (110) can determine a first hash value using the first block and at least one second block (S330).

[0081] For example, it can be assumed that the preset number is 1,000. If the control unit (110) determines that the sum of the numbers of the first block and at least one second block is 1,000, it can determine the first hash value using the first block and at least one second block.

[0082] Hashing can be a process of converting data of arbitrary length into data of fixed length. The hash value can be data of fixed length, which is the result of the process. The control unit (110) can determine the first hash value using a hash function. An example of how the control unit (110) determines the first hash value is described below with reference to FIG. 5.

[0083] The control unit (110) can generate a third block using the first hash value (S340). The third block can be generated in a size expressed in kilobytes.

[0084] Specifically, the first block and at least one second block may be blocks generated when the first condition or the second condition is satisfied. Accordingly, the first block and at least one second block may be generated as blocks expressed in units of minimum size. If the sum of the numbers of the first block and at least one second block reaches 1,000 according to the example described above, the control unit (110) may generate a third block expressed in units of kilo using the first hash value.

[0085] Meanwhile, even if the third block is generated in kilobytes, the size of the third block may not be larger than that of the first block. Specifically, the third block may be a block generated using the first hash value. The first hash value may be data of a fixed length. Therefore, even if the third block is generated based on the first block and at least one second block, the data size of the third block is not larger than that of the first block and at least one second block. Accordingly, even if the number of accumulated transactions increases, the blockchain network (200) can be prevented from becoming oversized.

[0086] According to one embodiment, the control unit (110) can generate the third block based on the mathematical formula below.

[0087]

[0088] According to one embodiment, when a third block is generated, the control unit (110) may determine whether at least one fourth block corresponding to the third block exists. The fourth block may be a block generated in units of Kilo. If at least one fourth block exists, the control unit (110) may determine the sum of the numbers of the third block and the at least one fourth block. If the sum of the numbers reaches a preset number, the control unit (110) may determine a second hash value using the third block and the at least one fourth block. The control unit (110) may generate a fifth block expressed in units of Mega using the second hash value. In the same manner, the control unit (110) may generate a block expressed in units of Giga, Tera, Peta, etc.

[0089] FIG. 5 is a flowchart illustrating an example of a method by which a computing device (100) determines a first hash value according to some embodiments of the present disclosure.

[0090] Referring to FIG. 5, the control unit (110) of the computing device (100) can extract the first block seed value from the seed value for the first block according to a preset rule (S331).

[0091] The seed value or seed phrase may be a collection of randomly generated words. The control unit (110) may extract the first block seed value from the seed value of the first block according to preset rules.

[0092] According to one embodiment, the control unit (110) may extract words from a region according to a preset rule. For example, the seed value of the first block may be a collection of 12 to 24 words. Assuming that the seed value is a collection of 12 words, the first word among the collection of 12 words may be generated such that it exists in the first region located first, and the second word exists in the second region located second. The control unit (110) may determine the first block seed value by extracting the first word existing in the first region according to the preset rule. Alternatively, the control unit (110) may determine the first block seed value by extracting the second word existing in the second region according to the preset rule.

[0093] The control unit (110) can extract at least one second block seed value according to a preset rule from the seed value for each of at least one second blocks (S332).

[0094] For example, the seed value of the second block may be a collection of 12 to 24 words. Assuming that the seed value is a collection of 12 words, the first word among the collection of 12 words may be generated such that it exists in the first area located first, and the second word exists in the second area located second. The control unit (110) may determine the second block seed value by extracting the first word existing in the first area according to a preset rule. Alternatively, the control unit (110) may determine the second block seed value by extracting the second word existing in the second area according to a preset rule.

[0095] The control unit (110) can generate an integrated seed value by connecting the first block seed value and at least one second block seed value in a time series order indicating the connection relationship of each block (S333).

[0096] Specifically, it can be assumed that the first block is a block generated after at least one second block is generated. In this case, the first block may include a block hash value of at least one second block. Through this, it can be confirmed that the first block is a block generated after at least one second block and is a block associated with at least one second block. The control unit (110) can generate an integrated seed value using time series information indicating that the first block was generated after at least one second block.

[0097] For example, the control unit (110) may assume that the first block seed value is determined by extracting the first word present in the first area of ​​the first block. The control unit (110) may assume that the second block seed value is determined by extracting the first word present in the first area of ​​the second block. The control unit (110) may generate an integrated seed value such that the second block seed value precedes the first block seed value.

[0098] The control unit (110) can determine the first hash value through a hash function that takes the integrated seed value as input (S334). A hash function is a function that receives an input value of arbitrary length and produces an output value of fixed length. The control unit (110) can determine the first hash value from the integrated seed value using the hash function.

[0099] According to the above-described configuration, the computing device (100) can generate an integrated seed value by connecting blocks according to a time-series order indicating the connection relationship. Since the first hash value is generated based on the time-series order indicating the connection relationship of each block, the integrity of the connection of data can be proven when the first hash value is verified. According to one embodiment, a preset rule for extracting the first block seed value from the seed value of the first block can be shared with other nodes existing in the blockchain network (200). Accordingly, the computing device (100) and other nodes can more strongly verify the integrity of the data by confirming whether the seed value was extracted from the first region of the first block when verifying the first hash value.

[0100] The description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments without departing from the scope of the present disclosure. Therefore, the present disclosure is not intended to be limited to the embodiments disclosed herein, but is to be construed in the broadest scope consistent with the principles and novel features disclosed herein.

Claims

1. A block generation method performed by a computing device including at least one processor, A step of obtaining a first transaction from a node where a transaction occurred in a blockchain network; When the first transaction is obtained, a step of generating a first block for recording the first transaction based on whether any one of the preset conditions is satisfied; and A step of determining at least one hash rate for determining a reward according to the generation of the first block; Including, The above preset conditions are, Including a first condition that is satisfied when the number of transactions not recorded in the block reaches a preset number by receiving the first transaction, and a second condition that is satisfied when the acquisition time of the second transaction that is acquired first among the transactions not recorded in the block reaches a preset time, At least one of the above hash rates, At least one of a volume hash rate related to the amount staked in a plurality of nodes included in the blockchain network, an additive hash rate satisfied when the amount exceeds a preset condition, and a time hash rate related to the time staked in a plurality of nodes included in the blockchain network. How to create blocks.

2. A block generation method performed by a computing device including at least one processor, A step of obtaining a first transaction from a node where a transaction occurred in a blockchain network; When the first transaction is obtained, a step of generating a first block for recording the first transaction based on whether any one of the preset conditions is satisfied; When the first block is generated, a step of determining whether at least one second block corresponding to the first block exists; A step of determining the sum of the numbers of the first block and the at least one second block, if at least one second block exists; When the sum of the above numbers reaches a preset number, a step of determining a first hash value using the first block and the at least one second block; and A step of generating a third block using the first hash value; Including, The above preset conditions are, Including a first condition that is satisfied when the number of transactions not recorded in the block reaches a preset number by receiving the first transaction, and a second condition that is satisfied when the acquisition time of the second transaction that is acquired first among the transactions not recorded in the block reaches a preset time. How to create blocks.

3. In paragraph 2, If the sum of the above numbers reaches a preset number, the step of determining a first hash value using the first block and the at least one second block is: A step of extracting a first block seed value according to a preset rule from the seed value for the first block; A step of extracting at least one second block seed value according to a preset rule from the seed value for each of the at least one second block; A step of generating an integrated seed value by connecting the first block seed value and the at least one second block seed value in a time series order indicating the connection relationship of each block; and A step of determining the first hash value through a hash function using the integrated seed value as input; Including, How to create blocks.

4. In paragraph 1 or 2, When the first transaction is obtained, a step of generating a first block for recording the first transaction is performed based on whether any one of the preset conditions is satisfied. A step of determining whether the first condition above is satisfied; A step of generating the first block when the first condition is satisfied; If the first condition is not satisfied, a step of determining whether the second condition is satisfied; and A step of generating the first block when the second condition is satisfied; Including, How to create blocks.

Images