CN108985772A

CN108985772A - A kind of verification method, device, equipment and the storage medium of block chain

Info

Publication number: CN108985772A
Application number: CN201810714971.0A
Authority: CN
Inventors: 邱俊炜
Original assignee: Shanghai Da Jia Ying Mdt Infotech Ltd
Current assignee: Shanghai Da Jia Ying Mdt Infotech Ltd
Priority date: 2018-07-02
Filing date: 2018-07-02
Publication date: 2018-12-11
Anticipated expiration: 2038-07-02
Also published as: CN108985772B

Abstract

The embodiment of the invention discloses verification method, device, equipment and the storage mediums of a kind of block chain, the described method includes: block verifying node, which receives block, generates the block to be verified that node is sent, it is the node elected by setting common recognition mechanism that block, which generates node,；Block verifying node obtains the data of financial transaction in block to be verified；Include: in data of financial transaction and at least one associated historical data identification information of historical financial transaction data；Block verifies node according to the historical data identification information of data of financial transaction, carries out data verification to the data of financial transaction in block to be verified.The technical solution realization of the embodiment of the present invention can effectively avoid wrong data that block chain is added, and then guarantee the validity of data in block chain network.

Description

A kind of verification method, device, equipment and the storage medium of block chain

Technical field

The present embodiments relate to block chain technical field more particularly to a kind of verification methods of block chain, device, equipment And storage medium.

Background technique

Block chain is the novel of the computer technologies such as Distributed Storage, point-to-point transmission, common recognition mechanism, Encryption Algorithm Application model.In distributed node system, the power of currently processed data is obtained by node competition, generates and saves as block Point；After the block of generation is using the verifying confirmation of other nodes, then stored.Above-mentioned operating mechanism to remember in block chain Data of the record in block are almost impossible to be tampered.

In the prior art, block chain master is to solve the trust and safety problem of transaction, so one of them is significant special Point is distributed account book.Specifically, the node in block catenary system, by the transaction request or certain amount in certain time Transaction request, consign to the current block with book keeping operation power and generate node；Block generates node and carries out such as to transaction request The processing such as information conversion, Format adjusting or code operation, form account book data, multiple account book data are then packed into area Block；Block generates node and block is sent to other nodes in block catenary system, other nodes carry out same treatment process, Whether the block obtained with verification processing result is consistent with the block received, approves the block if consistent and stores, otherwise The block is not approved and is abandoned.Block generates node and mainly passes through common recognition algorithm generation, and existing common recognition algorithm mainly includes digging Mine algorithm and the non-common recognition algorithm two major classes for digging mine.

In the implementation of the present invention, the discovery prior art has following defects that inventor

It is non-dig mine common recognition algorithm in, if source data before block chain is added if having existed mistake, can Cause the authenticity of follow-up data to leave a question open, while wasting the memory space of node, generates a large amount of meaningless blocks, and having can It can lead to " honeysuckle " problem.

Summary of the invention

The embodiment of the present invention provides verification method, device, equipment and the storage medium of a kind of block chain, effectively avoids mistake The problem of block chain is added in data, and then guarantees the validity of data in block chain network.

In a first aspect, the embodiment of the invention provides a kind of verification methods of block chain, comprising:

Block verifies node and receives the block to be verified that block generates node transmission, and it is by setting that the block, which generates node, Surely the node that common recognition mechanism elects；

The block verifying node obtains the data of financial transaction in the block to be verified；In the data of financial transaction Include: and at least one associated historical data identification information of historical financial transaction data；

The block verifies node according to the historical data identification information of the data of financial transaction, to described to be tested The data of financial transaction demonstrate,proved in block carries out data verification；

Wherein, newest historical financial transaction data is stored in the block verifying node.

Second aspect, the embodiment of the invention provides a kind of verification methods of block chain, comprising:

Block generates node and generates the block verifying node that block to be verified is sent to block chain network, and the block generates Node is the node elected by setting common recognition mechanism；Wherein, the block to be verified includes data of financial transaction, the gold Melt in transaction data and includes: and at least one associated historical data identification information of historical financial transaction data；The block is raw The block verifying node is obtained according to the historical data identification information of data of financial transaction in the block to be verified at node The block verification result that the block to be verified is verified；

Wherein, the block generates in node and is stored with whole historical financial transaction data.

The third aspect, the embodiment of the invention also provides a kind of verifying devices of block chain, are configured at block verifying node, Include:

Block reception module generates the block to be verified that node is sent for receiving block, and the block generates node and is The node elected by setting common recognition mechanism；

Data acquisition module, for obtaining the data of financial transaction in the block to be verified；The data of financial transaction In include: and at least one associated historical data identification information of historical financial transaction data；

Data Verification module, for the historical data identification information according to the data of financial transaction, to it is described to The data of financial transaction verified in block carries out data verification；

Fourth aspect, the embodiment of the invention also provides a kind of verifying devices of block chain, are configured at block and generate node, Include:

Block generation module, the block that block chain network is sent to for generating block to be verified verify node, the area It is the node elected by setting common recognition mechanism that block, which generates node,；Wherein, the block to be verified includes data of financial transaction, Include: in the data of financial transaction and at least one associated historical data identification information of historical financial transaction data；

As a result module is obtained, for obtaining the block verifying node according to data of financial transaction in the block to be verified Historical data identification information block verification result that the block to be verified is verified；

5th aspect, the embodiment of the invention also provides a kind of computer equipment, the computer equipment includes:

One or more processors；

Storage device, for storing one or more programs；

When one or more of programs are executed by one or more of processors, so that one or more of processing Device realizes the verification method of any block chain in first aspect.

6th aspect, the embodiment of the invention also provides a kind of computer equipment, the computer equipment includes:

One or more processors；

Storage device, for storing one or more programs；

When one or more of programs are executed by one or more of processors, so that one or more of processing Device realizes the verification method of any block chain in second aspect.

7th aspect, the embodiment of the invention also provides a kind of computer storage mediums, are stored thereon with computer program, The verification method of any block chain in first aspect is realized when the program is executed by processor.

Eighth aspect, the embodiment of the invention also provides a kind of computer storage mediums, are stored thereon with computer program, The verification method of any block chain in second aspect is realized when the program is executed by processor.

The embodiment of the present invention verifies node by block and receives the block to be verified that block generates node transmission, obtains to be tested The data of financial transaction in block is demonstrate,proved, and according to the historical data identification information of data of financial transaction, in block to be verified Data of financial transaction carries out data verification.Due to being stored with newest historical transactions data, and history number in block verifying node It can serve to indicate that Transaction Information is associated with historical transactions data according to identification information, therefore, can effectively solve the problem that existing application " honeysuckle " problem present in the non-block chain for digging mine common recognition algorithm, effectively avoids wrong data that block chain is added, and then guarantee The validity of data in block chain network.

Detailed description of the invention

Fig. 1 is a kind of flow chart of the verification method for block chain that the embodiment of the present invention one provides；

Fig. 2 is a kind of flow chart of the verification method of block chain provided by Embodiment 2 of the present invention；

Fig. 3 is a kind of flow chart of the verification method for block chain that the embodiment of the present invention three provides；

Fig. 4 is a kind of schematic diagram of the verifying device for block chain that the embodiment of the present invention four provides；

Fig. 5 is a kind of schematic diagram of the verifying device for block chain that the embodiment of the present invention five provides；

Fig. 6 is a kind of structural schematic diagram for computer equipment that the embodiment of the present invention six provides.

Specific embodiment

The present invention is described in further detail with reference to the accompanying drawings and examples.It is understood that this place is retouched The specific embodiment stated is used only for explaining the present invention rather than limiting the invention.

It also should be noted that only the parts related to the present invention are shown for ease of description, in attached drawing rather than Full content.It should be mentioned that some exemplary embodiments are described before exemplary embodiment is discussed in greater detail At the processing or method described as flow chart.Although operations (or step) are described as the processing of sequence by flow chart, It is that many of these operations can be implemented concurrently, concomitantly or simultaneously.In addition, the sequence of operations can be by again It arranges.The processing can be terminated when its operations are completed, it is also possible to have the additional step being not included in attached drawing. The processing can correspond to method, function, regulation, subroutine, subprogram etc..

Embodiment one

Fig. 1 is a kind of flow chart of the verification method for block chain that the embodiment of the present invention one provides, and the present embodiment is applicable The case where node carries out data verification to the data of financial transaction in block to be verified is verified in block, this method can be by block The verifying device of chain executes, which can be realized by the mode of software and/or hardware, and can generally be integrated in computer In equipment, which can be the equipment for undertaking block chain node.Correspondingly, as shown in Figure 1, this method includes as follows Operation:

S110, block verifying node receive block and generate the block to be verified that node is sent, and the block generates node and is The node elected by setting common recognition mechanism.

Wherein, block chain network can be publicly-owned chain or alliance's chain.Block chain network may include basic chain, i.e. main chain, It may include simultaneously side chain, subchain or lightning network.Block verifying node, which can be, participates in block generation node transmission block Other block chain network nodes of verification process.Block, which generates node and can be, possesses block processes permission in block chain network Node.The common recognition mechanism of mine can be dug with right and wrong by setting common recognition mechanism, such as PBFT (Practical Byzantine Fault Tolerance, practical Byzantine failure tolerance algorithm) or Raft algorithm.

In embodiments of the present invention, the block generation node for possessing block processes permission can be from the caching of block chain network Area obtains transactions requests, and after handling transactions requests, is packaged and is beaten according to transactions requests and obtained Transaction Information Packet generates block to be verified.Wherein, transactions requests can for the transaction request that occurs in a period of time in block chain network or Other requests to be processed.Block generates node can be by encrypted communication to be verified into block chain network, so that block is verified Node verifies block to be verified.Meanwhile block generation node can also participate in the verification process of block to be verified.

S120, block verifying node obtain the data of financial transaction in the block to be verified；The financial transaction Include: in data and at least one associated historical data identification information of historical financial transaction data.

Wherein, data of financial transaction includes but is not limited to that funds transaction, share exchange, digital cash transaction and fund are handed over Easily etc..Historical data identification information can be the number or mark of the associated historical financial transaction of instruction current financial transaction data Know etc..

In embodiments of the present invention, block verify node when being verified to block to be verified, can obtain first to Verify the historical data identification information in the data of financial transaction in block.

In an alternate embodiment of the present invention where, it may include: data identification information in the data of financial transaction, turn The side's of entering information and the side's of producing information；The side's of being transferred to information include: with historical financial transaction data it is associated at least one go through History data identification information；The side's of producing information includes: that at least two types produce account.

Wherein, data identification information is used to indicate number or mark of current financial transaction data etc., is specifically as follows packet The character string of node identification, such as A0001 are included, it is of course also possible to which random number is added in number, avoids generating repetition number, example Such as number can be Ar0001, and wherein r is random number, and the digit of the random number can be set according to actual needs, and generate every time Random number be different from, and the Ar in the number only as mark, without count, by number in 0001 as starting number It is counted, such as r=123, the count range of initial number A1230001 is A1230001-A1239999.The present invention Embodiment is not defined the method and form of the number for realizing data of financial transaction.Correspondingly, the side's of producing information can be with It is that assets, equity, ideal money or fund for being related to etc. produce account in transaction, for example, when 1,000 strands of stocks are sold to A by B When, then the address for being used to store the 1000 strands of stocks bought in A can be used as one and produce account.Correspondingly, the side's of being transferred to information can To be historical data mark corresponding with the associated historical financial transaction data of current financial transaction data in data of financial transaction Know information.For example, when 1,000 strands of stocks are sold to A by B, then number corresponding to the last relevant data of financial transaction of A and B It can be used as the side's of being transferred to information.It should be noted that in embodiments of the present invention, the side's of producing information not may include at least two not Same type produces account.It can be used for storing real estate as one of them produces account, another produces account can be with Store fictitious assets, such as stock, fund or digital cash.Certainly, the different types of account that produces can also store simultaneously not The fictitious assets of same type, the embodiment of the present invention is to this and is not limited.

In embodiments of the present invention, data of financial transaction can specifically include this data of financial transaction in block to be verified Corresponding data identification information, at the same time it can also include the specific corresponding side's of the being transferred to information of this data of financial transaction and produce Square information.In addition, data of financial transaction also needs to include the specific amount of money being related to of trading, such as 2,000 yuan of RMB or fictitious assets Corresponding quantity, such as 1,000 strands of T stocks, wherein T can indicate the type of stock.

In an alternate embodiment of the present invention where, the account that produces may include: the gold to circulate in real world Melt the account of currency, and the account of the virtual trading object in virtual world circulation, the virtual trading object may include: number Currency or virtual objects.

Wherein, the account of the financial currency to circulate in real world can be the account for storing real estate, such as RMB, dollar or Euro etc..It can be in the account of the virtual trading object of virtual world circulation for storing virtual trading object Account, wherein virtual trading object may include digital cash or virtual objects, digital cash include but is not limited to bit coin, Lay spy coin, dog dog coin, ingot coin, good fortune source coin or auspicious wave coin etc.；Virtual objects include but is not limited to stock or fund etc..

Optionally, in embodiments of the present invention, two distinct types of account can be respectively corresponded by producing account, wherein one Kind account can be used for storing the financial currency of reality circulation, another account can be used for storing the virtual friendship virtually circulated Easy object.

In an alternate embodiment of the present invention where, when the historical financial transaction data is raw financial transaction data When, it may include: data identification information, the side's of being transferred to information and the side's of producing information in the historical financial transaction data；It is described The side's of being transferred to information may include: original data source.

Wherein, raw financial transaction data can pertain only to raw financial data, for example, in raw financial transaction data In, the side's of being transferred to information can not include historical data identification information, but including original data source information.

Illustratively, it is assumed that 1 strand 10 pieces of T stock, node A has 1,000,000 RMB real estates, and node B equally has 1,000,000 RMB Real estate.Wherein, 1,000,000 node A and the corresponding original data source of node B be can be.If node B has bought 10,000 gangs T strands Ticket, then the corresponding raw financial transaction record of node A can be { SN:A0001, IN:100 ten thousand, quantity: 0, OUT: the ground of node A Location 1, the amount of money: the address 2 of 1,000,000, OUT: node A }；The corresponding raw financial transaction record of node B can be SN:B0001, IN:100 ten thousand, quantity: 10,000 T stocks, OUT: node B address 1, the amount of money: the address 2 of 900,000, OUT: node B }.Wherein, IN word Section is for identifying original data source information, i.e., original real estate 1,000,000, and address 1 is the address of fictitious assets, and address 2 is true The address of real assets.If historical financial transaction data is not original data source information, IN field is for identifying the side's of being transferred to letter Breath, specifically can be historical data identification information.The corresponding information of OUT field, which can be, different types of produces account.

S130, the block verify node according to the historical data identification information of the data of financial transaction, to institute The data of financial transaction stated in block to be verified carries out data verification.

It in embodiments of the present invention, can be according to block to be verified after block verifying node receives block to be verified The historical data identification information of middle data of financial transaction carries out data verification to it.Meanwhile it can store in block verifying node There is newest historical financial transaction data, so that the data of financial transaction verified to needs provides verifying foundation.It needs to illustrate It is, in block chain network, since network delay or other factors tend to lead to the problem of " honeysuckle ".Wherein, " honeysuckle " can To be same part data for completing two different affairs.For example, " honeysuckle " can be same fund for two kinds of differences Transaction.In embodiments of the present invention, since every data of financial transaction all only unique data identification informations are corresponding, and The generation of data identification information is associated with the Transaction Information of historical financial transaction data.Therefore, according to data of financial transaction Historical data identification information, which carries out data verification to the Transaction Information in block to be verified, to effectively prevent wrong data to be added In block chain network, and then avoid leading to the problem of " honeysuckle ".

The embodiment of the present invention verifies node by block and receives the block to be verified that block generates node transmission, obtains to be tested The data of financial transaction in block is demonstrate,proved, and according to the historical data identification information of data of financial transaction, in block to be verified Data of financial transaction carries out data verification.Due to being stored with whole historical transactions data, and historical data in block verifying node Identification information can serve to indicate that Transaction Information is associated with historical transactions data, therefore, can effectively solve the problem that existing application is non- " honeysuckle " problem present in the block chain of mine common recognition algorithm is dug, effectively avoids wrong data that block chain is added, and then guarantee area The validity of data in block chain network.

Embodiment two

Fig. 2 is a kind of flow chart of the verification method of block chain provided by Embodiment 2 of the present invention, and the present embodiment is with above-mentioned It is embodied based on embodiment, in the present embodiment, gives and produce account to two kinds of in data of financial transaction The specific implementation of data verification is carried out respectively.Correspondingly, as shown in Fig. 2, the method for the present embodiment may include:

S210, block verifying node receive block and generate the block to be verified that node is sent, and the block generates node and is The node elected by setting common recognition mechanism.

S220, block verifying node obtain the data of financial transaction in the block to be verified；The financial transaction Include: in data and at least one associated historical data identification information of historical financial transaction data.

S230, block verifying node are obtained according to the historical data identification information of the data of financial transaction With the associated historical transactions data of the currently processed data of financial transaction as verify data, and according to the verifying number According to being verified to the currently processed data of financial transaction.

In embodiments of the present invention, block verifies node when verifying to currently processed data of financial transaction, can With the historical data identification information extracted in the data content of the currently processed data of financial transaction of direct basis, and according to history Data identification information searches corresponding historical financial transaction data as verify data, to realize to current in the local database The verifying of the data of financial transaction of processing.

In an alternate embodiment of the present invention where, the data identification information may include: the volume of data of financial transaction Number；The historical data identification information may include: the number of historical financial transaction data.Correspondingly, S230 specifically can be into Step refining is the concrete operations such as S231-S234.

S231, block verifying node obtain and the history gold according to the number of the historical financial transaction data Melt the corresponding historical financial transaction data of number of transaction data.

Specifically, block verifying node can be according to included by the side's of being transferred to information in currently processed data of financial transaction The number of historical financial transaction data, searches corresponding historical financial transaction data as verify data in the local database, To realize the verifying to currently processed data of financial transaction.

S232, block verifying node obtain each type corresponding with the historical financial transaction data and are transferred to account Corresponding whole is transferred to amount as the currently processed each type of data of financial transaction and produces account corresponding total Amount.

Correspondingly, block verifying node can be by the corresponding historical financial transaction data of the number of historical financial transaction data Corresponding each type is transferred to the corresponding whole of account and is transferred to amount, as the currently processed each class of data of financial transaction Type produces the corresponding full amount of account.It should be noted that the different types of account that produces is needed according to producing account Type is respectively calculated.

S233, block verifying node judge that each type produces account in the currently processed data of financial transaction Whether the corresponding summation for producing amount, which produces account with each type of currently processed data of financial transaction, is distinguished Corresponding full amount matches, if so, executing S234, otherwise executes S260.

S234, block verifying node determine that the currently processed data of financial transaction passes through verifying.

Correspondingly, if block verifying node determines that each type produces account point in currently processed data of financial transaction The not corresponding summation for producing amount and each type of currently processed data of financial transaction produce the corresponding total value of account Degree matches, then it is assumed that currently processed data of financial transaction can continue to execute subsequent operation by verifying.

S240, block verifying node are according to the data verification knot to data of financial transaction in the block to be verified Fruit obtains the block verification result to the block to be verified, and the block verification result is fed back to the block and is generated Node, so that the block generates node and determines whether the block to be verified passes through verifying.

Wherein, block verification result may include by verifying and unverified two kinds of forms.

In embodiments of the present invention, block verifying node is according to the number for completing all data of financial transaction in block to be verified After verifying, the block verification result whether block to be verified passes through verifying can be obtained.The area that block verifying node will obtain Block verification result is transmitted in block chain network, specifically block verification result can be fed back to area by the way of broadcast Block generates node.It, can be according to region after block generates the block verification result that node receives each block verifying node feeding back Determine whether block to be verified passes through verifying by verifying proportion in verification result.

It should be noted that in embodiments of the present invention, block generates node and can also verify to block to be verified, And obtain block verification result.

If the common recognition that S250, the block verifying node receive the block generation node feeding back passes through response, The block to be verified is added in block chain, and according to the data of financial transaction in the block to be verified to being locally stored Data of financial transaction is updated.

Wherein, common recognition can be block by response and generate node block to be verified according to determined by block verification result Common recognition result.For example, being set in the common recognition algorithm based on Raft when the ratio being verified in block verification result is more than or equal to When determining threshold value, such as (f+1)/(2f+1), then block, which generates node and can be generated, shows that block to be verified is logical by the common recognition of common recognition Cross response.

In embodiments of the present invention, when the common recognition that block verifying node receives block generation node feeding back passes through response Afterwards, it is determined that block to be verified passes through common recognition.At this point, block verifying node can will be added to by the block to be verified known together The tail portion of block chain, to complete uplink operation.Meanwhile block verifying node can also be according to the financial transaction in block to be verified Data are updated the data of financial transaction being locally stored, and specifically can be and are stored in block to be verified in the local database Newest data of financial transaction.

If the common recognition that S260, the block verifying node receive the block generation node feeding back does not pass through response, Delete the block to be verified.

Correspondingly, after block generates the block verification result that node receives each block verifying node feeding back, if according to Determine that block to be verified, then can be in block chain network not over verifying by verifying proportion in area validation result Transmission common recognition deletes block to be verified not by response.If block verifies node and receives block generation node feeding back Common recognition by response, does not show that currently processed block to be verified not over common recognition, then deletes block to be verified.

In a specific example, block generates node can store complete finance in the local data base of oneself Transaction record, remaining node are that ordinary node namely block verify node, and block verifies node can be in oneself local data Newest financial transaction record is stored in library.Stored financial transaction record can be used as input transaction note in database It records, financial transaction record to be verified can be used as output transaction record in block.In addition to every output transaction record is all necessary Can find corresponding input transaction record in the local database, the total transaction amount of every output transaction record must with it is corresponding The total transaction amount for inputting transaction record is consistent.

The financial transaction record of oneself is sent in public transaction buffer area by each node, and block generates node from public affairs A plurality of financial transaction record is taken out in total transaction buffer area and is put into block to be verified, and a plurality of financial transaction record is carried out The result of Hash operation is utilized oneself private key encryption by Hash operation, and encrypted Hash result is put into together to be tested It demonstrate,proves in block, the node broadcasts that then block to be verified is known together on block chain to all participations.Block generates node ginseng The public key decryptions block to be verified of node is generated using block after block verifying node receives the block to be verified with verifying In cryptographic Hash as a result, Hash result after being decrypted, then to a plurality of financial transaction record in block to be verified into Row Hash operation, the Hash result after decrypting in the Hash result and block that comparison operation obtains, unanimously then thinks that this is to be verified Block is to generate node by block to issue and be not tampered in transmission process.

After block verifying node receives block to be verified, one is carried out to the data of financial transaction for including in block to be verified One verifying.It is corresponding defeated that block verifying node can search historical data identification information in currently processed data of financial transaction Enter transaction record, whether the total transaction amount in comparison input transaction record and the total transaction amount in output transaction record are consistent, and one Cause is then verified.If all financial transaction records and output transaction record in block to be verified are verified, block Verifying node generates node to block and returns to the response being verified.Block generates node and receives a certain proportion of be verified After response, then determine that block common recognition to be verified passes through.Then the common recognition that block generates that node passes through common recognition passes through response in area It is broadcasted in block chain, the block verifying node and block for receiving broadcast message generate node and block to be verified are added to block chain Tail portion, to complete uplink operation.Meanwhile each node in block chain network can also be handed over according to the finance in block to be verified The financial transaction record for storing local data base is easily recorded to be updated.

Specifically, there are node A-C, node B-C to verify node for block in block chain, node A is that block generates node, Node A-C has the local data base of oneself.Assuming that 1 strand 10 pieces of T stock, node A has 1,000,000 RMB, node B to have 1,000,000 RMB, And node B has bought 10,000 T stocks.Then node A and node B is respectively by a financial transaction record { SN:A0001, IN:100 ten thousand, number Amount: 0, OUT: node A address 1, the amount of money: the address 2 of 1,000,000, OUT: node A } and { SN:B0001, IN:100 ten thousand, quantity: 1 Ten thousand T stocks, OUT: node B address 1, the amount of money: the address 2 of 900,000, OUT: node B } it is sent in public transaction buffer area. Wherein, SN indicates the corresponding number of this financial transaction record, and IN indicates that the corresponding number of historical financial transaction record (works as finance When transaction record is raw financial transaction data, IN can indicate the original asset information of current financial transaction record), quantity can To be that corresponding fictitious assets produces the corresponding particular transactions quantity of account, OUT indicates transaction output object, that is, produce account pair The address field answered.Wherein, when generating transaction record, if node can generate without the number of historical financial transaction record The number of initial financial transaction record assigns initial value, such as above-mentioned A0001 and B0001 to SN field, and in IN field Retain original data source, such as above-mentioned 1,000,000；Account is produced for indicating that node A real estate is corresponding in the address 1 of node A Account address is produced for indicating that node A fictitious assets is corresponding in the address 2 of address, node A.Similarly, 1 table of address of node B Show that node B real estate is corresponding and produce account address, the address 2 of node B is produced for indicating that node B fictitious assets is corresponding Account address.It should be noted that address 1 and address 2 can be name on account, concretely random string.On correspondingly, It states financial transaction record and means that node A possesses 1,000,000 RMB at present, be placed in the address 1 of node A.Node B also possesses 100 Ten thousand RMB have purchased 10,000 T stocks with therein 100,000, are placed in the address 1 of node B, and remaining 900,000 RMB is placed on node In the address 2 of B.

Further, block generates node A and takes out above-mentioned two financial transaction records from public transaction buffer area, and Hash operation is carried out to a plurality of financial transaction record, the result of Hash operation utilizes to the private key encryption of oneself, and by this Financial transaction record and encrypted Hash result are put into together in block to be verified, then by the block to be verified in block chain On to it is all participate in common recognition node broadcasts.After block verifying node B and C receive the block to be verified, generated using block Cryptographic Hash in the public key decryptions of node A block to be verified is as a result, Hash result after being decrypted, then to area to be verified This financial transaction record in block carries out Hash operation, Hash result that comparison operation obtains and after decrypting in block to be verified Hash result, unanimously then think the block to be verified be by block generate node issue and do not usurped in transmission process Change.

Further, node A-C detects above-mentioned two financial transaction records, and detecting does not have financial transaction number in IN field According to number, then recognize that the financial transaction record that receives is financial transaction source data.It should be noted that financial transaction source Data can guarantee its validity by setting method, such as financial transaction record is sent to Third Party Authentication node and is carried out Certification.Node A-C is verified to above-mentioned two financial transaction source datas, while block verifies node B-C and generates node A to block The verification result that feedback validation passes through.Block generation node A judges that block to be verified is logical according to the verification result received at this time Cross common recognition.Through common recognition, node A-C will according to the financial transaction record with initial number A0001 and B0001 The financial transaction record in block to be verified being locally stored is updated.That is, all being deposited in the local data base of node A-C at this time Financial transaction record { SN:A0001, IN:100 ten thousand, quantity: 0, OUT: node A address 1, the amount of money: 1,000,000, OUT: section are stored up The address 2 of point A } and SN:B0001, IN:100 ten thousand, and quantity: 10,000 T stocks, OUT: node B address 1, the amount of money: 900,000, OUT: The address 2 of node B }.

Correspondingly, if the financial transaction with node A has occurred in node B in subsequent period of time again, and share price is not sent out It changing dynamic, then node A and B can count and generate automatically new number to SN, and node B is sold to thousand T stock of node A1 at this time, and By next financial transaction record { SN:A0002, IN:A0001, B0001, the quantity: 2,000 T stocks, OUT: node A's of generation Address 1, the amount of money: the address 2 of 980,000, OUT: node A；SN:B0002, IN:A0001, B0001, quantity: 8,000 T stocks, OUT: section The address 1 of point B, the amount of money: the address 2 of 920,000, OUT: node B } it is sent in public transaction buffer area.This financial transaction note Record means that the first transaction is the 2000 T stocks that node A is bought from node B, is placed in the address 1 of node A, remains in node A The remaining amount of money is 980,000, is placed in the address 2 of node A.Second transaction is that remaining 8,000 T stock is given to oneself by node B, is put In the address of node B 1, residual amount is 920,000 in node B, is placed in the address 2 of node B.Block generates node A from public Transaction buffer area in take out the processing of this financial transaction record after be put into block and broadcast, node A-C detects this finance There is transaction source number in the IN field of transaction record, it is A0001 and B0001 that number is then found from local data base Financial transaction record inputs transaction record.Node A-C calculates the total of the address 1 in input transaction record, that is, A0001 and B0001 Volume is 10,000 T stocks, and 2 total value of address is 1,900,000.Meanwhile calculate output transaction record, that is, A0002 and B0002 in address 1 it is total 2,000 T stock of volume adds 8,000 T stocks to be 10,000 T stocks, and 2 total value 980,000 of address plus 920,000 are 1,900,000.Compare two calculated result hairs The total transaction amounts that two kinds now inputted in transaction record produce account with to export two kinds of transaction for producing account in transaction record total Volume respectively corresponds unanimously, then generates node A to block and returns to the response being verified.Block generate node A receive greater than etc. 2f+1 node is received in a certain proportion of 3f+1 node for being verified and responding and then thinking to know together by, for example, PBFT It is verified response, f+1 node is received in the 2f+1 node of Raft is verified response.Common recognition is generated by rear block Block chain will be added by the block of common recognition in node, and passes through response to other blocks verifying node broadcasts common recognition.Block verifying According to common recognition block chain will be added by the block of common recognition by response in node, and is respectively updated to local data base, deposits Store up corresponding financial transaction record.It should be noted that block, which generates node, can store whole financial transaction records, and area Block verifying node then can only store newest transaction record.The finance stored in the database of the node A of block generation at this time Transaction record is { SN:A0001, IN:100 ten thousand, quantity: 0, OUT: node A address 1, the amount of money: 1,000,000, OUT: the ground of node A Location 2；SN:B0001, IN:100 ten thousand, quantity: 10,000 T stocks, OUT: node B address 1, the amount of money: 900,000, OUT: the ground of node B Location 2；SN:A0002, IN:A0001, B0001, quantity: 2,000 T stocks, OUT: node A address 1, the amount of money: 980,000, OUT: node The address 2 of A；SN:B0002, IN:A0001, B0001, quantity: 8,000 T stocks, OUT: node B address 1, the amount of money: 920,000, OUT: node B address 2 }, the financial transaction record stored in the database of node B and C be SN:A0002, IN:A0001, B0001, quantity: 2,000 T stocks, OUT: node A address 1, the amount of money: the address 2 of 980,000, OUT: node A；SN:B0002, IN: A0001, B0001, quantity: 8,000 T stocks, OUT: node B address 1, the amount of money: the address 2 of 920,000, OUT: node B }.

New number is counted and generates automatically to SN continuation with posterior nodal point A and B, if future time point share price becomes It is dynamic, 1 strand 20 pieces of T stock, while node B is sold to 2,000 T stock of node A again, and by next financial transaction record SN: A0003, IN:A0002, B0002, quantity: 4,000 T stocks, OUT: node A address 1, the amount of money: 940,000, OUT: the address of node A 2；SN:B0003, IN:A0002, B0002, quantity: 6,000 T stocks, OUT: node B address 1, the amount of money: 960,000, OUT: node B Address 2 be sent in public transaction buffer area.This financial transaction record mean the first transaction be node A from 2,000 T stocks of node B purchase, are placed in the address 1 of node A, and residual amount is 980,000 in node A, are placed on the address 2 of node A In.Second transaction is that remaining 8,000 T stock is given to oneself by node B, is placed in the address 1 of node B, remaining gold in node A Volume is 920,000, is placed in the address 2 of node B.Block generates node A and takes out this two finance friendships from public transaction buffer area Easily record generates block to be verified after being handled and is broadcasted.Block verifies node B-C in received block to be verified Financial transaction record verify, detect in the IN field of this financial transaction record exist transaction source number, then from It is A0002 and the financial transaction record of B0002 input transaction record that number is found in local data base, and calculates to input and trade Record is that 1 total value of address in A0002 and B0002 is 10,000 T stocks, and 2 total value of address is 1,900,000, and calculates corresponding output and hand over Easy 1 total value of address recorded in i.e. A0003 and B0003 is 4,000 plus 6,000 T stocks i.e. 10,000 T stocks, and 2 total value of address adds for 940,000 960000 be 1,900,000.Compare two kinds in the two calculated result discovery input transaction records total transaction amounts and output for producing account Two kinds of total transaction amounts for producing account respectively correspond unanimously in transaction record, then generate node A return to block and are verified Response, block generate node A receive more than or equal to it is a certain proportion of be verified response then think common recognition pass through.Common recognition passes through Block generates node and block chain is added in block afterwards, and passes through response to block verifying node broadcasts common recognition.Block verifies node Block chain will be added by the block of common recognition by response according to common recognition, and respectively local data base is updated, store phase The financial transaction record answered.I.e. at this time block generate the financial transaction record that stores in the local data base of node A be SN: A0001, IN:100 ten thousand, quantity: 0, OUT: node A address 1, the amount of money: the address 2 of 1,000,000, OUT: node A；SN:B0001, IN:100 ten thousand, quantity: 10,000 T stocks, OUT: node B address 1, the amount of money: the address 2 of 900,000, OUT: node B；SN:A0002, IN:A0001, B0001, quantity: 2,000 T stocks, OUT: node A address 1, the amount of money: the address 2 of 980,000, OUT: node A；SN: B0002, IN:A0001, B0001, quantity: 8,000 T stocks, OUT: node B address 1, the amount of money: 920,000, OUT: the address of node B 2；SN:A0003, IN:A0002, B0002, quantity: 4,000 T stocks, OUT: node A address 1, the amount of money: 940,000, OUT: node A Address 2；SN:B0003, IN:A0002, B0002, quantity: 6,000 T stocks, OUT: node B address 1, the amount of money: 960,000, OUT: The address 2 of node B }.In the local data base of block verifying node B and C the financial transaction record that stores be SN:A0003, IN: A0002, B0002, quantity: 4,000 T stocks, OUT: node A address 1, the amount of money: the address 2 of 940,000, OUT: node A；SN: B0003, IN:A0002, B0002, quantity: 6,000 T stocks, OUT: node B address 1, the amount of money: 960,000, OUT: the address of node B 2}。

There are node A-C, node A to generate node, node A- for block in another specific example, in block chain C has the local data base of oneself.Node B is by a financial transaction record { SN:A0002, IN:A0001, B0001, quantity: 2 Thousand T stocks, OUT: node A address 1, the amount of money: the address 2 of 980,000, OUT: node A；SN:B0002, IN:A0001, B0001, Quantity: 9,000 T stocks, OUT: node B address 1, the amount of money: the address 2 of 920,000, OUT: node B } to be sent to public transaction slow It deposits in area, i.e., 10,000 T stocks in node B at this time have been done trades twice, and node B is by 1,000 T in the 2000 T stocks paid away Stock has been given to the account of oneself again, and the total value that node A-C calculates the address 1 in input transaction record, that is, A0001 and B0001 is 10000 T stocks, 2 total value of address are 1,900,000.Meanwhile the total value for calculating address 1 in output transaction record, that is, A0002 and B0002 is 1 11000 T stocks, 2 total value of address are 1,900,000.Two kinds compared in two calculated result discovery input transaction records produce account Total transaction amount and two kinds of total transaction amounts for producing account in output transaction record corresponding consistent, then block verifying saves Point B-C generates node A to block and returns to the unsanctioned response of verifying, and block generates node A according to the verifying knot received at this time Fruit judges that block to be verified does not pass through common recognition, then block generates node A and common recognition is not sent to each block verifying section by response Point B-C.Block verifying node B-C does not pass through response according to the common recognition received and judges that block to be verified does not pass through common recognition, then area Each node in block chain network abandons block to be verified, and re-executes the process that block is generated, verifies and known together, to avoid " honeysuckle ".

It should be noted that current block can elect new block life by setting common recognition mechanism after generating node failure At node, the block of failure, which generates node, can be converted to block verifying node, generate node to new block and synchronize whole gold Melt transaction record, and the block to fail generates the historical financial transaction in the database of node in addition to newest financial transaction record The state of record is failure, and the state of only newest financial transaction record is just effective.The block of failure generates node can be with Block verifying node is converted to, is only obtained and is handed over by newest financial transaction record in the local database when doing block verifying Corresponding historical financial transaction number is numbered in easy source, is reused to avoid historical financial transaction record by transaction node.

By adopting the above technical scheme, node is verified by block and produces account point to two kinds of in data of financial transaction It carry out not data verification.After block is verified, each node can be according to the data of financial transaction pair for including in block to be verified The data of financial transaction being locally stored can effectively solve the problem that the existing block using non-digging mine common recognition algorithm to data update is carried out " honeysuckle " problem present in chain to avoid wrong data that block chain is added, and then guarantees there there are data in block chain network Effect property.

Embodiment three

Fig. 3 is a kind of flow chart of the verification method for block chain that the embodiment of the present invention three provides, and the present embodiment is applicable The case where node obtains the verification result of block to be verified is generated in block, this method can be held by the verifying device of block chain Row, which can be realized by the mode of software and/or hardware, and can be generally integrated in computer equipment, the computer Equipment can be the equipment for undertaking block chain node.Correspondingly, as shown in figure 3, this method includes following operation:

S310, block generate node and generate the block verifying node that block to be verified is sent to block chain network, the area It is the node elected by setting common recognition mechanism that block, which generates node,.

Wherein, the block to be verified includes data of financial transaction, includes: in the data of financial transaction and historical financial At least one associated historical data identification information of transaction data；

Wherein, block chain network can be publicly-owned chain or alliance's chain.Block chain network may include basic chain i.e. main chain, together When may include side chain, subchain or lightning network.Block verifying node, which can be, participates in testing for block generation node transmission block Other block chain network nodes of card process.Block, which generates node, can be the section for possessing block processes permission in block chain network Point.The common recognition mechanism of mine can be dug with right and wrong by setting common recognition mechanism, such as PBFT or Raft algorithm.Data of financial transaction includes but unlimited In funds transaction, share exchange, digital cash transaction and fund transaction etc..It is current that historical data identification information can be instruction Number or mark of the associated historical financial transaction of data of financial transaction etc..

In embodiments of the present invention, the block generation node for possessing block processes permission can be from the caching of block chain network Area obtains data of financial transaction, and after handling data of financial transaction, according to data of financial transaction and obtained number of transactions Block to be verified is generated according to being packaged to be packaged, and by encrypted communication to be verified into block chain network, so that block verifying section Point verifies block to be verified.

S320, the block generate node and obtain the block verifying node according to financial transaction in the block to be verified The block verification result that the historical data identification information of data verifies the block to be verified.

Wherein, historical data identification information can be the associated historical financial transaction of instruction current financial transaction data Number or mark etc..

In embodiments of the present invention, after block to be verified is sent to each block verifying node by block generation node, block Verifying node carries out verifying to the block to be verified received and obtains block verification result, and block verification result is fed back to area Block generates node.Correspondingly, block verifying node is needed according to historical data identification information in block to be verified to area to be verified Block is verified.

The embodiment of the present invention generates node by block and generates the block verifying that block to be verified is sent to block chain network Node, and block verifying node is obtained according to the historical data identification information of data of financial transaction in the block to be verified to institute The block verification result of block to be verified is stated, to judge whether block to be verified passes through common recognition according to verification result.The present invention is real It applies block in example and generates node by setting the generation of common recognition mechanism, wherein setting common recognition does not include digging mine algorithm, can effectively be solved " honeysuckle " problem present in the certainly existing block chain using non-digging mine common recognition algorithm, avoids wrong data that block chain is added, into And guarantee the validity of data in block chain network.

It in an alternate embodiment of the present invention where, can also include: that the block generation node is tested according to the block Card result judges whether the block to be verified verifies the verifying of node by the block, if the block generates node root The block to be verified is determined by common recognition, then according to the financial transaction in the block to be verified according to the block verification result Data are updated the data of financial transaction being locally stored, and common recognition is fed back to the block by response and verifies node； The common recognition is used to indicate the block verifying node by response and the block to be verified is added in block chain；Meanwhile institute It states block generation node and the block to be verified is added in block chain by response according to the common recognition.

In embodiments of the present invention, block verifying node is according to the number for completing all data of financial transaction in block to be verified After verifying, the block verification result whether block to be verified passes through verifying can be obtained.The area that block verifying node will obtain Block verification result is transmitted in block chain network, specifically block verification result can be fed back to area by the way of broadcast Block generates node.It, can be according to region after block generates the block verification result that node receives each block verifying node feeding back Determine whether block to be verified passes through verifying by verifying proportion in verification result.If block generation node determines to be tested Block is demonstrate,proved by verifying, then the block to be verified can be added in block chain, and the finance in block to be verified is handed over Easy data are updated the data of financial transaction being locally stored, and specifically can be the data of financial transaction in block to be verified It is added in database.Meanwhile block generates node and can also will know together and feed back to the block verifying node, area by response After the common recognition that block verifying node receives block generation node feeding back passes through response, block to be verified is added in block chain, and The data of financial transaction being locally stored is updated according to the data of financial transaction in block to be verified.

It in an alternate embodiment of the present invention where, include: data identification information, the side of being transferred in the data of financial transaction Information and the side's of producing information；The side's of being transferred to information includes: and at least one associated history number of historical financial transaction data According to identification information；The side's of producing information includes: that at least two types produce account.

Wherein, data identification information is used to indicate number or mark of current financial transaction data etc., is specifically as follows packet The character string of node identification, such as A0001 are included, it is of course also possible to which random number is added in number, avoids generating repetition number, example Such as number can be Ar0001, and wherein r is random number, which is generated by certification node, and the digit of random number can basis Actual needs setting, the random number generated every time are different from, and the Ar in the number is only used as mark, without counting, by 0001 in number is counted, such as r=123, and the count range of initial number A1230001 is A1230001- A1239999.The embodiment of the present invention is not defined the method and form of the number for realizing data of financial transaction.Correspondingly, What the side's of producing information can be assets, equity, ideal money or fund for being related to etc. in transaction produces account, for example, when B will When 1000 strands of stocks are sold to A, then the address for being used to store the 1000 strands of stocks bought in A can be used as one and produce account.Accordingly , the side's of being transferred to information can be historical financial transaction data pair associated with current financial transaction data in data of financial transaction The historical data identification information answered.For example, when 1,000 strands of stocks are sold to A by B, then financial transaction relevant to the A and B last time The corresponding number of data can be used as the side's of being transferred to information.It should be noted that in embodiments of the present invention, the side's of producing information can be with Different types of account is produced including at least two.It can be used for storing real estate as one of them produces account, in addition one A account that produces can store fictitious assets, such as stock, fund or digital cash.Certainly, different types of to produce account also Different types of fictitious assets can be stored simultaneously, and the embodiment of the present invention is to this and is not limited.

In an alternate embodiment of the present invention where, the account that produces includes: the financial goods to circulate in real world The account of coin, and virtual world circulation virtual trading object account, the virtual trading object include: digital cash or Virtual objects.

In an alternate embodiment of the present invention where, when the historical financial transaction data is raw financial transaction data When, it include: data identification information, the side's of being transferred to information and the side's of producing information in the historical financial transaction data；It is described to be transferred to Square information includes: original data source.

Illustratively, it is assumed that 1 strand 10 pieces of T stock, node A has 1,000,000 RMB real estates, and node B equally has 1,000,000 RMB Real estate.Wherein, 1,000,000 node A and the corresponding original data source of node B be can be.If node B has bought 10,000 gangs T strands Ticket, then the corresponding raw financial transaction record of node A can be { SN:A0001, IN:100 ten thousand, quantity: 0, OUT: the ground of node A Location 1, the amount of money: the address 2 of 1,000,000, OUT: node A }；The corresponding raw financial transaction record of node B can be SN:B0001, IN:100 ten thousand, quantity: 10,000 T stocks, OUT: node B address 1, the amount of money: the address 2 of 900,000, OUT: node B }.Wherein, IN word Section is for identifying original data source information, i.e., original real estate 1,000,000.If historical financial transaction data is not initial data Source information, then IN field specifically can be historical data identification information for identifying the side's of being transferred to information.The corresponding letter of OUT field Breath, which can be, different types of produces account.

Example IV

Fig. 4 is a kind of schematic diagram of the verifying device for block chain that the embodiment of the present invention four provides, as shown in figure 4, described Device is configured at block verifying node, specifically includes: block reception module 410, data acquisition module 420 and data verification mould Block 430, in which:

Block reception module 410 generates the block to be verified that node is sent for receiving block, and the block generates node For the node elected by setting common recognition mechanism；

Data acquisition module 420, for obtaining the data of financial transaction in the block to be verified；The financial transaction number Include: and at least one associated historical data identification information of historical financial transaction data in；

Data Verification module 430, for the historical data identification information according to the data of financial transaction, to described The data of financial transaction in block to be verified carries out data verification；

It optionally, include: data identification information, the side's of being transferred to information and the side's of producing information in the data of financial transaction； The side's of being transferred to information includes: and at least one associated historical data identification information of historical financial transaction data；It is described to produce Square information includes: that at least two types produce account.

Optionally, described to produce the account that account includes: the financial currency to circulate in real world, and in virtual generation The account of the virtual trading object of boundary's circulation, the virtual trading object includes: digital cash or virtual objects.

Optionally, Data Verification module 430 are also used to be identified according to the historical data of the data of financial transaction and believe Breath is obtained with the associated historical transactions data of the currently processed data of financial transaction as verify data, and according to described Verify data verifies the currently processed data of financial transaction.

Optionally, the data identification information includes: the number of data of financial transaction；The historical data identification information packet It includes: the number of historical financial transaction data；Data Verification module 330 is also used to the volume according to the historical financial transaction data Number, obtain historical financial transaction data corresponding with the number of the historical financial transaction data；It obtains and the historical financial The corresponding each type of transaction data is transferred to the corresponding whole of account and is transferred to amount as currently processed financial transaction number The corresponding full amount of account is produced according to each type；Each type in the currently processed data of financial transaction is verified to turn Whether the corresponding summation for producing amount of account with each type of currently processed data of financial transaction produces account out The corresponding full amount in family matches；If so, determining that the currently processed data of financial transaction passes through verifying.

Optionally, described device further include: block adding module, for according to financial transaction in the block to be verified The data verifications of data is and anti-by the block verification result as a result, obtain the block verification result to the block to be verified It is fed to the block and generates node, so that the block generates node and determines whether the block to be verified passes through verifying；If The common recognition of the block generation node feeding back is received by response, then the block to be verified is added in block chain.

Optionally, when the historical financial transaction data is raw financial transaction data, the historical financial number of deals It include: data identification information, the side's of being transferred to information and the side's of producing information in；The side's of being transferred to information includes: original data source.

Optionally, described device further include: data update module, if generating node feeding back for receiving the block Common recognition by response, then according to the data of financial transaction in the block to be verified to the data of financial transaction being locally stored into Row updates.

Testing for block chain provided by the embodiment of the present invention one and embodiment two can be performed in the verifying device of above-mentioned block chain Card method has the corresponding functional module of execution method and beneficial effect.The not technical detail of detailed description in the present embodiment, It can be found in the verification method for the block chain that any embodiment of that present invention provides.

Embodiment five

Fig. 5 is a kind of schematic diagram of the verifying device for block chain that the embodiment of the present invention five provides, as shown in figure 5, described Device is configured at block and generates node, specifically includes: block generation module 510 and result obtain module 520, in which:

Block generation module 510, the block that block chain network is sent to for generating block to be verified verifies node, described It is the node elected by setting common recognition mechanism that block, which generates node,；Wherein, the block to be verified includes financial transaction number According to including: in the data of financial transaction and at least one associated historical data identification information of historical financial transaction data；

As a result module 520 is obtained, for obtaining the block verifying node according to financial transaction in the block to be verified The block verification result that the historical data identification information of data verifies the block to be verified；

Optionally, described device further include: information update sending module, for judging institute according to the block verification result State the verifying whether block to be verified verifies node by the block, if according to the block verification result determine it is described to Block is verified by common recognition, then according to the data of financial transaction in the block to be verified to the data of financial transaction being locally stored It is updated, and common recognition is fed back into the block by response and verifies node；The common recognition is used to indicate described by response Block verifies node and the block to be verified is added in block chain；

Module is added in block, for the block to be verified to be added in block chain by response according to the common recognition.

The verification method of block chain provided by the embodiment of the present invention three can be performed in the verifying device of above-mentioned block chain, has The corresponding functional module of execution method and beneficial effect.The not technical detail of detailed description in the present embodiment, reference can be made to this hair The verification method for the block chain that bright any embodiment provides.

Embodiment six

Fig. 6 is a kind of structural schematic diagram for computer equipment that the embodiment of the present invention six provides.Fig. 6, which is shown, to be suitable for being used to Realize the block diagram of the computer equipment 612 of embodiment of the present invention.The computer equipment 612 that Fig. 6 is shown is only an example, Should not function to the embodiment of the present invention and use scope bring any restrictions.Computer equipment 612 typically undertakes block The calculating equipment of catenary system nodal function.

As shown in fig. 6, computer equipment 612 is showed in the form of universal computing device.The component of computer equipment 612 can To include but is not limited to: one or more processor 616, storage device 628 connect different system components (including storage dress Set 628 and processor 616) bus 618.

Bus 618 indicates one of a few class bus structures or a variety of, including memory bus or Memory Controller, Peripheral bus, graphics acceleration port, processor or the local bus using any bus structures in a variety of bus structures.It lifts For example, these architectures include but is not limited to industry standard architecture (Industry Standard Architecture, ISA) bus, microchannel architecture (Micro Channel Architecture, MCA) bus, enhancing Type isa bus, Video Electronics Standards Association (Video Electronics Standards Association, VESA) local Bus and peripheral component interconnection (Peripheral Component Interconnect, PCI) bus.

Computer equipment 612 typically comprises a variety of computer system readable media.These media can be it is any can The usable medium accessed by computer equipment 612, including volatile and non-volatile media, moveable and immovable Jie Matter.

Storage device 628 may include the computer system readable media of form of volatile memory, such as arbitrary access Memory (Random Access Memory, RAM) 630 and/or cache memory 632.Computer equipment 612 can be into One step includes other removable/nonremovable, volatile/non-volatile computer system storage mediums.Only as an example, it deposits Storage system 634 can be used for reading and writing immovable, non-volatile magnetic media, and (Fig. 6 do not show, commonly referred to as " hard drive Device ").Although being not shown in Fig. 6, the disk for reading and writing to removable non-volatile magnetic disk (such as " floppy disk ") can be provided and driven Dynamic device, and to removable anonvolatile optical disk (such as CD-ROM (Compact Disc-Read Only Memory, CD- ROM), digital video disk (Digital Video Disc-Read Only Memory, DVD-ROM) or other optical mediums) read-write CD drive.In these cases, each driver can pass through one or more data media interfaces and bus 618 It is connected.Storage device 628 may include at least one program product, which has one group of (for example, at least one) program Module, these program modules are configured to perform the function of various embodiments of the present invention.

Program 636 with one group of (at least one) program module 626, can store in such as storage device 628, this The program module 626 of sample includes but is not limited to operating system, one or more application program, other program modules and program It may include the realization of network environment in data, each of these examples or certain combination.Program module 626 usually executes Function and/or method in embodiment described in the invention.

Computer equipment 612 can also with one or more external equipments 614 (such as keyboard, sensing equipment, camera, Display 624 etc.) communication, the equipment interacted with the computer equipment 612 communication can be also enabled a user to one or more, And/or with any equipment (such as net that the computer equipment 612 is communicated with one or more of the other calculating equipment Card, modem etc.) communication.This communication can be carried out by input/output (I/O) interface 622.Also, computer Equipment 612 can also pass through network adapter 620 and one or more network (such as local area network (Local Area Network, LAN), wide area network Wide Area Network, WAN) and/or public network, such as internet) communication.As schemed Show, network adapter 620 is communicated by bus 618 with other modules of computer equipment 612.Although should be understood that in figure not It shows, other hardware and/or software module can be used in conjunction with computer equipment 612, including but not limited to: microcode, equipment Driver, redundant processing unit, external disk drive array, disk array (Redundant Arrays of Independent Disks, RAID) system, tape drive and data backup storage system etc..

The program that processor 616 is stored in storage device 628 by operation, thereby executing various function application and number According to processing, such as realize the verification method of block chain provided by any of the above-described embodiment of the present invention.

Block is received by the computer equipment and generates the block to be verified that node is sent, and is obtained in block to be verified Data of financial transaction, and according to the historical data identification information of data of financial transaction, to the financial transaction number in block to be verified According to progress data verification.Due to being stored with newest historical transactions data, and historical data identification information in block verifying node It can serve to indicate that Transaction Information is associated with historical transactions data, therefore, can effectively solve the problem that the non-digging mine common recognition of existing application " honeysuckle " problem present in the block chain of algorithm effectively avoids wrong data that block chain is added, and then guarantees block chain network The validity of middle data.

Embodiment seven

The embodiment of the present invention seven also provides a kind of computer storage medium for storing computer program, the computer program When being executed by computer processor for executing following block chain verification method of the invention:

Block verifies node and receives the block to be verified that block generates node transmission, and it is by setting that the block, which generates node, Surely the node that common recognition mechanism elects；The block verifying node obtains the data of financial transaction in the block to be verified；Institute It states in data of financial transaction and includes: and at least one associated historical data identification information of historical financial transaction data；The area Block verifies node according to the historical data identification information of the data of financial transaction, described in the block to be verified Data of financial transaction carries out data verification；Wherein, newest historical financial transaction data is stored in the block verifying node.

Alternatively, executing the following block chain verification method of the present invention:

Block generates node and generates the block verifying node that block to be verified is sent to block chain network, and the block generates Node is the node elected by setting common recognition mechanism；Wherein, the block to be verified includes data of financial transaction, the gold Melt in transaction data and includes: and at least one associated historical data identification information of historical financial transaction data；The block is raw The block verifying node is obtained according to the historical data identification information of data of financial transaction in the block to be verified at node The block verification result that the block to be verified is verified；Wherein, the block generates in node and is stored with whole history Data of financial transaction.

Further, the computer program by computer processor when being executed for executing any of the above-described reality of the present invention Apply the verification method of block chain described in example.

The computer storage medium of the embodiment of the present invention, can be using any of one or more computer-readable media Combination.Computer-readable medium can be computer-readable signal media or computer readable storage medium.It is computer-readable Storage medium for example may be-but not limited to-the system of electricity, magnetic, optical, electromagnetic, infrared ray or semiconductor, device or Device, or any above combination.The more specific example (non exhaustive list) of computer readable storage medium includes: tool There are electrical connection, the portable computer diskette, hard disk, random access memory (RAM), read-only memory of one or more conducting wires (Read Only Memory, ROM), erasable programmable read only memory ((Erasable Programmable Read Only Memory, EPROM) or flash memory), optical fiber, portable compact disc read-only memory (CD-ROM), light storage device, magnetic Memory device or above-mentioned any appropriate combination.In this document, computer readable storage medium, which can be, any includes Or the tangible medium of storage program, which can be commanded execution system, device or device use or in connection make With.

Computer-readable signal media may include in a base band or as carrier wave a part propagate data-signal, Wherein carry computer-readable program code.The data-signal of this propagation can take various forms, including but unlimited In electromagnetic signal, optical signal or above-mentioned any appropriate combination.Computer-readable signal media can also be that computer can Any computer-readable medium other than storage medium is read, which can send, propagates or transmit and be used for By the use of instruction execution system, device or device or program in connection.

The program code for including on computer-readable medium can transmit with any suitable medium, including --- but it is unlimited In wireless, electric wire, optical cable, radio frequency (Radio Frequency, RF) etc. or above-mentioned any appropriate combination.

The computer for executing operation of the present invention can be write with one or more programming languages or combinations thereof Program code, described program design language include object oriented program language-such as Java, Smalltalk, C++, Further include conventional procedural programming language --- such as " C " language or similar programming language.Program code can Fully to execute, partly execute on the user computer on the user computer, be executed as an independent software package, Part executes on the remote computer or executes on a remote computer or server completely on the user computer for part. In situations involving remote computers, remote computer can pass through the network of any kind --- including local area network (LAN) Or wide area network (WAN)-is connected to subscriber computer, or, it may be connected to outer computer (such as utilize Internet service Provider is connected by internet).

Note that the above is only a better embodiment of the present invention and the applied technical principle.It will be appreciated by those skilled in the art that The invention is not limited to the specific embodiments described herein, be able to carry out for a person skilled in the art it is various it is apparent variation, It readjusts and substitutes without departing from protection scope of the present invention.Therefore, although being carried out by above embodiments to the present invention It is described in further detail, but the present invention is not limited to the above embodiments only, without departing from the inventive concept, also It may include more other equivalent embodiments, and the scope of the invention is determined by the scope of the appended claims.

Claims

1. a kind of verification method of block chain characterized by comprising

Block verifies node and receives the block to be verified that block generates node transmission, and it is by setting altogether that the block, which generates node, The node that knowledge mechanism elects；

The block verifying node obtains the data of financial transaction in the block to be verified；It is wrapped in the data of financial transaction It includes: at least one associated historical data identification information of historical financial transaction data；

The block verifies node according to the historical data identification information of the data of financial transaction, to the area to be verified The data of financial transaction in block carries out data verification；

2. the method according to claim 1, wherein include: in the data of financial transaction data identification information, The side's of being transferred to information and the side's of producing information；The side's of being transferred to information include: with historical financial transaction data it is associated at least one Historical data identification information；The side's of producing information includes: that at least two types produce account.

3. according to the method described in claim 2, it is characterized in that, the account that produces includes: to circulate in real world The account of financial currency, and the account of the virtual trading object in virtual world circulation, the virtual trading object includes: digital goods Coin or virtual objects.

4. according to the method described in claim 3, it is characterized in that, the block verifies node according to the data of financial transaction The historical data identification information, in the block to be verified the data of financial transaction carry out data verification, comprising:

The block verifying node obtains and described current according to the historical data identification information of the data of financial transaction The associated historical transactions data of the data of financial transaction of processing are worked as verify data, and according to the verify data to described The data of financial transaction of pre-treatment is verified.

5. according to the method described in claim 4, it is characterized in that, the data identification information includes: data of financial transaction Number；The historical data identification information includes: the number of historical financial transaction data；

The block verifying node obtains and described current according to the historical data identification information of the data of financial transaction The associated historical transactions data of the Transaction Information of processing are as verify data, and according to the verify data, to the current place The Transaction Information of reason is verified, comprising:

The block verifying node obtains and the historical financial transaction data according to the number of the historical financial transaction data The corresponding historical financial transaction data of number；

Block verifying node, which obtains each type corresponding with the historical financial transaction data and is transferred to account, to be respectively corresponded Whole be transferred to amount as the currently processed each type of data of financial transaction and produce the corresponding full amount of account；

Each type produces account and respectively corresponds in currently processed data of financial transaction described in the block verifying node verification The summation for producing amount whether with each type of currently processed data of financial transaction to produce account corresponding total Amount matches；

If so, the block verifying node determines that the currently processed data of financial transaction passes through verifying.

6. the method according to claim 1, wherein the method also includes:

The block verifying node is according to the data verification to data of financial transaction in the block to be verified as a result, obtaining to institute The block verification result of block to be verified is stated, and the block verification result is fed back into the block and generates node, so that institute It states block generation node and determines whether the block to be verified passes through verifying；

If the common recognition that the block verifying node receives the block generation node feeding back passes through response, will be described to be tested Block is demonstrate,proved to be added in block chain.

7. the method according to claim 1, wherein

It include: number in the historical financial transaction data when the historical financial transaction data is raw financial transaction data According to identification information, the side's of being transferred to information and the side's of producing information；The side's of being transferred to information includes: original data source.

8. according to the method described in claim 6, it is characterized in that, the method also includes:

If block verifying node receives the block and generates the common recognition of node feeding back by response, according to it is described to Data of financial transaction in verifying block is updated the data of financial transaction being locally stored.

9. a kind of verification method of block chain characterized by comprising

Block generates node and generates the block verifying node that block to be verified is sent to block chain network, and the block generates node For the node elected by setting common recognition mechanism；Wherein, the block to be verified includes data of financial transaction, and the finance is handed over Include: and at least one associated historical data identification information of historical financial transaction data in easy data；

The block generates node and obtains the block verifying node to be gone through according to data of financial transaction in the block to be verified The block verification result that history data identification information verifies the block to be verified；

10. according to the method described in claim 9, it is characterized by further comprising:

The block generates node and judges whether the block to be verified passes through the block and test according to the block verification result The verifying of node is demonstrate,proved, if the block, which generates node, determines that the block to be verified passes through altogether according to the block verification result Know, then the data of financial transaction being locally stored is updated according to the data of financial transaction in the block to be verified, and will Common recognition feeds back to the block by response and verifies node；The common recognition is used to indicate the block verifying node by response will The block to be verified is added in block chain；

Meanwhile the block generates node and the block to be verified is added in block chain by response according to the common recognition.

11. according to the method described in claim 9, it is characterized in that, including: Data Identification letter in the data of financial transaction It ceases, the side's of being transferred to information and the side's of producing information；The side's of being transferred to information includes: and historical financial transaction data associated at least one A historical data identification information；The side's of producing information includes: that at least two types produce account.

12. according to the method for claim 11, which is characterized in that the account that produces includes: to circulate in real world Financial currency account, and virtual world circulation virtual trading object account, the virtual trading object includes: number Currency or virtual objects.

13. according to the method for claim 12, which is characterized in that

14. a kind of verifying device of block chain is configured at block verifying node characterized by comprising

Block reception module generates the block to be verified that node is sent for receiving block, and it is to pass through that the block, which generates node, The node that setting common recognition mechanism elects；

Data acquisition module, for obtaining the data of financial transaction in the block to be verified；It is wrapped in the data of financial transaction It includes: at least one associated historical data identification information of historical financial transaction data；Data Verification module, for according to The historical data identification information of data of financial transaction, counts the data of financial transaction in the block to be verified According to verifying；

15. a kind of verifying device of block chain is configured at block and generates node characterized by comprising

Block generation module, the block that block chain network is sent to for generating block to be verified verify node, and the block is raw It is the node elected by setting common recognition mechanism at node；Wherein, the block to be verified includes data of financial transaction, described Include: in data of financial transaction and at least one associated historical data identification information of historical financial transaction data；

As a result module is obtained, is gone through for obtaining block verifying node according to data of financial transaction in the block to be verified The block verification result that history data identification information verifies the block to be verified；

16. a kind of computer equipment, which is characterized in that the equipment includes:

One or more processors；

Storage device, for storing one or more programs,

When one or more of programs are executed by one or more of processors, so that one or more of processors are real Now such as the verification method of block chain described in any one of claims 1-8.

17. a kind of computer equipment, which is characterized in that the equipment includes:

One or more processors；

Storage device, for storing one or more programs,

When one or more of programs are executed by one or more of processors, so that one or more of processors are real The now verification method of the block chain as described in any in claim 9-13.

18. a kind of computer storage medium, is stored thereon with computer program, which is characterized in that the program is executed by processor The verification method of Shi Shixian block chain for example described in any one of claims 1-8.

19. a kind of computer storage medium, is stored thereon with computer program, which is characterized in that the program is executed by processor The verification method of block chain of the Shi Shixian as described in any in claim 9-13.