Blockchain Merkle Tree Peer Verification

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Centralized databases face issues such as single points of failure, dependency on network connectivity, limited data access, and difficulty in data retrieval due to lack of redundancy, necessitating a solution for enhanced reliability and accessibility.

Innovation Solution

A blockchain network is employed, utilizing orderer peers to create and propagate block sequences, with peripheral peers calculating hashes and verifying integrity through merkle trees to detect malicious peers and ensure data consistency across the network.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of operation

If a centralized database is used, then ease of management and control is improved, but reliability deteriorates due to single point of failure

Engineering Contradiction:
Improveease of managementVSAvoidreliability
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

The centralized database is segmented into multiple decentralized nodes distributed across the network. Each node maintains a copy of the blockchain ledger, eliminating the single point of failure while preserving management capabilities through consensus protocols.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Instead of storing data in a single centralized location, multiple identical copies of the blockchain ledger are created and distributed to each node in the network. This ensures that if one node fails, the data remains accessible from other nodes, thereby improving reliability while maintaining ease of management through automated replication.

Inventive Principle:
Principle #26Copying

2Quantity of substance

If data is stored in a single location, then data redundancy is minimized, but data loss retrieval becomes difficult

Engineering Contradiction:
Improvedata redundancyVSAvoiddata retrieval
Core Design Contradiction:
Quantity of substanceVSReliability

Solution Approach 1:

The system creates and maintains multiple copies of the blockchain ledger across distributed nodes. Each node stores a complete or partial copy of the ledger, ensuring that data redundancy is achieved without centralization. This allows easy data retrieval even if some nodes fail or data is unexpectedly lost.

Inventive Principle:
Principle #26Copying

3Reliability

If a decentralized blockchain network is implemented, then reliability is improved, but device complexity increases

Engineering Contradiction:
Improvefault toleranceVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The blockchain network implements automated consensus mechanisms and peer-to-peer verification protocols that allow nodes to self-manage and self-verify without centralized coordination. Each node independently validates transactions and blocks, reducing the need for complex external management systems while maintaining high reliability through distributed consensus.

Inventive Principle:
Principle #25Self-service

4Reliability

If merkle tree verification is performed for each block, then data integrity is ensured, but processing time increases

Engineering Contradiction:
Improvedata integrityVSAvoidprocessing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

Instead of verifying the entire blockchain ledger for each block, the system extracts and verifies only the merkle root hash of each block. This extraction approach maintains data integrity verification while significantly reducing processing time, as comparing hash values is computationally much less intensive than verifying all individual transactions within each block.

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS11943237B2Malicious peer identification for database block sequence
Publication Date: 2024.03.26 INTERNATIONAL BUSINESS MACHINE CORPORATION
  • US11943237B2 patent drawing
  • US11943237B2 patent drawing
  • US11943237B2 patent drawing

AI summary

An example operation may include one or more of receiving, by each of one or more peripheral peers of a blockchain network, a sequence of new blocks from an orderer peer, calculating hashes for the sequence of new blocks, adding the hashes to a merkle tree, determining the merkle tree is different than merkle trees from a majority of peripheral peers, determining that one or more blocks that correspond to the different merkle trees from the majority of peripheral peers are different from the sequence of new blocks, and in response ceasing committing blocks to the blockchain network.