Blockchain system and method based on spatial coordinates to realize decentralized blockchain data structure and avoid data bifurcation

By introducing a spatial coordinate mechanism and a spatiotemporal synchronous aggregation authentication mechanism in the blockchain, using blocks to create timestamps and spatial data comparisons, determining the legally winning blocks, solving the problem of blockchain data forking and improving blocks The security and efficiency of chain data are suitable for a wide range of applications.

CN112256798BActive Publication Date: 2024-11-19THE THIRD RES INST OF MIN OF PUBLIC SECURITY
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202011212266.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2020-11-03
Publication Date
2024-11-19
Estimated Expiration
2040-11-03

AI Technical Summary

Technical Problem

Due to the large amount of data concurrency and network delay, existing decentralized blockchain data may have multiple different blockchain nodes for the same pre-block at the timestamp points of the second-level precision unit. Packaging to generate blockchain data forks, affecting the security of blockchain data.

Method used

Introduce a spatial coordinate mechanism, and use the blockchain data space-time synchronous aggregation authentication mechanism to compare the timestamps and spatial data by using block creation to determine that the packed blocks with far distances are the final legally winning blocks to avoid data forks.

Benefits of technology

It effectively solves the problem of decentralized blockchain data fork, improves the security and efficiency of blockchain data, and this method has backward compatibility and is suitable for a wide range of application scenarios.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN112256798B_ABST
    Figure CN112256798B_ABST
Patent Text Reader

Abstract

The present invention relates to a blockchain system that implements a decentralized blockchain data structure based on spatial coordinates to avoid data bifurcation, wherein the blockchain system includes a block header and a block body. The system adds a block creation space data information module and an enhanced block hash value information module on the basis of the original decentralized blockchain system, and realizes the dual calibration function of the time and space information of the blockchain data by adding spatial coordinates and a coordinate verification mechanism. The present invention also relates to a processing method for implementing a decentralized blockchain data structure based on spatial coordinates to avoid data bifurcation using the blockchain system. The blockchain system and processing method thereof that implement a decentralized blockchain data structure based on spatial coordinates to avoid data bifurcation of the present invention are adopted, and multi-data aggregation is realized through a time-space synchronization convergence authentication mechanism, solving the major security problem of decentralized blockchain data bifurcation.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of blockchain technology, and in particular to the field of trusted security authentication of blockchain data, and specifically refers to a blockchain system and a processing method thereof that implements a decentralized blockchain data structure based on spatial coordinates to avoid data bifurcation. Background Art

[0002] From a scientific and technological perspective, blockchain technology involves many scientific and technological issues such as mathematics, cryptography, the Internet, and computer programming. From an application perspective, blockchain is a distributed shared ledger and database with the characteristics of decentralization, immutability, full traceability, traceability, collective maintenance, and openness and transparency. These characteristics ensure the "honesty" and "transparency" of blockchain and lay the foundation for blockchain to create trust. The rich application scenarios of blockchain are basically based on the ability of blockchain to solve the problem of information asymmetry and achieve collaborative trust and concerted action among multiple entities.

[0003] Spacetime is a shorthand collective noun for time and space, and is a basic concept in mechanics and physics. Under the condition of a fixed reference system, the time attribute and the space attribute can be regarded as two basic attributes of the existence of a certain objective entity world. And in the actual environment, under the premise of continuous time and the same space, the occurrence of specific events is unique and irreversible.

[0004] At present, the known decentralized blockchain data mainly consists of two parts: block header and block body. Taking the current mature application Bitcoin as an example, the Bitcoin block header contains the version number, the hash value of the previous block, the Merkle trust tree value, the block creation timestamp, the block's workload difficulty target and the parameter value used to calculate the target; the block body contains the number of transactions stored in the block and the transaction data.

[0005] At present, in the actual application of blockchain data, due to the large scale of data concurrency and the network delay that fails to verify the packaging in time, there may be multiple different blockchain nodes at the timestamp point with second-level precision that will package the same previous block, which will cause blockchain data bifurcation, a major security issue that seriously affects the use of blockchain data. In order to overcome the major security issue of bifurcation in the existing decentralized blockchain data, the mechanism for determining the final legal winner of the packaged blocks of different nodes for the same previous block is the key. The computing power determination method is currently used, that is, under the same timestamp conditions, the subsequent two chains are parallel and the chain with the fastest growth rate is determined as the final winning chain. The computing power determination method reduces the efficiency of block generation, and the increase in computing power increases energy consumption. Facts have proved that the existing computing power determination method blockchain bifurcation solution mechanism has not yet solved the problem well. For example, in 2017, the BTC chain (Bitcoin chain) has bifurcated and formed two parallel coexisting chains, BTC and BCC. And another famous ETH chain (Ethereum chain) also formed two parallel coexisting chains, ETH and ETC, after bifurcation in 2016. Therefore, in the process of block data packaging, innovative technical methods are needed to solve the problem of blockchain data fork. Summary of the invention

[0006] The purpose of the present invention is to overcome the shortcomings of the above-mentioned prior art and provide a blockchain system and a processing method thereof which have downward compatibility and a wide range of applications and which implement a decentralized blockchain data structure based on the introduction of spatial coordinates to avoid data forks.

[0007] In order to achieve the above-mentioned purpose, the blockchain system and processing method thereof for realizing a decentralized blockchain data structure based on spatial coordinates to avoid data bifurcation are as follows:

[0008] The blockchain system based on spatial coordinates is introduced to realize decentralized blockchain data structure to avoid data bifurcation. Its main features are that the blockchain system includes:

[0009] The block header includes:

[0010] The block creation space data information module is used to store the block creation space data;

[0011] Enhanced block Hash value information module, used to record enhanced block Hash value;

[0012] as well as

[0013] Block body.

[0014] Preferably, the block header further includes:

[0015] The version number information module is used to record the version number of the corresponding block;

[0016] Block creation timestamp data information module, used to record block creation timestamp data;

[0017] The previous block hash value information module is used to store the previous block hash value;

[0018] Merkle trusted tree value information module, used to store Merkle trusted tree value;

[0019] The block's workload difficulty target information module is used to record the block's workload difficulty target information, and

[0020] The random parameter value information module for calculating the target is used to record the random parameter value used for calculating the target.

[0021] Preferably, the block body comprises:

[0022] The block storage transaction quantity information module is used to record the transaction quantity stored in the block; and

[0023] The transaction data information module is used to record the transaction data of the block.

[0024] More preferably, the enhanced block Hash value recorded in the enhanced block Hash value information module is obtained by Hash calculation of the version number information of the corresponding block, the block creation timestamp data, the previous block Hash value, the Merkle trusted tree value, the workload difficulty target information of the block, the random parameter value information used to calculate the target, the number of transactions stored in the block, the transaction data, the corresponding block separator information and the number of bytes after the block separator, and is used to verify the security of the data in the block.

[0025] Preferably, the block creation spatial data information module uses the longitude and latitude positions of the physical world as spatial data for calibration or uses the IP address of the virtual world as spatial data for calibration.

[0026] The method for avoiding data bifurcation by using the above-mentioned blockchain system to realize a decentralized blockchain data structure based on spatial coordinates is mainly characterized in that the method includes a block generation processing operation and a space-time synchronization convergence authentication processing operation, wherein the block generation processing operation includes the following steps:

[0027] Step 1: Create a new block and block header, write the block separator information module and version number information module; obtain the previous winning block through the time-space synchronization convergence authentication mechanism, calculate the hash value of all the data in the previous block and write it into the previous block hash value information module in this block;

[0028] Step 2: Obtain and record the transaction quantity information module, transaction data information module and the formed block body stored in this block, and on this basis calculate and write the Merkle trust tree value information module and the byte number information module after the block separator into this block;

[0029] Step 3: Calculate the effective value according to the workload difficulty target information module of the block in the previous block and the random parameter value information module for calculating the target. At the same time, obtain the current timestamp data value and space data value and write them into the block creation timestamp data information module and block creation space data information module respectively. At the same time, generate the workload difficulty target information module and the random parameter value information module for calculating the target of this block and write them into the corresponding position in this block.

[0030] Step 4: Perform hash calculation based on the block creation timestamp data information module and the block creation space data information module, as well as the block version number information module, the previous block hash value information module, the Merkle trusted tree value information module, the block workload difficulty target information module, the random parameter value information module used to calculate the target, the transaction quantity information module stored in the block, the transaction data information module, the block separator information module, and the number of bytes after the block separator information module, and write them into the enhanced block hash value information module of this block;

[0031] The time-space synchronization convergence authentication processing operation is specifically as follows:

[0032] The block creation timestamp data information module is preferably used to compare the current block creation space data with the block creation space data of the previous block, and the packaged block with the smaller block creation timestamp data information module is calculated as the final legal winning block of this time;

[0033] If the block creation timestamp data information module of the current block creation space data is the same as that of the block creation space data of the previous block, then by comparing the distance difference between the current block creation space data and the block creation space data of the previous block, it is confirmed that the packaged block with a farther distance is the final legal winning block this time, thereby avoiding subsequent data forks.

[0034] Preferably, the time-space synchronization convergence authentication processing operation comprises the following steps:

[0035] Step a: In this block, the enhanced block hash value information module is used to verify the security of the block creation timestamp data information module and the block creation space data information module in the block, as well as the version number information module of the block, the previous block hash value information module, the Merkle trusted tree value information module, the block workload difficulty target information module, the random parameter value information module for calculating the target, the transaction number information module stored in the block, the transaction data information module, the block separator information module, and the number of bytes after the block separator information module;

[0036] Step b: Use the block creation timestamp data information module to compare the packaged blocks A, B, and C of different nodes. The packaged block with the smaller timestamp data is the final legal winning block;

[0037] Step c: If the creation timestamp data of blocks A and B are the same, by comparing the distance between the creation space data information of the current block in A and B and the creation space data information of the previous block, that is, calculating the distance difference, it is determined that the packaged block with a longer distance is the final legal winning block of this time;

[0038] Step d: Create a new block, write the block separator information module and the version number information module; select the winning block according to the blockchain data time-space synchronization convergence authentication mechanism, perform hash calculation on all the data of the winning block and record it in the previous block hash value information module in the new block;

[0039] Among them, the block height of the current block is H, the block height of the previous block is H-1, and the block height of the new block is H+1.

[0040] Preferably, the distance difference is calculated by calculating the latitude and longitude difference distance in the physical world or the IP address difference distance in the virtual world between the current block creation space and the block creation space of the previous block.

[0041] The blockchain system and processing method thereof that implement decentralized blockchain data structure based on spatial coordinates to avoid data bifurcation according to the present invention are adopted. On the basis of the original decentralized blockchain system, the spatial coordinates and coordinate verification mechanism are added to realize the dual calibration function of the time and space information of the blockchain data. At the same time, on the basis of the general peer-to-peer network (point-to-point network) blockchain data, the spatial coordinates and the time and space coordinate verification mechanism are added to realize the dual calibration function of the time and space position information of the blockchain data, and then the blockchain data time and space synchronization convergence authentication mechanism can be further used to realize multi-party data convergence, solve the major security problem of decentralized blockchain data bifurcation, and the enhanced blockchain data system structure that introduces spatial coordinates is an extension of the original blockchain data system, has downward compatibility, is easy to smoothly transition and realize on the basis of the original chain, and has a wider range of applications. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] Figure 1 This is a schematic diagram of the structure of a blockchain system that introduces a decentralized blockchain data structure based on spatial coordinates to avoid data forks.

[0043] Figure 2 This is a flowchart of the block generation processing operation in the processing method of the present invention for introducing a decentralized blockchain data structure based on spatial coordinates to avoid data forks.

[0044] Figure 3 This is a flow chart of the spatiotemporal synchronization convergence authentication processing operation of the processing method of the present invention that introduces a decentralized blockchain data structure based on spatial coordinates to avoid data forks.

[0045] Figure 4 The figure is a schematic diagram of the overall principle of the block generation processing operation of the processing method of the present invention that introduces a decentralized blockchain data structure based on spatial coordinates to avoid data bifurcation.

[0046] Figure 5 The present invention is a schematic diagram of the overall principle of the spatiotemporal synchronization convergence authentication processing operation of the processing method of the present invention that introduces a decentralized blockchain data structure based on spatial coordinates to avoid data bifurcation.

[0047] Reference numerals

[0048] 1 Block Header

[0049] 2 Version number information module

[0050] 3 Block creation timestamp data information module

[0051] 4 Block creation spatial data information module

[0052] 5 Enhanced Block Hash Value Information Module

[0053] 6 Previous block hash value information module

[0054] 7 Merkle Trust Tree Value Information Module

[0055] 8 Block Work Difficulty Target Information Module

[0056] 9 Module for calculating random parameter values ​​of the target

[0057] 10 Block

[0058] 11. Block storage transaction quantity information module

[0059] 12 Transaction data information module

[0060] 13 Block separator information module

[0061] 14 Bytes after the block separator information module DETAILED DESCRIPTION

[0062] In order to more clearly describe the technical content of the present invention, further description is given below in conjunction with specific embodiments.

[0063] The blockchain system of the present invention introduces a decentralized blockchain data structure based on spatial coordinates to avoid data bifurcation, wherein the blockchain system includes:

[0064] Block header 1, including:

[0065] The block creation space data information module 4 is used to store the block creation space data;

[0066] Enhanced block Hash value information module 5, used to record the enhanced block Hash value;

[0067] as well as

[0068] Block 10.

[0069] As a preferred embodiment of the present invention, the block header 1 further includes:

[0070] Version number information module 2, used to record the version number of the corresponding block;

[0071] Block creation timestamp data information module 3, used to record block creation timestamp data;

[0072] The previous block Hash value information module 6 is used to store the previous block Hash value;

[0073] Merkle trusted tree value information module 7, used to store Merkle trusted tree value;

[0074] The block workload difficulty target information module 8 is used to record the workload difficulty target information of the block, and

[0075] The random parameter value information module 9 for calculating the target is used to record the random parameter value for calculating the target.

[0076] As a preferred embodiment of the present invention, the block body 10 comprises:

[0077] The block storage transaction quantity information module 11 is used to record the transaction quantity stored in the block; and

[0078] The transaction data information module 12 is used to record the transaction data of the block.

[0079] As a preferred embodiment of the present invention, the enhanced block Hash value recorded in the enhanced block Hash value information module 5 is obtained by Hash calculation of the version number information of the corresponding block, the block creation timestamp data, the previous block Hash value, the Merkle trusted tree value, the workload difficulty target information of the block, the random parameter value information used to calculate the target, the number of transactions stored in the block, the transaction data, the corresponding block separator information and the number of bytes after the block separator, and is used to verify the security of the data in the block.

[0080] As a preferred embodiment of the present invention, the block creation spatial data information module 4 uses the longitude and latitude positions of the physical world as spatial data for calibration or uses the IP address of the virtual world as spatial data for calibration.

[0081] The present invention utilizes the above-mentioned blockchain system to implement a processing method for avoiding data forks based on a decentralized blockchain data structure introduced based on spatial coordinates. As a preferred embodiment of the present invention, the method described includes a block generation processing operation and a space-time synchronization convergence authentication processing operation.

[0082] See also Figure 2 As shown, in a specific implementation, the block generation processing operation includes the following steps:

[0083] Step 1: Create a new block and block header, write the block separator information module 13 and the version number information module 2; obtain the previous winning block through the time-space synchronization convergence authentication mechanism, calculate the hash value of all the data in the previous block and write it into the previous block hash value information module 6 in this block;

[0084] Step 2: Obtain and record the transaction quantity information module 11, transaction data information module 12 and the formed block body 10 stored in this block, and on this basis calculate and write the Merkle trust tree value information module 7 and the number of bytes after the block separator information module 14 of this block;

[0085] Step 3: Calculate the effective value according to the workload difficulty target information module 8 of the block in the previous block and the random parameter value information module 9 for calculating the target. At the same time, obtain the current timestamp data value and space data value and write them into the block creation timestamp data information module 3 and the block creation space data information module 4 respectively. At the same time, generate the workload difficulty target information module 8 and the random parameter value information module 9 for calculating the target of this block and write them into the corresponding position in this block.

[0086] Step 4: Perform hash calculation based on the block creation timestamp data information module 3 and the block creation space data information module 4 as well as the block version number information module 2, the previous block hash value information module 6, the Merkle trusted tree value information module 7, the block workload difficulty target information module 8, the random parameter value information module 9 for calculating the target, the transaction quantity information module 11 stored in the block, the transaction data information module 12, the block separator information module 13, and the number of bytes after the block separator information module 14, and write into the enhanced block hash value information module 5 of this block.

[0087] As a preferred embodiment of the present invention, the spatiotemporal synchronization convergence authentication processing operation is specifically as follows:

[0088] The block creation timestamp data information module 3 is preferably used to compare the current block creation space data with the block creation space data of the previous block, and the smaller packaged block of the block creation timestamp data information module 3 is calculated as the final legal winning block of this time;

[0089] If the block creation timestamp data information module 3 of the current block creation space data is the same as that of the block creation space data of the previous block, then by comparing the distance difference between the current block creation space data and the block creation space data of the previous block, it is confirmed that the packaged block with a farther distance is the final legal winning block this time, thereby avoiding subsequent data forks.

[0090] See also Figure 3 As shown, in a specific implementation manner, the spatiotemporal synchronization convergence authentication processing operation includes the following steps:

[0091] Step a: In this block, the enhanced block hash value information module 5 is used to perform security verification on the block creation timestamp data information module 3 and the block creation space data information module 4, as well as the block version number information module 2, the previous block hash value information module 6, the Merkle trusted tree value information module 7, the block workload difficulty target information module 8, the random parameter value information module 9 for calculating the target, the block stored transaction number information module 11, the transaction data information module 12, the block separator information module 13, and the number of bytes after the block separator information module 14;

[0092] Step b: Use the block creation timestamp data information module 3 to compare the packaged blocks A, B, and C of different nodes. The packaged block with the smaller timestamp data is the final legal winning block;

[0093] Step c: If the creation timestamp data of blocks A and B are the same, by comparing the distance between the creation space data information of the current block in A and B and the creation space data information of the previous block, that is, calculating the distance difference, it is determined that the packaged block with a longer distance is the final legal winning block of this time;

[0094] Step d: Create a new block and write the block separator information module 13 and the version number information module 2; select the winning block according to the blockchain data spatiotemporal synchronization convergence authentication mechanism, perform hash calculation on all data of the winning block and record it in the previous block hash value information module 6 in the new block.

[0095] Among them, as a preferred embodiment of the present invention, the block height of the current block is H, the block height of the previous block is H-1, and the block height of the new block is H+1.

[0096] As a preferred embodiment of the present invention, the distance difference is calculated by calculating the latitude and longitude difference distance in the physical world or the IP address difference distance in the virtual world between the current block creation space and the block creation space of the previous block.

[0097] This technical solution takes Bitcoin in blockchain applications as an example to form an enhanced decentralized blockchain data structure that introduces spatial coordinates, including a block header 1, a version number information module 2, a block creation timestamp data information module 3, a block creation space data information module 4, an enhanced block hash value information module 5, a previous block hash value information module 6, a Merkle trusted tree value information module 7, a block workload difficulty target information module 8, a random parameter value information module 9 for calculating the target, a block body 10, a block storage transaction quantity information module 11, and a transaction data information module 12. The block 12, the block separator information module 13, the number of bytes after the block separator information module 14, the block header 1 includes the version number information module 2, the block creation space data information module 4, the block creation timestamp data information module 3, the enhanced block hash value information module 5, the previous block hash value information module 6, the Merkle trusted tree value information module 7, the block workload difficulty target information module 8 and the random parameter value information module 9 for calculating the target, the block body 10 includes the transaction quantity information module 11 and the transaction data information module 12 stored in the block.

[0098] As a preferred embodiment of the present invention, taking the Bitcoin data structure as an example, the enhanced block Hash value information module 5 is composed of a block creation timestamp data information module 3 and a block creation space data information module 4, as well as the block version number information module 2, the previous block Hash value information module 6, the Merkle trusted tree value information module 7, the block workload difficulty target information module 8, the random parameter value information module 9 for calculating the target, the block storage transaction number information module 11, the transaction data information module 12, the block separator information module 13, and the number of bytes after the block separator information module 14. The block creation timestamp data information module 3 and the block creation space data information module 4 in the block, as well as the block version number information module 2, the previous block Hash value information module 6, the Merkle trusted tree value information module 7, the block workload difficulty target information module 8, the random parameter value information module 9 for calculating the target, the transaction quantity information module 11 stored in the block, the transaction data information module 12, the block separator information module 13 and the number of bytes after the block separator information module 14 can be security verified through the enhanced block Hash value information module 5.

[0099] As a preferred embodiment of the present invention, taking the packaging authentication of Bitcoin as an example, the blockchain data space-time synchronization convergence authentication mechanism is to preferentially use the block creation timestamp data information module 3 to compare different packaged blocks, and the packaged block with a smaller block creation timestamp data information module 3 is the final legally winning block this time; when the block creation timestamp data information module 3 is the same, by comparing the distance relationship between the current block creation space data information module 4 and the previous block creation space data information module 4, that is, calculating the difference distance of the latitude and longitude position of the physical world in the previous and subsequent secondary space or the difference distance of the IP address in the virtual world, it is determined that the packaged block with a longer distance is the final legally winning block this time. And then directly avoid the generation of subsequent forks.

[0100] In a specific embodiment of the present invention, a method for solving decentralized blockchain data forks by introducing a decentralized blockchain data structure based on spatial coordinates is involved. Taking Bitcoin in blockchain applications as an example, an enhanced decentralized blockchain data structure introducing spatial coordinates is formed, which includes a block header 1, a version number information module 2, a block creation timestamp data information module 3, a block creation space data information module 4, an enhanced block hash value information module 5, a previous block hash value information module 6, a Merkle trusted tree value information module 7, a block workload difficulty target information module 8, and a random parameter value information module 9 for calculating the target, and a block body 10. , a transaction quantity information module 11 stored in the block, a transaction data information module 12, a block separator information module 13, and a byte number information module 14 after the block separator. The block header 1 includes a version number information module 2, a block creation timestamp data information module 3, a block creation space data information module 4, an enhanced block hash value information module 5, a previous block hash value information module 6, a Merkle trusted tree value information module 7, a block workload difficulty target information module 8, and a random parameter value information module 9 for calculating the target. The block body 10 includes a transaction quantity information module 11 and a transaction data information module 12 stored in the block.

[0101] The enhanced decentralized blockchain data structure adds a block creation space data information module 4 and an enhanced block hash value information module 5 on the basis of the existing general blockchain data structure. The value of the block creation space data information module 4 can be calibrated using the longitude and latitude position of the physical world as spatial data, or it can be calibrated using the IP address of the virtual world as spatial data. The enhanced block hash value information module 5 is obtained by hashing the block creation space data information module 4, the block creation timestamp data information module 3, and all other data of the block except the enhanced block hash value information module itself, so that the security of the data in the block can be verified through the enhanced block hash value information module.

[0102] In order to overcome the major security problem of bifurcation of existing decentralized blockchain data, the key is to determine the mechanism of the final legal winner of the packaged blocks of different nodes for the same previous block. In particular, when the timestamps are the same under decentralized conditions, the mechanism of determining the legally packaged winning blocks is the core point of solving the bifurcation problem. The present invention introduces a method for solving the bifurcation of decentralized blockchain data by introducing spatial coordinates, adding block creation space data and enhanced block hash value on the basis of the current general blockchain data structure, and realizing multi-party data aggregation through the blockchain data space-time synchronization aggregation authentication mechanism, solving the major security problem of bifurcation of decentralized blockchain data.

[0103] See also Figure 1 As shown, in a specific embodiment of the present invention, taking the Bitcoin data structure as an example, an enhanced decentralized blockchain data structure introducing spatial coordinates includes a block header 1, a version number information module 2, a block creation timestamp data information module 3, a block creation space data information module 4, an enhanced block Hash value information module 5, a previous block Hash value information module 6, a Merkle trusted tree value information module 7, a block workload difficulty target information module 8, a random parameter value information module 9 for calculating the target, a block body 10, a block storage transaction quantity information module 11, a transaction data information module 12, a block separator information module 13, and a byte number information module 14 after the block separator.

[0104] The block creation spatial data information module 4 may use the longitude and latitude of the physical world as spatial data for calibration, or may use the IP address of the virtual world as spatial data for calibration.

[0105] In addition, the enhanced block hash value information module 5 is obtained by performing hash calculation on the block creation timestamp data information module 3, the block creation space data information module 4, the block version number information module 2, the previous block hash value information module 6, the Merkle trusted tree value information module 7, the block workload difficulty target information module 8, the random parameter value information module 9 for calculating the target, the transaction quantity information module 11 stored in the block, the transaction data information module 12, the block separator information module 13, and the number of bytes after the block separator information module 14. Therefore, the enhanced block hash value information module 5 can be used to perform security verification on the block creation timestamp data information module 3 and the block creation space data information module 4 in the block, as well as the block version number information module 2, the previous block hash value information module 6, the Merkle trusted tree value information module 7, the block workload difficulty target information module 8, the random parameter value information module 9 for calculating the target, the transaction quantity information module 11 stored in the block, the transaction data information module 12, the block separator information module 13, and the number of bytes after the block separator information module 14.

[0106] In addition, the blockchain data space-time synchronization convergence authentication mechanism is to preferentially use the block creation timestamp data information module 3 to compare different packaged blocks, and the packaged block with a smaller timestamp data is the final legally winning block this time; when the block creation timestamp data information module 3 is the same, by comparing the distance relationship between the current block creation space data information module 4 and the previous block creation space data information module, that is, calculating the difference distance of the latitude and longitude position of the physical world in the previous and subsequent two-dimensional space or the difference distance of the IP address in the virtual world, it is determined that the packaged block with a longer distance is the final legally winning block this time. This directly avoids the occurrence of subsequent forks.

[0107] See also Figure 4 As shown, in one embodiment of the present invention, taking Bitcoin block generation as an example, a block generation processing operation of a processing method for introducing a decentralized blockchain data structure based on spatial coordinates to avoid data bifurcation specifically includes the following steps:

[0108] When generating block data:

[0109] Step 1, create a new block (block height is H) and block header 1, write the block separator information module 13, version number information module 2; obtain the last winning block according to the blockchain data time-space synchronization convergence authentication mechanism, hash all the data of the previous block (block height is H-1) and write it into the previous block hash value information module 6 in this block;

[0110] Step 2, obtain and record the transaction quantity information module 11 and transaction data information module 12 stored in this block to form a block body 10, and on this basis calculate and write the Merkle trust tree value information module 7 and the number of bytes after the block separator 14 information module of this block;

[0111] Step 3, calculate the effective value according to the workload difficulty target information module 8 of the block in the previous block and the random parameter value information module 9 for calculating the target, and at the same time obtain the current timestamp data value and space data value and write them into the block creation timestamp data information module 3 and the block creation space data information module 4 respectively, and at the same time generate the workload difficulty target information module 8 and the random parameter value information module 9 for calculating the target of this block and write them into the corresponding position in this block;

[0112] Step 4, based on the block creation timestamp data information module 3 and the block creation space data information module 4, as well as the block version number information module 2, the previous block hash value information module 6, the Merkle trusted tree value information module 7, the block workload difficulty target information module 8, the random parameter value information module 9 for calculating the target, the number of transactions stored in the block information module 11, the transaction data information module 12, the block separator information module 13, and the number of bytes after the block separator information module 14, perform hash calculation and write into the enhanced block hash value information module 5 of this block.

[0113] See also Figure 5 As shown, in one embodiment of the present invention, taking Bitcoin block convergence authentication as an example, it is a flowchart of a spatiotemporal synchronization convergence authentication processing operation of a processing method based on spatial coordinates to introduce a decentralized blockchain data structure to avoid data forks.

[0114] When performing blockchain data time-space synchronization and convergence authentication:

[0115] Step A, in this block (block height is H), the block creation timestamp data information module 3 and the block creation space data information module 4 in the block, as well as the version number information module 2 of the block, the previous block hash value information module 6, the Merkle trusted tree value information module 7, the workload difficulty target information module 8 of the block, the random parameter value information module 9 for calculating the target, the transaction quantity information module 11 stored in the block, the transaction data information module 12, the block separator information module 13, and the number of bytes after the block separator information module 14 are security verified through the enhanced block hash value information module 5;

[0116] Step B, using the block creation timestamp data information module 3 to compare the packaged blocks A, B, and C of different nodes, and the packaged block with the smaller block creation timestamp data information module 3 is the final legal winning block;

[0117] Step C, if the timestamp data information modules 3 of blocks A and B are the same, the distance between the spatial data information module of the current block in A and B and the spatial data information module of the previous block (block height is H-1) is compared, that is, the difference in longitude and latitude of the physical world or the difference in IP address of the virtual world is calculated, and the packaged block with a longer distance is determined to be the final legal winning block;

[0118] Step D, create a new block (block height is H+1), write the block separator information module 13 and the version number information module 2; select the winning block according to the blockchain data time-space synchronization convergence authentication mechanism, hash all the data of the winning block and write it into the previous block hash value information module 6 in the new block.

[0119] The blockchain system and processing method thereof that implement decentralized blockchain data structure based on spatial coordinates to avoid data bifurcation according to the present invention are adopted. On the basis of the original decentralized blockchain system, the spatial coordinates and coordinate verification mechanism are added to realize the dual calibration function of the time and space information of the blockchain data. At the same time, on the basis of the general peer-to-peer network (point-to-point network) blockchain data, the spatial coordinates and the time and space coordinate verification mechanism are added to realize the dual calibration function of the time and space position information of the blockchain data, and then the blockchain data time and space synchronization convergence authentication mechanism can be further used to realize multi-party data convergence, solve the major security problem of decentralized blockchain data bifurcation, and the enhanced blockchain data system structure that introduces spatial coordinates is an extension of the original blockchain data system, has downward compatibility, is easy to smoothly transition and realize on the basis of the original chain, and has a wider range of applications.

[0120] In this specification, the present invention has been described with reference to a specific Bitcoin embodiment thereof. However, it is apparent that various modifications and variations may be made without departing from the spirit and scope of the present invention. Therefore, the specification and drawings should be regarded as illustrative rather than restrictive.

Claims

1. A blockchain system that implements a decentralized blockchain data structure based on spatial coordinates to avoid data bifurcation, characterized in that: The blockchain system includes: The block header (1), which includes: A block creation space data information module (4), used for storing block creation space data; An enhanced block hash value information module (5), used to record the enhanced block hash value; as well as Block body (10); The block creation spatial data information module (4) uses the longitude and latitude positions of the physical world as spatial data for calibration or uses the IP address of the virtual world as spatial data for calibration; The enhanced block hash value recorded in the enhanced block hash value information module (5) is obtained by hashing the version number information of the corresponding block, the block creation timestamp data, the previous block hash value, the Merkle trust tree value, the workload difficulty target information of the block, the random parameter value information used to calculate the target, the number of transactions stored in the block, the transaction data, the corresponding block separator information and the number of bytes after the block separator, and is used to verify the security of the data in the block.

2. The blockchain system for realizing a decentralized blockchain data structure based on spatial coordinates to avoid data bifurcation according to claim 1, characterized in that: The block header (1) further includes: A version number information module (2), used to record the version number of the corresponding block; A block creation timestamp data information module (3), used to record block creation timestamp data; The previous block hash value information module (6) is used to store the previous block hash value; Merkle trusted tree value information module (7), used to store Merkle trusted tree value; The block workload difficulty target information module (8) is used to record the workload difficulty target information of the block, and The random parameter value information module (9) for calculating the target is used to record the random parameter value for calculating the target.

3. The blockchain system according to claim 1 that realizes a decentralized blockchain data structure based on spatial coordinates to avoid data bifurcation, characterized in that: The block body (10) comprises: A block storage transaction quantity information module (11), used to record the transaction quantity stored in the block; and The transaction data information module (12) is used to record the transaction data of the block.

4. A method for implementing a decentralized blockchain data structure based on spatial coordinates to avoid data bifurcation using the blockchain system described in any one of claims 1 to 3, wherein the blockchain system comprises: Block header(1), which includes: Version number information module (2); block creation timestamp data information module (3); block creation space data information module (4); enhanced block hash value information module (5); previous block hash value information module (6); Merkle trusted tree value information module (7); block workload difficulty target information module (8); random parameter value information module for calculating the target (9); The block body (10) includes: Block storage transaction quantity information module (11); transaction data information module (12); and a block delimiter information module (13) and a byte number information module (14) after the block delimiter; The method comprises a block generation processing operation and a time-space synchronization convergence authentication processing operation, and the block generation processing operation comprises the following steps: Step 1: Create a new block and block header, write the block separator information module (13) and the version number information module (2); obtain the previous winning block through the spatiotemporal synchronization convergence authentication mechanism, calculate the hash value of all the data in the previous block and write it into the previous block hash value information module (6) in this block; Step 2: Obtain and record the transaction quantity information module (11), transaction data information module (12) and the formed block body (10) stored in this block, and on this basis calculate and write the Merkle trust tree value information module (7) and the byte number information module after the block separator (14) of this block; Step 3: Calculate the effective value according to the workload difficulty target information module (8) and the random parameter value information module (9) for calculating the target in the previous block, and at the same time obtain the current timestamp data value and space data value and write them into the block creation timestamp data information module (3) and the block creation space data information module (4) respectively, and at the same time generate the workload difficulty target information module (8) and the random parameter value information module (9) for calculating the target of this block and write them into the corresponding position in this block; Step 4: Perform hash calculation based on the block creation timestamp data information module (3) and the block creation space data information module (4), as well as the block version number information module (2), the previous block hash value information module (6), the Merkle trust tree value information module (7), the block workload difficulty target information module (8), the random parameter value information module for calculating the target (9), the transaction quantity information module (11) stored in the block, the transaction data information module (12), the block separator information module (13), and the number of bytes after the block separator information module (14), and write them into the enhanced block hash value information module (5) of the current block; The time-space synchronization convergence authentication processing operation is specifically as follows: The block creation timestamp data information module (3) is preferably used to compare the current block creation space data with the block creation space data of the previous block, and the smaller packaged block of the block creation timestamp data information module (3) is calculated as the final legal winning block of this time; If the block creation timestamp data information module (3) of the current block creation space data is the same as that of the block creation space data of the previous block, then by comparing the distance difference between the current block creation space data and the block creation space data of the previous block, it is confirmed that the packaged block with a longer distance is the final legal winning block this time, thereby avoiding subsequent data bifurcation.

5. The method for avoiding data bifurcation in a decentralized blockchain data structure based on spatial coordinates according to claim 4 is characterized in that: The distance difference is calculated by calculating the latitude and longitude difference of the physical world or the IP address difference of the virtual world between the current block creation space and the block creation space of the previous block.

6. The method for avoiding data bifurcation in a decentralized blockchain data structure based on spatial coordinates according to claim 4 is characterized in that: The time-space synchronization convergence authentication processing operation includes the following steps: Step a: in this block, the enhanced block hash value information module (5) is used to perform security verification on the block creation timestamp data information module (3) and the block creation space data information module (4) in the block, as well as the version number information module (2) of the block, the previous block hash value information module (6), the Merkle trusted tree value information module (7), the block workload difficulty target information module (8), the random parameter value information module for calculating the target (9), the transaction quantity information module (11) stored in the block, the transaction data information module (12), the block separator information module (13), and the number of bytes after the block separator information module (14); Step b: Use the block creation timestamp data information module (3) to compare the packaged blocks A, B, and C of different nodes. The packaged block with the smaller timestamp data is the final legal winning block. Step c: If the creation timestamp data of blocks A and B are the same, by comparing the distance between the creation space data information of the current block in A and B and the creation space data information of the previous block, that is, calculating the distance difference, it is determined that the packaged block with a longer distance is the final legal winning block of this time; Step d: Create a new block, write the block separator information module (13) and the version number information module (2); select the winning block according to the blockchain data spatiotemporal synchronization convergence authentication mechanism, perform hash calculation on all data of the winning block and record it in the previous block hash value information module (6) in the new block; Among them, the block height of the current block is H, the block height of the previous block is H-1, and the block height of the new block is H+1.

7. The method for avoiding data bifurcation in a decentralized blockchain data structure based on spatial coordinates according to claim 6 is characterized in that: The distance difference is calculated by calculating the latitude and longitude difference of the physical world or the IP address difference of the virtual world between the current block creation space and the block creation space of the previous block.