CN114281887B - Data storage method based on block distributed block chain and electronic equipment - Google Patents

Abstract

The invention relates to the technical field of block chains, in particular to a data storage method based on a block distributed block chain and electronic equipment. The method comprises the following steps: the method comprises the steps of packaging service data into candidate blocks, identifying the candidate blocks to obtain super blocks, writing a specified number of the super blocks into at least one remote node, enabling the super blocks with different block heights to form a block distributed block chain, and controlling each remote node to be deployed to an unappable area. On the other hand, since the superblocks can be stored in a distributed manner and superblocks with different block heights can form a block distributed block chain, the present embodiment can improve the utilization efficiency of the block chain and enable the block distributed block chain to have the characteristics of decentralization and non-falsification.

Description

Data storage method based on block distributed block chain and electronic equipment

Technical Field

The invention relates to the technical field of block chains, in particular to a data storage method based on a block distributed block chain and electronic equipment.

Background

The creation of blockchain technology gives humans the ability to create non-tamperable data records, however, current blockchain systems do not fully exploit this ability, as permanent storage and non-tamperability are relative.

The protection capability of the physical environment and the supporting facilities thereof, which are limited by the deployment of the nodes, has the hidden danger of being completely destroyed or being tampered by the overall intention of the current control group, and one reason is as follows: all nodes of the traditional block chain system are deployed on the earth and can be physically obtained and accessed, so that the nodes can be completely destroyed or the nodes can be subjected to whole-network consistency tampering by people after history.

Disclosure of Invention

An object of the embodiments of the present invention is to provide a data saving method and an electronic device based on a block distributed block chain, which can improve the security of data storage.

In a first aspect, an embodiment of the present invention provides a data saving method based on a block distributed block chain, including:

packing the service data into candidate blocks;

the candidate blocks are identified together to obtain a super block;

writing a specified number of super blocks into at least one long-range node, wherein the super blocks with different block heights can form a block distributed block chain;

and controlling each long-distance node to be deployed to an unappable area.

In a second aspect, an embodiment of the present invention provides a storage medium storing computer-executable instructions for causing an electronic device to execute the above-mentioned data saving method based on a block distributed block chain.

In a third aspect, the present invention provides a computer program product, where the computer program product includes a computer program stored on a non-volatile computer-readable storage medium, and the computer program includes program instructions, which, when executed by an electronic device, cause the electronic device to execute the above-mentioned data saving method based on a block distributed blockchain.

In a fourth aspect, an embodiment of the present invention provides an electronic device, including:

at least one processor; and the number of the first and second groups,

a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,

the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the above-described method of data retention based on a block distributed blockchain.

Compared with the prior art, the invention at least has the following beneficial effects: in the data storage method based on the block distributed block chain provided by the embodiment of the invention, firstly, service data are packed into candidate blocks, then the candidate blocks are identified to obtain super blocks, then, a specified number of super blocks are written into at least one remote node, the super blocks with different block heights can form the block distributed block chain, and finally, each remote node is controlled to be deployed to an unassappable area. On the other hand, since the superblocks can be stored in a distributed manner in the present embodiment, and superblocks with different block heights can form a block distributed block chain, the present embodiment can improve the utilization efficiency of the block chain, and can ensure that the block distributed block chain provided by the present embodiment has the characteristics of decentralization, transparency, and non-falsification on the premise of improving the flexibility of the storage blocks. On the other hand, even along with the increase of the service time of the blockchain, the embodiment can balance and coordinate the storage capacity of the accounting node, and avoid the situation that the accounting node is broken down or exits accounting due to the fact that the accounting node stores too many blockdata.

Drawings

One or more embodiments are illustrated by way of example in the accompanying drawings, which correspond to the figures in which like reference numerals refer to similar elements and which are not to scale unless otherwise specified.

Fig. 1 is a schematic view of an application scenario of a distributed blockchain system according to an embodiment of the present invention;

fig. 2 is a schematic flowchart of a data saving method based on a block distributed block chain according to an embodiment of the present invention;

fig. 3a to fig. 3e are schematic structural diagrams of a block distributed blockchain according to an embodiment of the present invention;

fig. 4a is a schematic view of an application scenario of another distributed blockchain system according to an embodiment of the present invention;

fig. 4b is a schematic diagram of an escape solar system with a long-range node according to an embodiment of the present invention, in which the size of each celestial body is appropriately scaled up and down to improve the visualization effect;

FIG. 4c is a schematic diagram of the coordinates of the sun in the galaxy system according to an embodiment of the present invention;

FIG. 4d is a schematic diagram of planning sector areas in the sparse area of the interplanetary substance in various directions according to the embodiment of the present invention;

fig. 4e is a schematic flow chart of the movement direction of each of the long-range nodes on the same side entering the distributed layout area after leaving the solar system according to the transmission sequence;

fig. 4f is a schematic layout diagram of transmitting a long-range node in a sector area according to a transmission sequence according to an embodiment of the present invention;

fig. 5a is a schematic flowchart of a node communication method of a block distributed blockchain according to an embodiment of the present invention;

fig. 5b is a flowchart illustrating a node communication method of a block distributed blockchain according to another embodiment of the present invention;

fig. 5c is a scene schematic diagram of the long-haul node returning the public key to the target node according to this embodiment;

FIG. 5d is a schematic flow chart of S53 shown in FIG. 5 b;

fig. 5e is a schematic flowchart of S533 shown in fig. 5 d;

FIG. 5f is another schematic flow chart of S53 shown in FIG. 5 b;

fig. 6a is a flowchart illustrating a block synchronization method based on a block distributed block chain according to an embodiment of the present invention;

FIG. 6b is a schematic flow chart of S63 shown in FIG. 6 a;

fig. 6c is a schematic structural diagram of a block synchronization system according to an embodiment of the present invention;

FIG. 6d is a schematic view of the process of S633 shown in FIG. 6 b;

fig. 6e is a schematic structural diagram of a block synchronization system according to another embodiment of the present invention;

fig. 6f is a flowchart illustrating a block synchronization method based on a block distributed block chain according to another embodiment of the present invention;

FIG. 6g is a schematic flow chart of S64 shown in FIG. 6 a;

FIG. 6h is another schematic flow chart of S64 shown in FIG. 6 a;

fig. 6i is a flowchart illustrating a block synchronization method based on a block distributed block chain according to still another embodiment of the present invention;

fig. 6j is a schematic structural diagram of node validity verification according to an embodiment of the present invention;

fig. 7 is a schematic circuit diagram of an electronic device according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

It should be noted that, if not conflicted, the various features of the embodiments of the invention may be combined with each other within the scope of protection of the invention. Additionally, while functional block divisions are performed in device schematics, with logical sequences shown in flowcharts, in some cases, steps shown or described may be performed in a different order than the block divisions in devices, or in flowcharts. The terms "first", "second", "third", and the like used in the present invention do not limit data and execution order, but distinguish the same items or similar items having substantially the same function and action.

Fig. 1 is a schematic view of an application scenario of a distributed blockchain system according to an embodiment of the present invention, as shown in fig. 1, a distributed blockchain system 100 includes a client 11 and a blockchain network 12, where the client 11 is in communication connection with the blockchain network 12, where the communication mode includes a wireless communication mode or a wired communication mode supporting any suitable communication protocol.

The clients 11 are used to communicate with the blockchain network 12 to complete relevant business logic, such as transactions, synchronizing data, retrieving query data, uploading data, and the like. In some embodiments, the client 11 comprises a smartphone, tablet, laptop or desktop computer, or the like.

The blockchain network 12 includes various nodes serving as various service roles in the blockchain system, as shown in fig. 1, the various nodes include a block node 121, a long-range node 122, and a common node 123, and the block node 121, the long-range node 122, and the common node 123 are connected to each other in a communication manner.

The out-block nodes 121 are configured to recognize the super-block commonly, and when the common recognition passes through the super-block, the super-block is written into the distant node 122, where the number of the out-block nodes 121 may be multiple, and the out-block nodes 121 may use any suitable common recognition algorithm to complete the common recognition of the super-block, such as a long-old community common recognition mechanism, a Proof of Work (PoW), a Proof of rights and interests (Proof of behaviour, POS), a Proof of shares authority (release Proof of behaviour, DPoS), a Practical Bypath Fault Tolerance (PBFT), a licensed bypath Fault Tolerance (DBFT), and the like.

The superblocks described herein may be blocks of any suitable data type, any suitable data size, and no undue restrictions are imposed on the data type and/or data size of the superblocks herein.

The remote node 122 is configured to store the super blocks passed by the block-out node 121 in a consensus, and generally, the super blocks stored locally by the remote node 122 have the highest authenticity because the remote node 122 is written into the super blocks earliest and is a node determined by the respective block-out nodes 121 in a consensus algorithm, where the number of the remote nodes 122 may be multiple.

The common node 123 is a node with an accounting function, and can initiate an accounting book transaction and record a block, and can also record a super block from other nodes synchronously to update a local accounting book.

It will be appreciated that in some embodiments, some nodes in the blockchain network 12 may concurrently assume multiple business roles, e.g., the out-of-blockchain node 121 may not only commonly identify superblocks, but may also have accounting or transaction functions, and therefore, in this context, no undue restrictions are made on the business logic that the blockchain node is capable of performing. In some embodiments, a tile link point may comprise a smartphone, tablet, laptop, desktop, or server, among others.

As an aspect of the embodiments of the present invention, an embodiment of the present invention provides a data saving method based on a block distributed block chain. Referring to fig. 2, the method for saving data based on the block distributed blockchain S200 includes: s21, packing the service data into candidate blocks;

in this embodiment, the service data may be data in any suitable service scenario, and the data content may be content in any form, for example, in the transaction scenario, the service data is transaction data of both parties, and the data content is content of a payer, a payee, a payment amount, and the like, or in order to prevent a certain technical data from being lost and unable to effectively restore a certain technology, in the important data storage scenario, the service data is important technical data of an industry, and the data content is technical content capable of restoring the industry or a certain technical segment. In this embodiment, the candidate block is a block to be identified.

In some embodiments, before packing the service data into the candidate block, it may be determined whether the service data meets a preset packing condition, if so, the service data is packed into the candidate block, if not, another group of service data is continuously obtained or the service data is waited to meet the preset packing condition. For another example, if the data amount of the current service data is smaller than the preset data threshold, the service data needs to be waited for to be equal to or larger than the preset data threshold, so that the service data can be packed into the candidate block.

S22, identifying the candidate blocks in a consensus mode to obtain a super block;

in this embodiment, any suitable consensus algorithm may be used to consensus the candidate blocks, which is similar to the above-mentioned consensus algorithms, and is not described herein again.

In this embodiment, the super block includes a block header and a block body, wherein, as mentioned above, the super block may be a block of any suitable data type and any suitable data size.

S23, writing a specified number of super blocks into at least one long-range node, wherein the super blocks with different block heights can form a block distributed block chain;

in this embodiment, the block chain network defines the number of super blocks written into the remote node by the block node as a designated number, and the block node writes the designated number of super blocks into the same remote node according to a predetermined rule, where the designated number may be one or more than two, and the block heights of the super blocks written into the same remote node may be different.

In this embodiment, in the blockchain network, the number of the distant nodes may be multiple, and super blocks with different block heights may be stored in different distant nodes or may be stored in the same distant node.

It can be understood that the number of the far-haul nodes written into the super block with the specified number can be one or more than two, when more than two far-haul nodes are written into the super block, the super block can be stored more safely, the risk that a certain far-haul node cannot normally provide the super block due to malicious attack is reduced, and the efficiency of synchronizing the super block can also be improved.

In this embodiment, superblocks stored by different remote nodes or superblocks of the same remote node are interlocked to form a block distributed block chain.

For example, referring to fig. 3a, the tele-node 1-1 writes a super block with a block height of 1, the tele-node 2-1 writes a super block with a block height of 2, the tele-node 3-1 writes a super block with a block height of 3, and so on, so that in fig. 3a, each tele-node writes one super block, and the super blocks of the respective tele-nodes form an interlocking relationship with each other, thereby forming a block distributed block chain.

For another example, referring to fig. 3b, the super-block with the block height of 1 is written into each of the tele-navigation node 1-1, the tele-navigation node 1-2, and the tele-navigation node 1-3, the super-block with the block height of 2 is written into each of the tele-navigation node 2-1, the tele-navigation node 2-2, and the tele-navigation node 2-3, and the super-block with the block height of 3 is written into each of the tele-navigation node 3-1, the tele-navigation node 3-2, and the tele-navigation node 3-3, and so on, therefore, in fig. 3b, the super-blocks with the same block height are written into a plurality of tele-navigation nodes, each of the tele-navigation nodes is written into a super-block, and the super-blocks of each of the tele-navigation nodes form an interlocking relationship with each other, thereby forming a block distributed block chain.

For example, referring to fig. 3c, the tele-node 1-1 writes super blocks with block heights of 1 and 2, the tele-node 2-1 writes super blocks with block heights of 3 and 4, the tele-node 3-1 writes super blocks with block heights of 5 and 6, and so on, so that in fig. 3b, each tele-node writes two super blocks with consecutive block heights, and the super blocks of each tele-node and the super blocks of the same tele-node form an interlocking relationship with each other, thereby forming a block-distributed block chain.

For example, referring to fig. 3d, a plurality of remote nodes 1-1 write super blocks with block heights of 1 and 2, a plurality of remote nodes 2-1 write super blocks with block heights of 3 and 4, a plurality of remote nodes 3-1 write super blocks with block heights of 5 and 6, and so on, so in fig. 3d, a plurality of remote nodes write two super blocks with continuous block heights, and the super blocks of each remote node and the super blocks of the same remote node form an interlocking relationship with each other, thereby forming a block distributed block chain.

It is understood that there may be more superblocks written to the distant nodes, and that multiple distant nodes 1-1 write superblocks with block heights of 1,2 and 3, respectively.

It is further understood that the block heights of the super blocks written into the same remote navigation node may be continuous or discontinuous, the block chain network may self-agree on block writing rules, and each of the block output nodes may complete the super block writing according to the block writing rules. As shown in fig. 3e, a plurality of tele-nodes 1-1 write super blocks with block heights of 1 and 3, a plurality of tele-nodes 2-1 write super blocks with block heights of 2 and 4, a plurality of tele-nodes 3-1 write super blocks with block heights of 5 and 7, and so on, so in fig. 3e, a plurality of tele-nodes write two super blocks with discontinuous block heights, and the super blocks of each tele-node and the super blocks of the same tele-node form an interlocking relationship with each other, thereby forming a block distributed block chain.

And S24, controlling each long-distance node to be deployed to the non-attack area.

In the present embodiment, the non-attack area is an area that physically requires a great effort or a sacrifice to capture the distant node, and for example, the non-attack area includes space, the ground, a deep hole, the sea bottom, or the like with respect to the earth.

In general, on one hand, by deploying each remote node in an inaudible area, the superblock of each remote node is prevented from being physically easily obtained and destroyed or tampered. On the other hand, since the superblocks can be stored in a distributed manner in the present embodiment, and superblocks with different block heights can form a block distributed block chain, the present embodiment can improve the utilization efficiency of the block chain, and can ensure that the block distributed block chain provided by the present embodiment has the characteristics of decentralization, transparency, and non-falsification on the premise of improving the flexibility of the storage blocks. On the other hand, even along with the increase of the use time of the blockchain, the embodiment can balance and coordinate the storage capacity of the accounting node, avoid the situation that the accounting node stores too many blockdata to cause breakdown or quit accounting, and also can ensure that the stored historical data and the stored historical data can exist and continue permanently.

In some embodiments, the non-attack area includes space, and the present embodiment may transmit each long-range node to space by controlling the deployment of each long-range node to the non-attack area, so that each long-range node continuously moves away from the transmission place.

For example, when the distant navigation node is deployed in space, in order to adapt to the change of the scene, the embodiment of the present invention provides another structural diagram of a block distributed block chain, as shown in fig. 4a, taking the earth as an example, the block distributed block chain 400 includes a ground node 41, a docking station node 42 and a distant navigation node 43, and the concepts of "day" and "ground" referred to herein are relative to the earth, but do not prevent the extension to other celestial bodies in other occasions.

The ground node 41 is a node deployed on the earth and is responsible for tracking of the business's organization uplink, station-parking node 42 and long-range node 43, data inspection of the space-based data, and operation management of the blockchain. The ground-based node 41 is divided into a ground-based operation node and a ground-to-earth synchronization node. The ground-based operation node is responsible for the operation of the ground-based data organization system, and the geosynchronous node is responsible for the communication and operation with the station parking node 42 and the long-range node 43. Communication between the ground nodes 41 is performed through a ground network, and the communication mode includes P2P network communication.

It will be appreciated that the role of the ground based node 41 may include out-of-block and/or ordinary nodes that are compatible with the role functionality of the out-of-block and/or ordinary nodes.

With the earth as the center, a celestial body with proper space safety is designated as a posthouse (station), and a space-based node moves to the vicinity of the posthouse to be stopped and become a satellite or land, and the node is a docking node 42. The station node 42 is responsible for the construction of a replica of an off-site base and provides a relay for the long-range node 43.

The node which takes the earth as the center and continuously performs centrifugal motion outwards is a long-range node 43, and the track of the long-range node 43 can be determined according to the carried task. The long-range node 43 continuously navigates and continuously moves away from the earth, and is not bound near any celestial body. The possibility that the long-range nodes 43 are completely destroyed or intensively tampered is extremely low due to dispersion and no capture by any celestial body, and the optimal data viability is guaranteed.

Referring to fig. 4b, fig. 4b shows a solar system, the solar system 40 includes various celestial bodies centered on the sun 44, wherein the distant node 43 takes the earth 45 as a transmitting ground, and after the transmission, the distant node 43 starts to move away from the earth 45 continuously, and finally the distant node 43 can escape the solar system, so that the distant node 43 carries a super block to escape the solar system 40, and the super block is difficult to capture, thereby physically isolating the possibility of tampering.

When the distant nodes 43 fly off the earth into space, a reference coordinate system is needed to describe and calculate the relationship between the distant nodes 43, and the reference coordinate system can be an earth equatorial plane, a solar ecliptic plane (an orbital plane of the earth revolving around the sun), a silver disc plane, a lunar super-star system plane or a laniake super-star system plane.

In some embodiments, the plane of the silver disk in the galaxy system is used as the reference coordinate system, referring to fig. 4c, the plane of the silver disk is a plane including the radial X-axis of the silver disk, and the normal direction of the plane of the silver disk is the Y-axis. When each far-range node is launched to the space, the present embodiment can control each far-range node to move towards the interstellar material sparse area, wherein the interstellar material sparse area is an outer space area pointed by the normal direction of the silver disc plane. In general, the galaxy is relatively concentrated in the interplanetary region of the two arms.

In this embodiment, the interstellar material sparse area is an area where interstellar materials are relatively rare, and the long-range node is sent towards the interstellar material sparse area, so that the interaction or collision between the long-range node and space materials such as stars and cosmic dust can be avoided, and the survival time of the long-range node in space is prolonged.

In some embodiments, when each of the tele-navigation nodes is controlled to move towards the interstellar material sparse area, the embodiment may control each of the tele-navigation nodes to move towards the interstellar material sparse area according to a dispersion layout rule, so that the movement directions of each of the tele-navigation nodes are different from each other, and therefore, the method may reduce the probability of collision among the tele-navigation nodes, and improve the survival time of the tele-navigation nodes.

In some embodiments, the interstellar material sparse regions include a positive interstellar material sparse region with the silver disk positively directed and a negative interstellar material sparse region with the silver disk negatively directed, the silver disk positive normal being the silver river spiral arm right hand spiral thumb direction. With continued reference to FIG. 4c, the silver disk positive direction Y + points to the positive interplanetary material sparse region and the silver disk negative direction Y-points to the negative interplanetary material sparse region.

In some embodiments, when each of the tele-navigation nodes is controlled to move towards the interstellar material sparse region according to the distributed layout rule, in this embodiment, one of every two tele-navigation nodes adjacent to each other in the emission time may be classified into a first emission group, the other tele-navigation node may be classified into a second emission group, the emission direction of the first emission group is the positive interstellar material sparse region, the emission direction of the second emission group is the negative interstellar material sparse region, and according to the distributed layout rule, the tele-navigation nodes in each emission group are controlled to move towards the corresponding interstellar material sparse regions according to the emission time, so that the movement directions of the tele-navigation nodes on the same side are different.

For example, the far-ranging node Z1 is adjacent to the transmission time of the far-ranging node Z2, the far-ranging node Z3 is adjacent to the transmission time of the far-ranging node Z4, the far-ranging node Z5 is adjacent to the transmission time of the far-ranging node Z6, and the far-ranging node Z7 is adjacent to the transmission time of the far-ranging node Z8, so that the embodiment can classify the far-ranging node Z1, the far-ranging node Z3, the far-ranging node Z5, and the far-ranging node Z7 into a first transmission group, and classify the far-ranging node Z2, the far-ranging node Z4, the far-ranging node Z6, and the far-ranging node Z8 into a second transmission group. Subsequently, when the long-range nodes are transmitted, the embodiment sequentially controls the long-range node Z1, the long-range node Z3, the long-range node Z5 and the long-range node Z7 to move towards the forward interstellar substance sparse area according to the transmission time of each long-range node, and also controls the moving directions of the long-range node Z1, the long-range node Z3, the long-range node Z5 and the long-range node Z7 in the forward interstellar substance sparse area to be different.

Similarly, in the embodiment, according to the emission time of each long-range node, the long-range node Z2, the long-range node Z4, the long-range node Z6, and the long-range node Z8 are sequentially controlled to move towards the negative interstellar material sparse area, and the moving directions of the long-range node Z2, the long-range node Z4, the long-range node Z6, and the long-range node Z8 in the negative interstellar material sparse area are also controlled to be different.

Therefore, the method can reduce the collision probability among the remote nodes on the premise of increasing the transmitting number of the remote nodes.

In some embodiments, each of the sparse regions of interplanetary material includes a dispersion layout region, which is a sector region formed by radially deflecting the silver disk at the position of the sun by a preset angle from the normal direction of the silver disk to a designated silver disk, wherein the designated silver disk is customized by a user in a radial direction, for example, the designated silver disk is in a radial direction away from the center of the galaxy system.

Referring to fig. 4d, in the forward interplanetary sparse area, the normal 4d2 of the silver disk at the position of the sun 4d1 is deflected 15 degrees toward the radial 4d3 of the designated silver disk to form a sector area 4d 4. Similarly, in a negative interplanetary sparsity region, it may also form a sector.

In some embodiments, the present embodiment controls the long-range nodes in each emission group to move into the distributed layout area after leaving the solar system according to the distributed layout rule, so that the movement direction of each long-range node is different.

For example, as described above, the embodiment can control the long range node Z1, the long range node Z3, the long range node Z5, and the long range node Z7 in the first transmission group to move into the distributed layout area after sequentially leaving the solar system, and the moving direction of each long range node in the distributed layout area is different.

In some embodiments, according to the scattering layout rule, when the long-range nodes in each emission group move into the scattering layout area after leaving the solar system, the movement direction of each long-range node on the same side entering the scattering layout area after leaving the solar system can be determined according to the emission sequence, and the included angle between the movement direction and the normal direction of the silver disc meets the bisection series condition. And then controlling each long-range node to be transmitted into the scattered layout area according to the movement direction.

In some embodiments, the emission sequence is {1,2,3 … … M }, i ∈ M, i and M are positive integers, and referring to fig. 4e, determining, according to the emission sequence, a moving direction of each of the navigable nodes on the same side entering the decentralized layout area after leaving the solar system includes:

s401, assigning i to 1;

s402, judging whether i is larger than M, if so, executing S403, and if not, executing S404;

s403, stopping operation;

s404, judging whether i is equal to 1, if so, executing S405, and if not, executing S406;

s405, taking the sun as an angular point, making a first straight line parallel to the normal direction of the silver disc through the angular point, controlling the first long-range node to leave the solar system, then entering a scattered layout area towards the direction of the first straight line, assigning i to be i +1, and returning to S402;

s406, judging whether i is equal to 2, if so, executing S407, and if not, executing S408;

s407, making a second straight line intersecting the silver disc at a preset angle in the normal direction by passing through the corner point, controlling a second long-range node to leave the solar system, entering a scattered layout area towards the direction of the second straight line, optionally selecting one point in the first straight line as a first end point, making the first end point as a straight line parallel to the radial direction of the silver disc to intersect with the second straight line, making the intersection point be a second end point, making the first end point and the second end point be vector line segments, assigning i to i +1, and returning to S402;

s408, judging whether the longest sub-line segment is equal to the shortest sub-line segment in the vector line segments, if so, executing S49, and if not, executing S410;

s409, selecting a bisection midpoint in the sub-line segment closest to the first end point, controlling the ith long-range node to leave the solar system, then entering a scattered layout region towards the direction of an ith straight line formed by the bisection midpoint and the angular point, assigning i to i +1, and returning to S402;

and S410, selecting a bisection midpoint from the longest sub-line segment closest to the first end point, controlling the ith long-range node to leave the solar system, entering a scattered layout region towards the direction of an ith straight line formed by the bisection midpoint and the angular point, assigning i to i +1, and returning to S402.

In this embodiment, the bisecting midpoint is used to bisect each sub-line segment in half.

In the present embodiment, for example, referring to fig. 4f, it is assumed that the transmission sequence of the first transmission set is {1,2,3 … … 9}, i.e., M is 9.

When the first long-range node is launched, because i is 1 and i is less than M, the sun is the corner point R0, the corner point R0 is crossed to form a first straight line L1 which is parallel to the normal direction of the silver disc, and the first long-range node is controlled to leave the solar system and then enter the scattered layout area towards the direction of the first straight line L1.

When the second long-range node is launched, because i is 2, i is less than M, the passing corner point R0 makes a second straight line L2 which intersects with the normal direction of the silver disc by 15 degrees, after the second long-range node leaves the solar system, the second long-range node is controlled to enter a scattered layout area towards the direction of the second straight line L2, one optional point in the first straight line L1 is taken as a first end point R1, the first end point R1 makes a straight line which is parallel to the radial direction of the silver disc and intersects with the second straight line L2, the intersection point is taken as a second end point R2, the vector line segment R1R2 is formed from the first end point R1 to the second end point R2, and the value is 3+ 2.

When the third long-range node is launched, since i is 3 and i < M, it is determined whether the longest sub-line segment and the shortest sub-line segment are equal in the vector line segments, and since the longest sub-line segment and the shortest sub-line segment are both the vector line segments R1R2, that is, the longest sub-line segment and the shortest sub-line segment are equal, a bisecting midpoint R3 is selected from the sub-line segments closest to the first endpoint R1 (that is, the vector line segments R1R2), and after the third long-range node is controlled to leave the solar system, the third long-range node enters a distributed layout region in a direction of a third straight line L3 formed by the bisecting midpoint R3 and the corner R0, and is assigned with a value of 4+ 3.

When the fourth long-range node is launched, since i is 4 and i is less than M, it is determined whether the longest sub-line segment is equal to the shortest sub-line segment in the vector line segments, and since the longest sub-line segment is equal to the shortest sub-line segment, a bisecting midpoint R4 is selected from the sub-line segments (i.e., line segments R1R3) closest to the first endpoint R1, and after the fourth long-range node is controlled to leave the solar system, the fourth long-range node enters a distributed layout region in the direction of a fourth straight line L4 formed by the bisecting midpoint R4 and the corner R0, and the value is assigned to 5 as 4+ 1.

When the fifth long-range node is launched, since i is 5 and i < M, it is determined whether the longest sub-line segment is equal to the shortest sub-line segment in the vector line segments, and since the longest sub-line segment (i.e., the line segment R2R3) is not equal to the shortest sub-line segment, i.e., the line segment R1R4 or R3R3), a bisecting midpoint R5 is selected from the longest sub-line segment (i.e., the line segment R2R3) closest to the first endpoint R1, and after the fifth long-range node is controlled to leave the solar system, the fifth long-range node enters a distributed layout region toward a fifth straight line L5 formed by the bisecting midpoint R5 and the corner R0, and the value is 6 + 1. And by analogy, gradually transmitting the 9 long-range nodes to the scattered layout area. Therefore, by adopting the method, the probability of collision between the distant nodes can be reduced, and the survival time of the distant nodes can be prolonged.

It can be understood that what technical means is adopted to transmit the long-range node to the space and what technical means is adopted to control the moving direction of the long-range node in the space, and the applicant thinks that: on 5.9.1977, NASA (national aerospace agency) launched traveler number 1 (equivalent to a distant node). On day 25/8/2012, traveler # 1 strays out of the solar system into interstellar space, indicating that the person has the ability to walk out of the solar system. In 2017, 12 and 2, the traveler successfully ignites the number 1 again, which shows that the human has the ability to communicate and command across the interstellar space. In 2020, NASA new generation Mars probe vehicle ' resolute ' number takes on ' Optimus prime ' number carrier rocket ' number to lift off, marking human entering into the Mars registration era.

In CLEP (Chinese lunar exploration project), Chang' e No. 1 was completed at 11 and 7 months in 2007. In 2013, 12 and 14 days, and No. 3 Chang' e succeeds in falling to the moon and emits a rabbit-shaped lunar rover. And 6, 2018, 5, month and 21, respectively, and the method comprises the following steps of (1) enabling a stretchpad bridge relay satellite to enter an orbit (a relay node around a ground mooring station). In 2018, the success of the high-latitude moon-falling south pole moon with the number of Chang-E4 in 12 and 8 months indicates that the human enters the era of omnibearing docking of moon (moon-based docking station node).

Thus, the applicant believes that: the above related art progress shows that human science and technology is sufficient to support the solution provided by the embodiment of the present invention at present or in the near future, and the core idea of the present invention is that: the distributed block chain of blocks is used for storing data dispersedly, and a carrier for protecting the data is deployed in the non-attack area, and how to adopt any technical means to control the movement of the long-range node is not the focus of the text.

The existing block chain depends on the timed block output of the accounting content, so that the block is idle and full, and the operation benefit is poor.

In some embodiments, after each of the remote nodes stores a specified number of super blocks, the super blocks are configured in a closed mode in which reception of other blocks is disabled, and the super blocks are in a read-only mode.

The closed mode is a mode that the far-haul node enters a mode of forbidding receiving writing of other blocks after writing a specified number of super blocks, and the read-only mode is a mode that data of the super blocks can only be read but modification, deletion or updating is forbidden.

In some embodiments, after entering the closed mode, each remote node may, although it is prohibited to write other blocks, receive the writing of auxiliary data other than blocks, for example, the auxiliary data includes address information of other remote nodes and the block height at which the super block is stored.

Therefore, as the far-haul node enters the closed mode, the super blocks can be prevented from being added or deleted due to malicious attack, and the order, the safety and the stability of the block distributed block chain can be maintained. And moreover, the super block enters a read-only mode after being written into the long-range node, so that malicious nodes are prevented from tampering or deleting the super block, and the data stability and the data security of the super block are maintained.

In some embodiments, the number of superblocks with 1 assigned and different block heights are distributed at different nodes to form a block-distributed block chain, i.e. the block chain structure is as shown in fig. 3a, and this block chain structure can improve the real-time performance of uplink on the block, which is beneficial to enhance the security and transparency of the block chain.

For more secure and reliable shaping of the block distributed block chain, please refer to table 1 in some embodiments:

TABLE 1

As shown in table 1, the super block includes a block body including service data and a parent node list, the block header includes a block height, a parent block hash and a block body hash, and the parent node list includes node information of each parent tele-transit node at the same block height.

In this embodiment, the parent node list is a list including node information of each parent tele-navigation node at the same block height, where the block height is an arrangement height of the current super block in the block-distributed block chain, the parent block hash is a hash of a block arranged in the block-distributed block chain and in front of the current super block, and the block hash is used to anchor each data in the block, and in some embodiments, the block hash may be a hash of all data in the block, and may also include the service data hash and the parent node list hash, please refer to table 2:

TABLE 2

As shown in table 2, the service data hash is a hash of the service data in the zone block, and the parent node list hash is a hash of the parent node list in the zone block. Since the block hash is divided into the service data hash and the parent node list hash, when the super block is verified subsequently, the method can be beneficial to other nodes to reliably and safely verify the validity of the super block in a multi-dimensional manner.

As shown in table 1 or table 2, the parent distant node is a distant node where the parent superblock of the current superblock is located, for example, please refer to fig. 3b, the second superblock with block height of 1 is the parent of the first superblock with block height of 2, that is, the second superblock and the first superblock are in a parent-child relationship, so that the distant node 1-1 is the parent distant node of the distant node 2-1.

In some embodiments, since the parent node list includes node information of each parent tele-navigation node at the same block height, when the validity of the current super block is verified at a later stage, the block link point may extract node information of each parent tele-navigation node in the parent node list from the current super block, obtain the parent super block according to the node information of the parent tele-navigation node, calculate a parent block hash of the parent super block, compare the parent block hash with the parent block hash of the current super block, if the parent block hash is consistent with the parent block hash of the current super block, the current super block is legal at the point, and if the parent block hash is inconsistent with the parent block hash, the current super block is illegal. Therefore, by adopting the method, the block distributed block chain can be shaped more safely and reliably.

In some embodiments, the node information of each of the far-voyage nodes includes a node hash and/or a node public key, the node hash of the far-voyage node is used to identify the far-voyage node, the node hash may be a hash of a device serial number of the far-voyage node, and may also be calculated by a character or a character string representing the device information of the far-voyage node according to a hash algorithm, and may further be a hash representing an address of the far-voyage node, and in a later stage, other block link nodes may access the far-voyage node according to the node information of the far-voyage node. The node public key is used for assisting in verifying the validity of the related services participated in by the remote node, wherein the node public key of the remote node can be broadcasted in the block chain network, and the node public key of the remote node can be obtained by the related block chain nodes.

In some embodiments, the block header of the superblock includes a node signature of the out-of-block node, and subsequent related nodes may verify the validity of the superblock based on the node signature of the out-of-block node.

Typically, the data in the blocks of an existing blockchain is consistent, e.g., in an existing blockchain, both block chain node a1 and block link point a2 hold the same block book, which includes block S with a block height of 100, wherein, the block S with block height 100 at block link point a1 and the block S with block height 100 at block link point a2 are the same, i.e. the data of both blocks are identical, however, because superblocks of the block distributed block chain are stored in different remote nodes in a scattered manner, the remote nodes do not store all blocks on the block chain as in the existing block chain, the block structure cannot effectively reflect the relationship between the current block and a local node or a father node in the block distributed block chain, and the superblocks are easily attacked by subsequent blocks or malicious nodes which cannot be verified with high efficiency.

Thus, in some embodiments, the superblock block further includes a data variable region, the data in the data variable region may not be consistent in each superblock at the same block height, and the data in the data variable region may be variable before the superblock is linked and may not be variable after the superblock is linked, for example, superblock B1 is written to the distant node C1, which includes data variable region D1. Superblock B2 writes to distant node C2, which includes data variable region D2.

Superblock B3 writes to distant node C3, which includes data variable region D3. The superblocks B1, B2 and B3 all have a block height of 150, and the data in the data variable region D1 and D2 are consistent, and the data in the data variable region D1 and D3 are inconsistent.

Before superblock B1 writes to televoyage node C1, i.e., superblock B1 before it is linked to the block-distributed block chain, the data in data variable region D1 may be modified, updated or deleted, and after writing to televoyage node C1, i.e., superblock B1 is linked to the block-distributed block chain, at which time the data in data variable region D1 is immutable, e.g., superblock B1 is configured to enter a read-only mode. For superblocks B2 and B3, the data change of the data variable region can be deduced according to the reasoning described above, and will not be described herein.

Therefore, the super block is additionally provided with the data variable area, so that the forming relationship of the super block in the block distributed block chain can be more flexibly and comprehensively described, and the use efficiency, the operation efficiency and the safety of the block distributed block chain are improved.

It will be appreciated that the content representation of the data variable regions in each superblock can be logically derived and self-determined by those skilled in the art in light of the disclosure herein.

In some embodiments, the data variable region includes local feature data associated with the local node, the local feature data being used to represent features of the local superblock and/or the local node, wherein the local node may be not only a local long-haul node, but also any role node that maintains the superblock, for example, in a normal node-maintaining superblock, the data variable region includes the local feature data.

In some embodiments, please refer to table 3:

TABLE 3

In table 3, the chunk hash is a hash of the service data, a hash of the parent node list, or a hash calculated by the service data and the parent node list together.

As shown in table 3, the local feature data includes a local node field for indicating local node information for storing the superblock and/or a local block source field for indicating source node information for the superblock.

For example, superblock E1 is stored in regular node F1, and its local node field is used to indicate node information of regular node F1. Superblock E2 is stored at distant node F2, then its local node field is used to represent node information for distant node F2.

Assuming that the regular node F1 synchronizes the superblock E2 from the distant node F2, thereby obtaining the local superblock E1, since the superblock E1 is originated from the superblock E2, the distant node F2 is the source node of the regular node F1, and therefore, the local block source field is used to indicate the node information of the distant node F2.

Further assuming that the superblock E3 is stored in the regular node F3, wherein the regular node F3 synchronizes the superblock E1 from the regular node F1, thereby obtaining the local superblock E3, since the superblock E3 is originated from the superblock E1, the regular node F1 is the source node of the regular node F3, and thus, the local block source field is used to indicate the node information of the regular node F1. It will be appreciated that when the local node is a tele-node, the local block source field is an empty field.

Therefore, by adopting the method, when the number of synchronization times of a certain super block is more, each super block can also form a certain degree of interlocking relation based on the local characteristic data, if the data of the local super block is maliciously modified by a certain block chain node, the next block chain node of the super block is synchronized, except for the verification according to the method provided above, the super block can also be verified through the local characteristic data, if the super block is verified to be illegal, the related block chain node having inheritance relation with the super block can be easily locked through the local characteristic data, the investigation is carried out from the related block chain node, and the investigation result is broadcasted in the block chain network, so that the corresponding block chain node can execute corresponding safe operation, and the block distributed block chain can be effectively and safely maintained and operated.

In some embodiments, the local node field comprises a local node hash and/or a local block priority and/or a local node public key and/or a local signature field of the local node.

The local node hash includes a hash of the device information and/or the node address of the local node.

The local block priority is used to indicate the priority of each super block with the same block height stored by the corresponding node, wherein the local block priorities of different super blocks with the same block height at different nodes may be the same or different.

For example, superblock G1 is stored in far node H1, superblock G2 is stored in regular node H2, superblock G3 is stored in regular node H3, superblock G4 is stored in regular node H4, wherein superblock G2 and superblock G3 are obtained by regular node H3 and regular node H3 respectively in synchronism with superblock G3 of far node H3, superblock G3 is obtained by regular node H3 in synchronism with superblock G3 of regular node H3, so that, although superblock G3, and G3 have the same block height, superblock G3 has a local block priority higher than superblock G3 and G3, superblock G3 has a local block priority equal to that of superblock G3, super block G3 has a local block priority lower than super block G3, and requires synchronization with super node H3, the super-block G1 of the tele-node H1 may be synchronized preferentially.

The local node public key is used for assisting in verifying the validity of a related service participated by the local node, wherein the node public key of the local node can be broadcasted in the block chain network, and the node public key of the local node can be obtained by the related block chain node.

The local signature field is the signature of the local node on the data in the data variable area except the local signature field, and other subsequent block chain nodes can verify whether the data in the data variable area is tampered or not through the local signature field, so that the method is favorable for efficiently and safely checking the data in the data variable area on the premise that the data variable area is added to the super block.

In some embodiments, the local superblock origin field includes an inheritance field for indicating node information of an inheritance node corresponding to the superblock to be inherited and/or a root origin field for indicating node information of a root origin node corresponding to the local superblock, the root origin node being the node that retroactively stores the local superblock earliest.

For example, as described above, for superblock G2 or superblock G3, superblock G1 is the superblock that is inherited, and thus, far haul node H1 is the successor node to normal node H2 and normal node H3. Similarly, for superblock G4, superblock G3 is the inherited superblock, so ordinary node H3 is the successor node of ordinary node H4, and therefore, in superblock G4 of ordinary node H4, the node information written in its successor field is the node information of ordinary node H3.

For another example, assume that the regular node H5 synchronizes the superblock G1 of the far node H1, resulting in superblock G5. The ordinary node H6 synchronizes the superblock G4 of the ordinary node H4 to obtain a superblock G6, the ordinary node H7 synchronizes the superblock G6 of the ordinary node H6 to obtain a superblock G7, and the ordinary node H8 synchronizes the superblock G7 of the ordinary node H7 to obtain a superblock G8. For the normal node H8, the superblock G8 is a local superblock, the synchronization path of the superblock G8 is G8-G7-G6-G4-G3-G1, and the superblock G1 is stored in the distant node H1, so that the node that stores the superblock G8 retrospectively is the distant node H1, that is, the distant node H1 is the root node, and therefore, in the superblock G8 of the normal node H8, the node information written in the root field is the node information of the distant node H1.

Assuming that the normal node H4 storing the superblock G4 disappears in the blockchain network, for example, the normal node H4 is crashed off-line by malicious attack or lost by physical destruction, and therefore, the superblock G4 also disappears following the disappearance of the normal node H4, for the superblock G8, when the normal node H8 traces back to the superblock G6 of the normal node H6, the origin of the superblock G8 cannot be traced back, and therefore, the normal node H8 can trace back to the node storing the superblock G8 as the earliest as the normal node H6, that is, the normal node H6 is the root node, and therefore, in the superblock G8 of the normal node H8, the node information written in the root field is the node information of the normal node H6.

Therefore, by adding the inheritance field and/or the root field, the synchronization path of the corresponding superblock can be simply, reliably, comprehensively and safely restored under the block distributed storage form, and the block distributed block chain can be more effectively and safely maintained.

In some embodiments, the node information of the inheritance node comprises the inheritance node hash and/or the inheritance node priority and/or the inheritance node public key and/or the local signature field of the inheritance node, and the local signature field of the inheritance node is a signature of the local node on data in the data variable region except the local signature field of the inheritance node. And/or the node information of the root node comprises the hash of the root node and/or the priority of the root node and/or the public key of the root node and/or the local signature field of the root node, and the local signature field of the root node is the signature of the local node on the data except the local signature field of the root node in the data variable region.

In the existing blockchain system, each blockchain node is deployed on the earth, and each blockchain node communicates in a Peer-to-Peer (P2P) communication mode based on a high-bandwidth and low-latency communication network. However, when communication is performed in an interplanetary environment, electronic devices are affected by actual environments with low bandwidth, ultra-long delay and poor directionality, and if communication is performed in a P2P communication mode, the communication efficiency and reliability between the electronic devices are extremely low.

Therefore, in addition to the related embodiments of the data saving method based on the block distributed blockchain, how to perform the communication method between the nodes in the block distributed blockchain system is also provided. Referring to fig. 5a, a node communication method S500 of a block distributed blockchain includes:

s51, controlling the long-distance node to be deployed in the non-attack area;

s52, responding to a call instruction sent by the target node according to the central/peripheral communication mode;

and S53, executing the call instruction.

In this embodiment, a common node and a block-out node deployed on the earth are a Hub, a long-range node is a tip, and in a Hub/tip communication mode (Hub/End communication mode), the Hub is an active side and the tip is a passive side. Under normal conditions, the tips do not communicate with each other and do not actively send information. The central hub sends an instruction to the peripheral, the peripheral executes the instruction and returns or does not return information, and the returned information is the receipt or confirmation of the execution of the instruction.

In this embodiment, the target node is any node in the blockchain network, such as a normal node or a block-out node.

In this embodiment, the call command may be a command for any service logic operation, such as transmitting superblock data or other auxiliary data.

In this embodiment, when the target node sends the call instruction to the distant node, the target node and the distant node do not require connection guarantee according to the space-based communication protocol.

Generally, when communication is performed in a non-attack area such as space, the hub/tip communication mode is more suitable for such a scenario, which can relatively guarantee communication efficiency, quality and reliability.

In some embodiments, referring to fig. 5b, the method S500 for node communication of the block distributed blockchain further includes:

s54, when detecting that the long-range node reaches the preset position of the non-attack area, generating a key pair, wherein the key pair comprises a private key and a public key;

and S55, controlling the long-distance node to send the public key to the target node.

In this embodiment, because the private key and the public key of the long-range node are easily maliciously attacked or physically easily captured when being generated in the earth and other places of emission, the key pair is generated by controlling the long-range node to reach the preset position of the non-attacking area, the difficulty of the leaked key pair of the long-range node is increased in the physical distance, so that the information safety in the later period is ensured, and the situation that the information is maliciously intercepted because the key pair is leaked is avoided.

In some embodiments, the predetermined location of the non-aggressable area is a hollow sphere area with a 3 minute path to a1 hour path from the launch site, for example, referring to fig. 5c, the far-range node 51 launches from the earth 52, and after the far-range node 51 crosses the mars orbit of mars 53, the far-range node 51 generates a key pair and returns the public key of the key pair to the target node 54.

In some embodiments, the call command includes an encrypted name and encrypted data, and referring to fig. 5d, S53 includes:

s531, decrypting the encrypted name by using the public key;

s532, judging whether the decrypted encrypted name is the name of the node;

s533, if yes, encrypting data;

s534, if not, discarding the call instruction.

In this embodiment, the ground node uses a name calling method, does not address through IP, directly calls a node name, encrypts the node name i by using the node public key p to obtain an encrypted name K, and sends the encrypted name to the long-range node. And the remote navigation node receives the information and decrypts the encrypted name K by using the public key p, if the decrypted encrypted name i is the name of the node, namely the foundation node calls the remote navigation node, the remote navigation node executes encrypted data, and if not, the calling instruction is discarded. By adopting the method, the long-range node can be reliably called, and the communication quality and efficiency can be ensured on the premise of the ultra-long physical distance.

In some embodiments, the encrypted data includes an encryption key and an encrypted text, please refer to fig. 5e, S533 includes:

s5331, decrypting the encrypted key by using the public key to obtain a symmetric key;

s5332, decrypting the encrypted text by using the symmetric key to obtain original data;

s5333, executing the original data.

In this embodiment, when the ground node sends a call instruction, a one-time-use symmetric key a is first generated according to a symmetric encryption algorithm, then a public key p is encrypted by using the symmetric key a to obtain an encryption key a, and the original data is encrypted by using the symmetric key a to obtain an encrypted text D. When the long-range node decrypts the encryption key, the public key p is used for decrypting the encryption key to obtain a symmetric key a, the symmetric key a is used for decrypting the encrypted text D to obtain original data, and finally the long-range node can execute the original data, wherein the original data comprises instructions, instruction parameters, sensitive data and the like. After the original data is executed, if the result needs to be returned, the long-range node signs the content of the result by using a private key, encrypts the content by using a symmetric key a and sends the encrypted content back to the ground node. And after receiving the message, the ground node decrypts the message by using the symmetric key a, knows the execution condition, verifies the signature, confirms that the message is sent by the correct long-range node, and completes the operation. By adopting the method, the symmetric encryption algorithm and the asymmetric encryption algorithm are combined, on one hand, the processing efficiency of the encrypted data can be ensured, and on the other hand, the security and the reliability of encryption can be ensured.

It will be appreciated that the symmetric encryption algorithm comprises any suitable symmetric encryption algorithm, such as a quantum key distribution algorithm.

Referring to table 4, according to the Call-Name Protocol (Call-Name Protocol), the data structure of the Call instruction is as follows:

TABLE 4

As shown in table 4, the call instruction further includes a timestamp and an information survival time, before performing S533, referring to fig. 5f, S53 includes:

s535, determining the current time of receiving the call instruction;

s536, calculating the current information duration according to the current time and the timestamp;

s537, judging whether the current information duration is less than or equal to the information survival duration, if so, entering S533, and if not, executing S538;

s538, if not, the calling instruction is discarded.

Therefore, by adopting the method, the reliable and orderly communication between the long-range node and the foundation node can be ensured.

Herein, compared to the superblocks with the same block height stored on the space-based node, the superblock stored on the remote node is very unlikely to be tampered with, and has the highest security, so in some embodiments, when the corresponding node needs a synchronization block, it can synchronize the superblock to the space-based node, and also synchronize the superblock to the remote node, it can be understood that a user usually selects a node with the highest local block priority or the highest security for synchronizing the superblock within the selectable range of block synchronization, and therefore, a block synchronization method is provided based on a block distributed block chain, please refer to fig. 6a, where the block synchronization method S600 includes:

s61, sending a data synchronization command to a plurality of nodes, wherein each node stores super blocks with the same block height;

s62, acquiring local block priority returned by each node;

s63, determining a target node according to the local block priority of each node;

and S64, synchronizing the superblock of the target node.

In this embodiment, the data synchronization command is used to request the plurality of nodes to return the local block priority of the local superblock, so as to synchronize the corresponding superblocks. And each node receives the data synchronization instruction, analyzes the data synchronization instruction, extracts the local block priority of the local super block according to the analysis result and returns the local block priority. Here, the node may be a node of any suitable role, such as a normal node or an out-of-block node.

In this embodiment, the electronic device may determine the target nodes according to the local zone priorities of the nodes, in combination with any suitable rule or algorithm, where the number of the target nodes may be one or more than two.

In this embodiment, when synchronizing the superblock of the target node, the electronic device may synchronize all or part of the data of the superblock.

Generally, in this embodiment, the super block with the highest security is selected for synchronization according to the local block priority, so as to optimally avoid the existence of tampering and unsafe super blocks in synchronization, thereby improving the security and reliability of data synchronization of the distributed block chain.

In some embodiments, a data synchronization command is sent to a plurality of nodes all storing superblocks, so that each node returns block header information of the superblocks according to the data synchronization command, the superblocks of each node are at the same block height, the plurality of nodes include foundation nodes and tele-range nodes, and if the block header information of each foundation node is detected to be inconsistent with the block header information of the tele-range nodes, the block data of the superblocks in the tele-range nodes are synchronized.

In some embodiments, referring to fig. 6b, S63 includes:

s631, judging whether the super block with the highest priority exists in each node according to the local block priority of each node;

s632, if yes, selecting the node of the super block with the highest priority as a target node;

and S633, if not, continuously determining the target node according to the local block priority returned by each node.

For example, referring to fig. 6c, the electronic device 4-0 broadcasts a data synchronization command to the blockchain network, wherein the data synchronization command encapsulates a target block height of the super block to be synchronized, for example, the target block height is 120, i.e., the electronic device 4-0 needs the super block with the synchronization block height of 120. And the corresponding node in the block chain network receives the data synchronization instruction and analyzes the data synchronization instruction to obtain the height of the target block. And the corresponding node searches whether the super block highly matched with the target block is stored locally or not, responds to the data synchronization instruction if the super block is stored, returns the priority of the local block to the electronic equipment 4-0, and does not respond to the data synchronization instruction if the super block is not stored.

As shown in fig. 6c, the distant node 4-1, the normal node 4-2, the normal node 4-3, and the normal node 4-4 all return local block priorities to the electronic device, where the local block priority of the distant node 4-1 is 0, the local block priorities of the normal node 4-2 and the normal node 4-3 are 1, and the local block priority of the normal node 4-4 is 2.

The electronic equipment traverses the super block with the highest priority according to the local block priority of each node, namely, the node corresponding to the super block with the highest priority is the long-range node 4-1, so that the electronic equipment selects the long-range node 4-1 as a target node and synchronizes the super block of the long-range node 4-1.

It can be understood that, different from the above embodiment, the electronic device may locally maintain a synchronization node list, where the synchronization node list includes block heights and node addresses of each node, and if the electronic device needs to synchronize a super block with a certain block height, the electronic device may query the synchronization node list, extract node addresses of nodes with the same block height from the synchronization node list, and send a data synchronization instruction to a plurality of nodes, where the plurality of nodes all store super blocks with the same block height.

It can be understood that, considering that the far-reaching node or the high-priority node is in an offline state and fails to respond to the data synchronization command in time, or is attacked by a malicious attack and is shielded outside the blockchain network, when the electronic device sends the data synchronization command, the far-reaching node or the high-priority node also fails to return the local block priority in time, and therefore, the local block priority of the far-reaching node or the local block priority of the high-priority node may not exist in the local block priorities of the nodes received by the electronic device.

Assuming that the distant node 4-1 is in an offline state and cannot return the local block priority 0 to the electronic device in fig. 6c, in order to continue synchronizing the superblocks normally and orderly, the electronic device continues to determine the destination node according to the local block priorities returned by the normal node 4-2, the normal node 4-3, and the normal node 4-4, for example, the electronic device may select the normal node 4-2 and/or the normal node 4-3 as the destination node.

In some embodiments, referring to fig. 6d, S633 includes:

s6331, arranging all the nodes according to the priority order of the priority of each local block;

and S6332, selecting the nodes with the priorities closest to the highest priority in sequence in a specified number as target nodes.

For example, referring to FIG. 6e, as mentioned above, the distant node 4-1 is in an offline state and cannot return the local block priority 0 to the electronic device, but the normal nodes 4-2 and 4-3 … … all return the local block priority to the electronic device, the distant node 4-1, the normal node 4-2, and the normal node 4-3 … … all store super blocks with the same block height, the local block priorities of the normal node 4-2 and the normal node 4-3 are all 1, the local block priority of the normal node 4-4 is 2, the local block priority of the normal node 4-5 is 3, the local block priorities of the normal nodes 4-6 and 4-7 are all 4, and the local block priorities of the normal nodes 4-8 are all 4, The local tile priorities of 4-9 are all 5.

The electronic device arranges the common node 4-2 and the common node 4-3 … … according to the priority order from high to low (or from low to high), to obtain:

{(4-2,1),(4-3,1),(4-4,2),(4-5,3),(4-6,4),(4-7,4),(4-8,5),(4-9,5),}。

assuming that the designated number is 1, since the priorities of the normal node 4-2 and the normal node 4-3 are the priorities closest to the distant node 4-1, the electronic device may select the normal node 4-2 or the normal node 4-3 as the target node, and then the electronic device may select the superblock of the normal node 4-2 or the normal node 4-3 for synchronization.

Assuming that the designated number is 4, since the priorities of the common node 4-2, the common node 4-3, the common node 4-4, and the common node 4-5 are all the priorities closest to the long-range node 4-1 in sequence, the electronic device selects the common node 4-2, the common node 4-3, the common node 4-4, and the common node 4-5 as target nodes, and thus the electronic device can select a superblock of any one of the common node 4-3, the common node 4-4, and the common node 4-5 for synchronization.

In some embodiments, in order to synchronize the superblock more securely, when the number of target nodes is at least two or more, referring to fig. 6f before executing S64, the block synchronization method S600 further includes:

s65, judging whether the block head hashes of the superblocks in the target nodes are consistent, if so, entering S64, otherwise, executing S66;

and S66, continuously determining the target node.

In this embodiment, the block header hash may be a hash obtained by performing a hash operation on all data of the block header in the super block, or may be a parent block hash, a block hash, or the like in the block header.

In this embodiment, when the hash of the block headers of the superblocks in the target nodes is inconsistent, it indicates that the block data of one or more target nodes is tampered, and since the electronic device cannot acquire the data of the safe and reliable area blocks, the electronic device cannot synchronize the superblocks of the target nodes at this time.

For example, please refer to fig. 6e, the designated number is 4, if the hash of the block headers of the normal node 4-2, the normal node 4-3, the normal node 4-4, and the normal node 4-5 are not consistent, the electronic device does not select the normal node 4-2, the normal node 4-3, the normal node 4-4, and the normal node 4-5 as the target node, which is helpful to enhance the security and reliability of the block synchronization on the premise that the electronic device cannot acquire the super block with the highest priority, i.e., cannot directly access the long-range node.

In some embodiments, referring to fig. 6g, S64 includes:

s641, synchronizing the block height of the block head in the super block, the parent block hash and the block body hash in the block head of the local super block;

s642, synchronizing the service data and the father node list of the block body in the super block in the block body of the local super block;

s643, updating the data variable area of the local superblock, so that the priority of the local block priority of the updated local superblock is lower than that of the local block priority in the target node.

For example, in superblock Q1 of the target node, the block height, parent block hash, and block hash are H0, W0, and W1, respectively, then when the electronic device generates local superblock Q2, the block height, parent block hash, and block hash of superblock Q1, H0, W0, and W1, are written into the local superblock Q2 at the corresponding locations in its header, respectively. And, the electronic device synchronizes the service data of the partition in superblock Q1 and the parent node list { Z0, Z1} to the corresponding position in the partition of local superblock Q2.

In addition, since the local block priority of superblock Q1 is 0, when the electronic device updates the data variable of the superblock in the local superblock, the local block priority of the local superblock is updated to 1, that is, the priority of the local block priority of the updated local superblock is lower than the priority of the local block priority in the target node, so that, based on the consideration that the more the synchronization sequence is, the higher the risk of superblock being tampered, with this approach, it is beneficial to effectively select a superblock with high security and high reliability for synchronization when the superblock is synchronized by the following nodes, thereby reducing the existence possibility of illegal superblocks, and further effectively maintaining the block distributed block chain.

In some embodiments, referring to fig. 6h, S64 includes S644, S644: and updating the inheritance field and/or the root cause field of the data variable area in the local super block.

In some embodiments, when updating the legacy field of the data variable region in the local superblock, the electronic device fills the legacy field of the local superblock with node information of the target node.

In some embodiments, when updating the root field of the data variable region in the local chunk, when the target node is a distant node, the node information of the distant node is filled in the root field, for example, the target node I1 is a distant node, and the electronic device fills the node information of the target node I1 in the root field of the local super chunk.

When the target node is a non-tele-range node and the root field thereof is node information of a tele-range node, the node information of the tele-range node is filled in the root field of the local super block, for example, the target node I2 is a normal node and the root field of the target node I2 is node information of the tele-range node I3, and the electronic device fills the node information of the tele-range node I3 in the root field of the local super block.

When the target node is a non-tele-range node and the root field thereof is node information of the non-tele-range node, the node information of the non-tele-range node is filled in the root field of the local super block, for example, the target node I4 is a normal node and the root field of the target node I4 is node information of the normal node I5, and the electronic device fills the node information of the normal node I5 in the root field of the local super block.

As described above, by continuously updating and recording the inheritance field and/or the root field in each superblock, the method can simply, reliably, comprehensively and safely restore the synchronization path of the corresponding superblock in the block distributed storage mode, and can more effectively and safely maintain the block distributed block chain.

In order to prevent a malicious node from impersonating a distant node or performing other malicious attacks on the distant node, the electronic device may verify the validity of the distant node when synchronizing a super block of the distant node or visiting the distant node, and therefore, in some embodiments, referring to fig. 6i, the block synchronization method S600 further includes:

s67, sending the random code to the first remote node so that the first remote node signs the random code by using a private key and returns a signature result, wherein the first remote node stores the first super block;

s68, extracting a node public key of the first long-range node from a second super block after the block height is adjacent to the first super block;

and S69, verifying whether the signature result is legal or not by using the node public key of the first long-range node, wherein if the signature result is legal, the first long-range node is a legal long-range node, and if the signature result is not legal, the first long-range node is an illegal long-range node.

In this embodiment, the random code is a character or string of characters in any suitable form.

For a detailed understanding of the present embodiment, this is explained in detail below with reference to fig. 6 j:

as shown in fig. 6j, the first tele-node j1 stores a first super-block Q3 with a block height of 101, and the second tele-node j2 stores a second super-block Q4 with a block height of 102, so that the first super-block Q3 and the second super-block Q4 are adjacent in the block-distributed block chain, and the first tele-node j1 is the parent tele-node of the second tele-node j 2.

Since the parent node list of the second superblock Q4 records the node information of the first distant node j1, that is, the parent node list of the second superblock Q4 records the node public key of the first distant node j1, the node public key of the first distant node j1 can be used to verify the validity of the first distant node j1 in the later period.

For example, the electronic device j0 randomly generates a random code and sends the random code to the first distant node j 1. According to the service logic, the first remote node j1 needs to sign the random code by using its own private key to obtain a signature result, and then the first remote node j1 sends the signature result to the electronic device.

The electronic device j0 knows that the node public key of the first tele-range node j1 is stored in the second super block Q4 of the second tele-range node j2, so that the electronic device j0 extracts the node public key of the first tele-range node j1 from the second super block Q4, and verifies whether the signature result is legal or not by using the node public key of the first tele-range node j1, if so, the first tele-range node j1 is a legal tele-range node, and if not, the first tele-range node j1 is an illegal tele-range node.

Therefore, by adopting the method, the validity of the long-distance node can be effectively verified in the block distributed block chain, so that the information security of the block distributed block chain is effectively maintained.

It should be noted that, in the foregoing embodiments, a certain order does not necessarily exist between the foregoing steps, and those skilled in the art can understand, according to the description of the embodiments of the present invention, that in different embodiments, the foregoing steps may have different execution orders, that is, may be executed in parallel, may also be executed interchangeably, and the like.

Referring to fig. 7, fig. 7 is a schematic circuit diagram of an electronic device according to an embodiment of the present invention. As shown in fig. 7, the electronic device 700 includes one or more processors 71 and memory 72. Fig. 7 illustrates an example of one processor 71.

The processor 71 and the memory 72 may be connected by a bus or other means, such as the bus connection in fig. 7.

The memory 72 is a non-volatile computer-readable storage medium, and can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules, such as program instructions/modules corresponding to the data saving method based on the block distributed blockchain in the embodiment of the present invention. The processor 71 executes various functional applications and data processing of the data saving method based on the block distributed blockchain by running the nonvolatile software program, instructions and modules stored in the memory 72, that is, the functions of the data saving method based on the block distributed blockchain provided by the above method embodiments are realized.

The memory 72 may include high speed random access memory and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some embodiments, the memory 72 may optionally include memory located remotely from the processor 71, which may be connected to the processor 71 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The program instructions/modules are stored in the memory 72 and, when executed by the one or more processors 71, perform the method for data retention based on a blockchain distributed block, according to any of the method embodiments described above.

Embodiments of the present invention further provide a storage medium storing computer-executable instructions, which are executed by one or more processors, for example, one processor 71 in fig. 7, so that the one or more processors may execute the data saving method based on the block distributed block chain in any method embodiment described above.

An embodiment of the present invention further provides a computer program product, where the computer program product includes a computer program stored on a non-volatile computer-readable storage medium, where the computer program includes program instructions, and when the program instructions are executed by an electronic device, the electronic device is caused to execute any one of the data saving methods based on the block distributed blockchain.

The above-described embodiments of the apparatus or device are merely illustrative, wherein the unit modules described as separate parts may or may not be physically separate, and the parts displayed as module units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network module units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment.

Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a general hardware platform, and certainly can also be implemented by hardware. Based on such understanding, the above technical solutions substantially or contributing to the related art may be embodied in the form of a software product, which may be stored in a computer-readable storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method according to the embodiments or some parts of the embodiments.

Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; within the idea of the invention, also technical features in the above embodiments or in different embodiments may be combined, steps may be implemented in any order, and there are many other variations of the different aspects of the invention as described above, which are not provided in detail for the sake of brevity; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.

Claims (13)

1. A data storage method based on a block distributed block chain is characterized by comprising the following steps:

packing the service data into candidate blocks;

the candidate blocks are identified together to obtain a super block, and the super block is a block with any data type and any data size;

writing a specified number of super blocks into at least one long-range node, wherein the super blocks with different block heights can form a block distributed block chain, and the long-range node is a node which takes a transmitting place as a center and is continuously away from the transmitting place after being transmitted;

and controlling each long-distance navigation node to be deployed to an unappable area, wherein the unappable area comprises space.

2. The method of claim 1, wherein the controlling deployment of each of the remote nodes to the non-aggressable region comprises:

and transmitting each said long-range node to said space such that each said long-range node continues to move away from the transmission site.

3. The method of claim 2, wherein said transmitting each said distant node to said space comprises:

and controlling each long-range node to move towards an interplanetary substance sparse area, wherein a silver disc plane of a silver river system is used as a reference coordinate system, and the interplanetary substance sparse area is an outer space area pointed by the normal direction of the silver disc plane.

4. The method of claim 3, wherein said controlling each said tele-node to move towards a sparse region of interplanetary material comprises:

and controlling each long-range node to move towards the interstellar material sparse area according to a dispersed layout rule, so that the movement directions of the long-range nodes are different.

5. The method of claim 4,

the interstellar material sparse region comprises a positive interstellar material sparse region with a silver disk positively and normally directed and a negative interstellar material sparse region with a silver disk negatively and normally directed, and the silver disk positive normal is the direction of a right-hand spiral thumb of a silver river spiral arm;

according to the dispersed layout rule, each long-distance navigation node is controlled to move towards the interstellar material sparse area, so that the movement directions of the long-distance navigation nodes are different from each other, and the method comprises the following steps:

classifying one long-range node in every two long-range nodes adjacent to the transmission time into a first transmission group, and classifying the other long-range node into a second transmission group, wherein the transmission direction of the first transmission group is the positive interstellar material sparse area, and the transmission direction of the second transmission group is the negative interstellar material sparse area;

and controlling the remote navigation nodes in each transmitting group to move towards the corresponding interstellar material sparse area according to the dispersed layout rule, so that the movement directions of the remote navigation nodes on the same side are different.

6. The method of claim 5,

each interstellar material sparse area comprises a dispersion layout area, and the dispersion layout area is a fan-shaped area formed by radially deflecting a designated silver disc towards the normal direction of the silver disc at the position of the sun by a preset angle;

according to the dispersed layout rule, the long-range nodes in each emission group are controlled to move towards the corresponding interstellar material sparse area according to the emission time, so that the movement directions of the long-range nodes on the same side are different from each other, and the method comprises the following steps:

and controlling the long-range nodes in each emission group to move into the distributed layout area after leaving the solar system according to a distributed layout rule, so that the movement directions of the long-range nodes are different.

7. The method of claim 6, wherein the controlling the long-range nodes in each emission group to move away from the solar system into the distributed layout area according to the distributed layout rule comprises:

determining the movement direction of each long-range node on the same side entering the scattered layout area after leaving the solar system according to the emission sequence, wherein the included angle between the movement direction and the normal direction of the silver disc meets the condition of bisection series;

and controlling each long-range node to be transmitted into the scattered layout area according to the motion direction.

8. The method of claim 7, wherein the emission sequence is {1,2,3 … … M }, i e M, i and M are positive integers, and wherein determining the direction of movement of each of the nodes on the same side into the decentralized layout area after leaving the solar system comprises, based on the emission sequence:

assigning i =1, determining whether i is greater than M, if i is greater than M, stopping operation, if i is not greater than M, determining whether i is equal to 1, if 1, taking the sun as an angular point, making a first straight line parallel to the normal direction of the silver disc through the angular point, controlling a first teleflight node to enter the distributed layout area towards the direction of the first straight line, assigning i = i +1, returning to the step of determining whether i is greater than M, if not equal to 1, determining whether i is equal to 2, if equal to 2, making a second straight line intersecting the normal direction of the silver disc at the preset angle through the angular point, controlling a second teleflight node to leave the solar system, entering the distributed layout area towards the direction of the second straight line, and optionally selecting one point in the first straight line as a first end point, making a straight line parallel to the radial direction of the silver disc through the first end point to intersect with the second straight line, setting the intersection point as a second end point, setting the vector line segment from the first end point to the second end point, assigning i = i +1, and returning to the step of judging whether i is greater than M;

if i is not equal to 2, judging whether the longest sub-line segment is equal to the shortest sub-line segment in the vector line segments;

if the values are equal, selecting a bisection midpoint in the sub-line segment closest to the first end point, controlling the ith long-range node to leave the solar system, then entering the scattered layout region towards the direction of an ith straight line formed by the bisection midpoint and the angular point, assigning a value of i = i +1, and returning to the step of judging whether i is greater than M;

if not, selecting a bisection midpoint in the longest sub-line segment closest to the first endpoint, controlling the ith long-range node to leave the solar system, then entering the scattered layout region towards the direction of an ith straight line formed by the bisection midpoint and the angular points, assigning i = i +1, and returning to the step of judging whether i is greater than M.

9. The method according to any one of claims 1 to 8, wherein each of said remote nodes, after storing a specified number of super blocks, is configured in a closed mode in which reception of other blocks is disabled, said super blocks being in a read-only mode.

10. The data saving method of claim 9, wherein the specified number is 1, and the super blocks with different block heights are distributed at different distant nodes to form a block distributed block chain.

11. The method of any one of claims 1 to 8, wherein the super-block comprises the traffic data and a parent node list, wherein the block header comprises a block height, a parent block hash, and a block hash, and wherein the parent node list comprises node information of each parent tele-node at the same block height.

12. A storage medium storing computer-executable instructions for causing an electronic device to perform the method for saving data based on a block distributed blockchain according to any one of claims 1 to 11.

13. An electronic device, comprising:

at least one processor; and the number of the first and second groups,

a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,

the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of data retention based on a blockchain distributed block according to any one of claims 1 to 11.

Images