CN109389502A - A kind of common recognition method for depending on related chain and calculating the block chain of power - Google Patents
A kind of common recognition method for depending on related chain and calculating the block chain of power Download PDFInfo
- Publication number
- CN109389502A CN109389502A CN201811165491.XA CN201811165491A CN109389502A CN 109389502 A CN109389502 A CN 109389502A CN 201811165491 A CN201811165491 A CN 201811165491A CN 109389502 A CN109389502 A CN 109389502A
- Authority
- CN
- China
- Prior art keywords
- block
- chain
- transaction
- cryptographic hash
- block chain
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 238000001514 detection method Methods 0.000 claims abstract description 4
- 238000012790 confirmation Methods 0.000 claims description 27
- 238000012508 change request Methods 0.000 claims description 7
- 238000004422 calculation algorithm Methods 0.000 claims description 5
- 238000004364 calculation method Methods 0.000 abstract description 21
- 238000005516 engineering process Methods 0.000 description 8
- 238000005065 mining Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 5
- 238000012544 monitoring process Methods 0.000 description 4
- 238000012856 packing Methods 0.000 description 4
- RTZKZFJDLAIYFH-UHFFFAOYSA-N Diethyl ether Chemical compound CCOCC RTZKZFJDLAIYFH-UHFFFAOYSA-N 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- 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/50—Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems
- G06F21/57—Certifying or maintaining trusted computer platforms, e.g. secure boots or power-downs, version controls, system software checks, secure updates or assessing vulnerabilities
Abstract
The invention discloses a kind of common recognition methods for depending on related chain and calculating the block chain of power, it is related to block chain field, it include: first, at least one set of business datum in period first time of this block chain network is received, solves the first business cryptographic Hash for obtaining and matching with business datum through Hash operation；Then, it according to the first business cryptographic Hash, is generated on the first Correlation block chain outside this block chain network and announces the first transaction to match with the first business cryptographic Hash；Then, whether the first transaction on the first Correlation block chain of timing detection is identified；It is identified in response to the first transaction, transaction record information is recorded on the second block of this block chain network by the transaction record information of the first transaction of acquisition.In the present invention, this block chain network relies on the calculation power of Correlation block chain, it is only necessary to which the defence calculation power attacking ability of Correlation block chain is higher, then the defence of this block chain calculates power attacking ability and also gets a promotion, and the ability of power attack is calculated in the defence for improving this block chain.
Description
Technical field
The present invention relates to block chain field, in particular to a kind of common recognition method for depending on related chain and calculating the block chain of power.
Background technique
The non-block chain network for calculating power only carries out Hash solution to the local area build of the cryptographic Hash comprising a upper block and obtains
The cryptographic Hash of this block is obtained, and using the cryptographic Hash as the component part of next block head, and form chain type account book structure, each
Block is only performed once cryptographic Hash solution, if whole block counts are 1,000,000, break through the non-calculation power block chain network and calculates power
The mine machine of 1GH/s only needs can break through for one second.
It is shown according to BTC.com data, it is 50.13EH/s that bit coin the whole network at the bottom of August in this year, which calculates power, and the whole network difficulty is about
6.73T, it is 1500 that number of deals, which is confirmed, i.e., executable hash algorithm number per second is 5 × 1016It is secondary.Even if possessing block chain network
1 ‰ calculation power, can also break through easily it is non-calculate power block chain network.
And with the development of block chain technology, more and more block chain projects occur, and each block chain project
With the responsible absence from work without reason for digging mine and mine machine.Then, main biggish block chain network (such as bit coin, ether mill) has produced
It is raw, have accumulated more calculation power resource.In comparison with the calculation power for large-scale block chain network, on the one hand, small-sized
The calculation power of emerging block chain project have no defence capability to it, when receiving the attack of large-scale block chain network, small-sized block
Chain network moment disintegrates；It on the other hand, can be into if more and more small-sized block chain network development is large-scale block chain network
Power resource is calculated by one step loss society, causes the waste of electric power resource, waterpower resourses.
Summary of the invention
In view of a part of defect of the prior art, the technical problem to be solved by the present invention is in the prior art, send out
It plays a stable block chain network and needs to expend biggish calculation power resource, and there is the attack for being calculated power block chain network greatly
May, exist and calculates power risk of attacks.The present invention is intended to provide a kind of common recognition method for depending on related chain and calculating the block chain of power, is based on
The block chain network that this method is formed can reduce the possibility broken through by calculation power without higher calculation power infrastructure, improve
The power that prevents from being calculated of this block chain network data attacks the ability distorted.
To achieve the above object, the present invention provides a kind of common recognition method for depending on related chain and calculating the block chain of power, the side
Method includes:
At least one set of business datum in period first time of this block chain network is received, is solved through Hash operation
Obtain the first business cryptographic Hash to match with the business datum；
According to the first business cryptographic Hash, generated on the first Correlation block chain outside this block chain network and announce with
The first transaction that the first business cryptographic Hash matches；By the first business cryptographic Hash labeled as cryptographic Hash write-in of not knowing together
First block of this block chain network；
According to the first business cryptographic Hash, whether described first periodically detected on the first Correlation block chain trades
It is identified；
It is identified in response to first transaction, acquires the transaction record information of first transaction, the transaction is remembered
Record information is recorded on the second block of this block chain network, and the first business cryptographic Hash is labeled as to have known together cryptographic Hash simultaneously
It is written on second block；The transaction record information includes block of first transaction on the described first related chain
Number.
In a specific embodiment, at least one set in period first time for receiving this block chain network
Business datum solves the first business cryptographic Hash for obtaining and matching with the business datum through Hash operation, further includes:
Obtain each business unit of this block chain network received within period first time；At least one set industry
Business data are made of the business unit；
Solve the unit cryptographic Hash of each business unit；
According to each unit cryptographic Hash and Merkel's tree algorithm, Merkel treetop portion cryptographic Hash is generated, and will be described
Merkel treetop portion's cryptographic Hash is as the first business cryptographic Hash.
In a specific embodiment, the method also includes: the business unit or the business datum are recorded in
First block.
In a specific embodiment, described according to the first business cryptographic Hash, periodically detect first correlation zone
Whether first transaction on block chain is identified, further includes:
The master link point of at least three heterogeneous networks on chain related to described first is communicated, timing detection at least three
Whether first transaction of the main chain node of a heterogeneous networks is identified；Wherein, the main chain number of nodes is odd number；
In all main chain nodes, if first transaction is confirmed by the main chain node more than half,
Then think that first transaction is identified.
In a specific embodiment, the method also includes:
After first trade confirmation, the transaction record information of first transaction is acquired；
It is changed in response to the transaction record information of first transaction, changes the secondth area of this block chain network
The transaction record information on block is the transaction record information of first transaction after change.
In a specific embodiment, the method also includes:
After first trade confirmation, the transaction record information of first transaction is acquired；
It is changed in response to the transaction record information of first transaction, to the chain interior nodes of this block chain network
The change request of send chain data；Wherein, after the chain interior nodes receive the chain data change request, to the chain interior nodes
The main chain node of corresponding described first related chain requests the second transaction record information of first transaction, and in response to institute
It states the second transaction record information and original transaction record information mismatches, change the transaction record information.
In a specific embodiment, several nodes of described block chain network are in the same of connection this block chain network
When, also connect the network of the described first related chain.
In a specific embodiment, the previous block cryptographic Hash of present networks block chain is solved as latter block cryptographic Hash
Input parameter, the method also includes:
It is changed in response to the transaction record information of first transaction, solves the of second block again
Two block cryptographic Hash, and the second block cryptographic Hash is replaced to the block after second block, and is asked accordingly
Solve subsequent block cryptographic Hash.
In a specific embodiment, this is written labeled as cryptographic Hash of not knowing together in the first business cryptographic Hash described
Before first block of block chain network, further includes:
The first business cryptographic Hash is written in the first Hash list；The first Hash list is for storing this block
The business cryptographic Hash of chain network to match with all business datums that do not know together.
In a specific embodiment, the method also includes:
The first business cryptographic Hash that all business datums known together are matched is written in the second Hash list.
The beneficial effects of the present invention are: this block chain network is to depend on another Correlation block chain network, by this block
The cryptographic Hash of business datum is recorded on Correlation block chain in the form traded, and after the transaction is identified, this block chain
After the node of network receives the information that the transaction is identified, this block chain is written into the Transaction Information of the business, so that the industry
Business data are confirmed, and realize common recognition；This block chain network relies on the calculation power of Correlation block chain, it is only necessary to Correlation block chain
Defence calculation power attacking ability is higher, then the defence of this block chain calculates power attacking ability and also gets a promotion, and improves the anti-of this block chain
Imperial ability for calculating power attack.In addition, block chain technology provided by the invention calculates power basis without own net construction, society is saved
Cost.
Detailed description of the invention
Fig. 1 is the stream of the common recognition method for the block chain that one of embodiment of the invention depends on related chain calculation power
Journey schematic diagram；
Fig. 2 is the number of the common recognition method for the block chain that one of embodiment of the invention depends on related chain calculation power
According to transmission schematic diagram；
Fig. 3 is the base of the common recognition method for the block chain that one of embodiment of the invention depends on related chain calculation power
In the schematic diagram of Merkel's tree generation business cryptographic Hash；
Fig. 4 is the association structure of the first related chain network and this block chain network in the embodiment of the invention
Figure；
Fig. 5 is the area of the common recognition method for the block chain that one of embodiment of the invention depends on related chain calculation power
Data when block number is according to change transmit schematic diagram.
Fig. 6 is the knot of the common recognition device for the block chain that one of embodiment of the invention depends on related chain calculation power
Structure block diagram.
Specific embodiment
Present invention will be further explained below with reference to the attached drawings and examples:
As shown in Figs. 1-5, in the first embodiment of the invention, a kind of common recognition for depending on related chain and calculating the block chain of power is provided
Method, which comprises
Step S1, at least one set of business datum in period first time of this block chain network is received, through Hash
Operation solves the first business cryptographic Hash for obtaining and matching with the business datum；
It is noted that the generation of the first business cryptographic Hash can be and integrally breathe out to one or more groups of business datums
Uncommon operation；The generation of first business cryptographic Hash is also possible to carry out Hash fortune to each business datum using the form of Merkel tree
After calculation, then higher level's cryptographic Hash is generated two-by-two, and up to solving Merkel treetop portion cryptographic Hash, the Merkel treetop portion cryptographic Hash
The as described first business cryptographic Hash；
In the present embodiment, the length in period first time of this block chain network is not limited, optionally, at the first time
Period is exactly that the block of this block chain network generates the period；Optionally, the block of period first time and this block chain network is raw
It is unrelated at the period.
Step S2, it according to the first business cryptographic Hash, is generated on the first Correlation block chain outside this block chain network
And announce the first transaction to match with the first business cryptographic Hash；By the first business cryptographic Hash labeled as Kazakhstan of not knowing together
First block of uncommon value write-in this block chain network；
It is that several or all business datums in period first time are packaged as Hash as a whole in the present embodiment
Value, and issued in the form of transaction on the first related chain；It is noted that the area of period first time chain related to first
The block generation period is simultaneously irrelevant, in the present embodiment, the first transaction need to be only published on to the first related chain, and when the confirmation of transaction
Between chain itself related to first be arranged related, this block chain network only needs to wait the confirmation of the transaction.For example, in bit
In coin network, a bit coin transaction is initiated, after waiting certain time length, which can be carried out by the absence from work without reason of bit coin network
Book keeping operation and confirmation, and be written in block chain.
Step S3, according to the first business cryptographic Hash, described first on the first Correlation block chain is periodically detected
Whether transaction is identified；
Optionally, several nodes of this block chain network can carry out data monitoring to the first related chain, to obtain the
The information of one transaction whether being identified；Optionally, several nodes of this block chain network are in connection this block chain network
Meanwhile also connecting the first related chain network；
In contrast the first promoter to trade due to first receives the confirmation message of the first transaction, more in time.It is optional
, receive the first confirmation message that the first promoter of first transaction is identified about first transaction；Described first
Promoter and this block are connected to the network, and first promoter chain network related to first connects；
Step S4, it is identified in response to first transaction, acquires the transaction record information of first transaction, it will be described
Transaction record information is recorded on the second block of this block chain network, by the first business cryptographic Hash labeled as Kazakhstan of having known together
Uncommon value is simultaneously written on second block；The transaction record information includes first transaction on the described first related chain
Block number.
This example provides a kind of block chain common recognition technology, when the cryptographic Hash of associated traffic data is identified in the first phase
It closes on chain, then it is assumed that associated traffic data can be not easy to be tampered, and be known together.It, can meanwhile after the first transaction is identified
Pertinent transaction information, such as the first business cryptographic Hash of business datum to be identified in which block of block chain.
In practical applications, taken according to the quantity of this block chain business datum, transaction procedure and the first related chain network
Handling capacity, the quantity of the business datum of packing once is set；It is noted that when higher single business number is arranged
When according to being packaged quantity, the service charge of the first transaction of publication on the first Correlation block chain can be lowered, and it is related to reduce by first
The load of block chain, and when another aspect single business datum packing negligible amounts, it can effectively improve the confirmation speed of transaction.
In the present embodiment, at least one set of business number in period first time for receiving this block chain network
According to the first business cryptographic Hash to match through Hash operation solution acquisition with the business datum, further includes:
Obtain each business unit of this block chain network received within period first time；At least one set industry
Business data are made of the business unit；
Solve the unit cryptographic Hash of each business unit；
According to each unit cryptographic Hash and Merkel's tree algorithm, Merkel treetop portion cryptographic Hash is generated, and will be described
Merkel treetop portion's cryptographic Hash is as the first business cryptographic Hash.
It is noted that cannot be matched two-by-two is single when the cryptographic Hash of a certain layer of Merkel tree is odd number
Cryptographic Hash can solve Hash to its own, to obtain upper one layer of cryptographic Hash.
In the present embodiment, optionally, the method also includes: the business unit or the business datum are recorded in
First block.
Optionally, business unit or business datum can be written in the block of this block chain network.
In the present embodiment, described according to the first business cryptographic Hash, it periodically detects on the first Correlation block chain
It is described first transaction whether be identified, further includes:
The master link point of at least three heterogeneous networks on chain related to described first is communicated, timing detection at least three
Whether first transaction of the main chain node of a heterogeneous networks is identified；Wherein, the main chain number of nodes is odd number；
In all main chain nodes, if first transaction is confirmed by the main chain node more than half,
Then think that first transaction is identified.
By the way that different main chain nodes is arranged, avoid connecting with single main chain node, the first transaction of this block chain network
Confirmation is purely determined by the main chain node, when the node is broken and causes this block chain data insincere.Meanwhile by can be
Multiple main chain nodes can compare the data of different main chain nodes in time and select the transaction results confirmed compared with multinode, avoid
Single main chain node causes main chain bifurcated that cannot more early find, reduce this block chain network is influenced by the first related chain bifurcated.
It, can be in the main chain node of the related chain of different mining sites setting first in practical application scene.Due to same
The general collective Wa Kuang of mining site, and dredging collateral delay is few, and data are relatively uniform in mining site, so can choose the difference of different mining sites
Main chain node is to obtain the transaction record information of the first transaction.
In the present embodiment, optionally, the method also includes:
After first trade confirmation, the transaction record information of first transaction is acquired；
It is changed in response to the transaction record information of first transaction, changes the secondth area of this block chain network
The transaction record information on block is the transaction record information of first transaction after change.
Inevitably, the first related chain bifurcated may cause this block chain network data and need to recall change, at this point, right
The relationship trading record information of first transaction changes.It is necessary, if this block chain network connects block using chain type, need
To the carry out Hash operation of all blocks after the block of change, the data of each block are redefined.
In the present embodiment, optionally, the method also includes:
After first trade confirmation, the transaction record information of first transaction is acquired；
It is changed in response to the transaction record information of first transaction, to the chain interior nodes of this block chain network
The change request of send chain data；Wherein, after the chain interior nodes receive the chain data change request, to the chain interior nodes
The main chain node of corresponding described first related chain requests the second transaction record information of first transaction, and in response to institute
It states the second transaction record information and original transaction record information mismatches, change the transaction record information.
It is noted that, such as bit coin block, being to rely on miners not in based on the block chain technology for calculating power common recognition
Disconnected to perform mathematical calculations and generate, each block must quote a block thereon, therefore longest chain is also to be most difficult to
With what is overthrown and distort, so node thinks that most long-chain is only effective block chain forever, the mine of mine is dug only on most long-chain
Work can be rewarded, and here it is the bit coin most long-chain principles that we often say.When two or more nodes are almost remembered simultaneously
Then there is bifurcated in account, at this point, retaining them temporarily two part book keeping operation modes, and finally by the block chain of longer chain as final note
Account account book.
In optional case, when whether the node that bifurcated and this block chain network occurs in the first related chain trades according to first
When being identified and keeping accounts, one of bifurcated can be followed, if then because the first related chain selects this block chain network caused by another bifurcated
The transaction record information of the first transaction change, the block chain at this point it is possible to modify it, and after modifying accordingly.
It is noted that the cryptographic Hash of previous block is deposited when being connected between the block of this block chain using chain type
When storage is among latter block, then the first transaction record information is answered to change, then needs to solve block cryptographic Hash again, and same
Cryptographic Hash after Shi Xiugai, it is worth mentioning at this point that, such as 6 confirmations of bit coin network needs are to guarantee block chain data not
It is tampered, so, it is only necessary to the chain type modified between the block of this block chain network in first 6 block periods of related chain connects
It connects, it is not high to calculate force request.
In the present embodiment, optionally, several nodes of described block chain network are in connection this block chain network
Meanwhile also connecting the network of the described first related chain.
Based on this, it can provide rapidly the first transaction relevant data information for this block chain network.
In typical block chain example, the previous block cryptographic Hash of present networks block chain is asked as latter block cryptographic Hash
The input parameter of solution, to solve latter block cryptographic Hash.
In the present embodiment, optionally, the previous block cryptographic Hash of present networks block chain is asked as latter block cryptographic Hash
The input parameter of solution, the method also includes:
It is changed in response to the transaction record information of first transaction, solves the of second block again
Two block cryptographic Hash, and the second block cryptographic Hash is replaced to the block after second block, and is asked accordingly
Solve subsequent block cryptographic Hash.
In the present embodiment, optionally, the first business cryptographic Hash is written labeled as cryptographic Hash of not knowing together described
Before first block of this block chain network, further includes:
The first business cryptographic Hash is written in the first Hash list；The first Hash list is for storing this block
The business cryptographic Hash of chain network to match with all business datums that do not know together.
By the way that the first Hash list is arranged, facilitate consultation the business cryptographic Hash that do not know together.
In the present embodiment, optionally, the method also includes:
The first business cryptographic Hash that all business datums known together are matched is written in the second Hash list.
By the way that the second Hash list is arranged, facilitate consultation the business cryptographic Hash known together.
It is noted that as shown in Fig. 2, after the block XGL1000 of the first related chain network 200 is completed, one
In a time cycle, the business datum that the client of this block chain network 100 is initiated is collected, and generate business cryptographic Hash 1, and
The first transaction 1 is generated in first related chain network 200；And further initiated in the first related chain network 200 first transaction 2,
First transaction 3；Also, the first transaction 1 obtains really to the second transaction 2 on the block XGL1001 of the first related chain network 200
Recognize, and monitor the block and obtain transaction record 2, and the transaction record information of first the 1, first transaction 2 of transaction is reported to be recorded in local area
On the block BQKL1001-1 of block chain network 100, that is, complete the common recognition of business cryptographic Hash 1, business cryptographic Hash 2.
In Fig. 3, business datum 1-7 is matched two-by-two generates upper level business cryptographic Hash, and ultimately forms the first business Kazakhstan
Uncommon value.
In Fig. 4, there are two common node for the chain network 200 related to first of this block chain network 100.
In Fig. 5, there are bifurcated, when this block chain network first record business datum, is used for the first related chain in figure
The accounting results of upper half figure, after know together due to the first related chain bifurcated and again, and be changed to the accounting results of the following figure.Firstly,
The block XGL1001 of first related chain changes, also, the confirmation of the first transaction 3 of original is in block XGL1001 by occurring, and
Become to occur in block XGL1002.Correspondingly, transaction record information 2 and block in this block chain network of script
Therefore BQKL1001-1, block BQKL1001-2 are also modified, at this point, the node of this block chain network can be to these letters
Breath is modified.It is noted that other subsequent blocks it is unmodified be because the block of script does not record these information,
It is subsequent to be recorded as newly-increased data.
As shown in fig. 6, providing a kind of common recognition dress for depending on related chain and calculating the block chain of power in second embodiment of the invention
It sets, described device includes:
Business Hash obtains module 101, at least one in period first time for receiving this block chain network
Group business datum solves the first business cryptographic Hash for obtaining and matching with the business datum through Hash operation；
It is noted that the generation of the first business cryptographic Hash can be and integrally breathe out to one or more groups of business datums
Uncommon operation；The generation of first business cryptographic Hash is also possible to carry out Hash fortune to each business datum using the form of Merkel tree
After calculation, then higher level's cryptographic Hash is generated two-by-two, and up to solving Merkel treetop portion cryptographic Hash, the Merkel treetop portion cryptographic Hash
The as described first business cryptographic Hash；
In the present embodiment, the length in period first time of this block chain network is not limited, optionally, at the first time
Period is exactly that the block of this block chain network generates the period；Optionally, the block of period first time and this block chain network is raw
It is unrelated at the period.
Main chain transaction generates and logging modle 102, is used for according to the first business cryptographic Hash, outside this block chain network
The first Correlation block chain on generate and announce with the first business cryptographic Hash match first transaction；By first industry
The first block of this block chain network is written labeled as cryptographic Hash of not knowing together for business cryptographic Hash；
It is that several or all business datums in period first time are packaged as Hash as a whole in the present embodiment
Value, and issued in the form of transaction on the first related chain；It is noted that the area of period first time chain related to first
The block generation period is simultaneously irrelevant, in the present embodiment, the first transaction need to be only published on to the first related chain, and when the confirmation of transaction
Between chain itself related to first be arranged related, this block chain network only needs to wait the confirmation of the transaction.For example, in bit
In coin network, a bit coin transaction is initiated, after waiting certain time length, which can be carried out by the absence from work without reason of bit coin network
Book keeping operation and confirmation, and be written in block chain.
Main chain transaction monitoring module 103, for periodically detecting first correlation zone according to the first business cryptographic Hash
Whether first transaction on block chain is identified；
Optionally, several nodes of this block chain network can carry out data monitoring to the first related chain, to obtain the
The information of one transaction whether being identified；Optionally, several nodes of this block chain network are in connection this block chain network
Meanwhile also connecting the first related chain network；
In contrast the first promoter to trade due to first receives the confirmation message of the first transaction, more in time.It is optional
, receive the first confirmation message that the first promoter of first transaction is identified about first transaction；Described first
Promoter and this block are connected to the network, and first promoter chain network related to first connects；
Second block logging modle 104 acquires the friendship of first transaction for being identified in response to first transaction
Easily record information, the transaction record information is recorded on the second block of this block chain network, and first business is breathed out
Uncommon value, which is labeled as having known together, cryptographic Hash and to be written on second block；The transaction record information includes that first transaction exists
Block number on described first related chain.
This example provides a kind of block chain common recognition technology, when the cryptographic Hash of associated traffic data is identified in the first phase
It closes on chain, then it is assumed that associated traffic data can be not easy to be tampered, and be known together.It, can meanwhile after the first transaction is identified
Pertinent transaction information, such as the first business cryptographic Hash of business datum to be identified in which block of block chain.
In practical applications, taken according to the quantity of this block chain business datum, transaction procedure and the first related chain network
Handling capacity, the quantity of the business datum of packing once is set；It is noted that when higher single business number is arranged
When according to being packaged quantity, the service charge of the first transaction of publication on the first Correlation block chain can be lowered, and it is related to reduce by first
The load of block chain, and when another aspect single business datum packing negligible amounts, it can effectively improve the confirmation speed of transaction.
In the present embodiment, optionally, the business Hash obtains module 101, further includes:
Subservice receiving unit, for obtaining each business of this block chain network received within period first time
Unit；At least one set business datum is made of the business unit；
Sub- cryptographic Hash solves unit, for solving the unit cryptographic Hash of each business unit；
Business Hash solves unit, for generating Merkel according to each unit cryptographic Hash and Merkel's tree algorithm
Treetop portion cryptographic Hash, and using Merkel treetop portion's cryptographic Hash as the first business cryptographic Hash.
It is noted that cannot be matched two-by-two is single when the cryptographic Hash of a certain layer of Merkel tree is odd number
Cryptographic Hash can solve Hash to its own, to obtain upper one layer of cryptographic Hash.
Optionally, business unit or business datum can be written in the block of this block chain network.
In the present embodiment, optionally, described device further include: the first block logging modle 105 is used for the business
Unit or the business datum are recorded in first block.
Optionally, this block chain network is monitored a master link point of the first opposite chain, to obtain the first friendship
Easy confirmation message or transaction record information change.
In the present embodiment, optionally, the main chain transaction monitoring module 103, further includes:
Multinode trade confirmation unit, the main chain node of at least three heterogeneous networks on chain related to described first
It is communicated, whether first transaction that timing detects the main chain node of at least three heterogeneous networks is identified；Wherein,
The main chain number of nodes is odd number；
Multinode transaction common recognition unit, in all main chain nodes, if first transaction by half with
On the main chain node confirmed, then it is assumed that it is described first transaction is identified.
By the way that different main chain nodes is arranged, avoid connecting with single main chain node, the first transaction of this block chain network
Confirmation is purely determined by the main chain node, when the node is broken and causes this block chain data insincere.Meanwhile by can be
Multiple main chain nodes can compare the data of different main chain nodes in time and select the transaction results confirmed compared with multinode, avoid
Single main chain node causes main chain bifurcated that cannot more early find, reduce this block chain network is influenced by the first related chain bifurcated.
It, can be in the main chain node of the related chain of different mining sites setting first in practical application scene.Due to same
The general collective Wa Kuang of mining site, and dredging collateral delay is few, and data are relatively uniform in mining site, so can choose the difference of different mining sites
Main chain node is to obtain the transaction record information of the first transaction.
In the present embodiment, optionally, described device further include:
Transaction record acquisition module 109, for after first trade confirmation, acquiring the friendship of first transaction
Easily record information；
First transaction record changes module 110, for occurring in response to the transaction record information of first transaction
Change changes the transaction record information on the second block of this block chain network as the institute of first transaction after change
State transaction record information.
Inevitably, the first related chain bifurcated may cause this block chain network data and need to recall change, at this point, right
The relationship trading record information of first transaction changes.It is necessary, if this block chain network connects block using chain type, need
To the carry out Hash operation of all blocks after the block of change, the data of each block are redefined.
In the present embodiment, optionally, described device further include:
Transaction record acquisition module 109, for after first trade confirmation, acquiring the friendship of first transaction
Easily record information；
Second transaction record changes module 111, for occurring in response to the transaction record information of first transaction
Change is changed to the chain interior nodes send chain data of this block chain network and is requested；Wherein, the chain interior nodes receive the chain number
After change request, to the main chain node of the first related chain corresponding to chain interior nodes request first transaction
The second transaction record information, and not in response to second transaction record information and original transaction record information
Match, changes the transaction record information.
It is noted that, such as bit coin block, being to rely on miners not in based on the block chain technology for calculating power common recognition
Disconnected to perform mathematical calculations and generate, each block must quote a block thereon, therefore longest chain is also to be most difficult to
With what is overthrown and distort, so node thinks that most long-chain is only effective block chain forever, the mine of mine is dug only on most long-chain
Work can be rewarded, and here it is the bit coin most long-chain principles that we often say.When two or more nodes are almost remembered simultaneously
Then there is bifurcated in account, at this point, retaining them temporarily two part book keeping operation modes, and finally by the block chain of longer chain as final note
Account account book.
In optional case, when whether the node that bifurcated and this block chain network occurs in the first related chain trades according to first
When being identified and keeping accounts, one of bifurcated can be followed, if then because the first related chain selects this block chain network caused by another bifurcated
The transaction record information of the first transaction change, the block chain at this point it is possible to modify it, and after modifying accordingly.
It is noted that the cryptographic Hash of previous block is deposited when being connected between the block of this block chain using chain type
When storage is among latter block, then the first transaction record information is answered to change, then needs to solve block cryptographic Hash again, and same
Cryptographic Hash after Shi Xiugai, it is worth mentioning at this point that, such as 6 confirmations of bit coin network needs are to guarantee block chain data not
It is tampered, so, it is only necessary to the chain type modified between the block of this block chain network in first 6 block periods of related chain connects
It connects, it is not high to calculate force request.
In the present embodiment, optionally, several nodes of described block chain network are in connection this block chain network
Meanwhile also connecting the network of the described first related chain.
Based on this, it can provide rapidly the first transaction relevant data information for this block chain network.
In typical block chain example, the previous block cryptographic Hash of present networks block chain is asked as latter block cryptographic Hash
The input parameter of solution, to solve latter block cryptographic Hash.
In the present embodiment, optionally, described device further include: block data modified module 106, in response to described
The transaction record information of first transaction changes, and solves the second block cryptographic Hash of second block again, and will
The second block cryptographic Hash is replaced to the block after second block, and solves subsequent block Hash accordingly
Value.
In the present embodiment, optionally, described device further include:
First Hash list management module 107, for the first business cryptographic Hash to be written in the first Hash list；Institute
The first Hash list is stated for storing the business cryptographic Hash of this block chain network to match with all business datums that do not know together.
By the way that the first Hash list is arranged, facilitate consultation the business cryptographic Hash that do not know together.
In the present embodiment, optionally, described device further include:
Second Hash list management module 108, first industry for all business datums known together to match
Cryptographic Hash of being engaged in is written in the second Hash list.
By the way that the second Hash list is arranged, facilitate consultation the business cryptographic Hash known together.
The preferred embodiment of the present invention has been described in detail above.It should be appreciated that those skilled in the art without
It needs creative work according to the present invention can conceive and makes many modifications and variations.Therefore, all technologies in the art
Personnel are available by logical analysis, reasoning, or a limited experiment on the basis of existing technology under this invention's idea
Technical solution, all should be within the scope of protection determined by the claims.
Claims (10)
1. a kind of common recognition method for depending on related chain and calculating the block chain of power, which is characterized in that the described method includes:
At least one set of business datum in period first time of this block chain network is received, solves and obtains through Hash operation
The the first business cryptographic Hash to match with the business datum；
According to the first business cryptographic Hash, generated on the first Correlation block chain outside this block chain network and announce with it is described
The first transaction that first business cryptographic Hash matches；By the first business cryptographic Hash labeled as cryptographic Hash write-in local area of not knowing together
First block of block chain network；
According to the first business cryptographic Hash, whether first transaction periodically detected on the first Correlation block chain is true
Recognize；
It is identified in response to first transaction, acquires the transaction record information of first transaction, the transaction record is believed
Breath is recorded on the second block of this block chain network, and the first business cryptographic Hash cryptographic Hash and is written labeled as having known together
On second block；The transaction record information includes block number of first transaction on the described first related chain.
2. a kind of common recognition method for depending on related chain and calculating the block chain of power as described in claim 1, which is characterized in that described to connect
Receive at least one set of business datum in period first time of this block chain network, through Hash operation solve obtain with it is described
The first business cryptographic Hash that business datum matches, further includes:
Obtain each business unit of this block chain network received within period first time；At least one set business number
It is formed according to by the business unit；
Solve the unit cryptographic Hash of each business unit；
According to each unit cryptographic Hash and Merkel's tree algorithm, Merkel treetop portion cryptographic Hash is generated, and by the Merck
That treetop portion cryptographic Hash is as the first business cryptographic Hash.
3. a kind of common recognition method for depending on related chain and calculating the block chain of power as claimed in claim 2, which is characterized in that the side
Method further include: the business unit or the business datum are recorded in first block.
4. a kind of common recognition method for depending on related chain and calculating the block chain of power as described in claim 1, which is characterized in that described
According to the first business cryptographic Hash, whether first transaction periodically detected on the first Correlation block chain is identified, also
Include:
The master link point of at least three heterogeneous networks on chain related to described first is communicated, and timing detection at least three is not
Whether first transaction with the main chain node of network is identified；Wherein, the main chain number of nodes is odd number；
In all main chain nodes, if first transaction is confirmed by the main chain node more than half, recognize
It is identified for first transaction.
5. a kind of common recognition method for depending on related chain and calculating the block chain of power as described in claim 1, which is characterized in that the side
Method further include:
After first trade confirmation, the transaction record information of first transaction is acquired；
It changes, is changed on the second block of this block chain network in response to the transaction record information of first transaction
The transaction record information be change after it is described first transaction the transaction record information.
6. a kind of common recognition method for depending on related chain and calculating the block chain of power as described in claim 1, which is characterized in that the side
Method further include:
After first trade confirmation, the transaction record information of first transaction is acquired；
It changes in response to the transaction record information of first transaction, is sent to the chain interior nodes of this block chain network
The change request of chain data；Wherein, after the chain interior nodes receive the chain data change request, to opposite with the chain interior nodes
The main chain node for the described first related chain answered requests the second transaction record information of first transaction, and in response to described the
Two transaction record informations and original transaction record information mismatch, and change the transaction record information.
7. a kind of common recognition method for depending on related chain and calculating the block chain of power as described in claim 1, which is characterized in that described
Several nodes of block chain network also connect the network of the described first related chain while connecting this block chain network.
8. a kind of common recognition method for depending on related chain and calculating the block chain of power as claimed in claims 6 or 7, which is characterized in that this
The input parameter that the previous block cryptographic Hash of network block chain is solved as latter block cryptographic Hash, the method also includes:
It is changed in response to the transaction record information of first transaction, solves the secondth area of second block again
Block cryptographic Hash, and the second block cryptographic Hash is replaced to the block after second block, and accordingly after solution
Continuous block cryptographic Hash.
9. a kind of common recognition method for depending on related chain and calculating the block chain of power as described in claim 1, which is characterized in that described
The first business cryptographic Hash is written before the first block of this block chain network labeled as cryptographic Hash of not knowing together, further includes:
The first business cryptographic Hash is written in the first Hash list；The first Hash list is for storing this block link network
The business cryptographic Hash of network to match with all business datums that do not know together.
10. a kind of common recognition method for depending on related chain and calculating the block chain of power as claimed in claim 9, which is characterized in that described
Method further include:
The first business cryptographic Hash that all business datums known together are matched is written in the second Hash list.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811165491.XA CN109389502B (en) | 2018-10-08 | 2018-10-08 | consensus method of block chains depending on related chain computing power |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811165491.XA CN109389502B (en) | 2018-10-08 | 2018-10-08 | consensus method of block chains depending on related chain computing power |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109389502A true CN109389502A (en) | 2019-02-26 |
| CN109389502B CN109389502B (en) | 2019-12-06 |
Family
ID=65419274
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811165491.XA Active CN109389502B (en) | 2018-10-08 | 2018-10-08 | consensus method of block chains depending on related chain computing power |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109389502B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110599174A (en) * | 2019-09-20 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Block chain information processing method and related equipment |
| WO2019137563A3 (en) * | 2019-04-26 | 2020-03-12 | Alibaba Group Holding Limited | Anti-replay attack authentication protocol |
| CN111127017A (en) * | 2019-12-27 | 2020-05-08 | 四川星际荣威科技有限公司 | Block chain full-fragmentation method and device based on P2P storage network and multi-layer architecture |
| CN111538791A (en) * | 2020-05-07 | 2020-08-14 | 深圳创客区块链技术有限公司 | Block chain multiple cross-chain mutual protection method, device and storage medium |
| CN111598567A (en) * | 2020-05-07 | 2020-08-28 | 深圳创客区块链技术有限公司 | Method, device and storage medium for preventing block chain large computing power attack |
| CN112036874A (en) * | 2019-06-03 | 2020-12-04 | 厦门本能管家科技有限公司 | Method and system for avoiding garbage transaction for block chain |
| CN114008970A (en) * | 2019-07-02 | 2022-02-01 | 株式会社电装 | Supply chain management method, supply chain management program, supply chain management system, and transaction record display program |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107423961A (en) * | 2017-07-11 | 2017-12-01 | 北京泛融科技有限公司 | A kind of optimization common recognition method based on random correlation analysis |
| CN107886388A (en) * | 2017-09-22 | 2018-04-06 | 杭州云象网络技术有限公司 | The traffic trip credit and safety service platform and its operation method of multicenter are realized based on alliance's chain |
| CN108009824A (en) * | 2017-11-28 | 2018-05-08 | 北京博晨技术有限公司 | Data common recognition method, apparatus and electronic equipment |
| US20180240191A1 (en) * | 2017-02-03 | 2018-08-23 | Terry Aronson | System and Method for asset backed crypto-currency |
| CN108492103A (en) * | 2018-02-07 | 2018-09-04 | 北京大学深圳研究生院 | A kind of alliance's block chain common recognition method |
-
2018
- 2018-10-08 CN CN201811165491.XA patent/CN109389502B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180240191A1 (en) * | 2017-02-03 | 2018-08-23 | Terry Aronson | System and Method for asset backed crypto-currency |
| CN107423961A (en) * | 2017-07-11 | 2017-12-01 | 北京泛融科技有限公司 | A kind of optimization common recognition method based on random correlation analysis |
| CN107886388A (en) * | 2017-09-22 | 2018-04-06 | 杭州云象网络技术有限公司 | The traffic trip credit and safety service platform and its operation method of multicenter are realized based on alliance's chain |
| CN108009824A (en) * | 2017-11-28 | 2018-05-08 | 北京博晨技术有限公司 | Data common recognition method, apparatus and electronic equipment |
| CN108492103A (en) * | 2018-02-07 | 2018-09-04 | 北京大学深圳研究生院 | A kind of alliance's block chain common recognition method |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10785035B1 (en) | 2019-04-26 | 2020-09-22 | Alibaba Group Holding Limited | Anti-replay attack authentication protocol |
| WO2019137563A3 (en) * | 2019-04-26 | 2020-03-12 | Alibaba Group Holding Limited | Anti-replay attack authentication protocol |
| KR102193552B1 (en) | 2019-04-26 | 2020-12-23 | 어드밴스드 뉴 테크놀로지스 씨오., 엘티디. | Replay attack prevention authentication protocol |
| KR20200126322A (en) * | 2019-04-26 | 2020-11-06 | 알리바바 그룹 홀딩 리미티드 | Replay attack prevention authentication protocol |
| CN112036874A (en) * | 2019-06-03 | 2020-12-04 | 厦门本能管家科技有限公司 | Method and system for avoiding garbage transaction for block chain |
| CN114008970A (en) * | 2019-07-02 | 2022-02-01 | 株式会社电装 | Supply chain management method, supply chain management program, supply chain management system, and transaction record display program |
| CN110599174A (en) * | 2019-09-20 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Block chain information processing method and related equipment |
| CN110599174B (en) * | 2019-09-20 | 2023-11-24 | 腾讯科技（深圳）有限公司 | Block chain information processing method and related equipment |
| CN111127017A (en) * | 2019-12-27 | 2020-05-08 | 四川星际荣威科技有限公司 | Block chain full-fragmentation method and device based on P2P storage network and multi-layer architecture |
| CN111127017B (en) * | 2019-12-27 | 2022-11-08 | 四川星际荣威科技有限公司 | Block chain full-fragmentation method and device based on P2P storage network and multilayer architecture |
| CN111598567A (en) * | 2020-05-07 | 2020-08-28 | 深圳创客区块链技术有限公司 | Method, device and storage medium for preventing block chain large computing power attack |
| CN111538791A (en) * | 2020-05-07 | 2020-08-14 | 深圳创客区块链技术有限公司 | Block chain multiple cross-chain mutual protection method, device and storage medium |
| CN111538791B (en) * | 2020-05-07 | 2023-09-22 | 深圳创客区块链技术有限公司 | Block chain multiple-cross-chain mutual protection method, device and storage medium |
| CN111598567B (en) * | 2020-05-07 | 2023-11-10 | 深圳创客区块链技术有限公司 | Method, device and storage medium for preventing blockchain powerful attack |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109389502B (en) | 2019-12-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109389502A (en) | A kind of common recognition method for depending on related chain and calculating the block chain of power | |
| CN109361661A (en) | A kind of common recognition device for depending on related chain and calculating the block chain of power | |
| CN109214817A (en) | A kind of block chain common recognition device based on calculation power parasitism | |
| CN109885264A (en) | A kind of the logic sharding method and its system of block chain node | |
| CN109118214A (en) | The method and apparatus for running intelligent contract | |
| CN109146484A (en) | Common recognition verification method, digging mine machine and block catenary system based on block chain | |
| CN108984645B (en) | Block chain processing method, device, equipment and storage medium | |
| CN107301536A (en) | Resource transfers method and device | |
| CN109087111A (en) | Common recognition verification method, digging mine machine and block catenary system based on block chain | |
| CN101719258B (en) | Method and system for processing remote double-center transaction information based on large computer | |
| CN101964795A (en) | Log collecting system, log collection method and log recycling server | |
| CN106470133A (en) | System pressure method of testing and device | |
| CN109309723A (en) | A kind of common recognition node variation and its realize system | |
| CN110458709B (en) | Resource transfer information transmission method and device, storage medium and electronic device | |
| CN113282603A (en) | Block chain consensus node checking method, device, equipment and storage medium | |
| CN111597567B (en) | Data processing method, data processing device, node equipment and storage medium | |
| CN112039926B (en) | Method for realizing double-layer chain type architecture of block chain | |
| CN110298754A (en) | A kind of common recognition method applied to block chain | |
| CN106296196A (en) | Digital cash transaction signature method and system and digital cash transaction system thereof | |
| CN109087105A (en) | For digging the Hash Search method of mine, digging mine machine and block catenary system | |
| CN112417001B (en) | Data processing method based on block chain network and related equipment | |
| CN109840769A (en) | Card method and device, system and storage medium are deposited based on block chain | |
| CN110597922A (en) | Data processing method, device, terminal and storage medium | |
| CN109242491A (en) | It digs mine identity identifying method, dig mine machine and block catenary system | |
| Ren et al. | Pooled mining is driving blockchains toward centralized systems |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210319 Address after: Room 1a201 and 1g201, No.12, Gaoxin 2nd Road, Zhangba Street office, Gaoxin District, Xi'an City, Shaanxi Province, 710065 Patentee after: XI'AN ZHIGUI INTERNET TECHNOLOGY Co.,Ltd. Address before: 351139 Hualin Industrial Park, Xiagao village, Huating Town, Chengxiang District, Putian City, Fujian Province Patentee before: PUTIAN ZHUHUO INFORMATION TECHNOLOGY Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231204 Address after: 101318 Building 6-185, Ronghuiyuan, Lingkong Economic Core Zone, Shunyi District, Beijing Patentee after: Lingjing Digital (Beijing) Technology Co.,Ltd. Address before: Room 1a201 and 1g201, No.12, Gaoxin 2nd Road, Zhangba Street office, Gaoxin District, Xi'an City, Shaanxi Province, 710065 Patentee before: XI'AN ZHIGUI INTERNET TECHNOLOGY Co.,Ltd. |
|
| TR01 | Transfer of patent right |