Summary of the invention
For user in the prior art in the trust authentication for alliance's chain, bad problem is experienced, to improve user
Experience, this specification embodiment provide a kind of scheme that user can be allowed to verify the confidence level of alliance's chain, the program
In a first aspect, including a kind of reliability verification method of alliance's chain, generate and trade in client, and will be described by docking node
After transaction cochain deposits card, comprising:
Client obtains multiple node address in alliance's chain;
According to the multiple node address, transaction location inquiry request is sent to the multiple node, wherein the transaction
It include the abstract Hash of the transaction in position enquiring request;
Any node receives the position enquiring request, and it is right respectively to inquire the abstract Hash institute based on the abstract Hash
Location information of the transaction answered in alliance's chain, and the position enquiring result is returned to client;
The consistent degree for the position enquiring result that client is returned respectively based on the multiple node, verifying include the friendship
The confidence level of alliance's chain of easy information.
Second aspect, this specification embodiment also provide a kind of reliability verification method of alliance's chain, generate and hand in user
Easily, after and the transaction cochain being deposited card by docking node, comprising:
Obtain multiple node address in alliance's chain;
According to the multiple node address, transaction location inquiry request is sent to the multiple node, wherein the transaction
It include the abstract Hash of the transaction in position enquiring request;
According to the consistent degree for the position enquiring result that the multiple node returns respectively, verifying includes the Transaction Information
Alliance's chain confidence level.
The third aspect, this specification embodiment also provide the request processing method in a kind of alliance's chain, are alliance in node
When node in chain, comprising:
The node determines the user identifier of own node user, and from the white list for determining to be made of user identifier,
Wherein, the user identifier is used for identity user identity, and, the node for identifying and the user is docked;
Other nodes of the white list into alliance's chain are sent, so that other nodes determine whether to execute according to the white list
Request transmitted by non-self node users, the request include that transaction location inquiry request or simple payment verification SPV are asked
It asks, includes the abstract Hash of target transaction in the request.
Corresponding with first aspect, this specification embodiment also provides a kind of trust verification system of alliance's chain, including
Client and alliance's chain network, alliance's chain network include multiple nodes;It generates and trades in client, and pass through docking node
After the transaction cochain is deposited card,
Client obtains multiple node address in alliance's chain;According to the multiple node address, sends transaction location and look into
Request is ask to the multiple node, wherein include the abstract Hash of the transaction in the transaction location inquiry request;
Any node in alliance's chain network receives the position enquiring request, respectively inquires institute based on the abstract Hash
Location information of the transaction in alliance's chain corresponding to abstract Hash is stated, and returns to the position enquiring result to client
End;
The consistent degree for the position enquiring result that client is returned respectively based on the multiple node, verifying include the friendship
The confidence level of alliance's chain of easy information.
Corresponding with second aspect, this specification embodiment also provides a kind of trust verification device of alliance's chain, with
Family generate transaction, and by docking node the transaction cochain is deposited into card after, described device includes:
Module is obtained, multiple node address in alliance's chain are obtained;
Sending module sends transaction location inquiry request to the multiple node according to the multiple node address,
In, it include the abstract Hash of the transaction in the transaction location inquiry request;
Receiving module receives the position enquiring result that the multiple node returns respectively;
Authentication module, according to the consistent degree of the position enquiring result, verifying includes alliance's chain of the Transaction Information
Confidence level.
Corresponding with the third aspect, this specification embodiment also provides the request processing unit in a kind of alliance's chain, is located at
On node in alliance's chain, comprising:
Determining module, determines the user identifier of own node user, and from the white list for determining to be made of user identifier,
Wherein, the user identifier is used for identity user identity, and, the node for identifying and the user is docked;
Sending module sends other nodes of the white list into alliance's chain, so that other nodes are true according to the white list
Fixed whether to execute request transmitted by non-self node users, the request includes transaction location inquiry request or simple payment
SPV request is verified, includes the abstract Hash of target transaction in the request.
In scheme provided by this specification embodiment, transaction cochain is completed by docking node in client and deposits card
Afterwards, for the transaction, multiple nodes of the client needle into alliance's chain initiate transaction location inquiry request, more so as to obtain
Respective positions query result of a node for the transaction.In turn, can based on the position enquiring result of multiple nodes one
Cause degree goes to verify the confidence level of alliance's chain, improves user experience.
It should be understood that above general description and following detailed description be only it is exemplary and explanatory, not
This specification embodiment can be limited.
In addition, any embodiment in this specification embodiment does not need to reach above-mentioned whole effects.
Specific embodiment
In order to make those skilled in the art more fully understand the technical solution in this specification embodiment, below in conjunction with this
Attached drawing in specification embodiment is described in detail the technical solution in this specification embodiment, it is clear that described
Embodiment is only a part of the embodiment of this specification, instead of all the embodiments.The embodiment of base in this manual,
Those of ordinary skill in the art's every other embodiment obtained, all should belong to the range of protection.
Multiple and different functional nodes is typically included in alliance's chain, current, alliance's chain frequently with a kind of framework
For each functional node accesses alliance's chain by their interested functional nodes respectively for respective user, user.
Node in alliance's chain involved in this specification embodiment, it is believed that each node is involved in alliance's link network
The routing function of network, while also may include other function, for example, each node can participate in verifying and propagating transaction and area
Block message, finds and maintains the connection with peer node, and can also be locally stored complete alliance's chain and it is some with
The relevant data of alliance's chain.
As shown in FIG. 1, FIG. 1 is a kind of frameworks involved in current alliance's chain.Section in Fig. 1, in alliance's chain network
Point may all include different function, and, each node due to providing different function, towards target user also usually simultaneously
Not identical, in same alliance's chain, the application APP that each functional node also often develops oneself respectively allows own node user
It is registered and is accessed.And user then usually therefrom chooses node docking alliance's chain, carries out transaction publication and verifying.
Below in conjunction with attached drawing, the technical solution that each embodiment of this specification provides is described in detail.This specification embodiment
Scheme in a first aspect, as shown in Fig. 2, Fig. 2 be this specification embodiment provide system aspects a kind of alliance's chain it is credible
The flow diagram for spending verification method is generated in client and is traded, and by docking after the transaction cochain deposited card by node, is somebody's turn to do
Process specifically comprises the following steps:
S201, client obtain multiple node address in alliance's chain.
For client, it is known that dock address of node, other node address in alliance's chain can be to docking
Node request obtains.It can also obtain otherwise, for example, the address of oneself is sent out in all nodes timing in alliance's chain
Cloth is to certain open cloud, and client locally saves an address list, and client periodically obtains from the disclosure cloud and owns
Address of node is updated the address list, it is thus possible to choose several node address at any time from the address list.It is logical
Which is crossed, the docking node of client can be got around, improves user for the trusting degree of entire alliance's chain.
S203 sends transaction location inquiry request to the multiple node, wherein institute according to the multiple node address
State the abstract Hash in transaction location inquiry request comprising the transaction.
Due to just will receive one and depositing card friendship about this after user completes transaction and deposits card by docking node cochain
Easy notification message usually wherein just includes abstract Hash, and is stored in client local.Therefore, client always can be from
The abstract Hash is obtained in local, and is added into transaction location inquiry request.
It in terms of client, can be after receiving the notification message, inquiry request initiated according to the instruction of user;It can also
To be, receives the notification message and trigger inquiry request.
S205, any node receive the position enquiring request, respectively inquire the abstract based on the abstract Hash and breathe out
Location information of the corresponding transaction in alliance's chain is wished, and returns to the position enquiring result to client.
One block chain is made of multiple blocks, meanwhile, multiple transaction are generally comprised in a block.Therefore, in this theory
In bright book embodiment, the location information refers specifically to the transaction when being deposited card, on which block in block chain,
And in the block where.
In block chain, it can be used to identify different blocks there are many mode, for example, block head cryptographic Hash or block
Highly (block height).Block head cryptographic Hash is that block head carries out cryptographic Hash obtained from Hash calculation, be can be used for
Uniquely, a block is specifically identified.In block chain, usual its block height of first block is 0, later every to increase by one
Block, block height add 1.One block usually has a specific block height.Therefore, block head cryptographic Hash or block are high
Degree can be used as a part of block metadata, be stored in node in an independent database table, in order to indexing and
Quickly retrieve the block.
Meanwhile in a block, due to typically including multiple transaction, and hence it is also possible to each transaction in the block
In address offset amount identify the transaction in block respectively.It is clear that in the same block, the address offset respectively traded
It measures not identical.
In turn, can be after the locating block cochain of transaction deposit card, it can be by maintenance one shaped like (friendship in each node
Easily abstract Hash, block head cryptographic Hash, address offset amount), alternatively, (transaction summarization Hash, block height, address offset amount)
Tables of data, so that it may which the address of corresponding block-identified and transaction within a block is obtained by the abstract hash query of transaction.
In other words, node can determine position of the transaction in alliance's chain by the abstract Hash of transaction.
Certainly, due to the specific format of block chain be can be customized, under different block formats, location information
Content would also vary from, this does not constitute the restriction to this programme.In addition, it should be noted that, what any node received
Request, which can be, arises directly from client, is also possible to receive the client request that other nodes are forwarded in alliance's chain.
S207, the consistent degree for the position enquiring result that client is returned respectively based on the multiple node, verifying include
The confidence level of alliance's chain of the Transaction Information.
Each node is after poll-final, it can query result is returned to client.It should be noted that the process
It can be an asynchronous process process, client does not need instant feedback result after having sent inquiry request.Cause
This, client can wait all nodes all to return to a query result and be verified again.
Since a transaction only has a determining position in alliance's chain, the confidence level of alliance's chain can be with base
Depending on the consistent degree of query result.Theoretically, the location information that each node is returned should be identical.One more tight
The verification mode of lattice is, if all position enquiring results are consistent, which is believable.Certainly, due to various nets
Network reason, Equipment etc. can allow certain deviation.For example, according to return institute it is resultful to consistent degree into
Row calculates, if there is no the same queries results that accounting is more than 95% in the result returned, then it is assumed that and alliance's degree confidence level is 0,
Otherwise, using the accounting of the identical result as the confidence level of alliance's chain.
Further, when determining that alliance's chain is insincere, it can be sent out alarm.Specifically, can refer in alert message
Out the inconsistent degree of the query result of each node be how many (i.e. how many or how many ratio and most results it is inconsistent),
And specifically provide the query result of the node and such node inconsistent with most results.
In scheme provided by this specification embodiment, after user deposits card by docking node completion transaction cochain,
For the transaction, multiple nodes of user's needle into alliance's chain initiate transaction location inquiry request, so as to obtain multiple sections
Respective query result of the point for the transaction.In turn, it can be gone based on the consistent degree of the position enquiring result of multiple nodes
The confidence level of alliance's chain is verified, user experience is improved.
Under a kind of specific embodiment, client obtains multiple node address in alliance's chain, can be client
On the one hand the random multiple node address obtained in alliance's chain, random acquisition node address verifying can make verification result more
It is just, on the other hand, it is also possible that the flow direction that please be averaging of user avoids the node load more than certain user to each node
It is too heavy.Or client obtains multiple node address comprising the docking node address in alliance's chain, in this mode
Under, user can choose a collection of node address first, and then docking address of node is added again.Be added docking node into
When row verifying, also includes the verification result for docking node in the result of return, verifying can be made more targeted, improve
User experience.
Under a kind of specific embodiment, user can also send simple payment and test according to the multiple node address
Card SPV is requested to the multiple node, wherein includes the abstract Hash of the transaction in the SPV request.Any node is based on
The abstract Hash respectively verifies whether transaction corresponding to the abstract Hash is to generate SPV in alliance's chain and test
Card is as a result, and return to the SPV verification result to client.The SPV verifying that client is returned respectively based on the multiple node
As a result, the confidence level of alliance chain of the verifying comprising the Transaction Information.
In each block of block chain, the All Activity for being recorded in the block is contained, and can be with Merkel
Merkle tree representation.In block then cryptographic Hash is stored data hashed into corresponding leaf node by all transaction.
There are a corresponding transaction in leaf node characterization block in tree.In order to prove that there are some specific mesh in block
Mark transaction, a node only need to calculate log2N number of cryptographic Hash, forming a path Merkle from target transaction to tree root is
It can.
Node is when carrying out simple payment verification (Simplified Payment Verification, SPV), it is not necessary to protect
Entire block need not also be downloaded by depositing All Activity.Node can only conservation zone build, and by the Hash of target transaction and
The path Merkle whether there is in the block to verify target transaction.In other words, the SPV verification result of each node is one two
Value result or it is "Yes" or is "No".
Due to one transaction in alliance's chain otherwise exist or be not present, theoretically, when there is no problem for alliance's chain,
The SPV verification result that each node is returned should be identical.Therefore, a more stringent confidence level validation testing is, if
All SPV verification results are unanimously "Yes", then confirm that alliance's chain is believable, be otherwise incredible.Certainly, due to each
Kind network cause, Equipment etc., can allow certain deviation.For example, one threshold value of setting, if SPV verification result
The consistent degree for "Yes" is more than the threshold value, then confirms that alliance's chain is believable.
Further, when confirming that alliance's chain is insincere, it can be sent out alarm.Specifically, can be in alert message
Point out the inconsistent degree of the query result of each node is how many (i.e. the result of "Yes" and "No" is how many respectively), and, tool
The query result for providing the node and such node inconsistent with most results of body.And it can also be according to all of return
As a result inconsistent degree calculates a confidence score as reference.For example, super if there is no accountings in the result returned
Cross the same queries result of certain threshold value, then it is assumed that alliance's degree is credible, otherwise, then it is assumed that alliance's chain is insincere.
It should be noted that the scheme that the above-mentioned consistency based on position enquiring result is verified, and verified based on SPV
Result the scheme verified of consistency, belong to the scheme that can separately carry out simultaneously.In actual operation, the two is tested
Card is the result is that independently.In other words, client can only select a kind of mode to execute verifying, can also be two kinds with simultaneous selection
Mode executes verifying, when executing two kinds of proof scheme at the same time, needs the result of two kinds of proof scheme while meeting consistency item
Part just thinks that alliance's chain is believable.And during verifying, the execution of two schemes is in no particular order.
Due in alliance's chain, each functional node usually have oneself docking client and corresponding docking user.
In the scheme of this specification embodiment, each node is frequently necessary to handle the request from non-self node users.
In one embodiment, node can for arbitrarily connect inquiry request transmitted by the client of oneself or
SPV request is handled.Under another embodiment, based on the principle that alliance shares, each node can also provide inquiry clothes
Business or SPV are serviced and are given white list user, if the client identification for sending request is handled on white list, otherwise,
Without processing.
The concrete mode for determining white list user includes: the white list that any node in alliance's chain determines itself, and wide
Other nodes of the white list into alliance's chain are broadcast, so that other nodes determine whether to execute query processing according to the white list.
A kind of common processing mode is that the registration user of itself is confirmed as white list user and gone forward side by side by any node in alliance's chain
Row broadcast.And whether other nodes can be then white list users according to included client identification is requested, to decide whether
It is further processed.White list herein can be using node as minimum unit, can also be each to save using user as minimum unit
The saved white list user of point may be the same or different.Ability when node receives request transmitted by white list user
It is handled.
For example, it is assumed that there are tetra- nodes of A, B, C, D in alliance's chain, in the above scheme, A can be saved with B, C, D node
The docking user of point is confirmed as white list user, and four nodes are safeguarded jointly;Can also include in the white list user of B node
The user of A node, but in the white list user of C, D node do not include the user of A node.Specific situation can be based on business
Situation voluntarily determines.
In more general situation, government organs (such as notarial office) or charity (such as charity organization) node
Docking user can be the white list users of other nodes in all alliance's chains, the node of the business partner node of a node
User is also possible to the white list user of the node.It further, can also source according to user or history in each node
Behavioral data and other factors (for example, third party's credit evaluation point), carry out authority classification to white list user, for example, most
The white list user of low rights only has search access right, and the white list user of higher permission may can also possess further other
Permission etc..
In practical applications, the number of users situation of each node is not identical in alliance's chain, the docking of some nodes
User is more, and the docking user of some nodes is few.Typically, those are total directly facing the quantity of the docking user of the node in market
It is the quantity of extra some emergent nodes.For example, in alliance's chain for protecting copyright, in face of the works of creator
The registration user of distribution platform, always far more than the registration user of notarial office.
So in this case, in the scheme of this specification embodiment, each node in alliance is handled for request
On be not " justice ".In other words, the few node of registration user can always be received asks beyond itself should be responsible for handling
Quantity is sought, this node few for registration user is not highly advantageous.
At this point, a kind of enforceable mode is, any node is done one first and is sentenced when receiving request and determining processing
It is disconnected, determine the first number of processes of the position enquiring request that the node determines that itself initiates other node users, and,
Confirm the second processing number for the position enquiring request that other nodes initiate the node users;According to first processing
Number and second processing number judge whether that position enquiring described in delay disposal is requested.
First number of processes and second processing number can be using a period of times as the period, for example, daily or monthly, periodically
It is zeroed out, is also possible to the quantity statistics of whole historical datas.The condition for judging whether delay disposal, can be according to first
Number of processes X and second processing number Y calculates one contribution proportion value Z of acquisition and is compared with preset threshold, for example, Z=(X-
Y)/Y, alternatively, Z=X/Y etc..Contribution proportion value characterizes " own contribution " and " request of the node when handling request
Other people " ratio, once contribution proportion value has been more than certain threshold value, then it represents that the node has been processed by more request, then
Request transmitted by other node users that the node can be received with delay disposal, delay disposal request can be effectively reduced weak
The load of node (i.e. the few node of registration user, relatively weak generally for the processing capacity of big flow).Due in this specification
In the scheme of embodiment, client does not need to be made instantly available verification result, therefore each node can be the processing of request
Asynchronous, delay disposal will not influence the effect of the scheme of this specification embodiment.
In one embodiment, client is when choosing multiple nodes, it is possible to and continuous several times choose the same node,
In this manner, client may determine that whether the transmission times to the transaction location inquiry request of the node reaches threshold value,
If so, sending transaction location inquiry request to the node delay.The statistics of transmission times can count the number in a period of time,
All history numbers can also be counted.By the above-mentioned means, can avoid continuously requesting another section in terms of client
Point reduces the influence to the load of another node.
The second aspect of the scheme of this specification embodiment, as shown in figure 3, Fig. 3 is that embodiment provides by this specification
Client in terms of a kind of alliance's chain reliability verification method flow diagram, user generate trade, and by pair
It connects after the transaction cochain deposited card by node, comprising:
S301 obtains multiple node address in alliance's chain, and specific mode includes, multiple in random acquisition alliance's chain
Node address;Alternatively, obtaining multiple node address comprising the docking node address in alliance's chain.
S303 sends transaction location inquiry request to the multiple node, wherein institute according to the multiple node address
State the abstract Hash in transaction location inquiry request comprising the transaction;
S305, according to the consistent degree for the position enquiring result that the multiple node returns respectively, verifying includes the friendship
The confidence level of alliance's chain of easy information.
Further, the above method further includes, according to the multiple node address, sending simple payment verification SPV request
To the multiple node, wherein include the abstract Hash of the transaction in the SPV request;Receive the multiple node difference
The SPV verification result of return, the confidence level of alliance chain of the verifying comprising the Transaction Information.
Further, the transmission transaction location inquiry request in the S303 is to the multiple node, including, for described more
Any node in a node judges whether the transmission times to the transaction location inquiry request of the node reaches threshold value, if so,
Transaction location inquiry request is sent to the node delay.
The third aspect of the scheme of this specification embodiment, as shown in figure 4, Fig. 4 is that embodiment provides by this specification
A kind of alliance's chain request processing method flow diagram, generate and trade in user, and by docking node by the friendship
After easy cochain deposits card, comprising:
S401, the node determine the user identifier of own node user, and white from determining to be made of user identifier
List, wherein the user identifier is used for identity user identity, and, the node for identifying and the user is docked;Alliance's chain
In can be good by offered format, include the information for docking node in user identifier, for example, being opened in user identifier
Head adds docking node of the different serial numbers to identify the user.
S403 sends other nodes of the white list into alliance's chain, so that other nodes are according to white list determination
No to execute request transmitted by non-self node users, the request includes transaction location inquiry request or simple payment verification
SPV is requested, and includes the abstract Hash of target transaction in the request.
Further, the above method further includes that node receives request transmitted by any user, further includes in the request
User identifier;Judge whether the user identifier is in white list, if it is not, not executing processing to request.
Further, the above method further includes receiving request transmitted by any user, further includes user in the request
Mark, when the non-self node users of the user corresponding to the user identifier: determining the node for other node users institutes
First number of processes of the request of initiation, and, at confirm the request that other nodes initiate the node users second
Manage number;According to first number of processes and second processing number, judge whether request described in delay disposal.
Corresponding with first aspect, this specification embodiment also provides a kind of trust verification system of alliance's chain, including visitor
Family end and alliance's chain network, alliance's chain network include multiple nodes;It generates and trades in client, and will by docking node
After the transaction cochain deposits card,
Client obtains multiple node address in alliance's chain;According to the multiple node address, sends transaction location and look into
Request is ask to the multiple node, wherein include the abstract Hash of the transaction in the transaction location inquiry request;
Any node in alliance's chain network receives the position enquiring request, respectively inquires institute based on the abstract Hash
Location information of the transaction in alliance's chain corresponding to abstract Hash is stated, and returns to the position enquiring result to client
End;
The consistent degree for the position enquiring result that client is returned respectively based on the multiple node, verifying include the friendship
The confidence level of alliance's chain of easy information.
Further, in the system, the client obtains multiple node address in alliance's chain at random;Alternatively,
Client obtains multiple node address comprising the docking node address in alliance's chain.
Further, in the system, client sends simple payment verification SPV according to the multiple node address
It requests to the multiple node, wherein include the abstract Hash of the transaction in the SPV request;Any node is based on described
Abstract Hash respectively verifies whether transaction corresponding to the abstract Hash is to generate SPV verifying knot in alliance's chain
Fruit, and the SPV verification result is returned to client;The SPV verification result that client is returned respectively based on the multiple node,
The confidence level of alliance chain of the verifying comprising the Transaction Information.
Further, in the system, before multiple node address that client obtains in alliance's chain, in alliance's chain
Any node determine the white list of itself, and broadcast other nodes of the white list into alliance's chain, so as to other nodes according to
The white list determines whether to execute query processing;It include the abstract Hash of the transaction in the transaction location inquiry request,
It include: the abstract Hash and the client identification that the transaction location inquiry request includes the transaction;Any node receives
After the position enquiring request, further includes: determine that the position enquiring requests whether included client identification is in white
In list, if it is not, not executing query processing.
Further, in the system, which determines the position enquiring that itself initiates other node users
First number of processes of request, and, confirm the second of the position enquiring request that other nodes initiate the node users
Number of processes;According to first number of processes and second processing number, judge whether that position enquiring described in delay disposal is requested.
Further, in the system, the client, for any node in the multiple node, judgement pair
Whether the transmission times of the transaction location inquiry request of the node reaches threshold value, if so, sending transaction location to the node delay
Inquiry request
Corresponding with second aspect, this specification embodiment also provides a kind of trust verification device of alliance's chain, with
Family generate transaction, and by docking node the transaction cochain is deposited into card after, as shown in figure 5, Fig. 5 is this specification embodiment institute
A kind of structural schematic diagram of the trust verification device provided, described device include:
Module 501 is obtained, multiple node address in alliance's chain are obtained;
Sending module 503 sends transaction location inquiry request to the multiple node according to the multiple node address,
It wherein, include the abstract Hash of the transaction in the transaction location inquiry request;
Receiving module 505 receives the position enquiring result that the multiple node returns respectively;
Authentication module 507, according to the consistent degree of the position enquiring result, verifying includes the alliance of the Transaction Information
The confidence level of chain.
Further, the acquisition module 501, the random multiple node address obtained in alliance's chain;Alternatively, obtaining alliance
Multiple node address comprising the docking node address in chain.
Further, the sending module 503 is also used to, and according to the multiple node address, sends simple payment verification
SPV is requested to the multiple node, wherein includes the abstract Hash of the transaction in the SPV request;The receiving module
505, receive the SPV verification result that the multiple node returns respectively;The authentication module 507 is verified according to the SPV and is tied
Fruit, the confidence level of alliance chain of the verifying comprising the Transaction Information.
Further, the sending module 503 judges for any node in the multiple node to the node
Whether the transmission times of transaction location inquiry request reaches threshold value, if so, sending transaction location inquiry request to the node delay.
Corresponding with the third aspect, this specification embodiment also provides the request processing unit in a kind of alliance's chain, is located at
On node in alliance's chain, as shown in fig. 6, Fig. 6 is a kind of request processing unit provided by this specification embodiment
Structural schematic diagram, described device include:
Determining module 601, determines the user identifier of own node user, and from the white name for determining to be made of user identifier
It is single, wherein the user identifier is used for identity user identity, and, the node for identifying and the user is docked;
Sending module 603 sends other nodes of the white list into alliance's chain, so that other nodes are according to the white list
Determine whether to execute request transmitted by non-self node users, the request includes transaction location inquiry request or simple branch
Verifying SPV request is paid, includes the abstract Hash of target transaction in the request.
Further, described device further includes receiving module 605, receives request transmitted by any user, the request
In further include user identifier;Judgment module 607, judges whether the user identifier is in white list, if it is not, not holding to request
Row processing.
Further, the receiving module 605 receives request transmitted by any user, further includes using in the request
Family mark, when the non-self node users of the user corresponding to the user identifier, the determining module 601 is also used to, and is determined
First number of processes of the request that the node initiates other node users, and, confirm other nodes for the node
The second processing number for the request that user is initiated;The judgment module 607 is also used to, according to first number of processes and
Two number of processes judge whether request described in delay disposal.
This specification embodiment also provides a kind of computer equipment, includes at least memory, processor and is stored in
On reservoir and the computer program that can run on a processor, wherein processor is realized shown in Fig. 3 when executing described program
The reliability verification method of alliance's chain.
This specification embodiment also provides a kind of computer equipment, includes at least memory, processor and is stored in
On reservoir and the computer program that can run on a processor, wherein processor is realized shown in Fig. 4 when executing described program
Request processing method in alliance's chain.
Fig. 7 shows one kind provided by this specification embodiment and more specifically calculates device hardware structural schematic diagram,
The equipment may include: processor 1010, memory 1020, input/output interface 1030, communication interface 1040 and bus
1050.Wherein processor 1010, memory 1020, input/output interface 1030 and communication interface 1040 are real by bus 1050
The now communication connection inside equipment each other.
Processor 1010 can use general CPU (Central Processing Unit, central processing unit), micro- place
Reason device, application specific integrated circuit (Application Specific Integrated Circuit, ASIC) or one
Or the modes such as multiple integrated circuits are realized, for executing relative program, to realize technical side provided by this specification embodiment
Case.
Memory 1020 can use ROM (Read Only Memory, read-only memory), RAM (Random Access
Memory, random access memory), static storage device, the forms such as dynamic memory realize.Memory 1020 can store
Operating system and other applications are realizing technical solution provided by this specification embodiment by software or firmware
When, relevant program code is stored in memory 1020, and execution is called by processor 1010.
Input/output interface 1030 is for connecting input/output module, to realize information input and output.Input and output/
Module can be used as component Configuration (not shown) in a device, can also be external in equipment to provide corresponding function.Wherein
Input equipment may include keyboard, mouse, touch screen, microphone, various kinds of sensors etc., output equipment may include display,
Loudspeaker, vibrator, indicator light etc..
Communication interface 1040 is used for connection communication module (not shown), to realize the communication of this equipment and other equipment
Interaction.Wherein communication module can be realized by wired mode (such as USB, cable etc.) and be communicated, can also be wirelessly
(such as mobile network, WIFI, bluetooth etc.) realizes communication.
Bus 1050 include an access, equipment various components (such as processor 1010, memory 1020, input/it is defeated
Outgoing interface 1030 and communication interface 1040) between transmit information.
It should be noted that although above equipment illustrates only processor 1010, memory 1020, input/output interface
1030, communication interface 1040 and bus 1050, but in the specific implementation process, which can also include realizing normal fortune
Other assemblies necessary to row.In addition, it will be appreciated by those skilled in the art that, it can also be only comprising real in above equipment
Component necessary to existing this specification example scheme, without including all components shown in figure.
This specification embodiment also provides a kind of computer readable storage medium, is stored thereon with computer program, the journey
The reliability verification method of alliance's chain shown in Fig. 3 is realized when sequence is executed by processor.
This specification embodiment also provides another computer readable storage medium, is stored thereon with computer program, should
The request processing method in alliance's chain shown in Fig. 4 is realized when program is executed by processor.
Computer-readable medium includes permanent and non-permanent, removable and non-removable media can be by any method
Or technology come realize information store.Information can be computer readable instructions, data structure, the module of program or other data.
The example of the storage medium of computer includes, but are not limited to phase change memory (PRAM), static random access memory (SRAM), moves
State random access memory (DRAM), other kinds of random access memory (RAM), read-only memory (ROM), electric erasable
Programmable read only memory (EEPROM), flash memory or other memory techniques, read-only disc read only memory (CD-ROM) (CD-ROM),
Digital versatile disc (DVD) or other optical storage, magnetic cassettes, tape magnetic disk storage or other magnetic storage devices
Or any other non-transmission medium, can be used for storage can be accessed by a computing device information.As defined in this article, it calculates
Machine readable medium does not include temporary computer readable media (transitory media), such as the data-signal and carrier wave of modulation.
As seen through the above description of the embodiments, those skilled in the art can be understood that this specification
Embodiment can be realized by means of software and necessary general hardware platform.Based on this understanding, this specification is implemented
Substantially the part that contributes to existing technology can be embodied in the form of software products the technical solution of example in other words,
The computer software product can store in storage medium, such as ROM/RAM, magnetic disk, CD, including some instructions are to make
It is each to obtain computer equipment (can be personal computer, server or the network equipment etc.) execution this specification embodiment
Method described in certain parts of a embodiment or embodiment.
System, method, module or the unit that above-described embodiment illustrates can specifically realize by computer chip or entity,
Or it is realized by the product with certain function.A kind of typically to realize that equipment is computer, the concrete form of computer can
To be personal computer, laptop computer, cellular phone, camera phone, smart phone, personal digital assistant, media play
In device, navigation equipment, E-mail receiver/send equipment, game console, tablet computer, wearable device or these equipment
The combination of any several equipment.
All the embodiments in this specification are described in a progressive manner, same and similar portion between each embodiment
Dividing may refer to each other, and each embodiment focuses on the differences from other embodiments.Especially for method reality
For applying example, since it is substantially similar to the method embodiment, so describing fairly simple, related place is referring to embodiment of the method
Part explanation.Embodiment of the method described above is only schematical, wherein described be used as separate part description
Module may or may not be physically separated, can be each module when implementing this specification example scheme
Function realize in the same or multiple software and or hardware.Can also select according to the actual needs part therein or
Person's whole module achieves the purpose of the solution of this embodiment.Those of ordinary skill in the art are not the case where making the creative labor
Under, it can it understands and implements.
The above is only the specific embodiment of this specification embodiment, it is noted that for the general of the art
For logical technical staff, under the premise of not departing from this specification embodiment principle, several improvements and modifications can also be made, this
A little improvements and modifications also should be regarded as the protection scope of this specification embodiment.