Specific embodiment
Now embodiment of the disclosure is specifically described in conjunction with attached drawing.It should be noted that similar in attached drawing
Component or functional unit may use same number mark.Appended attached drawing is intended only to illustrate embodiment of the disclosure.
The reality that those skilled in the art can be substituted from the description below on the basis of without departing from disclosure spirit and scope
Apply mode.
Term as used herein "include", "comprise" and similar terms are understood to open term, i.e.,
" including/including but not limited to ", expression can also include other contents.Term "based" is " being based at least partially on ".Term
" one embodiment " expression " at least one embodiment ";Term " another embodiment " expression " at least one other embodiment ",
Etc..Word " exemplary " expression " serving as example, example or illustration " is used herein.Described herein as " exemplary "
Any embodiment be all not necessarily construed to for other embodiments be preferred or advantageous.
Technology, method and apparatus known to person of ordinary skill in the relevant may be not discussed in detail, but suitable
In the case of, the technology, method and apparatus should be considered as part of specification.For between each unit in attached drawing
Line, it is only for convenient for explanation, indicate that the unit at least line both ends is in communication with each other, it is not intended that limitation does not connect
It can not be communicated between the unit of line.
As previously mentioned, there was only a main chain in the block catenary system of existing mainstream, the identical master of all node maintenances
Chain, what is be distributed on main chain is the block about each general transaction, is updated for block chain node and synchronous main chain need
Resource and time that will be very more.For example, maintenance should at each node if block chain size is more than 1TB (terabyte)
Block chain needs the time of a large amount of memory space and synchronization very long, furthermore each transaction require by the whole network each
Node processing seriously constrains the handling capacity of entire block catenary system.Lacking one kind can make full use of node and node at present
Between the block chain transaction of point-to-point performance, common recognition, verification mode, lack a kind of common recognition for taking into account Site autonomy and global common recognition
Mechanism.
In view of this, embodiment of the disclosure provide it is a kind of can linear expansion the common recognition machine based on multinode block chain
The disposal right of a large amount of point-to-point transaction, verifying power are transferred to both parties' section from common recognition node by the solution of system and verifying
Point realizes partial autonomy.There is no main chain or so-called center block chain in block catenary system according to an embodiment of the present disclosure, it should
System uses four layer architectures, respectively transaction, independent block chain, common recognition scheme and proof scheme.The first layer of the system is
Transaction, it is the Trading Model on the block catenary system based on exchange of value;The second layer of the system is independent block chain, i.e.,
Node block chain, block chain network has multiple nodes, and it is starting point that each node, which has from the wound generation block of own,
Independent block chain, wound generation block be the checkpoint block pre-created, further include in this block chain transaction block and its
Its checkpoint block, transaction block only record transaction related with this node, and other checkpoint blocks do not include any transaction letter
It ceases but includes consensus information;The third layer of the system is common recognition scheme, carries out the whole network common recognition to checkpoint block, works as checkpoint
After block is known together by the whole network, the characteristic that can not be distorted according to block chain, it is believed that occur in previous checkpoint block to currently
The transaction in All Activity block between the block of checkpoint has all been sealed by the whole network, this layer to transaction block correctness not
Guarantee is given, correct verification gives the 4th layer of the system to handle;The 4th layer of the system is proof scheme, for block of trading
Each of transaction, trace the transaction source transaction and the source transaction source transaction, trace back to the area Chuan Shi always
Transaction in block.Compared with the block chain in current most systems only comprising a main chain is realized, each node of this system
It is general transaction participant, each node safeguards the block chain and independent operating of itself.The block chained record is all
Transaction relevant to the node, including transaction initiator and transaction acceptance side, each transaction is recorded only in transaction and initiates in other words
In the transaction block of the block chain of side and transaction acceptance side.
For ease of description, the term occurred in the disclosure is illustrated below.Term " voucher " in the disclosure is
Refer to that a kind of digital rights prove the equity of numeralization (for example, prove), can be used for characterizing transaction initiator (sender) or
The digitlization equity of recipient, and voucher includes but is not limited to the amount of money for indicating such as assets, integral etc..
Fig. 1 is shown in which that the schematic diagram of the exemplary block chain network 100 of embodiment of the disclosure may be implemented.Block
Chain network 100 includes multiple block chain nodes 101,102,103,104.Since block chain technology has decentralization, distribution
Characteristic, each block chain node can intercourse information by various communication medias.User can be by accessing block chain link point
Several nodes in 101-104 initiate transaction, and after transaction reaches certain amount or time-out, one or more transaction is packaged into
Block is simultaneously sent to node.It is different from existing block chain network, in block chain network 100, block chain node 101-104
In each node maintenance itself an independently operated block chain (being described below in conjunction with Fig. 2).Furthermore, it is possible to
The management operation of intelligent contract is executed at each block chain node 101-104, intelligent contract installs and deploys, so that
Transaction is realized by calling intelligent contract.In addition, the quantity of the block chain node in Fig. 1 is only signal rather than limits,
It can be any amount, which can also include the node of various other types.
Fig. 2 shows exemplary block chain structure Figure 200 of block chain node according to an embodiment of the present disclosure, the blocks
Chain structure can be applied in the block chain network 100 of Fig. 1.For example, the block chain architecture diagram 200 respectively illustrates the area of Fig. 1
The block chain 201 of block chain node 101 and the block chain 202 of block chain node 102.Each block chain in block chain 201 and 202
Be made of multiple connected blocks, block includes block head and block content, block head include based on it father's block (i.e.
Previous block) at least part ensure the correctness of block, block content and block class come the abstract (Hash) generated
Type is related.Different from existing block chain, there are two types of block types for distribution on each block chain 201,202: transaction block and inspection
Make an inventory of block.First block in each block chain in block chain 201 and 202, which is referred to as, creates generation block, and wound generation block is
One checkpoint block pre-created, it may include each node unique identification and initial credential information, the initial voucher
Information is as consensus information and indicates that one still possesses the transaction of unique index without source.It can opening in each block chain
Wound generation block is pre-created when dynamic.There are at least one between the adjacent two checkpoint block of each block chain 201,202
Transaction block.For each node, transaction block is the block comprising general transaction information, and the transaction in the block should
Be it is related with this node transaction or be transaction initiator or be transaction recipient.Therefore, for each transaction
For, there are two indexes for it.The same trade fair is written in the block chain of initiator and recipient's node.For each
For node, checkpoint block does not include any general transaction information, but includes consensus information, to reach this node block chain
Consistency, i.e., checkpoint block for block interchain know together.
For example, block chain 201 includes wound generation block CP1.1, transaction block TX1.1, transaction block TX1.2, checkpoint area
Block CP1.2, transaction block TX1.3 and checkpoint block CP1.3, block chain 202 include wound generation block CP2.1, transaction block
2.1, checkpoint block CP2.2, transaction block TX2.2 and checkpoint block CP2.3.TX i.j represents the block chain of node i
J-th of transaction block, each transaction block only include transaction related with i-th of node.I.1, CP represents first of node i
Block (that is, wound generation block), CP i.j (j >=2) represents j-th of (wheel) checkpoint block of the block chain of node i.For example, relating to
And the same transaction of block chain node 101 and 102 is written to transaction block Tx 1.1 and block chain in block chain 201
In transaction block Tx 2.1 in 202.
After the Transaction Information in node verification transaction block is effective, transaction block or inspection (can be according to a upper block
Make an inventory of block) abstract (Hash) and the Transaction Information of current block generate general transaction block and enter chain, transaction block is not wide
It is multicast to block chain network.Since a transaction includes two nodes of sender and recipient, for each transaction, together
One trade fair is written in the block chain of initiator and recipient's node.For example, trading from node i to s-th of node j
It is expressed as tr (i- > j, s), it can only be recorded on the block chain of node i and node j.The friendship of one transaction tr (i- > j, s)
Easy information can include but is not limited to: transaction initiator and recipient, i.e. i and j;Unique transaction serial number, to be mapped to the friendship
Easy tr (i- > j, s);The source index (or source transaction) of transaction, can support the source transaction set of initiator's credential source
(that is, initiator is to trade to obtain by which to need the voucher that shifts) is closed, i.e., what it was indicated, which is that front is all, is sent to
The set of the transaction of node i;Transaction certificate is the equity of the represented transfer of transaction;Trading signature information is (for example, node
(i or j) is to the signature of transaction);Etc..
Other than creating generation block, node can propose checkpoint block according to itself number of transaction, confirmation situation etc..Such as
The checkpoint block of fruit node confirmation in need can propose that common recognition message, the common recognition from multiple nodes disappear during common recognition
Breath, which is packaged into block and is broadcast to block chain network, knows together to generate common recognition result.Common recognition message may include but unlimited
In: node serial number;Checkpoint round number;The abstract (Hash) of previous checkpoint block;The father area of current check point block
The abstract of block;Block number of the previous checkpoint block in block chain;Block number of the current check point block in block chain;
Signature of the node to the current checkpoint block;Etc..The current checkpoint block may include being generated based on common recognition result
Consensus information.After proposing common recognition message, block chain network will collect the checkpoint block of all epicycles propositions, and by common total
Know the common recognition that algorithm is formed between chain.Common recognition algorithm used herein includes but is not limited to: such as PoW (proof of work),
Allow the malicious node not higher than 50%;PoS (equity proves);BFT (Byzantine failure tolerance) allows the malice section less than 1/3
Point;Etc..This common recognition only comprising being ready the checkpoint block that the node that checkpoint block is known together is proposed, does not include and hands over
Easy information, the node not comprising epicycle no deal.
Fig. 3 shows the process of the exemplary information processing method 300 based on block chain according to the embodiment of the present disclosure.It can
To execute method 300 at the block chain node of the block chain network of Fig. 1.As shown in the flowchart, method 300 includes following step
It is rapid:
Step 301: the trading post including Transaction Information is generated based on transaction related with the first node of block chain network
Block.In this step, transaction block is related to the transaction of node.For example, each trade is recorded in the initiator of transaction and connects
In the transaction block of the block chain of debit.
Step 302: block of trading is added to the block of first node to transaction block without common recognition
Chain, the block chain of first node further includes checkpoint block and checkpoint block includes consensus information.In this step, different
In traditional block chain, block of trading is added directly in the block chain of node without common recognition, save to transaction block into
Row common recognition the time it takes.
Step 303: knowing together to the new checkpoint block in the block chain of first node to be added to.In the step
In, the transaction block to ensure between two adjacent checkpoint blocks of being known together to checkpoint block can be broadcast to
The common recognition of the whole network is obtained under the premise of the whole network.
Step 304: the first transaction of first node being verified, wherein transaction block corresponding with the first transaction
Between two neighboring checkpoint block in the block chain of first node.In this step, friendship corresponding with the first transaction
Easy block is located between two adjacent checkpoint blocks, so as to be not broadcast to the whole network but obtain the first of the whole network common recognition trade into
Row verifying.
In one example, step 303 may include: to send to the second node of block chain network to new checkpoint area
The common recognition message that block is known together, the type of father's block of the new checkpoint block are transaction blocks;The new checkpoint area
Block includes the consensus information generated based on the common recognition result from second node, and the new checkpoint block is added to institute
State the block chain of first node.In this step, for example, during common recognition, the common recognition node into block chain network is sent altogether
Know message.
In one example, sending common recognition message to the second node of block chain network may include: based on the predetermined time
And/or number of transaction sends common recognition message.
In one example, common recognition message includes: node serial number, checkpoint block round number, previous checkpoint area
The abstract of block, new checkpoint block father's block block number in block chain of abstract, previous checkpoint block, new
Block number of the checkpoint block in block chain, node for new checkpoint block signature.
In one example, step 304 may include: and obtain and first from transaction block corresponding with the first transaction
It trades associated first Transaction Information;Confirm that the first Transaction Information whether there is in third to the third node of block chain network
In transaction block between the adjacent two checkpoint block of the block chain of node;In the presence of confirmation, is used
One Transaction Information verifies the first transaction.In this step, if the first Transaction Information exists only in the initiator of the first transaction
With the transaction block on one in recipient block chain or where the first Transaction Information not in two adjacent inspections
When between point block, the first Fail Transaction is verified.
In one example, first node is one in the initiator and recipient of the first transaction, and third node
It is another in the initiator and recipient of the first transaction.For example, first node is the initiator of transaction, third node is to hand over
Easy recipient.Alternatively, first node is the recipient of transaction, third node is the sender of transaction.
In one example, transaction included by the transaction block in the block chain of each node in block chain network is believed
Breath includes the following terms: the initiator and recipient of transaction, support the source of initiator's credential source of transaction to hand at transaction serial number
Easy set, transaction certificate, trading signature information;Wound generation block in the block chain of each node of block chain network is to pre-create
Checkpoint block and including initial credential information as consensus information, the transaction in the not no source of initial credential information instruction, and
And other checkpoint blocks in the block chain of each node include the consensus information generated based on common recognition result.
In one example, the first transaction is verified using the first Transaction Information may include at least one of the following:
Determine whether the items in the first Transaction Information are correct;Determine the first transaction first transaction initiator block chain in whether
Only occur primary;In the block chain of first node and third node, determination and the transaction block phase where the first Transaction Information
It is identical when whether consensus information included by adjacent two checkpoint blocks is with previous common recognition.In this step, node is handed in verifying
Easily whether it is legal when, can check following item: whether the items of Transaction Information correct, include whether to be correctly signed;Transaction
Whether only occur once, to avoid dual cost on the block chain of transaction initiator;Determine the consensus information of checkpoint block
Whether it is tampered, if being tampered means that the transaction between the block of checkpoint may be insecure.
In one example, it can also include: for the first transaction letter that the first transaction is verified using the first Transaction Information
Each source transaction in source Transaction Set in breath, it is each next to trace this from the block chain of each node of block chain network
The source transaction of source transaction is handed over until the initial credential information in wound generation block, second with acquisition including the source Transaction Set
Easily set and the second Transaction Information relevant to the second Transaction Set;It is verified using the second Transaction Set and the second Transaction Information
First transaction.In step, recursively collects and support the source transaction of initiator's voucher of the first transaction and coming for source transaction
Source transaction without source until trading in wound generation block, to verify to the first transaction.
In one example, the first transaction is verified using the second Transaction Set and the second Transaction Information includes in following
At least one of: it whether determines in the initiator of each transaction and the block chain of recipient in the second Transaction Set with identical
The second Transaction Information;In the initiator of each transaction in the second Transaction Set and the block chain of recipient, second is determined
Whether whether correct and the second Transaction Information includes in the transaction being located between two checkpoint blocks to the items of Transaction Information
In block;Determine whether each transaction in the second Transaction Set only occurs one in the block chain of the initiator of each transaction
It is secondary;In the initiator of each transaction in the second Transaction Set and the block chain of recipient, determining and the second Transaction Information institute
The adjacent two checkpoint blocks of transaction block included by consensus information whether with previous common recognition when it is identical;Or it is based on
The transaction certificate and the initial credential information in wound generation block of first transaction and each transaction in the second Transaction Set, determine
Whether the initiator of the first transaction there is sufficient voucher to support the first transaction.In this step, node is in verifying transaction
When no legal, can verify the transaction source transaction it is whether legal, and based on transaction and its source transaction transaction certificate and
Whether the voucher for the initiator that the initial credential information in wound generation block can calculate transaction is enough to complete transaction (for example, such as
Fruit is inadequate, then trades illegal).
In one example, block chain network may include cache node, and the cache node is for caching block chain network
In at least one node block chain at least part, to provide this at least when at least one node is inaccessible
Described at least part of the block chain of one node.There is provided cache node can some node in block chain network can not
(for example, node off-line) provides the data of the block chain of the node when accessed.
According to the embodiment that Fig. 3 is described, each node safeguards oneself independent block chain, when being traded, transaction
Participant node collects Correspondent Node data according to number one on demand, verifies and completes to trade, therefore significant reduces mesh
Due to needing to know together to All Activity in system and bring data transfer loads and common recognition complexity in preceding block catenary system
Degree.
Fig. 4 shows the exemplary common recognition method 400 based on block chain according to the embodiment of the present disclosure.It can be Fig. 1's
Method 400 is executed at the block chain node of block chain network.As shown in the flowchart, method 400 the following steps are included:
Step 401: the trading post including Transaction Information is generated based on transaction related with the first node of block chain network
Block.
Step 402: block of trading is added to the block of first node to transaction block without common recognition
Chain.
Step 403: the common recognition message known together to new checkpoint block is sent to the second node of block chain network,
The type of father's block of the new checkpoint block is transaction block.
In one example, Transaction Information includes but is not limited to: the initiator and recipient of transaction, support transaction serial number
The source Transaction Set of initiator's credential source of transaction, transaction certificate, trading signature information.
In one example, sending common recognition message to the second node of block chain network may include: based on the predetermined time
And/or number of transaction sends common recognition message.
In one example, common recognition message can include but is not limited to: node serial number, checkpoint block round number, are preceding
The abstract of one checkpoint block, the abstract of father's block of new checkpoint block, previous checkpoint block are in block chain
Block number in block chain of block number, new checkpoint block, node for new checkpoint block signature.
Step 404: the new checkpoint block includes the consensus information generated based on the common recognition result from second node,
And the new checkpoint block is added to the block chain.
In one example, the wound generation block in the block chain is the checkpoint block pre-created and including initial voucher
Information is as consensus information.
According to the embodiment that Fig. 4 is described, reduced in current block catenary system significantly due to needing to own in system
Transaction is known together and bring data transfer loads and common recognition complexity.
Fig. 5 shows the exemplary common recognition method 500 based on block chain according to the embodiment of the present disclosure.It can be Fig. 1's
Method 500 is executed between two block chain nodes of block chain network.As shown in the flowchart, method 500 the following steps are included:
Step 501: at the first node of block chain network, sending to the second node of block chain network to new inspection
The common recognition message that point block is known together.
Step 502: second node determines whether common recognition message is effective, if it is valid, being known together based on common recognition message
Processing, and common recognition result is sent to first node.
Step 503: new checkpoint block includes the consensus information generated based on common recognition result, and first node is by new inspection
Make an inventory of the block chain that block is added to first node, the block chain of first node further includes transaction block, transaction block include with
The associated Transaction Information of the transaction of first node.
In one example, transaction block is the block without common recognition and including associated with the transaction of first node
Transaction Information.
In one example, the type of father's block of new checkpoint block is transaction block.
In one example, step 501 may include: that common recognition message is sent based on predetermined time and/or number of transaction.
In one example, common recognition message includes but is not limited to: node serial number, checkpoint block round number, are previous
The abstract of checkpoint block, new checkpoint block father's block area in block chain of abstract, previous checkpoint block
Block number in block chain of block number, new checkpoint block, node for new checkpoint block signature.
In one example, second node determines whether common recognition message is effective based on one or more in following: inspection
Make an inventory of block round number;Signature of the node to new checkpoint block;Whether new checkpoint block is already present on previously
Common recognition in;It is previous whether the previous checkpoint block in common recognition message has been present in as previous checkpoint block
In common recognition.For example, following message of knowing together will be considered as invalid: a) checkpoint round number (r) is incorrect during common recognition
(such as number-skipping, repeated number);B) signature for message of knowing together is incorrect;C) before the checkpoint in message of knowing together is already present on
In common recognition;D) the previous checkpoint in message of knowing together has been used as previous checkpoint to be present in some common recognition (that is, preceding
By with twice, there is bifurcated in block chain chain for one checkpoint).
In one example, carrying out common recognition processing based on common recognition message in step 502 may include: to based on common recognition message
The abstract of generation carries out common recognition processing.
In one example, the wound generation block in the block chain of first node is the checkpoint block pre-created and including first
Beginning credential information, initial credential information indicate the transaction in not source.
According to the embodiment that Fig. 5 is described, reduced in current block catenary system significantly due to needing to own in system
Transaction is known together and bring data transfer loads and common recognition complexity.
Fig. 6 shows the exemplary authentication method 600 based on block chain according to the embodiment of the present disclosure.It can be Fig. 1's
Method 600 is executed at the block chain node of block chain network.As shown in the flowchart, method 600 the following steps are included:
Step 601: at the first node of block chain network, being obtained from the block chain of first node and the first transaction phase
Associated first Transaction Information, wherein the first Transaction Information is located at the adjacent checkpoint the Liang Ge area of the block chain of first node
In transaction block between block.
Step 602: confirming that the first Transaction Information whether there is in the area of second node to the second node of block chain network
In transaction block between the adjacent two checkpoint block of block chain.
Step 603: in the presence of confirmation, the first transaction is verified using the first Transaction Information, wherein block chain
The transaction block of the block chain of each node of network includes Transaction Information associated with the transaction of each node, and should
The checkpoint block of the block chain of each node includes consensus information.
In one example, first node is one in the initiator and recipient of the first transaction and second node is
It is described first transaction initiator and recipient in another.
In one example, the Transaction Information in each transaction block in the block chain of each node of block chain network
Including the following terms: the initiator and recipient of transaction, support the source of initiator's credential source of transaction to trade at transaction serial number
Set, transaction certificate, trading signature information;Wound generation block in the block chain of each node of block chain network pre-creates
Checkpoint block and including initial credential information as consensus information, the transaction in the not no source of the initial credential information instruction,
And other checkpoint blocks in the block chain of each node include the consensus information generated based on common recognition result.
In one example, step 603 may include at least one of the following: determine the items in the first Transaction Information
It is whether correct;It is primary to determine whether the first transaction only occurs in the block chain of the initiator of the first transaction;In first node and
In the block chain of second node, determine included by two checkpoint blocks adjacent with the transaction block where the first Transaction Information
Consensus information it is whether identical as when previously being known together.
In one example, step 603 can also include: for every in the source Transaction Set in the first Transaction Information
A source transaction traces the source transaction of each source transaction until creating generation from the block chain of each node of block chain network
Initial credential information in block includes the second Transaction Set of source Transaction Set and related to the second Transaction Set to obtain
The second Transaction Information;The first transaction is verified using the second Transaction Set and the second Transaction Information.
In one example, it may include following for the first transaction being verified using the second Transaction Set and the second Transaction Information
At least one of in: whether determine has in the initiator of each transaction and the block chain of recipient in the second Transaction Set
Identical second Transaction Information;In the initiator of each transaction in the second Transaction Set and the block chain of recipient,
Determine the second Transaction Information it is every whether correct and the second Transaction Information whether be included in positioned at two checkpoint blocks it
Between transaction block in;Determine each transaction in the second Transaction Set in the block chain of the initiator of each transaction whether
Only occur primary;Determine whether the source transaction of each source transaction in the Transaction Set of source is included in the second Transaction Set
In;In the initiator of each transaction in the second Transaction Set and the block chain of recipient, determining and the second Transaction Information institute
The adjacent two checkpoint blocks of transaction block included by consensus information it is whether identical as when previously being known together;Or base
The transaction certificate of each transaction in the first transaction and the second Transaction Set and the initial credential information in wound generation block, really
Whether the initiator of fixed first transaction there is sufficient voucher to support the first transaction.
In one example, block chain network may include cache node, and the cache node is for caching block chain network
In at least one node block chain at least part, so as to when at least one described node is inaccessible provide described in
At least part of the block chain of at least one node.
According to the embodiment that Fig. 6 is described, the disposal right of a large amount of point-to-point transaction, verifying power are transferred to friendship from common recognition node
Easy both sides' node, realizes partial autonomy, has effectively removed aggregate network throughput limitation, under the premise of guaranteeing safety significantly
Improve the transaction performance of block chain.
Fig. 7 shows according to an embodiment of the present disclosure based on the exemplary common recognition of block chain or verifying or information processing
The schematic diagram of device 700.Device 700 may include: memory 701 and the processor 702 for being coupled to memory 701.Memory
701 for storing instruction, and processor 702 is configured as the instruction stored based on memory 701 realize device 700 for figure
One or more of any step in the step of method described in 3- Fig. 6.
As shown in fig. 7, device 700 can also include communication interface 703, for carrying out information exchange with other equipment.This
Outside, device 700 can also include bus 704, and memory 701, processor 702 and communication interface 703 are by bus 704 come each other
It is communicated.
Memory 701 may include volatile memory, also may include nonvolatile memory.Processor 702 can be with
It is central processing unit (CPU), microcontroller, specific integrated circuit (ASIC), digital signal processor (DSP), field-programmable
Gate array (FPGA) or other programmable logic device or the one or more collection for being configured as realization the embodiment of the present invention
At circuit.
Fig. 8 shows a specific example 800 according to the embodiment of the present disclosure.The example 800 is paid close attention in block chain network
Three nodes A, B, C.Node A, B, C are respectively provided with block chain 801,802 and 803, in which: A (does not show with certain other nodes X
Transaction occurred out), is denoted as transaction and transaction block Tx1.1 is denoted as on its local block chain to 1, A;Transaction occurred for A and B, remembered
It transacts business and the block Tx1.2 that trades is denoted as on its local block chain to 2, A, B is denoted as transaction block Tx2.1 on its local block chain.
Without loss of generality, it is assumed that each transaction block includes a Transaction Information.
Consider that the transaction of node C and B, transaction give C to 3:B transfer voucher (for example, 20) now.For B, initiating
In order to prove the credential source of node B when shifting voucher, need incidentally to provide in Transaction Information simultaneously wound generation block CP2.1 and
Trade block Tx2.1.Consider three kinds of situations: normal binode transaction, counterparty side do evil transaction, counterparty side upstream
Node is done evil transaction.
Normal binode transaction
For node C, in order to verify documentary (for example, 20) really node B, the source for needing to collect Tx2.1 is handed over
Easily.Since node B and A trades, then transaction block Tx1.1, Tx1.2 of node A is received until creating generation block CP1.1 needs
Collection.Again since node A trades in Tx1.1 with other nodes X, then trade there is still a need for recurrence collection and node A that
The transaction of a other nodes X and wound generation block, until forming closure.
It is a legal transaction that Tx2.1 can be verified in the following manner: a) in the initiator of transaction and recipient
Possess this identical Transaction Information simultaneously on block chain, i.e. Tx2.1 is identical as Tx1.2, on respective block chain;B) it hands over
Items in easy information are correct, and Transaction Information is correctly signed and is sandwiched between two checkpoints, and checkpoint into
Went common recognition, i.e. the checkpoint of left and right two of Tx2.1 is respectively CP2.1 and CP2.2, has carried out the whole network common recognition;C) without double
It spends again, this transaction only occurs once on the block chain of transaction initiator, i.e. Tx2.1 does not occur repeatedly;D) it is used to mention
Source transaction (and source transaction after iteration on other nodes) for the source transaction for initiator's credential source of trading all is collected
Arrive, and be verified, i.e., before at the time of generating Tx2.2, there are two the transaction of the source of node B, respectively Tx2.1 and
CP1.1 (wound generation block, initial credential information write direct wound generation block), has been collected into and has been verified;E) trade initiator
Voucher it is sufficient, such as calculated according to discs, the voucher that node B possesses at present can be obtained by the All Activity of calculate node B
Out.
In the process, the transaction that two CP nodes are used to ensure to occur in the two sections CP can be broadcast to
The common recognition of the whole network is obtained under the premise of the whole network, because once changing any one data of any one transaction in the section CP, is tested
Card person will not be inconsistent when verifying the transaction in the section CP with transaction real data, insincere so as to cause the transaction of the node.
Counterparty side does evil transaction
Block chain network in example 800 is that present networks are based on self-interested.Node is done evil for node itself simultaneously
There is no benefit.Other nodes can pass through caching and trade with the source oneself traded, it was demonstrated that oneself fund it is legal
Source.Source transaction is traded or regenerated in node of doing evil modification source can not change historical results, honeysuckle can not be caused to attack
Hit because its can not provide can also be by checkpoint block that the whole network recognizes after reversing block chain.
For example, transaction block Tx2.1 is that one of B produces transaction, and B attempts to deny Tx2.1 at this time if B is node of doing evil
Presence and attempt by proposing that Tx2.2 transfers accounts the money for oneself having produced A to C (honeysuckle), then at this time: C is being generated
Need to check whether all checkpoint block CP2.2 and CP2.1 of B are consistent with Hash when carrying out the whole network common recognition originally when Tx3.1.
There are two types of methods of doing evil by B at this time: a) removing or modifies Tx2.1, regenerate a legal checkpoint block CP2.2, then CP2.2
It will be detected bifurcated in a network, cannot be known together;B) remove or modify Tx2.1, continue to use the CP2.2 to be known together, then
The Hash verifying of CP2.2 will not pass through, and cannot be recognized by node C.No matter that method of doing evil, B all will destroy before by the whole network
Transaction between the CP2.1 and CP2.2 of common recognition, therefore will be unable to success.
The upstream node of counterparty side is done evil transaction
Such as trade between node B, C, if the transaction of front nodal point B and A that the transaction involves and node A does evil at this time
When not recognizing Tx1.2: B, should other any nodes as far as possible in untrusted network according to egoism principle.At that time with
When node A trades, B can trade in all sources for supporting Tx2.1 transaction of local cache.In this way when node C exists
When seeking source transaction, the help that node B may not need node A just provides source to node C and trades.It is also avoided in this way when section
The problem of transaction can not obtain after point A is offline.
According to the example 800 that Fig. 8 is described, node will trade and signature verification and meet at the whole network by way of the block of checkpoint
It knows together, has effectively removed aggregate network throughput limitation, improve block chain significantly under the premise of guaranteeing safety
Transaction performance.
In addition, alternatively, the above-mentioned common recognition method based on block chain, verification method, information processing method can pass through
Computer program product, i.e., tangible computer readable storage medium embody.Computer program product may include computer
Readable storage medium storing program for executing, containing the computer-readable program instructions of the various aspects for executing the embodiment of the present disclosure.It calculates
Machine readable storage medium storing program for executing can be the tangible device that can keep and store the instruction used by instruction execution equipment.Computer can
Storage device electric, magnetic storage apparatus, light storage device, electric magnetic storage apparatus, half can be for example but not limited to by reading storage medium
Conductor stores equipment or above-mentioned any appropriate combination.The more specific example of computer readable storage medium is (non exhaustive
List) include: that portable computer diskette, hard disk, random access memory (RAM), read-only memory (ROM), erasable type can
Program read-only memory (EPROM or flash memory), static random access memory (SRAM), Portable compressed disk read-only memory
(CD-ROM), digital versatile disc (DVD), memory stick, floppy disk, mechanical coding equipment, the punching for being for example stored thereon with instruction
Card or groove internal projection structure and above-mentioned any appropriate combination.Computer readable storage medium used herein above is not
It is interpreted that instantaneous signal itself, such as electromagnetic wave of radio wave or other Free propagations pass through waveguide or other transmission
The electromagnetic wave (for example, the light pulse for passing through fiber optic cables) that medium is propagated or the electric signal transmitted by electric wire.
The foregoing is merely the alternative embodiments of the disclosure, are not limited to embodiment of the disclosure, for this field
Technical staff for, embodiment of the disclosure can have various modifications and variations.It is all embodiment of the disclosure spirit and
Within principle, made any modification, equivalence replacement, improvement etc., should be included in embodiment of the disclosure protection scope it
It is interior.In addition, although may about one in several embodiments come disclose embodiment special characteristic or in terms of, can be with
One or more of the other features or aspect of this features or aspect and other embodiment are combined, this is because its is right
It is expectation for any given or specific application and advantageous.
Although describing embodiment of the disclosure by reference to several specific embodiments, it should be appreciated that, the disclosure
Embodiment is not limited to disclosed specific embodiment.Embodiment of the disclosure be intended to cover appended claims spirit and
Included various modifications and equivalent arrangements in range.Scope of the following claims is to be accorded the broadest interpretation, thus comprising
All such modifications and equivalent structure and function.