Blockchain Hash Recomputation for Cryptographic Resilience
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchains are vulnerable to cryptographic vulnerabilities in their hash functions, which can compromise data integrity once identified, and cannot be updated with new, more secure hash functions without a hard fork, affecting the validity of all blocks.
Innovation Solution
A method to supplement existing blockchains with a new hash function by computing and storing additional hash values using the new function, allowing for a seamless transition and validation of blocks, even if the original hash function becomes compromised.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a blockchain uses a fixed hash function for data integrity, then data verification is reliable, but the system cannot adapt to future cryptographic vulnerabilities
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing hash values using multiple hash functions (original and alternative) before any vulnerability occurs. Each block contains both the original hash value and an alternative hash value computed with a different hash function, enabling immediate transition if the original function is compromised without requiring blockchain reorganization or hard forks.
Solution Approach 2:
The patent implements parameter changes by introducing multiple hash function parameters (different algorithms) for computing block hash values. The system stores hash values computed with different parameters (original hash function and alternative hash function), allowing dynamic selection and switching between parameters based on security requirements without changing the fundamental blockchain structure.
2Reliability
If a new hash function is implemented to replace a compromised one, then security is improved, but all existing blocks become invalid requiring a hard fork
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing hash values using multiple hash functions (original and alternative) before any vulnerability occurs. Each block contains both the original hash value and an alternative hash value computed with a different hash function, enabling immediate transition if the original function is compromised without requiring blockchain reorganization or hard forks.
Solution Approach 2:
The patent applies copying by creating and storing duplicate hash values computed with different hash functions within the same blockchain structure. The alternative hash values are copied into the block data structure alongside original hash values, providing redundant verification capability that maintains blockchain continuity while enabling security transitions without hard forks.
3Reliability
If additional hash values are computed and stored for each block, then security resilience is improved, but storage requirements and processing complexity increase
Solution Approach 1:
The patent applies partial or excessive action by computing and storing hash values with alternative hash functions only for specific blocks that require enhanced security verification, rather than uniformly for all blocks. This selective approach provides security resilience where needed while minimizing the overall computational and storage overhead across the entire blockchain.
Data Source
AI summary
A blockchain includes blocks that each store a hash value computed using a hash function from data of the block. Another hash value is computed for each block using a different hash function, and added to the block within the blockchain. New blocks subsequently added to the blockchain have hash values computed using just the different hash function.


