CN112118138A - System and method for implementing block chain consensus mechanism - Google Patents
System and method for implementing block chain consensus mechanism Download PDFInfo
- Publication number
- CN112118138A CN112118138A CN202010986844.3A CN202010986844A CN112118138A CN 112118138 A CN112118138 A CN 112118138A CN 202010986844 A CN202010986844 A CN 202010986844A CN 112118138 A CN112118138 A CN 112118138A
- Authority
- CN
- China
- Prior art keywords
- node
- block
- credit
- nodes
- weight
- 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
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/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- 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
-
- 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Computer Security & Cryptography (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Accounting & Taxation (AREA)
- General Engineering & Computer Science (AREA)
- Finance (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Economics (AREA)
- Computer Hardware Design (AREA)
- Bioethics (AREA)
- Data Mining & Analysis (AREA)
- General Health & Medical Sciences (AREA)
- Software Systems (AREA)
- Computing Systems (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- General Business, Economics & Management (AREA)
- Power Engineering (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to a consensus mechanism based on pagerank credit ranking, which comprises a block link point credit voting module, a block link point credit ranking module, a block link point weight determining module and a block node generating determining module. The block chain node credit voting module is used for participating in credit voting of the nodes generating the blocks; the block chain node credit ordering module is used for carrying out credit ordering on nodes participating in generating the block so as to determine subsequent weight; the weight module of the node of the block chain is used for determining the weight of the generated block according to the previous sorting result; the determine generated block node module is configured to determine a node of a final generated block according to weights of previous generated blocks. The invention can effectively solve the problem that the prior block chain consensus algorithm needs large-scale calculation power or money in the face of Byzantine node problem.
Description
Technical Field
The invention belongs to the technical field of block chains, and particularly relates to a block chain consensus mechanism implementation system and a block chain consensus mechanism implementation method.
Background
The blockchain is a decentralized, distributed ledger system that can be used to register and issue digitized assets, title certificates, credits, etc., and to transfer, pay for, and transact in a point-to-point fashion. Compared with the traditional centralized ledger system, the blockchain system has the advantages of complete disclosure, no tampering, multiple payment prevention and the like, and does not depend on any trusted third party.
Due to the high network latency in a peer-to-peer network, the transaction order observed by each node may not be completely consistent. Therefore, the blockchain system needs to design a mechanism to know the sequence of the transactions that occur in almost time. This algorithm of agreeing on the precedence order of transactions within a time window is called the "consensus mechanism".
Currently there are several major types of consensus mechanisms: pow, Pos, DPos, Pool, PBFT, wherein,
1. the Pow workload proves that the well-known ore excavation is carried out, a random number meeting the rule is calculated through AND-OR operation, the current accounting right is obtained, data needing to be recorded in the current round are sent out, and the data are stored together after verification of other nodes in the whole network. It has the advantages that: the centralization is completely removed, and the nodes freely enter and exit; the disadvantages are that: at present, bitcoin attracts most of the computing power of the world, and other block chain applications using a Pow consensus mechanism hardly obtain the same computing power to guarantee the safety of the bitcoin; a great deal of resource waste is caused by ore excavation; the agreed cycle time is long and not suitable for commercial applications.
2. Pos equity proves that Pow is an upgrading consensus mechanism; according to the proportion and time of each node in the token; the ore digging difficulty is reduced in equal proportion, so that the speed of finding the random number is increased. The advantages are that: the time for consensus achievement is shortened to a certain extent. The disadvantages are that: mining is still required and does not address the pain points of commercial application per se.
3. The DPos stock certification mechanism is similar to the voting of board of directors, the coin holders put out a certain number of nodes, and the agents verify and bill. The advantages are that: the number of the nodes participating in verification and accounting is greatly reduced, and second-level consensus verification can be achieved. The disadvantages are that: the entire consensus mechanism is also token dependent and many commercial applications do not require the presence of a token.
4. The Pool verification Pool is based on the traditional distributed consistency technology and a data verification mechanism; is a consensus mechanism used in a wide range of industry chains at present. The advantages are that: the token can work without token, and the second-level consensus verification is realized on the basis of a mature distributed consistency algorithm (Pasox and Raft); the disadvantages are that: the degree of decentralization was not as good as bicoin; the method is more suitable for a multi-center business model with multi-party participation.
Disclosure of Invention
The invention provides a consensus mechanism implementation system based on pagerank credit ranking, and aims to solve the problem that the existing block chain consensus algorithm needs large-scale calculation power or money in the face of Byzantine node.
In one embodiment of the present invention, a system for implementing a block chain consensus mechanism includes a block chain node credit voting module, configured to participate in credit voting for nodes that generate a block; a block link point credit ordering module for credit ordering nodes participating in generating a block so as to determine subsequent weights; a block chain node weight determining module, which is used for determining the weight of the generated block according to the credit ordering result; and
and the generated block node determining module is used for determining the node of the final generated block according to the weight of the previous generated block.
The block chain link point credit voting module only generates a block in an early stage and effective nodes have the right to participate in voting when in credit voting, and the credit voting can be only cast to the nodes which generate the block in the early stage and are effective, and simultaneously each node can cast a plurality of different votes. The block-setting chain link point credit sorting module sorts the voting nodes by using a pagerank algorithm according to credit voting results.
Compared with the prior art, the invention has the beneficial effects that:
the consensus mechanism based on the pagerank credit ranking is provided, the nodes are ranked according to the credit ranking by using a pagerank algorithm, the ranking only selects the nodes which historically generate the effective blocks to ensure the safety of the nodes, and the node weights which do not generate the effective blocks come from the guaranteed nodes to ensure the fairness of the nodes.
The block chain consensus algorithm solves the problem that the existing block chain consensus algorithm needs large-scale calculation force (such as pow consensus algorithm) or money (such as pos consensus algorithm) in the face of Byzantine node problem.
The whole system provided by the invention fully considers the characteristics of the block chain service, and can shorten the block generation time under various service scenes.
Drawings
The above and other objects, features and advantages of exemplary embodiments of the present invention will become readily apparent from the following detailed description read in conjunction with the accompanying drawings. Several embodiments of the invention are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which:
fig. 1 is an exemplary graph of a PageRank algorithm according to one embodiment of the invention.
FIG. 2 is an exemplary diagram of a credit vote in accordance with one embodiment of the present invention.
Fig. 3 is a system framework diagram of a consensus mechanism according to one of the embodiments of the invention.
Detailed Description
According to one or more embodiments, a consensus mechanism based on pagerank credit ranking, as shown in fig. 3, includes a block link point credit voting module, a block link point credit ranking module, a determine block link point weight module, and a determine generate block node module.
The block chain node credit voting module is used for participating in credit voting of the nodes generating the blocks; the block chain node credit ordering module is used for carrying out credit ordering on nodes participating in generating the block so as to determine subsequent weight; the weight module of the node of the block chain is used for determining the weight of the generated block according to the previous sorting result; the determine generated block node module is configured to determine a node of a final generated block according to weights of previous generated blocks.
The block chain node credit voting module aims at the nodes participating in block generation, wherein only the nodes which generate blocks in the early stage and are effective have the right to participate in voting, credit voting can be cast only to the nodes which generate the blocks in the early stage and are effective, and each node can cast a plurality of different votes. As shown in fig. 2.
The block chain link point credit sorting module sorts according to credit votes of the block chain link point credit voting module, and sorts the voting nodes by using a pagerank algorithm.
The present embodiment relates to the PageRank algorithm, which is a method for evaluating the ranking of web pages. The basic principle is to evaluate the page rank by using the link-out situation of the link contained in the web page to other pages and the link-in situation of the link from other pages to the page.
When ranking web page importance using the pagerank algorithm, two preconditions are generally assumed:
1. the quantity assumes: assuming that there is a web page, if there are a large number of links connected to it, it is very important to indicate this page; a node in this context, given the large number of other nodes to which it is connected, indicates that the node is very trusted.
2. The quality assumption is that: in the internet, the content quality of each webpage is uneven, and if a high-quality page is connected with the webpage, the weight transmitted to the webpage is high; similarly, if a node with high trust level trusts the node, the weight transferred to the node is high.
Based on the two assumptions, when the algorithm evaluates the page rank based on the following formula, the weight of each page is given the same value, and then the score of each page is updated through continuous recursive iterative calculation until the page score is stable.
Wherein L (v) represents the out-chain quantity of the web page v, PR (v) represents the PageRank value of the web page v, and BuRepresenting an in-chain set of web pages u. As can be seen from the formula, the PageRank value of each page is obtained by adding the PageRank values of all the in-chain web pages of the page.
The PageRank algorithm specifies that one page cannot vote twice for the other pages, so page B can only vote half of page a, i.e., page B can only assign page a half of its PR. Similarly page D can only be assigned to page a page by one third of its PR.
Then, the calculation formula of PR value of node D in fig. 1 is as follows:
however, in the real internet, there are also cases where many pages are not connected to any other page, that is, the number of outgoing links of this page is 0 (e.g., node C in fig. 1), and such a page is called an isolated web page. Therefore, the original PageRank calculation formula can be modified, and a damping coefficient (damping factor) is added on the basis of the original simple formula, and the value of the damping factor is generally 0.85. Which represents the probability that a user will continue to browse backwards from a page after browsing that page at any time. When the damping coefficient d is equal to 0.15, it indicates the probability that the user will not visit any other links on the page and will turn to a new URL randomly.
The present embodiment relates to the determining block link point weights module generating weights based on a block link point credit voting module and a block link point credit ranking module. Aiming at the nodes of the non-generated block, searching a node of the generated block for guarantee, giving the 10% credit sequencing result to the nodes of the non-generated block, if the node is bad, eliminating the node in the next round of voting, and halving the guaranteed node credit; and determining the final weight according to the guarantee rule and the sorting result of the block link point credit sorting module, and broadcasting.
The embodiment relates to a module for determining and generating block nodes, which divides a search space of a SHA256 mathematical problem to computing nodes according to weights determined in a module for determining the weight of a link point of a block, and enables each node to compute and verify whether the search space meets the hash problem until a certain node successfully solves the hash problem in a verification mode, and at the moment, the node obtains the accounting weight of a block chain and obtains corresponding rewards. And if the node for generating the block is finally determined not to have a block within the specified time, removing the node, and executing the steps of the module again.
The embodiment relates to a piece-wise rotation model, which is to divide the search space of a hash problem, and each node is ranked according to the credit degree of the node to obtain the search space which needs to be verified. The rotation means that after each node calculates and verifies the search space acquired by itself, if the hash problem is still not solved, the node can still acquire the search space in a certain range needing verification again. And continuously acquiring the search space needing to be verified until the hash problem is solved.
The specific steps involved in the slicing round-robin model of the present embodiment are to assume m for each round to be verifiednonceOne standard range of the search space is range, R is the number of rounds, the total number of nodes is n, and the credit rating of the node i is ranked as mi(miThe smaller the value, the lower the rank), the rank is miM of the first round corresponding to the node(s)nonceThe range size of the search space of (a) is:
in the embodiment, the credit ranking order divides the search space according to the proportion, and the ranking is miFirst round m corresponding to the node(s)nonceThe search space of (a) is:
if a node has already verified m allocatednonceAfter searching, m meeting the hash problem requirement is not foundnonceValue m, which the node first sees if it has received other nodes from the network to resolve the issuenonceThe value is obtained. If not, it can obtain the range of search space of R round (next round) by calculation as:
it is easy to find that the embodiment of the present invention effectively solves the problem that the existing block chain consensus algorithm needs a large-scale calculation force (such as a pow consensus algorithm) or a monetary problem (such as a pos consensus algorithm) in the face of the byzantine node problem. And (3) carrying out credit degree sequencing on the nodes by using a pagerank algorithm, wherein the sequencing only selects the nodes which have historically generated the effective blocks to ensure the safety of the nodes, and the weight of the nodes which have not historically generated the effective blocks comes from the guaranteed nodes to ensure the fairness of the nodes.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may also be an electric, mechanical or other form of connection.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention essentially or partially contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
While the invention has been described with reference to specific embodiments, the invention is not limited thereto, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. A system for implementing a block chain consensus mechanism includes
The block chain link point credit voting module is used for participating in credit voting of the nodes generating the blocks;
a block link point credit ordering module for credit ordering nodes participating in generating a block so as to determine subsequent weights;
a block chain node weight determining module, which is used for determining the weight of the generated block according to the credit ordering result; and
and the generated block node determining module is used for determining the node of the final generated block according to the weight of the previous generated block.
2. The system of claim 1, wherein the block chain node credit voting module only generates a block and valid nodes have right to participate in the voting when the credit votes, and the credit votes can be cast only to the generated block and valid nodes, and each node can cast a plurality of different votes.
3. The system of claim 2 wherein the block-link credit ranking module ranks the voting nodes according to the credit voting results using a pagerank algorithm.
4. The system of claim 3, wherein the determine block link point weight module searches for a node of the generated block to protect against nodes of the generated block and assigns a 10% credit ranking to the nodes of the generated block,
if the node is badly selected, the node is removed in the next voting, and the credit of the guaranteed node is halved;
and determining the final weight according to the guarantee rule and the sequencing result, and broadcasting.
5. The system of claim 4, wherein the deterministic block-generating node module partitions the search space of the SHA256 mathematical problem to the computing nodes according to the deterministic weight, and allows each node to compute and verify whether the search space satisfies the hash problem until a node successfully solves the hash problem by verification, and at this time, the node obtains the billing weight of the block chain and obtains the corresponding reward,
and if the node which finally determines the generated block does not have the block within the specified time and then rejects the node, re-executing the function of the module for determining the node of the generated block.
6. The system of claim 5, wherein the search space of the hash problem is divided by using a piece-wise rotation model, each node obtains the search space which needs to be verified according to the credit ranking of the node,
the rotation means that after each node calculates and verifies the search space acquired by the node, if the hash problem is not solved, the node acquires the search space in a certain range required to be verified again,
and continuously acquiring the search space needing to be verified until the hash problem is solved.
7. The system according to claim 6, wherein the slice rotation model comprises the steps of,
assume m for each round to be verifiednonceOne standard range of the search space is range, R is the number of rounds, the total number of nodes is n, and the credit rating of the node i is ranked as mi，miThe smaller the value, the lower the rank, the rank is miM of the first round corresponding to the node(s)nonceThe range size of the search space of (a) is:
the credit ranking order divides the search space according to the proportion, and the ranking is miFirst round m corresponding to the node(s)nonceThe search space of (a) is:
if a node has already verified m allocatednonceAfter searching, m meeting the hash problem requirement is not foundnonceValue, m, which the node first looks at if it has received from other nodes of the network to resolve the issuenonceThe value of the one or more of,
if not, the node obtains the range of the search space of the next round by calculation as follows:
8. a method for implementing a block chain consensus mechanism,
credit voting is carried out on the nodes of the block chain, and the nodes participating in generating the blocks carry out credit voting;
block chain node credit ordering, wherein the nodes participating in generating the block are subjected to credit ordering so as to determine subsequent weight;
determining the weight of the chain nodes of the block, and determining the weight of the generated block according to the credit sorting result; and
and determining the node of the generated block, and determining the node of the final generated block according to the weight of the previous generated block.
9. A block chain consensus mechanism management platform is characterized in that the platform comprises a server, wherein the server is provided with a memory; and
a processor coupled to the memory, the processor configured to execute instructions stored in the memory, the processor to:
credit voting is carried out on the nodes of the block chain, and the nodes participating in generating the blocks carry out credit voting;
block chain node credit ordering, wherein the nodes participating in generating the block are subjected to credit ordering so as to determine subsequent weight;
determining the weight of the chain nodes of the block, and determining the weight of the generated block according to the credit sorting result; and
and determining the node of the generated block, and determining the node of the final generated block according to the weight of the previous generated block.
10. A storage medium on which a computer program is stored which, when executed by a processor, carries out the method of claim 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010986844.3A CN112118138B (en) | 2020-09-18 | 2020-09-18 | System and method for realizing block chain consensus mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010986844.3A CN112118138B (en) | 2020-09-18 | 2020-09-18 | System and method for realizing block chain consensus mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112118138A true CN112118138A (en) | 2020-12-22 |
| CN112118138B CN112118138B (en) | 2023-06-23 |
Family
ID=73800661
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010986844.3A Active CN112118138B (en) | 2020-09-18 | 2020-09-18 | System and method for realizing block chain consensus mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112118138B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113051928A (en) * | 2021-03-17 | 2021-06-29 | 卓尔智联(武汉)研究院有限公司 | Detection comment method and device based on block chain and electronic equipment |
| CN113452801A (en) * | 2021-09-01 | 2021-09-28 | 南京信息工程大学 | Trusted node selection optimization method for block transmission in block chain network |
| CN113674072A (en) * | 2021-08-05 | 2021-11-19 | 郑州铁路职业技术学院 | Enterprise financial management risk identification method based on financial big data |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108460158A (en) * | 2018-03-28 | 2018-08-28 | 天津大学 | Differentiation Web page sequencing method based on PageRank |
| CN109819022A (en) * | 2019-01-11 | 2019-05-28 | 华侨大学 | A kind of block chain common recognition method based on credit appraisal |
| CN110930158A (en) * | 2019-11-19 | 2020-03-27 | 南京邮电大学 | Block chain DPoS common recognition method based on reward and punishment mechanism |
| CN111131181A (en) * | 2019-12-05 | 2020-05-08 | 重庆邮电大学 | Reputation mechanism and DPBFT algorithm-based block chain dynamic DPoS consensus method |
| CN111432014A (en) * | 2020-03-30 | 2020-07-17 | 上海玳鸽信息技术有限公司 | Method and device for selecting main node in block chain consensus algorithm |
-
2020
- 2020-09-18 CN CN202010986844.3A patent/CN112118138B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108460158A (en) * | 2018-03-28 | 2018-08-28 | 天津大学 | Differentiation Web page sequencing method based on PageRank |
| CN109819022A (en) * | 2019-01-11 | 2019-05-28 | 华侨大学 | A kind of block chain common recognition method based on credit appraisal |
| CN110930158A (en) * | 2019-11-19 | 2020-03-27 | 南京邮电大学 | Block chain DPoS common recognition method based on reward and punishment mechanism |
| CN111131181A (en) * | 2019-12-05 | 2020-05-08 | 重庆邮电大学 | Reputation mechanism and DPBFT algorithm-based block chain dynamic DPoS consensus method |
| CN111432014A (en) * | 2020-03-30 | 2020-07-17 | 上海玳鸽信息技术有限公司 | Method and device for selecting main node in block chain consensus algorithm |
Non-Patent Citations (1)
| Title |
|---|
| 王缵等: "基于信用模型的工作量证明算法", 《通信学报》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113051928A (en) * | 2021-03-17 | 2021-06-29 | 卓尔智联(武汉)研究院有限公司 | Detection comment method and device based on block chain and electronic equipment |
| CN113051928B (en) * | 2021-03-17 | 2023-08-01 | 卓尔智联(武汉)研究院有限公司 | Block chain-based comment detection method and device and electronic equipment |
| CN113674072A (en) * | 2021-08-05 | 2021-11-19 | 郑州铁路职业技术学院 | Enterprise financial management risk identification method based on financial big data |
| CN113674072B (en) * | 2021-08-05 | 2023-05-16 | 郑州铁路职业技术学院 | Enterprise financial management risk identification method based on financial big data |
| CN113452801A (en) * | 2021-09-01 | 2021-09-28 | 南京信息工程大学 | Trusted node selection optimization method for block transmission in block chain network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112118138B (en) | 2023-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Hazari et al. | A parallel proof of work to improve transaction speed and scalability in blockchain systems | |
| Di Francesco Maesa et al. | Data-driven analysis of bitcoin properties: exploiting the users graph | |
| CN110580653B (en) | Block chain consensus mechanism based on transaction | |
| CN108200203B (en) | Block chain system based on double-layer network | |
| CN112118138A (en) | System and method for implementing block chain consensus mechanism | |
| US11636450B2 (en) | Blockchain system to which proof-of-transaction consensus algorithm is applied, and method therefor | |
| Shibata | Proof-of-search: combining blockchain consensus formation with solving optimization problems | |
| Bugday et al. | Creating consensus group using online learning based reputation in blockchain networks | |
| Liu et al. | A graph learning based approach for identity inference in dapp platform blockchain | |
| Banerjee et al. | Maximizing welfare in social networks under a utility driven influence diffusion model | |
| CN111090891B (en) | Notary selection method and notary selection system based on block chain | |
| CN114372589A (en) | Federated learning method and related device | |
| CN116366669A (en) | Consensus method based on reputation value weight balance suitable for crowdsourcing system | |
| Li et al. | Game theory based compatible incentive mechanism design for non-cryptocurrency blockchain systems | |
| Sun et al. | Games of miners | |
| Hsueh et al. | EPoW: Solving blockchain problems economically | |
| Huang et al. | Incentive assignment in hybrid consensus blockchain systems in pervasive edge environments | |
| CN112116473A (en) | Cross-chain notary mechanism evaluation system and platform | |
| Li et al. | Resource allocation for mobile blockchain: A hierarchical combinatorial auction approach | |
| CN113435949B (en) | Decentralized federal machine learning method, system and storage medium based on intelligent contracts | |
| CN111260468A (en) | Block chain based data operation method and related equipment and storage medium | |
| Vidyakeerthi et al. | PhishChain: A Decentralized and Transparent System to Blacklist Phishing URLs | |
| Chishti et al. | Increasing TPS rate of state‐based blockchains by parallel mining | |
| Yu et al. | Byzantine Fault Tolerant Consensus Algorithm Based on Credit Model and Verifiable Random Function | |
| Liu et al. | User cooperation trust model and its application in network security management |
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 |