CN110032892A - A kind of innovatory algorithm based on block chain DPOS common recognition mechanism - Google Patents
A kind of innovatory algorithm based on block chain DPOS common recognition mechanism Download PDFInfo
- Publication number
- CN110032892A CN110032892A CN201910086535.8A CN201910086535A CN110032892A CN 110032892 A CN110032892 A CN 110032892A CN 201910086535 A CN201910086535 A CN 201910086535A CN 110032892 A CN110032892 A CN 110032892A
- Authority
- CN
- China
- Prior art keywords
- block
- node
- malice
- verified
- hash value
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
Abstract
The invention discloses a kind of innovatory algorithm based on block chain DPOS common recognition mechanism, the data structure including block, the data structure of the block has been divided into block head and block body；Wherein block head, which contains, is linked to previous block hash value, determine current block using preset first choosing method first submits node, it submits node to generate the first block to be verified by described first, and the described first block to be verified is broadcasted to each non-submission node；Each non-submission node verifies the validity of the described first block to be verified, and generates the voting result accepted or rejected；Block body has recorded the complete information of the transaction complete information and verifying that are packaged, marks malice block and normal blocks using the common prefix of character string by MPT come squeezing characters string；For malice block, block body extracts and utilizes effective information therein；For normal blocks, block body is sent to block head, the hash value as previous block.
Description
Technical field
The invention belongs to block chain common recognition mechanism fields, are related to a kind of improvement calculation based on block chain DPOS common recognition mechanism
Method.
Background technique
The exploitation of traditional game belongs to high-tech, compound engineering, and such characteristic causes resource to be easy to concentrations, shape
At nature of monopoly head, determine player for assets in game, the only limited right to use in fact, and there is no real institutes
It has the right.Such situation causes buyer from " object for appreciation " to " krypton ", value caused by behavior, and the moment all has devaluation even zero
Risk.In this case, the purchasing power of buyer is not discharged adequately in fact.
Bell's chain (Baer Chain) makes an energy using block chain technology by the exploitation to game bottom public affairs chain
Enough break up the block chain game ecology platform of above-mentioned industry pain spot.On this platform, the speciality of block chain decentralization can
The generation for avoiding giant from monopolizing, also there is no intermediaries to forcibly occupy the phenomenon that channel is pumped into appearance.And the producer --- the game being worth
Between developer and game player, will have and more purely, be completely worth circulation and interact, and then push entire game industry
Further flourishing: based on the Technical Architecture support that Bell's chain (Baer Chain) is perfect, game developer largely opens saving
Hair and resources costs, they only need to be absorbed in game core content and logic development, allow entire ecological return to innovate, experience,
Game application more polynary, abundant is realized in the fair competition of technology and value.Common recognition mechanism as bottom public affairs chain refers to,
Block chain affairs reach the algorithm of distributed common recognition, and Bell's chain is very stringent for the demand of efficiency and safety, but is encountering
In the case where malice block, traditional DPoS efficiency and safety are lower.
Summary of the invention
It is an object of the invention to: a kind of innovatory algorithm based on block chain DPOS common recognition mechanism is provided, is solved
In the case where encountering malice block, traditional DPoS efficiency and the lower problem of safety.
The technical solution adopted by the invention is as follows:
A kind of innovatory algorithm based on block chain DPOS common recognition mechanism, the data structure including block, the number of the block
Block head and block body have been divided into it according to structure；Wherein block head, which contains, is linked to previous block hash value, and utilization is preset
First choosing method determines that the first of current block submits node, submits node to generate the first block to be verified by described first,
And the described first block to be verified is broadcasted to each non-submission node；Each non-submission node is to the described first area to be verified
The validity of block is verified, and generates the voting result accepted or rejected；
Block body has recorded the complete information of the transaction complete information and verifying that are packaged, utilizes character string by MPT
Common prefix carrys out squeezing characters string, marks malice block and normal blocks；For malice block, block body is extracted and is utilized wherein
Effective information；For normal blocks, block body is sent to block head, the hash value as previous block.
Present solution provides a kind of innovatory algorithms based on block chain DPOS common recognition mechanism, solve and are encountering malice block
In the case where, traditional DPoS efficiency and the lower problem of safety, using algorithm after the improvement of the above method, it can be ensured that going out
Now after malice block, the block for being marked as cancer (Cancer) can be not only disposed, ensures the safety of entire public chain ecology,
The effective information in Cancer block can be extracted and be recycled simultaneously, promoted and go out block speed after encountering malice block,
Therefore in the case where encountering malice block, SH-DPoS can have more efficiency and safety than traditional DPoS, and then from bottom
The efficient error correction of value is ensured in logic, quickly transmitting and tight protection.Wherein in order to guarantee tree encryption safe, Mei Gejie
Point is cited by his hash, rather than the memory address of 32bit or 64bit, that is, the part Merkle set is a node
The hash of determinacy encryption.One nonleaf node is stored in leveldb relevant database, and the key in database is node
RLP coding sha3 Hash, value be node RLP coding.Go for the child node of a nonleaf node, it is only necessary to
The RLP coding that database obtains node is accessed according to the hash of child node, is then decoded just.
Further, the malice block is when the quantity that voting result is the non-submission node not received accounts for node total number
Ratio be greater than preset threshold when, using the described first block to be verified as malice block, and be added to the complete information of verifying
In.Traditional is all that the ratio for using the quantity of the non-submission node when voting result to receive to account for node total number is greater than default private
When key threshold value, normal blocks are labeled as, improper block continues to return to the drawbacks of last link is recalculated, brought in this way
Increasing for trojan horse, as long as so this programme and traditional scheme completely on the contrary, when voting result be do not receive it is non-
When the quantity of node being submitted to account for the ratio of node total number greater than preset threshold, using the described first block to be verified as malice area
Block, and be added in the complete information of verifying；Such first is the possibility for having intercepted subsequent viral, second after label and
It extracts and using the information in malice block, the passage of information will not be caused.
Further, after there is malice block, marking malice block is the block of Cancer.
Further, by the hash value of previous block and the last hash value for executing hash algorithm output, as current
The secondary input for executing the hash algorithm obtains the hash value when the previous output for executing the hash algorithm；It previous ought hold
The hash value of the output of the row hash algorithm, according to preset rules be mapped to one only one-component be 1 remaining be all 0
Primary vector submits node using number node identical with the number of component in the primary vector for 1 as described first；
Wherein, the laststate vector is used to determine that the first of current block to submit node,
In conclusion by adopting the above-described technical solution, the beneficial effects of the present invention are:
1. a kind of innovatory algorithm based on block chain DPOS common recognition mechanism in the present invention, it can be ensured that malice block occurring
Afterwards, the block for being marked as cancer (Cancer) can be not only disposed, ensures the safety of entire public chain ecology；
2. a kind of innovatory algorithm based on block chain DPOS common recognition mechanism in the present invention, can be to effective in Cancer block
Information is extracted and is recycled, and is promoted and is gone out block speed after encountering malice block, therefore in the case where encountering malice block,
SH-DPoS can have more efficiency and safety than traditional DPoS, and then the efficient error correction of value is ensured from Lower level logical,
Quickly transmitting and tight protection.
Detailed description of the invention
In order to illustrate the technical solution of the embodiments of the present invention more clearly, below will be to needed in the embodiment attached
Figure is briefly described, it should be understood that the following drawings illustrates only certain embodiments of the present invention, therefore is not construed as pair
The restriction of range for those of ordinary skill in the art without creative efforts, can also be according to this
A little attached drawings obtain other relevant attached drawings, in which:
Fig. 1 is flow chart of the present invention；
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that described herein, specific examples are only used to explain the present invention, not
For limiting the present invention, i.e., described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is logical
The component for the embodiment of the present invention being often described and illustrated herein in the accompanying drawings can be arranged and be designed with a variety of different configurations.
Therefore, the detailed description of the embodiment of the present invention provided in the accompanying drawings is not intended to limit below claimed
The scope of the present invention, but be merely representative of selected embodiment of the invention.Based on the embodiment of the present invention, those skilled in the art
Member's every other embodiment obtained without making creative work, shall fall within the protection scope of the present invention.
It should be noted that the relational terms of term " first " and " second " or the like be used merely to an entity or
Operation is distinguished with another entity or operation, and without necessarily requiring or implying between these entities or operation, there are any
This actual relationship or sequence.Moreover, the terms "include", "comprise" or its any other variant be intended to it is non-exclusive
Property include so that include a series of elements process, method, article or equipment not only include those elements, but also
Further include other elements that are not explicitly listed, or further include for this process, method, article or equipment it is intrinsic
Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including described
There is also other identical elements in the process, method, article or equipment of element.
Feature and performance of the invention are described in further detail below with reference to embodiment.
Embodiment one
A kind of innovatory algorithm based on block chain DPOS common recognition mechanism, the data structure including block, the number of the block
Block head and block body have been divided into it according to structure；Wherein block head, which contains, is linked to previous block hash value, and utilization is preset
First choosing method determines that the first of current block submits node, submits node to generate the first block to be verified by described first,
And the described first block to be verified is broadcasted to each non-submission node；Each non-submission node is to the described first area to be verified
The validity of block is verified, and generates the voting result accepted or rejected；
Block body has recorded the complete information of the transaction complete information and verifying that are packaged, utilizes character string by MPT
Common prefix carrys out squeezing characters string, marks malice block and normal blocks；For malice block, block body is extracted and is utilized wherein
Effective information；For normal blocks, block body is sent to block head, the hash value as previous block.
When work: the data structure of block has been divided into block head (Header) and block body (Body).Wherein, block head
(Header) it contains and is linked to previous block Hash, and by appearance, previous block in timestamp, random number, block body
The reference of the elements such as Hash ensure that the irreversible basis of chain data；Block body has recorded the transaction complete information being packaged,
By MPT (Merkle-Patricia-Trie) using the common prefix of character string come squeezing characters string, inquiry is improved to reach
Efficiency and the purpose for saving memory space.Such structure simultaneously, it can be ensured that after there is malice block, can not only dispose
It is marked as the block of cancer (Cancer), ensures the safety of entire public chain ecology, while can be to effective in Cancer block
Information is extracted and is recycled, and is promoted and is gone out block speed after encountering malice block, therefore in the case where encountering malice block,
SH-DPoS can have more efficiency and safety than traditional DPoS, and then the efficient error correction of value is ensured from Lower level logical,
Quickly transmitting and tight protection.Wherein in order to guarantee that the encryption safe set, each node are cited by his hash, rather than
The memory address of 32bit or 64bit, that is, the part Merkle set are the hash of the determinacy encryption of a node.One n omicronn-leaf
Node is stored in leveldb relevant database, and the key in database is the sha3 Hash of the RLP coding of node, value
It is the RLP coding of node.Go for the child node of a nonleaf node, it is only necessary to which database is accessed according to the hash of child node
The RLP coding for obtaining node, then decodes just.
Embodiment two
Further, preferably；The malice block is when voting result is the non-submission node not received
When the ratio that quantity accounts for node total number is greater than preset threshold, using the described first block to be verified as malice block, and it is added to
In the complete information of verifying.Traditional is all that the quantity of the non-submission node when voting result to receive is used to account for node total number
When ratio is greater than default private key threshold value, it being labeled as normal blocks, improper block, which continues to return to last link, to be recalculated,
The drawbacks of bringing in this way is increasing for trojan horse, as long as so this programme and traditional scheme are completely on the contrary, when voting knot
When fruit is that the quantity for the non-submission node not received accounts for the ratio of node total number greater than preset threshold, by the described first area to be verified
Block is added in the complete information of verifying as malice block；Such first is the possibility for having intercepted subsequent viral, second
After label and extracts and using the information in malice block, the passage of information will not be caused.
Further, preferably；After there is malice block, marking malice block is the block of Cancer.
Further, preferably；The hash value of previous block and last execution hash algorithm are exported
Hash value is obtained as when the previous input for executing the hash algorithm when the previous output for executing the hash algorithm
Hash value；By when the hash value of the previous output for executing the hash algorithm, one only one is mapped to according to preset rules
Component be 1 remaining be all 0 primary vector, will number and the number of the component identical node work in the primary vector for 1
Node is submitted for described first；Wherein, the laststate vector is used to determine that the first of current block to submit node.
The foregoing is merely illustrative of the preferred embodiments of the present invention, the protection scope being not intended to limit the invention, any
Those skilled in the art within the spirit and principles in the present invention made by any modifications, equivalent replacements, and improvements etc.,
It should all be included in the protection scope of the present invention.
Claims (4)
1. a kind of innovatory algorithm based on block chain DPOS common recognition mechanism, the data structure including block, it is characterised in that: described
The data structure of block has been divided into block head and block body；Wherein block head, which contains, is linked to previous block hash value, benefit
Determine current block with preset first choosing method first submits node, submits node to generate first by described first to be tested
Block is demonstrate,proved, and the described first block to be verified is broadcasted to each non-submission node；Each non-submission node is to described first
The validity of block to be verified is verified, and generates the voting result accepted or rejected；
Block body has recorded the complete information of the transaction complete information and verifying that are packaged, utilizes the public of character string by MPT
Prefix carrys out squeezing characters string, marks malice block and normal blocks；For malice block, block body extracts and has using therein
Imitate information；For normal blocks, block body is sent to block head, the hash value as previous block.
2. a kind of innovatory algorithm based on block chain DPOS common recognition mechanism according to claim 1, it is characterised in that: described
When malice block is that the ratio for accounting for node total number when the quantity that voting result is the non-submission node not received is greater than preset threshold,
Using the described first block to be verified as malice block, and it is added in the complete information of verifying.
3. a kind of innovatory algorithm based on block chain DPOS common recognition mechanism according to claim 2, it is characterised in that: going out
Now after malice block, marking malice block is the block of Cancer.
4. it is according to claim 1 it is a kind of based on block chain DPOS common recognition mechanism innovatory algorithm, it is characterised in that: will before
The hash value of one block and the last hash value for executing hash algorithm output execute the defeated of the hash algorithm as when previous
Enter, obtains the hash value when the previous output for executing the hash algorithm；It will be when the previous output for executing the hash algorithm
Hash value, according to preset rules be mapped to one only one-component be 1 remaining be all 0 primary vector, will number with it is described
The identical node of number of component in primary vector for 1 submits node as described first；Wherein, the laststate vector
For determining that the first of current block submits node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910086535.8A CN110032892A (en) | 2019-01-29 | 2019-01-29 | A kind of innovatory algorithm based on block chain DPOS common recognition mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910086535.8A CN110032892A (en) | 2019-01-29 | 2019-01-29 | A kind of innovatory algorithm based on block chain DPOS common recognition mechanism |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110032892A true CN110032892A (en) | 2019-07-19 |
Family
ID=67235543
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910086535.8A Pending CN110032892A (en) | 2019-01-29 | 2019-01-29 | A kind of innovatory algorithm based on block chain DPOS common recognition mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110032892A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112203280A (en) * | 2020-10-10 | 2021-01-08 | 北京航空航天大学 | Data credible transmission mechanism facing edge gateway |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160330027A1 (en) * | 2015-05-05 | 2016-11-10 | ShoCard, Inc. | Identity Management Service Using A Blockchain Providing Certifying Transactions Between Devices |
| CN107171810A (en) * | 2017-06-27 | 2017-09-15 | 中国联合网络通信集团有限公司 | The verification method and device of block chain |
| CN108320155A (en) * | 2017-12-21 | 2018-07-24 | 中国科学院信息工程研究所 | A method of realizing block chain common recognition mechanism |
| CN108427601A (en) * | 2017-02-13 | 2018-08-21 | 北京航空航天大学 | A kind of cluster transaction processing method of privately owned chain node |
| US20190019144A1 (en) * | 2017-07-05 | 2019-01-17 | United Parcel Service Of America, Inc. | Counterparty physical proximity verification for digital asset transfers |
-
2019
- 2019-01-29 CN CN201910086535.8A patent/CN110032892A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160330027A1 (en) * | 2015-05-05 | 2016-11-10 | ShoCard, Inc. | Identity Management Service Using A Blockchain Providing Certifying Transactions Between Devices |
| CN108427601A (en) * | 2017-02-13 | 2018-08-21 | 北京航空航天大学 | A kind of cluster transaction processing method of privately owned chain node |
| CN107171810A (en) * | 2017-06-27 | 2017-09-15 | 中国联合网络通信集团有限公司 | The verification method and device of block chain |
| US20190019144A1 (en) * | 2017-07-05 | 2019-01-17 | United Parcel Service Of America, Inc. | Counterparty physical proximity verification for digital asset transfers |
| CN108320155A (en) * | 2017-12-21 | 2018-07-24 | 中国科学院信息工程研究所 | A method of realizing block chain common recognition mechanism |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112203280A (en) * | 2020-10-10 | 2021-01-08 | 北京航空航天大学 | Data credible transmission mechanism facing edge gateway |
| CN112203280B (en) * | 2020-10-10 | 2024-02-09 | 北京航空航天大学 | Data trusted transmission mechanism oriented to edge gateway |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| He et al. | Characterizing code clones in the ethereum smart contract ecosystem | |
| Oren | On the cunning power of cheating verifiers: Some observations about zero knowledge proofs | |
| CN109985389A (en) | Cards game anti-cheating method and its system based on block chain intelligence contract | |
| CN110032892A (en) | A kind of innovatory algorithm based on block chain DPOS common recognition mechanism | |
| Alvim et al. | Quantitative information flow in interactive systems | |
| CN110809042A (en) | Intelligent contract fragmentation storage method based on de bruijn sequence generation technology | |
| Liu et al. | Towards automated verification of smart contract fairness | |
| Sakız et al. | Blockchain beyond cryptocurrency: non-fungible tokens | |
| CN113448694B (en) | Block chain consensus method for improving transaction processing capability | |
| CN107835077A (en) | Mutual trust cluster collaborative verification method for anonymous authentication of vehicle-mounted network | |
| CN110674503A (en) | Intelligent contract endless loop detection method based on graph convolution neural network | |
| Sakama et al. | Representing argumentation frameworks in answer set programming | |
| CN113989697A (en) | Short video frequency classification method and device based on multi-mode self-supervision deep countermeasure network | |
| CN111311284B (en) | Cosmetics traceability platform system based on block chain | |
| Andersson | An improved algorithm for discounted payoff games | |
| CN112073365B (en) | Response message processing method and device based on FPGA | |
| CN104281632B (en) | Coding-decoding method and system based on Object Protocol mapping | |
| CN108108267A (en) | The restoration methods and device of data | |
| US6111660A (en) | Efficient digital data encoding in a data processing system | |
| CN113190850B (en) | Method for realizing intelligent contract short address attack detection tool | |
| Song | Global quota system and China's textile and clothing industry | |
| Lammersen et al. | How trade and aid can help deliver sustainable development goals | |
| JP2021034882A (en) | Node and decentralized consensus building system | |
| Wang et al. | A co-ranking framework to select optimal seed set for influence maximization in heterogeneous network | |
| Bu et al. | Security Checking of Trigger-Action-Programming Smart Home Integrations |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190719 |
|
| RJ01 | Rejection of invention patent application after publication |