Blockchain system and method using a non-competitive consensus algorithm and microchain architecture to ensure transaction processing speed, scalability, and security useful for commercial services
The blockchain system with a non-competitive consensus algorithm and microchain architecture addresses transaction speed, scalability, and security issues, enabling efficient and secure commercial services with high transaction processing speeds and unlimited scalability.
Patent Information
- Application Number
- JP2023112216
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Priority Date
- 2022-12-23
- Filing Date
- 2023-07-07
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2043-07-07
AI Technical Summary
Existing blockchain systems face challenges in transaction processing speed, scalability, and security, making them unsuitable for commercial services due to high energy consumption, centralization, and slow confirmation times, especially with proof-of-work and proof-of-stake consensus algorithms.
A blockchain system utilizing a non-competitive consensus algorithm and microchain architecture, where equalizer nodes participate in consensus and verify transactions, and microchains operate independently for business domains, ensuring high transaction processing speed, scalability, and security.
The system achieves transaction processing speeds of up to 4,500 transactions per second, confirmation times of 1-3 seconds, and almost unlimited scalability, significantly reducing transaction fees and ensuring fault isolation and security for commercial services.
Smart Images

Figure 0007584110000001 
Figure 0007584110000002 
Figure 0007584110000003
Abstract
Description
[Technical field]
[0001] The present invention relates to a block chain system and method using a non-competitive consensus algorithm and a microchain architecture to ensure transaction processing speed, scalability, and security useful for commercial services. [Background technology]
[0002] Blockchain is a distributed computing ledger management technology that can store small data in a P2P chain-based distributed data storage environment linked by hash, which allows safe electronic payments for internet commerce without verification by a third party financial institution. In other words, blockchain is a technology that achieves scalability, decentralization, and security by verifying between the terminal devices (nodes) of participants connected to a network without a central server.
[0003] Bitcoin [Nakamoto, Satoshi. "Bitcoin: A peer-to-peer electronic cash system." URL: https: / / bitcoin.org / bitcoin.pdf(2008)], a representative blockchain, was first released in 2008 by an anonymous developer or group of developers named Satoshi Nakamoto. Bitcoin is the first successful cryptocurrency that attempts to solve the Byzantine General's Problem and double-spending problems through a distributed peer-to-peer network protocol that tracks and verifies transactions through a Proof of Work (PoW) consensus algorithm. In this Proof of Work consensus algorithm, blocks containing cryptocurrency transactions are generated through a process called mining. In the mining process, all miners repeatedly search for a hash value that is smaller than a target value according to the specified mining difficulty using a nonce. The first miner to find a nonce value that meets the above conditions will have the authority to generate a block and will receive a certain amount of cryptocurrency as compensation for generating the block. Over time, this consensus method for proof-of-work consumed huge amounts of energy, and huge mining pools were formed due to collusion among miners, deviating from the initial goal of blockchain and instead leading to further centralization of the network. In addition, Bitcoin's proof-of-work consensus method may reconstruct blocks, and it takes up to an hour to reasonably confirm a settlement to prevent double spending, but Bitcoin does not have an efficient alternative to expand and improve the system, and there are limitations to the development of practical commercial services that can be used.
[0004] Meanwhile, to solve these problems, Ethereum blockchain, an upgraded version of Bitcoin, was developed by Vitalik Buterin in 2013. Vitalik Buterin noticed that blockchain, the core technology used in the virtual currency Bitcoin, can record not only monetary transaction records but also additional information such as contracts, and created the Ethereum Virtual Machine (EVM) using the computing resources owned by many users around the world, and created a system to record various information such as SNS, email, and electronic voting using this platform. In other words, Ethereum is a groundbreaking blockchain that essentially builds the ultimate abstracted foundation layer, records, agrees, executes code, and allows anyone to create distributed applications and smart contracts that can generate ownership, transaction formats, and arbitrary rules for ownership through the blockchain.
[0005] The Ethereum blockchain has some differences from the Bitcoin blockchain, but is similar in many ways. Ethereum, like Bitcoin, has the flaw that all transactions must be processed by all nodes in the network. In other words, Ethereum, which has an advanced proof-of-work method, has problems in that the existing proof-of-work method consumes a huge amount of energy by using a competitive consensus algorithm, and it is difficult to ensure decentralization because validators form another central authority, and it is difficult to apply it to actual commercial services in terms of transaction processing speed (confirmation time to prevent double spending: 6 to 10 minutes). As the number of nodes increases, the number of mutual verifications increases significantly, and the consensus speed becomes even slower, making it difficult to ensure scalability. In addition, gas generated to ensure integrity within Ethereum has the problem that transaction fees become increasingly non-negligible as the value of Ether, the internal currency of the Ethereum platform, rises.
[0006] Various attempts and research are being conducted to improve these problems of existing blockchains and build a better blockchain foundation.
[0007] First, Proof of Stake (PoS) was developed to solve the problems of Proof of Work consensus algorithms [King, Sunny, and Scott Nadal. "Ppcoin: Peer-to-peer cryptocurrency with proof-of-stake." URL: https: / / decred.org / research / king 2012.pdf(2012)]. Proof of Stake is a general term for consensus algorithms in which verifiers have decision-making power in proportion to the stake of cryptocurrency they hold. Unlike Proof of Work, Proof of Stake does not require computationally (energy) intensive work, solving the problem of huge power consumption required in Proof of Work and preventing 51% attacks more effectively than Proof of Work. However, Proof of Stake still has problems such as transaction processing speed, decentralization, and security, and related research is being continuously conducted to solve these problems.
[0008] Peercoin [King, Sunny, and Scott Nadal. "Ppcoin: Peer-to-peer crypto-currency with proof-of-stake." URL: https: / / decred.org / research / king2012.pdf(2012)] is the first cryptocurrency to introduce a proof-of-stake consensus algorithm. It solved the problem of huge energy consumption in pure proof-of-work by combining a proof-of-stake method that introduces coin age with proof-of-work. However, the checkpoints that prevent the problem of long-distance attacks that maliciously increase the coin holding period and make a new chain the main chain are arbitrarily selected by the developers, which reduces the decentralization of Peercoin.
[0009] Nxt [Popov, Serguei. "A probabilistic analysis of the nxt forging algorithm." Ledger 1 (2016): 69-83] is the first cryptocurrency implemented purely with a proof-of-stake method (using only the proof-of-stake consensus algorithm). In order to participate in the block generation process, one account must stake their stake for the duration of 1,440 blocks to be generated, and if they find a hash value that is smaller than the base target value for block generation, they can generate a block. However, since the base target value is generated based on the value of the previous block, there is a problem that if the creator of the previous block intentionally inserts a value that is advantageous to them, a monopoly may occur.
[0010] Ethereum announced Ethereum 2.0 (now known as the "upgrade") in September 2022, heralding the shift of the consensus algorithm from proof-of-work to proof-of-stake. Ethereum 2.0 aims to solve this problem by using a "method of punishing those who vote for the wrong chain." In the course of discussion on the specific consensus algorithm, it was split into Casper FFG (friendly finality gadget) led by Vitalik Buterin, which is a mixture of proof-of-work and proof-of-stake, and Casper CBC (correct by construction) led by Vlad Zamfir, which uses pure proof-of-stake. These make the chain that the most validators prefer based on the most recent messages of the validators the main chain, which seems similar to the method of making the longest chain the main chain, but has the advantage that a small number of validators will never be able to win against a large number of validators even if they behave maliciously when frequent forks occur.
[0011] Secondly, as the size of data is becoming increasingly huge, the capacity of blocks needs to be excessively large to combine all the data into the blockchain, which results in the disadvantages of significantly slower speeds and higher fees. Various research is being conducted to overcome this.
[0012] Segregated Witness (SegWit) is a method for Bitcoin to increase scalability and TPS (Transactions per Second). By separating the transaction information and signature from the components of a Bitcoin transaction, removing the part occupied by the signature, which is only necessary when validating a transaction, and filling it with transaction information, it is possible to store a significantly larger amount of transaction information.
[0013] The method of expanding the block size is literally to expand the size of the block and increase the number of transactions that can be included in one block. Although it is the simplest and easiest method to implement, it means that more transactions must be processed per unit time, so there is a drawback that the cost burden may lead to centralization by miners.
[0014] Sharding is an on-chain method that divides the network into shard units that divide transactions horizontally regardless of business domain, stores blockchain data in a distributed manner, and divides the data that one node needs to verify. The existing Ethereum verification method is slow because all nodes must store the entire block and process transactions, but the sharding method divides and stores blockchain data on a shard basis and processes transactions, reducing the amount of data that one node needs to verify and improving the overall speed. However, as the number of shard units increases, transmission between multiple shards can actually degrade performance due to the increase in inter-shard transactions.
[0015] Ethereum data is stored in the form of a Merkle Patricia tree, which is a combination of a Merkle tree and a Patricia tree and has the characteristics of key-value mapping and each node having a hash value. The Merkle Patricia tree is composed of three types of nodes: extension nodes, branch nodes, and leaf nodes, and is combined with a B+tree to dualize the tree used depending on the type of data stored and the situation, thereby increasing the space efficiency and data search efficiency of the branch node. When the amount of data coming in from the Merkle Patricia tree is small, the free space in the branch node can be reduced and basic search to sequential search can be performed efficiently. When the amount of data is large, the existing Merkle Patricia tree is used because the depth of the tree can be deepened by using the above tree.
[0016] However, none of the conventional blockchain systems currently being used by current users or being further researched have the transaction processing speed required for commercial services, and they either have limited scalability or experience significant slowdowns when expanding. Summary of the Invention [Problem to be solved by the invention]
[0017] The present invention aims to improve the problems of the conventional technology as described above, and aims to provide a blockchain system (blockchain system name: Equilibrium) and method using a non-competitive consensus algorithm and microchain architecture that ensures transaction processing speed, scalability, decentralization, and security useful for commercial services by preventing defects in the entire commercial blockchain network from exceeding a pre-set percentage and allowing the system to operate normally.
[0018] In addition, Equilibrium, the blockchain system of the present invention, proposes a new non-competitive agreement and microchain architecture to ensure transaction processing speed, scalability, decentralization, and security useful for commercial services, and aims to provide a blockchain solution for decentralized commercial services that increases transaction processing speed, can be expanded almost indefinitely, significantly reduces transaction fees, and solves storage problems. [Means for solving the problem]
[0019] One embodiment of the present invention relates to a blockchain system and method using a non-competitive consensus algorithm and microchain architecture to ensure transaction processing speed, scalability, decentralization, and security useful for commercial services.
[0020] First, a blockchain system using a non-competitive consensus algorithm according to one embodiment of the present invention achieves high transaction processing speeds and uses a proof-of-stake consensus algorithm. Nodes according to one embodiment of the present invention may include non-Equalizer nodes that do not participate in consensus and only share the ledger, and Equalizer nodes that are connected to the non-equalizer nodes in the vicinity and other equalizer nodes in the vicinity, collect information from other nodes, participate in consensus, and perform verification.
[0021] Among the equalizer nodes that participated in the agreement, the block proposer votes for the proposed block, and the vote is agreed upon by the number of votes exceeding 2 / 3 of the number of equalizer nodes that have stakes in a particular proposal that plays the role of a validator in various methods of stake-verifying agreement algorithms. If the number of equalizer nodes does not exceed 2 / 3 during the voting stage, voting will not be stopped and voting will continue in the next round until the number of equalizer nodes exceeds 2 / 3.
[0022] Here, to create a node through an account and become an equalizer, you must stake more than the minimum staking amount from the node's account balance. Nodes without stakes act as non-equalizers.
[0023] In addition, according to an embodiment of the present invention, a newly generated transaction is assigned to each equalizer node, and a mempool, which is a temporary transaction storage in which a transaction including a key value obtained by converting a hash of an unagreed transaction of the equalizer node and a signature of a private key, is stored. If a transaction for generating a new block is not in the mempool, the mempool adds the transaction and propagates it to other equalizer nodes, and if the transaction is present, no action is taken. The transaction in the mempool cannot be forged because it includes the signature of the private key that caused the transaction, and the equalizer node that receives the transaction and stores it in the mempool propagates the transaction stored in the mempool to other equalizer nodes, so it cannot be deleted arbitrarily. Even if the node is powered off and the memory is initialized, all transactions are propagated to other equalizer nodes, so no specific transaction is missing.
[0024] At this time, according to one embodiment of the present invention, the equalizer node can receive the transaction through a transaction request regardless of the agreement process, perform a validity check on the received transaction, and then store the transaction in the member pool.
[0025] Next, the blockchain system using the microchain architecture according to an embodiment of the present invention applies an idea based on the microservice architecture of a conventional computer network to a blockchain, and stores and processes transactions for each business domain, thereby minimizing interference, i.e., the microchain can operate in a state of fault isolation and minimal interference while unlimitedly increasing the scalability of business in commercial services, so that the transaction processing speed does not decrease, and includes a network that provides blockchain services, and the network can be configured in a microchain architecture including a blockchain mainnet that communicates with other microchains according to an inter-chain communication protocol and issues or burns coins, and a plurality of microchains in which smart contracts are concluded using coins on each mainnet according to the area of each transaction. The microchain architecture must go through the mainnet to connect each microchain, and the information transmitted at this time is limited to tokens and coins.
[0026] Meanwhile, a blockchain method using a non-competitive consensus algorithm and a microchain according to an embodiment of the present invention may include a propose stage in which an equalizer node selected as a block proposer generates a block including a transaction for consensus and propagates it to other equalizer nodes in the above-mentioned blockchain system; a prevote stage in which other equalizer nodes that receive the block (transaction) verify the validity of the received block (transaction) and propagate prevotes to other equalizer nodes when the verification is completed; a vote stage in which, when equalizer nodes exceeding a pre-set ratio have propagated prevotes, each equalizer node votes on the proposal of the equalizer node to make the block (transaction) conform to the consensus and propagates the voting result signed with a private key to other equalizer nodes; and a commit stage in which, when the voting results of equalizer nodes exceeding the pre-set ratio are collected and the block (transaction) is confirmed, each equalizer node executes the transaction in the proposed block, confirms the proposal, and enters it in a database. The block proposed in the voting stage is verified without any other blocks being stacked on it, a vote is held for the proposed block, and after a quorum of votes is received and complete agreement is reached, the block is stacked on top of the proposed block and a new block is generated.
[0027] According to one embodiment of the present invention, the method may further include a step of receiving a transaction when a transaction request is made regardless of the progress of the agreement step, and storing the transaction in the member pool of the requested equalizer node when a validity check on the transaction is completed, and transmitting the transaction stored in the member pool to other equalizer nodes.
[0028] According to an embodiment of the present invention, before the proposal step, each equalizer node may obtain a priority in a round robin manner, and the equalizer node having the highest assigned priority may be selected as a block proposer.
[0029] The proposal step according to one embodiment of the present invention may include a step of generating a transaction list by integrating only transactions having account nonce that sequentially increase from the current account nonce among transactions stored in the member pool of each equalizer node to generate transactions for agreement, and a step of hashing a proposal including height, round, and block for the transaction list and signing it with a private key.
[0030] The above vote according to an embodiment of the present invention is agreed upon by a vote number exceeding 2 / 3 of the number of equalizer nodes that have an interest in a particular proposal that serves as a verifier in various methods of proof-of-stake agreement algorithms. This allows the present invention to have a simple agreement procedure and quick processing, so that even nodes with low-spec computers can participate in the agreement procedure of the present invention.
[0031] In the commit step according to an embodiment of the present invention, when the voting results of the equalizer nodes exceeding the preset ratio are collected and the transaction is confirmed, each equalizer node executes the transaction in the block proposed by the equalizer node and enters the confirmed proposal into the database. If the voting results of the equalizer nodes exceeding the preset ratio are not collected or a valid proposal is not accepted within the preset time, the equalizer node may increase the round by one step and re-execute from the proposal step. Effect of the Invention
[0032] According to the blockchain system using a non-competitive consensus algorithm and a micro-chain architecture for fault isolation and interference minimization that is useful for commercial services of the present invention, the system can operate normally unless defects exceed a pre-set percentage of the total, and it has the effect of significantly increasing the transaction processing speed (e.g., 4,500 tps) in a single micro-chain, significantly shortening the confirmation time (e.g., 1 to 3 seconds), achieving almost unlimited scalability, significantly reducing transaction fees, and providing a blockchain solution for distributed commercial services that solves storage problems.
[0033] Furthermore, the present invention has the advantage that a node having a low-spec computer can also participate in the agreement procedure due to the simple agreement procedure and rapid processing. [Brief description of the drawings]
[0034] [Figure 1] 1 illustrates an account state structure for ensuring transaction processing speed and scalability useful for commercial services according to one embodiment of the present invention. [Diagram 2] 1 illustrates a transaction structure for ensuring transaction processing speed and scalability useful for commercial services according to one embodiment of the present invention. [Diagram 3] 1 shows a block structure for ensuring transaction processing speed and scalability useful for commercial services according to one embodiment of the present invention. [Figure 4] 1 shows a microchain architecture of a blockchain system using microchains to ensure transaction processing speed and scalability useful for commercial services according to one embodiment of the present invention. [Diagram 5] This embodiment of the present invention shows a microchain structure consisting of non-equalizer nodes and equalizer nodes in a blockchain system using a non-competitive consensus algorithm and microchain to ensure transaction processing speed and scalability useful for commercial services. [Figure 6]1 shows a flowchart of a blockchain method using a non-competitive consensus algorithm and a microchain to ensure transaction processing speed and scalability useful for commercial services according to an embodiment of the present invention. [Figure 7] 1 illustrates a non-competitive consensus algorithm and a consensus process of a blockchain method using a microchain to ensure transaction processing speed and scalability useful for commercial services according to an embodiment of the present invention. [Figure 8] This shows the proposed steps of a blockchain method using a non-competitive consensus algorithm and microchains to ensure transaction processing speed and scalability useful for commercial services according to one embodiment of the present invention. [Figure 9] 1 illustrates a voting step of a blockchain method using a non-competitive consensus algorithm and a microchain to ensure transaction processing speed and scalability useful for commercial services according to an embodiment of the present invention. [Figure 10] 1 illustrates a commit stage of a blockchain method using a non-competitive consensus algorithm and a microchain to ensure transaction processing speed and scalability useful for commercial services according to an embodiment of the present invention. [Figure 11] 1 illustrates an inter-microchain interworking solution architecture according to an embodiment of the present invention. [Figure 12] FIG. 1 illustrates a diagram showing transaction processing times for the Equilibrium blockchain network according to an embodiment of the present invention. [Figure 13] 1 is a graph showing the number of TPS by node specifications according to the load count and processing volume applied to an Equilibrium blockchain network according to an embodiment of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0035] The above-mentioned aspects and further aspects are embodied by the embodiments described with reference to the accompanying drawings.
[0036] The embodiments of the present invention are illustrated for the purpose of explaining the technical ideas and business methods of the present invention, and the scope of the invention is not limited to the embodiments presented below or the specific descriptions of these embodiments.
[0037] All technical and scientific terms used in the present invention have the meanings commonly understood by those having ordinary skill in the art to which the present invention belongs, unless otherwise defined. This may change depending on the intention or precedent of a technician in the field, the emergence of new technology, etc. Therefore, the terms used in the present invention should be defined based on the meanings that the terms have and the entire contents of the present invention, rather than simply the names of the terms. All terms used in the present invention are selected for the purpose of more clearly describing the present invention, and are not selected to limit the scope of the rights of the present invention.
[0038] As used herein, expressions such as "including," "comprising," "having," and the like should be understood as open-ended terms that include the possibility of including other embodiments, unless otherwise limitedly stated in the phrase or sentence in which the expression is included.
[0039] Unless otherwise specified, singular expressions described in the present invention can include plural meanings, and this also applies to singular expressions described in the claims.
[0040] Each block in the drawings may represent a physical component in some cases, but may also represent a portion of the functionality of one physical component or a logical representation of functionality across multiple physical components. In some cases, the entity of a block or a portion thereof may be a set of program instructions. Such blocks may be implemented in whole or in part by hardware, software, or a combination of both.
[0041] It is understood that the components of each embodiment can be combined in various ways within the embodiments, unless otherwise stated or mutually inconsistent.
[0042] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS In the following, with reference to the accompanying drawings, the present invention will be described in detail so as to enable those skilled in the art to easily carry out the present invention. However, the present invention may be embodied in various different forms and is not limited to the embodiments described herein.
[0043] Figures 1 to 3 respectively show the "account state structure," "transaction structure," and "block structure" of a blockchain system that uses a non-competitive consensus algorithm to ensure transaction processing speed, scalability, decentralization, and security useful for commercial services according to one embodiment of the present invention.
[0044] As shown in FIG. 1, in one embodiment, in this blockchain network, a "state" is composed of objects called "accounts", and each node's account is represented by a 20-byte address starting with "0x", controlled by a private key, and can include fields such as a nonce, balance, code, and storage.
[0045] The "nonce" indicates the number of transactions that have been agreed upon among transactions made in the account up to now, and can prevent duplication or omission of transactions made in a specific account through the nonce, thereby preventing replay attacks in which other participants in the network duplicate transactions of a specific account, and preventing omissions so that transactions of a specific account are processed sequentially.
[0046] The "balance" is the balance of coins used as currency in the network, and when coins are staked in each node's account, the node can become an equalizer node. Unlike the Ethereum blockchain account, the balance is divided into the mainnet 120 balance and the microchain balance, which do not interfere with each other.
[0047] The "hash code" can represent the account code of a smart contract, and the code of the smart contract can be called every time a transaction is executed.
[0048] The above "storage" refers to a storage location that indicates the status of an account.
[0049] In one embodiment, to change the "account state", a new transaction must be generated and signed with a private key. When a new transaction is sent to the blockchain system, the system checks the account state to apply the transaction, and if the conditions are correct, the system executes the transaction to change the state.
[0050] Also, as shown in FIG. 2, a transaction according to one embodiment of the present invention represents a signed data package for an account to request a state change within the network, and each transaction may include chainID, from, to, data, nonce, value, and signature fields.
[0051] The 'chainID' field indicates the target chain ID and can prevent transaction replay attacks on other chains. The 'from' field is the account that generates the transaction, and the 'to' field is the account to which the transaction is delivered.
[0052] The above "data" is a field for executing account code to change the account status when the account is a CA account, one of the two types of accounts, EOA (External Owned Account) and CA (Contract Account). Here, the difference between EOA and CA is in the "hash code" field and the "storage" field. EOA simply stores the remaining balance of the account, so the hash code and storage fields are empty, whereas CA can store the contract code and contract status in the hash code and storage fields, respectively.
[0053] The 'value' field indicates the amount of coins to be transferred to the target account, and the 'signature' (V, R, S) is a common standard for coins and can serve to verify the origin of the transaction.
[0054] As shown in Fig. 3, the fields included in the block structure, which is a data unit that stores the results of the agreement and verified transactions according to an embodiment of the present invention, are: "parent hash" is the most recent block hash (the highest in the current blockchain network), and "parent hash", "time", and "bloom" mean values used as standards in blockchain technology; "coinbase" is the account address of the node that generates a proposal including a transaction for agreement; "root" is the Merkle hash of the state; and "Tx hash" is the hash of the transaction included in the block.
[0055] When a transaction of a block is processed, a receipt is generated for each transaction, which includes the execution results and events during the processing of the transaction, where 'receipt hash' indicates the SHA-256 hash of the receipt for the transaction of a particular block, 'number' is the index of the block, 'gas limit' is a value that defines the maximum gas limit that all transactions of the block can use, and 'gas used' is the total gas used for the transactions of the block. For the Equilibrium network consensus of the present invention, the block hash value can be calculated using the hash of the block header. The items 'round', 'Validator', and 'Votes' are added to 'extraDATA', where 'round' is a natural number value indicating the time when the block is agreed upon and generated, and if a quorum or more is not obtained in the voting stage for the validation of the proposed block, a re-vote is performed to ensure the liveness of the proposed block (transaction) within a short period of time.
[0056] According to an embodiment of the present invention, there are two types of nodes: an equalizer node 220 and a non-equalizer node 210. A node can be an equalizer node 220 or a non-equalizer node 210 according to the "staking policy" of the network.
[0057] To create a node through an account and become an equalizer node 220, it is necessary to stake coins equal to or greater than the minimum staking amount from the node's account balance to have an interest. All equalizer nodes 220 that have staked coins equal to or greater than the minimum staking amount have the same voting power regardless of the difference in staking amount, which allows the present invention to quickly and easily determine the block proposer 221. In addition, since not all nodes participate in the agreement, but only equalizer nodes 220 that have staked coins equal to or greater than the minimum staking amount participate in the agreement, the voting time can also be shortened. The equalizer node 220 that acts as a validator has the authority to participate in the agreement with other equalizer nodes 220 in the network and to read and write the ledger.
[0058] According to one embodiment of the present invention, the equalizer nodes 220 do not notify the result of processing a request received without mutual agreement, but can synchronize between the equalizer nodes 220 by responding with data related to the request processed during the agreement process.
[0059] Meanwhile, nodes without stakes act as basic non-equalizers. Non-equalizer nodes 210 are nodes that do not participate in consensus but only share the ledger in real time, and are used by secondary operators who want to use data in the network and provide additional services.
[0060] The equalizer node 220 is connected to the non-equalizer nodes 210 and other equalizer nodes 220 in the vicinity, and collects information from other nodes, participates in consensus, and performs verification.
[0061] The equalizer node 220, which acts as a validator, directly participates in consensus with other equalizer nodes 220 in the network, has the authority to read and write the ledger, generates blocks, and plays a role in maintaining the network. Since the non-equalizer node 210 does not participate in consensus and only shares the ledger in real time, the networking, data reception and confirmation process can be reduced. In other words, the transaction processing speed can be increased.
[0062] According to one embodiment of the present invention, the equalizer nodes 220 do not notify the result of processing a request received without mutual agreement, but can synchronize between the equalizer nodes 220 by responding with data related to the request processed during the agreement process.
[0063] Also, according to an embodiment of the present invention, a mempool, which is a temporary transaction storage area, may be assigned to each equalizer node 220 and stores transactions including a key value obtained by converting a hash of an unagreed transaction of the equalizer node 220 and a signature of a personal key. If a transaction of a new block is not in the mempool, the mempool adds the transaction and propagates it to other equalizers, and if the transaction is present, no action is taken. The mempool transaction cannot be forged because it includes the signature of the personal key that caused the transaction, and the equalizer node 220 that receives the transaction and stores it in the mempool propagates the transaction stored in the mempool to other equalizer nodes 220, so it cannot be deleted arbitrarily. Even if the node is powered off and the memory is initialized, all transactions are propagated to other equalizer nodes 220, so no specific transaction is missing.
[0064] At this time, according to one embodiment of the present invention, the equalizer node 220 can receive the transaction through a transaction request regardless of the agreement process, perform a validity check on the received transaction, and then store the transaction in the member pool.
[0065] The blockchain system using a non-competitive consensus algorithm and microchains 110 to ensure transaction processing speed, scalability, decentralization, and security useful for commercial services according to an embodiment of the present invention includes a network that provides blockchain services, and the network has multiple mainnets 120 that issue and burn coins to maintain the entire network, and multiple microchains 110 generated according to various business fields on the mainnet 120. The mainnet 120 can be configured with a microchain architecture that communicates with all microchains 110 through an inter-chain communication protocol called a linking solution.
[0066] In the conventional blockchain, all business smart contracts operate on one chain, and all nodes simultaneously execute the same business logic of the smart contract, which causes interference between smart contracts with different processing speeds, but the Equilibrium network of the present invention does not interfere with each other except when different business domains must interact with each other. That is, the microchain 110 according to one embodiment of the present invention executes business logic independently without interfering with each other, and different business logics that execute smart contracts corresponding to the microchain 110 can be executed independently. As a result, the Equilibrium network of the present invention can be horizontally expanded (scaled out) almost without limit without slowing down the transaction processing speed.
[0067] FIG. 4 shows a microchain architecture of a blockchain system for ensuring transaction processing speed, scalability, decentralization, and security useful for commercial services according to one embodiment of the present invention. One embodiment of the present invention will be described with reference to FIGS. 5 to 11.
[0068] As shown in FIG. 4, a network according to an embodiment of the present invention may be composed of a plurality of microchains 110, a mainnet 120 is connected to the A to F microchains 110, and each A to F microchain 110 may be executed independently and separately from each other.
[0069] Each of the A to F microchains 110 provides a separate blockchain service and can build a different business domain. As a result, even though smart contracts with different processing speeds are performed for each blockchain service, they can be executed independently without causing interference between the smart contracts, and since adding microchains 110 does not affect the transaction processing speed, the network according to an embodiment of the present invention can be expanded horizontally and continuously without limit by continuing to add microchains 110 as necessary.
[0070] In the conventional Ethereum technology, layer 1 and layer 2 are subordinate to each other in a hierarchical relationship, and layer 2 can execute logic by securing the trust of layer 1, and layer 2 cannot be expanded without securing the consent of layer 1. However, according to an embodiment of the present invention, the mainnet 120 that issues or burns coins communicates with each microchain 110 according to the issued coins, and each A to F microchain 110 secures its own trust, and can form and expand additional microchains without the consent of the mainnet 120. In other words, the mainnet 120 and the microchain 110 are loosely connected in an equal relationship, and each microchain 110 can independently execute its own business logic, and scalability can be ensured by connecting with additional microchains. Referring to FIG. 4 as an example, the F microchain is indirectly connected to the mainnet 120 without being directly connected, and can be expanded by connecting a separate microchain that is directly connected to itself.
[0071] Meanwhile, each of the A to F microchains 110 according to an embodiment of the present invention guarantees its own reliability, so even if some business domains are attacked or a failure occurs due to network overload, the remaining microchains 110 excluding the business domain can isolate the failure. For example, even if a failure occurs in the A microchain 110, each of the B to F microchains 110 can execute independent business logic without interference.
[0072] Therefore, according to one embodiment of the present invention, the multiple microchains 110 are loosely connected to the mainnet 120 in an equal relationship with mutual trust, and the mainnet 120 does not bear all the trust, so scalability can be easily ensured, and each microchain 110 only needs to withstand its own business logic that is performed independently. This makes it possible to operate with only a low-spec computer that can withstand the business logic of each microchain 110.
[0073] In addition, according to one embodiment, at least one microchain 110 can be expanded to a new microchain that is not directly connected to the mainnet 120.
[0074] At this time, the mainnet 120 can communicate with the microchain 110 through a linking solution such as an inter-chain communication protocol.
[0075] According to one embodiment of the present invention, the microchains 110 are formed to operate according to their respective domains, and therefore perform business logic independently without interfering with each other, except when they must interact with each other, and different business logics that execute smart contracts corresponding to the microchains 110 can be executed respectively.
[0076] The microchain 110 divides transactions based on business models, and transactions occurring within the microchain 110 do not affect other microchains 110 and are only used for internal block generation.
[0077] Sharding, which can be compared to the microchain 110, is a method of dividing transactions horizontally regardless of the business domain, and when the same transaction is performed, transmission between multiple shards is required. In this case, the inter-shard transactions increase, which may actually decrease performance, which is different from the microchain architecture of the present invention.
[0078] In one embodiment, the microchain 110 allows for inter-ledger communication to allow for asset transfers between chains.
[0079] Also, as shown in FIG. 5, the microchain architecture according to one embodiment of the present invention may include a non-equalizer node 210 that does not participate in consensus and only shares the ledger, and an equalizer node 220 that is connected to the surrounding non-equalizer nodes 210 and other surrounding equalizer nodes 220, collects information from other nodes, participates in consensus, and performs verification.
[0080] The equalizer node 220 and the non-equalizer node 210 can separate the nodes that provide the service of maintaining the network and the nodes that participate in the network according to their respective roles, and can reduce the process of receiving and confirming networking data, i.e., the transaction processing speed can be increased.
[0081] In this case, the connection between the equalizer node 220 and other equalizer nodes 220 and the non-equalizer node 210 may be configured by a request and a response.
[0082] In a state where a connection is established by the request and response, the equalizer nodes 220 process a request received without mutual agreement and respond with data related to the request processed in a subsequent agreement process, thereby performing synchronization between the equalizer nodes 220. At this time, even partial synchronization can be processed synchronously.
[0083] In addition, according to one embodiment of the present invention, a mempool may be included which is assigned to each equalizer node 220 and stores transactions including a key value converted from a hash of an unagreed transaction of the equalizer node 220 and a signature of a personal key.
[0084] In one embodiment, the member pool may be a memory, and the memory may be provided to an equalizer node 220 participating in the network to allocate a temporary transaction storage location. The member pool includes a signature of a personal key, so that it can be prevented from being forged, and temporary transactions stored in the member pool can be propagated to other equalizer nodes 220 and cannot be arbitrarily deleted. Even if the node is powered off and the memory is initialized, it is possible to prevent the loss of a particular transaction by using the member pools of other equalizer nodes 220.
[0085] At this time, the equalizer node 220 receives a transaction via a transaction request regardless of the consensus process, and the received transaction may undergo a transaction validity check, including whether the size is valid, whether the data structure is valid, whether it is equal to or greater than the sender's current nonce value, whether the sender's address is valid, whether the sender's signature is valid, whether there is a smart contract to be called, what functions are included in the smart contract, whether the elements of the smart contract to be called are valid, etc. If all transaction validity checks are passed, the transaction may be stored in the member pool of the requested node.
[0086] Using the network configuration described above, the equalizer nodes 220 can reach a consensus.
[0087] As shown in FIG. 6, the blockchain method using a non-competitive consensus algorithm to ensure transaction processing speed, scalability, decentralization, and security useful for commercial services according to one embodiment of the present invention can be broadly composed of four steps: propose, prevote, vote, and commit.
[0088] In the above-mentioned blockchain system, Equalize, which adjusts the disorder of the ledger, selects an equalizer node 220 that is a block proposer 221, and the equalizer node 220 selected as the block proposer 221 generates a block including a transaction for consensus and propagates it to other equalizer nodes 220 in a proposal step (S301). The other equalizer nodes 220 that receive the block verify the validity of the received block (transaction) and, when the verification is completed, propagate the pre-vote to other equalizer nodes 220 in a pre-vote step (S302). The method may include a voting step (S302), a voting step (S303) in which, when an equalizer node 220 exceeding a pre-set percentage propagates a pre-vote, the equalizer node 220 votes on the proposal to make the block (transaction) conform to the consensus and propagates the voting result signed with a private key to other equalizer nodes 220, and a commit step (S304) in which, when the voting results of the equalizer nodes 220 exceeding the pre-set percentage are collected and the block is finalized, each equalizer node 220 executes the proposed transaction to generate the block.
[0089] The pre-voting stage votes on the validity of the proposals in a true / false manner, which is a non-arithmetic logic operation.
[0090] In the voting phase, the proposed block is verified without any other blocks being added to it, a vote is taken for the proposed block, and after a quorum of votes is received and complete agreement is reached, other blocks are added to the proposed block to generate a new block.
[0091] In this case, the blocks generated in the voting stage are not added to previously generated blocks, but are generated separately by the pre-votes and votes on the proposals.
[0092] More specifically, since all equalizer nodes 220 have the same voting power without communication with other nodes, it is possible to more quickly determine who will be the block creator at the previous stage of the proposal stage. In addition, in the PoW model, when a block creator creates a block containing a transaction, other verifiers then verify the entire block by stacking the next transaction or other blocks, so the block selection should have a length of 6 blocks in the case of Bitcoin and 12 to 20 blocks in the case of Ethereum, but the present invention does not stack blocks separately, but checks whether the block contains a transaction that the block proposer 221 has verified legitimately, and the determined block is created by exceeding the quorum of 2 / 3 through voting, and is immediately determined to be a legitimate block, so that the next block does not affect the determination of the legitimate block, and the block determination time can be significantly shortened.
[0093] In other words, the present invention propagates the proposed block to the network without stacking other blocks on the proposed block immediately at the time of verification in the voting stage. After that, the proposed block receives votes, and after receiving votes exceeding the quorum and reaching a complete agreement, other blocks are stacked on the proposed block to generate a new block. On the other hand, in the POW method such as Bitcoin and Ethereum, a new block is stacked on the proposed block immediately at the time of verification, and the block is confirmed by selecting the blockchain that is stacked higher, which is a big difference from the present invention in terms of traffic within the network.
[0094] In addition, in the present invention, when the minimum staking amount is met, all nodes have the same voting power, which strengthens decentralization and increases the difficulty for an external network attacker to control the network by attacking more nodes at the same time, thereby significantly enhancing security. Meanwhile, the conventional staking-based pBFT algorithm has a relatively faster processing speed than the conventional consensus algorithm, but has a structure in which the more the staking amount, the more compensation is obtained, which may cause a polarization of the rich and poor, which may hinder the decentralization of the network. Furthermore, the conventional pBFT consensus algorithm (PoS), in which a high staking amount can exercise a high voting power, has relatively weak security because an external attacker can easily grasp the attack point and attack a node with a high staking amount to more effectively control the network. For example, an external network attacker can attack at any time by identifying 21 nodes with a high staking amount against the conventional staking-based pBFT algorithm.
[0095] Furthermore, according to one embodiment of the present invention, equalizer nodes 220 that have staked coins equal to or greater than the minimum staking amount are randomly determined among equalizer nodes 220 having the same voting power according to a minimum number of nodes calculated to withstand Byzantine failures, and the determined equalizer nodes 220 equal to or greater than the minimum number of nodes can participate in consensus and verify the smart contract.
[0096] In order to prevent malicious nodes from invalidating the network, a minimum number of nodes participating in voting is set, and the set number of nodes is randomly determined. The method of randomly determining nodes can be determined by various known methods and is not limited.
[0097] In addition, the reason why the present invention performs two rounds of voting, a pre-voting stage and a voting stage, is to double the protection against malicious nodes from invalidating the network.
[0098] According to one embodiment of the present invention, the method may further include a step of receiving a transaction when a transaction request is made, regardless of the progress of the agreement step, and storing the transaction in the member pool of the requested equalizer node 220 when validity checking for the transaction is completed, and a step of transmitting the transaction stored in the member pool to other equalizer nodes 220.
[0099] In addition, while conventional proof-of-work consensus algorithms require high-spec computers to mine for generating new blocks, the present invention has the effect of allowing nodes with low-spec computers to participate in the consensus procedure through simple consensus procedures and rapid processing. In other words, any node with a low-spec computer can easily join the blockchain system of the present invention and participate in the consensus procedure.
[0100] As shown in FIG. 7, before the proposal step S301 according to one embodiment of the present invention, a step (Proposer Election) may be included in which each equalizer node 220 obtains a priority by a round robin method and the equalizer node 220 with the highest assigned priority is selected as the block proposer 221.
[0101] The block proposers 221 for a particular round may be randomly selected from a certain number of equalizer nodes 220 randomly selected from among all the equalizer nodes 220.
[0102] If the nodes maintain the same ledger, then all proposers selected by the equalizer node 220 in a particular round will be the same. The proposer node generates a proposal, and other nodes must wait for the proposer node's proposal.
[0103] As one embodiment, the 'proposal step S301' may include a step of generating a transaction list by integrating only transactions having account nonces that sequentially increase from the current account nonce among the transactions stored in the member pool of each equalizer node 220 to generate transactions for agreement.
[0104] For example, if account A’s current nonce is 20, a transaction list can be generated with transactions whose source address is the A address with transaction nonces 20, 21, and 22.
[0105] At this time, as shown in FIG. 8, the transactions stored in the member pool assigned to each equalizer node 220 can be transmitted to the equalizer node 220 that is the proposer, and the proposer can check the nonce value of the account and generate a transaction list.
[0106] According to one embodiment of the present invention, the method may further include receiving a transaction when a transaction request is made regardless of the progress of the agreement step, and storing the transaction in the member pool of the requested equalizer node 220 when validity checking for the transaction is completed, and transmitting the transaction stored in the member pool to other equalizer nodes 220.
[0107] In other words, the equalizer node 220 may transmit the transaction to the proposer equalizer node 220 to carry out the agreement phase, or in another embodiment, the equalizer node 220 may store the transaction that has completed the above-mentioned validation check in a member pool and transmit the stored transaction to other equalizer nodes 220, regardless of the agreement phase.
[0108] Further, in one embodiment, the method may include hashing and signing a proposal including the height, round, and block for the transaction list with a private key.
[0109] The proposal contains height, round, block, and signature fields for the transactions included in the transaction list, and the signature can be signed with a private key before being propagated to other equalizer nodes 220.
[0110] In one embodiment, the equalizer node 220 selected as the proposer can broadcast a proposal, which is a transaction for agreement, to propagate it to other equalizer nodes 220.
[0111] Meanwhile, the "pre-voting stage S302" is a stage for determining which proposal to vote for, and the equalizer node 220 that receives a proposal from a proposer can verify the validity of the proposal.
[0112] For example, it may be possible to verify whether the proposal submission was received from a valid proposer, whether the proposal contains valid blocks, and whether the proposal signature is valid.
[0113] In the pre-voting stage, voting on the validity of proposals is done on a true / false basis, which is a non-arithmetic logic operation.
[0114] 8, when a proposal is deemed valid, an equalizer node 220 may propagate pre-votes to other equalizer nodes 220, and when there are pre-votes for a particular proposal that exceed 2 / 3 of the total number of equalizer nodes 220, the proposal may be deemed valid and a voting step S303 may be performed. That is, the pre-set percentage may mean 2 / 3 of the total number of equalizer nodes 220 or a randomly selected number from a certain number of equalizer nodes 220 randomly selected.
[0115] In the "voting step S303" according to an embodiment of the present invention, the equalizer node 220 can also propagate the voting result to other equalizer nodes 220, as shown in FIG.
[0116] In this case, the voting result can mean that the vote, including the proposal round, height, and proposal hash, is signed with a private key.
[0117] 9, votes are exchanged between the equalizer nodes 220 participating in the agreement, and if a particular proposal receives more than 2 / 3 of the votes of the total number of equalizer nodes 220, the proposal is deemed valid and the commit step S304 can be performed. That is, the already set ratio can mean 2 / 3 of the total number of equalizer nodes 220 or a number randomly selected from a certain number of equalizer nodes 220 randomly selected, as in the pre-voting step S302.
[0118] Meanwhile, in the "voting step S303" according to an embodiment of the present invention, if the voting results of the equalizer nodes 220 exceeding the already set ratio (2 / 3 of the number of equalizer nodes) are not collected or if a valid proposal is not accepted within the already set time, the voting result is deemed invalid if the already set time or ratio condition is not met. However, the equalizer nodes 220 of the present invention can continue to increase the round by one step until the already set ratio is exceeded (2 / 3 of the number of equalizer nodes), and voting can be attempted again from the proposal stage.
[0119] The existing pBFT method has a drawback that if the result of the quorum or more is not obtained in the voting stage, the next block cannot be piled up, and it waits until the quorum is met, and the progress (liveness) of the proposed block cannot be guaranteed. In this case, the proposed block (transaction) cannot be processed, or it is unclear whether it can be processed or not, which is a drawback that makes it difficult to use commercially. However, the present invention solves the above drawbacks and adopts a round method in which re-voting is performed so that the progress (liveness) of the proposed block (transaction) can be performed within a short time.
[0120] In the commit stage S304 according to an embodiment of the present invention, as shown in Fig. 7, each equalizer node 220 can generate a block and store the commit data in a database. A block is generated via a transaction list included in the proposal, and the state for each node's account is changed.
[0121] Specifically, as shown in FIG. 10, the transaction list included in the proposal can be checked, data can be loaded, changes can be determined based on the data, and state transitions and commit data can be stored in the database.
[0122] In this case, the commit data may include account information and nonce, including blocks, transactions, and states for each smart contract transmitted through the transaction.
[0123] Furthermore, according to one embodiment of the present invention, the method may further include a networking step of exchanging stage information including the height of the newly generated block, the current round, and the previous block hash for each node between the equalizer nodes 220 before the proposal step S301, and merging the stage information of the equalizer nodes 220 to determine stage information for the entire network.
[0124] In the above networking stage, equalizer nodes 220 with the same stage information can participate in a consensus and select a block proposer 221 among the equalizer nodes 220 using a round-robin method.
[0125] In other words, the networking stage can propagate transactions between equalizer nodes 220 and select proposers.
[0126] According to this operation process, when a node stakes more than the minimum amount of network coins, it becomes an equalizer node 220 with the same voting power. Once it becomes an equalizer node 220, it is randomly selected as a congress by various methods of proof-of-stake consensus algorithms. The congress is a collection of equalizer nodes 220 that do not stack blocks to a certain height, but only verify and agree on the block itself. When the congress is determined, a block proposer 221 is determined through round robin, and the proposer propagates the block to the congress, and the propagated block is verified by the equalizer nodes 220 in the congress, and the verification result is made into a vote and propagated to the congress. When each equalizer node 220 votes on the verification content and meets the quorum of more than 2 / 3, it proceeds to the execution stage, executes the transactions in the block, and forms a new block.
[0127] Meanwhile, as shown in FIG. 11, two microchains 110 have a smart contract called a linking contract 111 for linking, and assets can be transferred to the other microchain 110 through the smart contract. In between the two microchains 110, some signers 310 can observe the microchain 110 by sensing, signing and transmitting events in the form of transactions. The signers 310 also sense and sign transactions that are transmitted to the agreed linking smart contract. Events signed by all signers 310 are transmitted to the opposite microchain 110 in the form of transactions that include multiple signatures of the signers 310. Similarly, there is a linking smart contract in the opposite microchain 110 that verifies multiple signatures of the signers 310. The verified transaction is reflected in the microchain 110, and assets can be transferred between the microchains 110.
[0128] In the process, the signers 310 can stake assets on the linked smart contracts and receive a portion of the transaction fees, while if a malicious signer 310 is detected, the assets that the malicious signer 310 staked via the linked smart contracts can be confiscated.
[0129] Generally, the EVM known when using contracts is the Ethereum Virtual Machine, which is currently used as a standard in the blockchain market as an environment for developing smart contracts, so the Equilibrium blockchain system of the present invention also added the EVM to expand the developer ecosystem. The part that handles the gas consumed in the EVM is related to the network fee paid by the contract user. In the case of Ethereum's EVM, gas is designed to be consumed every time the code is run, so more gas is consumed in the case of smart contracts that require more complex code or processing, and the block mining node prioritizes transactions with higher gas prices, so users pay more fees for gas. Meanwhile, in the case of the Equilibrium blockchain of the present invention, more gas is consumed in the EVM depending on the complexity of the code and the amount of calculation, but the actual input gas and consumed gas of the user are fixed, and a limit on gas usage is defined to prevent transactions with infinite loops, remove the priority of users' gas prices, and are designed to be commercially available at a low price.
[0130] The transaction processing speed achieved in the single microchain 110 of the present invention will be specifically described below based on experimental results. However, it should be noted that the following embodiments are intended to exemplify and embody the present invention, and are not intended to limit the scope of the present invention. The scope of the present invention is determined by the matters described in the claims and matters that can be reasonably inferred therefrom.
[0131] Referring to Figure 12, looking at the transaction processing time of the Equilibrium blockchain network, the Equilibrium blockchain network of the present invention processes an average of more than 6,000 transactions (token and coin transactions, smart contract interactions, etc.), which is far more than other blockchains, while building up new blocks every 2 seconds. This means that the transaction processing time of the Equilibrium blockchain network of the present invention is within 2 seconds, which can guarantee transaction processing speed, scalability, and security useful for commercial services.
[0132] Also, looking at the number of loads applied to the network and the number of TPS with reference to FIG. 13, it can be seen that the Equilibrium network of the present invention is not significantly affected by the computer specifications, and when the number of loads applied to the network is 5,000, the number of transactions that can be processed per second (TPS) reaches an average of 4,000 to 4,500.
[0133] In particular, the Equilibrium network of the present invention has a high transaction processing rate of over 4,200 TPS when the load on the network is 5,000, even when using a PC with AWS instance standard C5 2XL, which has lower PC specifications than those recommended by other blockchains.
[0134] Meanwhile, verification tests for the block generation time, which is the transaction processing time for the present invention, and TPS are currently being conducted by the Telecommunication Technology Association (TTA).
[0135] In addition, the Equilibrium network of the present invention can guarantee liveness and finality regardless of malicious behavior in an environment where it is assumed that less than 33% of malicious nodes exist in the network through a pBFT-based consensus algorithm, and by registering equalizers with a minimum staking amount, an external network attacker would have to attack many nodes at the same time to control the network, making it difficult to attack. Even if a specific microchain 110 is attacked or the network load is too heavy and a failure occurs, the remaining microchains 110 excluding the business domain are isolated from the failure, and the impact of external attacks and overload is significantly smaller than in conventional blockchain network structures, making it extremely secure.
[0136] The blockchain system and method using a non-competitive consensus algorithm to ensure transaction processing speed, scalability, and security useful for the commercial service of the present invention configures a network with a microchain architecture consisting of a mainnet 120 and a microchain 110 that does not interfere with each other, and configures a synchronized network in which nodes are divided into equalizer nodes 220 and non-equalizer nodes 210 according to the minimum staking amount using a non-competitive consensus algorithm, votes are cast for a proposed block in the voting stage, and when complete consensus is reached, other blocks are stacked on the proposed block to generate a new block, thereby minimizing network traffic, and eliminates the fundamental problem of delays in processing speed in the mining process through a non-competitive consensus algorithm based on a pBFT (practical Byzantine Fault Tolerance) model in which defective nodes should be less than 1 / 3 of the total nodes, and ensures unlimited scalability (scale-out) through the microchain architecture. [Explanation of symbols]
[0137] 110: Micro Chain 111: Linking Contract 120: Mainnet 210: Non-equalizer node 220: Equalizer node 221: Block proposer 310: Signer
Claims
1. A network providing a blockchain service, the network comprising: A mainnet that communicates with other microchains according to an interchain communication protocol and issues or burns coins; The smart contract conclusion using the coin connected to the mainnet is configured in a microchain architecture including a plurality of microchains operated according to each domain; Each of the multiple microchains executes business logic independently without interfering with each other; Each of the plurality of microchains is configured to execute a different smart contract corresponding to each of the plurality of microchains. A blockchain system that uses microchain architecture to ensure transaction processing speed, scalability, and security useful for commercial services.
2. The plurality of micro chains are connected to the main net on an equal footing with mutual trust, At least one microchain can be extended to a new microchain that is not directly connected to the mainnet; A blockchain system using a microchain architecture to ensure transaction processing speed, scalability, and security useful for the commercial service described in claim 1.
3. The microchain architecture comprises: Non-equalizer nodes, which do not participate in consensus but only share the ledger, An equalizer node that is connected to the surrounding non-equalizer nodes and other surrounding equalizer nodes to collect information of other nodes, participate in the agreement, and verify the smart contract; A blockchain system using a microchain architecture to ensure transaction processing speed, scalability, and security useful for the commercial service described in claim 1.
4. The equalizer nodes that have staked coins equal to or greater than the minimum staking amount have equal voting power when participating in the agreement and verifying the smart contract. A blockchain system using a microchain architecture to ensure transaction processing speed, scalability, and security useful for the commercial service described in claim 3.
5. The equalizer node is randomly selected from among equalizer nodes having the same voting power according to the minimum number of nodes calculated to withstand Byzantine failures, and the selected equalizer node participates in the agreement to verify the smart contract. A blockchain system using a microchain architecture to ensure transaction processing speed, scalability, and security useful for the commercial service described in claim 4.
6. A mempool is assigned to each equalizer node and stores transactions including a key value obtained by converting a hash of an unagreed transaction of the equalizer node and a signature of a personal key; A blockchain system using a microchain architecture to ensure transaction processing speed, scalability, and security useful for the commercial service described in claim 3.
7. The equalizer node receives the transaction through a transaction request regardless of the agreement process, performs a validity check on the received transaction, and stores the transaction in the member pool. A blockchain system using a microchain architecture to ensure transaction processing speed, scalability, and security useful for the commercial service described in claim 6.
8. The microchain architecture comprises: If you stake more than the minimum amount of coins on a network that provides blockchain services, you will have equal voting power, including equalizer nodes, Among the equalizer nodes, a portion of the equalizer nodes generates a block for agreement and verifies the block; Other equalizer nodes perform pre-voting to agree on the validity of the proposal in a non-arithmetic operation method of true and false for the verified block, and voting on the proposal, and when the already set quorum is exceeded, a block is generated and linked to the blockchain to generate a new block, A blockchain system using a non-competitive consensus algorithm to ensure transaction processing speed, scalability, and security useful for the commercial service described in claim 1.
9. Among the equalizer nodes, some of the equalizer nodes are randomly selected from among equalizer nodes that have staked coins equal to or greater than the minimum staking amount according to the minimum number of nodes calculated to withstand a Byzantine failure. A blockchain system using a non-competitive consensus algorithm to ensure transaction processing speed, scalability, and security useful for the commercial service described in claim 8.
10. When voting on the proposal, verification is performed on the proposed transaction state, and a new block is generated by stacking other blocks on the proposed block that is completely agreed upon by voting. A blockchain system using a non-competitive consensus algorithm to ensure transaction processing speed, scalability, and security useful for the commercial service described in claim 8.
11. A network providing a blockchain service, the network comprising: A mainnet that communicates with other microchains according to an interchain communication protocol and issues or burns coins; The microchain architecture includes a plurality of microchains connected to the mainnet and operated according to each domain for smart contract execution using the coin, Each of the multiple microchains executes business logic independently without interfering with each other; Each of the plurality of microchains is configured to execute a different smart contract corresponding to each of the plurality of microchains; The network also includes an equalizer node that has equal voting power when it stakes a minimum amount of coins, Among the equalizer nodes, some of the equalizer nodes generate blocks for agreement and verify the blocks; Other equalizer nodes are configured to pre-vote for the proposed block for verification to agree on the validity of the proposal in a non-arithmetic manner, and to vote for the proposed block, and when a pre-established quorum is exceeded, a new block is generated by stacking other blocks on the proposed block; The plurality of micro chains are connected to the main net on an equal footing with mutual trust, At least one microchain can be extended to a new microchain that is not directly connected to the mainnet; A blockchain system that uses a non-competitive consensus algorithm and microchain architecture to ensure transaction processing speed, scalability, and security useful for commercial services.
12. A block chain method using the block chain system according to claim 11, A proposal stage in which an equalizer node selected as a block proposer generates a block including transactions for consensus and propagates it to other equalizer nodes; a pre-voting stage in which other equalizer nodes that receive the block verify the validity of the received block and, upon completion of the verification, propagate the pre-vote to other equalizer nodes; A voting step in which, when an equalizer node exceeding a preset ratio propagates a pre-vote, the equalizer node votes on the proposal to make the block conform to the consensus, and propagates the voting result signed with a private key to other equalizer nodes; A commit step in which, when the voting results of the equalizer nodes exceeding the preset ratio are collected, each equalizer node executes the proposed transaction to generate a block; The pre-voting step comprises a true / false non-arithmetic operation; The voting step is configured to vote for the proposed block and to stack other blocks onto the proposed block that is fully agreed upon to generate a new block. A blockchain method using a non-competitive consensus algorithm and microchain architecture to ensure transaction processing speed, scalability, and security useful for commercial services.
13. receiving a transaction when a transaction request is made regardless of the progress of the agreement step, and storing the transaction in the member pool of the requested equalizer node when a validity check is completed; The transaction stored in the member pool is transmitted to other equalizer nodes. A blockchain method using a non-competitive consensus algorithm and a microchain architecture to ensure transaction processing speed, scalability, and security useful for the commercial service described in claim 12.
14. The proposal step includes: generating a transaction list by integrating only transactions having sequentially increasing account nonces from the current account nonce among transactions stored in the member pool of each equalizer node; hashing and signing with a private key a proposal including the height, round, and block for the transaction list; A blockchain method using a non-competitive consensus algorithm and a microchain architecture to ensure transaction processing speed, scalability, and security useful for the commercial service described in claim 12.
15. The networking step further includes exchanging stage information between equalizer nodes, the stage information including the height of a newly generated block before the proposal step, a current round, and a previous block hash for each node, and merging the stage information of the equalizer nodes to determine stage information for the entire network. A blockchain method using a non-competitive consensus algorithm and a microchain architecture to ensure transaction processing speed, scalability, and security useful for the commercial service described in claim 12.
16. The commit step includes: If the voting results of the equalizer nodes exceeding the already set ratio are not collected or a valid proposal is not accepted within the already set time, the equalizer node increases the round by one step and reruns from the proposal stage. A blockchain method using a non-competitive consensus algorithm and a microchain architecture to ensure transaction processing speed, scalability, and security useful for the commercial service described in claim 12.
17. A computer readable storage medium having stored thereon a computer program for causing the method of claim 12 to be performed on a computer.
Citation Information
Patent Citations
Cross-blockchain authentication method and apparatus
JP2021131870A
Systems and methods for virtual distributed ledger networks
JP2022527375A
Distributed Blockchain Transaction System
JP2022544131A
SYSTEM AND METHOD FOR PROVIDING A BLOCKCHAIN-BASED RECORD PROCESS
JP2022547130A
