CN112838953A - Block chain packing node consensus electing method - Google Patents
Block chain packing node consensus electing method Download PDFInfo
- Publication number
- CN112838953A CN112838953A CN202110031094.9A CN202110031094A CN112838953A CN 112838953 A CN112838953 A CN 112838953A CN 202110031094 A CN202110031094 A CN 202110031094A CN 112838953 A CN112838953 A CN 112838953A
- Authority
- CN
- China
- Prior art keywords
- node
- packing
- random number
- new block
- data
- 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
- 238000012856 packing Methods 0.000 title claims abstract description 50
- 238000000034 method Methods 0.000 title claims abstract description 43
- 238000004806 packaging method and process Methods 0.000 claims abstract description 18
- 230000008569 process Effects 0.000 claims abstract description 14
- 230000001737 promoting effect Effects 0.000 abstract description 5
- 230000009286 beneficial effect Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000012795 verification Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 1
- 238000007599 discharging Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000003306 harvesting Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000005065 mining Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/30—Decision processes by autonomous network management units using voting and bidding
-
- 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 invention provides a block chain packing node consensus promoting method. The block chain packing node consensus electing method comprises the following steps: s1, packing the authority node random number: each node with the packing authority generates a random number; s2, selecting node data: the data of each node is sorted, then a KEY random number is randomly generated, the absolute value of the difference value of the random number of each node and the KEY random number is respectively calculated and sequenced, and the node with the minimum absolute value is selected to obtain the packaging right; s3, generation of node data: and broadcasting and showing the packaging right information obtained by the minimum node in the S2. According to the block chain packing node consensus electing method provided by the invention, information generated by the electing is formed into a database in the electing process, and the reference basis is provided in the voting link of the next link, so that the voting rate is favorably improved, the block can be efficiently and quickly output, and the practicability of the method is further improved.
Description
Technical Field
The invention relates to the field of block chains, in particular to a block chain packing node consensus electing method.
Background
The blockchain is a technical scheme for collectively maintaining a reliable database in a decentralized and distrust-removing mode, and can enable participants to establish trust on a technical level, connect members in a federation ecology and construct a point-to-point value transfer network. The data exchange system comprises a common chain, a alliance chain and a private chain, wherein the common chain is completely decentralized, data on the chain is public and transparent and can not be changed, anyone can read and write data through transaction or mining, the alliance chain refers to a block chain with a plurality of organizations or institutions participating in management together, each organization or institution controls one or more nodes and records transaction data together, and only the organizations or institutions can read, write and send the transaction to the data in the alliance chain.
Each node in the blockchain network is equivalent to each computer or server terminal for storing all block data, and the verification and accounting of the production and transaction of all new blocks are broadcast to the whole network synchronization and are completed by the nodes, wherein the nodes are commonly called miners, and the different calculation power of each miner determines how much accounting right can be allocated to each miner to harvest how much reward.
In the prior art, the process is complicated in the block chain packing node consensus electuary, and in the whole process of carrying out the piece, the piece information can not be recorded integrally, so that in the next piece electuary, the reference of information reference is not existed, the quick and efficient piece electuary can not be realized, and the waste of certain resources is caused due to the excessive unnecessary process.
Therefore, it is desirable to provide a method for block chain packing node consensus promotion to solve the above technical problems.
Disclosure of Invention
The invention provides a block chain packing node consensus electing method, which solves the problems that not only can the block output be realized quickly and efficiently, but also a certain resource is wasted due to excessive unnecessary processes.
In order to solve the above technical problem, the block chain packing node consensus electing method provided by the present invention comprises the following steps:
s1, packing the authority node random number: each node with the packing authority generates a random number;
s2, selecting node data: the data of each node is sorted, then a KEY random number is randomly generated, the absolute value of the difference value of the random number of each node and the KEY random number is respectively calculated and sequenced, and the node with the minimum absolute value is selected to obtain the packaging right;
s3, generation of node data: broadcasting and showing the packaging authority information obtained by the minimum node in the S2;
s4, generation of new blocks: the position of the previous new block is replaced and abolished, and then the new block can be added into the database in S1 again for the next round of promotion;
s5, broadcasting a new block: the related information of the node which obtains the packaging right is disclosed;
s6, synchronizing new blocks: canceling the task of the new block before the new block is selected, and working according to the task distributed by the selected new block;
s7, finishing the referral: the first round of pushing is all over, ready for the next second round of pushing.
Preferably, in S1, the data of each node is collected in order, a collection number associated with the data of each node is registered, and the entire data is uploaded to form a database.
Preferably, the packing authority node random number is used for randomly selecting each node.
Preferably, when the voted node in S2 is voted, if the number of votes obtained is fifty percent of the total number of nodes, the packing right is obtained, and if the number of votes obtained is not fifty percent of the total number of nodes, the packing right cannot be obtained, but the votes can be added to the database in S1 again to perform the next round of referral.
Preferably, the packing authority that cannot be obtained in S2 may be added to the packing authority node random number again, and a next round of referral is performed.
Preferably, the new block is broadcasted in S5 to learn specific information of the new block, and it is known that the learning can be deepened and the learning process can be unclear.
Preferably, the step of synchronizing new blocks in S6 is to discard the rules specified by the new blocks in between, and to implement the rules according to the rules in the newly promoted new blocks.
Preferably, the new block in the step of synchronizing new blocks in S6 may be implemented according to its own rule until the latest new block comes out to replace it, and then its own rule will fail.
Preferably, after the referral is completed in S7, the information of the new block referred to is registered, and the next vote is used as a reference.
Preferably, the new block discarded in S4 can be subjected to the next round of referral, and the random number of the packaging right node in S1 is entered for random selection.
Compared with the related technology, the block chain packing node consensus promoting method provided by the invention has the following beneficial effects:
the invention provides a block chain packing node consensus electing method, which forms information generated by the electing into a database in the electing process to provide reference basis for the next link in the voting link, thereby being beneficial to improving the voting rate, enabling the blocks to be output efficiently and quickly and further improving the practicability of the method;
the information of each node participating in the voting is registered in the voting link, and after the voting is finished, the information participating in the voting is broadcasted and disclosed, so that the fairness and the justice in the voting link are ensured;
when a new block is selected, the previous new block can also be subjected to next referral, and nodes which do not pass voting can be added into the next referral again, so that the participation enthusiasm is improved, and the chance of being more cherished can be increased.
Drawings
Fig. 1 is a flowchart illustrating a block chain packing node consensus promoting method according to the present invention.
Detailed Description
The invention is further described with reference to the following figures and embodiments.
Please refer to fig. 1 in which fig. 1 is a flowchart illustrating a block chain packing node consensus evaluating method according to the present invention. The block chain packing node consensus electing method comprises the following steps:
s1, packing the authority node random number: each node with the packing authority generates a random number;
s2, selecting node data: the data of each node is sorted, then a KEY random number is randomly generated, the absolute value of the difference value of the random number of each node and the KEY random number is respectively calculated and sequenced, and the node with the minimum absolute value is selected to obtain the packaging right;
s3, generation of node data: broadcasting and showing the packaging authority information obtained by the minimum node in the S2;
s4, generation of new blocks: the position of the previous new block is replaced and abolished, and then the new block can be added into the database in S1 again for the next round of promotion;
s5, broadcasting a new block: the related information of the node which obtains the packaging right is disclosed;
s6, synchronizing new blocks: canceling the task of the new block before the new block is selected, and working according to the task distributed by the selected new block;
s7, finishing the referral: finishing the pushing of the first round, and preparing the next second round of pushing;
each node with packing authority generates a random number respectively, so that the probability of each node being selected as a packer is equal, the randomness and fairness of the packer election are guaranteed, meanwhile, digital assets are abandoned on the basis of the original block chain technology, the design is directly carried out on fast data uplink, the packing speed of blocks is greatly improved, and a high concurrency mechanism is realized on performance; the consumption of resources is reduced, including but not limited to: hardware equipment for calculation, storage equipment, network flow and power resources; the realization difficulty is low, the node with the minimum absolute value is obtained through a common algorithm so as to obtain the packing authority, and the entrance threshold in block chain research is reduced;
when the packing node is selected, the verification code is sent to the mobile phone number corresponding to the packing node in a short message mode, and the function of identity verification is achieved.
In the step S1, the data of each node is collected, and the mobile phone number associated with the data of each node is registered, and then the whole data is uploaded to form a database;
the formed database provides reference when the node is selected for voting, shortens the period of referral and creates a quick and efficient block.
And the packing authority node random number is used for randomly selecting each node.
When the selected node is voted in S2, when the number of votes obtained and supported accounts for fifty percent of the total number of nodes, the packing right is obtained, and when the number of votes obtained and supported does not account for fifty percent of the total number of nodes, the packing right cannot be obtained, but the votes can be added to the database in S1 again to perform a next round of referral;
in the voting process, each packing node only has the voting right and cannot interfere with other voting nodes, and after the voting is finished, all the voting nodes have the voting record and perform broadcast publicity, so that the voting is fair and fair;
when the node is exactly fifty percent, it is considered to be passed.
The packaging authority which cannot be obtained in the S2 can be added into the packaging authority node random number again for carrying out the next round of promotion;
nodes which cannot obtain the packing authority can also obtain opportunities in the next promotion, and play a role in encouragement.
In the step S5, the new block is broadcasted to learn the specific information of the new block, and a learning process can be performed if the knowledge is deeper and unclear;
the purpose of broadcasting the new block is to enable other packing nodes to know the information of the pushed new block, thereby not only playing a role of supervision, but also playing a role of learning, and improving the disclosure in the whole pushing process.
The step of synchronizing new blocks in S6 is to discard the rules specified by the new blocks therebetween, and to implement the synchronization according to the rules in the newly promoted new blocks.
The new block in the stage of synchronizing new blocks in S6 may be implemented according to its own rule until the latest new block comes out to replace it, and then its own rule will fail;
the final rule weight, or new block, is decided, and if other packing points are in question, suggestions can be made, but there is no final decision weight.
After the referral is completed in the step S7, registering information of the referred new block, and using the next vote as a reference;
when the voting is carried out next time conveniently, the information of the new block can be known quickly, the voting rate is improved, and the selection can be made quickly.
The new blocks abolished in the step S4 can be used for carrying out next round of referral, and the random number of the packaging authority node in the step S1 is entered for random selection;
the substituted new block can be re-promoted in the next link, so that the whole process is more fair and fair.
The working principle of the block chain packing node consensus promoting method provided by the invention is as follows:
s1, packing the authority node random number: each node with the packing authority generates a random number;
s2, selecting node data: the data of each node is sorted, then a KEY random number is randomly generated, the absolute value of the difference value of the random number of each node and the KEY random number is respectively calculated and sequenced, and the node with the minimum absolute value is selected to obtain the packaging right;
s3, generation of node data: broadcasting and showing the packaging authority information obtained by the minimum node in the S2;
s4, generation of new blocks: the position of the previous new block is replaced and abolished, and then the new block can be added into the database in S1 again for the next round of promotion;
s5, broadcasting a new block: the related information of the node which obtains the packaging right is disclosed;
s6, synchronizing new blocks: canceling the task of the new block before the new block is selected, and working according to the task distributed by the selected new block;
s7, finishing the referral: the first round of pushing is all over, ready for the next second round of pushing.
Compared with the related technology, the block chain packing node consensus promoting method provided by the invention has the following beneficial effects:
in the process of referral, information generated by the referral is formed into a database to provide reference basis for the next link in the voting link, so that the voting rate is improved, and high-efficiency and quick block discharging can be realized, and the practicability of the method is improved;
the information of each node participating in the voting is registered in the voting link, and after the voting is finished, the information participating in the voting is broadcasted and disclosed, so that the fairness and the justice in the voting link are ensured;
when a new block is selected, the previous new block can also be subjected to next referral, and nodes which do not pass voting can be added into the next referral again, so that the participation enthusiasm is improved, and the chance of being more cherished can be increased.
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (10)
1. A block chain packing node consensus electing method is characterized by comprising the following steps:
s1, packing the authority node random number: each node with the packing authority generates a random number;
s2, selecting node data: the data of each node is sorted, then a KEY random number is randomly generated, the absolute value of the difference value of the random number of each node and the KEY random number is respectively calculated and sequenced, and the node with the minimum absolute value is selected to obtain the packaging right;
s3, generation of node data: broadcasting and showing the packaging authority information obtained by the minimum node in the S2;
s4, generation of new blocks: the position of the previous new block is replaced and abolished, and then the new block can be added into the database in S1 again for the next round of promotion;
s5, broadcasting a new block: the related information of the node which obtains the packaging right is disclosed;
s6, synchronizing new blocks: canceling the task of the new block before the new block is selected, and working according to the task distributed by the selected new block;
s7, finishing the referral: the first round of pushing is all over, ready for the next second round of pushing.
2. The blockchain packing node consensus election method according to claim 1, wherein in S1, the data of each node is collected and the collection number associated with the data of each node is registered, and then the entire data is uploaded to form a database.
3. The method of claim 1, wherein the packing authority node random number is used to randomly select each node.
4. The method of claim 1, wherein when voting is performed on the selected node in S2, if the number of votes obtained is fifty percent of the total number of nodes, then the right to pack is obtained, and if the number of votes obtained is not fifty percent of the total number of nodes, then the right to pack is not obtained, but the right to pack is added to the database in S1 again for the next round of referral.
5. The method of claim 1, wherein the packing right that is not obtained in S2 can be added to the random number of the packing right node again for the next round of referral.
6. The method of claim 1, wherein the step of broadcasting the new block in S5 is performed to learn specific information of the new block, so that the learning process can be enhanced and unclear.
7. The method of claim 1, wherein the step of synchronizing new blocks in S6 is performed according to rules in newly promoted new blocks to discard rules defined by new blocks therebetween.
8. The method of claim 1, wherein the new block in the step of synchronizing new blocks in S6 is implemented according to its own rule until the latest new block comes out to replace it, and then its own rule fails.
9. The method of claim 1, wherein after the referral in S7 is completed, a new block obtained by the referral is registered for reference in the next vote.
10. The method of claim 1, wherein the new block discarded in S4 can be used for next round of referral, and the random number of packing right nodes entered in S1 is selected randomly.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110031094.9A CN112838953A (en) | 2021-01-11 | 2021-01-11 | Block chain packing node consensus electing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110031094.9A CN112838953A (en) | 2021-01-11 | 2021-01-11 | Block chain packing node consensus electing method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112838953A true CN112838953A (en) | 2021-05-25 |
Family
ID=75929468
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110031094.9A Pending CN112838953A (en) | 2021-01-11 | 2021-01-11 | Block chain packing node consensus electing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112838953A (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109542883A (en) * | 2018-10-30 | 2019-03-29 | 广州斯拜若科技有限公司 | A kind of information duplicate checking method based on block chain |
| CN110032873A (en) * | 2018-01-11 | 2019-07-19 | 万事达卡国际公司 | Method and system for the public election on the block chain moderately limited |
| CN110288479A (en) * | 2019-06-28 | 2019-09-27 | 深圳市网心科技有限公司 | A kind of the common recognition method and relevant device of block chain data |
| CN110502578A (en) * | 2019-08-16 | 2019-11-26 | 江苏链路区块链技术有限公司 | A kind of common recognition mechanism of rapid data cochain |
| CN110505084A (en) * | 2019-08-01 | 2019-11-26 | 江苏万链区块链技术研究院有限公司 | A kind of block chain packing node common recognition election method |
| CN111597168A (en) * | 2020-05-20 | 2020-08-28 | 北京邮电大学 | Block chain capacity recovery scheme based on integrity value |
| CN111861459A (en) * | 2019-04-28 | 2020-10-30 | 常州一仙智能科技有限公司 | Iota account book optimization system and method based on DPoS consensus algorithm |
| CN112182661A (en) * | 2020-08-31 | 2021-01-05 | 武汉市果壳璐网络科技有限公司 | Block chain consensus method, device, storage medium and equipment |
-
2021
- 2021-01-11 CN CN202110031094.9A patent/CN112838953A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110032873A (en) * | 2018-01-11 | 2019-07-19 | 万事达卡国际公司 | Method and system for the public election on the block chain moderately limited |
| CN109542883A (en) * | 2018-10-30 | 2019-03-29 | 广州斯拜若科技有限公司 | A kind of information duplicate checking method based on block chain |
| CN111861459A (en) * | 2019-04-28 | 2020-10-30 | 常州一仙智能科技有限公司 | Iota account book optimization system and method based on DPoS consensus algorithm |
| CN110288479A (en) * | 2019-06-28 | 2019-09-27 | 深圳市网心科技有限公司 | A kind of the common recognition method and relevant device of block chain data |
| CN110505084A (en) * | 2019-08-01 | 2019-11-26 | 江苏万链区块链技术研究院有限公司 | A kind of block chain packing node common recognition election method |
| CN110502578A (en) * | 2019-08-16 | 2019-11-26 | 江苏链路区块链技术有限公司 | A kind of common recognition mechanism of rapid data cochain |
| CN111597168A (en) * | 2020-05-20 | 2020-08-28 | 北京邮电大学 | Block chain capacity recovery scheme based on integrity value |
| CN112182661A (en) * | 2020-08-31 | 2021-01-05 | 武汉市果壳璐网络科技有限公司 | Block chain consensus method, device, storage medium and equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109872152B (en) | Block chain consensus method based on share authorization certification mechanism and related equipment | |
| Cutts et al. | Brexit, the 2019 general election and the realignment of British politics | |
| CN109951474B (en) | Method for realizing block chain common identification block | |
| CN111090892B (en) | Block chain consensus method and device based on VRF and threshold signature | |
| CN107294727B (en) | Electronic voting method, terminal equipment and block chain network | |
| US10965466B2 (en) | Estimable proof-of-work for blockchain | |
| EP4209980A1 (en) | Computer-implemented system and method for managing a large distributed memory pool in a blockchain network | |
| CN110611701B (en) | Parameter configuration and transaction processing method based on block chain | |
| CN108711212B (en) | Voting certificate storage method, device and system | |
| CN112104482B (en) | Consensus method based on parallel voting | |
| CN109819022A (en) | A kind of block chain common recognition method based on credit appraisal | |
| CN111010278B (en) | High-fault-tolerance layering consensus method based on DPoS | |
| KR102187294B1 (en) | System and method for providing secret electronic voting service based on blockchain | |
| CN111988137B (en) | DPoS (dual port service) consensus method and system based on threshold signature and fair reward | |
| Braverman et al. | Mafia: A theoretical study of players and coalitions in a partial information environment | |
| CN111047316A (en) | Tamper-resistant intelligent block chain system and implementation method | |
| CN114362987B (en) | Distributed voting system and method based on block chain and intelligent contract | |
| Tan et al. | DPoSB: Delegated Proof of Stake with node's behavior and Borda Count | |
| US20220239668A1 (en) | Blockchain-based message processing method and apparatus, device, and storage medium | |
| CN104915431B (en) | A kind of date storage method and system | |
| CN110505084B (en) | Block chain packing node consensus electing method | |
| CN112838953A (en) | Block chain packing node consensus electing method | |
| CN112860807B (en) | Fault-tolerant consensus method suitable for wireless block chain network | |
| CN116132058A (en) | Block chain consensus method, apparatus, device and computer readable storage medium | |
| CN115720227A (en) | Election method and device for consensus nodes of block chain and electronic 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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210525 |
|
| RJ01 | Rejection of invention patent application after publication |