WO2023050555A1 - Procédé de stockage distribué à haute performance de données et d'horodatage de bloc, communication inter-chaîne et collaboration de données - Google Patents

Procédé de stockage distribué à haute performance de données et d'horodatage de bloc, communication inter-chaîne et collaboration de données Download PDF

Info

Publication number
WO2023050555A1
WO2023050555A1 PCT/CN2021/134240 CN2021134240W WO2023050555A1 WO 2023050555 A1 WO2023050555 A1 WO 2023050555A1 CN 2021134240 W CN2021134240 W CN 2021134240W WO 2023050555 A1 WO2023050555 A1 WO 2023050555A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
block
chain
nodes
information
Prior art date
Application number
PCT/CN2021/134240
Other languages
English (en)
Chinese (zh)
Inventor
曹春峰
汪洋
巫家竞
赵滨
Original Assignee
中诚区块链研究院(南京)有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from CN202111141592.5A external-priority patent/CN114079660B/zh
Application filed by 中诚区块链研究院(南京)有限公司 filed Critical 中诚区块链研究院(南京)有限公司
Publication of WO2023050555A1 publication Critical patent/WO2023050555A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23—Updating
    • G06F16/2365—Ensuring data consistency and integrity
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/602—Providing cryptographic facilities or services
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
    • H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/12—Applying verification of the received information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
    • H04L67/1078—Resource delivery mechanisms
    • H04L67/108—Resource delivery mechanisms characterised by resources being split in blocks or fragments
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
    • H04L9/3239—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2463/00—Additional details relating to network architectures or network communication protocols for network security covered by H04L63/00
    • H04L2463/121—Timestamp

Definitions

  • the invention belongs to the technical field of block chains, and in particular relates to a high-performance distributed storage block data, time stamp, cross-chain communication and data collaboration method.
  • Blockchain involves many scientific and technical issues such as mathematics, cryptography, Internet and computer programming. From the perspective of application, in simple terms, blockchain is a distributed shared ledger and database, which has the characteristics of decentralization, non-tampering, traceability throughout the process, traceability, collective maintenance, and openness and transparency. These characteristics ensure the "honesty” and “transparency” of the blockchain, and lay the foundation for the creation of trust in the blockchain.
  • the rich application scenarios of the blockchain are basically based on the fact that the blockchain can solve the problem of information asymmetry and realize collaborative trust and concerted action among multiple subjects.
  • Blockchain is a new application model of computer technologies such as distributed data storage, point-to-point transmission, consensus mechanism, and encryption algorithm. Blockchain is an important concept of Bitcoin.
  • the block chain-based data distributed storage and data acquisition method and device disclosed by the authorized announcement number CN112637297A although it realizes that the terminal equipment configured with the D2D protocol can quickly upload the data to the block chain server, the block chain The chain server utilizes blockchain technology to distribute storage in other nodes.
  • each node can directly communicate with each other through multiplexing cell resources (D2D protocol), and quickly and efficiently obtain distributed data stored on other nodes.
  • D2D protocol multiplexing cell resources
  • the purpose of the present invention is to provide a high-performance distributed storage block data, time stamp, cross-chain communication and data collaboration method to solve the problems raised in the above-mentioned background technology.
  • the present invention provides the following technical solution: a high-performance distributed storage block data, time stamp, cross-chain communication and data collaboration method, including the following method steps:
  • the block data information is connected in a chain: after fragmentation in S1, all the fragments in each data file are connected, and the branch chain chain connection is performed through the address timestamp to complete the same data file All fragments in the database are connected organically to improve the speed of data information retrieval;
  • the data file information is stored in all nodes through distributed storage: the data file information is stored in all nodes through distributed storage, and then the data file information can be quickly queried and stored. , effectively improve the operation of data collaboration, and there is a server at the center of the blockchain to receive and forward all the information of the blockchain nodes, reducing the complexity of accessing all nodes when nodes perform data queries degree;
  • the consensus algorithm in S1 includes Proof of Work, Proof of Stake, Proof of Delegated Stake and Practical Byzantine Fault Tolerant Algorithm
  • the Practical Byzantine Fault Tolerant Algorithm is a state machine copy replication algorithm, that is, the service is performed as a state machine Modeling, the state machine performs copy replication on different nodes of the distributed system, and each copy of the state machine saves the state of the service, and at the same time realizes the operation of the service.
  • the set of all copies is represented by the capital letter R, Use an integer from 0 to
  • 3f+1, where f is the maximum number of copies that may fail, although there can be more than 3f+1 copies, but additional A copy of , does not improve reliability other than performance.
  • the data size of the fragments in the S1 is maintained at 128M Bytes, and then written into the dat file in the form of sequenced bytecodes.
  • the process of serialization if it is detected that the current write file size increases If the upper block size is greater than 128M Bytes, a dat file will be regenerated.
  • the specific serialization process is as follows:
  • the fragmentation in S1 includes the following steps:
  • the storage system divides data into smaller pieces, a process called sharding, which breaks down data into manageable chunks that can be distributed across multiple nodes;
  • Encrypt each shard After sharding, the storage system needs to encrypt each shard of data on the local system, the content owner has full control over this process, the goal is to ensure that no one other than the content owner can view/access the data in the shard data, regardless of where the data is located, whether that data is static or dynamic;
  • the blockchain storage system generates a unique hash based on the shard’s data or encryption key—that is, a fixed-length encrypted output string, which is added to the ledger and the shard element data in order to link transactions to shards of storage;
  • Replicate each shard The storage system replicates each shard so there are enough redundant copies to ensure availability and performance and prevent performance degradation and data loss, the number of replicas per shard is up to the content owner and where those shards reside, where the content owner establishes a threshold for the minimum number of replicas that need to be maintained to ensure no data loss;
  • the P2P network distributes replicated shards to geographically dispersed storage nodes, whether regional or global, multiple organizations or individuals own storage nodes, and rent additional storage space in exchange for some type of compensation , no one entity can own all storage resources, or control the storage infrastructure, and only content owners have full access to all their data, no matter where these nodes are located;
  • the storage system records all transactions in the blockchain ledger and synchronizes this information among all nodes.
  • the ledger stores details related to transactions. Since the ledger is based on blockchain technology, it It is transparent, verifiable, traceable, and tamper-resistant.
  • the timestamp in the S3 is in the block header, the block header and the block body together constitute a block, and the block body records all transaction data during the period when the block is created, and these records are passed through
  • the merkle tree is organized, and the hash value of the merkle tree root is put into the block header as the summary, abstract, and "fingerprint" of all transaction records in this block.
  • the block header includes not only the merkle tree root, but also the previous block header
  • the summary that is, the merkle tree root of the previous block, the timestamp of this block, and the height: that is, counting from the first block, the information of which block this block is.
  • connection between the fragments in the S2 is implemented through address information and a hash algorithm to implement an accurate algorithm, maintain the connection between the fragments, and realize the connection during the query, and complete the connection of the data file during the query. Extract all.
  • the storage in the S4 supports storing custom types of structured data, thereby increasing the expansion;
  • Nervos supports the deployment of different consensus algorithms through the Generator to achieve a balance between performance and network decentralization.
  • Nervos proposes a new Blockchain design consists of a cell that can store multiple data, and an application execution logic generator Generator, Validator, Type, and Identity to form a distributed architecture capable of autonomy and verification separation.
  • Nervos has changed the original data input , verification, packaging process, when an event X occurs, the client first confirms the identity through Identity verification, and at the same time stores the corresponding mapping of the state Y outside the chain to the client through the consensus, and executes the logic generator Generator to convert the event state Y , passed to the accounting node through the hash, the node only needs the Validator to verify whether the mapping on the chain is consistent with the event state Y under the chain, and if confirmed, it will be packaged into the next block.
  • the storage is a state mapping
  • the chain can infer whether the data on the chain and the data off the chain are consistent through reverse logic, and if the newly added node is a synchronous node, the accounting nodes responsible for the calculation work are all in operation Parties or participants, the management contract can also set the weight of the bookkeeping nodes. This level requires better node voting decisions and dynamic joining.
  • the heterogeneous cross-chain PegZone in S5 includes five parts, which are:
  • smart contract the role of asset custody in token custody in Ethereum and Cosmos, it mainly provides four methods: lock, unlock, mint and destroy;
  • PegZone is a Tendermint-based blockchain that maintains user account information, allows asset transfers between users and provides transaction queries;
  • Secp256k1 is used to sign the transaction so that the signature can be effectively verified by the smart contract; this corresponds to the validator public key set of the smart contract;
  • the relay is responsible for all transaction forwarding, forwarding the signed SignTx to the smart contract.
  • each master node in the practical Byzantine fault-tolerant algorithm is called a view
  • v represents the view number
  • Its operation method process when working normally, receive the transaction request from the client, after verifying the identity of the request, set the number for the request, and broadcast the pre-prepare message;
  • the new master node When the new master node is elected, it will send View-New information according to the View-Change message collected by itself, so that other nodes can synchronize data;
  • the master node maintains a heartbeat with all other nodes
  • the master node does not send the received request.
  • the client fails to reply after a timeout, it will resend the request to all replica nodes and trigger view-change;
  • the primary node tampers with the message. Because there is data and the signature of the client in the Request, the primary cannot tamper with the message. The other replicas will first verify the legitimacy of the message, otherwise discard it and trigger view-change.
  • the present invention realizes the distributed storage of the data information of the block chain, and completes the fast identification process through the consensus algorithm, accelerates the storage and upload of the data information inside the block chain, and realizes the fragmented storage of the data information, speeding up
  • the storage speed and query speed are convenient for processing and use, and the time stamp is carried on the data, which can facilitate the storage and query of data information, and realize cross-chain communication between different blockchains, and complete the data exchange between data information Collaboration improves the transmission and connection of data information between blockchains for ease of use and operation.
  • Fig. 1 is the step structural representation of the present invention
  • Fig. 2 is a schematic diagram of the dat file serialization steps of the present invention.
  • Fig. 3 is a schematic diagram of fragmentation steps in the present invention.
  • the present invention provides a technical solution: a high-performance distributed storage block data, time stamp, cross-chain communication and data collaboration method, including the following method steps:
  • the block data information is connected in a chain: after fragmentation in S1, all the fragments in each data file are connected, and the branch chain chain connection is performed through the address timestamp to complete the same data file All fragments in the database are connected organically to improve the speed of data information retrieval;
  • the data file information is stored in all nodes through distributed storage: the data file information is stored in all nodes through distributed storage, and then the data file information can be quickly queried and stored. , effectively improve the operation of data collaboration, and there is a server at the center of the blockchain to receive and forward all the information of the blockchain nodes, reducing the complexity of accessing all nodes when nodes perform data queries degree;
  • the consensus algorithm in S1 includes proof of work, proof of equity, proof of entrusted equity and practical Byzantine fault-tolerant algorithm.
  • Byzantine Fault Tolerance Algorithm A state machine copy replication algorithm, that is, the service is modeled as a state machine, and the state machine is copied on different nodes in the distributed system.
  • Each copy of the state machine saves the state of the service, and also realizes The operation of the service, the set of all replicas is represented by the capital letter R, and each replica is represented by an integer from 0 to
  • 3f+1, where f is a replica that may fail Maximum number, although there can be more than 3f+1 replicas, additional replicas do not improve reliability other than performance.
  • the data size of the fragmentation in the S1 is kept at 128M Bytes, and then written in the dat file in the form of a sequence of bytecodes, During the serialization process, if it is detected that the current written file size plus the block size is greater than 128M Bytes, a dat file will be regenerated.
  • the specific serialization process is as follows:
  • the fragmentation in S1 includes the following steps:
  • the storage system divides data into smaller pieces, a process called sharding, which breaks down data into manageable chunks that can be distributed across multiple nodes;
  • Encrypt each shard After sharding, the storage system needs to encrypt each shard of data on the local system, the content owner has full control over this process, the goal is to ensure that no one other than the content owner can view/access the data in the shard data, regardless of where the data is located, whether that data is static or dynamic;
  • the blockchain storage system generates a unique hash based on the shard’s data or encryption key—that is, a fixed-length encrypted output string, which is added to the ledger and the shard element data in order to link transactions to shards of storage;
  • Replicate each shard The storage system replicates each shard so there are enough redundant copies to ensure availability and performance and prevent performance degradation and data loss, the number of replicas per shard is up to the content owner and where those shards reside, where the content owner establishes a threshold for the minimum number of replicas that need to be maintained to ensure no data loss;
  • the P2P network distributes replicated shards to geographically dispersed storage nodes, whether regional or global, multiple organizations or individuals own storage nodes, and rent additional storage space in exchange for some type of compensation , no one entity can own all storage resources, or control the storage infrastructure, and only content owners have full access to all their data, no matter where these nodes are located;
  • the storage system records all transactions in the blockchain ledger and synchronizes this information among all nodes.
  • the ledger stores details related to transactions. Since the ledger is based on blockchain technology, it It is transparent, verifiable, traceable, and tamper-resistant.
  • the time stamp in S3 is in the block header, the block header and the block body together form a block, and the block body records the block All transaction data during the period of creation, these records are organized through the merkle tree, and the hash value of the root of the merkle tree is put into the block header as the summary, summary, and "fingerprint" of all transaction records in this block.
  • the block header contains not only the merkle tree root, but also the summary of the previous block header, that is, the merkle tree root of the previous block, the timestamp of this block, and the height: that is, counting from the first block, this block It is the information of the first few blocks.
  • the connection between the fragments in the S2 implements an accurate algorithm through address information and a hash algorithm, and maintains the connection between the fragments , can realize the connection during the query, and complete the extraction of all the data files during the query.
  • the storage in S4 supports storage of self-defined structured data, thereby increasing expansion; Nervos supports deploying different The consensus algorithm achieves a balance between performance and network dispersion.
  • Nervos proposes a new blockchain design, which consists of five elements: a cell that can store multiple data, and an application execution logic generator Generator, Validator, Type, and Identity. Forming a distributed architecture capable of autonomy and verification separation, Nervos has changed the original data input, verification, and packaging processes.
  • an event X occurs, the client first confirms its identity through Identity verification, and at the same time, the state Y outside the chain is passed through consensus.
  • the node only needs the Validator to verify whether the mapping on the chain is consistent with the event state Y off the chain. If it is confirmed, it will be packaged into the next block.
  • the storage is the mapping of the state.
  • the chain can infer whether the data on the chain and the data off the chain are consistent through reverse logic.
  • the accounting nodes are all on the operator or participating side, and the management contract can also set the weight of the accounting nodes. At this level, better node voting decisions and dynamic joining are required.
  • the heterogeneous cross-chain PegZone in S5 includes five parts, which are:
  • smart contract the role of asset custody in token custody in Ethereum and Cosmos, it mainly provides four methods: lock, unlock, mint and destroy;
  • PegZone is a Tendermint-based blockchain that maintains user account information, allows asset transfers between users and provides transaction queries;
  • Secp256k1 is used to sign the transaction so that the signature can be effectively verified by the smart contract; this corresponds to the validator public key set of the smart contract;
  • the relay is responsible for all transaction forwarding, forwarding the signed SignTx to the smart contract.
  • the working process of each master node in the practical Byzantine fault-tolerant algorithm is called a view, and v represents the view number
  • Its operation method process when working normally, receive the transaction request from the client, after verifying the identity of the request, set the number for the request, and broadcast the pre-prepare message;
  • the new master node When the new master node is elected, it will send View-New information according to the View-Change message collected by itself, so that other nodes can synchronize data;
  • the master node maintains a heartbeat with all other nodes
  • the master node does not send the received request.
  • the client fails to reply after a timeout, it will resend the request to all replica nodes and trigger view-change;
  • the primary node tampers with the message. Because there is data and the signature of the client in the Request, the primary cannot tamper with the message. The other replicas will first verify the legitimacy of the message, otherwise discard it and trigger view-change.
  • the first step is to upload the block data information and store it effectively: when storing the block data information, first send a request to a certain node in the block chain, and complete the quick determination through the consensus algorithm , and then divide the data file into pieces, and implement encryption and hash generation for each data piece, and then copy, differentiate and record it on the ledger;
  • the second step the block data information is connected in a chain: after fragmentation in S1, connect all the fragments in each data file, and perform branch chain chain connection through the address timestamp to complete the same All fragments in the data file are connected organically to improve the speed of data information retrieval;
  • the third step when the data file information is uploaded, carry the time stamp: when the data file information is uploaded, the time stamp is carried on the block header of the data file information, and each fragment of the data file information is changed
  • the block headers of each block carry the same time stamp, and are finally connected into a blockchain according to the sequence of block generation time, and then realize distributed storage of data file information according to different time stamps, and each independent node passes through
  • the P2P network establishes a connection, thus forming a decentralized distributed time stamp service system for the recording of information data;
  • the fourth step is to store the data file information in all nodes through distributed storage: through distributed storage, the data file information is stored in all nodes, and then the data file information can be quickly queried and stored. It can effectively improve the operation of data collaboration, and there is a server at the center of the blockchain to receive and forward all the information of the blockchain nodes, reducing the need for nodes to access all nodes when performing data queries the complexity of
  • the fifth step is to carry out cross-chain communication between different blockchains, complete effective cross-chain communication, and improve the coordination of data information: through the notary mechanism, side chain, relay, and hash between different blockchains Locking, distributed private key control or heterogeneous cross-chain PegZone realizes cross-chain connections, enabling communication connections between different blockchains.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Theoretical Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Hardware Design (AREA)
  • Databases & Information Systems (AREA)
  • Computing Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • General Health & Medical Sciences (AREA)
  • Software Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

La présente invention concerne un procédé de stockage distribué à haute performance de données de bloc et d'horodatage, de communication inter-chaîne et de collaboration de données. Le procédé consiste à : S1, télécharger vers l'amont des informations de données de bloc, et les stocker de façon efficace ; S2, effectuer une connexion de type chaîne sur les informations de données de bloc ; S3, lorsqu'elles sont téléchargées, des informations de fichier de données portent une estampille temporelle ; S4, stocker respectivement les informations de fichier de données dans tous les noeuds au moyen d'un stockage distribué ; et S5, réaliser une communication inter-chaîne entre différentes chaînes de blocs, de manière à achever une communication inter-chaîne efficace, ce qui permet d'améliorer la collaboration des informations de données. Au moyen de la présente invention, le stockage distribué d'informations de données de chaînes de blocs est réalisé, un processus d'identification rapide est achevé au moyen d'un algorithme de consensus, le stockage par fragmentation des informations de données est réalisé, une estampille temporelle est apportée à des données, et une communication inter-chaîne entre différentes chaînes de blocs est réalisée, de façon à achever la collaboration de données entre les informations de données.
PCT/CN2021/134240 2021-09-28 2021-11-30 Procédé de stockage distribué à haute performance de données et d'horodatage de bloc, communication inter-chaîne et collaboration de données WO2023050555A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111141592.5A CN114079660B (zh) 2021-09-28 一种高性能分布式存储区块数据、时间戳、跨链通信与数据协同方法
CN202111141592.5 2021-09-28

Publications (1)

Publication Number Publication Date
WO2023050555A1 true WO2023050555A1 (fr) 2023-04-06

Family

ID=80283515

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/134240 WO2023050555A1 (fr) 2021-09-28 2021-11-30 Procédé de stockage distribué à haute performance de données et d'horodatage de bloc, communication inter-chaîne et collaboration de données

Country Status (1)

Country Link
WO (1) WO2023050555A1 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116567631A (zh) * 2023-07-06 2023-08-08 北京航空航天大学 一种基于分片区块链的移动终端安全认证方法
CN116561182A (zh) * 2023-07-07 2023-08-08 华北电力大学 一种基于区块链的电力数据存储方法及系统
CN116915404A (zh) * 2023-09-13 2023-10-20 华中科技大学 基于区块链技术的工程数据跨链协同方法及其系统
CN117319422A (zh) * 2023-11-28 2023-12-29 天津市城市规划设计研究总院有限公司 一种城市规划领域物联网数据的区块链成块方法及系统
CN117478304A (zh) * 2023-12-28 2024-01-30 湖南天河国云科技有限公司 区块链管理方法、系统和计算机设备
CN117494219A (zh) * 2023-12-29 2024-02-02 智慧(东营)大数据有限公司 一种基于区块链技术的票据管理系统及方法
CN117574447A (zh) * 2024-01-16 2024-02-20 中国标准化研究院 一种基于区块链技术的数据存证和溯源系统

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109587253A (zh) * 2018-12-11 2019-04-05 浙江大学 一种基于区块链对文件实现分布式存储的方法
US20190340267A1 (en) * 2018-05-01 2019-11-07 International Business Machines Corporation Blockchain implementing cross-chain transactions
US20200112445A1 (en) * 2018-10-08 2020-04-09 International Business Machines Corporation Blockchain timestamp agreement
CN111507730A (zh) * 2020-05-12 2020-08-07 北京俩撇科技有限公司 一种区块链跨链方法及装置
CN112256663A (zh) * 2020-10-30 2021-01-22 深圳壹账通智能科技有限公司 基于区块链的分布式文件存储方法及系统
CN112988764A (zh) * 2021-05-14 2021-06-18 北京百度网讯科技有限公司 数据存储方法、装置、设备和存储介质

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190340267A1 (en) * 2018-05-01 2019-11-07 International Business Machines Corporation Blockchain implementing cross-chain transactions
US20200112445A1 (en) * 2018-10-08 2020-04-09 International Business Machines Corporation Blockchain timestamp agreement
CN109587253A (zh) * 2018-12-11 2019-04-05 浙江大学 一种基于区块链对文件实现分布式存储的方法
CN111507730A (zh) * 2020-05-12 2020-08-07 北京俩撇科技有限公司 一种区块链跨链方法及装置
CN112256663A (zh) * 2020-10-30 2021-01-22 深圳壹账通智能科技有限公司 基于区块链的分布式文件存储方法及系统
CN112988764A (zh) * 2021-05-14 2021-06-18 北京百度网讯科技有限公司 数据存储方法、装置、设备和存储介质

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116567631A (zh) * 2023-07-06 2023-08-08 北京航空航天大学 一种基于分片区块链的移动终端安全认证方法
CN116567631B (zh) * 2023-07-06 2023-09-15 北京航空航天大学 一种基于分片区块链的移动终端安全认证方法
CN116561182A (zh) * 2023-07-07 2023-08-08 华北电力大学 一种基于区块链的电力数据存储方法及系统
CN116561182B (zh) * 2023-07-07 2023-09-19 华北电力大学 一种基于区块链的电力数据存储方法及系统
CN116915404A (zh) * 2023-09-13 2023-10-20 华中科技大学 基于区块链技术的工程数据跨链协同方法及其系统
CN116915404B (zh) * 2023-09-13 2023-11-17 华中科技大学 基于区块链技术的工程数据跨链协同方法及其系统
CN117319422A (zh) * 2023-11-28 2023-12-29 天津市城市规划设计研究总院有限公司 一种城市规划领域物联网数据的区块链成块方法及系统
CN117319422B (zh) * 2023-11-28 2024-02-02 天津市城市规划设计研究总院有限公司 一种城市规划领域物联网数据的区块链成块方法及系统
CN117478304A (zh) * 2023-12-28 2024-01-30 湖南天河国云科技有限公司 区块链管理方法、系统和计算机设备
CN117478304B (zh) * 2023-12-28 2024-03-01 湖南天河国云科技有限公司 区块链管理方法、系统和计算机设备
CN117494219A (zh) * 2023-12-29 2024-02-02 智慧(东营)大数据有限公司 一种基于区块链技术的票据管理系统及方法
CN117574447A (zh) * 2024-01-16 2024-02-20 中国标准化研究院 一种基于区块链技术的数据存证和溯源系统
CN117574447B (zh) * 2024-01-16 2024-04-16 中国标准化研究院 一种基于区块链技术的数据存证和溯源系统

Also Published As

Publication number Publication date
CN114079660A (zh) 2022-02-22

Similar Documents

Publication Publication Date Title
WO2023050555A1 (fr) Procédé de stockage distribué à haute performance de données et d'horodatage de bloc, communication inter-chaîne et collaboration de données
Tseng et al. Blockchain for managing heterogeneous internet of things: A perspective architecture
US10103893B2 (en) Blockchain-supported, fail-safe synchronization in a data authentication infrastructure
Bandara et al. Mystiko—blockchain meets big data
CN111611315B (zh) 面向金融大数据的多叉树结构区块链集成优化存储方法
US20200143366A1 (en) Methods for decentralized digital asset transfer and smart contract state transition
CN110046894B (zh) 一种基于纠删码的分组可重构区块链建立方法
CN109766673A (zh) 一种联盟式音视频版权区块链系统及音视频版权上链方法
CN111159288A (zh) 链式结构数据存储、验证、实现方法、系统、装置及介质
Yadav et al. A comparative study on consensus mechanism with security threats and future scopes: Blockchain
CN108923932A (zh) 一种去中心化协同验证模型及验证算法
US11354335B2 (en) Method and apparatus for obtaining number for transaction-accessed variable in blockchain in parallel
CN114329528A (zh) 一种基于区块链的档案数据管理方法及系统
US20230289782A1 (en) Smart contract-based data processing
CN110750541A (zh) 一种基于区块链的数据存储索引系统及方法
CN115208665B (zh) 一种基于区块链的种质资源数据安全共享方法及系统
WO2021227319A1 (fr) Structure de données de chaîne de blocs collaboratives d'ingénierie et procédé d'application
CN110225012A (zh) 一个基于联盟链的外包数据的拥有权检查和更新方法
CN115883214A (zh) 基于联盟链和cp-abe的电子医疗数据共享系统及方法
TWM586416U (zh) 基於區塊鏈技術實現交易的多中心分散驗證系統
Wels Guaranteed-TX: The exploration of a guaranteed cross-shard transaction execution protocol for Ethereum 2.0.
CN114079660B (zh) 一种高性能分布式存储区块数据、时间戳、跨链通信与数据协同方法
Fang et al. Verifiable secret sharing scheme using merkle tree
Wei et al. Research on Knowledge Consensus Mechanism of Network Learning Space Based on Block Chain
Wang et al. LgTTBFT: Effective Byzantine Fault Tolerance Algorithm Based on Structured Network and Trusted Execution Environment

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21959115

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE