Blockchain Block Truncation for Scalability
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Blockchain technology faces scalability and performance issues due to its need for all participating nodes to process and store every transaction, leading to high storage and computational requirements, and existing validation methods like Proof-of-Work are computationally expensive, affecting throughput and latency.
Innovation Solution
Implementing a method to truncate blocks older than a predetermined cut-off time through an aging process and using a quorum-based validation system where a subset of nodes independently examine and vote on transaction validity, reducing the computational load and improving scalability and performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all participating nodes process and store every transaction, then trustworthiness and integrity are maintained, but storage requirements and computational load increase significantly
Solution Approach 1:
The patent segments the blockchain validation process by dividing nodes into two categories: full nodes that maintain complete blockchain copies for security, and light nodes that only store essential data (block headers, Merkle roots, and truncated transaction data). This segmentation allows light nodes to participate in the network with minimal storage requirements while full nodes ensure integrity and trustworthiness through complete validation.
Solution Approach 2:
The patent extracts and retains only the essential elements of blockchain data needed for validation and security (block headers, Merkle roots, timestamps, and non-reversible hashes), while removing or truncating the full transaction details from light nodes. This extraction principle enables nodes to maintain trustworthiness through the retained essential elements without storing the complete transaction history.
2Reliability
If all participating nodes process and store every transaction, then data integrity is maintained, but computational requirements and processing time increase
Solution Approach 1:
The patent segments validation responsibilities by having full nodes perform complete transaction validation while light nodes perform simplified validation using only block headers and Merkle roots. This segmentation reduces the computational burden on light nodes while maintaining overall data integrity through the work of full nodes and the cryptographic proofs provided in the essential data.
Solution Approach 2:
The patent uses cryptographic copying mechanisms where light nodes store copies of block headers and Merkle roots that contain sufficient information to verify the integrity of the full blockchain without storing the complete transaction data. These cryptographic copies enable validation with minimal computational overhead.
3Loss of information
If the blockchain grows indefinitely to maintain all transaction history, then traceability is improved, but scalability and performance deteriorate
Solution Approach 1:
The patent extracts the essential traceability elements (block headers, Merkle roots, timestamps, and non-reversible hashes) that preserve the ability to verify transaction history and maintain traceability, while removing the need to store complete transaction data indefinitely. The non-reversible hash function ensures that even truncated data maintains traceability and prevents tampering.
Solution Approach 2:
The patent changes the storage parameters from complete transaction data to essential cryptographic elements (block headers, Merkle roots, timestamps). This parameter change maintains the traceability and integrity verification capabilities while dramatically reducing storage requirements and improving scalability.
4Reliability
If Proof-of-Work validation is used to ensure security, then trustworthiness is maintained, but transaction throughput decreases and latency increases
Solution Approach 1:
The patent replaces the computationally expensive Proof-of-Work mechanism with a lighter validation approach using pre-computed cryptographic proofs (Merkle roots, block headers) that can be verified quickly. The heavy computational work of Proof-of-Work is performed once during block creation, and subsequent validation uses these pre-computed proofs, which are essentially disposable verification tokens that enable fast throughput without compromising security.
Data Source
AI summary
Provided is a method of truncating one or more blocks in a blockchain (300) by an aging process executed by participating computer node (501, 502) of the blockchain. The method includes truncating one or more blocks (310, 320) with a time stamp (210) that is older than a pre-determined cut-off time (t1) by the computer node; creating a new block (360) in which one or more data packets of the new block capture essential data (312, 320) of blocks that are truncated; and appending the new block to the blockchain.