CN108462582B - Feedback processing method and device in block chain - Google Patents
Feedback processing method and device in block chain Download PDFInfo
- Publication number
- CN108462582B CN108462582B CN201810136655.XA CN201810136655A CN108462582B CN 108462582 B CN108462582 B CN 108462582B CN 201810136655 A CN201810136655 A CN 201810136655A CN 108462582 B CN108462582 B CN 108462582B
- Authority
- CN
- China
- Prior art keywords
- block
- existing
- feedback control
- data
- transaction data
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9015—Buffering arrangements for supporting a linked list
Abstract
The embodiment of the invention provides a feedback processing method and a device in a block chain, wherein the method comprises the following steps: responding to generation of a new block which carries out feedback control on transaction data of an existing block in a block chain, calculating the data in the new block through an irreversible algorithm to obtain a check value, writing the check value of the new block into the existing block, and forming a reverse link pointing from the new block to the existing block; feedback control logic to identify the new tile to the transactional data in the existing tile; newly added data in a reverse linked blockchain forming feedback control logic is broadcast to a blockchain network. The scheme of the embodiment of the invention can form the feedback control logic for performing feedback operation on the past existing blocks according to the current block in the block chain based on the reverse link relation of the block chain.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a feedback processing method and apparatus in a block chain.
Background
As shown in fig. 1, the structure of the block chain in the prior art is extended in a chain-like unidirectional manner, and the subsequent block writes a Hash value (Hash) calculated based on the content of the previous block into the block header of the subsequent block, so as to form a logical relationship with the previous block. As new data is generated, the blockchain is continuously extended forward in the direction of the arrow, and an irreversible chain of data records is formed through the relation of hash values between blocks.
In the logic system of the block chain, only the forward development content and trend of the data can be reflected and recorded. However, in practice, there are many variations and relationships in the generation and development of data content, and the simple front-to-back recording logic inevitably limits the development of blockchain data.
Disclosure of Invention
The invention provides a feedback processing method and a feedback processing device in a block chain, which can form feedback control logic for performing feedback operation on past existing blocks according to a current block in the block chain based on a reverse link relation of the block chain.
In order to achieve the above purpose, the embodiment of the invention adopts the following technical scheme:
in a first aspect, a method for processing feedback in a blockchain is provided, including:
responding to generation of a new block which carries out feedback control on transaction data of an existing block in a block chain, calculating the data in the new block through an irreversible algorithm to obtain a check value, writing the check value of the new block into the existing block, and forming a reverse link pointing from the new block to the existing block; feedback control logic to identify the new tile to the transactional data in the existing tile;
newly added data in a reverse linked blockchain forming feedback control logic is broadcast to a blockchain network.
In a second aspect, a feedback processing apparatus in a blockchain is provided, including:
the verification value calculation module is used for responding to the generation of a new block which carries out feedback control on the transaction data of the existing block in the block chain, and calculating the data in the new block through an irreversible algorithm to obtain a verification value;
a block linking module, configured to write the check value of the new block into the existing block, and form a reverse hash link pointing from the new block to the existing block; feedback control logic to identify the new tile to the transactional data in the existing tile;
and the data broadcasting module is used for broadcasting the newly added data in the reverse-linked block chain with the feedback control logic to the block chain network.
The feedback processing method and the device in the block chain can form feedback control logic for performing feedback operation on past existing blocks according to the current block in the block chain based on the reverse link relation of the block chain.
The foregoing description is only an overview of the technical solutions of the present application, and the present application can be implemented according to the content of the description in order to make the technical means of the present application more clearly understood, and the following detailed description of the present application is given in order to make the above and other objects, features, and advantages of the present application more clearly understandable.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the application. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
FIG. 1 is a schematic diagram of a block chain of the prior art;
FIG. 2 is a diagram illustrating a reverse link structure according to an embodiment of the present invention;
FIG. 3 is a flowchart of a feedback processing method in a blockchain according to an embodiment of the present invention;
FIG. 4 is a block diagram of a bi-directional block chain structure according to an embodiment of the present invention;
FIG. 5 is a block diagram of a ring block chain structure according to an embodiment of the present invention;
FIG. 6 is a block diagram of a chain bi-directional block chain structure according to an embodiment of the present invention;
fig. 7 is a schematic structural diagram of a feedback processing apparatus in a block chain 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.
The blockchain was originally proposed with the generation of bitcoins, and therefore, in describing data related to the blockchain, expressions such as transaction data and ledger are adopted, and with the development of blockchain technology, information and data that can be recorded by the blockchain technology is not limited to transaction data in the conventional sense, but can be used to record any information and data. Therefore, in the embodiment of the present invention, the transaction data refers to a piece of information, data, an instruction, or the like, and the ledger refers to an aggregate made up of a plurality of transaction data.
The blockchain is a data storage structure formed by a plurality of blocks and encrypted by a blockchain technology, and the blockchain network is a network formed by a plurality of nodes for realizing the blockchain technology. The nodes in the blockchain network can be servers or terminal equipment with a function of processing blockchain data in the internet. Each node in the blockchain performs functions such as accounting for transaction data (writing transaction data to the blockchain), linking a new blockchain to an existing blockchain, and storing and verifying the blockchain.
The basic principle of the embodiment of the invention is as follows: the nodes are instructed to establish reverse links by including transaction data for closing existing tiles in the tile chain, and the reverse links are established at the moment after a new tile is generated. The reverse link is established by writing the check value calculated by the irreversible algorithm on the data of the new block into the previous existing block, thereby establishing a reverse link from the new block to the existing block. In the embodiment of the present invention, the transaction data including the existing block in the feedback control block chain may be in the form of an instruction, and when the node in the block chain acquires the transaction data, it can recognize that the processing indicated in the transaction data is to establish a reverse link, so that after a new block is generated, the processing of establishing the reverse link is triggered.
It should be noted that, in the embodiment of the present invention, the link between the blocks is a logical link, and this link relationship is embodied by a verification mechanism in the block chain. In a conventional blockchain, a check value generated based on a previous block is recorded in a blockhead of a subsequent block, and the block is continuously extended forward based on such a mechanism, so that a blockchain with a link direction always going forward is formed.
As shown in fig. 2, the blockchain includes a reverse link pointing to block 3 from block4, that is, the block header of block 3 includes a check value Hash2 of block4, the content of block 3 is modified due to establishment of the reverse link, and when verifying block 3 using the check value recorded in block4, since a Hash2 occurs in the block header of block 3, the check value calculated based on modified block 3 is not equal to the check value recorded in the block header of block4, and thus a verification error occurs.
Through this authentication mechanism, the presence of a reverse link can be identified. In practical application, a data area for filling a reverse check value can be reserved in the block header of each block, so that in the subsequent verification process, when data exists in the area, the fact that the block has a reverse link can be known, then, each block behind the block is verified based on the data, the check value calculated based on which block is found, and then, a complete reverse link relation can be known.
For identifying reverse links, this can also be done by way of blockchain error tables. The blockchain error table, which may be maintained by a supervisory node managing the blockchain network, is intended to perform the necessary modifications to the blockchain, which are done under the supervision of the supervisory node, thereby ensuring the accuracy of the blockchain data.
The modification of each block in the blockchain may be recorded in a blockchain error table corresponding to the blockchain, where the specific location (block number, row number and column number of data in the block, etc.) where the modification is located, and information or data before and after the modification are recorded in the blockchain error table. In the verification process, if the verification fails, the error table can be inquired to determine whether the block which fails to pass the verification has modification, if so, the block can be verified again by using the data or information before the modification, and if so, the block can be confirmed to be allowed to modify and not be tampered maliciously. In addition, in the blockchain error checking table, it may further record whether the modification is reverse link modification, and specifically, based on which block the generated check value and other information, so as to identify the reverse link logical relationship.
The technical solution of the present application is further illustrated by the following examples.
Example one
Based on the above scheme idea of the reverse link structure in the block chain and the corresponding data processing, as shown in fig. 3, it is a flowchart of a feedback processing method in the block chain shown in the embodiment of the present invention, and an execution main body of the method may be a processing node in the block chain. As shown in fig. 3, the feedback processing method in the blockchain includes:
s310, responding to the generation of a new block which carries out feedback control on the transaction data of the existing block in the block chain, and calculating the data in the new block through an irreversible algorithm to obtain a check value.
S320, writing the check value of the new block into the existing block to form a reverse link pointing from the new block to the existing block; to identify the new tile to the feedback control logic of the transaction data in the existing tile.
In the process of generating a new block by extending a block chain, if transaction data used for performing feedback control on an existing block is stored in the current new block, after the new block is generated, calculating the data in the new block through an irreversible algorithm to obtain a check value, and writing the check value of the new block into the existing block, thereby forming a reverse link. The reverse link is used for identifying that the transaction data in the existing block is under the feedback control of the transaction data in the new block and presents a different data form than before.
The irreversible algorithm may be a hash algorithm, and the corresponding check value is a hash value.
The feedback control of the transaction data of the existing blocks in the block chain may include, but is not limited to, the following control operations:
1. opening transaction data for existing blocks in block chain
The fact that the transaction data are opened means that the transaction data are valid, and a new block corresponding to new transaction data can be generated based on the opened transaction data.
For example, based on the above concept of reverse link structure in the block chain, a schematic diagram of a bi-directional block chain structure as shown in fig. 4 can be formed, which includes: at least one bidirectional chain (such as the bidirectional chain of Block2 and Block4 in fig. 4);
the bidirectional chain is formed by sequentially linking a previous Block (such as Block2) and a subsequent Block (such as Block4) in two opposite directions, and the data in the subsequent Block is stored in the previous Block and is subjected to a check value calculated by an irreversible algorithm. For example, the irreversible algorithm may be a hash algorithm, and the corresponding check value is a hash value.
Here, the sequential linking of a previous Block and a subsequent Block in two opposite directions means that, in a direction in which the Block chain normally extends from front to back, a subsequent Block serving as a child Block is generated based on the previous Block extending as a parent Block, and then a backward link is formed in which the subsequent Block points to the previous Block, so that a chain having bidirectional links is formed like Block2 and Block4 in fig. 4.
Although the two blocks are a parent Block and a child Block in theory, check values obtained by irreversible algorithm of data in the other Block are stored in Block headers of the two blocks, which seems contradictory, because the links in the two directions are generated sequentially, logical confusion is not caused, that is, when Block4 is generated, the check values of the data in Block2 are obtained by irreversible algorithm and recorded in the Block header of Block4, and then check values of all the data in Block4 containing the check values of Block2 are obtained by irreversible algorithm and recorded in the Block header of Block 2. In other words, Block2 stores the parity of the original parent Block and the parity of the child Block 4.
In fact, the bi-directional chain structure can be regarded as two adjacent blocks, and is formed by forming a link in the direction of normal extension (Block2 → the directional link of Block4) and then forming a link in the direction opposite to the direction of normal extension (Block4 → the directional link of Block 2).
Based on the logic that when the reverse link is formed, the previous block in the two blocks having the reverse link relationship needs to be modified, so that the verification cannot pass, the transaction data in the previous block can be set to be in a closed state (i.e. the transaction data is not available) when being formed, and the transaction data is set to be turned on (i.e. the transaction data is available) after the reverse link is formed.
Based on the opened logical relationship of the data, the opened logical relationship can be expanded in the formed bidirectional chain. For example, after the transaction data in the previous block is opened, the transaction data in the other blocks linked to the previous block are also opened synchronously in the bidirectional link.
For example, in the field of asset processing, there may be a need for: a batch of assets is sold in a designated block set, but the assets are in an invalid state initially, and after a certain condition is met, a special transaction is executed in a subsequent block, and all the assets in the previous designated block are started. The above condition may be that a certain period of time passes, for example, for some commodities that are still in the quality inspection period, the commodities have the value of selling after the quality inspection passes. Alternatively, the condition may be a change in the form of the asset (initialization to invalid) which, when it occurs, triggers the asset to enter a valid state by means of special transaction data.
In this case, a reverse link may be triggered by a special transaction data to open the transaction data in the previous designated block, so that the assets of the previous block are changed from invalid to valid.
2. Closing transaction data of existing blocks in block chain
The transaction data is closed, that is, the transaction data is invalid, and a new block corresponding to new transaction data can not be generated based on the closed transaction data.
For example, based on the above concept of reverse link structure in block chain, a schematic diagram of a circular block chain structure as shown in fig. 5 can be formed, which includes:
at least one endless chain (such as the endless chain of blocks Block2, Block4, and Block5 in fig. 5);
the circular chain is formed by sequentially linking a plurality of blocks along the same surrounding direction, and the head Block (such as Block2) of the circular chain stores a check value obtained by calculating the data in the tail Block (such as Block5) of the circular chain through an irreversible algorithm. For example, the irreversible algorithm may be a hash algorithm, and the corresponding check value is a hash value.
In practice, the circular chain structure can be regarded as being composed of a normally extended blockchain portion (blockchain portion of Block2 → Block4 → Block5) and a reversely linked blockchain portion (blockchain portion of Block5 → Block2) with a following Block pointing to a preceding Block.
Based on the logic that the previous block in the two blocks having the reverse link relationship needs to be modified when the reverse link is formed, so that the verification cannot pass, it can be determined that the data in the previous block is invalid, i.e. the transaction data is closed. Based on the closed logical relationship of the data, the closed logical relationship can be expanded in the formed ring chain. For example, the transaction data in only the head block in the circular chain is set to be closed, or the transaction data in all blocks in the circular chain is set to be closed, or when other blocks are also linked in the circular chain, the transaction data in the other blocks are also synchronously closed, and the like.
For example, in the field of asset processing, there may be a need for: a lot of assets are distributed in a designated block set, and after a certain condition is met, a special transaction is executed in a subsequent block, and all the assets in the previous designated block are invalidated. The condition may be that a certain period of time has elapsed, for example, for some commodities with a shelf life, the commodity has no value after the shelf life. Alternatively, the condition may be a change in the form of the asset, which when it occurs triggers the asset's revocation by means of special transaction data.
In this case, the transaction data in the previous designated block can be invalidated by triggering the establishment of a reverse link through a special transaction data, thereby revoking the assets of the previous block.
3. Feedback control of transaction data in other blocks through existing blocks in block chain
The feedback control of the transaction data in other blocks through the existing blocks in the block chain means that the block operated by the feedback control is not completed by directly establishing a reverse link with a new block, but needs to realize feedback layer by means of the transaction data content of other blocks, and the final result of the feedback operation can be to open the service data in the target block or to close the service data in the target block.
For example, based on the above concept of reverse link structure in block chain, a schematic diagram of chain bidirectional block chain structure as shown in fig. 6 can be formed, which includes: at least one chain bidirectional chain (such as the chain bidirectional chain of Block2, Block4 and Block5 in fig. 6);
the chain bidirectional chain is formed by sequentially linking a plurality of blocks in two opposite directions, and in the link direction formed later (such as the direction from Block5 → Block4 → Block2 in fig. 6), each previous Block sequentially stores a check value calculated by an irreversible algorithm on data in a Block subsequent to the previous Block. For example, the irreversible algorithm may be a hash algorithm, and the corresponding check value is a hash value.
Here, the sequential linking of a plurality of blocks in two opposite directions means that a chain having bidirectional links is formed by first generating a following Block as a child Block based on a preceding Block extension as a parent Block in a direction in which a Block chain normally extends from front to back, and then forming a reverse link in which the following Block points to the preceding Block, like a previously-formed link direction of Block2 → Block4 → Block5 and a subsequently-formed link direction of Block5 → Block4 → Block2 in fig. 6. And the definition of the previous blocks is always defined according to the time sequence of the normal generation of the blocks, namely, according to the link direction formed in advance, such as that in fig. 6, Block2 and Block4 are always previous blocks of Block5, and Block2 is always previous blocks of Block 4.
Accordingly, in the link direction formed later (the direction of Block5 → Block4 → Block2 in fig. 6), each previous Block sequentially stores a check value calculated by an irreversible algorithm on the data in the Block subsequent to the previous Block, that is, the check value of Block5 is stored in Block4, and the check value of Block4 is stored in Block 2.
Although two adjacent blocks in the theoretical uplink bidirectional chain are parent and child blocks, check values obtained by irreversible algorithm of data in the other block are stored in the block heads of the two blocks, which seems contradictory, the links in the two directions are generated in sequence, and logical confusion is not caused. For example, according to the previously formed link direction, when generating Block4, the data in Block2 is processed by an irreversible algorithm to obtain a check value, and the check value is recorded in the Block header of Block 4; then, in the link direction formed later, all data in Block4 containing the check values of Block2 and Block5 are subjected to an irreversible algorithm to obtain a check value, and the check value is recorded in the Block header of Block 2. In other words, Block2 stores the parity of the original parent Block and the parity of the child Block 4.
In practice, the chain bidirectional link structure can be regarded as a plurality of sequentially adjacent blocks, and is configured by first forming links (pointing links of Block2 → Block4 → Block5) in a direction of normal extension (a previously formed link direction), and then forming links (pointing links of Block5 → Block4 → Block2) in a direction opposite to the direction of normal extension (a subsequently formed link direction).
Based on the logic that when the reverse link is formed, the previous block in the two blocks having the reverse link relationship needs to be modified, so that the verification cannot pass, the transaction data in the previous block can be set to be in a closed state (i.e. the transaction data is not available) when being formed, and the transaction data is set to be turned on (i.e. the transaction data is available) after the reverse link is formed. Based on this logical relationship in which data is turned on, each preceding block is turned on in turn in the direction of the link formed later as a result of forming a reverse link relationship with the following block, and the transaction data in the head-end block in the chained bidirectional chain is finally turned on. The opened logical relationship can be expanded in the formed chain type bidirectional chain. For example, when the transaction data in the first block is started, the transaction data in other blocks linked to the first block is also started synchronously.
From the analysis in the process, the reverse link of Block5 → Block4, and the corresponding feedback control is that the transaction data in Block2 is opened through Block4 (the reverse link of Block4 → Block2 is established).
For example, in the field of asset processing, there may be a need for: a batch of assets is sold in a designated block set, but the assets are in an invalid state initially, and after a certain condition is met, a special transaction is executed in a subsequent block, and all the assets in the previous designated block are started. The above condition may be that a certain period of time passes, for example, for some commodities that are still in the quality inspection period, the commodities have the value of selling after the quality inspection passes. Alternatively, the condition may be a change in the form of the asset (initialization to invalid) which, when it occurs, triggers the asset to enter a valid state by means of special transaction data.
In this case, a plurality of reverse links can be established layer by triggering of a special transaction data until the special transaction data is linked to the designated block containing the asset, and then the transaction data in the previous designated block is subjected to starting processing, so that the asset of the previous block is changed from an invalid state to a valid state.
It should be noted that, the transaction data for opening the previous block may also be recorded in the blocks located at the non-head and end in the chain bidirectional chain as shown in fig. 6, and only these transaction data are in the closed state after being initially established, and only after the block and the block linked to the next block form a reverse link, the transaction data in the next block is opened, and after the transaction data in the block is opened, the reverse link relationship between the block and the block linked to the previous block may be continuously established, so as to open the transaction data in the previous block; or, the partial transaction data for opening the first block can be recorded in the blocks which are not at the head and tail ends in the chain bidirectional chain, and the last partial transaction data for opening the head end block is recorded in the tail end block, so that after the tail end block is formed, the transaction data which are in reverse link with the previous block can be sequentially transmitted from the tail end block, and finally the transaction data in the head end block are opened.
It can be seen that, the end block in the chain bidirectional chain is the block where the last part of transaction data of each block in the whole chain bidirectional chain is opened, the transaction data in the previous block can be opened sequentially only after the block is created, or the opening operation is sequentially transmitted forward to the head end block through the reverse link, and the transaction data in the head end block in the chain bidirectional chain is the last opened data.
S330, broadcasting the newly added data in the reverse-linked block chain with the feedback control logic to the block chain network.
Since the reverse link formed as described above involves modification of the previous existing block, after the node generates the new block, it is necessary to broadcast not only the new block but also new data in the existing block to the blockchain network, so as to verify and confirm the final blockchain through the consensus mechanism of multiple nodes.
Further, in order to show the blocks which are feedback-controlled by the new block through the reverse link and the feedback control logic more clearly, the number of the existing block which is feedback-controlled and the feedback control information, such as the logic operation of controlling the transaction data in the existing block to be turned on and off, or the logic operation of turning on the existing block to control the data in other blocks with the specified block number to be turned on and off, may be recorded in the transaction data of the new block.
Further or alternatively, in order to show the feedback-controlled blocks and the feedback control logic of the new blocks through reverse linking more clearly, the numbers of the feedback-controlled new blocks and the feedback control information, such as the logic operation for controlling the on/off of the transaction data in the existing blocks, may be recorded in the transaction data of the feedback-controlled existing blocks; or opening the existing block to control the logic operation of opening and closing data in the blocks with other specified block numbers; or directly executing the operation of modifying the transaction data in the existing block.
The feedback processing method in the block chain of the embodiment of the invention is based on the reverse-linked block pointing relationship, and can realize the feedback control logic of the transaction data in the existing blocks in the block chain based on the transaction data in the newly generated blocks.
Further, the feedback control may include: and opening the transaction data in the existing blocks in the block chain, closing the transaction data in the existing blocks in the block chain and performing feedback control operation on other blocks through the existing blocks.
Example two
As shown in fig. 7, which is a schematic structural diagram of a feedback process in a block chain according to an embodiment of the present invention, the apparatus may be a server disposed in a network, and configured to execute the method steps shown in the first embodiment. As shown in fig. 7, the feedback processing means in the block chain includes:
the verification value calculation module 710 is configured to, in response to generation of a new block including feedback control on transaction data of an existing block in the block chain, calculate data in the new block through an irreversible algorithm to obtain a verification value;
a block linking module 720, configured to write the check value of the new block into the existing block, and form a reverse hash link pointing from the new block to the existing block; feedback control logic to identify the new block to the transaction data in the existing block;
the data broadcasting module 730 is configured to broadcast the newly added data in the reverse-linked blockchain forming the feedback control logic to the blockchain network.
Further, the feedback control includes: and starting the transaction data of the blocks in the block chain.
Further, the feedback control includes: closing the transaction data of the block in the block chain.
Further, the feedback control includes: and starting the existing blocks in the block chain to perform feedback control on the transaction data in other blocks.
Further, the new block includes a block number of an existing block to be feedback-controlled and feedback control information.
The feedback processing device in the block chain in the embodiment of the invention can realize the feedback control logic of the transaction data in the existing blocks in the block chain based on the transaction data in the newly generated blocks based on the reverse linked block pointing relationship.
Further, the feedback control may include: and opening the transaction data in the existing blocks in the block chain, closing the transaction data in the existing blocks in the block chain and performing feedback control operation on other blocks through the existing blocks.
Those of ordinary skill in the art will understand that: all or a portion of the steps of implementing the above-described method embodiments may be performed by hardware associated with program instructions. The program may be stored in a computer-readable storage medium. When executed, the program performs steps comprising the method embodiments described above; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.
Finally, it should be noted that: the above embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present application.
Claims (10)
1. A feedback processing method in a blockchain is characterized by comprising the following steps:
responding to generation of a new block which carries out feedback control on transaction data of an existing block in a block chain, calculating the data in the new block through an irreversible algorithm to obtain a check value, writing the check value of the new block into the existing block, and forming a reverse link pointing from the new block to the existing block; feedback control logic to identify the new tile to the transactional data in the existing tile;
newly added data in a reverse linked blockchain forming feedback control logic is broadcast to a blockchain network.
2. The method of claim 1, wherein the feedback control comprises: and starting the transaction data of the existing blocks in the block chain.
3. The method of claim 1, wherein the feedback control comprises: closing the transaction data of the existing block in the block chain.
4. The method of claim 1, wherein the feedback control comprises: and performing feedback control on the transaction data in other blocks through the existing blocks in the block chain.
5. The method according to any of claims 1-4, wherein the new block comprises the block number of the existing block to be feedback controlled and feedback control information.
6. A feedback processing apparatus in a blockchain, comprising:
the verification value calculation module is used for responding to the generation of a new block which carries out feedback control on the transaction data of the existing block in the block chain, and calculating the data in the new block through an irreversible algorithm to obtain a verification value;
a block linking module, configured to write the check value of the new block into the existing block, and form a reverse link pointing from the new block to the existing block; feedback control logic to identify the new tile to the transactional data in the existing tile;
and the data broadcasting module is used for broadcasting the newly added data in the reverse-linked block chain with the feedback control logic to the block chain network.
7. The apparatus of claim 6, wherein the feedback control comprises: and starting the transaction data of the existing blocks in the block chain.
8. The apparatus of claim 6, wherein the feedback control comprises: closing the transaction data of the existing block in the block chain.
9. The apparatus of claim 6, wherein the feedback control comprises: and starting the existing blocks in the block chain to perform feedback control on the transaction data in other blocks.
10. The apparatus according to any of claims 6-9, wherein the new block comprises a block number of the existing block to be feedback controlled and feedback control information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810136655.XA CN108462582B (en) | 2018-02-09 | 2018-02-09 | Feedback processing method and device in block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810136655.XA CN108462582B (en) | 2018-02-09 | 2018-02-09 | Feedback processing method and device in block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108462582A CN108462582A (en) | 2018-08-28 |
| CN108462582B true CN108462582B (en) | 2020-03-27 |
Family
ID=63239889
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810136655.XA Active CN108462582B (en) | 2018-02-09 | 2018-02-09 | Feedback processing method and device in block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108462582B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108520410B (en) * | 2018-02-09 | 2020-09-11 | 北京欧链科技有限公司 | Feedback processing method and device in block chain |
| CN109919622B (en) * | 2019-02-22 | 2020-10-23 | 杭州复杂美科技有限公司 | Transaction replacement method, apparatus and storage medium |
| CN110235162B (en) * | 2019-04-30 | 2023-10-31 | 厦门特华荣商贸有限公司 | Block chain system data processing method and block generation method |
| CN110365493B (en) * | 2019-08-22 | 2020-09-11 | 电子科技大学 | Multi-form derivable annular block chain construction method |
| CN111522831B (en) * | 2020-04-30 | 2020-12-29 | 中科软科技股份有限公司 | Data recording method and system for alliance chain account book platform |
| CN111639080B (en) * | 2020-06-01 | 2021-07-27 | 腾讯科技（深圳）有限公司 | Data processing method and device, node equipment and storage medium |
| CN113839989B (en) * | 2021-08-28 | 2022-08-05 | 西安交通大学 | Multi-node data processing method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106296359A (en) * | 2016-08-13 | 2017-01-04 | 深圳市樊溪电子有限公司 | Credible electric power networks transaction platform based on block chain technology |
| CN106506146A (en) * | 2016-10-26 | 2017-03-15 | 北京瑞卓喜投科技发展有限公司 | Based on the Transaction Information method of calibration of block chain technology, apparatus and system |
| CN107171829A (en) * | 2017-04-24 | 2017-09-15 | 杭州趣链科技有限公司 | A kind of dynamic node management method for algorithm realization of being known together based on BFT |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH02216552A (en) * | 1989-02-17 | 1990-08-29 | Hokkaido Nippon Denki Software Kk | System for releasing data area of data base system |
| CN106534317B (en) * | 2016-11-17 | 2019-09-03 | 杭州云象网络技术有限公司 | A kind of calamity based on block chain technology is for cloud storage system construction method |
| CN106844477B (en) * | 2016-12-23 | 2018-05-01 | 北京众享比特科技有限公司 | To synchronous method after block catenary system, block lookup method and block chain |
| CN106897351B (en) * | 2016-12-29 | 2020-11-10 | 北京瑞卓喜投科技发展有限公司 | Generation method and system of directed acyclic graph block chain |
| CN107451007B (en) * | 2017-03-24 | 2020-11-06 | 北京瑞卓喜投科技发展有限公司 | Verification method and system of block chain for error correction aiming at added blocks |
| CN107274159A (en) * | 2017-06-09 | 2017-10-20 | 北京泛融科技有限公司 | A kind of accounting system and method that algorithm is concurrently performed based on block |
-
2018
- 2018-02-09 CN CN201810136655.XA patent/CN108462582B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106296359A (en) * | 2016-08-13 | 2017-01-04 | 深圳市樊溪电子有限公司 | Credible electric power networks transaction platform based on block chain technology |
| CN106506146A (en) * | 2016-10-26 | 2017-03-15 | 北京瑞卓喜投科技发展有限公司 | Based on the Transaction Information method of calibration of block chain technology, apparatus and system |
| CN107171829A (en) * | 2017-04-24 | 2017-09-15 | 杭州趣链科技有限公司 | A kind of dynamic node management method for algorithm realization of being known together based on BFT |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108462582A (en) | 2018-08-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108462582B (en) | Feedback processing method and device in block chain | |
| CN108510268B (en) | Annular block chain structure, data processing method and device | |
| CN110442652B (en) | Cross-chain data processing method and device based on block chain | |
| CN110019235B (en) | Block chain based data storage and recovery method, device, equipment and medium | |
| CN106909605B (en) | Method and system for generating block chain expanded along transverse direction | |
| CN110599346B (en) | Block chain information acquisition method and related equipment | |
| US9280416B1 (en) | Selection of erasure code parameters for no data repair | |
| US20210049715A1 (en) | Blockchain-based data procesing method, apparatus, and electronic device | |
| CN110599174B (en) | Block chain information processing method and related equipment | |
| KR102172514B1 (en) | Managing method for test data based on blockchain node apparatus of blockchain | |
| CN107463597B (en) | Passive verification method and system for block chain of modified block volume data | |
| CN107391292B (en) | Block chain verification method and system for realizing error correction aiming at data of block body | |
| CN109492049B (en) | Data processing, block generation and synchronization method for block chain network | |
| JP2010050809A (en) | Data receiving apparatus, data receiving method, and data receiving program | |
| WO2020220251A1 (en) | Data processing method for blockchain system and block generating method | |
| JP2009140464A (en) | Motion transition method and system for dynamic image and computer-readable recording medium with program thereof recorded thereon | |
| CN109815289A (en) | Block generation method, calculating equipment, storage medium for block chain network | |
| CN107704604A (en) | A kind of information persistence method, server and computer-readable recording medium | |
| CN109964215A (en) | Flow control in Remote Direct Memory access data communication with buffer circle mirror image | |
| CN107423163B (en) | Error surveying method and system for block chain of overall serial added blocks | |
| CN107391557B (en) | Block chain serial query method and system for setting out-of-chain fault table | |
| CN112087530B (en) | Method, device, equipment and medium for uploading data to block chain system | |
| CN108512649A (en) | The processing method and processing device of the reversed Hash link of block chain | |
| CN108510254B (en) | Chain bidirectional block chain structure, data processing method and device | |
| CN108519985B (en) | Bidirectional block chain, data processing method and device |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |