Blockchain Ledger Segmentation and Cryptographic Linking

The patent divides a single blockchain ledger into multiple separate ledgers organized in a tree structure, where each ledger contains a subset of transactions. This segmentation allows the system to manage and access smaller, more efficient ledger units while maintaining the overall integrity through cryptographic linking, thus resolving the contradiction between maintaining complete integrity and achieving performance efficiency.

The patent extracts and removes expired or non-useful transactions from active ledgers through a pruning mechanism. By identifying and eliminating obsolete data while preserving the cryptographic integrity of the blockchain structure, the system maintains reliability without being burdened by accumulated expired data, thereby improving performance.

The patent implements a nested tree structure where multiple smaller ledgers are organized hierarchically, with each ledger containing references to parent ledgers through cryptographic hashes. This nesting allows the system to work with smaller, more efficient ledger units while the hierarchical structure ensures that integrity can be verified by traversing the nested relationships, thus maintaining reliability through the nested architecture.

The patent introduces cryptographic hash links as intermediaries between separated ledgers. These hash links serve as mediators that connect disparate ledger segments, allowing the system to maintain efficiency through separation while ensuring integrity through the cryptographic intermediary that verifies the chain of trust between ledgers.

The patent applies local quality by differentiating between active and expired data within the ledger structure. Expired transactions are pruned from active ledgers while their cryptographic essence is preserved in the tree structure, allowing the system to optimize storage by removing redundant expired data locally while maintaining the ability to verify integrity through the preserved cryptographic references.

The patent implements a discarding and recovering mechanism where expired transactions are discarded from active ledgers to reduce storage burden, but their cryptographic hashes are recovered and preserved in the tree structure. This allows the system to eliminate the storage burden of complete expired data while recovering the essential integrity information needed for verification.

The patent introduces dynamic state tracking for ledgers, where each ledger maintains a state indicator (active, archived, or pruned) that can change over time. This dynamic approach allows the system to optimize performance by automatically transitioning ledgers between states based on their age and relevance, managing the complexity through automated state transitions rather than static configurations.

The patent implements self-service mechanisms where ledgers automatically manage their own state transitions and pruning decisions based on predefined criteria. The system autonomously identifies which ledgers to archive or prune without requiring complex external management, reducing overall system complexity by delegating management decisions to the ledgers themselves through self-service protocols.