CN114079660A - High-performance distributed storage area data, timestamp, cross-link communication and data cooperation method - Google Patents
High-performance distributed storage area data, timestamp, cross-link communication and data cooperation method Download PDFInfo
- Publication number
- CN114079660A CN114079660A CN202111141592.5A CN202111141592A CN114079660A CN 114079660 A CN114079660 A CN 114079660A CN 202111141592 A CN202111141592 A CN 202111141592A CN 114079660 A CN114079660 A CN 114079660A
- Authority
- CN
- China
- Prior art keywords
- data
- block
- chain
- nodes
- information
- Prior art date
- Legal status (The legal status 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 status listed.)
- Pending
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
Abstract
The invention discloses a high-performance distributed storage area data, timestamp, cross-link communication and data cooperation method; s1, uploading block data information and effectively storing the block data information; s2, performing chain connection on the block data information; s3, carrying a timestamp when the data file information is uploaded; s4, respectively storing the data file information in all nodes through distributed storage; s5, performing cross-link communication among different block chains, completing effective cross-link communication, and improving the cooperation of data information; the invention realizes distributed storage of data information of the block chain, completes the rapid identification process through a consensus algorithm, realizes fragment storage of the data information, carries a time stamp on the data, realizes cross-chain communication among different block chains, and completes data cooperation among the data information.
Description
Technical Field
The invention belongs to the technical field of block chains, and particularly relates to a high-performance distributed storage area data, timestamp, cross-chain communication and data cooperation method.
Background
Blockchains involve many scientific and technical problems with mathematics, cryptography, the internet, and computer programming. From the application perspective, the blockchain is simply a distributed shared account book and database, and has the characteristics of decentralization, no tampering, trace remaining in the whole process, traceability, collective maintenance, public transparency and the like. The characteristics ensure the honesty and the transparency of the block chain and lay a foundation for creating trust for the block chain. And the rich application scenes of the block chains basically solve the problem of information asymmetry based on the block chains, and realize the cooperative trust and consistent action among a plurality of main bodies. The blockchain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism and an encryption algorithm. The block chain is an important concept of bitcoin, which is essentially a decentralized database, and as a bottom-layer technology of bitcoin, is a series of data blocks generated by using a cryptographic method for correlation, each data block contains information of a batch of bitcoin network transactions for verifying the validity (anti-counterfeiting) of the information and generating a next block, however, various block chains in the market still have various problems.
Although the method and the apparatus for distributed storage and data acquisition based on blockchain disclosed in the grant publication No. CN112637297A implement that a terminal device configured with D2D protocol can upload data to a blockchain server quickly, the blockchain server stores data in other nodes in a distributed manner by using blockchain technology. Meanwhile, the nodes can directly communicate through multiplexing cell resources (D2D protocol), and quickly and efficiently acquire data which are distributed and stored on other nodes, but the problems that the existing method cannot effectively perform high-performance distributed data storage, and carry time stamps on the data, and perform effective cross-link communication and data coordination are not solved, and therefore a high-performance distributed storage area data, time stamps, cross-link communication and data coordination method is provided.
Disclosure of Invention
The invention aims to provide a high-performance distributed storage area data, timestamp, cross-link communication and data cooperation method to solve the problems in the background technology.
In order to achieve the purpose, the invention provides the following technical scheme: a high-performance distributed storage area data, time stamp, cross-chain communication and data cooperation method comprises the following steps:
s1, uploading block data information, and performing effective storage: when the block storage of the data information is carried out, a request is sent to a certain node in a block chain, the quick determination is completed through a consensus algorithm, then the data file is fragmented, each data fragment is encrypted and generates hash, and then the data file is copied, differentiated and recorded on a ledger;
s2, linking the block data information: after the fragmentation is carried out in S1, all the fragments in each data file are connected, and branched chain type connection is carried out through the address time stamp, so that organic data connection is carried out on all the fragments in the same data file, and the rapidity of data information during retrieval is improved;
s3, when uploading the data file information, carrying a timestamp: when data file information is uploaded, a timestamp is carried on a block head of the data file information, the same timestamp is carried on the block head of each fragment of the data file information, the block heads are finally connected into a block chain according to the sequence of block generation time, distributed storage of the data file information is realized according to different timestamps, and each independent node establishes contact through a P2P network, so that a decentralized distributed timestamp service system is formed for recording information data;
s4, respectively storing the data file information in all the nodes through distributed storage: the data file information is respectively stored in all the nodes through distributed storage, so that the data file information can be rapidly inquired and stored, the data cooperation operation is effectively improved, the server is arranged at the center of the block chain, all the information of the block chain nodes is received and forwarded, and the complexity of accessing all the nodes when the nodes inquire the data is reduced;
s5, performing cross-link communication among different block chains, completing effective cross-link communication, and improving the cooperation of data information: the cross-link connection is realized among different block chains through a notary mechanism, a side chain, a relay, Hash locking, distributed private key control or heterogeneous cross-link PegZones, so that the communication connection can be realized among different block chains.
Preferably, the consensus algorithm in S1 includes workload certification, equity certification, delegation equity certification, and a practical byzantine fault-tolerant algorithm, where the practical byzantine fault-tolerant algorithm is a state machine copy replication algorithm, that is, a service is modeled as a state machine, the state machine performs copy replication at different nodes of a distributed system, each copy of the state machine stores a state of the service, and the operation of the service is also achieved, a set of all copies is represented by an upper case letter R, each copy is represented by an integer from 0 to | R | -1, and if | R | 3f +1, where f is the maximum number of copies that may fail, although there may be more than 3f +1 copies, the additional copies may not improve reliability except for reduced performance.
Preferably, the data size of the slice in S1 is maintained at 128M Bytes, and then the slice is written into the dat file in the form of serial bytecodes, and during the serialization process, if it is detected that the size of the currently written file plus the block size is larger than 128M Bytes, a dat file is regenerated, and the specific serialization process is as follows:
obtaining the current dat file size npos, additionally writing the block size into the dat file,
serializing the block data and transaction data in the block, and appending the serialized data to the dat file,
during the writing of data, block and transaction related metadata is generated,
if the size of the current written file plus the size of the block is detected to be smaller than or equal to 128M Bytes, a dat file is directly generated.
Preferably, the slicing in S1 includes the following steps:
creating a data fragment: the storage system divides the data into smaller pieces, a process called fragmentation, which breaks the data into manageable chunks that can be distributed across multiple nodes;
encrypting each fragment: after fragmentation, the storage system needs to encrypt each data fragment on the local system, and the content owner has complete control over the process, aiming to ensure that anyone other than the content owner cannot view/access the data in the fragment, no matter where the data is located, whether the data is static or dynamic;
a hash is generated for each slice: the blockchain storage system generates a unique hash, i.e., a fixed-length encrypted output string, from the fragmented data or encryption key, the hash being added to the ledger and fragmentation metadata to link the transaction to the stored fragments;
copying each fragment: the storage system will duplicate each fragment, so there are enough redundant copies to ensure availability and performance, and prevent performance degradation and data loss, the content owner determines the number of copies of each fragment and the location of the fragments, in this process, the content owner establishes a threshold for the minimum number of copies that need to be maintained to ensure that data is not lost;
distributing the copied fragments: the P2P network distributes replicated shards to geographically dispersed storage nodes, whether regional or global, owned by multiple organizations or individuals, can swap out some type of compensation by leasing additional storage space, with no one entity being able to own all of the storage resources, or control the storage infrastructure, and only the content owner can have full access to all of its data, wherever the nodes are located;
record transaction to ledger: the storage system records all transactions in the blockchain ledger and synchronizes this information among all nodes, the ledger storing detailed information related to the transactions, as the ledger is based on blockchain technology, it has transparency, verifiability, traceability and tamper resistance.
Preferably, the timestamp in S3 is in a block header, the block header and the block body together form a block, the block body records all transaction data during the time when the block was created, these records are organized by the merkle tree, the hash value of the merkle root is put into the block header as a summary, "a fingerprint" of all transaction records in this block, the block header does not have the merkle root, and the summary of the previous block header, that is, the merkle root of the previous block, the timestamp and the height of this block: i.e. the number from the first block, this block is the information of the second block.
Preferably, the connection between the fragments in S2 implements an accurate algorithm through address information and a hash algorithm, maintains the connection between the fragments, can implement connection during query, and completes all extraction of the data files during query.
Preferably, the storing in S4 supports storing the structured data of the custom type, thereby increasing the extension; nervos supports that different consensus algorithms are deployed through an Generator to obtain balance of performance and network dispersity, the Nervos provides a new block chain design, five elements of a cell capable of storing a plurality of data, an applied execution logic Generator, a Validator, a Type and an Identity form a distributed architecture capable of being autonomous and separated for verification, the Nervos changes the original data input, verification and packaging processes, when an element X occurs, a client determines the Identity through the Identity verification by the Identity verification, meanwhile, mapping corresponding to the state Y outside the chain through consensus is stored in the client, the execution logic Generator transmits the event state Y to a node through Hash, the node only needs to verify whether the mapping on the Validator verification chain is consistent with the event state Y under the chain, and if the mapping is confirmed, the node is packaged into the next block.
Preferably, the stored state mapping is used, the chain can deduce whether the data on the chain is consistent with the data under the chain through reverse logic, the newly joined nodes are synchronous nodes, the accounting nodes which are used for calculation work are all on the operator or the participant, and the management contract can set the weight of the accounting nodes, so that the node voting resolution and dynamic joining are better.
Preferably, the heterogeneous cross-chain PegZone in S5 includes five parts, which are:
smart contact: asset hosting plays a role in token hosting in etherhouses and Cosmos, which mainly provides four methods: locking, unlocking, casting and destroying;
witness: this is a complete ether house node that monitors the event of the ether house contract and waits for 100 blocks to be generated, and the encapsulated witness Tx is submitted to the PegZone to document the state change on the ether house block chain;
PegZone: the PegZone is a block chain based on Terdermint, can maintain user account information, allows assets to be transferred among users and provides transaction inquiry;
a signer: the Secp256k1 is used to sign transactions so that the signature can be effectively verified by smart contracts; this corresponds to the verifier public key set of the smart contract;
relay: relay is responsible for all transaction forwarding, forwarding signed SignTx to the smart contract.
Preferably, the working process of each master node in the practical Byzantine fault-tolerant algorithm is called a view, the view number is denoted by v,
the master nodes are selected by common nodes in turn, the specific calculation process is that the master node p is v mod | R | (| R | is the number of the nodes),
the operation method comprises the following processes: when the system works normally, a transaction request of a client is received, after the request identity is verified, a serial number is set for the request, and a pre-prepare message is broadcasted;
when a New host node is selected, sending View-New information according to the collected View-Change message, and enabling other nodes to synchronize data;
the main node and all other nodes maintain heartbeat;
when the main node is down, re-election is triggered due to the timeout of heartbeat, and the stable operation of the system is ensured;
the main node maliciously sends the message with the wrong number, and then the main node is perceived by the replica node in the subsequent operation, because the preamble stage and the commit stage are broadcasted, and once the preamble stage and the commit stage are inconsistent, the view-change is triggered;
the main node does not send the received request, and when the client does not reply after overtime, the client retransmits the request to all the replica nodes and triggers view-change;
the primary node tampers the message, because the Request contains the data and the signature of the client, the primary cannot tamp the message, other copies can verify the validity of the message, and otherwise, the primary is discarded, and the view-change is triggered.
Compared with the prior art, the invention has the beneficial effects that:
the distributed storage of the data information of the block chain is realized, the rapid identification process is completed through the consensus algorithm, the storage and uploading of the data information in the block chain are accelerated, the fragmented storage of the data information is realized, the storage speed and the query speed are accelerated, the processing and the use are convenient, the data carry time stamps, the storage and the query of the data information can be convenient, the cross-chain communication among different block chains is realized, the data cooperation among the data information is completed, the data information transmission and the connection among the block chains are improved, and the use and the operation are convenient.
Drawings
FIG. 1 is a schematic diagram of the step structure of the present invention;
FIG. 2 is a diagram illustrating the steps of the present invention for serializing dat files;
FIG. 3 is a schematic diagram of the slicing step according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1-3, the present invention provides a technical solution: a high-performance distributed storage area data, time stamp, cross-chain communication and data cooperation method comprises the following steps:
s1, uploading block data information, and performing effective storage: when the block storage of the data information is carried out, a request is sent to a certain node in a block chain, the quick determination is completed through a consensus algorithm, then the data file is fragmented, each data fragment is encrypted and generates hash, and then the data file is copied, differentiated and recorded on a ledger;
s2, linking the block data information: after the fragmentation is carried out in S1, all the fragments in each data file are connected, and branched chain type connection is carried out through the address time stamp, so that organic data connection is carried out on all the fragments in the same data file, and the rapidity of data information during retrieval is improved;
s3, when uploading the data file information, carrying a timestamp: when data file information is uploaded, a timestamp is carried on a block head of the data file information, the same timestamp is carried on the block head of each fragment of the data file information, the block heads are finally connected into a block chain according to the sequence of block generation time, distributed storage of the data file information is realized according to different timestamps, and each independent node establishes contact through a P2P network, so that a decentralized distributed timestamp service system is formed for recording information data;
s4, respectively storing the data file information in all the nodes through distributed storage: the data file information is respectively stored in all the nodes through distributed storage, so that the data file information can be rapidly inquired and stored, the data cooperation operation is effectively improved, the server is arranged at the center of the block chain, all the information of the block chain nodes is received and forwarded, and the complexity of accessing all the nodes when the nodes inquire the data is reduced;
s5, performing cross-link communication among different block chains, completing effective cross-link communication, and improving the cooperation of data information: the cross-link connection is realized among different block chains through a notary mechanism, a side chain, a relay, Hash locking, distributed private key control or heterogeneous cross-link PegZones, so that the communication connection can be realized among different block chains.
In order to improve the fast identification operation of the data information uploaded by the node, in this embodiment, it is preferable, the consensus algorithm in S1 includes a proof of workload, a proof of rights, a proof of delegation of rights, and a practical byzantine fault tolerance algorithm, a state machine copy replication algorithm, i.e. the service is modeled as state machines, which make replica copies at different nodes of the distributed system, each replica of a state machine holding the state of the service, the operation of the service is also implemented, the set of all the copies is represented by capital letter R, each copy is represented by an integer from 0 to | R | -1, assuming | R | ═ 3f +1, where f is the maximum number of copies that are likely to fail, although there may be more than 3f +1 copies, the additional copies may not improve reliability except to reduce performance.
In order to make the storage of data information fast and convenient for querying, in this embodiment, preferably, the data size of the slice in S1 is maintained at 128M Bytes, and then the slice is written into the dat file in the form of serial byte codes, and in the serialization process, if it is detected that the size of the currently written file plus the size of the block is greater than 128M Bytes, a dat file is regenerated, and the specific serialization process is as follows:
obtaining the current dat file size npos, additionally writing the block size into the dat file,
serializing the block data and transaction data in the block, and appending the serialized data to the dat file,
during the writing of data, block and transaction related metadata is generated,
if the size of the current written file plus the size of the block is detected to be smaller than or equal to 128M Bytes, a dat file is directly generated.
In order to implement the slicing operation on the data information, in this embodiment, preferably, the slicing in S1 includes the following steps:
creating a data fragment: the storage system divides the data into smaller pieces, a process called fragmentation, which breaks the data into manageable chunks that can be distributed across multiple nodes;
encrypting each fragment: after fragmentation, the storage system needs to encrypt each data fragment on the local system, and the content owner has complete control over the process, aiming to ensure that anyone other than the content owner cannot view/access the data in the fragment, no matter where the data is located, whether the data is static or dynamic;
a hash is generated for each slice: the blockchain storage system generates a unique hash, i.e., a fixed-length encrypted output string, from the fragmented data or encryption key, the hash being added to the ledger and fragmentation metadata to link the transaction to the stored fragments;
copying each fragment: the storage system will duplicate each fragment, so there are enough redundant copies to ensure availability and performance, and prevent performance degradation and data loss, the content owner determines the number of copies of each fragment and the location of the fragments, in this process, the content owner establishes a threshold for the minimum number of copies that need to be maintained to ensure that data is not lost;
distributing the copied fragments: the P2P network distributes replicated shards to geographically dispersed storage nodes, whether regional or global, owned by multiple organizations or individuals, can swap out some type of compensation by leasing additional storage space, with no one entity being able to own all of the storage resources, or control the storage infrastructure, and only the content owner can have full access to all of its data, wherever the nodes are located;
record transaction to ledger: the storage system records all transactions in the blockchain ledger and synchronizes this information among all nodes, the ledger storing detailed information related to the transactions, as the ledger is based on blockchain technology, it has transparency, verifiability, traceability and tamper resistance.
In order to implement carrying the timestamp on the data information, in this embodiment, preferably, the timestamp in S3 is in a block header, the block header and a block body together form a block, the block body records all transaction data during the time when the block is created, the records are organized by a merkle tree, a hash value of a merkle root is put into the block header as a summary, "a fingerprint" of all transaction records in the block, the block header does not have the merkle root, and a summary of a previous block header, that is, the merkle root of a previous block, the timestamp of the block, and the height: i.e. the number from the first block, this block is the information of the second block.
In order to implement address connection between the fragments, in this embodiment, preferably, the connection between the fragments in S2 implements an accurate algorithm through address information and a hash algorithm, maintains the connection between the fragments, can implement connection during query, and completes all extraction of data files during query.
In order to implement the storage of the structured data of the custom type for storage, in this embodiment, preferably, the storage in S4 supports the storage of the structured data of the custom type, so that an extension is added; nervos supports that different consensus algorithms are deployed through an Generator to obtain balance of performance and network dispersity, the Nervos provides a new block chain design, a distributed architecture capable of being autonomous and separated for verification is formed by five elements, namely a cell capable of storing a plurality of data, an applied execution logic Generator generater, a Validator, a Type and an Identity, the Nervos changes the original data input, verification and packaging processes, when an element X occurs, a client determines the Identity through the Identity verification by the Identity verification, meanwhile, mapping corresponding to the state Y outside a chain through consensus is stored in the client, the execution logic Generator generater transmits the event state Y to a node through Hash, the node only needs to verify whether the mapping on the Validator verification chain is consistent with the event state Y under the chain, if the mapping is confirmed, the mapping is packaged into the next block, the stored mapping is the state, and the chain can deduce whether the data under the chain is consistent with the data under the chain through reverse logic, and for the newly added node, the node is a synchronous node, the accounting node which is used for calculation is on the operator or participant, the management contract can also set the weight of the accounting node, and the node in the layer needs to vote and dynamically join better.
In order to implement the cross-link communication, in this embodiment, preferably, the heterogeneous cross-link PegZone in S5 includes five parts, which are:
smart contact: asset hosting plays a role in token hosting in etherhouses and Cosmos, which mainly provides four methods: locking, unlocking, casting and destroying;
witness: this is a complete ether house node that monitors the event of the ether house contract and waits for 100 blocks to be generated, and the encapsulated witness Tx is submitted to the PegZone to document the state change on the ether house block chain;
PegZone: the PegZone is a block chain based on Terdermint, can maintain user account information, allows assets to be transferred among users and provides transaction inquiry;
a signer: the Secp256k1 is used to sign transactions so that the signature can be effectively verified by smart contracts; this corresponds to the verifier public key set of the smart contract;
relay: relay is responsible for all transaction forwarding, forwarding signed SignTx to the smart contract.
In order to implement the consensus algorithm and determine the definite positions between the nodes, in this embodiment, preferably, the working process of each master node in the practical byzantine fault-tolerant algorithm is called a view, the view number is denoted by v,
the master nodes are selected by common nodes in turn, the specific calculation process is that the master node p is v mod | R | (| R | is the number of the nodes),
the operation method comprises the following processes: when the system works normally, a transaction request of a client is received, after the request identity is verified, a serial number is set for the request, and a pre-prepare message is broadcasted;
when a New host node is selected, sending View-New information according to the collected View-Change message, and enabling other nodes to synchronize data;
the main node and all other nodes maintain heartbeat;
when the main node is down, re-election is triggered due to the timeout of heartbeat, and the stable operation of the system is ensured;
the main node maliciously sends the message with the wrong number, and then the main node is perceived by the replica node in the subsequent operation, because the preamble stage and the commit stage are broadcasted, and once the preamble stage and the commit stage are inconsistent, the view-change is triggered;
the main node does not send the received request, and when the client does not reply after overtime, the client retransmits the request to all the replica nodes and triggers view-change;
the primary node tampers the message, because the Request contains the data and the signature of the client, the primary cannot tamp the message, other copies can verify the validity of the message, and otherwise, the primary is discarded, and the view-change is triggered.
The working principle and the using process of the invention are as follows:
the first step is to upload the block data information and effectively store: when the block storage of the data information is carried out, a request is sent to a certain node in a block chain, the quick determination is completed through a consensus algorithm, then the data file is fragmented, each data fragment is encrypted and generates hash, and then the data file is copied, differentiated and recorded on a ledger;
secondly, block data information is in chain connection: after the fragmentation is carried out in S1, all the fragments in each data file are connected, and branched chain type connection is carried out through the address time stamp, so that organic data connection is carried out on all the fragments in the same data file, and the rapidity of data information during retrieval is improved;
and thirdly, carrying a timestamp when the data file information is uploaded: when data file information is uploaded, a timestamp is carried on a block head of the data file information, the same timestamp is carried on the block head of each fragment of the data file information, the block heads are finally connected into a block chain according to the sequence of block generation time, distributed storage of the data file information is realized according to different timestamps, and each independent node establishes contact through a P2P network, so that a decentralized distributed timestamp service system is formed for recording information data;
fourthly, respectively storing the data file information in all the nodes through distributed storage: the data file information is respectively stored in all the nodes through distributed storage, so that the data file information can be rapidly inquired and stored, the data cooperation operation is effectively improved, the server is arranged at the center of the block chain, all the information of the block chain nodes is received and forwarded, and the complexity of accessing all the nodes when the nodes inquire the data is reduced;
and fifthly, performing chain-crossing communication among different block chains to finish effective chain-crossing communication and improve the cooperation of data information: the cross-link connection is realized among different block chains through a notary mechanism, a side chain, a relay, Hash locking, distributed private key control or heterogeneous cross-link PegZones, so that the communication connection can be realized among different block chains.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.
Claims (10)
1. A high-performance distributed storage area data, time stamp, cross-chain communication and data cooperation method is characterized by comprising the following steps:
s1, uploading block data information, and performing effective storage: when the block storage of the data information is carried out, a request is sent to a certain node in a block chain, the quick determination is completed through a consensus algorithm, then the data file is fragmented, each data fragment is encrypted and generates hash, and then the data file is copied, differentiated and recorded on a ledger;
s2, linking the block data information: after the fragmentation is carried out in S1, all the fragments in each data file are connected, and branched chain type connection is carried out through the address time stamp, so that organic data connection is carried out on all the fragments in the same data file, and the rapidity of data information during retrieval is improved;
s3, when uploading the data file information, carrying a timestamp: when data file information is uploaded, a timestamp is carried on a block head of the data file information, the same timestamp is carried on the block head of each fragment of the data file information, the block heads are finally connected into a block chain according to the sequence of block generation time, distributed storage of the data file information is realized according to different timestamps, and each independent node establishes contact through a P2P network, so that a decentralized distributed timestamp service system is formed for recording information data;
s4, respectively storing the data file information in all the nodes through distributed storage: the data file information is respectively stored in all the nodes through distributed storage, so that the data file information can be rapidly inquired and stored, the data cooperation operation is effectively improved, the server is arranged at the center of the block chain, all the information of the block chain nodes is received and forwarded, and the complexity of accessing all the nodes when the nodes inquire the data is reduced;
s5, performing cross-link communication among different block chains, completing effective cross-link communication, and improving the cooperation of data information: the cross-link connection is realized among different block chains through a notary mechanism, a side chain, a relay, Hash locking, distributed private key control or heterogeneous cross-link PegZones, so that the communication connection can be realized among different block chains.
2. The high-performance distributed storage area block data, timestamp, cross-chain communication and data coordination method according to claim 1, characterized in that: the consensus algorithm in S1 includes workload certification, equity certification, delegation equity certification, and a practical byzantine fault-tolerant algorithm, where the practical byzantine fault-tolerant algorithm is a state machine copy replication algorithm, that is, a service is modeled as a state machine, the state machine performs copy replication at different nodes of a distributed system, the copy of each state machine stores the state of the service, and also implements operation of the service, a set of all copies is represented by an capital letter R, each copy is represented by an integer from 0 to | R | -1, and | R | 3f +1, where f is the maximum number of copies that may fail, and although there may be more than 3f +1 copies, additional copies may not improve reliability except for reduced performance.
3. The high-performance distributed storage area block data, timestamp, cross-chain communication and data coordination method according to claim 1, characterized in that: the data size of the slice in S1 is maintained at 128M Bytes, and then the slice is written into the dat file in the form of serial bytecodes, and in the serialization process, if it is detected that the size of the currently written file plus the size of the block is larger than 128M Bytes, a dat file is regenerated, and the specific serialization process is as follows:
obtaining the current dat file size npos, additionally writing the block size into the dat file,
serializing the block data and transaction data in the block, and appending the serialized data to the dat file,
during the writing of data, block and transaction related metadata is generated,
if the size of the current written file plus the size of the block is detected to be smaller than or equal to 128M Bytes, a dat file is directly generated.
4. The high-performance distributed storage area block data, timestamp, cross-chain communication and data coordination method according to claim 1, characterized in that: the slicing in S1 includes the following steps:
creating a data fragment: the storage system divides the data into smaller pieces, a process called fragmentation, which breaks the data into manageable chunks that can be distributed across multiple nodes;
encrypting each fragment: after fragmentation, the storage system needs to encrypt each data fragment on the local system, and the content owner has complete control over the process, aiming to ensure that anyone other than the content owner cannot view/access the data in the fragment, no matter where the data is located, whether the data is static or dynamic;
a hash is generated for each slice: the blockchain storage system generates a unique hash, i.e., a fixed-length encrypted output string, from the fragmented data or encryption key, the hash being added to the ledger and fragmentation metadata to link the transaction to the stored fragments;
copying each fragment: the storage system will duplicate each fragment, so there are enough redundant copies to ensure availability and performance, and prevent performance degradation and data loss, the content owner determines the number of copies of each fragment and the location of the fragments, in this process, the content owner establishes a threshold for the minimum number of copies that need to be maintained to ensure that data is not lost;
distributing the copied fragments: the P2P network distributes replicated shards to geographically dispersed storage nodes, whether regional or global, owned by multiple organizations or individuals, can swap out some type of compensation by leasing additional storage space, with no one entity being able to own all of the storage resources, or control the storage infrastructure, and only the content owner can have full access to all of its data, wherever the nodes are located;
record transaction to ledger: the storage system records all transactions in the blockchain ledger and synchronizes this information among all nodes, the ledger storing detailed information related to the transactions, as the ledger is based on blockchain technology, it has transparency, verifiability, traceability and tamper resistance.
5. The high-performance distributed storage area block data, timestamp, cross-chain communication and data coordination method according to claim 1, characterized in that: the timestamp in S3 is in the block header, the block header and the block body together form a block, the block body records all transaction data during the time when the block is created, the records are organized by the merkle tree, the hash value of the merkle root is put into the block header as a summary, "a fingerprint" of all transaction records in the block, the block header does not have the merkle root, and the summary of the previous block header, that is, the merkle root of the previous block, the timestamp of the block, and the height: i.e. the number from the first block, this block is the information of the second block.
6. The high-performance distributed storage area block data, timestamp, cross-chain communication and data coordination method according to claim 1, characterized in that: the connection between the fragments in S2 implements an accurate algorithm through address information and a hash algorithm, maintains the connection between the fragments, can implement connection during query, and completes all extraction of data files during query.
7. The high-performance distributed storage area block data, timestamp, cross-chain communication and data coordination method according to claim 1, characterized in that: the storage in the S4 supports the storage of the structured data of the custom type, thereby increasing the extension; nervos supports that different consensus algorithms are deployed through an Generator to obtain balance of performance and network dispersity, the Nervos provides a new block chain design, five elements of a cell capable of storing a plurality of data, an applied execution logic Generator, a Validator, a Type and an Identity form a distributed architecture capable of being autonomous and separated for verification, the Nervos changes the original data input, verification and packaging processes, when an element X occurs, a client determines the Identity through the Identity verification by the Identity verification, meanwhile, mapping corresponding to the state Y outside the chain through consensus is stored in the client, the execution logic Generator transmits the event state Y to a node through Hash, the node only needs to verify whether the mapping on the Validator verification chain is consistent with the event state Y under the chain, and if the mapping is confirmed, the node is packaged into the next block.
8. The high-performance distributed storage block data, timestamp, cross-chain communication and data coordination method according to claim 7, characterized in that: the storage is the mapping of the state, the chain can deduce whether the data on the chain is consistent with the data under the chain or not through reverse logic, the newly added nodes are synchronous nodes, the accounting nodes which are used for calculation work are all on the operator or the participant, the management contract can also set the weight of the accounting nodes, and the node voting resolution and dynamic addition in the layer are better.
9. The high-performance distributed storage area block data, timestamp, cross-chain communication and data coordination method according to claim 1, characterized in that: the heterogeneous cross-chain PegZone in S5 includes five parts, which are:
smart contact: asset hosting plays a role in token hosting in etherhouses and Cosmos, which mainly provides four methods: locking, unlocking, casting and destroying;
witness: this is a complete ether house node that monitors the event of the ether house contract and waits for 100 blocks to be generated, and the encapsulated witness Tx is submitted to the PegZone to document the state change on the ether house block chain;
PegZone: the PegZone is a block chain based on Terdermint, can maintain user account information, allows assets to be transferred among users and provides transaction inquiry;
a signer: the Secp256k1 is used to sign transactions so that the signature can be effectively verified by smart contracts; this corresponds to the verifier public key set of the smart contract;
relay: relay is responsible for all transaction forwarding, forwarding signed SignTx to the smart contract.
10. The high-performance distributed storage area block data, timestamp, cross-chain communication and data coordination method according to claim 2, characterized in that: the working process of each master node in the practical byzantine fault-tolerant algorithm is called a view, the view number is denoted by v,
the master nodes are selected by common nodes in turn, the specific calculation process is that the master node p is v mod | R | (| R | is the number of the nodes),
the operation method comprises the following processes: when the system works normally, a transaction request of a client is received, after the request identity is verified, a serial number is set for the request, and a pre-prepare message is broadcasted;
when a New host node is selected, sending View-New information according to the collected View-Change message, and enabling other nodes to synchronize data;
the main node and all other nodes maintain heartbeat;
when the main node is down, re-election is triggered due to the timeout of heartbeat, and the stable operation of the system is ensured;
the main node maliciously sends the message with the wrong number, and then the main node is perceived by the replica node in the subsequent operation, because the preamble stage and the commit stage are broadcasted, and once the preamble stage and the commit stage are inconsistent, the view-change is triggered;
the main node does not send the received request, and when the client does not reply after overtime, the client retransmits the request to all the replica nodes and triggers view-change;
the primary node tampers the message, because the Request contains the data and the signature of the client, the primary cannot tamp the message, other copies can verify the validity of the message, and otherwise, the primary is discarded, and the view-change is triggered.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111141592.5A CN114079660A (en) | 2021-09-28 | 2021-09-28 | High-performance distributed storage area data, timestamp, cross-link communication and data cooperation method |
| PCT/CN2021/134240 WO2023050555A1 (en) | 2021-09-28 | 2021-11-30 | Method for high-performance distributed storage of block data and timestamp, cross-chain communication and data collaboration |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111141592.5A CN114079660A (en) | 2021-09-28 | 2021-09-28 | High-performance distributed storage area data, timestamp, cross-link communication and data cooperation method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114079660A true CN114079660A (en) | 2022-02-22 |
Family
ID=80283515
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111141592.5A Pending CN114079660A (en) | 2021-09-28 | 2021-09-28 | High-performance distributed storage area data, timestamp, cross-link communication and data cooperation method |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN114079660A (en) |
| WO (1) | WO2023050555A1 (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114185997A (en) * | 2022-02-17 | 2022-03-15 | 天津眧合数字科技有限公司 | Pet information credible storage system based on block chain |
| CN114238867A (en) * | 2022-02-28 | 2022-03-25 | 南开大学 | Automatic switching access method for distributed multi-backup copyright content |
| CN114510539A (en) * | 2022-04-18 | 2022-05-17 | 北京易鲸捷信息技术有限公司 | Method for generating and applying consistency check point of distributed database |
| CN114629918A (en) * | 2022-03-02 | 2022-06-14 | 广州泰创信息技术有限公司 | Big data information processing method based on block chain |
| CN115357932A (en) * | 2022-08-18 | 2022-11-18 | 地心引力(武汉)科技有限公司 | Cross-chain secure storage method and device based on block chain technology |
| CN115860744A (en) * | 2023-02-20 | 2023-03-28 | 中国信息通信研究院 | Processing method and device for cross-blockchain transaction, blockchain system and equipment |
| CN116308667A (en) * | 2023-03-25 | 2023-06-23 | 北京农夫铺子技术研究院 | Commodity big data intelligent storage system for meta-universe shopping platform |
| CN116842029A (en) * | 2023-09-01 | 2023-10-03 | 天津理工大学 | Asset management method, device, computer equipment and storage medium |
| CN116910126A (en) * | 2023-09-14 | 2023-10-20 | 国网山东省电力公司营销服务中心(计量中心) | System and method for conveniently storing, classifying and inquiring massive daily clear electric quantity data |
| CN117200977A (en) * | 2023-11-07 | 2023-12-08 | 天津市城市规划设计研究总院有限公司 | Method and system for hierarchical storage of blockchain data in smart city field |
| CN117763052A (en) * | 2024-02-22 | 2024-03-26 | 浩鲸云计算科技股份有限公司 | data synchronization method and system for charging multi-center memory database |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116567631B (en) * | 2023-07-06 | 2023-09-15 | 北京航空航天大学 | Mobile terminal security authentication method based on segmented block chain |
| CN116561182B (en) * | 2023-07-07 | 2023-09-19 | 华北电力大学 | Power data storage method and system based on block chain |
| CN116915404B (en) * | 2023-09-13 | 2023-11-17 | 华中科技大学 | Engineering data cross-chain collaboration method and system based on block chain technology |
| CN117319422B (en) * | 2023-11-28 | 2024-02-02 | 天津市城市规划设计研究总院有限公司 | Block chain blocking method and system for Internet of things data in urban planning field |
| CN117478304B (en) * | 2023-12-28 | 2024-03-01 | 湖南天河国云科技有限公司 | Block chain management method, system and computer equipment |
| CN117494219A (en) * | 2023-12-29 | 2024-02-02 | 智慧(东营)大数据有限公司 | Bill management system and method based on blockchain technology |
| CN117574447B (en) * | 2024-01-16 | 2024-04-16 | 中国标准化研究院 | Data storage evidence and traceability system based on blockchain technology |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11194837B2 (en) * | 2018-05-01 | 2021-12-07 | International Business Machines Corporation | Blockchain implementing cross-chain transactions |
| US10805094B2 (en) * | 2018-10-08 | 2020-10-13 | International Business Machines Corporation | Blockchain timestamp agreement |
| CN109587253B (en) * | 2018-12-11 | 2021-06-29 | 浙江大学 | Method for realizing distributed storage of files based on block chain |
| CN111507730A (en) * | 2020-05-12 | 2020-08-07 | 北京俩撇科技有限公司 | Block chain cross-chain method and device |
| CN112256663A (en) * | 2020-10-30 | 2021-01-22 | 深圳壹账通智能科技有限公司 | Block chain based distributed file storage method and system |
| CN112988764B (en) * | 2021-05-14 | 2022-05-10 | 北京百度网讯科技有限公司 | Data storage method, device, equipment and storage medium |
-
2021
- 2021-09-28 CN CN202111141592.5A patent/CN114079660A/en active Pending
- 2021-11-30 WO PCT/CN2021/134240 patent/WO2023050555A1/en unknown
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114185997A (en) * | 2022-02-17 | 2022-03-15 | 天津眧合数字科技有限公司 | Pet information credible storage system based on block chain |
| CN114185997B (en) * | 2022-02-17 | 2022-05-13 | 天津眧合数字科技有限公司 | Pet information credible storage system based on block chain |
| CN114238867A (en) * | 2022-02-28 | 2022-03-25 | 南开大学 | Automatic switching access method for distributed multi-backup copyright content |
| CN114629918B (en) * | 2022-03-02 | 2023-10-27 | 北京国联视讯信息技术股份有限公司 | Big data information processing method based on block chain |
| CN114629918A (en) * | 2022-03-02 | 2022-06-14 | 广州泰创信息技术有限公司 | Big data information processing method based on block chain |
| CN114510539A (en) * | 2022-04-18 | 2022-05-17 | 北京易鲸捷信息技术有限公司 | Method for generating and applying consistency check point of distributed database |
| CN114510539B (en) * | 2022-04-18 | 2022-06-24 | 北京易鲸捷信息技术有限公司 | Method for generating and applying consistency check point of distributed database |
| CN115357932A (en) * | 2022-08-18 | 2022-11-18 | 地心引力(武汉)科技有限公司 | Cross-chain secure storage method and device based on block chain technology |
| CN115357932B (en) * | 2022-08-18 | 2023-11-28 | 山东浪潮智慧供应链科技有限公司 | Cross-chain secure storage method and device based on blockchain technology |
| CN115860744A (en) * | 2023-02-20 | 2023-03-28 | 中国信息通信研究院 | Processing method and device for cross-blockchain transaction, blockchain system and equipment |
| CN115860744B (en) * | 2023-02-20 | 2023-05-09 | 中国信息通信研究院 | Processing method and device of cross-blockchain transaction, blockchain system and equipment |
| CN116308667A (en) * | 2023-03-25 | 2023-06-23 | 北京农夫铺子技术研究院 | Commodity big data intelligent storage system for meta-universe shopping platform |
| CN116842029A (en) * | 2023-09-01 | 2023-10-03 | 天津理工大学 | Asset management method, device, computer equipment and storage medium |
| CN116842029B (en) * | 2023-09-01 | 2023-11-17 | 天津理工大学 | Asset management method, device, computer equipment and storage medium |
| CN116910126B (en) * | 2023-09-14 | 2023-11-24 | 国网山东省电力公司营销服务中心(计量中心) | System and method for conveniently storing, classifying and inquiring massive daily clear electric quantity data |
| CN116910126A (en) * | 2023-09-14 | 2023-10-20 | 国网山东省电力公司营销服务中心(计量中心) | System and method for conveniently storing, classifying and inquiring massive daily clear electric quantity data |
| CN117200977A (en) * | 2023-11-07 | 2023-12-08 | 天津市城市规划设计研究总院有限公司 | Method and system for hierarchical storage of blockchain data in smart city field |
| CN117200977B (en) * | 2023-11-07 | 2024-01-19 | 天津市城市规划设计研究总院有限公司 | Method and system for hierarchical storage of blockchain data in smart city field |
| CN117763052A (en) * | 2024-02-22 | 2024-03-26 | 浩鲸云计算科技股份有限公司 | data synchronization method and system for charging multi-center memory database |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2023050555A1 (en) | 2023-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114079660A (en) | High-performance distributed storage area data, timestamp, cross-link communication and data cooperation method | |
| CN110569675B (en) | Multi-Agent transaction information protection method based on block chain technology | |
| US20220231869A1 (en) | Cross-blockchain mutual data storage | |
| CN110059494B (en) | Privacy protection method for block chain transaction data and block chain system | |
| US20220209958A1 (en) | Systems and methods for state of data management | |
| Rhea et al. | Pond: The {OceanStore} Prototype | |
| US9122846B2 (en) | Document verification with distributed calendar infrastructure | |
| CN111611315B (en) | Financial big data-oriented multi-fork tree structure block chain integrated optimization storage method | |
| CN112685505B (en) | Transaction data processing method and device, computer equipment and storage medium | |
| TWI720918B (en) | Consenus of shared blockchain data storage based on error correction code | |
| US20230316273A1 (en) | Data processing method and apparatus, computer device, and storage medium | |
| CN112749969B (en) | Data processing method and device, computer equipment and storage medium | |
| CN108923932A (en) | A kind of decentralization co-verification model and verification algorithm | |
| CN111625869B (en) | Data processing method and data processing device | |
| CN106452737A (en) | Systems and methods for secure multi-tenant data storage | |
| US20220020008A1 (en) | Smart Contract-Based Electronic Contract Preservation System | |
| CN112615847A (en) | Data sharing and privacy protection method based on block chain | |
| CN111656386A (en) | Managing transaction requests in ledger system | |
| CN111953490B (en) | Digital signature method and system based on block chain technology | |
| CN111177272A (en) | Block chain-based big data credible auditing method | |
| JP2020190874A (en) | Document management system | |
| WO2020149177A1 (en) | Document management system | |
| CN114329528A (en) | File data management method and system based on block chain | |
| CN111630545A (en) | Managing transaction requests in ledger system | |
| Ali et al. | Blockstack technical whitepaper |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |