Cross-chain data query and consensus optimization method for e-government

By building a sub-blockchain system, generating data summary, creating index tables, sharding storage and using dynamic planning algorithms in the field of e-government, the problems of cross-chain data query and consensus delay are solved, and data sharing efficiency and collaborative operation are improved. efficiency.

CN114238504BActive Publication Date: 2024-11-08SI CHUAN QI ZHI TONG QI YE GUAN LI YOU XIAN GONG SI
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202111524126.5
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-12-14
Publication Date
2024-11-08
Estimated Expiration
2041-12-14

AI Technical Summary

Technical Problem

The difficulty in mutual recognition of cross-chain and cross-domain data in the field of e-government has led to inefficient query efficiency and high consensus delay, affecting collaborative office and information sharing.

Method used

Build a sub-blockchain system of M municipal government departments, and use dynamic programming algorithms to divide roles, generate publicly available data summary, create fast index tables, slice storage and use BP neural network classifiers, and consensus based on dynamic programming algorithms Decision Maker, optimizes cross-chain data query and consensus process.

Benefits of technology

It has improved the efficiency of cross-chain data sharing query between government departments, reduced the consensus delay of cross-chain collaborative operations, and improved the transparency and integrity governance capabilities of government information.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114238504B_ABST
    Figure CN114238504B_ABST
Patent Text Reader

Abstract

The cross-chain data query and consensus optimization method for e-government includes the following steps: 1) for M prefecture-level government departments, M sub-blockchain systems are constructed and the nodes in the system are divided into roles; 2) a government collaborative main chain is constructed to store the summaries of the full business data of M sub-chains, and the sub-chain representative nodes are responsible for maintaining the main chain and uploading the sub-chain business data to the main chain to generate publicly available data summaries; 3) a fast index table of the main chain summary data is generated by associating the index field of the summary data with the data storage location, and the table is persisted in the index database; 4) the main chain with a large amount of data is sharded for storage, and a BP neural network classifier is used in the sharding process to classify the main chain blocks with the maximum query probability of the node for the block as the goal; 5) in the process of cross-chain data interaction, a consensus decider based on a dynamic programming algorithm is used to select the optimal consensus mechanism C that can reduce the consensus delay between the two parties of the government cross-chain, and reach a consensus on the verification and automatic update of transaction data. Through the above method, the present invention provides a cross-chain data query and consensus optimization method for e-government, effectively improves the data query efficiency of cross-chain data sharing among government departments and realizes the consensus delay optimization in the process of cross-chain collaborative operation of government affairs.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention aims to solve the difficulties in cross-chain and cross-domain data mutual recognition and sharing in the field of e-government, as well as the impact of low query efficiency and high consensus delay caused by large data volume on the system, and proposes a cross-chain data query and consensus optimization method for e-government. Background Art

[0002] With the rapid development and application of technologies such as blockchain and artificial intelligence, a new idea worth exploring has been brought about for achieving secure and reliable collaborative office and data sharing in the field of e-government. All departments in the field of e-government have a large amount of available data, but because cross-regional, cross-departmental and cross-level data cannot be effectively shared and exchanged, a series of "data islands" have been formed. E-government information in different departments, levels and fields has weak information integration capabilities, multi-dimensional heterogeneity of data and dependence on intermediate third-party supervision, and high latency of cross-chain and cross-domain collaborative consensus. These problems make collaborative office in the field of e-government inefficient, which is not conducive to information sharing, government transparency and government integrity among government departments, and brings great difficulties to collaborative governance, transparent governance and honest governance of government affairs.

[0003] On the one hand, the traditional e-government system lacks cross-chain and cross-domain government collaborative operation capabilities, and there is no good solution for cross-departmental data sharing. If relevant certification materials from other departments are required when handling business, it will lead to low business handling efficiency. On the other hand, the amount of data in the e-government field is huge. How to efficiently share data across departments, improve the efficiency of cross-chain government data queries, and how to achieve low-latency cross-chain and cross-domain collaborative consensus are issues that need to be urgently addressed. Summary of the invention

[0004] In order to solve the problems existing in the prior art, the present invention provides a cross-chain data query and consensus optimization method for e-government. First, for M prefecture-level government departments, M sub-blockchain systems are constructed and the roles of the nodes in the system are divided; a government collaborative main chain that stores the full business data summaries of M sub-chains is constructed, and the sub-chain representative node is responsible for maintaining the main chain and uploading the sub-chain business data to the main chain to generate a publicly available data summary; according to the index field of the summary data and the data storage location, a fast index table of the main chain summary data is generated and persisted in the index database; the main chain with a large amount of data is fragmented and stored, and a BP neural network classifier is used in the fragmentation process to classify the main chain blocks with the maximum query probability of the node for the block as the goal; finally, in the process of cross-chain data interaction, a consensus decider based on a dynamic programming algorithm is used to select the optimal consensus mechanism C that can reduce the consensus delay between the two parties of the government cross-chain, and reach a consensus on the verification and automatic update of transaction data.

[0005] In order to achieve the above purpose, the technical solution adopted by the present invention is:

[0006] The cross-chain data query and consensus optimization method for e-government has the following steps:

[0007] Step 1) Build M sub-blockchain systems for M prefecture-level government departments and divide the roles of the nodes in the system;

[0008] Step 2) Build a government collaborative main chain that stores the summaries of the full amount of business data of M sub-chains. The sub-chain representative node is responsible for maintaining the main chain and uploading the sub-chain business data to the main chain to generate a publicly available data summary;

[0009] Step 3) Generate a quick index table of the main chain summary data based on the association between the index field of the summary data and the data storage location, and persist it in the index database;

[0010] Step 4) Shard the main chain with huge data volume. Use BP neural network classifier in the sharding process to classify the main chain blocks with the maximum query probability of the node for the block as the goal;

[0011] Step 5) During the cross-chain data interaction process, a consensus decider based on a dynamic programming algorithm is used to select the optimal consensus mechanism C that can reduce the consensus delay between the two parties in the government cross-chain, and reach a consensus on the verification and automatic update of transaction data.

[0012] In the step 1), the specific method is:

[0013] 1.1) Construct M sub-blockchain systems for prefecture-level departments, and in view of the security issues of the blockchain system, divide the nodes into three roles: reliability verification nodes, sub-chain representative nodes, and ordinary user nodes based on node reliability. The reliability is positively correlated with the number of honest behaviors performed by the node per unit time, and its calculation formula is:

[0014]

[0015] Where: T i represents the node reliability; μ represents the positive impact weight of the node reliability behavior; ΔT represents the unit time; n represents the amount of summary data generated per unit time; N k represents the number of times the kth summary data is verified to be reliable per unit time; σ represents the reward coefficient for reliable behavior; ε represents the negative impact weight of unreliable behavior; U k represents the number of times the kth summary data is verified to be unreliable per unit time; φ represents the penalty coefficient for unreliable behavior; S i Indicates the remaining storage space of the node;

[0016] 1.2) Set T i The thresholds α, β, γ are calculated according to Ti The node roles are divided according to the threshold range.

[0017] ① If node T i ≥α, the node is divided into a reliability verification node responsible for supervising the execution behavior of the sub-chain representative node;

[0018] ② If node α>T i ≥β, the node is divided into sub-chain representative nodes, which are responsible for participating in the maintenance of the main chain;

[0019] ③If node β>T i ≥γ, the node is classified as a normal user node, otherwise the node is judged as a malicious node.

[0020] In the step 2), the specific method is:

[0021] 2.1) The subchain representative node generates publicly available summary data based on the key fields of the subchain business data, and generates a summary hash value for each piece of data;

[0022] 2.2) Based on the data storage location information in the summary data, the reliability verification node can query the data;

[0023] 2.3) The verification node verifies the correctness of the summary hash value based on the data;

[0024] 2.4) If the summary hash value is correct, the summary data is sent to the main chain;

[0025] 2.5) If the digest hash value is wrong, the digest data is invalid.

[0026] In the step 3), the specific method is:

[0027] 3.1) Define association relationships: pre-define index processing for the original business data written into the key-value database, define the index field of the summary data and associate it with the data storage location, and generate index data in the form of Key and Value;

[0028] 3.2) Construct a fast index table: All sub-chain representative nodes of M sub-chains maintain a HashMap table, i.e. the fast index table of the main chain, to store all index data;

[0029] 3.3) Index data persistence: The sub-chain representative node persists the data in the HashMap table to the index database and ensures the transaction consistency between the blockchain database and the index database.

[0030] In the step 4), the specific method is:

[0031] 4.1) Data acquisition: Main chain block b is collected at fixed time intervalsi (i=1,2,...,I) to perform detection and obtain the main chain block data set DS;

[0032] 4.2) Preprocessing: normalize the acquired block data and convert the data information into digital quantity according to unified rules and input it into BP neural network classifier;

[0033] 4.3) Feature extraction: Extract the four features H of the main chain block f GT f , P f , SR f , and construct the block features into feature vectors for feature expression;

[0034] H f : Historical characteristics of the main chain block; GT f : Geographic location and data type matching characteristics; P f : Potential characteristics of subchains; SR f : Storage demand characteristics;

[0035] 4.4) Classification decision: The feature vector of the newly generated block of the main chain is classified according to the calculation result of the discriminant function, and the classification result of the block is D i (i=1,2,...,M);

[0036] 4.5) Sharded storage: The main chain node does not store a complete copy of the blockchain, but stores the blocks in the sub-chain with identification number D according to the classification results. i The subchain where (i=1,2,...,M) represents the node, D i Has the highest query probability for this block.

[0037] In the step 5), the specific method is:

[0038] 5.1) Pre-process the consensus mechanism of the chain where the government information is located, that is, use corresponding equipment or sensors to collect information from nodes that interact with multiple parties across chains and domains, and standardize the information after obtaining it;

[0039] 5.2) Use the consensus simulation algorithm to simulate the process of reaching consensus through cross-chain and cross-domain interactive consensus. After multiple iterative calculations, the average consensus delay difference t of different consensus mechanisms is obtained;

[0040] 5.3) If t satisfies the longest consensus delay difference τ that the system can tolerate, the system determines that the consensus delay is acceptable and will not cause the cross-chain transactions between the two parties to be stuck in the waiting sequence;

[0041] 5.4) If t does not meet the longest consensus delay difference τ that the system can tolerate, the different consensus mechanisms are input into the consensus decision maker to select the optimal consensus mechanism C suitable for both parties across the chain based on the dynamic programming algorithm to verify the transaction, and reach a consensus on the automatic update of the data based on the business consistency of the government data;

[0042] The consensus decision mechanism in the consensus decider based on the dynamic programming algorithm includes the following steps: start→|consensus decision 1|→|consensus decision 2|→…→|consensus decision n|→end, calculate the consensus time of each consensus algorithm, and finally select the optimal consensus mechanism C with the fastest consensus.

[0043] The beneficial effects of the present invention are:

[0044] In view of the existing problems, the present invention proposes a cross-chain data query and consensus optimization method for e-government. The method first constructs M sub-blockchain systems for M prefecture-level government departments and divides the roles of the nodes in the system; constructs a government collaborative main chain that stores the summaries of the full amount of business data of M sub-chains, and the sub-chain representative node is responsible for maintaining the main chain and uploading the sub-chain business data to the main chain to generate a publicly available data summary; according to the index field of the summary data and the data storage location, a fast index table of the main chain summary data is generated and persisted in the index database; the main chain with a large amount of data is fragmented and stored, and a BP neural network classifier is used in the fragmentation process to classify the main chain blocks with the maximum query probability of the node to the block as the goal; in the process of cross-chain data interaction, a consensus decision maker based on a dynamic programming algorithm is used to select the optimal consensus mechanism C that can reduce the consensus delay between the two parties of the government cross-chain, and reach a consensus on the verification and automatic update of transaction data. Through the above method, the present invention improves and provides a cross-chain data query and consensus optimization method for e-government, effectively improves the data query efficiency of cross-chain data sharing among government departments, and realizes the optimization of consensus delay in the process of cross-chain collaborative operation of government affairs. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] Figure 1 The figure is a flow chart of the method of the present invention. DETAILED DESCRIPTION

[0046] The cross-chain data query and consensus optimization method for e-government includes the following steps:

[0047] 1) For M prefecture-level government departments, build M sub-blockchain systems and divide the roles of the nodes in the system;

[0048] (1) M prefecture-level departmental sub-blockchain systems are constructed. In order to solve the problem of blockchain system security, nodes are divided into three roles: reliability verification nodes, sub-chain representative nodes, and ordinary user nodes based on node reliability. Reliability is positively correlated with the number of honest behaviors performed by nodes per unit time. Its calculation formula is:

[0049]

[0050] Where: T i represents the node reliability; μ represents the positive impact weight of the node reliability behavior; ΔT represents the unit time; n represents the amount of summary data generated per unit time; N k represents the number of times the kth summary data is verified to be reliable per unit time; σ represents the reward coefficient for reliable behavior; ε represents the negative impact weight of unreliable behavior; U k represents the number of times the kth summary data is verified to be unreliable per unit time; φ represents the penalty coefficient for unreliable behavior; S i Indicates the remaining storage space of the node; the system can adjust the weights μ, ε and coefficients σ, φ. Reliable behaviors include data integrity and consistency, and unreliable behaviors include summary data loss and inconsistency between subchain data and summary data;

[0051] (2) Set T i The thresholds α, β, γ are calculated according to T i The node roles are divided according to the threshold range.

[0052] ① If node T i ≥α, the node is divided into a reliability verification node responsible for supervising the execution behavior of the sub-chain representative node;

[0053] ② If node α>T i ≥β, the node is divided into sub-chain representative nodes, which are responsible for participating in the maintenance of the main chain;

[0054] ③If node β>T i ≥γ, the node is classified as a normal user node, otherwise the node is judged as a malicious node.

[0055] 2) Build a government collaborative main chain that stores the summaries of the full business data of M sub-chains. The sub-chain representative nodes are responsible for maintaining the main chain and uploading the sub-chain business data to the main chain to generate publicly available data summaries;

[0056] (1) The subchain representative node generates publicly available summary data based on the key fields of the subchain business data, and generates a summary hash value for each piece of data;

[0057] (2) Based on the data storage location information in the summary data, the reliability verification node can query the data;

[0058] (3) The verification node verifies the correctness of the digest hash value based on the data;

[0059] (4) If the summary hash value is correct, the summary data is sent to the main chain;

[0060] (5) If the digest hash value is incorrect, the digest data is invalid.

[0061] 3) Generate a quick index table of the main chain summary data based on the association between the index field of the summary data and the data storage location, and persist it in the index database;

[0062] (1) Define association relationships: Perform predefined index processing on the original business data written into the key-value database, define the index field of the summary data and associate it with the data storage location, and generate index data in the form of Key and Value;

[0063] (2) Constructing a fast index table: All subchain representative nodes of the M subchains maintain a HashMap table, i.e., the fast index table of the main chain, to store all index data;

[0064] (3) Index data persistence: The sub-chain representative node persists the data in the HashMap table to the index database and ensures the transaction consistency between the blockchain database and the index database.

[0065] 4) Shard the main chain with huge data volume. Use BP neural network classifier in the sharding process to classify the main chain blocks with the maximum query probability of nodes for blocks as the goal;

[0066] (1) Data acquisition: The main chain block b is acquired at fixed time intervals. i (i=1,2,...,I) to perform detection and obtain the main chain block data set DS;

[0067] (2) Preprocessing: The acquired block data is normalized and converted into digital quantities according to unified rules and input into the BP neural network classifier;

[0068] (3) Feature extraction: Extract the four features H of the main chain block f GT f , P f , SR f , and construct the block features into feature vectors for feature expression;

[0069] H f : Historical characteristics of the main chain block; GT f : Geographic location and data type matching characteristics; P f : Potential characteristics of subchains; SR f: Storage demand characteristics;

[0070] (4) Classification decision: The feature vector of the newly generated block of the main chain is classified according to the calculation result of the discriminant function, and the classification result of the block is D i (i=1,2,...,M);

[0071] (5) Sharded storage: The main chain node does not store a complete copy of the blockchain. Instead, it stores the blocks in the sub-chain with the identification number D according to the classification results. i The subchain where (i=1,2,...,M) represents the node, D i Has the highest query probability for this block.

[0072] 5) During the cross-chain data interaction process, a consensus decider based on a dynamic programming algorithm is used to select the optimal consensus mechanism C that can reduce the consensus delay between the two parties in the government cross-chain, and reach a consensus on the verification and automatic update of transaction data.

[0073] (1) Pre-process the consensus mechanism of the chain where the government information is located, that is, use corresponding equipment or sensors to collect information from nodes that interact with multiple parties across chains and domains, and standardize the information after obtaining it;

[0074] (2) Use the consensus simulation algorithm to simulate the process of reaching consensus through cross-chain and cross-domain interactive consensus. After multiple iterative calculations, the average consensus delay difference t of different consensus mechanisms is obtained;

[0075] (3) If t satisfies the longest consensus delay difference τ that the system can tolerate, the system determines that the consensus delay is acceptable and will not cause cross-chain transactions between the two parties to be stuck in the waiting sequence;

[0076] (4) If t does not satisfy the longest consensus delay difference τ that the system can tolerate, the different consensus mechanisms are input into the consensus decision maker, and the optimal consensus mechanism C suitable for both parties across the chain is selected based on the dynamic programming algorithm to verify the transaction, and consensus is reached on the automatic update of the data based on the business consistency of the government data;

[0077] The consensus decision-making mechanism based on the dynamic programming algorithm includes the following steps: start→|consensus decision 1|→|consensus decision 2|→…→|consensus decision n|→end, calculate the consensus time of each consensus algorithm, and finally select the optimal consensus mechanism C with the fastest consensus.

[0078] Embodiment 1:

[0079] Example: Suppose there are two cities, A and B, and each city has four departments, a, b, c, and d. There are 8 department sub-blockchain systems, and the department sub-chain identification number is D. iThey are: Aa, Ab, Ac, Ad, Ba, Bb, Bc, Bd. First, the sub-blockchain system nodes are divided into reliability verification nodes, sub-chain representative nodes and ordinary user nodes according to the reliability calculation formula. Each department handles business in its own sub-chain system. The generated business data is generated by the sub-chain representative node according to the key fields of the business data. The publicly available summary data is sent to the main chain after verification by the verification node. The hash value of the summary data is defined as the index field. The hash value of the summary data and the data storage location information identified in the summary data are generated into a Key, Value key-value pair, which is stored in the HashMap fast index table of the main chain.

[0080] Assume that user User1 handles a business T1 in department Aa and needs business data T2 in department Ab as proof material. Then, the main chain representative node queries the summary data storage location of business data T2 in the main chain's quick index table to obtain the summary data of business data T2. After business T1 is completed, a new summary data will be generated and sent to the main chain. Assume that the main chain newly generates a block B containing the summary data of business data T1, and stores it in shards after classification. The data summary amount of all department sub-blockchain systems in the block body is shown in Table 1:

[0081] Table 1: Summary of all city and department data in the main chain block

[0082] department Aa Ab Ac Ad Ba Bb Bc B Data volume 40 60 60 30 10 20 20 20

[0083] From the table, we can see that the subchain identification numbers of the departments with the largest data volume are Ab and Ac, both of which have 60 data. According to the analysis of historical transaction records, it is concluded that the department that most frequently queries department Ab is Aa, and the department that most frequently queries department Ac is Ad. However, Ab's data query operations on Aa are mostly performed in recent blocks, so the historical characteristics of the main chain block H f Ab; According to the block header information, the maximum geographical location identification number L m A, maximum data type identification number T m is b, so the geographic location matches the data type feature GT f is Ab; since Ac’s data query response time is longer, the potential feature P of the subchain f According to the system detection, the sub-chain representative node of the Ba department in the current system stores less data. For security reasons, the storage requirement feature SR f The four characteristic values ​​of this main chain block B are shown in Table 2:

[0084] Table 2: Main chain block B feature value table

[0085] feature <![CDATA[H f ]]> <![CDATA[GT f ]]> <![CDATA[P f ]]> <![CDATA[SR f ]]> Relevant departments Ab Ab Ac Ba

[0086] The four characteristics H of the main chain block f GT f , P f , SR f The corresponding eigenvalues ​​are input into the BP neural network classifier, and the final classification result is Ab. Then this block is finally stored in the subchain representative node of the department with the subchain identification number Ab. Ab is the department with the greatest relevance to the block business.

[0087] If detailed information of business data T2 is needed, a cross-chain data query request is sent to the sub-chain representative node of department Ab. During the cross-chain data interaction process, the lowest latency consensus mechanism C suitable for both parties is selected based on the dynamic programming algorithm to reach an agreement on the cross-chain transaction. This transaction record will also be stored in the block of the sub-chain, and the transaction summary data will be uploaded to the main chain.

Claims

1. A cross-chain data query and consensus optimization method for e-government, characterized in that: The steps are: Step 1) Build M sub-blockchain systems for M prefecture-level government departments and divide the roles of the nodes in the system; Step 2) Build a government collaborative main chain that stores the summaries of the full amount of business data of M sub-chains. The sub-chain representative node is responsible for maintaining the main chain and uploading the sub-chain business data to the main chain to generate a publicly available data summary; Step 3) Generate a quick index table of the main chain summary data based on the association between the index field of the summary data and the data storage location, and persist it in the index database; Step 4) Shard the main chain with huge data volume. Use BP neural network classifier in the sharding process to classify the main chain blocks with the maximum query probability of the node for the block as the goal; Step 5) During the cross-chain data interaction process, a consensus decider based on a dynamic programming algorithm is used to select the optimal consensus mechanism C that can reduce the consensus delay between the two parties in the government cross-chain, and reach a consensus on the verification and automatic update of transaction data.

2. The cross-chain data query and consensus optimization method for e-government according to claim 1 is characterized in that: In the step 1), the specific method is: 1.1) Construct M sub-blockchain systems for prefecture-level departments, and in view of the security issues of the blockchain system, divide the nodes into three roles: reliability verification nodes, sub-chain representative nodes, and ordinary user nodes based on node reliability. The reliability is positively correlated with the number of honest behaviors performed by the node per unit time, and its calculation formula is: Where: T i represents the node reliability; μ represents the positive impact weight of the node reliability behavior; ΔT represents the unit time; n represents the amount of summary data generated per unit time; N k represents the number of times the kth summary data is verified to be reliable per unit time; σ represents the reward coefficient for reliable behavior; ε represents the negative impact weight of unreliable behavior; U k represents the number of times the kth summary data is verified to be unreliable per unit time; φ represents the penalty coefficient for unreliable behavior; S i Indicates the remaining storage space of the node; 1.2) Set T i The thresholds α, β, γ are calculated according to T i The node roles are divided according to the threshold range. ① If node T i ≥α, the node is divided into a reliability verification node responsible for supervising the execution behavior of the sub-chain representative node; ② If node α>T i ≥β, the node is divided into sub-chain representative nodes, which are responsible for participating in the maintenance of the main chain; ③If node β>T i ≥γ, the node is classified as a normal user node, otherwise the node is judged as a malicious node.

3. The cross-chain data query and consensus optimization method for e-government according to claim 1 is characterized in that: In the step 2), the specific method is: 2.1) The subchain representative node generates publicly available summary data based on the key fields of the subchain business data, and generates a summary hash value for each piece of data; 2.2) Based on the data storage location information in the summary data, the reliability verification node can query the data; 2.3) The verification node verifies the correctness of the summary hash value based on the data; 2.4) If the summary hash value is correct, the summary data is sent to the main chain; 2.5) If the digest hash value is wrong, the digest data is invalid.

4. The cross-chain data query and consensus optimization method for e-government according to claim 1 is characterized in that: In the step 3), the specific method is: 3.1) Define association relationships: pre-define index processing for the original business data written into the key-value database, define the index field of the summary data and associate it with the data storage location, and generate index data in the form of Key and Value; 3.2) Construct a fast index table: All sub-chain representative nodes of M sub-chains maintain a HashMap table, i.e. the fast index table of the main chain, to store all index data; 3.3) Index data persistence: The sub-chain representative node persists the data in the HashMap table to the index database and ensures the transaction consistency between the blockchain database and the index database.

5. The cross-chain data query and consensus optimization method for e-government according to claim 1 is characterized in that: In the step 4), the specific method is: 4.1) Data acquisition: Main chain block b is collected at fixed time intervals i (i=1,2,...,I) to perform detection and obtain the main chain block data set DS; 4.2) Preprocessing: normalize the acquired block data and convert the data information into digital quantity according to unified rules and input it into BP neural network classifier; 4.3) Feature extraction: Extract the four features H of the main chain block f GT f , P f , SR f , and construct the block features into feature vectors for feature expression; H f : Historical characteristics of the main chain block; GT f : Geographic location and data type matching characteristics; P f : Potential characteristics of subchains; SR f : Storage demand characteristics; 4.4) Classification decision: The feature vector of the newly generated block of the main chain is classified according to the calculation result of the discriminant function, and the classification result of the block is D i (i=1,2,...,M); 4.5) Sharded storage: The main chain node does not store a complete copy of the blockchain, but stores the blocks in the sub-chain with identification number D according to the classification results. i The subchain where (i=1,2,...,M) represents the node, D i Has the highest query probability for this block.

6. The cross-chain data query and consensus optimization method for e-government according to claim 1 is characterized in that: In the step 5), the specific method is: 5.1) Pre-process the consensus mechanism of the chain where the government information is located, that is, use corresponding equipment or sensors to collect information from nodes that interact with multiple parties across chains and domains, and standardize the information after obtaining it; 5.2) Use the consensus simulation algorithm to simulate the process of reaching consensus through cross-chain and cross-domain interactive consensus. After multiple iterative calculations, the average consensus delay difference t of different consensus mechanisms is obtained; 5.3) If t satisfies the longest consensus delay difference τ that the system can tolerate, the system determines that the consensus delay is acceptable and will not cause the cross-chain transactions between the two parties to be stuck in the waiting sequence; 5.4) If t does not meet the longest consensus delay difference τ that the system can tolerate, the different consensus mechanisms are input into the consensus decision maker, and the optimal consensus mechanism C suitable for both parties across the chain is selected based on the dynamic programming algorithm to verify the transaction, and consensus is reached on the automatic update of the data based on the business consistency of the government data.

7. The cross-chain data query and consensus optimization method for e-government according to claim 1 is characterized in that: The consensus decision mechanism in the consensus decider based on the dynamic programming algorithm includes the following steps: start→|consensus decision 1|→|consensus decision 2|→…→|consensus decision n|→end, calculate the consensus time of each consensus algorithm, and finally select the optimal consensus mechanism C with the fastest consensus.

Citation Information

Patent Citations

  • Cross-chain consensus time delay optimization method based on dynamic programming algorithm

    CN110290021A

  • Block chain-based police resource data management collaboration method

    CN113554421A

  • Hierarchical Blockchain Architecture for Global Trade Management

    US20200118068A1

  • Multi-Chain Concurrent Transaction Method

    US20210272111A1