A regional chain data verification method and system
By adopting parallel verification methods of multi-chain sharding and quantum resistance algorithms in blockchain networks, the problems of data security and inefficiency in traditional blockchain technology in quantum computing environments are solved, and efficient and reliable data verification and security guarantee are achieved.
Patent Information
- Application Number
- CN202410783254.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-06-18
- Publication Date
- 2025-03-21
- Estimated Expiration
- 2044-06-18
AI Technical Summary
Traditional blockchain technology faces data security and integrity threats in quantum computing environments, and the single-chain verification mechanism is inefficient when processing large amounts of data.
The data to be verified is sharded and distributed to different blockchain networks through a multi-chain mechanism, and a quantum resistance algorithm is integrated on the verification nodes of each blockchain network to realize the parallel verification of multi-chain and summary of final results.
It improves the efficiency and reliability of data verification, ensures data security and integrity in the quantum computing environment, and solves the problem of fragility of traditional encryption algorithms.
Smart Images

Figure CN118821225B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of regional chains, and in particular to a regional chain data verification method and system. Background Art
[0002] Since its advent, blockchain technology has demonstrated its unique advantages in many fields, such as decentralization, immutability and transparency. However, with the development of quantum computing technology, traditional blockchain technology faces new challenges. The efficient computing power of quantum computing makes existing encryption algorithms vulnerable to attacks, resulting in threats to the security and integrity of data.
[0003] Therefore, ensuring the security of blockchain data in a quantum computing environment has become an urgent problem to be solved. At the same time, as the amount of data continues to increase, the single-chain verification mechanism is inefficient when processing large amounts of data, and the multi-chain parallel verification mechanism has emerged to improve the efficiency and reliability of data verification. Summary of the invention
[0004] The purpose of this section is to summarize some aspects of embodiments of the present invention and briefly introduce some preferred embodiments. Some simplifications or omissions may be made in this section and the specification abstract and the invention title of this application to avoid blurring the purpose of this section, the specification abstract and the invention title, and such simplifications or omissions cannot be used to limit the scope of the present invention.
[0005] In view of the problems existing in the above-mentioned existing regional chain data verification method and system, the present invention is proposed.
[0006] In order to solve the above technical problems, the present invention provides the following technical solutions:
[0007] A regional chain data verification method, the method comprising the following steps:
[0008] S1: Establish data sharding and distribution strategy, shard the data to be verified, and distribute the data to different blockchain networks through a multi-chain mechanism;
[0009] S2: Integrate quantum-resistant algorithms on the verification nodes of each blockchain network to ensure data security in a quantum computing environment;
[0010] S3: Data verification task allocation, which allocates the verification tasks of data fragments to verification nodes in different blockchain networks;
[0011] S4: Multi-chain parallel verification, verification nodes in multiple blockchain networks verify the assigned data fragments simultaneously;
[0012] S5: Verification result summary, summarize the verification results in all blockchain networks and obtain the final verification result.
[0013] As a preferred solution of the regional chain data verification method described in the present invention, wherein:
[0014] The data sharding and distribution strategy includes the following steps:
[0015] S11: Data sharding: divide the data D into n fragments, each fragment D i The size can be expressed by the following formula:
[0016]
[0017] Among them, f(x) is the density function of the data, a i and b i are the starting and ending points of the i-th data segment;
[0018] S12: Data distribution, let m be the number of blockchain networks, D for each data fragment i The distribution weights are normalized by a function g i (y) represents, then:
[0019]
[0020] Among them, W ij It is data segment D i The weight distributed to the jth blockchain network, y ij is the corresponding distribution parameter.
[0021] As a preferred solution of the regional chain data verification method described in the present invention, in the S2 process, the integrated quantum resistance algorithm formula is:
[0022]
[0023] Among them, β ij represents the quantum resistance parameter, t represents the time variable, Q ij It represents the impact of quantum-resistant algorithm on the verification process. As time t increases, the impact of quantum resistance gradually weakens.
[0024] As a preferred solution of the regional chain data verification method described in the present invention, wherein:
[0025] Verification is performed on the verification node of each blockchain network. Assume that each blockchain network j has a data fragment D i The verification result is V ij , the formula is as follows:
[0026]
[0027] Among them, aij and b ij The upper and lower limits of the integral are the time or range interval for verifying the i-th data fragment on the j-th blockchain network; λ ij represents the decay rate of the exponential decay function, α ij represents a constant coefficient.
[0028] As a preferred solution of the regional chain data verification method described in the present invention, wherein:
[0029] In the S5 process, the final verification result is expressed by V, and then:
[0030]
[0031] V represents the overall complexity and security level of the entire data verification process. The higher the value, the more complex and secure the verification process is.
[0032] As a preferred solution of the regional chain data verification method described in the present invention, wherein:
[0033] Set the threshold T and make judgment by judging the V and T values;
[0034] If V ≥ T, it means the verification is successful;
[0035] If V<T, verification fails;
[0036] The T value depends on the historical average verification results and standard deviation.
[0037] As a preferred solution of the regional chain data verification method described in the present invention, wherein:
[0038] The expression of the T value is:
[0039] T=u V +k·σ V . ;
[0040] Among them, u V represents the average value of historical verification results; σ V represents the standard deviation of historical verification results; k represents the empirical coefficient.
[0041] A regional chain data verification system, based on the above regional chain data verification method, includes the following functional modules:
[0042] Data sharding and distribution module, which is used to shard the data to be verified through the established data sharding and distribution strategy, and then distribute the data to different blockchain networks through the multi-chain mechanism;
[0043] Verification task allocation module, which allocates the verification tasks of data fragments to verification nodes in different blockchain networks;
[0044] Multi-chain parallel verification module, which integrates quantum-resistant algorithms on the verification nodes of each blockchain network, and then the verification nodes in multiple blockchain networks simultaneously verify the assigned data fragments;
[0045] The verification result summary module summarizes the verification results in all blockchain networks, considers data sharding and distribution to obtain the final verification results, and compares the results with the set threshold for judgment.
[0046] A computer device includes a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the above-mentioned regional chain data verification method when executing the computer program.
[0047] A computer-readable storage medium having a computer program stored thereon, characterized in that: when the computer program is executed by a processor, the steps of the above-mentioned regional chain data verification method are implemented.
[0048] Beneficial effects of the present invention:
[0049] 1. The present invention uses a multi-chain mechanism to shard the data to be verified and distribute the data to different blockchain networks. Each network verifies at the same time, which improves the efficiency and reliability of data verification. This mechanism not only shares the burden of a single chain, but also processes large-scale data verification requests faster, significantly improving the overall performance of the blockchain system;
[0050] 2. The present invention integrates a quantum-resistant algorithm on the verification node of each blockchain network, and effectively improves the security in a quantum computing environment by introducing quantum-resistant parameters; it enables blockchain data to maintain a high degree of security and integrity even under the threat of quantum computing, solving the vulnerability problem of traditional encryption algorithms. BRIEF DESCRIPTION OF THE DRAWINGS
[0051] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for describing the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work. Among them:
[0052] Figure 1 This is a schematic diagram of the overall structure of a regional chain data verification method proposed by the present invention;
[0053] Figure 2 A simulation diagram of data sharding size in an embodiment of a regional chain data verification method proposed by the present invention;
[0054] Figure 3 A regional chain data verification method proposed by the present invention and a traditional schematic diagram. DETAILED DESCRIPTION
[0055] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, the specific implementation methods of the present invention are described in detail below in conjunction with the accompanying drawings.
[0056] In the following description, many specific details are set forth to facilitate a full understanding of the present invention, but the present invention may also be implemented in other ways different from those described herein, and those skilled in the art may make similar generalizations without violating the connotation of the present invention. Therefore, the present invention is not limited to the specific embodiments disclosed below.
[0057] Secondly, the term "one embodiment" or "embodiment" as used herein refers to a specific feature, structure, or characteristic that may be included in at least one implementation of the present invention. The term "in one embodiment" that appears in different places in this specification does not necessarily refer to the same embodiment, nor does it refer to a separate or selective embodiment that is mutually exclusive with other embodiments.
[0058] Reference Figure 1 , as an embodiment of the present invention, provides a regional chain data verification method and system, the method comprising the following steps:
[0059] S1: Establish data sharding and distribution strategy, shard the data to be verified, and distribute the data to different blockchain networks through a multi-chain mechanism;
[0060] The data sharding and distribution strategy includes the following steps:
[0061] S11: Data sharding: divide the data D into n segments. The size of each segment Di can be expressed by the following formula:
[0062]
[0063] Among them, f(x) is the density function of the data, a i and b i are the starting and ending points of the i-th data segment;
[0064] S12: Data distribution, let m be the number of blockchain networks, D for each data fragment i The distribution weights are normalized by a function g i (y) represents, then:
[0065]
[0066] Among them, W ijIt is data segment D i The weight distributed to the jth blockchain network, y ij is the corresponding distribution parameter.
[0067] S2: Integrate quantum-resistant algorithms on the verification nodes of each blockchain network to ensure data security in a quantum computing environment;
[0068] In the S2 process, the integrated quantum resistance algorithm formula is:
[0069]
[0070] Among them, β ij represents the quantum resistance parameter, t represents the time variable, Q ij It represents the impact of quantum-resistant algorithm on the verification process. As time t increases, the impact of quantum resistance gradually weakens.
[0071] S3: Data verification task allocation, which allocates the verification tasks of data fragments to verification nodes in different blockchain networks;
[0072] S4: Multi-chain parallel verification, verification nodes in multiple blockchain networks verify the assigned data fragments simultaneously;
[0073] Specifically, verification is performed on each verification node of the blockchain network. Assume that each blockchain network j has a data fragment D i The verification result is V ij , the formula is as follows:
[0074]
[0075] Among them, a ij and b ij The upper and lower limits of the integral are the time or range interval for verifying the i-th data fragment on the j-th blockchain network; λ ij represents the decay rate of the exponential decay function, α ij represents a constant coefficient.
[0076] S5: Verification result summary, summarize the verification results in all blockchain networks and obtain the final verification result.
[0077] Specifically, the final verification result is expressed by V, which is:
[0078]
[0079] V represents the overall complexity and security level of the entire data verification process. The higher the value, the more complex and secure the verification process is.
[0080] In addition, a threshold value T is set, and judgment is made by judging the V and T values;
[0081] If V ≥ T, it means the verification is successful;
[0082] If V<T, verification fails;
[0083] The T value depends on the historical average verification results and standard deviation. The expression of the T value is:
[0084] T=u V +k·σ V ;
[0085] Among them, u V represents the average value of historical verification results; σ V represents the standard deviation of historical verification results; k represents the empirical coefficient.
[0086] Reference Figure 2-Figure 3 , In order to facilitate the present invention to be more easily understood, this embodiment combines data to show how to perform data verification based on the comprehensive verification results;
[0087] In practical applications, the data unit should be determined according to the specific data type and transmission medium. For simplicity, we take the data unit as byte as an example. Assume the scenario parameters: data D = 1000 bytes, which is divided into three segments D1 = 400 bytes, D2 = 300 bytes and D3 = 300 bytes;
[0088] Assigned to blockchain networks j=1 and j=2;
[0089] The specific parameter table is as follows:
[0090]
[0091] Weight W ij It is calculated by comprehensively considering the importance of each data fragment in different blockchain networks and the contribution of the verification result. The calculation method refers to the algorithm formula in the embodiment. The calculation result verification result can be known according to the parameters in the table.
[0092] V=0.4×(0.35+0.48)0.332, 0.177,
[0093] +0.3×(0.24+0.35)+0.3×(0.325+0.45)=0,7415;
[0094] In traditional technology, quantum resistance parameters are not considered, and a simple verification mechanism is directly used for data verification, simulating common blockchain verification algorithms, such as verifying data fragments through hash functions and calculating verification results. The traditional averaging of the verification results yields:
[0095] V traditional =1 / 6(0.68+0.72+0.62+0.68+0.63+0.70)=0,68833;
[0096] It can be seen that through comparison we can find that our solution has significant advantages in data sharding, multi-chain parallel verification and quantum-resistant algorithm integration.
[0097] The comprehensive verification results are higher than those of traditional methods and closer to the set threshold, showing better verification results. At the same time, the quantum-resistant algorithm ensures security in a quantum computing environment, which is better than traditional methods.
[0098] The present invention also discloses a regional chain data verification system. Based on the above regional chain data verification method, the system includes the following functional modules:
[0099] Data sharding and distribution module, which is used to shard the data to be verified through the established data sharding and distribution strategy, and then distribute the data to different blockchain networks through the multi-chain mechanism;
[0100] Verification task allocation module, which allocates the verification tasks of data fragments to verification nodes in different blockchain networks;
[0101] Multi-chain parallel verification module, which integrates quantum-resistant algorithms on the verification nodes of each blockchain network, and then the verification nodes in multiple blockchain networks simultaneously verify the assigned data fragments;
[0102] The verification result summary module summarizes the verification results in all blockchain networks, considers data sharding and distribution to obtain the final verification results, and compares the results with the set threshold for judgment.
[0103] This embodiment also provides a computer device, which is applicable to a regional chain data verification method, including: a memory and a processor; the memory is used to store computer executable instructions, and the processor is used to execute computer executable instructions to implement a regional chain data verification method proposed in the above embodiment.
[0104] The computer device may be a terminal, and the computer device includes a processor, a memory, a communication interface, a display screen and an input device connected via a system bus. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The communication interface of the computer device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner can be achieved through WIFI, an operator network, NFC (near field communication) or other technologies. The display screen of the computer device may be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device may be a touch layer covering the display screen, or a key, trackball or touchpad provided on the housing of the computer device, or an external keyboard, touchpad or mouse, etc.
[0105] This embodiment also provides a storage medium on which a computer program is stored. When the program is executed by a processor, a regional chain data verification method proposed in the above embodiment is implemented; the storage medium can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (Static Random Access Memory, referred to as SRAM), electrically erasable programmable read-only memory (Electrically Erasable Programmable Read-Only Memory, referred to as EEPROM), erasable programmable read-only memory (Erasable Programmable Read Only Memory, referred to as EPROM), programmable read-only memory (Programmable Red-Only Memory, referred to as PROM), read-only memory (Read-Only Memory, referred to as ROM), magnetic storage, flash memory, magnetic disk or optical disk.
[0106] It should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solutions of the present invention may be modified or replaced by equivalents without departing from the spirit and scope of the technical solutions of the present invention, which should all be included in the scope of the claims of the present invention.
Claims
1. A regional chain data verification method, characterized in that: The method includes the following steps: S1: Establish a data sharding and distribution strategy, shard the data to be verified, and distribute the data to different blockchain networks through a multi-chain mechanism; The data sharding and distribution strategy includes the following steps: S11: Data sharding: divide the data D into n fragments, each fragment D i The size can be expressed by the following formula: Among them, f(x) is the density function of the data, a i and b i are the starting and ending points of the i-th data segment; S12: Data distribution, let m be the number of blockchain networks, D for each data fragment i The distribution weights are normalized by a function g i (y) represents, then: Among them, W ij It is data segment D i The weight distributed to the jth blockchain network, y ij is the corresponding distribution parameter; S2: Integrate a quantum-resistant algorithm on the verification nodes of each blockchain network to ensure the security of data in a quantum computing environment; The integrated quantum-resistant algorithm formula is: Among them, β ij represents the quantum resistance parameter, t represents the time variable, Q ij Represents the impact of the quantum-resistant algorithm on the verification process. As time t increases, the impact of quantum resistance gradually weakens S3: Allocate data verification tasks, and allocate the verification tasks of data fragments to the verification nodes in different blockchain networks; S4: Multi-chain parallel verification, where the verification nodes in multiple blockchain networks simultaneously verify the allocated data fragments; The specific method of multi-chain parallel verification is: verification is performed on the verification node of each blockchain network, assuming that each blockchain network j has a data fragment D i The verification result is V ij , the formula is as follows: Among them, a ij and b ij The upper and lower limits of the integral are the time or range interval for verifying the i-th data fragment on the j-th blockchain network; λ ij represents the decay rate of the exponential decay function, α ij represents a constant coefficient; S5: Summarize the verification results, summarize the verification results in all blockchain networks, obtain the final verification result, and the final verification result is expressed by V, then there is: Where V represents the overall complexity and security level of the entire data verification process. The higher the value, the more complex and secure the verification process.
2. A regional chain data verification method according to claim 1, characterized in that: Set a threshold T and make a judgment by comparing V with the T value; If V≥T, it means the verification passes; If V<T, otherwise the verification fails; Where the T value depends on the historical average verification result and the standard deviation.
3. A regional chain data verification method according to claim 2, characterized in that: The expression of the T value is: T=u V +k·s V ; Among them, u V represents the average value of historical verification results; σ V represents the standard deviation of historical verification results; k represents the empirical coefficient.
4. A regional chain data verification system, based on a regional chain data verification method according to any one of claims 1 to 3, characterized in that: The system includes the following functional modules: A data sharding and distribution module, which is used to shard the data to be verified through the established data sharding and distribution strategy, and then distribute the data to different blockchain networks through a multi-chain mechanism; A verification task allocation module, which allocates the verification tasks of data fragments to the verification nodes in different blockchain networks; A multi-chain parallel verification module, which integrates a quantum-resistant algorithm on the verification nodes of each blockchain network, and then the verification nodes in multiple blockchain networks simultaneously verify the allocated data fragments; A verification result summary module, which summarizes the verification results in all blockchain networks, and obtains the final verification result considering data sharding and distribution, and compares the result with the set threshold for determination.
5. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, it implements the steps of a regional chain data verification method according to any one of claims 1 to 3.
6. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by the processor, it implements the steps of a regional chain data verification method according to any one of claims 1 to 3.
Citation Information
Patent Citations
Annular confidential service method based on quantum resistance
CN113225189A
Block chain aggregation architecture based on multi-chain fragmentation
CN113821566A