CN110765495A - Block chain structure generation and forgetting safe storage method - Google Patents
Block chain structure generation and forgetting safe storage method Download PDFInfo
- Publication number
- CN110765495A CN110765495A CN201910534580.5A CN201910534580A CN110765495A CN 110765495 A CN110765495 A CN 110765495A CN 201910534580 A CN201910534580 A CN 201910534580A CN 110765495 A CN110765495 A CN 110765495A
- Authority
- CN
- China
- Prior art keywords
- block
- created
- value
- blocks
- deleting
- 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.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/70—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
- G06F21/78—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure storage of data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
Abstract
The invention provides a block chain structure generation and forgetting safe storage method, which comprises the step that a created block is created by a created block, and is characterized by further comprising a block value self-checking mechanism, wherein the block value self-checking mechanism is used for judging the value of the block, deleting the block and regenerating a new block chain when the value of the block exceeds a set threshold value. The memorable block chain storage mechanism greatly reduces the storage requirement, and enhances the stability and the safety of a block chain system, thereby ensuring the long-term operation of the storage equipment of the Internet of things.
Description
Technical Field
The invention relates to the technical field of block chains, in particular to a block chain structure, a generation method and a transaction verification method of a block chain technology capable of being forgotten, so that the problem that the data volume of the Internet of things is huge but the storage space of the block chain is limited is reliably solved.
Background
With the access and successful application of more and more internet of things devices, more and more data correspondingly generated by the internet of things are generated. The IDC research predicts that the data volume generated by the internet of things will reach 4.4ZB by 2020. It is expected that by 2025, a person will interact with an internet device an average of approximately 4800 times per day, and an average of once every 18 seconds. The data volume of the countries in the world reaches 163ZB, which is 10 times of the current data volume. In addition, more than 25% of the data will be created in real time. If the data of the Internet of things are stored in the block chain, the data can be guaranteed not to be tampered and damaged. However, the blockchain itself is very memory resource consuming. Therefore, with the proliferation of the use of the internet of things network, the longer the running time is, the longer the block chain database for the internet of things will be, and huge storage cost is brought to a user running a complete block chain node. Especially, when a large amount of malicious sensing equipment of the internet of things continuously uploads data to the block chain, the problem of block chain storage is more serious.
Therefore, as data in the internet of things may grow exponentially, existing block chain technology obviously cannot be used for storing raw data of the internet of things. On the other hand, however, the lifetime of the internet of things devices is limited, and therefore, permanently saving the data it produces is not of practical value in the blockchain. Also historical data of a long time ago is not valuable by itself, for example, the retention period of street video data does not exceed 1 year. A novel solution is to discard those old blocks that are worthless and keep only the new blocks that are valuable.
Disclosure of Invention
The invention aims to overcome the defects and shortcomings of the prior art, and provides a novel block chain forgetting technology and a fragment storage mechanism by combining the characteristics of limited storage and calculation capacity of the Internet of things equipment, so that valuable data are discarded, and the problem that the storage space of the block chain is limited due to large data volume of the Internet of things is reliably solved.
The block chain structure generation and forgetting safe storage method comprises the step that a created block is created by a created block, and is characterized by further comprising a block value self-checking mechanism, wherein the block value self-checking mechanism is used for judging the value of the block, deleting the block when the value of the block exceeds a set threshold value, and regenerating a new block chain.
Further, the method specifically comprises the following steps,
step one, establishing a block value self-checking mechanism;
step two, in an initialization stage, assuming that 2N equivalent network nodes exist in the block chain network, initializing the whole network, and realizing consensus on the block value self-checking mechanism in the step one in the whole block chain network;
step three, creating a new block value self-checking stage: the miners judge the value of all events or transactions in the created blocks based on the block value self-checking mechanism described in the step one; if more than 50% of events or transaction values in the created block are less than or equal to 0, judging the created block as a memorable block;
step four, a new block generation stage: the event and transaction with the value greater than 0 in the original block are repackaged into a new block by spacious workers, and a new block is added to more than 51% of nodes in the whole network by means of node-node multicast and broadcast, so that consensus is finally realized in the whole network;
step five, block deleting stage: and deleting the original created blocks by spacious workers, and deleting the original created blocks by nodes above N +1 of the whole network by means of node-node multicast and broadcast, so that consensus is realized in the whole network finally, and the aim of deleting the worthless created blocks is fulfilled. The next block of the original created block automatically becomes the new created block.
Further, in the third step, if more than 50% of the events or transactions in the created block have a value greater than 0, determining that the created block is a memorable block; and returning to the step three after waiting for a certain time, and continuing to perform value self-inspection.
Compared with the prior art, the invention has the following technical effects:
internet of things devices are constantly generating large amounts of data, and storing such data on blockchains can be an extremely significant challenge. According to the invention, on the premise of ensuring the data security of the Internet of things and resisting the denial of attacks, a lightweight storage model suitable for the Internet of things is established, the storage requirement is greatly reduced by utilizing a memorable block chain storage mechanism, and the stability and the security of a block chain system are enhanced, so that the long-term operation of the storage equipment of the Internet of things is ensured.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a diagram of a blockchain changing from one state to another in one embodiment of the present invention;
fig. 2 is a flow chart of deleting blocks from a blockchain according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
As shown in fig. 1 and fig. 2, the invention relates to a novel block chain forgetting technique and a fragment storage method, comprising the following steps:
step one, establishing a block value self-checking mechanism (different scenes, different block value self-checking mechanisms)
Step two, an initialization stage: assume that there are 2N peer network nodes in the blockchain network. Initializing the whole network, and agreeing on the block value self-checking mechanism in the step one in the whole block chain network.
Step three, creating a new block value self-checking stage: and (4) judging the value of all events or transactions in the created blocks by miners based on the block value self-checking mechanism described in the step one. If more than 50% of the events or transactions in the created block have a value less than or equal to 0, the created block is determined to be a memorable block, and the step four is performed. Otherwise, go to step six.
Step four, a new block generation stage: and repackaging the events and transactions with the value greater than 0 in the original blocks into a new block by spacious workers, and increasing a new block by more than 51% of nodes in the whole network by means of node-node multicast and broadcast, thereby finally realizing consensus in the whole network.
Step five, block deleting stage: and deleting the original created blocks by spacious workers, and deleting the original created blocks by nodes above N +1 of the whole network by means of node-node multicast and broadcast, so that consensus is realized in the whole network finally, and the aim of deleting the worthless created blocks is fulfilled. The next block of the original created block automatically becomes the new created block.
Step six, a delay rechecking stage: and returning to the step three after waiting for a certain time, and continuing to perform value self-inspection.
Preferably, the block value self-checking mechanism described in the step one is different according to different application scenarios:
case 1, timeline: the longer the event, the smaller the block value. For example, the on and off events of the intelligent lamp in the internet of things before months do not cause any significant influence on the state of the existing system.
Case 2, successor node: the internet of things events tend to be continuous and stateful. Taking the example of controlling a smart device, the system changes to a state at a certain time, which is often not much related to the previous state, and we are more concerned about the current state, or the recent state.
Case 3, importance of the event itself. Fatal car accident events such as the camera shooting at traffic intersections are more valuable than red light running events.
Preferably, the third step specifically comprises:
1. if more than 50% of the events or transactions in the created block have a value greater than 0, then the block is a valuable block.
2. If the value of all events or transactions in the created block is less than or equal to 0, the created block is determined to be a completely forgotten block. The miners can delete the original created block completely, and the next block automatically becomes a new created block.
3. If more than 50% of the events or transactions in the created block have a value less than or equal to 0, the created block is determined to be a partially forgotten block. Miners may delete the original blocks, repackage the valuable events or transactions into a new block, and add it to the block chain.
Finally, it is to be noted that: the above description is only a preferred embodiment of the present invention, and is only used to illustrate the technical solutions of the present invention, and not to limit the protection scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.
Claims (3)
1. A block chain structure generation and forgetting safe storage method comprises creating a created block by a created block, and is characterized by further comprising a block value self-checking mechanism, wherein the block value self-checking mechanism is used for judging the value of the block, deleting the block and regenerating a new block chain when the value of the block exceeds a set threshold value.
2. The method of claim 1, wherein the method comprises the steps of,
step one, establishing a block value self-checking mechanism;
step two, in an initialization stage, assuming that 2N equivalent network nodes exist in the block chain network, initializing the whole network, and realizing consensus on the block value self-checking mechanism in the step one in the whole block chain network;
step three, creating a new block value self-checking stage: the miners judge the value of all events or transactions in the created blocks based on the block value self-checking mechanism described in the step one; if more than 50% of events or transaction values in the created block are less than or equal to 0, judging the created block as a memorable block;
step four, a new block generation stage: the event and transaction with the value greater than 0 in the original block are repackaged into a new block by spacious workers, and a new block is added to more than 51% of nodes in the whole network by means of node-node multicast and broadcast, so that consensus is finally realized in the whole network;
step five, block deleting stage: and deleting the original created blocks by spacious workers, and deleting the original created blocks by nodes above N +1 of the whole network by means of node-node multicast and broadcast, so that consensus is realized in the whole network finally, the aim of deleting the worthless created blocks is fulfilled, and the next block of the original created blocks automatically becomes a new created block.
3. The method according to claim 1, wherein in the third step, if more than 50% of the created blocks have events or transactions with a value greater than 0, the created blocks are determined to be memorable blocks; and returning to the step three after waiting for a certain time, and continuing to perform value self-inspection.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910534580.5A CN110765495A (en) | 2019-06-20 | 2019-06-20 | Block chain structure generation and forgetting safe storage method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910534580.5A CN110765495A (en) | 2019-06-20 | 2019-06-20 | Block chain structure generation and forgetting safe storage method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110765495A true CN110765495A (en) | 2020-02-07 |
Family
ID=69329322
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910534580.5A Pending CN110765495A (en) | 2019-06-20 | 2019-06-20 | Block chain structure generation and forgetting safe storage method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110765495A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111541540A (en) * | 2020-07-07 | 2020-08-14 | 杭州云链趣链数字科技有限公司 | Data processing method and device for block chain privacy protection and computer equipment |
| CN111708737A (en) * | 2020-05-21 | 2020-09-25 | 湖南天河国云科技有限公司 | Block chain-based content distribution control method and device for distributed file system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109391643A (en) * | 2017-08-03 | 2019-02-26 | 中国移动通信有限公司研究院 | Block chain light-weight technologg method, block chain node and storage medium |
| CN109474675A (en) * | 2018-10-18 | 2019-03-15 | 尚维斯 | A kind of block height split blade type date storage method based on block chain |
| CN109819013A (en) * | 2018-12-11 | 2019-05-28 | 上海大学 | A kind of block chain memory capacity optimization method based on cloud storage |
-
2019
- 2019-06-20 CN CN201910534580.5A patent/CN110765495A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109391643A (en) * | 2017-08-03 | 2019-02-26 | 中国移动通信有限公司研究院 | Block chain light-weight technologg method, block chain node and storage medium |
| CN109474675A (en) * | 2018-10-18 | 2019-03-15 | 尚维斯 | A kind of block height split blade type date storage method based on block chain |
| CN109819013A (en) * | 2018-12-11 | 2019-05-28 | 上海大学 | A kind of block chain memory capacity optimization method based on cloud storage |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111708737A (en) * | 2020-05-21 | 2020-09-25 | 湖南天河国云科技有限公司 | Block chain-based content distribution control method and device for distributed file system |
| CN111541540A (en) * | 2020-07-07 | 2020-08-14 | 杭州云链趣链数字科技有限公司 | Data processing method and device for block chain privacy protection and computer equipment |
| CN111541540B (en) * | 2020-07-07 | 2020-09-29 | 杭州云链趣链数字科技有限公司 | Data processing method and device for block chain privacy protection and computer equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110113328B (en) | Software defined opportunistic network DDoS defense method based on block chain | |
| US10630463B2 (en) | Meta block chain | |
| CN106407430B (en) | A kind of intelligent contract state synchronization method of complexity based on stage bucket | |
| CN107888695B (en) | The method and cloud platform equipment of cloud platform creation mirror image | |
| CN110765495A (en) | Block chain structure generation and forgetting safe storage method | |
| KR20070122045A (en) | Realtime stateful packet inspection method and apparatus for thereof | |
| CN101009660B (en) | Universal method and device for processing the match of the segmented message mode | |
| CN106462612A (en) | Systems and methods for fault tolerant communications | |
| JP2020524434A (en) | Method and special network node for high speed propagation in blockchain networks | |
| CN101183988A (en) | Method of identifying packet corresponding service types and device thereof | |
| CN109492049B (en) | Data processing, block generation and synchronization method for block chain network | |
| CN104811473B (en) | A kind of method, system and management system for creating virtual non-volatile storage medium | |
| CN109063437A (en) | A kind of asset of equipments operation audit method, device, equipment and readable storage medium storing program for executing | |
| Greco et al. | Efficient computation of deterministic extensions for dynamic abstract argumentation frameworks | |
| CN112087530B (en) | Method, device, equipment and medium for uploading data to block chain system | |
| CN102420771A (en) | Method for increasing concurrent transmission control protocol (TCP) connection speed in high-speed network environment | |
| CN105898204A (en) | Intelligent video recorder enabling video structuralization | |
| CN112765137B (en) | Block synchronization method based on block distributed block chain and electronic equipment | |
| CN109688126B (en) | Data processing method, network equipment and computer readable storage medium | |
| CN114048201A (en) | Distributed stream computing engine Flink-based key field real-time deduplication method | |
| CN113645233A (en) | Wind control intelligent decision method and device for flow data, electronic equipment and medium | |
| CN108596557A (en) | A kind of method and system for realizing event flow based on tree | |
| WO2023142605A1 (en) | Blockchain-based data processing method and related apparatus | |
| CN116015796A (en) | Flow table updating method and device, firewall equipment and storage medium | |
| CN111327669A (en) | Decentralized block chain solution method |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20200207 |