CN108416593A - A kind of block chain common recognition method and system proved based on network dispersion degree - Google Patents
A kind of block chain common recognition method and system proved based on network dispersion degree Download PDFInfo
- Publication number
- CN108416593A CN108416593A CN201810228942.3A CN201810228942A CN108416593A CN 108416593 A CN108416593 A CN 108416593A CN 201810228942 A CN201810228942 A CN 201810228942A CN 108416593 A CN108416593 A CN 108416593A
- Authority
- CN
- China
- Prior art keywords
- node
- block
- transaction
- network
- honeycomb
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
- G06Q20/401—Transaction verification
-
- 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
Abstract
The present invention relates to a kind of block chain common recognition method and systems proved based on network dispersion degree.This method includes：Flower node sends out a broadcast singal before transaction is issued；Worker bee node generates gathering honey request according to broadcast singal, and sends it to colored node；Main chain end block address and the affiliated honeycomb node address of worker bee node are write into the data structure of transaction, and broadcast transaction by flower node when receiving first gathering honey request；Content of the honeycomb node based on previous block carries out book keeping operation power competition, and victor will generate new block, and the new block is distributed to network.Technical scheme of the present invention can realize more environmentally friendly, more fair encryption digital cash underlying protocol.
Description
Technical field
The present invention relates to block chain technical fields, and in particular to a kind of block chain common recognition side proved based on network dispersion degree
Method and system.
Background technology
Include mainly proof of work (Proof Of Work, POW) pattern, workload in the common recognition mechanism of block chain
With its simple directly " energy person obtains more ", logic ideally solves the problems, such as the common recognition of open distributed system to proof pattern, is institute
There is solution the inside most efficient, it is most stable, and most embody essence.But there are problems that calculating power contest, energy consumption wave
Take and its serious.
Equity proves that (Proof Of Stake, POS) pattern develops on the basis of proof of work, will
Core logic develops into " rich person obtains more " from " energy person obtains more " so that the book keeping operation power competition of block chain is needed static one by one
Internal state between carry out, electric power need not be consumed, to solve the problems, such as calculate power waste.But equity proves mould
Also therefore there is the problems such as multiple ballot and equity crush attack in formula.Since its core logic is " rich person mostly ", when paying
After going out identical working time, the rich can obtain more, so the rich tend to spend more time services, and the poor's then phase
Instead, lead to rich Geng Fu, the poor are poorer, this process can constantly accelerate, and finally become " the noble's game " of a few peoples.In addition,
Although part equity identification protocol realizes the interest system of complete justice, instead of mine activity is dug, such agreement " gives institute
Someone rewards, and is equivalent to owner and does not all reward ", the enthusiasm that all users participate in safeguarding network is reduced, network is made to hold
It is vulnerable to attack.
Invention content
In view of the deficiencies of the prior art, to realize that more environmentally friendly, more fair encryption digital cash underlying protocol, the present invention carry
For a kind of block chain common recognition method and system proved based on network dispersion degree.
On the one hand, the present invention provides a kind of block chain common recognition method proved based on network dispersion degree, this method includes：
Step 1, flower node sends out a broadcast singal before transaction is issued；
Step 2, worker bee node generates gathering honey request according to the broadcast singal received, and the gathering honey is asked to send out
It send to flower node；
Step 3, flower node is when receiving first gathering honey request, by main chain end block address b and worker bee node
Affiliated honeycomb node address m writes into the data structure of the transaction, and broadcasts the transaction；
Step 4, content of the honeycomb node based on previous block carries out book keeping operation power competition, and victor will generate new block, and
The new block is distributed to network.
On the other hand, the present invention provides a kind of block chain common recognition system proved based on network dispersion degree, the system packets
Include colored node, honeycomb node and worker bee node：
Flower node, for before transaction is issued, sending out a broadcast singal；
Worker bee node for generating gathering honey request according to the broadcast singal received, and the gathering honey is asked to send out
It send to flower node；
Flower node is additionally operable to when receiving first gathering honey request, by main chain end block address b and worker bee node
Affiliated honeycomb node address m writes into the data structure of the transaction, and broadcasts the transaction；
Honeycomb node carries out book keeping operation power competition for the content based on previous block, and victor will generate new block, and will
The new block is distributed to network.
The advantageous effect of the block chain common recognition method and system provided by the invention proved based on network dispersion degree is, in area
During the common recognition of block chain, there is no power contest is calculated, energy consumption can be substantially saved；Also multiple ballot is not present and equity crushing is attacked
The defect hit；In addition, optimizing Wealthy distribution logic on the basis of based on equity, all non-positive nodes are replaced to join with miner
It works with network operation, ensure that the permanent operating of the health of network；Finally, it is ensured that wealth obtains and workload matches, from
And the benign development of digital cash can be pushed.
Description of the drawings
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technology description to be briefly described, it should be apparent that, the accompanying drawings in the following description is this hair
Some bright embodiments for those of ordinary skill in the art without having to pay creative labor, can be with
Obtain other attached drawings according to these attached drawings.
Fig. 1 is that a kind of network node of block chain common recognition system proved based on network dispersion degree of the embodiment of the present invention is shown
It is intended to；
Fig. 2 is a kind of flow signal of block chain common recognition method proved based on network dispersion degree of the embodiment of the present invention
Figure；
Fig. 3 is a kind of network structure frame of block chain common recognition system proved based on network dispersion degree of the embodiment of the present invention
Figure.
Specific implementation mode
The principle and features of the present invention will be described below with reference to the accompanying drawings, and the given examples are served only to explain the present invention, and
It is non-to be used to limit the scope of the present invention.
Fig. 1 show a kind of network section of block chain common recognition system proved based on network dispersion degree of the embodiment of the present invention
Point schematic diagram.
System includes representing the flower node of ordinary user, represents the honeycomb node of miner, and is attached to each honeycomb section
Each worker bee node of point.
1. spending node
Broadcast source node in network per transaction is a colored node, is responsible for response first and is asked to its initiation gathering honey
The worker bee node asked.The equity of flower node is considered as nectar, acquire nectar number influence miner, that is, honeycomb node is competing
Strive power.Flower node also possesses the franchise to main chain branch.
2. honeycomb node
Honeycomb node is miner, possesses the worker bee node of oneself and collects nectar for it, and it is competing to participate in book keeping operation power using nectar
It strives, additionally to complete the groundwork of common miner：Verify transaction, block etc..Any user all can serve as honeycomb node.
3. worker bee node
It is attached to each honeycomb node, the flower node being responsible near detecting, while gathering honey request is sent out as early as possible.One request
Gathering honey is considered as by the process of flower node response.One honeycomb node can possess multiple worker bee nodes of dispersion.
As shown in Fig. 2, a kind of block chain common recognition method proved based on network dispersion degree of the embodiment of the present invention includes：
Step 1, flower node sends out a broadcast singal before every transaction publication.
Step 2, worker bee node generates gathering honey request according to the broadcast singal received, and the gathering honey is asked to send out
It send to flower node.
Step 3, flower node is when receiving first gathering honey request, by main chain end block address b and worker bee node
Affiliated honeycomb node address m writes into the data structure of the transaction, and broadcasts the transaction.Namely primary successfully gathering honey is complete
At.
The transaction is bundled to new block by the confirmation of arbitrary honeycomb node, and the new block is broadcasted to network.
It should be noted that GHOST agreements can be referred to, identification main chain is made to follow " most heavy " principle.In addition, being saved in worker bee
Point gathering honey request in can there are one block address as reference, but using whether completely flower node.
Transaction data structure needs to increase the field of two 32 bytes of b and m, if other positions do not store account power
Benefit, it is also necessary to add equity size field.
Step 4, content of the honeycomb node based on previous block carries out book keeping operation power competition, and victor will generate new block, and
The new block is distributed to network.
In other words, honeycomb node constantly carries out gathering honey activity in the whole network, and the result of acquisition records within a block, acquisition
Nectar amount is directly proportional to the probability for winning book keeping operation power；Flower node every time all vote to main chain with equity by broadcast, the knot of ballot
Fruit also records within a block, and the equity that block is won is directly proportional to the probability that it wins.
User every time transaction all voted respectively main chain and accounting nodes with equity, win the most branch of equity or
The probability highest that node is won.
It should be noted that in order to control ballot frequency, need to count each account last time transaction to current block
Interval, with certain particle size, such as using as unit of 10 blocks as adjustment factor, since 0, often spends a unit interval, is
Number increases certain proportion, is spaced one section of long period, such as 6000 blocks, could be extensive by coefficient after about 100 hours
Maximum value is arrived again；Each same UTXO also increases adjustment factor, and equity size is adjusted with frequency of transferring accounts, method and parameter all with
The former is identical.Furthermore it is possible to increase the transaction of pure ballot type to improve efficiency.
Because of network delay, to full out obtain the information of dispersion in a network, it is necessary to equally be dispersed in
Multiple node collected boths in network could realize that this is can not to reach by improving the performance of single machine, and this is also
A kind of embodiment of " ability ".The ability identification protocol that the embodiment of the present invention can provide a kind of not power consumption power is replaced equity and is proved.By
In many processes all can not, need not also break away from leisure right, finally prove that user can be allowed to freely select with equity, or use
Ability is weighed to fight for book keeping operation, guides user to participate in by distribution of interests rule, farthest can guarantee fairness and pacify
Quan Xing.
According to the above common recognition flow, honeycomb node to obtaining the advantage of bigger in competition, must just possess it is more and
And more dispersed worker bee node.So this competition mechanism can not be simulated on single machine, the fairness for digging mine ensure that.
And the meaning that the ballot main chain is detached with book keeping operation power ballot is, makes equity independent to determine branch.Because
Honeycomb node contention is ballot of the user to book keeping operation power, and necessity for not influencing, not fighting for is taken in it in the ballot of main chain,
It can guarantee that can also be imitated prevents the attack to branch even if there is the case where user excessively concentrates in this way.
The structure of the bee of honeycomb processing simultaneously can be embedded in common app and webpage development, and one can be helped with this
A little developers walk out only obtains the predicament of income by display advertisement, or app or webpage can be made to possess more preferably user
It is contributed in experience.
In the present embodiment, during the common recognition of block chain, there is no power contest is calculated, energy consumption can be substantially saved；Also not
There are the defects that multiple ballot and equity crush attack；In addition, Wealthy distribution logic is optimized on the basis of based on equity, with
Miner replaces all non-positive nodes to participate in network operation work, ensure that the permanent operating of the health of network；Finally, it is ensured that wealth
Richness obtains and workload matches, so as to push the benign development of digital cash.
It should be noted that because the present embodiment just for complete decentralization common recognition agreement, therefore to PBFT, DPOS,
The agreements such as Ripple are temporarily not discussed.
In order to possess it is stronger go out block ability, honeycomb node can win more flower nodes as much as possible, although everybody
All nectar can be obtained with more workers bee, such as the embedded worker bee program in app just must be constantly in order to there are more workers bee
The quality of app is improved to win user.But inevitably, it has some users mutually to reach an agreement, in the form of team
Mine, such as wallet or mine pond are dug in cooperation.Therefore, a classification options are provided in structure of deal, A. can be selected to broadcast
Form receive worker bee gathering honey；Or B. specifies a miner, directly him is allowed to win ballot paper；Even C. is directed toward oneself, individually digs
Mine.It does so to seem and affects fairness, but actually stand from the point of view of miner, if they can be by adjusting oneself
Allocation plan, by compete with one another for attract user, just will appear some groups not of uniform size, it is competing together with worker bee plus honeycomb
Block power is striven out, this is also advantageous that in fact develops in network health.These groups or individual, the pattern to be similar to POS are joined
With competition, the risk of certain honeycomb control whole networks for possessing huge worker bee group can be effectively reduced.
Preferably, the step 4 specifically includes：
Step 4.1, honeycomb node verifies the transaction in the new block for receiving broadcast, and checks the friendship
B and m in easily mark the transaction for book keeping operation power voting results x, when b is directed toward current chain when m is directed toward honeycomb node itself
When the block of end, it is main chain voting results y to mark the transaction.
Step 4.2, the equity number of all colored nodes is obtained according to the new block, and extremely by the equity number mean allocation
All each leisure new district of colored node every transaction in the block.
Step 4.3, the equity number X for adding up while there is the transaction of x labels and y labels to get, until going out block, and unites
The equity number Y that transaction with y labels in meter current block is got.At most add up 100 blocks.
About y and Y, the regulation of cheating and attack is deferred to.
Its advantageous transaction is packaged 1. filtering transaction, miner, that is, honeycomb node are only chosen
Because of the competitive environment after going out the transaction for including when block every time and can influencing, honeycomb node possibly through
The transaction for selecting packing attempts to obtain more favorable position.
The transaction that block each first includes only accounts for the sub-fraction of statistics total amount, and the content for changing a block can not be to system
Meter result causes prodigious influence.Problems are preferably solved, the flower node for counting the All Activity of this packing is needed
The sum of equity be used as parameter, for adjusting the calculating cycle for going out block next time, equity is higher, and calculating cycle is shorter, otherwise gets over
It is long, for example calculating cycle is allowed to float between 0.9 second to 1.1 seconds, it will have a direct impact on the speed for going out block next time in this way.Such one
Come, is packaged transaction as much as possible and is only better choice, it is possible to reduce the motivation that honeycomb node is done evil.The parameter is every one section
Time should do primary adjustment according to average value.
It thus may be there are one query：Y why is referred to when accumulative equity to mark, cannot directly come by x labels based on
It calculatesThe problem of this is just not present without reference to y labels, and also bad understanding in this way：Count the voting results of accounting nodes
When the voting results of branch, also band is come in, logically without in all senses.But a unique benefit is done so, has been exactly
Any person's mistake branch all cannot get income, can promote user more careful when selecting branch in this way, rather than at will choosing, or
Person does not select.Even if do so can cause it is a part of it is not statistical uncertainty really, it is contemplated that the probability that lonely block is generated in practical application is not high,
For benefit said before, the deviation statistically brought can also ignore.
2. being equally filtering transaction, but purpose is to influence the development speed of branch
Because going out the number of transaction that block includes every time also determines that current chain next time goes out block speed (influencing Y parameter), attack
The person of hitting can reduce the number of transaction of certain branch intentionally, influence the identification of main chain.
In order to solve this problem, when checking the address b in transaction in process steps 4 of knowing together, work as in addition to label is directed toward
The transaction at preceding chain end is other than y, and the transaction that also label is directed toward current chain inverse the 2nd, 3 (quantity is adjustable) block is y1, calculates Y
When value, the transaction of two kinds of labels of y, y1 counts simultaneously.Accordingly even when some attacker weaken some block go out block speed, as long as
His subsequent miner is honest, and the transaction that attacker is missed will intentionally is filled, and it is reciprocal that current chain is directed toward in these trade fairs
The 2+ block.If these transaction can be effectively provided to the required equity value of difficult parameters, the development of this branch
Speed can also be made up up by subsequent miner.
Here query there are one may also equally：It can also be counted with x and y1 labels when calculating X parameter
Transaction, even someone has intentionally done trick when being packaged block to transaction in this way, as long as several pieces of miner is friendship below
It easily fills, influence there will not be on statistical resultAnswer is cannot.Since if doing so, when generating branch, node
It can shirk the heavy work and choose the light, ballot is to the block before branch, to ensure that oneself is correct.Branch can be interfered quickly to decide the winner in this way,
Lead to not determine main chain in time.
A Hash operation based on calibration constant, such as timestamp, idiograph etc. is carried out with predetermined period
HashProof (), as hashProof ()<When target*d*X*Y, then meet block requirement, wherein target is target, d
It is difficulty adjustment parameter.
If period receives multiple competition blocks, can be with parallel processing.In order not to weaken main chain, as long as main chain weight is no more than
Current chain+8, not stop at the competition of current chain, also comply with number one in this way, as it is possible that becoming main chain.
It should be noted that according to the regulation of cheating and attack, calculating cycle has floating.
Step 4.4, when reaching block requirement, the packaging file is generated according to the transaction received in the calibration period, and
The packaging file is broadcasted to the whole network.
Preferably, the packaging file specifically includes：What is received in the calibration period merchandises, is all with x labels and y labels
Transaction id information and each colored node and honeycomb node income.
Wherein, the id information of transaction (in order to save space, can be in 100 block range interior codings) each colored node with
Honeycomb node and other calculating parameters make the income obtained by digging mine be marked with y by honeycomb node and all marked with x for verifying
The flower node of note is divided in portion.
About allocation plan, the regulation of distribution of income is deferred to.
If the income allocation strategy dug obtained by mine is different, user can cause network structure and individual under the driving of interests
The variation of behavior.Here distribution refers to the distribution obtained by A classes digging mine, and the distribution of B classes and C classes is completed by miner completely.
1. obtaining more interests after splitting oneself in order to avoid honeycomb node, honeycomb node should consolidating according to total amount
Certainty ratio is divided into.
2. the distribution weight of equity influences whether the selection of user, if pressing mining rights completely, absolutely fair distribution
Mechanism may be not enough to that more ordinary users is attracted to participate, but if equity weight is too low, can lose too many height
The user of equity.
3. after the proportion for reducing equity, in order to avoid user can infinitely split the account of oneself to obtain more incomes,
It needs, using service charge as foundation is referred to, more optional strategies can also be provided in this way for the user of different demands, play tune
The effect of section.
So A classes dig mine allocation plan preferably by two parameter joint effects of equity and service charge, such as：Miner and wallet
Get the 30% of total revenue, remaining to be divided into two parts, 1/3 distributes according to service charge, and 2/3 according to mining rights.Here equity
Refer to the equity for being accumulated to X parameter, each flower node can compute repeatedly.
Acquiescence service charge of the user under different voting schemes can be average each according to two kinds of users of A, B for the previous period
The number n for participating in out block is adjusted.Number is fewer, illustrates that such miner is more, then reduces transaction fee, attracts more use
Family, to match the quantity of miner.Even if actually that people can not allowed to make similar put down naturally if above-mentioned adjustment economic law
Weighing apparatus, only slowly.In addition, digging mine to A classes, it can also adjust honeycomb node simultaneously according to n and be divided into ratio：Number is few, then
Reduction is divided into ratio, attracts more users to select A modes, while can also reduce the quantity of honeycomb node, accelerates regulating networks
Structure.
In addition, about certificate parameter and the occupied exceptional space of distribution of income data, at most it is equivalent to and merchandises to every
Increase the id of 2 bytes, the income of 4 bytes, completely within tolerance interval.And it verifies block or confirms exchange's volume to be done
100 blocks before outer work is at most then traversal, will not cause excessive workload.
For 51% attack problem.If some user has concentrated 50% or more resource, system that will be completely in him
Control under, this point and other algorithms be identical.The journey that can be launched a offensive about the user for having grasped 50% or less resource
It spends, the setting before temporary use, it is 60 seconds to go out block period, and 6000 block gaps are equity convalescence, then average each block meeting
The equity for having total amount 1/6000 takes 100 blocks as statistics section, then averagely going out block every time just has (1/6000) * 100=
1/60 equity participates in competition.To control out block power, it is only necessary to be put into the equity more than 1/120 in each block.It is assumed that one
A user has grasped 50% equity and has all saved bit by bit more than 100 hours, then he can ensure in (50%)/(1/
120)=60 the interior energy of block successfully carries out honeysuckle attack.So if there are one critically important transaction, 1 hour time is waited for
Confirmed again, just can guarantee and be perfectly safe.
The statistics section of 100 blocks is a very conservative design, is caused in order to prevent when verifying block and transaction
Bottleneck is temporarily set as 100 blocks.It is horizontal indeed according to the search speed of current database, as long as carrying out appropriate set
Meter, also prodigious room for promotion.Assuming that can be promoted to 1000 blocks as statistics section, the safety of system can improve 10
Times, and so on.
In order to simulate worker bee node, it is many right to be accessed in p2p networks by a large amount of worker bee node of simulation establishment
End, to improve successfully the probability of gathering honey.In order to cope with this situation, can be controlled when creating p2p connections, such as
Each user terminal only establishes connection with the most fast preceding M worker bee node of oneself response speed.
As shown in figure 3, a kind of block chain common recognition system proved based on network dispersion degree of the embodiment of the present invention includes flower
Node, honeycomb node and worker bee node：
Flower node, for before every transaction publication, sending out a broadcast singal.
Worker bee node for generating gathering honey request according to the broadcast singal received, and the gathering honey is asked to send out
It send to flower node.
Flower node is additionally operable to when receiving first gathering honey request, by main chain end block address b and worker bee node
Affiliated honeycomb node address m writes into the data structure of the transaction, and broadcasts the transaction.
Honeycomb node carries out book keeping operation power competition for the content based on previous block, and victor will generate new block, and will
The new block is distributed to network.
Preferably, the honeycomb node is specifically used for：
For in the new block for receiving broadcast, verifying the transaction, and check b and m in the transaction, when
When m is directed toward honeycomb node itself, mark the transaction for book keeping operation power voting results x, when b is directed toward current chain end section block, mark
Remember that the transaction is main chain voting results y.
The equity number of all colored nodes is obtained according to the new block, and the equity number mean allocation to all flowers is saved
The every transaction in the block of each leisure new district of point.
Equity number X accumulative while that there is the transaction of x labels and y labels to get, until going out block, and counts current block
In the equity number Y that gets of transaction with y labels.
A Hash operation hashProof () based on calibration constant is carried out with predetermined period, as hashProof ()<
When target*d*X*Y, then meet block requirement, wherein target is target, and d is difficulty adjustment parameter.
When reaching block requirement, the packaging file is generated according to the transaction received in the calibration period, and beaten by described in
APMB package is broadcasted to the whole network.
Preferably, the honeycomb node is specifically used for：To demarcate in the period transaction that receive and it is all have x labels and
The id information of the transaction of y labels, the income of each colored node and honeycomb node are packaged as the packaging file.
Reader should be understood that in the description of this specification reference term " one embodiment ", " is shown " some embodiments "
The description of example ", " specific example " or " some examples " etc. mean specific features described in conjunction with this embodiment or example, structure,
Material or feature are included at least one embodiment or example of the invention.In the present specification, above-mentioned term is shown
The statement of meaning property need not be directed to identical embodiment or example.Moreover, particular features, structures, materials, or characteristics described
It may be combined in any suitable manner in any one or more of the embodiments or examples.In addition, without conflicting with each other, this
The technical staff in field can be by the spy of different embodiments or examples described in this specification and different embodiments or examples
Sign is combined.
Although the embodiments of the present invention has been shown and described above, it is to be understood that above-described embodiment is example
Property, it is not considered as limiting the invention, those skilled in the art within the scope of the invention can be to above-mentioned
Embodiment is changed, changes, replacing and modification.
Claims (10)
- A kind of method 1. block chain proved based on network dispersion degree is known together, which is characterized in that the method includes：Step 1, flower node sends out a broadcast singal before transaction is issued；Step 2, worker bee node generates gathering honey request according to the broadcast singal received, and gathering honey request is sent to Flower node；Step 3, flower node is when receiving first gathering honey request, belonging to main chain end block address b and worker bee node Honeycomb node address m writes into the data structure of the transaction, and broadcasts the transaction；Step 4, content of the honeycomb node based on previous block carries out book keeping operation power competition, and victor will generate new block, and by institute It states new block and is distributed to network.
- The method 2. the block chain according to claim 1 proved based on network dispersion degree is known together, which is characterized in that the step Rapid 4 specifically include：Step 4.1, in the new block for receiving broadcast, the transaction is verified, and checks b and m in the transaction, when When m is directed toward honeycomb node itself, mark the transaction for book keeping operation power voting results x, when b is directed toward current chain end section block, mark Remember that the transaction is main chain voting results y；Step 4.2, the equity number of all colored nodes is obtained according to the new block, and by the equity number mean allocation to all The every transaction in the block of each leisure new district of flower node；Step 4.3, the equity number X for adding up while there is the transaction of x labels and y labels to get, until going out block, and counts and works as The equity number Y that transaction with y labels in preceding piece is got；Step 4.4, when reaching block requirement, the packaging file is generated according to the transaction that receives in the calibration period, and by institute Packaging file is stated to broadcast to the whole network.
- The method 3. the block chain according to claim 2 proved based on network dispersion degree is known together, which is characterized in that described to reach To going out being implemented as block requirement：A Hash operation hashProof () based on calibration constant is carried out with predetermined period, As hashProof ()<When target*d*X*Y, then reach block requirement, wherein target is target, and d is that difficulty adjusts ginseng Number.
- The method 4. the block chain according to claim 3 proved based on network dispersion degree is known together, which is characterized in that the mark Permanent amount is timestamp or idiograph.
- The method 5. the block chain according to claim 2 proved based on network dispersion degree is known together, which is characterized in that described to beat APMB package specifically includes：Calibration the period in receive merchandise, it is all with x label and y label transaction id information and flower The income of node and honeycomb node.
- The method 6. the block chain according to any one of claims 1 to 5 proved based on network dispersion degree is known together, feature exist In, when receiving the gathering honey request, work of each flower node with the calibration quantity most fast to the colored node response speed Bee node establishes connection.
- The method 7. the block chain according to any one of claims 1 to 5 proved based on network dispersion degree is known together, feature exist In the data structure of the transaction includes carrying out the classification options of selection for honeycomb node, and the classification options include：Worker bee node gathering honey is received in the form of broadcast, or specified honeycomb node is directly allowed to win ballot paper, or is directed toward honeycomb section Point itself, individually carries out digging mine.
- The system 8. a kind of block chain proved based on network dispersion degree is known together, which is characterized in that the system comprises flower node, bees Nest node and worker bee node：Flower node, for before transaction is issued, sending out a broadcast singal；Worker bee node for generating gathering honey request according to the broadcast singal received, and gathering honey request is sent to Flower node；Flower node is additionally operable to when receiving first gathering honey request, belonging to main chain end block address b and worker bee node Honeycomb node address m writes into the data structure of the transaction, and broadcasts the transaction；Honeycomb node carries out book keeping operation power competition for the content based on previous block, and victor will generate new block, and will be described New block is distributed to network.
- The system 9. the block chain according to claim 8 proved based on network dispersion degree is known together, which is characterized in that the bee Nest node is specifically used for：In the new block for receiving broadcast, the transaction is verified, and checks b and m in the transaction, when m is directed toward bee When nest node itself, the transaction is marked to mark the friendship when b is directed toward current chain end section block for book keeping operation power voting results x Easily it is main chain voting results y；The equity number of all colored nodes is obtained according to the new block, and the equity number mean allocation is each to all colored nodes The comfortable new district every transaction in the block；Equity number X accumulative while that there is the transaction of x labels and y labels to get, until going out block, and counts in current block and has There is the equity number Y that the transaction that y is marked is got；When reaching block requirement, the packaging file is generated according to the transaction received in the calibration period, and the packing is literary Part is broadcasted to the whole network.
- The system 10. the block chain according to claim 9 proved based on network dispersion degree is known together, which is characterized in that described Reach being implemented as block requirement：A Hash operation hashProof based on calibration constant is carried out with predetermined period (), as hashProof ()<When target*d*X*Y, then reach block requirement, wherein target is target, and d is that difficulty is adjusted Parameter.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810228942.3A CN108416593B (en) | 2018-03-20 | 2018-03-20 | Block chain consensus method and system based on network dispersity certification |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810228942.3A CN108416593B (en) | 2018-03-20 | 2018-03-20 | Block chain consensus method and system based on network dispersity certification |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108416593A true CN108416593A (en) | 2018-08-17 |
| CN108416593B CN108416593B (en) | 2021-02-12 |
Family
ID=63133025
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810228942.3A Expired - Fee Related CN108416593B (en) | 2018-03-20 | 2018-03-20 | Block chain consensus method and system based on network dispersity certification |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108416593B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109104289A (en) * | 2018-08-20 | 2018-12-28 | 陕西优米数据技术有限公司 | Network contribution based on P2P block chain proves the method for proof of common recognition |
| CN109165945A (en) * | 2018-09-07 | 2019-01-08 | 腾讯科技（深圳）有限公司 | Represent node device electoral machinery, device, computer equipment and storage medium |
| CN109658099A (en) * | 2018-12-20 | 2019-04-19 | 莆田市烛火信息技术有限公司 | A kind of account book bookkeeping methods based on block chain |
| CN109921909A (en) * | 2019-02-15 | 2019-06-21 | 北京工业大学 | The block chain common recognition method and device proved based on contribution |
| CN110032600A (en) * | 2019-01-15 | 2019-07-19 | 加拿大辉莱广告公司 | A kind of environmental protection behavior record system |
| CN110096359A (en) * | 2019-04-15 | 2019-08-06 | 华南理工大学 | A kind of block chain proof of work common recognition adjusting of difficulty method of fast convergence |
| CN111277544A (en) * | 2018-12-05 | 2020-06-12 | 中国电信股份有限公司 | Communication method, system and related equipment |
| CN111404961A (en) * | 2020-03-26 | 2020-07-10 | 杭州复杂美科技有限公司 | Federation link point data transmission method, equipment and storage medium |
| CN111708832A (en) * | 2020-05-18 | 2020-09-25 | 杜晓楠 | Method for adjusting block outlet difficulty in block chain network, computer medium and block chain network |
| WO2021135934A1 (en) * | 2019-12-31 | 2021-07-08 | 深圳市红砖坊技术有限公司 | Blockchain accounting method and apparatus, node and storage medium |
| WO2022233164A1 (en) * | 2021-05-07 | 2022-11-10 | 杨鉴 | Consensus method for chain-type periodic voting, and storage medium and electronic device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160098723A1 (en) * | 2014-10-01 | 2016-04-07 | The Filing Cabinet, LLC | System and method for block-chain verification of goods |
| CN106548397A (en) * | 2016-11-22 | 2017-03-29 | 天津米游科技有限公司 | A kind of block chain common recognition mechanism |
| CN107391320A (en) * | 2017-03-10 | 2017-11-24 | 阿里巴巴集团控股有限公司 | One kind common recognition method and device |
| CN107657438A (en) * | 2017-09-18 | 2018-02-02 | 联动优势科技有限公司 | A kind of block chain generation method, data verification method, node and system |
-
2018
- 2018-03-20 CN CN201810228942.3A patent/CN108416593B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160098723A1 (en) * | 2014-10-01 | 2016-04-07 | The Filing Cabinet, LLC | System and method for block-chain verification of goods |
| CN106548397A (en) * | 2016-11-22 | 2017-03-29 | 天津米游科技有限公司 | A kind of block chain common recognition mechanism |
| CN107391320A (en) * | 2017-03-10 | 2017-11-24 | 阿里巴巴集团控股有限公司 | One kind common recognition method and device |
| CN107657438A (en) * | 2017-09-18 | 2018-02-02 | 联动优势科技有限公司 | A kind of block chain generation method, data verification method, node and system |
Non-Patent Citations (1)
| Title |
|---|
| YJ1190590: "一种基于网络分散度的区块链共识协议", 《HTTPS://WWW.JIANSHU.COM/P/D73B3B3EDD0F》 * |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109104289B (en) * | 2018-08-20 | 2021-04-16 | 陕西优米数据技术有限公司 | Method for proving network contribution proving consensus based on P2P block chain |
| CN109104289A (en) * | 2018-08-20 | 2018-12-28 | 陕西优米数据技术有限公司 | Network contribution based on P2P block chain proves the method for proof of common recognition |
| CN109165945A (en) * | 2018-09-07 | 2019-01-08 | 腾讯科技（深圳）有限公司 | Represent node device electoral machinery, device, computer equipment and storage medium |
| CN111277544B (en) * | 2018-12-05 | 2022-04-26 | 中国电信股份有限公司 | Communication method, system and related equipment |
| CN111277544A (en) * | 2018-12-05 | 2020-06-12 | 中国电信股份有限公司 | Communication method, system and related equipment |
| CN109658099A (en) * | 2018-12-20 | 2019-04-19 | 莆田市烛火信息技术有限公司 | A kind of account book bookkeeping methods based on block chain |
| CN110032600B (en) * | 2019-01-15 | 2023-07-14 | 加拿大辉莱广告公司 | Environment-friendly behavior recording system |
| CN110032600A (en) * | 2019-01-15 | 2019-07-19 | 加拿大辉莱广告公司 | A kind of environmental protection behavior record system |
| CN109921909B (en) * | 2019-02-15 | 2021-12-21 | 北京工业大学 | Block chain consensus method and device based on contribution certification |
| CN109921909A (en) * | 2019-02-15 | 2019-06-21 | 北京工业大学 | The block chain common recognition method and device proved based on contribution |
| CN110096359B (en) * | 2019-04-15 | 2021-01-19 | 华南理工大学 | Fast convergence block chain workload certification consensus difficulty adjusting method |
| CN110096359A (en) * | 2019-04-15 | 2019-08-06 | 华南理工大学 | A kind of block chain proof of work common recognition adjusting of difficulty method of fast convergence |
| WO2021135934A1 (en) * | 2019-12-31 | 2021-07-08 | 深圳市红砖坊技术有限公司 | Blockchain accounting method and apparatus, node and storage medium |
| CN111404961A (en) * | 2020-03-26 | 2020-07-10 | 杭州复杂美科技有限公司 | Federation link point data transmission method, equipment and storage medium |
| CN111708832A (en) * | 2020-05-18 | 2020-09-25 | 杜晓楠 | Method for adjusting block outlet difficulty in block chain network, computer medium and block chain network |
| WO2022233164A1 (en) * | 2021-05-07 | 2022-11-10 | 杨鉴 | Consensus method for chain-type periodic voting, and storage medium and electronic device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108416593B (en) | 2021-02-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108416593A (en) | A kind of block chain common recognition method and system proved based on network dispersion degree | |
| Ma et al. | Market structure in bitcoin mining | |
| Ribeiro | Sports scheduling: Problems and applications | |
| US9361762B2 (en) | Online fantasy gaming tournament system and method therefor | |
| CN109639430A (en) | The block catenary system and method for safety high speed lightweight | |
| KR101128985B1 (en) | Online lottery system using capsule and method thereof | |
| CN107566124A (en) | Common recognition method for building up, block catenary system and storage medium based on lottery mechanism | |
| Lewis et al. | On the application of graph colouring techniques in round-robin sports scheduling | |
| CN108447014A (en) | A kind of block chain lottery industry method and system | |
| CN104955536A (en) | Systems and methods for conducting fantasy sports tournaments | |
| CN105654354A (en) | User interaction optimization method and system in live video | |
| CN110855432B (en) | Asynchronous BFT & DPOS consensus mechanism for assigning verifier rewards based on verifiable random functions | |
| US20070265063A1 (en) | Handicapping and Differential Reward System for Skill-Based Games | |
| CN109242484A (en) | A kind of common recognition motivational techniques of block chain | |
| AU2002330597A1 (en) | On-line gaming method and apparatus | |
| CN111080289A (en) | Improved block chain consensus mechanism based on PoW and PoS | |
| CN110458996A (en) | Probability method of adjustment, device, equipment and storage medium based on social platform prize drawing | |
| CN109784885A (en) | A kind of block chain ballot common recognition method and system based on equity | |
| CN108961017A (en) | A kind of block chain common recognition mechanism and the block catenary system based on the common recognition mechanism | |
| Boyen et al. | Blockchain-Free Cryptocurrencies | |
| KR102335260B1 (en) | System and Method for relaying game competition through online | |
| US20060135263A1 (en) | Multiplayer game method and system | |
| Liu et al. | Decentralization is vulnerable under the gap game | |
| BR112019002765A2 (en) | reactive and independent square games adapted for employment in a fantasy sports league environment | |
| KR101408382B1 (en) | Systems and methods for lottery-style games |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20210212 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |