CN107733651A - A kind of block chain generation method, node and system - Google Patents
A kind of block chain generation method, node and system Download PDFInfo
- Publication number
- CN107733651A CN107733651A CN201710814229.2A CN201710814229A CN107733651A CN 107733651 A CN107733651 A CN 107733651A CN 201710814229 A CN201710814229 A CN 201710814229A CN 107733651 A CN107733651 A CN 107733651A
- Authority
- CN
- China
- Prior art keywords
- block
- node
- difficulty
- generation
- new
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
- H04L9/3249—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures using RSA or related signature schemes, e.g. Rabin scheme
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
- G06F9/5072—Grid computing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mobile Radio Communication Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of block chain generation method, node and system, for solving the problems, such as that book keeping operation power is monopolized in block catenary system.Wherein, block chain generation method includes：Obtain the generation nodal information of n block in the local block chain of node；The difficulty target of node is determined as the statistical result of generation node according to n block interior joint；New block is built, the block head of new block includes block head cryptographic Hash, random number and the difficulty target of father's block of new block；Adjustment random number is until meet difficulty target, or, adjustment random number, until node receives the new block broadcast from other nodes, the new block that block catenary system is determined adds local block chain.The difficulty target of each node can be different, can dynamically adjust the difficulty target of node, and the dynamic that the difficulty of book keeping operation power is obtained to node adjusts, therefore can solve the problem that the problem of book keeping operation power is monopolized in block catenary system.
Description
Technical field
The present invention relates to technical field of data processing, more particularly to a kind of block chain generation method, node and system.
Background technology
Block catenary system has been widely used in a variety of data since birth with its distinctive non-stop layer, difficult the features such as rewriting
Occasion is handled, it solves the presence problem of " Byzantine faults " problem, i.e. malicious node by common recognition mechanism, holds so as to realize
Wrong function.Specifically, most nodes in system are selected by common recognition mechanism and thinks that a safe node is used as note
Account node is to realize influence of the malicious node to other nodes in removal system in maximum probability.
Common recognition algorithm based on " resource " be block chain common recognition algorithm in a kind of relatively conventional type feature, such as employee's card
Bright (Proof of Work, PoW) common recognition calculation power resource of the algorithm based on each node, in another example equity proves (Proof of
Stake, PoS) common recognition equity resource of the algorithm based on each node, this common recognition algorithm based on " resource " is particularly suitable for use in use
The numerous block catenary system of wide area network, number of nodes, such as publicly-owned block catenary system, in another example alliance's block catenary system.
However, the book keeping operation that can be occurred using the common recognition algorithm based on " resource " in block catenary system is weighed by some node ridge
Some node in disconnected situation, i.e. block catenary system possesses " resource " of significantly larger than other nodes so that this node quilt
Accounting nodes are confirmed as repeatedly, and when this node is malicious node, common recognition algorithm just loses fault-tolerant effect.
The content of the invention
The present invention provides a kind of block chain generation method, apparatus and system, to solve book keeping operation power quilt in block catenary system
The problem of monopolization.
A kind of block chain generation method of offer of the embodiment of the present invention, the block catenary system suitable for including M node, M are big
In equal to 3, for any node in the M node, including：
Obtain the generation nodal information of n block in the local block chain of the node；N is more than or equal to 1；
The node according to the n block determines the difficulty mesh of the node as the statistical result of generation node
Mark；The difficulty target is used for the difficulty for indicating the book keeping operation power that the node obtains the block catenary system；
Build new block, the block head of the new block include father's block of the new block block head cryptographic Hash, with
Machine number and the difficulty target；
The random number is adjusted until meeting the difficulty target, or, the adjustment random number is until the node receives
To the new block broadcast from other nodes, the new block that the block catenary system is determined adds the local block chain.
Optionally, signing messages collection is also included in the new block；The signing messages collection includes the public key of the node
Information；
The generation nodal information of n block in the local block chain of the node is obtained, including：
Obtain n block newest in the local block chain of the node；
According to the public key information included by the signing messages collection of each block in the n block, obtain in the n block
The generation nodal information of each block.
Optionally, the signing messages, which is concentrated, also includes block head signature value；The block head signature value is using described
What the private key information of node obtained after being signed to the block head；
The random number is adjusted until meeting the difficulty target, including：
Adjust the random number；
The block head signature value is updated according to the random number after adjustment；
Confirm whether the block head signature value meets the difficulty target；
If not satisfied, then the step of adjusting the random number is returned to until the block head signature value meets the difficulty mesh
Mark.
Optionally, the new block block catenary system determined adds the local block chain, including：
The random number is adjusted after the node receives the new block broadcast from other nodes, is determined described new
The generation node of new block in block broadcast；
The generation node of new block in being broadcasted according to the new block is in the generation nodal information of the n block
Statistical conditions, determine the difficulty in computation target for generating node of the new block in the new block broadcast；
Described in difficulty goal satisfaction in the block head of new block in the new block broadcast during difficulty in computation target,
Preserve the new reception block.
Optionally, the node according to the n block determines the node as the statistical result of generation node
Difficulty target, including：
The node according to the n block determines that the node saves as generation as the statistical result of generation node
The frequency of point, and/or, the node is continuously as generation degree of node；
According to frequency of the node as generation node, and/or, the node is continuously true as generation degree of node
The difficulty target of the fixed node；The node is as the frequency of generation node and the node continuously time as generation node
Number and the difficulty positive correlation corresponding to the difficulty target.
The embodiment of the present invention provides a kind of block chain node, the block catenary system suitable for including M node, M more than etc.
In 3, including：Transmit-Receive Unit and processing unit；
The processing unit, for obtaining the generation nodal information of n block in local block chain；N is more than or equal to 1；
The processing unit, the statistical result for being additionally operable to the node according to the n block as generation node are true
The difficulty target of the fixed node；The difficulty target is used to indicate the book keeping operation power that the node obtains the block catenary system
Difficulty；
The processing unit, it is additionally operable to build new block, the block head of the new block includes the father area of the new block
Block head cryptographic Hash, random number and the difficulty target of block；
The processing unit, it is additionally operable to adjust the random number until meeting the difficulty target, or, adjustment is described random
Number is until the Transmit-Receive Unit receives the new block broadcast from other nodes, the new block that the block catenary system is determined
Add the local block chain.
Optionally, signing messages collection is also included in the new block；The signing messages collection includes the public key of the node
Information；
The processing unit, is specifically used for：
Obtain n block newest in local block chain；
According to the public key information included by the signing messages collection of each block in the n block, obtain in the n block
The generation nodal information of each block.
Optionally, the signing messages, which is concentrated, also includes block head signature value；The block head signature value is using described
What the private key information of node obtained after being signed to the block head；
The processing unit, is specifically used for：
Adjust the random number；
The block head signature value is updated according to the random number after adjustment；
Confirm whether the block head signature value meets the difficulty target；
If not satisfied, then the step of adjusting the random number is returned to until the block head signature value meets the difficulty mesh
Mark.
Optionally, the processing unit, is specifically used for：
The random number is adjusted after the Transmit-Receive Unit receives the new block broadcast from other nodes, determines institute
State the generation node of the new block in new block broadcast；
The generation node of new block in being broadcasted according to the new block is in the generation nodal information of the n block
Statistical conditions, determine the difficulty in computation target for generating node of the new block in the new block broadcast；
Described in difficulty goal satisfaction in the block head of new block in the new block broadcast during difficulty in computation target,
Preserve the new reception block.
Optionally, the processing unit is specifically used for：
The node according to the n block determines that the node saves as generation as the statistical result of generation node
The frequency of point, and/or, the node is continuously as generation degree of node；
According to frequency of the node as generation node, and/or, the node is continuously true as generation degree of node
The difficulty target of the fixed node；The node is as the frequency of generation node and the node continuously time as generation node
Number and the difficulty positive correlation corresponding to the difficulty target.
The embodiment of the present invention provides a kind of block catenary system, including the block chain node described in any of the above-described.
The embodiment of the present invention provides a kind of computer-readable recording medium, and the computer-readable recording medium storage has meter
Calculation machine executable instruction, the computer executable instructions are used to make the computer perform the method described in any of the above-described.
The embodiment of the present invention provides a kind of computing device, including：
Memory, instructed for storage program；
Processor, for calling the programmed instruction stored in the memory, performed according to the program of acquisition any of the above-described
Method described in.
In summary, the embodiment of the present invention provides a kind of block chain generation method, node and system, wherein, the life of block chain
It is applied to the block catenary system for including M node into method, M is more than or equal to 3, should for any node in the M node
Method includes：Obtain the generation nodal information of n block in the local block chain of node；According to n block interior joint as life
Statistical result into node determines the difficulty target of node；Difficulty target is used for the book keeping operation power for indicating that node obtains block catenary system
Difficulty；New block is built, the block head of new block includes block head cryptographic Hash, random number and the difficulty of father's block of new block
Target；Adjustment random number is until meet difficulty target, or, adjustment random number is until node is received from the new district of other nodes
Block is broadcasted, and the new block that block catenary system is determined adds local block chain.In the block chain life that the embodiment of the present invention is provided
Into in method, the difficulty target of each node is related as the statistical result of generation node to this node, that is to say, that each
The difficulty target of individual node can be different, and the block chain generation method that the embodiment of the present invention is provided can be according to node conduct
The statistical result dynamic for generating node adjusts the difficulty target of node, and difficulty target can indicate that node obtains block linkwork
The difficulty of the book keeping operation power of system, it is achieved thereby that obtaining the difficulty of book keeping operation power to node as the statistical result of generation node according to node
The dynamic adjustment of degree, therefore can solve the problem that the problem of book keeping operation power is monopolized in block catenary system.
Brief description of the drawings
Technical scheme in order to illustrate the embodiments of the present invention more clearly, make required in being described below to embodiment
Accompanying drawing is briefly introduced, it should be apparent that, drawings in the following description are only some embodiments of the present invention, for this
For the those of ordinary skill in field, without having to pay creative labor, it can also be obtained according to these accompanying drawings
His accompanying drawing.
Fig. 1 is a kind of feasible block catenary system configuration diagram provided in an embodiment of the present invention；
Fig. 2 is a kind of block chain generation method schematic flow sheet provided in an embodiment of the present invention；
Fig. 3 is the block chain structure signal that a kind of two blocks provided in an embodiment of the present invention correspond to same father's block
Figure；
Fig. 4 verifies schematic flow sheet for a kind of new block provided in an embodiment of the present invention；
Fig. 5 is a kind of block chain node structural representation provided in an embodiment of the present invention；
Fig. 6 is a kind of computing device structural representation provided in an embodiment of the present invention.
Embodiment
In order that the object, technical solutions and advantages of the present invention are clearer, the present invention is made below in conjunction with accompanying drawing into
One step it is described in detail, it is clear that the described embodiment only a part of embodiment of the present invention, rather than whole implementation
Example.Based on the embodiment in the present invention, what those of ordinary skill in the art were obtained under the premise of creative work is not made
All other embodiment, belongs to the scope of protection of the invention.
The embodiment of the present invention provides a kind of block catenary system, including M node, and M is more than or equal to 3.Wherein, M node leads to
Peer-to-peer network (Peer to Peer, P2P) dynamic group net is crossed, the system for forming one " decentralization ".Fig. 1 is implemented for the present invention
Example provide a kind of feasible block catenary system configuration diagram, as shown in figure 1, block catenary system include node 0, node 1,
Node 2, node 3 and node 4, peer node each other between this five nodes, pass through P2P dynamic group nets and form a decentralization
System.Straight line in Fig. 1 represents the data transmission relations between each node, and by taking node 2 as an example, its broadcast message can be by node
0th, node 1 and node 3 receive, and further broadcast to node 4, is so as to which broadcast message be transferred to by node 0 and node 3
All nodes in system.
It should be understood that M node in the block catenary system that the embodiment of the present invention is provided is the equity in block catenary system
Node, in specific implementation process, block catenary system also likely to be present some asymmetrical nodes, this to contain asymmetrical node
Block catenary system be also applied for the technical scheme that the embodiment of the present invention is provided, should also be contained in the embodiment of the present invention.For
It is easy to describe, the embodiment of the present invention is in the case where being not specifically noted, node as described below is all peer node, afterwards not
Repeat again.
Based on above-mentioned block catenary system framework, the embodiment of the present invention provides a kind of block chain generation method, as shown in Figure 2.
Fig. 2 is a kind of block chain generation method schematic flow sheet provided in an embodiment of the present invention, and it is directed to M node of block catenary system
In any node, comprise the following steps：
S201：Obtain the generation nodal information of n block in the local block chain of node；N is more than or equal to 1.
S202：The difficulty target of node is determined as the statistical result of generation node according to n block interior joint；Difficulty mesh
Mark for indicating that node obtains the difficulty of the book keeping operation power of block catenary system.
S203：New block is built, the block head of new block includes block head cryptographic Hash, the random number of father's block of new block
With difficulty target.
S204：Adjustment random number is until meet difficulty target, or, adjustment random number is until node is received from other sections
The new block broadcast of point, the new block that block catenary system is determined add local block chain.
In block catenary system, each node has a respective local block chain, and each block passes through Kazakhstan in block chain
Uncommon pointer (the block head cryptographic Hash of father's block) string together, forms chain structure.In S201, the generation node of n block
The node for constructing the block and broadcasting the block to block catenary system is referred to, i.e. the node obtains the note for the block
Account is weighed.Optionally, n block is to be newly joined in local block chain and continuous n block, is entered using the block being newly joined
Row is follow-up to be calculated, and the result obtained has more preferable specific aim to the present case of block catenary system.
In S202, n block interior joint can reflect that the node history obtains area as the statistical result of generation node
The situation of block catenary system book keeping operation power, the difficulty mesh obtained is calculated according to n block interior joint as the statistical result of generation node
Mark can indicate that node obtains the difficulty of the book keeping operation power of block catenary system, it is achieved thereby that according to system of the node as generation node
The dynamic for counting the difficulty that result obtains book keeping operation power to node adjusts, therefore the embodiment of the present invention is respectively what each node obtained
Difficulty target can solve the problem that the problem of book keeping operation power is monopolized in block catenary system.
In S203, each node in M node can carry out new block structure.The block head of new block includes
The block head cryptographic Hash of father's block of new block, to ensure the chain structure of block chain.By above-mentioned discussion, it is known that each is saved
Can all there is local block chain in point.Theoretically, M node should have identical local block chain in block catenary system, but
In actual block catenary system, because the time that new block broadcast is received between each node is not consistent, the calculation power of different nodes
Also it is different so that multiple blocks correspond to same father's block in local block chain may to be present, such as Fig. 3 institutes
Show, the block chain structure schematic diagram of same father's block is corresponded to for a kind of two blocks provided in an embodiment of the present invention.In Fig. 3
Arrow represent Hash pointer (the block head cryptographic Hash of father's block), arrow from block 1 point to block 2, expression be block 2 area
Build includes the block head cryptographic Hash of block 1, it is other by that analogy.In the block chain shown in Fig. 3, block 4 and block 8
All include the block head cryptographic Hash of block 3 in block head, in joint structure new block, chosen according to " most long chain rule " most long
The father of father block of the block being newly joined in chain as new block, the i.e. new block that selection block 7 is constructed as the node
Block, the block head of new block include the block head cryptographic Hash of block 7.
In the block head of new block, in addition to random number and difficulty target, in ensuing S204, block linkwork
System by knowing together algorithm from the new block of M joint structure determines that the new block of block chain can be added.
Optionally, block catenary system version number is also included in the block head of new block, for tracking system software, agreement,
The renewal of algorithm.Optionally, Merkel (Merkle) root cryptographic Hash, Merkle root cryptographic Hash are also included in the block head of new block
It is to calculate what is obtained according to the data recorded in the block body of new block, available for the checking to data.Optionally, new block
Block head in also include timestamp, for recording time proximity caused by the block.
In S204, each node starts continuous after the other parts in building new block in addition to random number
The random number of different values is attempted, the change of random number will result directly in the change of the block head cryptographic Hash of new block, when any
When the block head cryptographic Hash of block takes the lead in meeting difficulty target, the node preserves the new block of its structure, and the new block is led to
Cross new block and broadcast to other nodes in block catenary system.In addition, also have during the node builds new block
The new block broadcast that other nodes are sent may be received, now, the node stops structure new block, and preserves new block broadcast
In new block.Certainly, node can't be immediately subjected in new block broadcast after the new block for receiving other nodes is broadcasted
New block, certain checking can be typically carried out to it, after being verified, the new block during just new block can be broadcasted adds this
Ground block chain.
In the block chain generation method that the embodiment of the present invention is provided, difficulty target and this node of each node are made
It is related to generate the statistical result of node, that is to say, that the difficulty target of each node can be different, the embodiment of the present invention
The block chain generation method provided can adjust the difficulty mesh of node according to node as the statistical result dynamic of generation node
Mark, and difficulty target can indicate that node obtains the difficulty of the book keeping operation power of block catenary system, it is achieved thereby that being made according to node
The dynamic for the difficulty for obtaining book keeping operation power to generate the statistical result of node to node adjusts, therefore can solve the problem that in block catenary system
The problem of book keeping operation power is monopolized.
In above-mentioned S201, node needs to obtain the generation nodal information of n block in local block chain.It was embodied
Cheng Zhong, node can specially increase the record to the generation node of each block in local block chain, as every in local block chain
Increase a block, and increase the record of the block and the generation node of the block in record.Optionally, the present invention is real
Apply example and a kind of more easily mode is also provided.In the new block constructed by S202, namely each block of block chain, in addition to
Signing messages collection；Signing messages collection includes the public key information of node, can now obtain the local block of node in the following ways
The generation nodal information of n block in chain, including：Obtain n block newest in the local block chain of node；According to n area
Public key information in block included by the signing messages collection of each block, obtain the generation nodal information of each block in n block.
When in each block of local block chain include each self-generating node public key information when, just without individually record again each block and its
Node is generated, need to only travel through the block head of each block, the generation nodal information of n block can be directly obtained.
Optionally, signing messages, which is concentrated, also includes block head signature value；Block head signature value is believed using the private key of node
What breath obtained after being signed to block head.In S204, knot adjustment random number until meet difficulty target, including：Adjustment
Random number；According to the more new block head signature value of the random number after adjustment；Confirm whether block head signature value meets difficulty target；If
It is unsatisfactory for, then returns to the step of adjusting random number until block head signature value meets difficulty target.Wherein, the private key of node is utilized
Information, which carries out signature to block head, includes the cryptographic Hash of first calculation block head, afterwards, using the private key of node to the Kazakhstan of block head
Uncommon value encryption.Compared with whether the block head cryptographic Hash after directly judging adjustment random number in the prior art meets difficulty target,
Deterministic process in the embodiment of the present invention is more complicated, can increase the difficulty of design " Special mineral machine ", so that each node
Between it is more fair.Will not typically private key information be informed other nodes by being additionally, since node, therefore also can not just be used " outer
Portion ore deposit pond " disperses the calculating task of the node, further increases the justice between each node.In addition, receive new block
The public key information that the node of broadcast can also use signing messages to concentrate is verified to block head signature value, prevents illegal node
Broadcast message is forged, so as to improve the security of block catenary system.It should be understood that whether judge new block using block head signature value
Meet the implementation of difficulty target both can be combined implementation with other embodiments in the embodiment of the present invention, can also independently be implemented
Applied in other block chain generation methods, should all be contained in the embodiment of the present invention.
The new block broadcast of other nodes may be received during node builds new block, now node need to be to new
New block in block broadcast is verified.Fig. 4 verifies schematic flow sheet for a kind of new block provided in an embodiment of the present invention, such as
Shown in Fig. 4, comprise the following steps：
S401：New block broadcast is received, obtains the new block in new block broadcast；
S402：Public key information and the block head signature value that new block signing messages is concentrated are obtained, is verified using public key information
Whether block head signature value is effective；If so, then perform S403；If it is not, then perform S407；
S403：The difficulty target in new block block head is obtained, verifies whether the block head signature value of new block meets difficulty
Spend target；If so, then perform S404；If it is not, then perform S407；
S404：Obtain the difficulty in computation target of new block generation node；
S405：Judge whether block head signature value meets difficulty in computation target；If so, then perform S406；If it is not, then perform
S407；
S406：Confirmation new block is effective block；
S407：Confirmation new block is invalid block.
It should be understood that above S402 is not to having strict sequencing between S405, can be according to actual conditions adjustment order
Sequentially or simultaneously carry out, also can increase and decrease part steps according to actual conditions.
Optionally, in S404, the difficulty in computation target of new block generation node, bag can be obtained according in the following manner
Include：Statistical conditions of the generation node of new block in being broadcasted according to new block in the generation nodal information of n block, it is determined that
The difficulty in computation target of the generation node of new block in new block broadcast.Node is for the new block that receives, use and structure
Identical difficulty target calculation recalculates the difficulty target of the generation node of the new block received when building new block, this
It is in order to which the generation node for the new block for preventing from receiving has forged a relatively low difficulty target so that itself building new
Block can meet the requirement of difficulty target, thus node after new block broadcast is received, it is necessary to recalculate receive it is new
The difficulty target of the generation node of block.
After the new block that S406 is confirmed in new block broadcast is effective block, node preserves the new block to local
Block chain.
Optionally, node can difficulty in computation target in the following manner, including：According to n block interior joint as generation
The statistical result of node determines frequency of the node as generation node, and/or, node is as generation degree of node；According to section
Frequency of the point as generation node, and/or, node continuously determines the difficulty target of node as generation degree of node；Node
Frequency and node as generation node is continuously as generation degree of node and the difficulty positive correlation corresponding to difficulty target.Instead
Should be in the distribution that block catenary system keeps accounts power：On the one hand, in a cycle being made up of n block, continuous note
The more node of account, obtain book keeping operation power next time and be just more difficult to, conversely, it is then easier, it can so avoid some node from being calculated by high
Power monopolizes book keeping operation power for a long time；On the other hand, in a cycle being made up of n block, the more node of book keeping operation number, under
The secondary book keeping operation power that obtains just is more difficult to, conversely, it is then easier, it can so avoid multiple node joint maximization book keeping operation power.
Optionally, during difficulty in computation target, the Mean Time Between Replacement T0 that block catenary system produces block is may be incorporated into, with
Block catenary system is kept to produce new block in a more average time interval.
Optionally, the difficulty desired value of node is first obtained as the statistical result of generation node according to n block interior joint,
Enter line translation (compression) to difficulty desired value again, the difficulty target for occupying less bit is obtained, to save block catenary system
Memory space.Accordingly, when judging whether to meet difficulty target, also need after difficulty target first is converted into difficulty desired value,
Size contrast further according to difficulty desired value is judged.The embodiment of the present invention provides a kind of feasible difficult by difficulty object transformation
The mode of desired value is spent, wherein, difficulty target is 4 bytes, first character section V1For calculating the digit moved to left, rear three words
Save V3Numerical value is recorded, difficulty target and difficulty desired value meet the relation as shown in formula one.
Wherein, Y represents difficulty desired value.Assuming that the difficulty target in block head is 0x1d00ffff, then according to formula one
It is 0x00000000FFFF00000000000000000000000 that the difficulty desired value obtained corresponding to the difficulty target, which can be calculated,
00000000000000000000000000000, difficulty desired value is smaller, it is meant that the difficulty that node obtains book keeping operation power is higher.
The embodiment of the present invention provides a kind of specific feasible pattern for obtaining difficulty target.First, preset and be per n block
A cycle, preset the generation time T0 of new block.
The average difficulty value of n newest block is obtained, including：Obtain the generation nodal information and n of n newest block
The difficulty target of individual block；Difficulty the desired value X1, X2 ..., Xn for obtaining n block are calculated according to the difficulty target of n block；
According to the difficulty desired value of n block, average difficulty value X=Sum (X1, X2 ..., Xn)/n is obtained.
Obtain n newest block averages out block time T=(T2-T1)/(n-1), wherein, T1 be current period in most
The generation time of an early block, can be determined according to the timestamp of the block, and T2 is the production of last block in current period
The raw time, it can be determined according to the timestamp of the block.
The interior conduct generation degree of node V=Sum of frequency of the calculate node as generation node, i.e. a cycle (V1,
V2 ..., Vn), wherein V1 ... Vn represents whether the node is the generation node for corresponding to block, if so, then value is 1, otherwise takes
It is worth for 0.
The number W=n/C that averagely keeps accounts is obtained, wherein C represents to turn into the interstitial content of generation node in nearest n block.
In V>When 0, difficulty desired value Y=X × (T/T0) × (W/V) is obtained；In V=0, difficulty desired value Y=X is obtained
×(T/T0)×1。
Illustrate, it is assumed that n is arranged to 100, and the generation time T0 for presetting new block is 10 minutes.
New block averagely generated time T as 5 minutes in nearest a cycle, and there are 50 node once conducts in this cycle
Node, C=50, W=2 are generated, and present node is used as accounting nodes totally 16 times in this 100 blocks, V=16, then calculates
Difficulty desired value Y=X × (T/T0) × (W/V)=X*5/10*2/16=X/16 of present node can be obtained.
It is assumed that now the average difficulty desired value of 100 blocks is X=0x00000000FFFF000000000000000000
0000000000000000000000000000000000, then the difficulty desired value that can be calculated present node is 0x00000000
0FFFF000000000000000000000000000000000000000000000000000.Afterwards, difficulty desired value is turned
Being melted into difficulty target is：0x1c0ffff0, detailed calculating process are as follows：V3=0x0ffff0,200 are moved to left by former difficulty desired value
Individual bit；The digit that moves to left of V1 marks, V1=200/8+3=25+3=28=0x1c, then nBits=0x1c0ffff0.
The embodiment of the present invention also provides another feasible implementation, can more efficiently obtain difficulty target, wraps
Include：It is each node distribution identical benchmark difficulty D in block catenary system by the fixed cycle, afterwards, each node is being built
Target difficulty is obtained respectively based on benchmark difficulty D during new block.Wherein, the Cycle Length of fixed cycle and predetermined period phase
Together, difference is that the n block that the fixed cycle included can not be n newest block.For example, during n=100, building
When block is highly 121 new block, n block is block height 101-200 block corresponding to the current fixed cycle, and works as
The block that n block corresponding to preceding predetermined period is block height 21-120.
Specifically include following steps：
Step 1：It is each node distribution identical benchmark difficulty D in block catenary system by the fixed cycle.
D=X × (T/T0), wherein X are the average difficulty value of n block in the previous fixed cycle, and T is previous fixation
The block time is averaged out in cycle, T0 is that default new block goes out the block time.
Step 2：Each node obtains target difficulty respectively when building new block based on benchmark difficulty D.
For each node, calculate node weight E.First, frequency of the calculate node as generation node, i.e., one default
As generation degree of node V=Sum (V1, V2 ..., Vn) in cycle, wherein V1 ... Vn represents whether the node is corresponding area
The generation node of block, if so, then value is 1, otherwise value is 0.
The number W=n/C that averagely keeps accounts is obtained, wherein C represents to turn into the nodes of generation node in n newest block
Mesh.
In V>During W, E=W/V, difficulty desired value Y=D × (W/V) is obtained；
In V<During=W, E=1, difficulty desired value Y=D is obtained.
With an instantiation explanation：
Assuming that block catenary system predetermined period length n=100, the block height H=250 of newest block, preset new block
Go out block time T0=60.
Step 1：Obtain benchmark difficulty D.The average difficulty value of a upper fixed cycle (100-200) is X, and upper one solid
Fixed cycle averages out block time T=(T (200)-T (101))/(100-1), it is assumed that T is 30 seconds.Calculating benchmark difficulty D=X ×
(T/T0)=X × (30/60)=X/2, T (200) is current time when going out block of the block of block height 200, can be according to this
The timestamp of block obtains, and T (101) is current time when going out block of the block of block height 101, can according to the block when
Between stab obtain.
Step 2：Obtain node difficulty desired value Y.First, the node weights E of node is obtained, node weights E is according to height
150-250 block calculates.Assuming that 50 generation nodes, i.e. totally 50 nodes are corresponding with height 150-250 block altogether
Once obtained book keeping operation to weigh and participate in keeping accounts, then accounting nodes number C=50, averagely keep accounts number W=N/50=2 per node.It is false
If actual book keeping operation number V=Sum (V151, V152 ..., V250)=16 of the node in predetermined period, then node weights E=
W/V=2/16=1/8.So as to obtain node difficulty desired value Y=X/2 × 1/8=X/16, represent the difficulty of the node compared to
The average difficulty of a upper fixed cycle improves 16 times.It is assumed that X=
0x00000000FFFF000000000000000000000000000000000000000000 0000000000, then new difficulty
Desired value Y=X × (T/T0) × (W/V)=X*5/10*2/16=X/16=
0x00000000FFFF000000000000000000000000000000000000000000 0000000000/16=
0x000000000FFFF00000000000000000000000000000000000000000 0000000000, it
Afterwards, difficulty target is changed into：0x1c0ffff0.
Based on identical technical concept, a kind of block chain node, the block catenary system suitable for including M node, M is more than
Equal to 3, the block chain node can realize the block chain generation method that any of the above-described embodiment is provided.Fig. 5 is real for the present invention
A kind of block chain node structural representation of example offer is applied, as shown in figure 5, node 500 includes Transmit-Receive Unit 501 and processing unit
502, wherein：
Processing unit 502, for obtaining the generation nodal information of n block in local block chain；N is more than or equal to 1；
Processing unit 502, it is additionally operable to determine the difficulty of node as the statistical result of generation node according to n block interior joint
Spend target；Difficulty target is used for the difficulty for indicating the book keeping operation power that node obtains block catenary system；
Processing unit 502, it is additionally operable to build new block, the block head of new block includes the block head of father's block of new block
Cryptographic Hash, random number and difficulty target；
Processing unit 502, it is additionally operable to adjust random number until meeting difficulty target, or, adjustment random number is until transmitting-receiving is single
Member 501 receives the new block broadcast from other nodes, and the new block that block catenary system is determined adds local block chain.
Optionally, signing messages collection is also included in new block；Signing messages collection includes the public key information of node；
Processing unit 502, is specifically used for：
Obtain n block newest in local block chain；
According to the public key information included by the signing messages collection of each block in n block, each area in n block is obtained
The generation nodal information of block.
Optionally, signing messages, which is concentrated, also includes block head signature value；Block head signature value is believed using the private key of node
What breath obtained after being signed to block head；
Processing unit 502, is specifically used for：
Adjust random number；
According to the more new block head signature value of the random number after adjustment；
Confirm whether block head signature value meets difficulty target；
If not satisfied, the step of then returning to adjustment random number is until block head signature value meets difficulty target.
Optionally, processing unit 502, it is specifically used for：
Adjustment random number determines new block after Transmit-Receive Unit 501 receives the new block broadcast from other nodes
The generation node of new block in broadcast；
Statistics feelings of the generation node of new block in being broadcasted according to new block in the generation nodal information of n block
Condition, determine the difficulty in computation target for generating node of the new block in new block broadcast；
New block broadcast in new block block head in difficulty goal satisfaction difficulty in computation target when, preservation newly connect
Receive block.
Optionally, processing unit 502 is specifically used for：
Node is determined as the frequency for generating node as the statistical result of generation node according to n block interior joint, and/
Or, node is continuously as generation degree of node；
According to frequency of the node as generation node, and/or, node determines the difficulty of node as generation degree of node
Target；Node is as the frequency and node for generating node continuously as generation degree of node and the difficulty corresponding to difficulty target
Positive correlation.
Based on identical technical concept, the embodiment of the present invention also provides a kind of computing device, and the computing device specifically can be with
For desktop computer, portable computer, smart mobile phone, tablet personal computer, personal digital assistant (Personal Digital
Assistant, PDA) etc..As shown in fig. 6, be a kind of computing device structural representation provided in an embodiment of the present invention, the calculating
Equipment can include central processing unit 601 (Center Processing Unit, CPU), memory 602, input equipment 603,
Output equipment 604 etc., input equipment 603 can include keyboard, mouse, touch-screen etc., and output equipment 604 can be set including display
It is standby, such as liquid crystal display (Liquid Crystal Display, LCD), cathode-ray tube (Cathode Ray Tube, CRT)
Deng.
Memory 602 can include read-only storage (ROM) and random access memory (RAM), and be provided to processor
The programmed instruction and data stored in memory.In embodiments of the present invention, memory can be used for storing the embodiment of the present invention
The program of the block chain generation method provided, processor is by calling the programmed instruction of memory storage, according to the journey of acquisition
Sequence instruction performs the block chain generation method that any of the above-described embodiment provides.
Based on identical technical concept, the embodiment of the present invention also provides a kind of computer-readable recording medium, for storing
For the computer program instructions used in above-mentioned computing device, it, which is included, is used to perform the block chain life that any of the above-described embodiment provides
Into the program of method.
The computer-readable storage medium can be any usable medium or data storage device that computer can access, bag
Include but be not limited to magnetic storage (such as floppy disk, hard disk, tape, magneto-optic disk (MO) etc.), optical memory (such as CD, DVD,
BD, HVD etc.) and semiconductor memory (such as it is ROM, EPROM, EEPROM, nonvolatile memory (NAND FLASH), solid
State hard disk (SSD)) etc..
Although preferred embodiments of the present invention have been described, but those skilled in the art once know basic creation
Property concept, then can make other change and modification to these embodiments.So appended claims be intended to be construed to include it is excellent
Select embodiment and fall into having altered and changing for the scope of the invention.
Obviously, those skilled in the art can carry out the essence of various changes and modification without departing from the present invention to the present invention
God and scope.So, if these modifications and variations of the present invention belong to the scope of the claims in the present invention and its equivalent technologies
Within, then the present invention is also intended to comprising including these changes and modification.
Claims (13)
1. a kind of block chain generation method, the block catenary system suitable for including M node, M are more than or equal to 3, it is characterised in that
For any node in the M node, including：
Obtain the generation nodal information of n block in the local block chain of the node；N is more than or equal to 1；
The node according to the n block determines the difficulty target of the node as the statistical result of generation node；Institute
State the difficulty that difficulty target is used to indicate the book keeping operation power that the node obtains the block catenary system；
New block is built, the block head of the new block includes block head cryptographic Hash, the random number of father's block of the new block
With the difficulty target；
The random number is adjusted until meeting the difficulty target, or, the adjustment random number is come up to the node receives
Broadcasted from the new block of other nodes, the new block that the block catenary system is determined adds the local block chain.
2. the method as described in claim 1, it is characterised in that also include signing messages collection in the new block；The signature
Information collection includes the public key information of the node；
The generation nodal information of n block in the local block chain of the node is obtained, including：
Obtain n block newest in the local block chain of the node；
According to the public key information included by the signing messages collection of each block in the n block, obtain each in the n block
The generation nodal information of individual block.
3. method as claimed in claim 2, it is characterised in that the signing messages, which is concentrated, also includes block head signature value；Institute
Stating block head signature value is obtained after being signed using the private key information of the node to the block head；
The random number is adjusted until meeting the difficulty target, including：
Adjust the random number；
The block head signature value is updated according to the random number after adjustment；
Confirm whether the block head signature value meets the difficulty target；
If not satisfied, then the step of adjusting the random number is returned to until the block head signature value meets the difficulty target.
4. the method as described in claim 1, it is characterised in that the new block that the block catenary system determines is added described
Ground block chain, including：
The random number is adjusted after the node receives the new block broadcast from other nodes, determines the new block
The generation node of new block in broadcast；
Statistics of the generation node of new block in being broadcasted according to the new block in the generation nodal information of the n block
Situation, determine the difficulty in computation target for generating node of the new block in the new block broadcast；
Described in difficulty goal satisfaction in the block head of new block in the new block broadcast during difficulty in computation target, preserve
The new reception block.
5. the method as described in any one of Claims 1-4, it is characterised in that the node conduct according to the n block
The statistical result of generation node determines the difficulty target of the node, including：
The node according to the n block determines the node as generation node as the statistical result of generation node
Frequency, and/or, the node is continuously as generation degree of node；
According to frequency of the node as generation node, and/or, the node determines the section as generation degree of node
The difficulty target of point；The node as generation node frequency and the node continuously as generation degree of node with it is described
Difficulty positive correlation corresponding to difficulty target.
6. a kind of block chain node, the block catenary system suitable for including M node, M are more than or equal to 3, it is characterised in that bag
Include：Transmit-Receive Unit and processing unit；
The processing unit, for obtaining the generation nodal information of n block in local block chain；N is more than or equal to 1；
The processing unit, the statistical result for being additionally operable to the node according to the n block as generation node determine institute
State the difficulty target of node；The difficulty target is used for the difficulty for indicating the book keeping operation power that the node obtains the block catenary system
Degree；
The processing unit, it is additionally operable to build new block, the block head of the new block includes father's block of the new block
Block head cryptographic Hash, random number and the difficulty target；
The processing unit, it is additionally operable to adjust the random number until meeting the difficulty target, or, the adjustment random number is straight
The new block broadcast from other nodes is received to the Transmit-Receive Unit, the new block that the block catenary system is determined adds
The local block chain.
7. node as claimed in claim 6, it is characterised in that also include signing messages collection in the new block；The signature
Information collection includes the public key information of the node；
The processing unit, is specifically used for：
Obtain n block newest in local block chain；
According to the public key information included by the signing messages collection of each block in the n block, obtain each in the n block
The generation nodal information of individual block.
8. node as claimed in claim 7, it is characterised in that the signing messages, which is concentrated, also includes block head signature value；Institute
Stating block head signature value is obtained after being signed using the private key information of the node to the block head；
The processing unit, is specifically used for：
Adjust the random number；
The block head signature value is updated according to the random number after adjustment；
Confirm whether the block head signature value meets the difficulty target；
If not satisfied, then the step of adjusting the random number is returned to until the block head signature value meets the difficulty target.
9. node as claimed in claim 6, it is characterised in that the processing unit, be specifically used for：
The random number is adjusted after the Transmit-Receive Unit receives the new block broadcast from other nodes, is determined described new
The generation node of new block in block broadcast；
Statistics of the generation node of new block in being broadcasted according to the new block in the generation nodal information of the n block
Situation, determine the difficulty in computation target for generating node of the new block in the new block broadcast；
Described in difficulty goal satisfaction in the block head of new block in the new block broadcast during difficulty in computation target, preserve
The new reception block.
10. the node as described in any one of claim 6 to 9, it is characterised in that the processing unit is specifically used for：
The node according to the n block determines the node as generation node as the statistical result of generation node
Frequency, and/or, the node is as generation degree of node；
According to frequency of the node as generation node, and/or, the node continuously determines institute as generation degree of node
State the difficulty target of node；The node as generation node frequency and the node continuously as generation degree of node with
Difficulty positive correlation corresponding to the difficulty target.
11. a kind of block catenary system, it is characterised in that including the block chain node as described in any one of claim 6 to 10.
12. a kind of computer-readable recording medium, it is characterised in that the computer-readable recording medium storage has computer can
Execute instruction, the computer executable instructions are used to make the computer perform claim require the side described in 1 to 5 any one
Method.
A kind of 13. computing device, it is characterised in that including：
Memory, instructed for storage program；
Processor, for calling the programmed instruction stored in the memory, according to acquisition program perform as claim 1 to
Method described in 5 any one.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710814229.2A CN107733651B (en) | 2017-09-11 | 2017-09-11 | Block chain generation method, node and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710814229.2A CN107733651B (en) | 2017-09-11 | 2017-09-11 | Block chain generation method, node and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107733651A true CN107733651A (en) | 2018-02-23 |
| CN107733651B CN107733651B (en) | 2020-06-19 |
Family
ID=61206021
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710814229.2A Active CN107733651B (en) | 2017-09-11 | 2017-09-11 | Block chain generation method, node and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107733651B (en) |
Cited By (34)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108712468A (en) * | 2018-04-19 | 2018-10-26 | 上海分布信息科技有限公司 | A kind of block chain income distribution method and distribution system |
| CN108830712A (en) * | 2018-05-17 | 2018-11-16 | 易链科技（深圳）有限公司 | Method, apparatus, equipment and the medium that block generates |
| CN108880795A (en) * | 2018-06-22 | 2018-11-23 | 方亚南 | A kind of block chain security mechanism and device |
| CN109039646A (en) * | 2018-07-12 | 2018-12-18 | 北京链享未来科技有限公司 | A kind of packing of block chain block and verification method and system based on node capacity |
| CN109067516A (en) * | 2018-07-20 | 2018-12-21 | 杭州复杂美科技有限公司 | A kind of drawing method, common recognition method, equipment and storage medium |
| CN109101835A (en) * | 2018-08-08 | 2018-12-28 | 苏州酷外文化传媒有限公司 | The information security management method and device of blind date dating site based on block chain |
| CN109245878A (en) * | 2018-08-03 | 2019-01-18 | 克洛斯比尔有限公司 | A kind of new block generation method, equipment and the readable storage medium storing program for executing of block chain |
| CN109324757A (en) * | 2018-08-22 | 2019-02-12 | 深圳前海微众银行股份有限公司 | Block chain data capacity reduction method, device and storage medium |
| CN109344630A (en) * | 2018-09-18 | 2019-02-15 | 百度在线网络技术（北京）有限公司 | Block generation method, device, equipment and storage medium |
| CN109379381A (en) * | 2018-12-07 | 2019-02-22 | 深圳市智税链科技有限公司 | Data managing method, device, medium and the electronic equipment of block catenary system |
| CN109376274A (en) * | 2018-10-23 | 2019-02-22 | 杭州能链科技有限公司 | Go out block method, equipment and storage medium based on block catenary system |
| CN109375944A (en) * | 2018-08-28 | 2019-02-22 | 苏州浪潮智能软件有限公司 | A kind of terminal software distribution verification method based on block chain data structure |
| CN109450659A (en) * | 2018-12-25 | 2019-03-08 | 杭州复杂美科技有限公司 | Block delayed broadcast method, equipment and storage medium |
| CN109636402A (en) * | 2018-12-14 | 2019-04-16 | 泰康保险集团股份有限公司 | Based on the credit information processing method of block chain, device, equipment, storage medium |
| CN109657450A (en) * | 2018-12-14 | 2019-04-19 | 泰康保险集团股份有限公司 | Method, apparatus, medium and the electronic equipment evaluated based on block chain |
| CN110336779A (en) * | 2019-05-07 | 2019-10-15 | 弦子科技(北京)有限公司 | A kind of construction method, device and the electronic equipment of block chain |
| CN110457006A (en) * | 2019-07-22 | 2019-11-15 | 上海朝夕网络技术有限公司 | The hardware based distributed multi-party random digit generation method of one kind and system |
| CN110705973A (en) * | 2018-07-10 | 2020-01-17 | 深圳市红砖坊技术有限公司 | Consensus method applied to miner nodes in block chain system and block chain system |
| CN110730511A (en) * | 2019-10-18 | 2020-01-24 | 中国联合网络通信集团有限公司 | Communication method, device and system based on block chain |
| CN110853214A (en) * | 2019-11-06 | 2020-02-28 | 杭州复杂美科技有限公司 | Block generation method, device and storage medium |
| CN110880968A (en) * | 2018-09-05 | 2020-03-13 | 元一科技控股有限公司 | Block transmission and recording method and device and computer storage medium |
| WO2020060433A1 (en) * | 2018-09-20 | 2020-03-26 | БОГДАНОВ, Михаил Леонидович | Method for generating a series of random numbers |
| CN111064776A (en) * | 2019-12-05 | 2020-04-24 | 全链通有限公司 | Method and device for generating blocks in block chain and storage medium |
| CN111371558A (en) * | 2020-02-26 | 2020-07-03 | 百度在线网络技术（北京）有限公司 | Block chain data processing method and device, electronic equipment and medium |
| WO2020143431A1 (en) * | 2019-01-07 | 2020-07-16 | 深圳市红砖坊技术有限公司 | Bookkeeping method, mining pool server, terminal apparatus, mining node, and mining pool |
| CN111539817A (en) * | 2020-03-06 | 2020-08-14 | 杜晓楠 | Linear difficulty calculation method for preventing timestamp hijacking among blockchains, computer-readable storage medium and blockchain network |
| CN111708832A (en) * | 2020-05-18 | 2020-09-25 | 杜晓楠 | Method for adjusting block outlet difficulty in block chain network, computer medium and block chain network |
| CN111709049A (en) * | 2020-05-18 | 2020-09-25 | 杜晓楠 | Method for preventing time stamp attack in blockchain system, computer readable storage medium and blockchain system |
| CN111737363A (en) * | 2020-07-22 | 2020-10-02 | 百度在线网络技术（北京）有限公司 | Block chain operation method, device, equipment and storage medium |
| CN113052596A (en) * | 2019-12-28 | 2021-06-29 | 中移(成都)信息通信科技有限公司 | Block chain-based block output method, device, equipment and medium |
| US11269916B2 (en) | 2017-07-14 | 2022-03-08 | Advanced New Technologies Co., Ltd. | Blockchain-based data processing method and device |
| CN114285860A (en) * | 2021-10-30 | 2022-04-05 | 中国银联股份有限公司 | Method, device, equipment and storage medium for adjusting block generation difficulty |
| US11310047B2 (en) | 2017-07-31 | 2022-04-19 | Zhongan Information Technology Services Co., Ltd. | Method and apparatus for configuring local consensus and computer-readable storage medium |
| CN114726851A (en) * | 2020-12-21 | 2022-07-08 | 富泰华工业（深圳）有限公司 | Block operation method, device, electronic equipment and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101637854B1 (en) * | 2015-10-16 | 2016-07-08 | 주식회사 코인플러그 | Certificate issuance system and method based on block chain, certificate authentication system and method based on block chain |
| CN106296191A (en) * | 2016-08-13 | 2017-01-04 | 深圳市樊溪电子有限公司 | A kind of PoW common recognition mechanism of block chain power-aware |
| CN106411503A (en) * | 2016-11-28 | 2017-02-15 | 中国银行股份有限公司 | Accounting method, accounting system, voting node and accounting node under block chain voting and accounting mode |
| CN106789908A (en) * | 2016-11-23 | 2017-05-31 | 江苏通付盾科技有限公司 | Block common recognition method for building up and system in block chain |
| CN106875165A (en) * | 2017-02-22 | 2017-06-20 | 中山大学 | A kind of common recognition algorithm of utilization software defined network optimization |
| CN107005574A (en) * | 2016-12-23 | 2017-08-01 | 深圳前海达闼云端智能科技有限公司 | Block generation method and device and block chain network |
| CN107078903A (en) * | 2016-12-23 | 2017-08-18 | 深圳前海达闼云端智能科技有限公司 | Digging ore deposit method, device and the node device of block chain |
| CN107078910A (en) * | 2016-12-23 | 2017-08-18 | 深圳前海达闼云端智能科技有限公司 | Generate method, device, node, signature device and the system of block chain block |
-
2017
- 2017-09-11 CN CN201710814229.2A patent/CN107733651B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101637854B1 (en) * | 2015-10-16 | 2016-07-08 | 주식회사 코인플러그 | Certificate issuance system and method based on block chain, certificate authentication system and method based on block chain |
| CN106296191A (en) * | 2016-08-13 | 2017-01-04 | 深圳市樊溪电子有限公司 | A kind of PoW common recognition mechanism of block chain power-aware |
| CN106789908A (en) * | 2016-11-23 | 2017-05-31 | 江苏通付盾科技有限公司 | Block common recognition method for building up and system in block chain |
| CN106411503A (en) * | 2016-11-28 | 2017-02-15 | 中国银行股份有限公司 | Accounting method, accounting system, voting node and accounting node under block chain voting and accounting mode |
| CN107005574A (en) * | 2016-12-23 | 2017-08-01 | 深圳前海达闼云端智能科技有限公司 | Block generation method and device and block chain network |
| CN107078903A (en) * | 2016-12-23 | 2017-08-18 | 深圳前海达闼云端智能科技有限公司 | Digging ore deposit method, device and the node device of block chain |
| CN107078910A (en) * | 2016-12-23 | 2017-08-18 | 深圳前海达闼云端智能科技有限公司 | Generate method, device, node, signature device and the system of block chain block |
| CN106875165A (en) * | 2017-02-22 | 2017-06-20 | 中山大学 | A kind of common recognition algorithm of utilization software defined network optimization |
Cited By (51)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11947564B2 (en) | 2017-07-14 | 2024-04-02 | Advanced New Technologies Co., Ltd. | Blockchain-based data processing method and device |
| US11269916B2 (en) | 2017-07-14 | 2022-03-08 | Advanced New Technologies Co., Ltd. | Blockchain-based data processing method and device |
| US11310047B2 (en) | 2017-07-31 | 2022-04-19 | Zhongan Information Technology Services Co., Ltd. | Method and apparatus for configuring local consensus and computer-readable storage medium |
| CN108712468B (en) * | 2018-04-19 | 2021-01-08 | 上海分布信息科技有限公司 | Block chain profit distribution method and distribution system |
| CN108712468A (en) * | 2018-04-19 | 2018-10-26 | 上海分布信息科技有限公司 | A kind of block chain income distribution method and distribution system |
| CN108830712A (en) * | 2018-05-17 | 2018-11-16 | 易链科技（深圳）有限公司 | Method, apparatus, equipment and the medium that block generates |
| CN108880795A (en) * | 2018-06-22 | 2018-11-23 | 方亚南 | A kind of block chain security mechanism and device |
| CN110705973A (en) * | 2018-07-10 | 2020-01-17 | 深圳市红砖坊技术有限公司 | Consensus method applied to miner nodes in block chain system and block chain system |
| CN110705973B (en) * | 2018-07-10 | 2023-05-16 | 深圳市红砖坊技术有限公司 | Common identification method applied to miner nodes in blockchain system and blockchain system |
| CN109039646A (en) * | 2018-07-12 | 2018-12-18 | 北京链享未来科技有限公司 | A kind of packing of block chain block and verification method and system based on node capacity |
| CN109067516B (en) * | 2018-07-20 | 2021-05-11 | 杭州复杂美科技有限公司 | Lottery drawing method, consensus method, device and storage medium |
| CN109067516A (en) * | 2018-07-20 | 2018-12-21 | 杭州复杂美科技有限公司 | A kind of drawing method, common recognition method, equipment and storage medium |
| CN109245878A (en) * | 2018-08-03 | 2019-01-18 | 克洛斯比尔有限公司 | A kind of new block generation method, equipment and the readable storage medium storing program for executing of block chain |
| CN109101835A (en) * | 2018-08-08 | 2018-12-28 | 苏州酷外文化传媒有限公司 | The information security management method and device of blind date dating site based on block chain |
| CN109324757A (en) * | 2018-08-22 | 2019-02-12 | 深圳前海微众银行股份有限公司 | Block chain data capacity reduction method, device and storage medium |
| CN109324757B (en) * | 2018-08-22 | 2021-05-21 | 深圳前海微众银行股份有限公司 | Block chain data capacity reduction method and device and storage medium |
| CN109375944B (en) * | 2018-08-28 | 2021-10-01 | 浪潮金融信息技术有限公司 | Terminal software distribution verification method based on block chain data structure |
| CN109375944A (en) * | 2018-08-28 | 2019-02-22 | 苏州浪潮智能软件有限公司 | A kind of terminal software distribution verification method based on block chain data structure |
| CN110880968A (en) * | 2018-09-05 | 2020-03-13 | 元一科技控股有限公司 | Block transmission and recording method and device and computer storage medium |
| CN109344630A (en) * | 2018-09-18 | 2019-02-15 | 百度在线网络技术（北京）有限公司 | Block generation method, device, equipment and storage medium |
| WO2020060433A1 (en) * | 2018-09-20 | 2020-03-26 | БОГДАНОВ, Михаил Леонидович | Method for generating a series of random numbers |
| CN109376274B (en) * | 2018-10-23 | 2020-12-22 | 杭州能链科技有限公司 | Block output method and device based on block chain system and storage medium |
| CN109376274A (en) * | 2018-10-23 | 2019-02-22 | 杭州能链科技有限公司 | Go out block method, equipment and storage medium based on block catenary system |
| US11968294B2 (en) | 2018-12-07 | 2024-04-23 | Tencent Technology (Shenzhen) Company Limited | Data management method and apparatus for blockchain system, medium, and electronic device |
| CN109379381B (en) * | 2018-12-07 | 2021-06-15 | 深圳市智税链科技有限公司 | Data management method, device, medium and electronic equipment of block chain system |
| CN109379381A (en) * | 2018-12-07 | 2019-02-22 | 深圳市智税链科技有限公司 | Data managing method, device, medium and the electronic equipment of block catenary system |
| CN109636402B (en) * | 2018-12-14 | 2021-08-03 | 泰康保险集团股份有限公司 | Credit information processing method, device, equipment and storage medium based on block chain |
| CN109657450A (en) * | 2018-12-14 | 2019-04-19 | 泰康保险集团股份有限公司 | Method, apparatus, medium and the electronic equipment evaluated based on block chain |
| CN109636402A (en) * | 2018-12-14 | 2019-04-16 | 泰康保险集团股份有限公司 | Based on the credit information processing method of block chain, device, equipment, storage medium |
| CN109450659A (en) * | 2018-12-25 | 2019-03-08 | 杭州复杂美科技有限公司 | Block delayed broadcast method, equipment and storage medium |
| WO2020143431A1 (en) * | 2019-01-07 | 2020-07-16 | 深圳市红砖坊技术有限公司 | Bookkeeping method, mining pool server, terminal apparatus, mining node, and mining pool |
| CN110336779B (en) * | 2019-05-07 | 2022-08-05 | 弦子科技(北京)有限公司 | Block chain construction method and device and electronic equipment |
| CN110336779A (en) * | 2019-05-07 | 2019-10-15 | 弦子科技(北京)有限公司 | A kind of construction method, device and the electronic equipment of block chain |
| CN110457006A (en) * | 2019-07-22 | 2019-11-15 | 上海朝夕网络技术有限公司 | The hardware based distributed multi-party random digit generation method of one kind and system |
| CN110457006B (en) * | 2019-07-22 | 2021-08-06 | 上海朝夕网络技术有限公司 | Distributed multi-party random number generation method and system based on hardware |
| CN110730511A (en) * | 2019-10-18 | 2020-01-24 | 中国联合网络通信集团有限公司 | Communication method, device and system based on block chain |
| CN110853214A (en) * | 2019-11-06 | 2020-02-28 | 杭州复杂美科技有限公司 | Block generation method, device and storage medium |
| CN111064776A (en) * | 2019-12-05 | 2020-04-24 | 全链通有限公司 | Method and device for generating blocks in block chain and storage medium |
| CN113052596A (en) * | 2019-12-28 | 2021-06-29 | 中移(成都)信息通信科技有限公司 | Block chain-based block output method, device, equipment and medium |
| CN113052596B (en) * | 2019-12-28 | 2024-04-09 | 中移(成都)信息通信科技有限公司 | Block chain-based block discharging method, device, equipment and medium |
| CN111371558A (en) * | 2020-02-26 | 2020-07-03 | 百度在线网络技术（北京）有限公司 | Block chain data processing method and device, electronic equipment and medium |
| CN111371558B (en) * | 2020-02-26 | 2024-01-16 | 百度在线网络技术（北京）有限公司 | Block chain data processing method and device, electronic equipment and medium |
| CN111539817A (en) * | 2020-03-06 | 2020-08-14 | 杜晓楠 | Linear difficulty calculation method for preventing timestamp hijacking among blockchains, computer-readable storage medium and blockchain network |
| CN111709049B (en) * | 2020-05-18 | 2023-06-06 | 杜晓楠 | Method for preventing timestamp attack in blockchain system, computer readable storage medium and blockchain system |
| CN111708832A (en) * | 2020-05-18 | 2020-09-25 | 杜晓楠 | Method for adjusting block outlet difficulty in block chain network, computer medium and block chain network |
| CN111709049A (en) * | 2020-05-18 | 2020-09-25 | 杜晓楠 | Method for preventing time stamp attack in blockchain system, computer readable storage medium and blockchain system |
| CN111737363A (en) * | 2020-07-22 | 2020-10-02 | 百度在线网络技术（北京）有限公司 | Block chain operation method, device, equipment and storage medium |
| CN114726851A (en) * | 2020-12-21 | 2022-07-08 | 富泰华工业（深圳）有限公司 | Block operation method, device, electronic equipment and storage medium |
| CN114726851B (en) * | 2020-12-21 | 2023-12-08 | 富泰华工业（深圳）有限公司 | Block operation method, device, electronic equipment and storage medium |
| CN114285860A (en) * | 2021-10-30 | 2022-04-05 | 中国银联股份有限公司 | Method, device, equipment and storage medium for adjusting block generation difficulty |
| CN114285860B (en) * | 2021-10-30 | 2023-07-07 | 中国银联股份有限公司 | Method, device, equipment and storage medium for adjusting block generation difficulty |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107733651B (en) | 2020-06-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107733651A (en) | A kind of block chain generation method, node and system | |
| US11836720B2 (en) | Infinitely scalable cryptocurrency system with fast, secure verification | |
| US10986177B2 (en) | Systems and methods of self-forking blockchain protocol | |
| US20210255995A1 (en) | PROOF OF LOTTERY (PoL) BLOCKCHAIN | |
| US20190303622A1 (en) | Bicameral framework for fast and tamper-resistant blockchain validation | |
| CN108959621B (en) | Method, device, equipment and storage medium for realizing block chain network | |
| CN108848055A (en) | A kind of block chain common recognition method, accounting nodes and node | |
| CN107807951A (en) | A kind of block chain generation method, data verification method, node and system | |
| CN109981281B (en) | Method and device for determining candidate elements based on block chain proposal random consensus | |
| CN106251144A (en) | Electronic money management method and electronic money node apparatus | |
| CN109146484A (en) | Common recognition verification method, digging mine machine and block catenary system based on block chain | |
| CN107846278A (en) | Intelligent contract processing method and processing device | |
| CN108985644A (en) | Mining rights method and device, electronic equipment | |
| CN111130790B (en) | Block co-recognition method based on block chain node network | |
| Ye et al. | A trust-centric privacy-preserving blockchain for dynamic spectrum management in IoT networks | |
| Shi et al. | Pooling is not favorable: Decentralize mining power of PoW blockchain using age-of-work | |
| CN112651830A (en) | Block chain consensus method applied to power resource sharing network | |
| CN109087105A (en) | For digging the Hash Search method of mine, digging mine machine and block catenary system | |
| Ramezan et al. | A strong adaptive, strategic double-spending attack on blockchains | |
| Liu et al. | A distributed game theoretic approach for blockchain-based offloading strategy | |
| CN104717645A (en) | Method and system for ensuring data transmission of wireless sensor network | |
| WO2021074848A1 (en) | Computer-implemented method for reaching a distributed consensus in a blockchain network and node implementing the method | |
| CN109255614A (en) | Digging mine method and device, digging mine machine and block catenary system based on block chain | |
| Wang et al. | A selfish attack on chainweb blockchain | |
| CN115879889A (en) | Service processing method and device based on block chain and computer equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |