CN113568910A - Data chaining method and system of block chain with spiral chain structure - Google Patents

Data chaining method and system of block chain with spiral chain structure Download PDF

Info

Publication number
CN113568910A
CN113568910A CN202110839301.3A CN202110839301A CN113568910A CN 113568910 A CN113568910 A CN 113568910A CN 202110839301 A CN202110839301 A CN 202110839301A CN 113568910 A CN113568910 A CN 113568910A
Authority
CN
China
Prior art keywords
block
chain
data
branched
mth
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
CN202110839301.3A
Other languages
Chinese (zh)
Inventor
何翔
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangzhou Dika Information Technology Co ltd
Original Assignee
Guangzhou Dika Information Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Guangzhou Dika Information Technology Co ltd filed Critical Guangzhou Dika Information Technology Co ltd
Priority to CN202110839301.3A priority Critical patent/CN113568910A/en
Publication of CN113568910A publication Critical patent/CN113568910A/en
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computing Systems (AREA)
  • Software Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The application discloses a data chaining method of a block chain with a spiral chain structure, which comprises the following steps: obtaining first data, second data, …, and mth data at a first time point; generating a first branched block, a second branched block, …, and an m-th branched block; obtaining first second data, second data, … and mth second data at a second time point; generating a first two-branched-chain block, a second two-branched-chain block, … and an m-second branched-chain block; obtaining a first m branched chain block, a second m branched chain block, …, and a mm branched chain block at a third time point, …, and an m time point, respectively; labeled as first data branch, second data branch, …, and mth data branch; extracting the branched chain blocks to obtain m branched chain blocks; and after a new main chain block is generated and connected to the previous main chain block, the reliability of initial data is high, and the data analysis capability and the node early warning function are realized.

Description

Data chaining method and system of block chain with spiral chain structure
Technical Field
The present application relates to the field of computers, and in particular, to a data chaining method for a blockchain having a spiral chain structure.
Background
The block chain has the advantages of decentralization, tamper resistance and the like, and is suitable for being applied to multiple fields. However, the existing blockchain only guarantees the security of the stored data, but does not have the capability of distinguishing the initial data and the capability of analyzing the data, so the existing blockchain is to be improved.
Disclosure of Invention
The application provides a data chaining method of a block chain with a spiral chain structure, which comprises the following steps:
s1, at a first time point, the first mobile block chain node, the second mobile block chain node, the … and the mth mobile block chain node respectively and correspondingly move to a first designated position, a second designated position, … and an mth designated position, and data acquisition processing is simultaneously carried out to correspondingly obtain first data, second data, … and mth data; the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node are all block chain nodes in a preset specified block chain; m is an integer greater than 5; the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node are all provided with data collectors in advance;
s2, a first mobile block chain node, a second mobile block chain node, … and an m mobile block chain node, wherein a first branched chain block, a second branched chain block, … and an m first branched chain block are correspondingly generated according to the first data, the second data, … and the m first data respectively; wherein the first, second, …, and m-th branched blocks are all connected to the last main chain block in the designated block chain, the first, second, …, and m-th branched blocks being connected in parallel with each other;
s3, at a second time point, the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node respectively and correspondingly move to a second designated position, a third designated position, …, an mth designated position and a first designated position, and data acquisition processing is simultaneously carried out to correspondingly obtain first and second data, … and mth second data;
s4, a first mobile block chain node, a second mobile block chain node, … and an m mobile block chain node, wherein a first two-branched-chain block, a second two-branched-chain block, … and an m second branched-chain block are correspondingly generated according to the first two data, the second two data, … and the m second data respectively; wherein the first two branched blocks, the second two branched blocks, …, and the m second branched blocks are respectively and correspondingly connected behind the second one branched block, the third one branched block, …, and the first one branched block; the second time point is later than the first time point;
s5, continuing movement, data acquisition and branched chain block generation operations of the block chain node at the third time point, …, and mth time point, respectively, to finally obtain a first m branched chain block, a second m branched chain block, …, and a mth branched chain block; the operation at the ith time point is that the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node respectively and correspondingly move to the ith designated position, the (i + 1) th designated position, …, the mth designated position, the first designated position, … and the (i-1) th designated position, and data acquisition processing is simultaneously carried out to correspondingly obtain the first i data, the second i data, … and the mi data; a first mobile block chain node, a second mobile block chain node, …, and an m mobile block chain node, which respectively generate a first i branched-chain block, a second i branched-chain block, …, and an m branched-chain block according to the first i data, the second i data, …, and the m data; wherein the first i branched block, the second i branched block, …, and the mi branched block are respectively and correspondingly connected after the second i-1 branched block, the third i-1 branched block, …, and the first i-1 branched block; the third time point … and the mth time point are sequentially positioned to the right on the time axis, and the time points positioned to the right on the time axis are delayed; i is an integer of more than or equal to three and less than or equal to m;
s6, sequentially marking a branched chain comprising the first m branched chain block, the second m branched chain block, the … and the mm branched chain block as a first data branched chain, a second data branched chain, … and an m branched chain, so that the first data branched chain, the second data branched chain, the … and the m branched chain form a spiral chain structure;
s7, respectively extracting a branched chain block from the first data branched chain, the second data branched chain, … and the m-th data branched chain according to a preset block extraction method, thereby obtaining m branched chain blocks;
s8, generating a new main chain block based on the data in the m branched chain blocks, and connecting the new main chain block to the front main chain block in the appointed block chain to complete the data entering process.
Furthermore, the storage structure of the specified block chain comprises a plurality of main chain blocks which are sequentially connected, a plurality of data branched chains are connected behind all the main chain blocks except the last main chain block, each data branched chain comprises a plurality of branched chain blocks, all the data branched chains connected with the same main chain block have the same number of branched chain blocks, all the data branched chains connected with the same main chain block form a spiral chain structure, and all the branched chain blocks on the same data branched chain are generated by different moving block link points.
Further, after the step S8 of generating a new main chain block based on the data in the m branched chain blocks and connecting the new main chain block to the previous main chain block in the designated block chain to complete the data in-chain process, the method includes:
s81, performing repeated moving, data collecting and branched block generating operations at the m +1, … and 2m time points to finally obtain a first m +1 branched block, a second m +2 branched block, … and a m2m branched block; wherein, the operation executed at each of the m +1 th, … th and 2m th time points is respectively the same as the operation executed at each of the first, … th and m th time points in a one-to-one correspondence;
s82, marking a branched chain comprising the first m +1 branched chain block, the second m +2 branched chain block, … and the m2m branched chain block as an m +1 data branched chain, an m +2 data branched chain, … and a 2m data branched chain in sequence, so that the m +1 data branched chain, the m +2 data branched chain, … and the 2m data branched chain form a new spiral chain structure;
s83, respectively extracting a branched chain block from the m +1 th data branched chain, the m +2 th data branched chain, … and the 2m th data branched chain according to a preset block extraction method, thereby obtaining new m branched chain blocks;
and S84, regenerating a main chain block based on the data in the new m branched chain blocks, and connecting the regenerated main chain block to the previous main chain block in the appointed block chain to complete the new round of data entering process.
Further, the step S7 of extracting a branch block from the first data branch, the second data branch, …, and the m data branch according to a preset block extraction method, so as to obtain m branch blocks includes:
s701, acquiring first standard data, second standard data, … and mth standard data which respectively correspond to the first designated position, the second designated position, … and the mth designated position from a preset standard data table; the standard data table records the corresponding relation between the designated position and the standard data;
s702, extracting a branched chain block from the first data branched chain, the second data branched chain, … and the mth data branched chain respectively according to the principle that the difference between the extracted branched chain block data and the standard data is maximum.
Further, after the step S84 of regenerating a main chain block based on the data in the new m branched chain blocks and connecting the regenerated main chain block to the previous main chain block in the designated block chain to complete a new round of data entering into the chain, the method includes: s841, acquiring all mobile block chain nodes corresponding to all main chain blocks of the specified block chain respectively according to the corresponding relation of the main chain blocks, the branched chain blocks and the mobile block chain nodes, and arranging in descending order according to the acquired times to obtain a block chain node list;
s842, judging whether the block chain node list has block chain link points with the occurrence frequency larger than a preset frequency threshold value;
s843, if block link points with the occurrence times larger than a preset time threshold exist in the block chain node list, marking the block link points with the occurrence times larger than the preset time threshold as alarm nodes;
s844, the alarm-depending node is sent to a preset overhaul terminal, and a user of the overhaul terminal is required to overhaul the alarm node.
The application provides a data income chain system of block chain with spiral chain structure, includes:
the first acquisition unit is used for indicating that the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node respectively and correspondingly move to a first designated position, a second designated position, … and an mth designated position when the first time point is reached, and simultaneously carrying out data acquisition processing to correspondingly obtain first data, second data, … and mth first data; the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node are all block chain nodes in a preset specified block chain; m is an integer greater than 5; the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node are all provided with data collectors in advance;
a first block generation unit, configured to indicate a first mobile block chain node, a second mobile block chain node, …, and an mth mobile block chain node, and generate a first branched block, a second branched block, …, and an mth branched block according to the first data, the second data, …, and the mth data, respectively; wherein the first, second, …, and m-th branched blocks are all connected to the last main chain block in the designated block chain, the first, second, …, and m-th branched blocks being connected in parallel with each other;
the second acquisition unit is used for indicating that the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node respectively and correspondingly move to a second designated position, a third designated position, …, an mth designated position and a first designated position when the second time point is reached, and simultaneously carrying out data acquisition processing to correspondingly obtain first and second data, … and mth second data;
a second block generation unit, configured to indicate a first mobile block chain node, a second mobile block chain node, …, and an mth mobile block chain node, and generate a first two-branched block, a second two-branched block, …, and an mth two-branched block correspondingly according to the first two data, the second two data, …, and the mth two data, respectively; wherein the first two branched blocks, the second two branched blocks, …, and the m second branched blocks are respectively and correspondingly connected behind the second one branched block, the third one branched block, …, and the first one branched block; the second time point is later than the first time point;
an mth tile generation unit for instructing movement of the persistent blockchain node, data acquisition, and branched tile generation operations at the third time point, …, and the mth time point, respectively, to finally obtain a first m branched tile, a second m branched tile, …, and a mm branched tile; the operation at the ith time point is that the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node respectively and correspondingly move to the ith designated position, the (i + 1) th designated position, …, the mth designated position, the first designated position, … and the (i-1) th designated position, and data acquisition processing is simultaneously carried out to correspondingly obtain the first i data, the second i data, … and the mi data; a first mobile block chain node, a second mobile block chain node, …, and an m mobile block chain node, which respectively generate a first i branched-chain block, a second i branched-chain block, …, and an m branched-chain block according to the first i data, the second i data, …, and the m data; wherein the first i branched block, the second i branched block, …, and the mi branched block are respectively and correspondingly connected after the second i-1 branched block, the third i-1 branched block, …, and the first i-1 branched block; the third time point … and the mth time point are sequentially positioned to the right on the time axis, and the time points positioned to the right on the time axis are delayed; i is an integer of more than or equal to three and less than or equal to m;
a branch marking unit for indicating that a branch chain including the first m branch block, the second m branch block, …, and the mm branch block is marked as a first data branch, a second data branch, …, and an m data branch in sequence, so that the first data branch, the second data branch, …, and the m data branch constitute a spiral chain structure;
a block extraction unit, configured to instruct to extract one branched block from the first data branched chain, the second data branched chain, …, and the mth data branched chain respectively according to a preset block extraction method, so as to obtain m branched blocks;
and the data link entering unit is used for indicating that a new main chain block is generated according to the data in the m branched chain blocks, and the new main chain block is connected to the front main chain block in the appointed block chain so as to finish the data link entering process.
The present application provides a computer device comprising a memory storing a computer program and a processor implementing the steps of any of the above methods when the processor executes the computer program.
The present application provides a computer-readable storage medium having stored thereon a computer program which, when being executed by a processor, carries out the steps of the method of any of the above.
According to the data chaining method, the data chaining system, the computer device and the storage medium of the block chain with the spiral chain structure, at a first time point, first data, second data, … and mth first data are obtained; generating a first branched block, a second branched block, …, and an m-th branched block; obtaining first second data, second data, … and mth second data at a second time point; generating a first two-branched-chain block, a second two-branched-chain block, … and an m-second branched-chain block; obtaining a first m branched chain block, a second m branched chain block, …, and a mm branched chain block at a third time point, …, and an m time point, respectively; labeled as first data branch, second data branch, …, and mth data branch; extracting the branched chain blocks to obtain m branched chain blocks; a new backbone block is generated and connected to the specified block chain after the previous backbone block. Therefore, the scheme of the application has the characteristics that the traditional block chain does not have, namely the reliability of initial data is high, the data analysis capability is realized, and more importantly, the node early warning function is also realized.
Drawings
Fig. 1 is a schematic flowchart of a data chaining method of a blockchain having a spiral chain structure according to an embodiment of the present disclosure;
fig. 2 is a block diagram illustrating a structure of a computer device according to an embodiment of the present application.
The implementation, functional features and advantages of the objectives of the present application will be further explained with reference to the accompanying drawings.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application 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 present application and are not intended to limit the present application.
Referring to fig. 1, an embodiment of the present application provides a data chaining method for a blockchain having a spiral chain structure, including the following steps:
s1, at a first time point, the first mobile block chain node, the second mobile block chain node, the … and the mth mobile block chain node respectively and correspondingly move to a first designated position, a second designated position, … and an mth designated position, and data acquisition processing is simultaneously carried out to correspondingly obtain first data, second data, … and mth data; the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node are all block chain nodes in a preset specified block chain; m is an integer greater than 5; the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node are all provided with data collectors in advance;
s2, a first mobile block chain node, a second mobile block chain node, … and an m mobile block chain node, wherein a first branched chain block, a second branched chain block, … and an m first branched chain block are correspondingly generated according to the first data, the second data, … and the m first data respectively; wherein the first, second, …, and m-th branched blocks are all connected to the last main chain block in the designated block chain, the first, second, …, and m-th branched blocks being connected in parallel with each other;
s3, at a second time point, the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node respectively and correspondingly move to a second designated position, a third designated position, …, an mth designated position and a first designated position, and data acquisition processing is simultaneously carried out to correspondingly obtain first and second data, … and mth second data;
s4, a first mobile block chain node, a second mobile block chain node, … and an m mobile block chain node, wherein a first two-branched-chain block, a second two-branched-chain block, … and an m second branched-chain block are correspondingly generated according to the first two data, the second two data, … and the m second data respectively; wherein the first two branched blocks, the second two branched blocks, …, and the m second branched blocks are respectively and correspondingly connected behind the second one branched block, the third one branched block, …, and the first one branched block; the second time point is later than the first time point;
s5, continuing movement, data acquisition and branched chain block generation operations of the block chain node at the third time point, …, and mth time point, respectively, to finally obtain a first m branched chain block, a second m branched chain block, …, and a mth branched chain block; the operation at the ith time point is that the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node respectively and correspondingly move to the ith designated position, the (i + 1) th designated position, …, the mth designated position, the first designated position, … and the (i-1) th designated position, and data acquisition processing is simultaneously carried out to correspondingly obtain the first i data, the second i data, … and the mi data; a first mobile block chain node, a second mobile block chain node, …, and an m mobile block chain node, which respectively generate a first i branched-chain block, a second i branched-chain block, …, and an m branched-chain block according to the first i data, the second i data, …, and the m data; wherein the first i branched block, the second i branched block, …, and the mi branched block are respectively and correspondingly connected after the second i-1 branched block, the third i-1 branched block, …, and the first i-1 branched block; the third time point … and the mth time point are sequentially positioned to the right on the time axis, and the time points positioned to the right on the time axis are delayed; i is an integer of more than or equal to three and less than or equal to m;
s6, sequentially marking a branched chain comprising the first m branched chain block, the second m branched chain block, the … and the mm branched chain block as a first data branched chain, a second data branched chain, … and an m branched chain, so that the first data branched chain, the second data branched chain, the … and the m branched chain form a spiral chain structure;
s7, respectively extracting a branched chain block from the first data branched chain, the second data branched chain, … and the m-th data branched chain according to a preset block extraction method, thereby obtaining m branched chain blocks;
s8, generating a new main chain block based on the data in the m branched chain blocks, and connecting the new main chain block to the front main chain block in the appointed block chain to complete the data entering process.
The method can be applied to any feasible scenes, such as detection of a production line and the like, and is described by taking the production line as an example, wherein the production line is provided with a plurality of detection points, a plurality of movable intelligent robots are used as movable block chain nodes, the detection is respectively carried out on the plurality of detection points, and data entering operation is carried out, through the scheme of the method, the reliability of data acquisition of the robots (because a plurality of robots carry out endorsement) can be ensured, the method also has a function of detecting suspected position points (namely, data analysis capability is provided, because data recorded in a main chain is obtained through data analysis on a branch chain, and the positions corresponding to the data are positions with larger abnormal possibility), and particularly, the method also has a node early warning function (because if all nodes can carry out normal data acquisition operation, the block chain link points corresponding to the blocks with the largest data deviation should be random, if the frequency of some block chain link points is too high, node faults may occur, and therefore early warning is performed). The term "having a helical chain structure" as used herein refers to a particular relationship that a branched chain exhibits.
As described in the above steps S1-S2, at the first time point, the first moving block chain node, the second moving block chain node, …, and the mth moving block chain node respectively and correspondingly move to the first designated position, the second designated position, …, and the mth designated position, and simultaneously perform data acquisition processing to correspondingly obtain the first data, the second data, …, and the mth first data; the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node are all block chain nodes in a preset specified block chain; m is an integer greater than 5; the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node are all provided with data collectors in advance; a first mobile block chain node, a second mobile block chain node, …, and an mth mobile block chain node, which correspondingly generate a first branched chain block, a second branched chain block, …, and an mth branched chain block according to the first data, the second data, …, and the mth data, respectively; wherein the first, second, …, and mth branched blocks are all connected to the last main chain block in the designated block chain, the first, second, …, and mth branched blocks being connected in parallel with each other.
One feature of the present application is that multiple mobile blockchain nodes are operated in coordination, i.e., data acquisition and block generation operations are performed simultaneously. The operation steps of the present application are not linear and continuous, but are performed in a stepwise manner, where the stepwise operation refers to performing a specific operation only at a specific time point based on the time point. Therefore, at the first time point, the first moving block chain node, the second moving block chain node, …, and the mth moving block chain node respectively move to the first designated position, the second designated position, …, and the mth designated position, and simultaneously perform data acquisition processing to obtain the first data, the second data, …, and the mth data. It should be noted that, the number "m" is used herein because the present application is comprehensively considered under the multi-node, multi-site, and multi-time-point factors, which does not affect the understanding of those skilled in the art. In addition, the method can be realized by depending on the movable characteristic of the mobile block chain nodes, and the data collector arranged on each mobile block chain node is related to the data to be collected, such as physical parameters (distance and the like) to be collected, and a distance sensor (an optical distance meter and the like) can be adopted; when image data needs to be acquired, a camera can be adopted for realizing; when the electrical data needs to be collected, an electrical signal collector is correspondingly adopted.
A first mobile block chain node, a second mobile block chain node, …, and an mth mobile block chain node, which correspondingly generate a first branched chain block, a second branched chain block, …, and an mth branched chain block according to the first data, the second data, …, and the mth data, respectively; wherein the first, second, …, and mth branched blocks are all connected to the last main chain block in the designated block chain, the first, second, …, and mth branched blocks being connected in parallel with each other. The generation of the branched block may be performed in any feasible manner, for example, the same as the block preparation technique of the existing block chain, and although the existing block chain does not relate to the concept of branched chain, for a single block, the generation technique of the branched block is not different from the block generation technique of the conventional block chain, and thus is not described again. In addition, the first, second, …, and m-th branched blocks are all linked to the last main chain block in the designated block chain, and this linking is expressed, for example, by the block header of the branched block carrying the hash value of the linked block, although this is not excluded. When the branched chain block of the present application is generated and broadcast to other nodes, verification of other nodes may not be required (verification is not required because the data recorded in the blocks on the same branched chain should be substantially the same theoretically due to the special configuration of the branched chain of the present application), and the generation speed of the branched chain is increased.
As described in the above steps S3-S5, at the second time point, the first moving block chain node, the second moving block chain node, …, and the mth moving block chain node respectively and correspondingly move to the second designated position, the third designated position, …, the mth designated position, and the first designated position, and simultaneously perform data acquisition processing to correspondingly obtain the first and second data, the second data, …, and the mth second data; a first mobile block chain node, a second mobile block chain node, …, and an mth mobile block chain node, respectively generating a first two-branched-chain block, a second two-branched-chain block, …, and an mth two-branched-chain block, respectively, according to the first two data, the second two data, …, and the mth two data; wherein the first two branched blocks, the second two branched blocks, …, and the m second branched blocks are respectively and correspondingly connected behind the second one branched block, the third one branched block, …, and the first one branched block; the second time point is later than the first time point; at a third time point, …, and an mth time point, respectively, continuing movement, data acquisition, and branched chain block generation operations of the block chain node to finally obtain a first m branched chain blocks, a second m branched chain blocks, …, and an mm branched chain block; the operation at the ith time point is that the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node respectively and correspondingly move to the ith designated position, the (i + 1) th designated position, …, the mth designated position, the first designated position, … and the (i-1) th designated position, and data acquisition processing is simultaneously carried out to correspondingly obtain the first i data, the second i data, … and the mi data; a first mobile block chain node, a second mobile block chain node, …, and an m mobile block chain node, which respectively generate a first i branched-chain block, a second i branched-chain block, …, and an m branched-chain block according to the first i data, the second i data, …, and the m data; wherein the first i branched block, the second i branched block, …, and the mi branched block are respectively and correspondingly connected after the second i-1 branched block, the third i-1 branched block, …, and the first i-1 branched block; the third time point … and the mth time point are sequentially positioned to the right on the time axis, and the time points positioned to the right on the time axis are delayed; i is an integer of three or more and m or less.
At the second point in time, the first, second, …, and mth mobility blockchain nodes continue to operate similarly to the first point in time, but not exactly the same, except that each node needs to move to the next designated location, whereas the mth mobility blockchain node moves to the first designated location, which is thus a closed loop operation. Then, the generated branched chain blocks, namely the first two branched chain blocks, the second two branched chain blocks, …, the m second branched chain blocks and the following blocks are also extended, namely, the branched chain blocks are respectively and correspondingly connected behind the second first branched chain block, the third branched chain block, … and the first one branched chain block, so that the branched chain blocks on the same branched chain are all collected and generated by different block chain link points at the same designated position, and therefore, not only is the data repetition avoided, but also the reliability of initial data (namely, data which is not entered into the chain) is ensured, and therefore, the phenomenon that data are forged by a certain node is rapidly discovered by other nodes. Thus, after the second point in time, m branches with two layers of branch blocks are formed. Similar operations are continued, namely, the operations of moving, data collecting and branch block generating of the block chain node are continued at the third time point, … and the m time point, respectively, to finally obtain the first m branch block, the second m branch block, … and the mm branch block. Similarly, at each time point, the mobile block chain node needs to move to the next designated position, acquire data, generate a branched chain block, and post-connect the generated branched chain block to the corresponding branched chain according to the principle that the block data on the same branched chain is the acquired data of the same designated position. Specifically, the operation at the ith time point is that the first moving block chain node, the second moving block chain node, … and the mth moving block chain node respectively and correspondingly move to the ith designated position, the (i + 1) th designated position, …, the mth designated position, the first designated position, … and the (i-1) th designated position, and data acquisition processing is simultaneously performed to correspondingly obtain the first i data, the second i data, … and the mi data; a first mobile block chain node, a second mobile block chain node, …, and an m mobile block chain node, which respectively generate a first i branched-chain block, a second i branched-chain block, …, and an m branched-chain block according to the first i data, the second i data, …, and the m data; wherein the first i branched block, the second i branched block, …, and the mi branched block are respectively and correspondingly connected after the second i-1 branched block, the third i-1 branched block, …, and the first i-1 branched block; the third time point … and the mth time point are located in the order of the right on the time axis, and the time points located farther to the right on the time axis are delayed. The third time point … and the mth time point are located rightward in the order of time on the time axis, and the fact that the time point located rightward in the time axis is later means that, among the third time point … and the mth time point, the third time point comes earliest, the mth time point comes latest, and the rest of the time points are analogized in the order of time. In addition, it should be noted that, at the mth time point, it can be ensured that each blockchain node performs data acquisition on all designated locations.
Labeling the branched chain including the first, second, and mth m branched chain blocks, …, and …, as described in steps S6-S11 above, as a first data branch, a second data branch, …, and an mth data branch in this order, such that the first, second, …, and mth data branch constitute a spiral chain structure; respectively extracting a branched chain block from the first data branched chain, the second data branched chain, … and the m-th data branched chain according to a preset block extraction method, thereby obtaining m branched chain blocks; and generating a new main chain block by taking the data in the m branched chain blocks as a basis, and connecting the new main chain block to the front main chain block in the appointed block chain so as to finish the data entering process.
As can be seen from the foregoing description, each moving block chain node moves to the next designated position at the next time point, so that the branch chain blocks collected and generated by the same moving block chain node are actually in an oblique association relationship, and the branch chain blocks generated by all the moving block chain nodes form a spiral chain structure, but at the same time, the spiral chain structure also maintains the chain shape of a straight chain (i.e., m branch chains), in a simple manner, the straight chain is a dominant relationship of the m branch chains, and the spiral chain structure is a recessive relationship of the m branch chains. Accordingly, the branched chain including the first, second, …, and mm-th branched chain blocks is labeled as a first data branch, a second data branch, …, and an m-th data branch in this order, such that the first, second, …, and m-th data branches constitute a helical chain structure. And respectively extracting a branched chain block from the first data branched chain, the second data branched chain, … and the m-th data branched chain according to a preset block extraction method, thereby obtaining m branched chain blocks. The block extraction method may be implemented by any feasible method, for example, by a random extraction method, and if the data of each block in the same branched chain is similar in an ideal state, the random extraction method may be implemented (of course, if the node early warning function and the like of the present application are implemented, the method cannot be implemented); in addition, an extremum extracting method, i.e., extracting an extremum block, can also be used. And generating a new main chain block based on the data in the m branched chain blocks, and connecting the new main chain block to the previous main chain block in the appointed block chain to finish the data entering process. Due to the similar characteristics of the blocks on each branch chain, the data in the m branch chain blocks can represent the data of m designated positions from the first time point to the m time point, and accordingly, the main chain block is generated. The way of generating the main chain block can be in any feasible way, for example, the same way as the existing block chain generates the block. So far, after the new data is linked in, what is essentially accomplished is a unit of data linking, that is, the present application stores data as a basic unit in the whole of m time points.
Furthermore, the storage structure of the specified block chain comprises a plurality of main chain blocks which are sequentially connected, a plurality of data branched chains are connected behind all the main chain blocks except the last main chain block, each data branched chain comprises a plurality of branched chain blocks, all the data branched chains connected with the same main chain block have the same number of branched chain blocks, all the data branched chains connected with the same main chain block form a spiral chain structure, and all the branched chain blocks on the same data branched chain are generated by different moving block link points.
Thus, a memory structure of a block chain formed with a plurality of basic units is constructed. The storage structure may also be referred to as a public ledger. A basic memory cell of a designated block chain of the application comprises a main chain block and all branch chains connected with the main chain block in parallel. Through the special storage structure, the block chain not only has a high-safety data storage function, but also has the functions of improving the reliability of initial data, detecting suspected position points, early warning nodes and the like.
Further, after the step S8 of generating a new main chain block based on the data in the m branched chain blocks and connecting the new main chain block to the previous main chain block in the designated block chain to complete the data in-chain process, the method includes:
s81, performing repeated moving, data collecting and branched block generating operations at the m +1, … and 2m time points to finally obtain a first m +1 branched block, a second m +2 branched block, … and a m2m branched block; wherein, the operation executed at each of the m +1 th, … th and 2m th time points is respectively the same as the operation executed at each of the first, … th and m th time points in a one-to-one correspondence;
s82, marking a branched chain comprising the first m +1 branched chain block, the second m +2 branched chain block, … and the m2m branched chain block as an m +1 data branched chain, an m +2 data branched chain, … and a 2m data branched chain in sequence, so that the m +1 data branched chain, the m +2 data branched chain, … and the 2m data branched chain form a new spiral chain structure;
s83, respectively extracting a branched chain block from the m +1 th data branched chain, the m +2 th data branched chain, … and the 2m th data branched chain according to a preset block extraction method, thereby obtaining new m branched chain blocks;
and S84, regenerating a main chain block based on the data in the new m branched chain blocks, and connecting the regenerated main chain block to the previous main chain block in the appointed block chain to complete the new round of data entering process.
As described above, m time points are basic units, and thus the data at m time points are also required for the next data chaining process, so that at the m +1, …, and 2m time points, the repeated moving, data collecting, and branch block generating operations are performed to finally obtain the first m +1 branch block, the second m +2 branch block, …, and the m2m branch block. At this time, each mobile blockchain node has been reset, and thus the operation is a complete repetition, i.e., the operation performed at each of the m +1 th, … th, and 2 m-th time points is the same as the operation performed at each of the first, … th, and m-th time points, respectively, in a one-to-one correspondence. In addition, one of the points to be noted is that newly generated branches are connected to the main chain block, and are not related to the previously generated branches, but there is a potential correlation that data incorporated into the chain are collected at the same designated position. And then block extraction is carried out, and the main chain generates a process of merging into the chain, thereby completing a new round of data chain entering process.
Further, the step S7 of extracting a branch block from the first data branch, the second data branch, …, and the m data branch according to a preset block extraction method, so as to obtain m branch blocks includes:
s701, acquiring first standard data, second standard data, … and mth standard data which respectively correspond to the first designated position, the second designated position, … and the mth designated position from a preset standard data table; the standard data table records the corresponding relation between the designated position and the standard data;
s702, extracting a branched chain block from the first data branched chain, the second data branched chain, … and the mth data branched chain respectively according to the principle that the difference between the extracted branched chain block data and the standard data is maximum.
Therefore, extraction of the extreme value block is realized so as to determine whether an abnormal position exists. And respectively extracting a branch chain block from the first data branch chain, the second data branch chain, … and the m-th data branch chain according to the principle that the difference between the extracted data of the branch chain block and the standard data is the maximum, so that the main chain block is recorded with the most abnormal data. If the data recorded on the main chain block is still in the tolerance range, the data of the round is normal; if the data recorded on the main chain block is not within the tolerance range, tracing is needed to determine the abnormal position or abnormal node. Therefore, the data analysis function which is not available in the common block chain is realized.
Further, after the step S84 of regenerating a main chain block based on the data in the new m branched chain blocks and connecting the regenerated main chain block to the previous main chain block in the designated block chain to complete a new round of data entering into the chain, the method includes: s841, acquiring all mobile block chain nodes corresponding to all main chain blocks of the specified block chain respectively according to the corresponding relation of the main chain blocks, the branched chain blocks and the mobile block chain nodes, and arranging in descending order according to the acquired times to obtain a block chain node list;
s842, judging whether the block chain node list has block chain link points with the occurrence frequency larger than a preset frequency threshold value;
s843, if block link points with the occurrence times larger than a preset time threshold exist in the block chain node list, marking the block link points with the occurrence times larger than the preset time threshold as alarm nodes;
s844, the warning node is sent to a preset overhaul terminal, and a user of the overhaul terminal is required to overhaul the warning node.
The node warning function can be further achieved. Specifically, the situation exists that all data collected by all block chain nodes and merged into a chain are within a tolerance range and seem to be all normal, but a certain parameter deviation occurs in the collection equipment on a certain block chain node, but the deviation is not large, so that the collected data seem to be normal, and the collected data cannot be identified in a common mode. The characteristic is that if no abnormal node (i.e. the node with certain deviation) exists, the data recorded by all main chain blocks on the designated block chain should uniformly come from different mobile block chain nodes; if there is an abnormal node, the data recorded in all the main chain blocks of the designated block chain will be biased to the node from the abnormality. Accordingly, whether an abnormal node exists or not can be determined by judging whether the block chain node with the occurrence frequency larger than the preset frequency threshold exists in the block chain node list or not. If the block chain node list has the block chain link points with the occurrence times larger than the preset time threshold, recording the block chain link points with the occurrence times larger than the preset time threshold as alarm nodes, and sending the alarm nodes to a preset maintenance terminal so as to require a user of the maintenance terminal to carry out maintenance processing on the alarm nodes. Therefore, the node alarm function is realized by using the block chain.
According to the data chaining method of the block chain with the spiral chain structure, at a first time point, first data, second data, … and mth data are obtained; generating a first branched block, a second branched block, …, and an m-th branched block; obtaining first second data, second data, … and mth second data at a second time point; generating a first two-branched-chain block, a second two-branched-chain block, … and an m-second branched-chain block; obtaining a first m branched chain block, a second m branched chain block, …, and a mm branched chain block at a third time point, …, and an m time point, respectively; labeled as first data branch, second data branch, …, and mth data branch; extracting the branched chain blocks to obtain m branched chain blocks; a new backbone block is generated and connected to the specified block chain after the previous backbone block. Therefore, the scheme of the application has the characteristics that the traditional block chain does not have, namely the reliability of initial data is high, the data analysis capability is realized, and more importantly, the node early warning function is also realized.
The embodiment of the application provides a data income chain system of block chain with spiral chain structure, includes:
the first acquisition unit is used for indicating that the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node respectively and correspondingly move to a first designated position, a second designated position, … and an mth designated position when the first time point is reached, and simultaneously carrying out data acquisition processing to correspondingly obtain first data, second data, … and mth first data; the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node are all block chain nodes in a preset specified block chain; m is an integer greater than 5; the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node are all provided with data collectors in advance;
a first block generation unit, configured to indicate a first mobile block chain node, a second mobile block chain node, …, and an mth mobile block chain node, and generate a first branched block, a second branched block, …, and an mth branched block according to the first data, the second data, …, and the mth data, respectively; wherein the first, second, …, and m-th branched blocks are all connected to the last main chain block in the designated block chain, the first, second, …, and m-th branched blocks being connected in parallel with each other;
the second acquisition unit is used for indicating that the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node respectively and correspondingly move to a second designated position, a third designated position, …, an mth designated position and a first designated position when the second time point is reached, and simultaneously carrying out data acquisition processing to correspondingly obtain first and second data, … and mth second data;
a second block generation unit, configured to indicate a first mobile block chain node, a second mobile block chain node, …, and an mth mobile block chain node, and generate a first two-branched block, a second two-branched block, …, and an mth two-branched block correspondingly according to the first two data, the second two data, …, and the mth two data, respectively; wherein the first two branched blocks, the second two branched blocks, …, and the m second branched blocks are respectively and correspondingly connected behind the second one branched block, the third one branched block, …, and the first one branched block; the second time point is later than the first time point;
an mth tile generation unit for instructing movement of the persistent blockchain node, data acquisition, and branched tile generation operations at the third time point, …, and the mth time point, respectively, to finally obtain a first m branched tile, a second m branched tile, …, and a mm branched tile; the operation at the ith time point is that the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node respectively and correspondingly move to the ith designated position, the (i + 1) th designated position, …, the mth designated position, the first designated position, … and the (i-1) th designated position, and data acquisition processing is simultaneously carried out to correspondingly obtain the first i data, the second i data, … and the mi data; a first mobile block chain node, a second mobile block chain node, …, and an m mobile block chain node, which respectively generate a first i branched-chain block, a second i branched-chain block, …, and an m branched-chain block according to the first i data, the second i data, …, and the m data; wherein the first i branched block, the second i branched block, …, and the mi branched block are respectively and correspondingly connected after the second i-1 branched block, the third i-1 branched block, …, and the first i-1 branched block; the third time point … and the mth time point are sequentially positioned to the right on the time axis, and the time points positioned to the right on the time axis are delayed; i is an integer of more than or equal to three and less than or equal to m;
a branch marking unit for indicating that a branch chain including the first m branch block, the second m branch block, …, and the mm branch block is marked as a first data branch, a second data branch, …, and an m data branch in sequence, so that the first data branch, the second data branch, …, and the m data branch constitute a spiral chain structure;
a block extraction unit, configured to instruct to extract one branched block from the first data branched chain, the second data branched chain, …, and the mth data branched chain respectively according to a preset block extraction method, so as to obtain m branched blocks;
and the data link entering unit is used for indicating that a new main chain block is generated according to the data in the m branched chain blocks, and the new main chain block is connected to the front main chain block in the appointed block chain so as to finish the data link entering process.
The operations performed by the units are respectively corresponding to the steps of the data chaining method of the block chain with the spiral chain structure in the foregoing embodiment one by one, and are not described herein again.
According to the data chaining system of the block chain with the spiral chain structure, at a first time point, first data, second data, … and mth data are obtained; generating a first branched block, a second branched block, …, and an m-th branched block; obtaining first second data, second data, … and mth second data at a second time point; generating a first two-branched-chain block, a second two-branched-chain block, … and an m-second branched-chain block; obtaining a first m branched chain block, a second m branched chain block, …, and a mm branched chain block at a third time point, …, and an m time point, respectively; labeled as first data branch, second data branch, …, and mth data branch; extracting the branched chain blocks to obtain m branched chain blocks; a new backbone block is generated and connected to the specified block chain after the previous backbone block. Therefore, the scheme of the application has the characteristics that the traditional block chain does not have, namely the reliability of initial data is high, the data analysis capability is realized, and more importantly, the node early warning function is also realized.
Referring to fig. 2, an embodiment of the present invention further provides a computer device, where the computer device may be a server, and an internal structure of the computer device may be as shown in the figure. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the computer designed processor is used to provide computational and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used for storing data used by a data in-chain method of a blockchain with a spiral chain structure. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a data-in-chain method for a blockchain having a spiral chain structure.
The processor executes the data link entering method for the block chain with the spiral chain structure, wherein the steps included in the method correspond to the steps of executing the data link entering method for the block chain with the spiral chain structure in the foregoing embodiment one to one, and are not described herein again.
It will be understood by those skilled in the art that the structures shown in the drawings are only block diagrams of some of the structures associated with the embodiments of the present application and do not constitute a limitation on the computer apparatus to which the embodiments of the present application may be applied.
The computer equipment obtains first data, second data, … and mth data at a first time point; generating a first branched block, a second branched block, …, and an m-th branched block; obtaining first second data, second data, … and mth second data at a second time point; generating a first two-branched-chain block, a second two-branched-chain block, … and an m-second branched-chain block; obtaining a first m branched chain block, a second m branched chain block, …, and a mm branched chain block at a third time point, …, and an m time point, respectively; labeled as first data branch, second data branch, …, and mth data branch; extracting the branched chain blocks to obtain m branched chain blocks; a new backbone block is generated and connected to the specified block chain after the previous backbone block. Therefore, the scheme of the application has the characteristics that the traditional block chain does not have, namely the reliability of initial data is high, the data analysis capability is realized, and more importantly, the node early warning function is also realized.
An embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored thereon, and when the computer program is executed by a processor, the method for entering data into a block chain with a spiral chain structure is implemented, where the steps included in the method correspond to the steps of the method for entering data into a block chain with a spiral chain structure in the foregoing embodiment one to one, and are not described herein again.
The computer-readable storage medium of the present application, at a first point in time, obtains first data, second data, …, and mth first data; generating a first branched block, a second branched block, …, and an m-th branched block; obtaining first second data, second data, … and mth second data at a second time point; generating a first two-branched-chain block, a second two-branched-chain block, … and an m-second branched-chain block; obtaining a first m branched chain block, a second m branched chain block, …, and a mm branched chain block at a third time point, …, and an m time point, respectively; labeled as first data branch, second data branch, …, and mth data branch; extracting the branched chain blocks to obtain m branched chain blocks; a new backbone block is generated and connected to the specified block chain after the previous backbone block. Therefore, the scheme of the application has the characteristics that the traditional block chain does not have, namely the reliability of initial data is high, the data analysis capability is realized, and more importantly, the node early warning function is also realized.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware associated with a computer program or instructions, the computer program can be stored in a non-volatile computer-readable storage medium, and the computer program can include the processes of the embodiments of the methods described above when executed. Any reference to memory, storage, database, or other medium provided herein and used in the examples may include non-volatile and/or volatile memory. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), double-rate SDRAM (SSRSDRAM), Enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and bus dynamic RAM (RDRAM).
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, system, article, or method that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, system, article, or method. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, system, article, or method that includes the element.
The above description is only a preferred embodiment of the present application, and not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings of the present application, or which are directly or indirectly applied to other related technical fields, are also included in the scope of the present application.

Claims (8)

1. A data chaining method of a block chain with a spiral chain structure is characterized by comprising the following steps:
s1, at a first time point, the first mobile block chain node, the second mobile block chain node, the … and the mth mobile block chain node respectively and correspondingly move to a first designated position, a second designated position, … and an mth designated position, and data acquisition processing is simultaneously carried out to correspondingly obtain first data, second data, … and mth data; the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node are all block chain nodes in a preset specified block chain; m is an integer greater than 5; the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node are all provided with data collectors in advance;
s2, a first mobile block chain node, a second mobile block chain node, … and an m mobile block chain node, wherein a first branched chain block, a second branched chain block, … and an m first branched chain block are correspondingly generated according to the first data, the second data, … and the m first data respectively; wherein the first, second, …, and m-th branched blocks are all connected to the last main chain block in the designated block chain, the first, second, …, and m-th branched blocks being connected in parallel with each other;
s3, at a second time point, the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node respectively and correspondingly move to a second designated position, a third designated position, …, an mth designated position and a first designated position, and data acquisition processing is simultaneously carried out to correspondingly obtain first and second data, … and mth second data;
s4, a first mobile block chain node, a second mobile block chain node, … and an m mobile block chain node, wherein a first two-branched-chain block, a second two-branched-chain block, … and an m second branched-chain block are correspondingly generated according to the first two data, the second two data, … and the m second data respectively; wherein the first two branched blocks, the second two branched blocks, …, and the m second branched blocks are respectively and correspondingly connected behind the second one branched block, the third one branched block, …, and the first one branched block; the second time point is later than the first time point;
s5, continuing movement, data acquisition and branched chain block generation operations of the block chain node at the third time point, …, and mth time point, respectively, to finally obtain a first m branched chain block, a second m branched chain block, …, and a mth branched chain block; the operation at the ith time point is that the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node respectively and correspondingly move to the ith designated position, the (i + 1) th designated position, …, the mth designated position, the first designated position, … and the (i-1) th designated position, and data acquisition processing is simultaneously carried out to correspondingly obtain the first i data, the second i data, … and the mi data; a first mobile block chain node, a second mobile block chain node, …, and an m mobile block chain node, which respectively generate a first i branched-chain block, a second i branched-chain block, …, and an m branched-chain block according to the first i data, the second i data, …, and the m data; wherein the first i branched block, the second i branched block, …, and the mi branched block are respectively and correspondingly connected after the second i-1 branched block, the third i-1 branched block, …, and the first i-1 branched block; the third time point … and the mth time point are sequentially positioned to the right on the time axis, and the time points positioned to the right on the time axis are delayed; i is an integer of more than or equal to three and less than or equal to m;
s6, sequentially marking a branched chain comprising the first m branched chain block, the second m branched chain block, the … and the mm branched chain block as a first data branched chain, a second data branched chain, … and an m branched chain, so that the first data branched chain, the second data branched chain, the … and the m branched chain form a spiral chain structure;
s7, respectively extracting a branched chain block from the first data branched chain, the second data branched chain, … and the m-th data branched chain according to a preset block extraction method, thereby obtaining m branched chain blocks;
s8, generating a new main chain block based on the data in the m branched chain blocks, and connecting the new main chain block to the front main chain block in the appointed block chain to complete the data entering process.
2. The method according to claim 1, wherein the storage structure of the designated block chain comprises a plurality of main chain blocks connected in sequence, the main chain blocks except the last main chain block are followed by a plurality of data branches, each data branch comprises a plurality of branch blocks, all data branches connected to the same main chain block have the same number of branch blocks, all data branches connected to the same main chain block form the spiral chain structure, and all branch blocks on the same data branch are generated from different moving block link points.
3. The method according to claim 2, wherein after the step S8 of generating a new main chain block based on the data in the m branched chain blocks and connecting the new main chain block to the previous main chain block in the designated block chain to complete the data entering process, the method comprises:
s81, performing repeated moving, data collecting and branched block generating operations at the m +1, … and 2m time points to finally obtain a first m +1 branched block, a second m +2 branched block, … and a m2m branched block; wherein, the operation executed at each of the m +1 th, … th and 2m th time points is respectively the same as the operation executed at each of the first, … th and m th time points in a one-to-one correspondence;
s82, marking a branched chain comprising the first m +1 branched chain block, the second m +2 branched chain block, … and the m2m branched chain block as an m +1 data branched chain, an m +2 data branched chain, … and a 2m data branched chain in sequence, so that the m +1 data branched chain, the m +2 data branched chain, … and the 2m data branched chain form a new spiral chain structure;
s83, respectively extracting a branched chain block from the m +1 th data branched chain, the m +2 th data branched chain, … and the 2m th data branched chain according to a preset block extraction method, thereby obtaining new m branched chain blocks;
and S84, regenerating a main chain block based on the data in the new m branched chain blocks, and connecting the regenerated main chain block to the previous main chain block in the appointed block chain to complete the new round of data entering process.
4. The data entering method of a blockchain with a spiral chain structure according to claim 3, wherein the step S7 of extracting a branch block from the first data branch, the second data branch, …, and the m data branch according to a predetermined block extraction method to obtain m branch blocks comprises:
s701, acquiring first standard data, second standard data, … and mth standard data which respectively correspond to the first designated position, the second designated position, … and the mth designated position from a preset standard data table; the standard data table records the corresponding relation between the designated position and the standard data;
s702, extracting a branched chain block from the first data branched chain, the second data branched chain, … and the mth data branched chain respectively according to the principle that the difference between the extracted branched chain block data and the standard data is maximum.
5. The method for data entering into a block chain with a spiral chain structure according to claim 4, wherein after step S84, based on the data in the new m branched blocks, the method for regenerating a main chain block and connecting the regenerated main chain block to a previous main chain block in the designated block chain to complete a new round of data entering into the chain comprises:
s841, acquiring all mobile block chain nodes corresponding to all main chain blocks of the specified block chain respectively according to the corresponding relation of the main chain blocks, the branched chain blocks and the mobile block chain nodes, and arranging in descending order according to the acquired times to obtain a block chain node list;
s842, judging whether the block chain node list has block chain link points with the occurrence frequency larger than a preset frequency threshold value;
s843, if block link points with the occurrence times larger than a preset time threshold exist in the block chain node list, marking the block link points with the occurrence times larger than the preset time threshold as alarm nodes;
s844, the alarm-depending node is sent to a preset overhaul terminal, and a user of the overhaul terminal is required to overhaul the alarm node.
6. A data-in-chain system for a blockchain having a spiral chain structure, comprising:
the first acquisition unit is used for indicating that the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node respectively and correspondingly move to a first designated position, a second designated position, … and an mth designated position when the first time point is reached, and simultaneously carrying out data acquisition processing to correspondingly obtain first data, second data, … and mth first data; the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node are all block chain nodes in a preset specified block chain; m is an integer greater than 5; the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node are all provided with data collectors in advance;
a first block generation unit, configured to indicate a first mobile block chain node, a second mobile block chain node, …, and an mth mobile block chain node, and generate a first branched block, a second branched block, …, and an mth branched block according to the first data, the second data, …, and the mth data, respectively; wherein the first, second, …, and m-th branched blocks are all connected to the last main chain block in the designated block chain, the first, second, …, and m-th branched blocks being connected in parallel with each other;
the second acquisition unit is used for indicating that the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node respectively and correspondingly move to a second designated position, a third designated position, …, an mth designated position and a first designated position when the second time point is reached, and simultaneously carrying out data acquisition processing to correspondingly obtain first and second data, … and mth second data;
a second block generation unit, configured to indicate a first mobile block chain node, a second mobile block chain node, …, and an mth mobile block chain node, and generate a first two-branched block, a second two-branched block, …, and an mth two-branched block correspondingly according to the first two data, the second two data, …, and the mth two data, respectively; wherein the first two branched blocks, the second two branched blocks, …, and the m second branched blocks are respectively and correspondingly connected behind the second one branched block, the third one branched block, …, and the first one branched block; the second time point is later than the first time point;
an mth tile generation unit for instructing movement of the persistent blockchain node, data acquisition, and branched tile generation operations at the third time point, …, and the mth time point, respectively, to finally obtain a first m branched tile, a second m branched tile, …, and a mm branched tile; the operation at the ith time point is that the first mobile block chain node, the second mobile block chain node, … and the mth mobile block chain node respectively and correspondingly move to the ith designated position, the (i + 1) th designated position, …, the mth designated position, the first designated position, … and the (i-1) th designated position, and data acquisition processing is simultaneously carried out to correspondingly obtain the first i data, the second i data, … and the mi data; a first mobile block chain node, a second mobile block chain node, …, and an m mobile block chain node, which respectively generate a first i branched-chain block, a second i branched-chain block, …, and an m branched-chain block according to the first i data, the second i data, …, and the m data; wherein the first i branched block, the second i branched block, …, and the mi branched block are respectively and correspondingly connected after the second i-1 branched block, the third i-1 branched block, …, and the first i-1 branched block; the third time point … and the mth time point are sequentially positioned to the right on the time axis, and the time points positioned to the right on the time axis are delayed; i is an integer of more than or equal to three and less than or equal to m;
a branch marking unit for indicating that a branch chain including the first m branch block, the second m branch block, …, and the mm branch block is marked as a first data branch, a second data branch, …, and an m data branch in sequence, so that the first data branch, the second data branch, …, and the m data branch constitute a spiral chain structure;
a block extraction unit, configured to instruct to extract one branched block from the first data branched chain, the second data branched chain, …, and the mth data branched chain respectively according to a preset block extraction method, so as to obtain m branched blocks;
and the data link entering unit is used for indicating that a new main chain block is generated according to the data in the m branched chain blocks, and the new main chain block is connected to the front main chain block in the appointed block chain so as to finish the data link entering process.
7. A computer device comprising a memory and a processor, the memory storing a computer program, wherein the processor implements the steps of the method of any one of claims 1 to 5 when executing the computer program.
8. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 5.
CN202110839301.3A 2021-07-23 2021-07-23 Data chaining method and system of block chain with spiral chain structure Withdrawn CN113568910A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110839301.3A CN113568910A (en) 2021-07-23 2021-07-23 Data chaining method and system of block chain with spiral chain structure

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110839301.3A CN113568910A (en) 2021-07-23 2021-07-23 Data chaining method and system of block chain with spiral chain structure

Publications (1)

Publication Number Publication Date
CN113568910A true CN113568910A (en) 2021-10-29

Family

ID=78167038

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110839301.3A Withdrawn CN113568910A (en) 2021-07-23 2021-07-23 Data chaining method and system of block chain with spiral chain structure

Country Status (1)

Country Link
CN (1) CN113568910A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114884976A (en) * 2022-03-21 2022-08-09 杭州锘崴信息科技有限公司 Block chain structure generation method, block chain structure, electronic device and storage medium

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114884976A (en) * 2022-03-21 2022-08-09 杭州锘崴信息科技有限公司 Block chain structure generation method, block chain structure, electronic device and storage medium
CN114884976B (en) * 2022-03-21 2024-01-30 杭州锘崴信息科技有限公司 Block chain structure generation method, block chain structure, electronic device, and storage medium

Similar Documents

Publication Publication Date Title
CN112783940B (en) Multi-source time sequence data fault diagnosis method and medium based on graph neural network
Lee et al. Fault detection based on one-class deep learning for manufacturing applications limited to an imbalanced database
CN109324266B (en) Distribution network ground fault analysis method based on deep learning
CN103617469A (en) Equipment failure prediction method and system of electrical power system
CN113092935B (en) Method, system, equipment and storage medium for identifying small-load line topology
CN110672905A (en) CNN-based self-supervision voltage sag source identification method
CN113095173B (en) Photovoltaic system fault arc detection method for integrating Adaboost with multiple classifiers
CN113568910A (en) Data chaining method and system of block chain with spiral chain structure
Moustakides Decentralized CUSUM change detection
CN115015683B (en) Cable production performance test method, device, equipment and storage medium
CN115800272A (en) Power grid fault analysis method, system, terminal and medium based on topology identification
CN116108202A (en) Mining system data attack behavior modeling method based on relational graph
CN113935443B (en) Heterogeneous equipment multi-domain joint fault prediction method, device, terminal and storage medium
CN116401532A (en) Method and system for recognizing frequency instability of power system after disturbance
CN110794254A (en) Power distribution network fault prediction method and system based on reinforcement learning
CN113204619B (en) Sentence completion method, device, equipment and medium based on natural language processing
Zhang et al. Adaptive failure prediction using long short-term memory in optical network
CN112819386A (en) Method, system and storage medium for generating time series data with abnormity
CN106019043B (en) Power grid fault diagnosis method based on fuzzy integral multi-source information fusion theory
CN116560341A (en) Industrial robot fault diagnosis model and fault diagnosis method
CN113259218B (en) Internet of things transmission method and device of ring area network topological structure
De Santis et al. A learning intelligent system for fault detection in smart grid by a one-class classification approach
CN113570003A (en) Feature fusion defect detection method and device based on attention mechanism
CN110765454B (en) Running state reconstruction method of power system and terminal
CN113568962A (en) Block chain data tracing method and system based on umbrella-shaped cross chains

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
WW01 Invention patent application withdrawn after publication

Application publication date: 20211029

WW01 Invention patent application withdrawn after publication