Methods and Systems for Quantum-Resistant Hashing Schemes

Abstract

To provide a method and system for moderation in a permissioned blockchain using a hash-oriented scheme.SOLUTION: In a system, a processing server is configured for: receiving transaction data values; receiving a first reference value and a second reference value; generating a first hash value by hashing the first reference value; generating a block proof including the first hash value, a second hash value, a third reference value and a block value; verifying a block header of the most recent block using the block proof; receiving a new block value; generating a new block header including the first reference value, the second reference value, a fourth reference value and the new block value; generating a new block for the blockchain including the new block header and the transaction data values; and transmitting the new block to one or more additional nodes associated with the blockchain.SELECTED DRAWING: Figure 1

Description

Cross - reference to related applications

[0001] This application claims the benefit of U.S. Patent Application No. 17 / 317,456, filed May 11, 2021 and its entire contents are incorporated by reference for all purposes.

Technical Field

[0002] This disclosure relates to enabling the verification of proofs of assertions such as presented identities or contracts by using a hashing scheme that is resistant to attacks or decryption using computational techniques including quantum computing.

Background Art

[0003] Many cryptographic techniques involve complex algorithms that include mathematical problems that are almost impossible for standard computers to solve. For example, blockchain and other technologies that rely on digital signatures often utilize the RSA (Rivest - Shamir - Adleman) method that relies on prime factorization or the ECDSA (elliptic curve digital signature algorithm) method that uses discrete logarithm problems. In either case, standard computers are too slow and inefficient to solve these mathematical problems, thus rendering the related algorithms cryptographically secure.

[0004] However, quantum computing is under development, and if successful, it may solve the above - mentioned mathematical problems. As a result, in cases where the underlying mathematical problems become solvable ​​​​​​​​​In such cases, the use of digital signatures via algorithms such as RSA and ECDSA may become invalid. This can lead to several vulnerabilities and security threats. Signatures based on hashes involve data sizes that are far too impractical for practical use. Therefore, proof of identity and assertion available from existing algorithms Cryptographic technology that provides a solution that is resistant to attempts to solve problems using quantum computing. A technical system capable of employing this method is required. [Overview of the Initiative]

[0005] This disclosure describes assertions on values ​​using hash-oriented transaction schemes. This document provides a description of the system and methods for proving [the problem]. By using hashing instead of standard algorithms, collision detection with SHA-256 and other similar algorithms can be achieved. A sufficiently complex hash is used that results in a value of sufficient size and resilience. In particular, this provides resistance to quantum computing. Blockchain is used to store ) and blockchain is a declaration message Provides an immutable, timestamped record of the sage (declaration message). The declaration is intended to be something the user will later verify, such as an ID card, contract, land deed, voting record, etc. The declaration includes the value to be obtained. The declaration also includes the hash value, which is known only to the value and the user. It is generated by hashing with one or more other items. If you wish to prove ownership or otherwise authenticate its authenticity, The can send confirmation messages on the blockchain. The confirmation message is used to create the hash value stored within the declaration. It includes one or more other items. By disclosing the values ​​of those items known to the user... Any entity that wishes to audit a user's assertion may do so with the authenticated value and The hash value can be calculated using one or more other items in the confirmation message, and also This can be checked in relation to the hash value in the declaration. A match is found in the user's assertion. This proves the success of hashing and blockchain utilization. Therefore, it is possible to prove value assertions quickly, simply, and securely, A system that is resistant to quantum computing can be obtained.

[0006] Those who use hash-oriented schemes to make adjustments on permissioned blockchains. The law includes the following steps: multiple blocks, including the most recent block, are placed in the processing server's memory. A step of storing a blockchain comprising the latest block, the blockchain The step, including the data, and the receiving unit of the processing server, one or more transaction data The steps include receiving a value and the receiving unit of the processing server determining the first reference value and the second The steps include receiving a reference value and the processing unit of the processing server processing the first reference value The steps of generating a first hash value by hashing and the processing server The processing device performs at least the first hash value, the second hash value, and the third A step of generating a block proof that includes a reference value and a block value, and the processing server The apparatus uses the block proof to determine the previous block contained within the latest block. The steps include verifying the block header and the receiving unit of the processing server, The steps include receiving a block value and the processing unit of the processing server, at least , including the first reference value, the second reference value, the fourth reference value, and the new block value The steps of generating a new block header and the processing unit of the processing server, The block header includes the new block header and the one or more transaction data values. The steps of generating a new block for the lock chain and sending it to the processing server. Depending on the part, the new block is associated with one or more of the blockchain. The step of sending to the additional node above.

[0007] A hash-oriented scheme is used to coordinate on a permissioned blockchain. The system consists of: a processing server as a node associated with the blockchain, and the aforementioned blockchain The processing server comprises one or more additional nodes associated with the lock chain. A blockchain comprises at least a transmitting unit and multiple blocks, including the latest block. A memory that stores the latest block, and the memory includes a block header and one or more A receiving unit that receives the transaction data value, the first reference value, and the second reference value, and processing The apparatus includes a device, and the processing apparatus hashes the first reference value to A step of generating a hash value, and at least the first hash value and the second hash A step of generating a block proof that includes a value, a third reference value and a block value, and the block The block header contained within the latest block is verified using a lock proof. Execute steps, and the receiving unit further receives a new block value, and the processing device further generates a new block header including at least the first reference value, the second reference value, the fourth reference value, and the new block value, and generates a new block for the blockchain including the new block header and the one or more transaction data values. Also, the transmitting unit transmits the new block to one or more additional nodes associated with the blockchain.

Brief Description of Drawings

[0008] The scope of the present disclosure is best understood by reading the following detailed description of the exemplary embodiments in conjunction with the accompanying drawings. The drawings include the following drawings:

[0009] [Figure 1] A block diagram showing a high-level system architecture for proving value assertions using a hash-oriented transaction scheme and a blockchain according to an exemplary embodiment. [Figure 2] A block diagram showing a processing server of the system of FIG. 1 for verifying value assertions using a hash-oriented transaction scheme and a blockchain according to an exemplary embodiment. [Figure 3] A diagram showing exemplary declarations and confirmation messages that can be stored in the blockchain of FIG. 1 according to an exemplary embodiment. [Figure 4] A diagram showing an exemplary message for transfer of ownership through a block header that can be stored in the blockchain of FIG. 1 according to an exemplary embodiment. [Figure 5A]This flowchart illustrates a process for verifying asserted values ​​within the system shown in Figure 1 using a hash-oriented transaction scheme and blockchain, according to an exemplary embodiment. [Figure 5B] This flowchart illustrates a process for verifying asserted values ​​within the system shown in Figure 1 using a hash-oriented transaction scheme and blockchain, according to an exemplary embodiment. [Figure 6] This flowchart illustrates an exemplary method for verifying proof of value assertions using a hash-oriented transaction scheme, according to an exemplary embodiment. [Figure 7] This flowchart illustrates an exemplary method for coordinating a permissioned blockchain using a hash-oriented scheme, according to an exemplary embodiment. [Figure 8] This block shows a computer system architecture according to an exemplary embodiment.

[0010] Further aspects of the applicability of this disclosure will become apparent from the detailed description provided below. The detailed description of exemplary embodiments is for illustrative purposes only and therefore is not applicable to this publication. Please understand that this is not intended to necessarily limit the scope of the indication. [Modes for carrying out the invention]

[0011] Glossary Blockchain: All blockchain-based digital assets such as cryptocurrencies A shared ledger about the transaction. One or more computing devices are blockchain It can be equipped with a blockchain network, and the blockchain network is blockchain It can be configured to process and record transactions as part of a block within it. Once a block is completed, it is added to the blockchain, and this will change the outcome. Transaction records are updated. In many cases, blockchains are chronologically ordered. It may be a ledger of transactions, or it may be suitable for use by a blockchain network. They may be presented in any other order. In some configurations, which assets are at a particular address The blockchain records whether it is caused by the blockchain, and the blockchain records the tragedy An transaction may include a destination address and the amount of digital assets. In some cases, Transactions are financial, and others are not financial, or source address, tie It may include additional or other information such as stamps. The chain is protected against tampering and modification, either additionally or alternatively, even by its operators. It is placed in a distributed database that maintains a continuously growing list of enhanced data records. Almost any type of transaction is a transaction that needs to be performed or deployed. It can contain data, and by blockchain network, proof of work Verification and It can be verified. In some cases, the data relating to a given transaction can be verified. Additional data that is not a direct part of the transaction attached to the transaction data. It can further include data. In some cases, such data in a blockchain. Including data can constitute a transaction. In such cases, the blockchain This refers to a specific digital currency, cryptocurrency, fiat currency, or other type of currency that is not directly related to that currency. It's okay if it's not attached.

[0012] A system of assertion proofs using hashing and blockchain. Figure 1 shows the hash-oriented scheme and blockchain for handling values. This describes system 100 for verifying certification.

[0013] System 100 may include a processing server 102. The processing server 102 described below is particularly It can be configured to verify a proof given by user 104 asserting a constant value. In system 100, a specific value is transmitted by user 104 to the blockchain network 106. It can be supplied to the blockchain associated with it. A specific value is provided by user 104. This can be submitted as a declaration message to blockchain network 106, This will be explained in detail below.

[0014] Blockchain network 106 can have multiple nodes. Each node is a block Computing configured to perform functions related to the processing and management of the chain. It can be considered a system, and may include, for example, the following: generation of blockchain values. , verification of proposed blockchain transactions, verification of digital signatures, new Creating locks, verifying new blocks, and preserving copies of the blockchain. The chain can be a distributed ledger having at least several blocks. Each block is a small At the very least, it may contain a block header and one or more data values. Each block header is small Even if not present, it may include a timestamp, block reference value, and data reference value. The stamp can be the time the block header was generated, and also any appropriate method. It can be represented using a specific method (e.g., UNIX timestamp, DateTime, etc.). See block reference. The value references the previous block in the blockchain (for example, based on the timestamp). It can be a value that is. In some embodiments, the block reference value in the block header is each Each block is treated as a reference to the block header of the most recently added block preceding it. Obtain. In an exemplary embodiment, the block reference value is the block of the most recently added block. This can be the hash value generated through hashing of the . A data reference value is a reference to one or more data values ​​stored within a block that includes a block header. This can be used as a reference. In an exemplary embodiment, the data reference value is for one or more data values. It can be a hash value generated through hashing. For example, a block reference value is one The above data values ​​can be used to generate the root of the Merkle tree.

[0015] By using block reference values ​​and data reference values ​​in each block header, the result Blockchain can be considered immutable. Any attempt to modify data values ​​is not possible. This requires the generation of a new data reference value for that block, and therefore A new block reference value for the subsequent block needs to be generated, and furthermore, this requires For all subsequent blocks, a new block reference value will need to be generated. The changes will be persistent. To achieve this, it is necessary to generate and add new blocks to the blockchain beforehand. And in regard to this matter, every individual node within blockchain network 106 It is necessary for it to be executed and updated. Due to constraints on computation and communication, such The modification would be extremely difficult, if not impossible, and as a result, the blockchain The concept of "n" becomes immutable.

[0016] Each blockchain data value is included in the confirmation or declaration message, as described below. It can be supported. Desktop computers, laptop computers, notebook computers Computers, tablet computers, mobile phones, smartphones, smartwatches, etc. Smart TV, wearable computing device, or performing the functions described herein Appropriate computer such as any other type of computing device specifically configured A user 104 using the reporting device 108 can submit a declaration message to the node. A declaration message is a proof that the value itself is authentic or a proof of ownership of the value. It may contain certain values ​​that the user may wish to prove later. For example, certain values ​​may be on an identification document. In some cases, user 104 may be identified by their identification document using the method described. It may be possible to prove that the person being targeted is oneself. In another example, Certain values ​​may relate to land title deeds, and by using the method described, The 104 is that the owner of the land title deed is himself and therefore the owner of the land to which it applies. It becomes possible to prove one's own identity.

[0017] The declaration message also includes a hash value, which is also called an "identity hash value." To obtain a hash value, you combine a specific value with one or more additional values, also known as a "chain value". It can be generated by shuffling. The chain value is used by the user when submitting the declaration message. It may be known to 104, but not to any other entity (especially Regarding any node in the blockchain network 106, it can be considered unknown. User 104 can use any suitable hash algorithm such as SHA-256 to check a specific value. The identity hash value can be generated by hashing the 'n' value. Exemplary Embodiment Therefore, collision-tolerant hash algorithms can be used. In a preferred embodiment, the raw hash value In this case, at least two chain values ​​can be used. User 104 is a blockchain net A declaration message can be submitted to a node within Work 106, and the declaration message must contain at least: It contains a specific value and an identity hash value. And the declaration message is new It can be included in any block, verified, and added to the blockchain.

[0018] In system 100, the request system 110 makes an assertion about a specific value. It can be requested that user 104 provide proof of this. For example, if a certain value relates to an identification document. In this example, the request system 110 asks user 104 to provide proof of their identity. It can be requested. In such an example, user 104 can request blockchain and identity The hash value is used to identify the individual shown in the ID stored within the declaration message. An individual can prove that they are themselves. Request system 110 is a confirmation request The request can be submitted to the processing server 102. The request for verification will be verified by the request system 110. You can specify the desired declaration message. In some examples, each declaration message is a unique identifier This may include and can be used by the processing server 102 to identify the declaration message. It can be included in the request for approval.

[0019] Then, the processing server 102, via the proof of assertion provided by user 104 It is possible to attempt to verify the values ​​contained in the declaration message. Verification is performed within the blockchain. This can be done by using the confirmation message stored in [location]. In that case, a confirmation message will be sent by user 104 (for example, via computing device 108). (and) can be submitted to nodes within the blockchain network 106. In some cases The processing server 102 can request user 104 to submit a confirmation message (for example, This can be done after receiving a confirmation request from quest system 110, and user 104 Contact information regarding the request may be included in the verification request. The EST system 110 can request that user 104 post a confirmation message. For example, in the above example, the request system 110 tells user 104 about their identity. If requested to provide proof, user 104 will send a confirmation message to the blockchain. Submit it and also request an identifier for the declaration message, which includes your own identification document. This can be responded to by providing it to stem 110.

[0020] To verify a user's proof of assertion about a specific value, the processing server First, Ba102 can identify the confirmation message stored on the blockchain. In some cases, each confirmation message uses the identifier found in the corresponding declaration message. It may include. In other cases, each confirmation message may include its own identifier, The identifier is unique to all messages within the blockchain, and the user 104 or the request system 110 uses the identifier to identify the confirmation message, This can be provided to processing server 102.

[0021] The confirmation message uses the identity hash value stored in the declaration message. The processing server 102 may include at least the test values ​​used by user 104 when performing the task. Identify the test value in the confirmation message, and also the test value and the identified declaration message. A check hash value can be generated using specific values ​​that are included. Then, the processing server 102, The relationship between the check hash value and the identity hash value found in the declaration message. You can check and see if there is a match. If there is a match, it will determine that the ownership of the specific value is At the time it is added to the blockchain (for example, the block containing the declaration message) (Based on the timestamp found in the block header) It must have belonged to user 104. This is because the identity hash value used to generate the identity hash value Because they had the test values. This is an assertion about a specific value. This can function as proof, and in this case, the processing server 102 is the request system Tem110 may be notified as appropriate. If there is a match between the check value and the identity hash value If not, the processing server 102 will report to the request system 110 that the user verification attempt has failed. We may notify you as appropriate.

[0022] Therefore, the methods and systems described assume ownership or that a value existed at a particular point in time. This enables user 104 to assert, and by using blockchain This is done through a hash-oriented transactional key, and the proof of that assertion is a hash-oriented transactional key. Verification can be performed by using the `m`, and the confirmation message submitted to the blockchain afterwards This will be done through use. The processing server 102, which is specifically configured as disclosed, will then perform the following: Proof can be easily provided, and the request system 110 itself is a complex movement It allows for easy verification of proof without requiring any action to be taken. Furthermore, digital signatures... The method described by using hashing instead is quantum computing It is resistant to decryption attempts through a sufficiently complex hashing algorithm. The SM ensures the absence of collisions, thereby making it safe and easy to implement. The system can be obtained.

[0023] In some embodiments, confirmation messages and declaration messages are chained together to indicate ownership and ownership. Regarding the system, additional security and transfer of ownership of specific values ​​to another user This can bring about a change. Chaining can be achieved by using additional chain values. For example, the confirmation message is the identity hash found within the declaration message. It may contain two chain values ​​used to calculate the value. The declaration message contains two This may include new chain values. These new chain values ​​are new declarations and confirmation messages. It can be part of the hash chain used in combination with other elements.

[0024] For example, a declaration message involves hashing the value X and the combinations of X, A, and B. Therefore, it may include the generated identity hash value. Thus, A and B are It can be a chain value found within the confirmation message used to verify value X. Furthermore, the declaration message may include two new chain values ​​C2 and D2. The message can be submitted by user 104 for a later proof round about value X. Therefore, the declaration message is created by hashing the combination of X, C1, and D1. It may contain the generated identity hash value. The values ​​for C2 and D2 are C1 and The values ​​of C1 and D1 may be related, for example, the hash of the values ​​of C1 and D1 It can be expressed as such, and here let C2 = H(C1) and D2 = H(D1), where H is the hashing operator It refers to a stimulant.

[0025] For example, prior to voting in a public election, voters must inform the election administrator of their status. You may be required to prove that you have an identity document, and that identity document is value X. A person may own C1 and generate C2 through hashing as appropriate. Yes, it is possible. To establish proof of identity, election officials can provide voters with a D1. A person can generate D2 through hashing D1, and C2, D2, identity card, and C You can post a declaration message containing 1 + D1 + the hash of your ID. The election administrator can see the declaration and recognize D2 based on the provided value. The election administrator then posts a confirmation message with the voter's C1 and the supplied D1. You can wait for it to load and use the value to check the hash in the declaration message. This is possible. Once confirmed, it proves that the voter possesses the identification document, and Therefore, it is possible to verify the identity of the voter.

[0026] In some cases, one of the new chain values ​​used within the declaration message is a new It can be part of a hash chain. For example, user 104 declares the first message for value X. You can submit a sage, which contains the identity hash value H(X+A1+B1) (where, corresponding The confirmation message includes chain values ​​A1 and B1). The first declaration message is new This may also include chain values ​​A2 and B2. For the second declaration message, a new hash is needed. The chain can be utilized, and the second declaration message is value X and identity It is assumed to include the value H(X+B3+C1). Confirmation message regarding the second declaration message. Therefore, the chain values ​​B3 and C1 may be included. Therefore, the most heinous perpetrators are Simply continue hashing the chain value within the declaration message, and the subsequent declaration-confirm It is not possible to attempt to guess the combination of recognition. This is because the new hash chain C1 is Because it is used. Similarly, if user 104 wants to transfer ownership of value X, a new user We can be given an identity hash value H(X+B3+C1) from Za, and here a new Yu The user knows the value C1, but this is unknown to user 104. Therefore, a new user Only this can provide a verifiable proof of the assertion about value X. Therefore, in the declaration message, hash chain or other newly introduced chain By using the value, System 100 can assert ownership or other claims regarding the value. Can be used for easy relocation

[0027] In some cases, blockchain is a permissioned or otherwise coordinated block It can be a block chain, in which case one or more adjustment entities 112 block Joining the chain network 106, computing device 108, processing server 102 , and / or can coordinate the participation of other systems involved in blockchain. In this case, the coordinating entity 112 adds its own digital signature to the blockchain. You may be asked to provide information about a new block. As a result, on the blockchain Any new action shown may involve three entities. Therefore, when including adjustment entity 112, declaration and confirmation messages are required. Using Sage alone may be insufficient. In such cases, it may be necessary to combine it with the hash chain mentioned above. Block headers can be used, and each block header is a hash chain It may include the value of n.

[0028] In such an embodiment, the block header has a value X and a combination of X and chain values. The hash value H generated by the hashing process and the chain value itself are stored. It can be used for this purpose. In these embodiments, the chain value is the entity involved in the transfer. It may include values ​​associated with the tee (for example, chain values ​​A1 and B2), It may also include other chain values ​​associated with the adjustment entity (for example, chain values). Chain value C2). Figure 4 shows an example of a block header in a coordinated blockchain. This is explained in more detail below. In such blockchains, the chain The transfer of ownership implies that the "owner" of the block has the right to confirm the next block. It is possible. In some cases, the entity may acquire ownership for each new block that is added. By transferring it back to oneself, one can repeat ownership. For example, adjustment Entity 112 can maintain full ownership regarding the verification of all blocks, and other entities As mentioned above, Itty will participate in it.

[0029] In such an embodiment, the value X included in the header of each block is the block version Version data such as network identifier and slot number, previous block block The hash of the block header (e.g., block reference value), and the new block being added The root of the Merkle tree for all transactions (e.g., data reference values) may be included. This value X can be included in the hash value added to each block, where The value X is combined with the chain value as described above and shown in Figure 4. It is possible.

[0030] Processing server Figure 2 shows one embodiment of the processing server 102 in system 100. The processing server shown in Figure 2 Embodiments of -ver 102 are provided for illustrative purposes only and perform functions such as those described herein. This does not cover all possible configurations of the processing server 102 that are suitable for doing so. This will be obvious to those skilled in the art. For example, the control shown in Figure 8 and described in more detail below The computer system 800 may be a preferred configuration of the processing server 102.

[0031] The processing server 102 may include a receiving device 202. The receiving device 202 may have one or more networks Configured to receive data over one or more networks via a network protocol. In some cases, the receiving device 202 uses radio frequencies, local area networks, Wireless area networks, cellular communication networks, Bluetooth, the internet, etc. Through one or more communication methods, the blockchain network 106, computing equipment Receive data from the 108, request system 110, and other systems and entities. It can be configured in such a way. In some embodiments, the receiving device 202 is connected to different networks. Different receiving devices for receiving data via the local area network (via the local area network) A first receiving device for receiving data, and a device for receiving data via the Internet. It may consist of multiple devices such as a second receiving device for receiving. The receiving device 202 is electronic The transmitted data signal can be received, where the data is superimposed on the data signal, Otherwise, it is encoded, decoded by the reception of the data signal by the receiving device 202, and analyzed. It can be read or otherwise obtained. In some examples, the receiving device 202, An analysis module for analyzing the received data signal and acquiring the superimposed data. It may include a . For example, the receiving device 202 receives the received data signal and Convert the input into a form usable for the function performed by the processing unit, as described herein. The analysis may include an analysis program configured to perform the method and system.

[0032] The receiving device 202 can be superimposed with blockchain data or otherwise If it can be encoded electronically by nodes in the blockchain network 106 It can be configured to receive data signals that are sent to the blockchain. The data may include blockchain data values ​​that contain confirmation messages and declaration messages. In some embodiments, the receiving device 202 includes all new blocks in a block chain. A complete copy of the block can be received. In other embodiments, the receiving device 202 receives the requested block. It may receive. In other embodiments, the receiving device 202 may receive blockchain data values. In some embodiments, the processing server 102 processes the blockchain network 106. It can be considered a node, and can be verified and tracked by other nodes of the blockchain network 106. It may receive blocks for addition. Also, the receiving device 202 receives declaration and / or confirmation messages. A confirmation request that may include an identifier for the subject is superimposed or otherwise encoded electronically The transmitted data signal is from the computing device 108 and / or the request system It can also be configured to receive signals transmitted by M110.

[0033] The processing server 102 may also include a communication module 204. The communication module 204 is a Joules, engines, databases, memory, and the functions described herein It is configured to transmit data between other components of the processing server 102 for use in that process. The communication module 204 consists of one or more communication types and is computed. Various communication methods can be used for communication within the device. For example, a communication module 204 may consist of a bus, contact pin connectors, wiring, etc. In some embodiments The communication module 204 also connects to the internal components of the processing server 102 and to an external database. It is configured to communicate with external components of the processing server 102, such as display devices and input devices. It may also include a processing unit. The processing unit is configured to perform the functions of the processing server 102 as described herein. This is possible. In some embodiments, the processing unit is a query module 218, a generation module The module 220, verification module 222, etc., are specially configured to perform one or more functions of the processing unit. It may include multiple engines and / or modules, and / or derived from them. It can be configured. The term "module" as used herein refers to a module that receives input. It is specifically programmed to take an input and perform one or more operations, and to provide an output. It can be software or hardware. It is executed by various modules. The inputs, outputs, and processes will be obvious to those skilled in the art based on this disclosure.

[0034] The processing server 102 may include a query module 218. Item 218 can be configured to perform queries on a database to identify information. Yes, it is possible. The query module 218 can receive one or more data values ​​or query strings. This allows the system to execute query strings based on the specified database, such as memory 226, The information stored within it can be identified. And the query module 218 The identified information is then output to the appropriate engine of the processing server 102 as needed. Query Module For example, code 218 executes a query on memory 226 and blocks by using an identifier. It is possible to identify the declaration message or acknowledgment message stored in a block within the chain. ru.

[0035] The processing server 102 may also include a generation module 220. The generation module 220 is Generate data for use by the processing server 102 when executing the functions described in the specification. It can be configured to do so. The generation module 220 receives an instruction as input and generates based on the instruction. The system generates data and outputs the generated data to one or more modules of the processing server 102. Yes, it is possible. For example, the generation module 220 can generate notification and other data messages. It can be configured such that, for example, a confirmation message and / or a prompt for an identifier The results of the attempt or attempted verification, etc., are sent to the computing device 108 or the request system 1 Send to 10, and request, for example, a new block or blockchain data value. This can be sent to nodes within the blockchain network 106. The Joule 220 generates a check hash value by hashing the data. It can be configured. Processing server 102 is within blockchain network 106 In this embodiment, the generation module 220 is used for verification or blockchain It can also be configured to generate a block header and a new block for addition to the existing one.

[0036] The processing server 102 may also include a verification module 222. The verification module 222 is a verification module. As revealed, it is configured to validate the data as part of the functionality of the processing server 102. It is possible. The verification module 222 receives data to be verified as input. This allows for data validation, and the validation results can be sent to another module on the processing server. It can output to the engine or other devices. In some cases, the input is used for verification. It may include data. In some cases, verification module 222 is used for verification. It can be configured to identify the data, which can be detected by the generation module 220. This can be done by instructing the verification module 222 to generate a hash value. The chain value in the declaration message is used for the verification hash value. Verification module Rule 222, for example, verifies the identity hash value found within the declaration message. It can be configured to include a chain found within the corresponding confirmation message. This can be done using a check hash value generated from the value.

[0037] The processing server 102 may also include a transmitting device 224. The transmitting device 224 has one or more nets Configured to transmit data over one or more networks via a work protocol. It may also be the case that the transmitter 224 is a local area network, wireless area Network, cellular communication, Bluetooth, radio frequency, internet, and one or more other communication methods Through the method of communication, blockchain network 106, computing device 108, request The EST system 110 can be configured to transmit data to other entities. In some embodiments, the transmitting device 224 transmits data over different networks. Different transmitting devices for (for transmitting data over a local area network) (First transmitting device, and second transmitting device, etc., for transmitting data via the Internet) It may consist of multiple devices such as the following. The transmitting device 224 is the receiving computing device The data that can be analyzed by this method can be superimposed into a data signal which can then be transmitted electronically. In some cases, the transmitting device 224 superimposes, encodes, or transmits data signals suitable for transmission. A file can contain one or more modules for formatting data.

[0038] The transmitting device 224 electronically transmits data signals to nodes in the blockchain network 106. They can be configured to send blockchain data values ​​or The request for the block is superimposed or otherwise encoded, and the declaration or This may include an identifier for the confirmation message. Also, the transmitting device 224 is a computing device. The device can also be configured to electronically transmit data signals to device 108, and these This includes requests for the submission of a confirmation message, requests for the identifier of the confirmation message, etc. They may be superimposed or otherwise encoded. Also, the transmitting device 224 It is also configured to electronically transmit data signals to the request system 110. These can be superimposed with the verification results or otherwise encoded. It is possible.

[0039] The processing server 102 may also include memory 226. Memory 226 contains the public key and the private key, Used by the processing server 102 when performing functions described herein, such as symmetric keys It can be configured to store data. Memory 226 can be configured with appropriate data formatting methods and skim It may be configured to store data using a read-only memory, random array It may be any suitable type of memory, such as access memory. Memory 226 is, for example, an access memory. Keys and algorithms, communication protocols and standards, data format standards and protocols Programs for processing equipment modules and application programs The code, and as will be apparent to those skilled in the art, the performance of the functions disclosed herein It may also contain other data that may be suitable for use by the processing server 102. In this embodiment, memory 226 stores, identifies, and modifies structured datasets stored within it. A relational database that uses a structured query language for updating, accessing, etc. It may be composed of these, or it may include a relational database. Mori226 is a blockchain data that includes, for example, confirmation messages and declaration messages. hash algorithm for block generation, hash algorithm for generating check hash value M, authentication information for verification, usage rule templates, communication data for blockchain nodes, To store communication data, etc., for the computing device 108 and the request system 110. It can be configured as follows.

[0040] Message declaration and confirmation Figure 3 is an example for use in verifying the proof of value assertion in system 100 in Figure 1. This section describes the descriptive declarations and confirmation messages.

[0041] As mentioned above, user 104 is a new block that will be verified and added to the blockchain. In order to be included within the blockchain, the declaration message 302 is sent to the blockchain network 106. It can be submitted. The declaration message may contain the specific value 304, and user 104 has the specific value 30 You might want to assert proof of 4 (for example, an identification document in the example above). The message may also contain the identity hash value 308, and the identity hash The hash value is a hash value generated by hashing a specific value and two chain values ​​312. At the time of submitting declaration message 302, the chain value 312 is known to user 104. This could be something unknown to anyone else. Declaration message 302 also has two new chains It may include the value 306, which is shown in Figure 3 as new chain values ​​306a and 306b, and this It can also be part of the hash chain used in subsequent declaration and confirmation message pairs.

[0042] If user 104 wants to prove an assertion for a specific value 304, user 104 will send a confirmation message. Sage 310 can be submitted to the blockchain. The confirmation message may include chain value 312. Therefore, in Figure 3, these are shown as chain values ​​312a and 312b, and the identity It was used to generate the hash value 308. In some embodiments, chain The value 312 can be part of a hash chain with a new chain value 306, as shown in Figure 3. In the example, the new chain value 306a can be the hash of chain value 312a, and also, The new chain value 306b can be the hash of chain value 312b. In the example shown, the chain Chain value 312a may be the starting point of a new hash chain, and chain value 312b may be the declaration and and part of an existing hash chain, as used in previous sets of confirmation messages There are cases where this occurs.

[0043] Block headers in coordinated blockchains Figure 4 shows an example of a block header for use in system 100 of Figure 1, and hash This concerns the verification of block headers in coordinated blockchains that utilize the blockchain. ru.

[0044] In system 100, request system 110 requests new blockchain information. Interest is being raised regarding ownership and acquisition of blockchain technology, in the sense that it enables the construction of blockchains. This can sometimes happen. Request system 110 is labeled "B" in the example shown. It can be represented by the chain value, and the request system 110 now owns It does not possess it, and it is desired to acquire ownership in order to enable the construction of the subsequent block 404. To obtain ownership, the request system 110 requests ownership from the current owner. For processing server 102, in the example shown, the chain value labeled "A" is used. This can be expressed as follows: Before acquiring ownership, the request system 110 will then It is necessary to be aware of the transfer, and such subsequent entities will be labeled "C". It can be represented by the assigned chain value.

[0045] In order to acquire ownership, the request system 110 processes chain values ​​406b and 406c. Send to B102, chain value 406b is B2, which is the hash of B1, request This value is known only to the Stor System 110. The chain value 406c is C3, which is C2. It is a hash and is known to subsequent entities as request system 110. The underlying value is unknown to the request system 110. The logic server 102 will have a specific value 410a and chain values ​​406b and 406c. In order to add block 402, the request system 110 has block value 412a must be supplied, which is known to the request system 110 but processing The hash of the chain value is unknown to server 102. Then, processing server 102, A new block consisting of chain values ​​406a, 406b, and 406c, a specific value 410a, and a hash value 412a. Generates a 402. With the addition of the new block 402, ownership of block construction is requested. We will move to system 110. This is because request system 110 is at least chain This is because it is the only entity that has knowledge of the value 408a. And, The request system 110 has a value 2(410b) related to the request system 110 in a manner similar to that described above. Using ) and 408c and 412b, the subsequent value having the basis for the chain value 408b It may become possible to transfer ownership to entities, and in subsequent new blocks... But it is done that way.

[0046] The process of verifying the proof of an assertion using hashing and blockchain. Figures 5A and 5B show the blockchain network 106 and hash-oriented transit Using the action scheme, assertion of a specific value presented by user 104 An example of a process in system 100 in Figure 1 is shown to verify the accuracy.

[0047] In step S502, user 104 uses computing device 108 to make a declaration The message will be submitted to blockchain network 106. The declaration message will be minimal. In addition, an identifier (referred to herein as a data entry identifier) ​​and a specific value and identity Includes the Titi hash value. In S504, blockchain network 106 declares Messages can be received. In S506, the declaration message is included in a new block. This can be done, verified, and added to the blockchain. In some embodiments, the declaration message Sage's data entry identifier is S504 or S506 on the blockchain network. It can be identified by k106, which can be returned to computing device 108.

[0048] In S508, the computing device 108 and the request system 110 are added to the agreement. It is possible to enter. For example, in the above example, the request system 110 allows user 104 to enter their identity. The user may be asked to provide proof regarding this, and in achieving this, the user 104 uses the identification card as a specific value, and this is on the blockchain network 1 It is included in the declaration message submitted in 06. In S510, as part of the arrangement, User 104 provides the data entry identifier for the declaration message to the request system 110. It can be provided via computing device 108. In S512, the request system M110 can submit a confirmation request to the processing server 102 using an appropriate communication network and method. The confirmation request may include at least a data entry identifier.

[0049] In S514, the receiving device 202 of the processing server 102 receives confirmation from the request system 110. The request can be received. In S516, the processing server 102 receives the request message. It can be electronically transmitted to the computing device 108, and a specific value (for example, above) User 104 asserts proof of the aforementioned example ID on the blockchain network Request to submit a confirmation message to Ku106. S518 is computing Device 108 can receive request messages from processing server 102.

[0050] In S520, computing device 108 sends a confirmation message to the blockchain network. It can be submitted to Twork 106. The confirmation message must include at least the data entry identifier and It may contain one or more chain values. In S522, blockchain network 106 is You can receive a confirmation message. In S524, the confirmation message is contained within a new block. This can be generated, verified, and posted to the blockchain. S52 In step 6, the receiving device 202 of the processing server 102 updates the blockchain network via A confirmation message can be received. In S528, the generation module 220 of the processing server 102 can receive a confirmation message. The chain value found in the recognition message and the specific value found in the declaration message are used to determine the chain value. By hashing the data, a check hash value can be generated.

[0051] In S530, the verification module 222 of the processing server 102 declares the verification of the check hash value. The attempt is made by comparing it with the identity hash value found in the message. This can be seen and can be used to verify the assertion by user 104. S5 In step 32, the transmitting device 224 of the processing server 102 sends a confirmation notification. It can be sent electronically to the request system 110. The confirmation notice may include the results of the verification. Yes, and if this is successful, you can verify the user's assertion (for example). (that the person is identified by the identification card in the example above). In S534, request System 110 can receive confirmation notifications from processing server 102.

[0052] Exemplary methods for verifying proofs about assertions on values Figure 6 shows the combination of blockchain and hash-oriented transaction schemes. Method 600 to verify proof about assertions about values ​​by using This will be shown.

[0053] In S602, the confirmation request is received by the receiving unit of the processing server (for example, processing server 102) (for example, It may be received by the receiving device 202). In S604, the confirmation message is processed by the processing server. It can be identified by the processing device (e.g., query module 218), and confirmation message Sage contains at least one chain value and is one of the following: included in the confirmation request It is either born or stored within a block contained in the blockchain and requires verification. It is identified using the reference identifier contained within the request. In S606, the declaration message is processed by The declaration message can be identified by the processor of the server, and the declaration message is at least an assert Includes the set value and the identity hash value.

[0054] In S608, at a minimum, the asserted value and one or more chain values ​​are hashed. By doing so, the processing unit of the processing server (for example, the generation module 220) performs the inspection. A hash value can be generated. In S610, the identity hash value is used by the processing server. The verification hash value can be verified by the processing unit (e.g., verification module 222). S6 In step 12, the result of verifying the check hash value is provided to the processing unit in response to the received confirmation request. It can be transmitted by the transmitting unit (for example, the transmitting device 224).

[0055] Exemplary methods for coordination in permissioned blockchains Figure 7 shows a permissioned transaction using a hash-oriented transaction scheme. This document outlines 700 methods for adjustments on the blockchain.

[0056] In S702, the blockchain is stored in the memory of the processing server (for example, processing server 102). For example, it can be stored in memory 226), and blockchain is the most It consists of multiple blocks, including a new block, and the latest block has a block header. Includes. In S704, one or more transaction data values ​​are received by the processing server's receiving unit (for example) If so, it can be received by the receiving device 202). In S706, the first reference value and the second reference The value may be received by the receiving unit of the processing server. In S708, the first reference value is hashed. By doing so, the processing unit of the processing server (e.g., generation module 220) will process the data. It can generate a hash value of 1. In the S710, the processing unit of the processing server can do at least The block includes the first hash value, the second hash value, the third reference value, and the block value. It is possible to generate a proof.

[0057] In S712, block headers included within the latest block are treated as block plues. Verification can be performed using a processing device (for example, verification module 222). S714 Then, the new block value can be received by the receiving unit of the processing server. In S716, processing The server's processing unit determines at least a first reference value, a second reference value, and a fourth reference value. A new block header containing a new block value can be generated. In S718, the processing server The processing unit generates a new block on the blockchain. Yes, it is possible. The new block will have a new block header and one or more transaction data. This includes the value. In S720, new blocks are associated with the blockchain. The processing server's transmission unit (e.g., transmission device 224) transmits to one or more additional nodes. It can be done.

[0058] In one embodiment, method 700 is performed by the processing unit of the processing server on one or more transistors The step may further include generating a Merkle tree using the transaction data values. Furthermore, the new block header further includes the root of the Merkle tree. In further embodiments... The new block header further includes version data and block header reference values. In a further embodiment, method 700 is a block verified by the processing unit of the processing server. The step of generating a block header reference value by hashing the block header is It may also include the following. In some embodiments, method 700 is performed by the processing unit of the processing server. The reference value, the second reference value, the fourth reference value, and one or more data points The process may further include the step of generating a block value by hashing the combinations. In a further embodiment, one or more data points include at least version data and This may include block header reference values ​​and the root of the Merkle tree.

[0059] In one embodiment, method 700 determines the fourth reference value by the processing unit of the processing server. This may further include the step of generating a second hash value by hashing. In these embodiments, the fourth reference value can be stored in the memory of the processing server. In some embodiments, the first and second reference values ​​are external to the computing system. It can be received from M (for example, adjustment entity 112), and the new block value is outside It can be received from the computing system of the department. In a further embodiment, an external computer The voting system is one or more additional numbers associated with the blockchain. It can be considered one of the "do"s.

[0060] Computer System Architecture Figure 8 shows that embodiments or parts thereof of this disclosure may be implemented as computer-readable code. This shows computer system 800. For example, the processing server 102 in Figure 1 consists of hardware and software. Software, firmware, instructions stored on a non-transient computer-readable medium, or These combinations can be implemented within the computer system 800, one or It can be implemented within multiple computer systems or other processing systems. Hardware, software, or any combination thereof, are shown in Figures 3, 4, 5A, 5B, 6 and The modules and components used to implement the method shown in Figure 7 can be realized. Cut.

[0061] When programmable logic is used, such logic is programmed for a specific purpose. Computers or devices for special purposes (e.g., programmable logic arrays, application-specific components) Commercially available processing (such as a multiplier circuit) is configured using executable software code. It may be executed on a platform. Those skilled in the art will see that the embodiments of the disclosed subject matter are multi Core multiprocessor systems, minicomputers, mainframe computers, Dispersed and linked or clustered computers, and substantially any device Various computer systems, including pervasive or miniature computers that can be embedded. It can be understood that this can be done in a system configuration. For example, at least one processor device The above embodiments can be implemented using memory.

[0062] The processor units or devices described herein include a single processor, a plurality of processors It can be a combination of a computer or a computer. The "computer programme" discussed herein "Programming media," "non-temporary computer-readable media," and "computer-usable media" This term generally refers to the removable storage unit 818, the removable storage unit 822, and refers to tangible media such as hard disks installed on hard disk drive 812. Used for

[0063] Various embodiments of this disclosure will be described with respect to this exemplary computer system 800. After reading this explanation, other computer systems and / or computer architects How to implement this disclosure using [the specified method] will be obvious to those skilled in the art. It can be described as a continuous process, but some of the operations are actually in parallel. Simultaneously, and / or in a distributed environment, and by single or multiprocessor machines Therefore, it can be executed using program code stored locally or remotely. Furthermore, in some embodiments, the order of operations deviates from the spirit of the disclosed subject matter. It can be reconstructed without any modifications.

[0064] The processor unit 804 is a dedicated unit specifically configured to perform the functions described herein. Alternatively, it can be a general-purpose processor device. Processor device 804 has a bus and message Communication infrastructure such as queues, networks, and multicore message passing schemes It may be connected to Rakucha 806. The network performs functions as disclosed herein. It can be any network suitable for use, such as a local area network (LAN). Wide Area Networks (WANs), Wireless Networks (e.g., Wi-Fi), Mobile Communications Networks, satellite networks, the internet, fiber optics, coaxial cables, infrared This may include radio frequency (RF), or any combination thereof. Other suitable networks The type and configuration of the work will be obvious to those skilled in the art. Computer system 800 also , including main memory 808 (e.g., random access memory, read-only memory, etc.) It may also include secondary memory 810. Secondary memory 810 is hard disk drive 812 And, floppy disk drives, magnetic tape drives, optical disk drives, flash drives It may include a removable storage drive 814 such as a memory stick.

[0065] The removable storage drive 814 is connected to the removable storage unit 818 in a known manner. It can also be read and / or written to. Removable storage unit 818 A removable storage medium that can be read and written by the removable storage drive 814. This may include, for example, a removable storage drive 814 being a floppy disk drive or If it is a universal serial bus port, the removable storage unit 818 is Each may be a floppy disk or a portable flash drive. In this configuration, the removable storage unit shall be a non-temporary computer-readable recording medium. It is possible.

[0066] In some embodiments, the secondary memory 810 stores computer programs or other instructions. Computer system 800, for example, removable storage unit 822 and interface 82 It may include alternative methods that allow loading to 0. An example of such a method is P Program cartridges and cartridge interfaces (e.g., video game systems) (Such as those seen in), removable memory chips (e.g., EEPROM, PROM, etc.) and related Includes a series of sockets, as well as other removable storage units 822 and interface 820. It is possible.

[0067] Stored in computer system 800 (for example, main memory 808 and / or secondary memory 810) The data is stored on an optical storage device (e.g., compact disc, digital versatile disc). (e.g., Blu-ray discs) or magnetic tape storage devices (e.g., hard disk drives) The data may be stored on any type of suitable computer-readable medium, such as ). relational databases, SQL (structured query language) databases, distributed databases Any type of appropriate database configuration is acceptable, such as a database, object database, etc. This can be done. Preferred forms and types of storage will be obvious to those skilled in the art.

[0068] The computer system 800 may also include a communication interface 824. The Toughface 824 ensures that software and data are transmitted between the computer system 800 and external devices. It may be configured to allow transmission via [a specific method]. Exemplary communication interface 82 4 is the modem, network interface (e.g., Ethernet card), communication port, P It may include CMCIA slots and cards, etc. Transferred via communication interface 824. The software and data are, as will be obvious to those skilled in the art, electronic signals, electromagnetic signals, optical signals, etc. It can be a signal or other signal form. The signal is configured to carry the signal. Commonly used terms include wire, cable, fiber optic, telephone line, cell phone link, and radio frequency link. It may also propagate via a communication path 826, which may be implemented using the like.

[0069] The computer system 800 may further include a display interface 802. Interface 802 is used to exchange data between the computer system 800 and the external display 830. It may be configured to allow data to be transferred. Exemplary display interface The 802 features a high-definition multimedia interface (HDMI) and a digital visual interface. It can include DVI, VGA, etc. Display 830 is Cathode ray tube (CRT) displays, liquid crystal display (LCD) displays, light-emitting diode (LED) displays Computers, including electrostatic touch displays and thin-film transistor (TFT) displays. Optional for displaying data transmitted via the display interface 802 of the system 800 A suitable type of display may also be used.

[0070] Computer program media and computer-usable media are memory semiconductors (for example) This may refer to main memory 808 and secondary memory 810, which may be DRAM, etc. These computer program products provide software for the Computer System 800. It can be used as a means to provide. Computer programs (for example, computer The control logic may be stored in main memory 808 and / or secondary memory 810. The computer program may also be received via the communication interface 824. When the computer program is executed, the computer system 800 will be able to do as specified. This method can be made possible, in particular, in computer programs. When executed, the processor device 804 will be as described herein in Figures 3, 4, and 5A. It is possible to implement the methods shown in Figures 5B, 6, and 7. Computer programs like this indicate the processor of computer system 800. This is possible. When the present invention is implemented using software, the software is a computer. The data program product is stored in a removable storage drive 814, interface Using the S820 and the hard disk drive 812, or the communication interface 824, a computer It may be loaded into the computer system 800.

[0071] The processor unit 804 is configured to perform the functions of the computer system 800. It may be equipped with one or more modules or engines. Each can be implemented using hardware, and in some cases, 80 main memory 8 or the program code and / or program stored in secondary memory 810 You can also use software. In such cases, the program code is computer Before being executed by the hardware of the data system 800, it is executed by the processor unit 804 ( For example, it may be compiled by a compilation module or engine. The program code is any additional processing of the processor device 804 and / or computer system 800. For execution by additional hardware components, assembly language or machine code Even source code written in a programming language that can be translated into low-level languages ​​such as The compilation process involves lexical analysis, preprocessing, syntactic analysis, semantic analysis, syntactic-oriented translation, and coding. Computer systems to generate, optimize, and perform the functions disclosed herein Any suitable translation of program code into a low-level language suitable for controlling the Tem800 This may include the use of other techniques. Those skilled in the art will see that as a result of such a process, computer systems The Stem 800 is a specially configured unit that is uniquely programmed to perform the functions described above. It will clearly be the Pewter System 800.

[0072] The technology according to the present invention, in particular, uses a hash-oriented scheme to enable permissioned access. A system and method for making adjustments using a lock chain are provided. Various exemplary embodiments of the method are described above, but they are not limiting. It should be understood that this is presented solely for illustrative purposes. This is not exhaustive. This disclosure is not limited to the exact form in which it is disclosed. It is possible to modify and transform it, or to deviate from the scope or scope of the practice of this disclosure. Modifications and transformations can be obtained without any further effort.

Claims

1. A method for making adjustments on a permissioned blockchain using a hash-oriented scheme, The processing server stores a blockchain containing multiple blocks, including the latest block, in its memory. The processing unit of the processing server generates a first hash value by hashing a first reference value, The processing device of the processing server generates a block proof including at least the first hash value, the second hash value, the third reference value, and the block value. The processing unit of the processing server verifies the block header included in the latest block of the blockchain using the block proof, The receiving unit of the processing server receives a new block value, The processing unit of the processing server generates a new block header that includes at least the first reference value, the second reference value, the fourth reference value, and the new block value. The processing unit of the processing server generates a new block for the blockchain, which includes the new block header and one or more received transaction data values. A method comprising the step of sending the new block to one or more additional nodes associated with the blockchain by the transmission unit of the processing server.

2. In the method according to claim 1, The processing device of the processing server further includes the step of generating a Merkle tree using one or more transaction data values, The new block header further includes the root of the Merkle tree, in a manner that.

3. The method according to claim 2, wherein the new block header further includes version data and a block header reference value.

4. In the method according to claim 3, A method further comprising the step of generating the block header reference value by hashing the verified block header using the processing device of the processing server.

5. In the method according to claim 1, A method further comprising the step of generating the block value by hashing a combination of the first reference value, the second reference value, the fourth reference value, and one or more data points using the processing device of the processing server.

6. The method according to claim 5, wherein the one or more data points include at least version data, a block header reference value, and the root of a Merkle tree.

7. In the method according to claim 1, A method further comprising the step of generating the second hash value by hashing the fourth reference value using the processing device of the processing server.

8. In the method according to claim 7, A method further comprising the step of storing the fourth reference value in the memory of the processing server.

9. In the method according to claim 1, The first and second reference values ​​are received from an external computing system, and The new block value is received from the external computing system, in a manner.

10. The method according to claim 9, wherein the external computing system is one of the one or more additional nodes associated with the blockchain.

11. A system that uses a hash-oriented scheme to coordinate on a permissioned blockchain, A processing server as a node associated with the blockchain, The blockchain comprises one or more additional nodes associated with the aforementioned blockchain, The aforementioned processing server shall have at least: The transmitting unit, A memory that stores a blockchain containing multiple blocks, including the latest block, The receiving unit, A processing apparatus, including, the processing apparatus, A step of generating a first hash value by hashing a first reference value, The steps include generating a block proof that includes at least the first hash value, the second hash value, the third reference value, and the block value, The steps include: verifying the block header included in the latest block of the blockchain using the block proof; The receiving unit receives a new block value, The aforementioned processing apparatus further, The steps include generating a new block header that includes at least the first reference value, the second reference value, the fourth reference value, and the new block value, The process involves generating a new block for the blockchain, which includes the new block header and one or more received transaction data values, and also performing the steps of The system includes a transmission unit that transmits the new block to at least one of the one or more additional nodes associated with the blockchain.

12. In the system according to claim 11, The processing unit of the processing server further performs the step of generating a Merkle tree using the one or more transaction data values, and also The aforementioned new block header further includes the root of the Merkle tree in the system.

13. The system according to claim 12, wherein the new block header further includes version data and a block header reference value.

14. A system according to claim 13, wherein the processing unit of the processing server further performs the step of generating the block header reference value by hashing the verified block header.

15. A system according to claim 11, wherein the processing unit of the processing server further performs the step of generating the block value by hashing a combination of the first reference value, the second reference value, the fourth reference value, and one or more data points.

16. The system according to claim 15, wherein one or more data points include at least version data, a block header reference value, and the root of a Merkle tree.

17. A system according to claim 11, wherein the processing unit of the processing server further performs the step of generating the second hash value by hashing the fourth reference value.

18. The system according to claim 17, wherein the processing server further includes memory, and the fourth reference value is stored in the memory of the processing server.

19. In the system according to claim 11, The first and second reference values ​​are received from an external computing system, and The new block value is received from the external computing system.

20. The system according to claim 19, wherein the external computing system is one of the one or more additional nodes associated with the blockchain.

Images