WO2023050555A1

WO2023050555A1 - Method for high-performance distributed storage of block data and timestamp, cross-chain communication and data collaboration

Info

Publication number: WO2023050555A1
Application number: PCT/CN2021/134240
Authority: WO
Inventors: 曹春峰; 汪洋; 巫家竞; 赵滨
Original assignee: 中诚区块链研究院(南京)有限公司
Priority date: 2021-09-28
Filing date: 2021-11-30
Publication date: 2023-04-06
Also published as: CN114079660A; CN114079660B

Abstract

Disclosed in the present invention is a method for the high-performance distributed storage of block data and timestamp, cross-chain communication and data collaboration. The method comprises: S1, uploading block data information, and effectively storing same; S2, performing chain-type connection on the block data information; S3, when being uploaded, data file information carrying a timestamp; S4, respectively storing the data file information in all nodes by means of distributed storage; and S5, performing cross-chain communication between different blockchains, so as to complete effective cross-chain communication, thereby improving the collaboration of data information. By means of the present invention, the distributed storage of data information of blockchains is realized, a rapid identification process is completed by means of a consensus algorithm, the sharding storage of the data information is realized, a timestamp is carried in data, and cross-chain communication between different blockchains is realized, so as to complete data collaboration between the data information.

Description

A high-performance distributed storage block data, time stamp, cross-chain communication and data collaboration method

technical field

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.

Background technique

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. It is essentially a decentralized database. At the same time, as the underlying technology of Bitcoin, it is a series of data blocks associated with each other using cryptographic methods. Each data block It contains a batch of bitcoin network transaction information, which is used to verify the validity of the information (anti-counterfeiting) and generate the next block. However, there are still various problems in various blockchains on the market.

For example, 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. At the same time, 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. Distributed storage of data, and realize the carrying of time stamps on data, effective cross-chain communication and data collaboration, etc., for this we propose a high-performance distributed storage block data, time stamp, cross-chain communication and Data collaboration method.

Contents of the invention

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.

In order to achieve the above purpose, 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:

S1. Realize uploading and effective storage of block data information: when storing data information blocks, first send a request to a certain node in the blockchain, and complete the quick determination through the consensus algorithm, and then Fragment the data file, and realize the encryption and hash generation of each data fragment, and then copy, differentiate and record it on the ledger;

S2. 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;

S3. When the data file information is uploaded, carry the time stamp: when the data file information is uploaded, carry the time stamp on the block header of the data file information, and change the area of each fragment of the data file information The block headers all carry the same time stamp, and are finally connected into a blockchain according to the order 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 Establish a connection, thus forming a decentralized distributed timestamp service system for the recording of information data;

S4. 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;

S5. Carry out cross-chain communication between different blockchains to complete effective cross-chain communication and improve the coordination of data information: between different blockchains through notary mechanisms, side chains, relays, hash locks, Distributed private key control or heterogeneous cross-chain PegZone realizes cross-chain connections, enabling communication connections between different blockchains.

Preferably, 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 |R|-1 to represent each copy, assuming |R|=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.

Preferably, 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. In 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:

Get the current dat file size npos, and append the block size to the dat file,

Serialize the block data and transaction data in the block, and append the serialized data to the dat file,

In the process of writing data, metadata related to blocks and transactions will be generated,

If it is detected that the current written file size plus the block size is less than or equal to 128M Bytes, a dat file will be generated directly.

Preferably, the fragmentation in S1 includes the following steps:

Create data shards: 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;

Generate a hash for each shard: 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;

Distributing replicated shards: 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;

Record transactions to the ledger: 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.

Preferably, 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.

Preferably, the 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.

Preferably, 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.

Preferably, the storage is a state mapping, and 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.

Preferably, 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;

witness: This is a full Ethereum node, which monitors the events of the Ethereum contract and waits for 100 blocks to be generated, and the encapsulated witness Tx is submitted to PegZone to prove the state change on the Ethereum blockchain;

PegZone: PegZone is a Tendermint-based blockchain that maintains user account information, allows asset transfers between users and provides transaction queries;

signer: 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;

relay: The relay is responsible for all transaction forwarding, forwarding the 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, and v represents the view number,

The master node is elected by ordinary nodes in turn, and the specific calculation process is master node p=v mod|R| (|R| is the number of nodes),

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;

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;

If the master node is down, re-election will be triggered due to the heartbeat timeout, so as to ensure the stable operation of the system;

If the master node maliciously sends a message with the wrong number, it will be noticed by the replica node in the subsequent operation, because the prepare and commit phases will broadcast, and if they are inconsistent, view-change will be triggered;

The master node does not send the received request. When 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.

Compared with prior art, the beneficial effect of the present invention is:

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.

Description of drawings

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.

Detailed ways

The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

Please refer to Figures 1-3, 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:

In order to improve the fast identification operation of the data information uploaded by nodes, in this embodiment, preferably, 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 |R|-1, assuming |R|=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.

In order to make the data information storage quick and easy to query, in this embodiment, preferably, 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:

Get the current dat file size npos, and append the block size to the dat file,

In order to implement fragmentation operations on data information, in this embodiment, preferably, the fragmentation in S1 includes the following steps:

In order to carry the time stamp on the data information, in this embodiment, preferably, 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.

In order to realize the address connection between the fragments, in this embodiment, preferably, 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.

In order to realize self-defined structured data storage for storage, in this embodiment, preferably, 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. When 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. Make the corresponding mapping and store it in the client, and execute the logic generator to pass the event state Y to the accounting node through hash. 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.

In order to realize cross-chain communication, in this embodiment, preferably, the heterogeneous cross-chain PegZone in S5 includes five parts, which are:

In order to implement the consensus algorithm and determine the definite position between nodes, in this embodiment, preferably, the working process of each master node in the practical Byzantine fault-tolerant algorithm is called a view, and v represents the view number,

The master node maintains a heartbeat with all other nodes;

Principle of work of the present invention and use process:

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.

Although the embodiments of the present invention have been shown and described, those skilled in the art can understand that various changes, modifications and substitutions can be made to these embodiments without departing from the principle and spirit of the present invention. and modifications, the scope of the invention is defined by the appended claims and their equivalents.

Claims

A high-performance distributed storage block data, time stamp, cross-chain communication and data collaboration method, characterized in that it includes the following method steps:

S1. Realize uploading and effective storage of block data information: when storing data information blocks, first send a request to a certain node in the blockchain, and complete the quick determination through the consensus algorithm, and then Fragment the data file, and realize the encryption and hash generation of each data fragment, and then copy, differentiate and record it on the ledger;

S2. 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;

S3. When the data file information is uploaded, carry the time stamp: when the data file information is uploaded, carry the time stamp on the block header of the data file information, and change the area of each fragment of the data file information The block headers all carry the same time stamp, and are finally connected into a blockchain according to the order 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 Establish a connection, thus forming a decentralized distributed timestamp service system for the recording of information data;

S4. 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;

S5. Carry out cross-chain communication between different blockchains to complete effective cross-chain communication and improve the coordination of data information: between different blockchains through notary mechanisms, side chains, relays, hash locks, Distributed private key control or heterogeneous cross-chain PegZone realizes cross-chain connections, enabling communication connections between different blockchains.
A high-performance distributed storage block data, time stamp, cross-chain communication and data collaboration method according to claim 1, characterized in that: the consensus algorithm in S1 includes workload proof, equity proof, Delegated proof of rights and practical Byzantine fault-tolerant algorithm, the practical Byzantine fault-tolerant algorithm is a state machine copy replication algorithm, that is, the service is modeled as a state machine, and the state machine is replicated on different nodes in the distributed system. All replicas save the state of the service, and also realize the operation of the service. The set of all replicas is represented by a capital letter R, and each replica is represented by an integer from 0 to |R|-1, assuming |R|=3f +1, where f is the maximum number of replicas that are likely to fail, although there can be more than 3f+1 replicas, additional replicas do not improve reliability other than performance.
A high-performance distributed storage block data, time stamp, cross-chain communication and data collaboration method according to claim 1, characterized in that: the data size of the fragments in the S1 is kept at 128 M Bytes, and then Write the dat file in the form of serialized bytecode. During the serialization process, if it is detected that the current written file size plus the block size is greater than 128 M Bytes, a dat file will be regenerated. The specific sequence The transformation process is as follows:

Get the current dat file size npos, and append the block size to the dat file,

Serialize the block data and transaction data in the block, and append the serialized data to the dat file,

In the process of writing data, metadata related to blocks and transactions will be generated,

If it is detected that the size of the currently written file plus the size of the block is less than or equal to 128 M Bytes, a dat file will be generated directly.
A high-performance distributed storage block data, time stamp, cross-chain communication and data collaboration method according to claim 1, characterized in that: the fragmentation in S1 includes the following steps:

Create data shards: 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;

Generate a hash for each shard: 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;

Distributing replicated shards: 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;

Record transactions to the ledger: 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.
A high-performance distributed storage block data, time stamp, cross-chain communication and data collaboration method according to claim 1, characterized in that: the time stamp in the S3 is in the block header, and the block header and block The blocks together form a block, which records all transaction data during the period when the block was created. These records are organized through the merkle tree, and the hash value of the root of the merkle tree is used as the hash value of all transaction records in this block. Summary, abstract, and "fingerprint" are put into the block header, which not only contains 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, Height: Counting from the first block, this block is the information of which block.
A high-performance distributed storage block data, time stamp, cross-chain communication and data collaboration method according to claim 1, characterized in that: the connection between the fragments in the S2 is through address information and hash The algorithm implements precise algorithms, maintains the connection between shards, realizes the connection during query, and completes the extraction of all data files during query.
A high-performance distributed storage block data, time stamp, cross-chain communication and data collaboration method according to claim 1, characterized in that: the storage in the S4 supports the storage of self-defined types of structured data, so that Added extensions; Nervos supports the deployment of different consensus algorithms through Generator to achieve a balance between performance and network dispersion. Nervos proposes a new blockchain design, which consists of cells that can store multiple data and the execution logic generator of the application. The five elements of Generator, Validator, Type, and Identity form a distributed architecture capable of autonomy and separation of verification. Nervos changes the original data input, verification, and packaging processes. When event X occurs, the client first confirms its identity through Identity verification At the same time, the state Y outside the chain is stored in the client through the corresponding mapping through the consensus, and the execution logic generator Generator passes the event state Y to the accounting node through the hash. The node only needs the Validator to verify the mapping on the chain Whether it is consistent with the event state Y under the chain, if confirmed, it will be packaged into the next block.
A high-performance distributed storage block data, time stamp, cross-chain communication and data collaboration method according to claim 7, characterized in that: the storage is the mapping of the state, and the chain can be deduced through reverse logic Whether the data on the chain is consistent with the off-chain data, and if the newly added node is a synchronous node, the bookkeeping nodes responsible for the calculation work are all on the operator or the participant, and the management contract can also set the weight of the bookkeeping nodes. Better node voting resolution and dynamic joining.
A high-performance distributed storage block data, time stamp, cross-chain communication and data collaboration method according to claim 1, characterized in that: the heterogeneous cross-chain PegZone in the S5 includes five parts, which are respectively :

smart contract: the role of asset custody in token custody in Ethereum and Cosmos, it mainly provides four methods: lock, unlock, mint and destroy;

witness: This is a full Ethereum node, which monitors the events of the Ethereum contract and waits for 100 blocks to be generated, and the encapsulated witness Tx is submitted to PegZone to prove the state change on the Ethereum blockchain;

PegZone: PegZone is a Tendermint-based blockchain that maintains user account information, allows asset transfers between users and provides transaction queries;

signer: 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;

relay: The relay is responsible for all transaction forwarding, forwarding the signed SignTx to the smart contract.
A high-performance distributed storage block data, time stamp, cross-chain communication and data collaboration 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, with v representing the view number,

The master node is elected by ordinary nodes in turn, and the specific calculation process is master node p=v mod|R| (|R| is the number of nodes),

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;

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;

If the master node is down, re-election will be triggered due to the heartbeat timeout, so as to ensure the stable operation of the system;

If the master node maliciously sends a message with the wrong number, it will be noticed by the replica node in the subsequent operation, because the prepare and commit phases will broadcast, and if they are inconsistent, view-change will be triggered;

The master node does not send the received request. When 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.