Ensuring proof-of-work integrity

Abstract

This invention relates to methods and systems for ensuring the integrity of Proof-of-Work (PoW). Traditional PoW verification relies on verifying valid random numbers, but this method is susceptible to manipulation because it cannot independently verify the entire computation process. This invention proposes a novel solution that securely verifies the complete PoW computation, ensuring that mining tools execute the expected algorithmic steps, rather than exploiting shortcuts or using random numbers derived from different algorithms. By embedding cryptographic proofs within the PoW verification process, this invention prevents tampering and manipulation, enhancing the transparency, security, and trustworthiness of PoW-based blockchain systems. This method strengthens the consensus mechanism and protects the network from malicious actors, ensuring the integrity of the blockchain.

Description

Technical Field

[0001] This invention relates to the field of cryptographic blockchain technology, with a particular focus on improving the integrity of the Proof-of-Work (PoW) mechanism. Specifically, it solves the problem of transmitting and verifying PoW hashes in distributed networks, thereby simplifying the verification of computational workload and establishing robust consensus in decentralized systems. Background Technology

[0002] In Proof-of-Work (PoW) blockchains, mining tools add new blocks by solving cryptographic puzzles, a process involving the discovery of random numbers. These random numbers, when combined with block data and processed by a hashing algorithm, produce a hash that meets the network's difficulty target. Nodes verify blocks by recalculating the hash using the provided random number. However, random number-based verification has security limitations because multiple valid random numbers can produce valid blocks, and valid random numbers can be found without using random number guessing methods for actual proof-of-work, allowing attackers to manipulate the process undetected. This reduces transparency and increases the risk of exploitation vulnerabilities.

[0003] This vulnerability was tested using Pyrinhash V1 and V2 algorithms, employing one algorithm for mining and generating random numbers valid for the other. This demonstrates that valid random numbers can be created without expected computation, exposing flaws in random number-based verification. To address this issue, an invention was developed that ensures the integrity of the entire PoW process by securely verifying the entire hash, preventing manipulation of intermediate steps and misuse of random numbers from different algorithms. This solution enhances the security and trustworthiness of PoW-based blockchain systems.

[0004] CN112907246A discloses a method and system for implementing a blockchain consensus protocol based on the BFT protocol and the PoW mechanism. The method includes the following steps: 1. Initializing the blockchain consensus protocol, which includes participating mining tools, a committee composed of mining tools, and pre-defined honest and malicious mining tools within the committee; 2. Mining tools solve problems for the current committee to qualify for the next committee; 3. The committee verifies the problem answers and then uses these answers as input to the BFT protocol, verifying the legality of the blocks after obtaining them; and 4. When the solutions to the problems reach a preset threshold, the committee rotates. This method solves the problems of high transaction latency and low throughput inherent in blockchain consensus protocols based solely on the PoW mechanism. Compared to other blockchain consensus protocols based on the BFT protocol and PoW mechanism, this blockchain consensus protocol does not interrupt the ongoing consensus process during committee rotation, resulting in better performance—a feature different from the problems addressed by this invention. Summary of the Invention

[0005] The purpose of this invention

[0006] The purpose of this invention is to provide a more secure and reliable method for verifying Proof-of-Work (PoW) in blockchain systems, particularly by ensuring the integrity of the entire computation process, rather than relying solely on the validity of random numbers. In current blockchain systems utilizing PoW, the verification process is based on discovering a valid random number that, when combined with other block data, produces a hash that matches the network's target difficulty. However, this verification mechanism is susceptible to manipulation because it cannot independently confirm the correctness of the entire PoW process.

[0007] By addressing the limitations and vulnerabilities associated with random number-based verification, this invention aims to enhance the security of PoW-based systems, making it more difficult for malicious actors to manipulate the hashing process or use alternative shortcuts. This invention proposes a method for securely and efficiently verifying the entire PoW hash to ensure that the mining tool has performed the complete intended computation, thereby maintaining the integrity of the blockchain network and preventing exploitation or attacks. This integrity is maintained by the fact that the submitter and receiver create the PoW hash using the same input data, and the receiver checks whether its PoW hash matches the submitter's PoW hash.

[0008] Description of the present invention

[0009] The present invention is defined in technical solution 1.

[0010] This invention relates to a method for ensuring the integrity of Proof-of-Work (PoW) in a decentralized network, comprising the following steps: a mining tool submits a PoW hash, a block template, and a random number to a node. The node calculates a new PoW hash based on the block template and random number received from the mining tool, and verifies whether the PoW hash received from the mining tool matches a new PoW hash calculated by the node itself. The node checks whether the received PoW hash is below or equal to the network's target, and once a valid block is created, the node relays the valid block along with the received PoW hash and the random number to other nodes in the decentralized network, wherein the nodes are adapted to verify whether the received block PoW hash matches a PoW hash calculated by the node.

[0011] Preferably, instead of submitting the PoW hash, block template, and random number to the node, the mining tool submits the PoW hash, block template, and random number to a layer, which calculates a new PoW hash based on the block template and random number received from the mining tool, and verifies whether the PoW hash received from the mining tool matches the new PoW hash calculated by the layer itself, and then the layer submits the PoW hash, block template, and random number to the node.

[0012] In another embodiment, the mining tool submits a PoW hash via a communication protocol compatible with the layer or node to verify whether the PoW hash matches a PoW hash computed by the layer or node.

[0013] In another embodiment, the PoW hash is transmitted from the mining tool to the layer or node in a manner that maintains the integrity of the submitted PoW hash, thereby preventing tampering during transmission.

[0014] Furthermore, the integrity of PoW hashes is ensured by maintaining consistency during the transmission process between mining tools, layers, and nodes.

[0015] In another embodiment, the node that receives the valid PoW hash includes the verified PoW hash in the block, thereby ensuring that other network nodes can verify the block by comparing the PoW hash with their own calculations.

[0016] In another embodiment, after verifying the PoW hash, the node propagates the block and the PoW hash to other network nodes, which are adapted to independently verify the PoW hash.

[0017] In addition, nodes verify PoW hashes using hash functions consistent with the network's consensus rules, thereby ensuring that only valid PoW hashes are accepted.

[0018] In another embodiment, the network node re-verifies the PoW hash after receiving the block, thereby ensuring that no tampering occurs during transmission or processing.

[0019] The present invention also relates to a decentralized network that employs a method according to any one of technical solutions 1 to 9 to ensure the integrity of proof-of-work (PoW).

[0020] Furthermore, in another aspect, the present invention relates to a decentralized network that ensures the integrity of proof-of-work, characterized in that nodes are adapted to verify whether the received block PoW hash matches a PoW hash calculated by the node.

[0021] This invention introduces a method to improve the security and integrity of Proof-of-Work (PoW) systems in blockchain networks by ensuring that the validity of the entire computation process is verified, rather than relying solely on the validity of random numbers. In traditional PoW-based systems, mining tools generate random numbers. A random number is a value that, when combined with block data and hashed, produces a valid hash that meets the network's difficulty target. Other nodes in the network then verify the validity of this hash by recalculating the hash using the random number and confirming that it meets the target difficulty. However, this method is susceptible to manipulation because it only verifies whether a correct random number produces a valid hash, without independently verifying the steps involved in generating the hash.

[0022] This invention addresses these limitations by providing comprehensive verification of the entire Proof-of-Work (PoW) process, rather than simply verifying the final hash using random numbers. Specifically, it ensures that the mining tool follows the correct computational steps and adheres to appropriate algorithms throughout the PoW process. This prevents the use of shortcuts or exploits, such as using random numbers derived from different algorithms, which could compromise the integrity of the system.

[0023] To achieve this, the present invention proposes a method for securely transmitting and verifying Proof-of-Work (PoW) hashes in distributed networks. The solution involves embedding cryptographic proofs within the PoW verification process, preventing attackers from bypassing or manipulating intermediate computations. This is achieved through an enhanced hash verification protocol that ensures the integrity of the entire computation, not just the final output hash. By incorporating this method, mining tools are required to prove that they have completed the intended PoW computation, rather than simply generating valid random numbers using alternative methods.

[0024] Furthermore, this invention aims to maintain transparency and reduce the risk of exploitation by revealing the complete computational workload behind PoW, thereby making it more difficult for malicious actors to manipulate or tamper with the system undetected. It creates a more robust and trustworthy consensus mechanism that resists attacks such as mining tools using different algorithms to find valid random numbers or otherwise bypassing the intended verification process.

[0025] This innovation enhances the security of PoW-based blockchain systems by providing a method to prevent the exploitation of random number verification vulnerabilities, thereby ensuring the authenticity of the complete computational work behind each block. Therefore, this invention improves the reliability and robustness of blockchain networks, protects them from potential attacks, and enhances their overall trustworthiness. Attached Figure Description

[0026] The invention is described in detail below with reference to the accompanying drawings, in which:

[0027] Figure 1 It showcased a distributed blockchain network;

[0028] Figure 2 The excavation process, carried out by excavation tools, is shown.

[0029] Figure 3 The verification steps performed by the layer are shown;

[0030] Figure 4 The verification steps performed by the node are shown;

[0031] Figure 5 The verification steps performed by the network node are shown. Detailed Implementation

[0032] Figure 1 A distributed blockchain network 400 is shown, which has a network of mining tools 100, layers 200, and nodes 300 and 500. The distributed blockchain network has a direction for transmitting PoW hashes, so that the PoW hashes propagate in the network 400.

[0033] Figure 2 The demonstration showed that the mining tool 100 sends the PoW hash 108, a random number, and a block template to layer 200 or node 300.

[0034] In step 101, the mining tool receives a mining task or a request for a mining task, and then begins to solve the cryptographic puzzle by incrementing a random number 102 and calculating a PoW hash 103. Next, the mining tool calculates a PoW number 104 to be checked against a target criterion in the next step 105. The PoW number is a PoW hash converted to a large integer such that it can be compared to a pool or network target that is less than or equal to the target number. The target number is a large integer. Using a PoW number is merely an example of a target criterion, which is computationally particularly efficient; other criteria can be applied to verify the PoW completed by the mining tool, as a format of the calculated hash, for example, starting from a certain number of zeros or a number of dots.

[0035] If the PoW number does not match the target criteria, the mining tool 100 returns to the beginning of the process in step 106, increments the random number 102, and continues mining. The mining tool 100 executes the PoW algorithm 103 until it finds a random number that produces a PoW hash that conforms to the target criteria set by the network. Only when the PoW number is correct does the mining tool 100 submit the PoW hash along with the random number and block template to the layer server or directly to the node in step 108. If the PoW algorithm fails in step 106 and does not produce a PoW hash and PoW number that are lower than or equal to the pool or network target, the mining tool will restart the loop due to the failure to find a valid random number.

[0036] Once layer 200 or node 300 receives the PoW hash, it converts the PoW hash into a PoW hash number and checks if it is less than or equal to the target.

[0037] Now see Figure 3 The diagram illustrates the verification process, where layer 200 receives the PoW hash and random number 201 from mining tool 100 and before submitting the PoW hash, block template, and random number 211 to node 300. In a preferred embodiment, layer 200 uses the PoW algorithm with the submitted random number and block template to recalculate the PoW hash in step 202. Subsequently, in step 203, it verifies whether the self-calculated PoW hash matches the submitted PoW hash of the mining tool, and in steps 205, 206, and 207, it verifies whether the PoW hash, which becomes a large integer, is less than or equal to the network target. After successful verifications 207 and 210, layer 200 forwards the block to node 300. If verification fails in step 208 or step 204, layer 200 cannot accept the block, and layer 200 can prevent the mining tool from submitting incorrect PoW hashes in step 209.

[0038] Figure 4After receiving the PoW hash and random number in step 301 during the block request submission and before relaying block 311 to its peers in network 400, the verification process runs on network node 300. See now. Figure 4 In a preferred embodiment, the node performs block data verification step 302, and then performs its own verification by recalculating the PoW hash 303, thereby ensuring that it matches the submitted hash in steps 304, 305, or 306. Subsequently, it converts the PoW hash to a PoW number in step 307, and checks whether the PoW number is lower than or equal to the network target in step 308. If these and other block creation requirements are met, the process follows steps 310 and 311, whereby the node adds the block to the blockchain in step 311 and relays it to its peer in step 314. If the path in step 309 does not meet these and other block creation requirements, the node can ignore the block and prevent mining tools or layers from submitting incorrect PoW hashes in step 313.

[0039] Figure 5 This illustrates the process at network node 300 after receiving the PoW hash and random number in step 301 during a relay block request and before relaying the block to its peer in the network in step 311. See now. Figure 5 In a preferred embodiment, each peer node receives the PoW hash, block template, and random number in step 501, and verifies the block in step 502. Further verification is performed by recalculating the PoW hash in step 503 and verifying the random number in steps 504 and 506. If verification fails, the random number and the received PoW hash do not match the target, the process follows the path via step 503, returns the block, and disables mining tools. Once it is confirmed in step 506 that the PoW hash number is below or equal to the target and in step 508 that the self-calculated PoW hash matches the received PoW hash, the block is added to its local blockchain in step 511 and further propagated across the network in step 514. If it cannot confirm whether the self-calculated PoW hash matches the received PoW hash, the process continues to steps 509 and 513, which can prohibit peers from submitting incorrect PoW hashes.

[0040] This invention proposes a groundbreaking method to improve the security and integrity of Proof-of-Work (PoW) mechanisms in blockchain networks. It addresses a critical vulnerability in existing random-number-based verification systems by ensuring the verification of the entire computation process, not just random numbers. This method enhances the robustness, transparency, and security of decentralized systems by verifying that all computational steps are correctly executed according to the prescribed PoW algorithm.

[0041] Current random number-based verification only confirms whether a given block template and random numbers produce a PoW hash equal to or below a target threshold. However, this process cannot verify whether the mining tool followed the correct computational steps, making the system vulnerable to manipulation. For example, an attacker could exploit this weakness by using alternative or invalid algorithms to generate random numbers while still producing a valid hash. Such exploitation undermines the integrity of the PoW process and allows malicious actors to bypass the network's intended computational workload.

[0042] As demonstrated by the Pyrinhash V1 and V2 algorithms, one algorithm can generate a valid random number while another algorithm verifies that valid random number. This bypasses the prescribed computational process and compromises the security of the blockchain. Furthermore, current verification systems lack transparency because they do not disclose the intermediate steps involved in generating valid random numbers. This creates an environment where undetected shortcuts and exploits can occur.

[0043] This invention aims to address these vulnerabilities by shifting the focus of PoW verification from individual random numbers to the entire computation process. This involves verifying whether the computed PoW hash of a mining tool matches a self-computed PoW hash based on a submitted block template and random numbers. This ensures that the mining tool is not manipulated or uses shortcuts while executing the prescribed algorithm. By verifying each step of the PoW computation, this invention prevents the use of invalid or substituted algorithms and maintains the integrity of the network.

[0044] The verification process is divided into several stages to protect the PoW mechanism:

[0045] This comprehensive verification ensures that each participant in the network independently verifies the integrity of the PoW computation. By incorporating the entire computation process into the verification, this invention eliminates the vulnerabilities associated with random number-based systems. The mining tool is forced to perform the expected computation, ensuring adherence to the prescribed algorithm.

[0046] Including PoW hash verification strengthens the consensus mechanism, making it more resistant to attacks and maintaining blockchain integrity. Data transmission consistency stems from the fact that the submitter and receiver create a PoW hash using the same input data, and the receiver checks whether its PoW hash matches the submitter's PoW hash.

[0047] Transparency is enhanced by revealing the computational steps behind each PoW hash, thereby fostering trust and credibility among network participants. A secure transmission protocol protects the integrity of the PoW hash during transmission, preventing tampering between mining tools, layers, and nodes. The decentralized nature of the verification process, where each node independently verifies the PoW process, eliminates reliance on single points of failure and improves the network's resilience against attacks.

Claims

1. A method for ensuring the integrity of Proof-of-Work (PoW) in a decentralized network (400), comprising the following steps: The mining tool (100) submits the PoW hash, block template, and random number to the node (300); The node (300) calculates a new PoW hash based on the block template and the random number received from the mining tool (100), and verifies whether the PoW hash received from the mining tool (100) matches the new PoW hash calculated by the node itself. The node (300) checks whether the received PoW hash is lower than or equal to the network's target, and once a valid block is created, the node (300) relays the valid block, along with the received PoW hash and the random number, to other nodes within the decentralized network (400), wherein the node (500) is adapted to verify whether the received block PoW hash matches the PoW hash calculated by the node (500).

2. The method according to claim 1, wherein Instead of submitting the PoW hash, the block template, and the random number to the node (300), the mining tool (100) submits the PoW hash, the block template, and the random number to the layer (200). The layer (200) calculates a new PoW hash based on the block template received from the mining tool (100) and the random number, and verifies whether the PoW hash received from the mining tool (100) matches the new PoW hash calculated by the layer itself. The layer (200) then submits the PoW hash, the block template, and the random number to the node (300).

3. The method according to claim 1 or 2, wherein the mining tool (100) submits the PoW hash via a communication protocol compatible with the layer (200) or the node (300) for verifying whether the PoW hash matches the PoW hash calculated by the layer (200) or the node (300).

4. The method according to claim 1 or 2, wherein the PoW hash is transmitted from the mining tool (100) to the layer (200) or the node (300) in a manner that maintains the integrity of the submitted PoW hash, thereby preventing tampering during transmission.

5. The method according to claim 1 or 2, wherein the integrity of the PoW hash is ensured by maintaining its consistency during the transmission process between the mining tool (100), the layer (200), and the node (300).

6. The method of claim 1 or 2, wherein the node receiving the valid PoW hash includes the verified PoW hash in the block, thereby ensuring that other network nodes can verify the block by comparing the PoW hash with their own computation.

7. The method according to claim 1 or 2, wherein after verifying the PoW hash, the node propagates the block and the PoW hash to other network nodes, which are adapted to independently verify the PoW hash.

8. The method of claim 1 or 2, wherein the node verifies the PoW hash according to a hash function consistent with the consensus rules of the network, thereby ensuring that only valid PoW hashes are accepted.

9. The method according to claim 1 or 2, wherein the network node re-verifies the PoW hash after receiving the block, thereby ensuring that no tampering occurs during transmission or processing.

10. A decentralized network (400) employing the method according to any one of claims 1 to 9 to ensure the integrity of proof-of-work (PoW).

11. A decentralized network (400) that ensures the integrity of Proof-of-Work (PoW), characterized in that, The node (500) is adapted to verify whether the PoW hash of the received block matches the PoW hash calculated by the node (500).

Images