CN110188137B - Integrity-based block chain consensus mechanism - Google Patents
Integrity-based block chain consensus mechanism Download PDFInfo
- Publication number
- CN110188137B CN110188137B CN201910315876.8A CN201910315876A CN110188137B CN 110188137 B CN110188137 B CN 110188137B CN 201910315876 A CN201910315876 A CN 201910315876A CN 110188137 B CN110188137 B CN 110188137B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- deposit
- consensus
- module
- 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.)
- Active
Links
Images
Classifications
-
- 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
- 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
- G06Q30/00—Commerce
- G06Q30/018—Certifying business or products
- G06Q30/0185—Product, service or business identity fraud
-
- 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
-
- 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)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Finance (AREA)
- Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- Databases & Information Systems (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Technology Law (AREA)
- Storage Device Security (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a block chain consensus mechanism based on integrity. The invention comprises five modules, namely a credit value checking module, a dynamic deposit calculation module, a deposit payment checking module, a reward and sanction checking module and an exit set and deposit redemption checking module; when a node wants to join a consensus set, firstly, a dynamic deposit calculation module calculates a deposit to be paid by the node through the verification of an integrity value verification module, and a deposit payment verification module supervises the payment of the deposit; in the working process of the node, the behavior of the node is supervised and controlled by a reward and sanction checking module, and the module can reward or sanction the behavior of the node; when the node withdraws from the consensus set voluntarily, the withdrawal set and the guarantee fund redemption check module issues the remuneration and the guarantee fund of the node. The invention improves the defect of high power resource consumption of the original mechanism, maximizes the work done by people, avoids waste to the maximum extent and greatly improves the safety.
Description
Technical Field
The invention relates to the technical field of block chains, in particular to an honest-based block chain consensus mechanism.
Background
The block chain is a decentralized distributed account book system, and the account book is formed by linking blocks containing a plurality of transaction records through hash values. Accounts maintained by each node of the distributed system need to be guaranteed to be consistent, so that a rule is needed to realize state replication among the nodes in the system. The state copy is realized by executing the same command sequence on the basis of the same state, and the consistency of data is ensured. The command sequence in the block chain is the transaction sequence, and the face transaction sequence exists in the block, so that each node in the block chain realizes state copy, i.e. all nodes achieve consensus on the next block added in the chain, and the algorithm for achieving consensus on the blocks is called a block chain consensus mechanism.
The consensus mechanisms that are widely adopted at present include workload Proof (POW), equity Proof (POS), delegation equity proof (DPOS), proof of importance (POI), Practical Byzantine Fault Tolerance (PBFT), and authorized byzantine fault tolerance (DBFT), among others.
Wherein, 1, POW (proof of work) proves that the accounting right is competed by solving the problem of mathematics. The stronger the computing power of the node is, the more possible the mathematical problem is solved firstly, so as to obtain the accounting right; 2. P0S (ProofStake), right-of-interest proof, the node through rights-of-interest competition accounting rights held by the rights-of-interest person, right-of-interest is embodied as the share of the held token, the more tokens held, the more likely it is to obtain accounting rights; 3. DPOS (delayed Proof of stamp), trusting the rights and interests, the rights and interests use the way of voting to select a part of nodes as the candidate bookkeeper, the candidate bookkeeper nodes are booked in turn; 4. P0I (Proofof opportunity) Importance proves that the Importance of the node is calculated according to the rights and interests held by the node, the number of transactions and the amount of money, and the higher the Importance is, the more possible the accounting right is obtained; 5. PBFT (practical Byzantine Fault tolerance), adopting permission voting and few obedients to elect a leader for bookkeeping, and successfully bookkeeping when the number of nodes is less than (N-1)/3 in a reverse mode; 6. DBFT (deleted Byzantine Fault Tolerance), authorizing Byzantine Fault tolerance, voting for authorized users to select one node as candidate bookkeeping person, and realizing consensus among the candidate bookkeeping persons through a practical Byzantine Fault tolerance algorithm.
However, the above algorithms have the disadvantages that POW consumes a large amount of computing resources, which is a significant disadvantage; P0I considers the importance of the account while considering the rights, but the importance is only reflected by the use of the system rather than the contribution, PBFT is not suitable for the situation that nodes join and exit dynamically, so the applicability is limited, DPOS and DBFT based on delegation or authorization are established on the basis of the active participation of a voter, and the precondition is often not satisfied.
In the process of achieving consensus, the effort is not to have a node with great calculation power, because the node can be faked; nor are the winners who already own many properties; but are honest nodes that are active in the system, trying to contribute to the blockchain, because of their help, to achieve a good consensus. The existing consensus mechanism does not provide a good accounting mechanism, and can not carry out screening, excitation and punishment on nodes.
Disclosure of Invention
The invention aims to provide a block chain consensus mechanism for node fair competition.
The invention comprises five modules, namely a credit value checking module, a dynamic deposit calculation module, a deposit payment checking module, a reward and sanction checking module and an exit set and deposit redemption checking module;
when the node wants to join the consensus set, firstly, the dynamic deposit calculation module calculates the deposit to be paid by the node through the verification of the integrity value verification module, and the deposit payment verification module supervises the payment of the deposit. During the operation of the node, the behavior of the node is supervised and controlled by a reward and sanction checking module, and the module can reward or sanction the behavior of the node. When the node withdraws from the consensus set voluntarily, the withdrawal set and the guarantee fund redemption check module issues the remuneration and the guarantee fund of the node.
A integrity value checking module;
if one node wants to join the consensus set and becomes one of the consensus nodes, the other nodes are required to carry out integrity value check, if the integrity value of the node is found to be lower than the requirement of the consensus threshold, the request of the node is ignored and discarded, and if the integrity value of the node is higher than the requirement of the consensus threshold, the node is added into the consensus set.
A dynamic deposit calculation module;
when the node joins the consensus set, the node also needs to submit the dynamic deposit to restrict illegal operation in the consensus set. Because one attack on the block chain, which is a rogue node, is often time-consuming and beneficial. If less benefit is obtained than the benefit of accepting the penalty loss, then no one can initiate an attack on the blockchain. The dynamic security fund is set, so that the malicious nodes with low cost can be prevented to a certain extent.
The dynamic guarantee fund is dynamic, the number of the dynamic guarantee fund is not separated from the number of the nodes participating in the consensus at present, and the size of the current dynamic guarantee fund is calculated by adopting a linear algorithm based on the number of the participating nodes, so that the size of the dynamic guarantee fund and the number of the nodes participating in the consensus at present meet a basic linear increasing relationship.
Dynamic assurance gold Deposit formula:
wherein, maxDeposit is the maximum guarantee, maxSize is the maximum number of participating nodes, and size represents the current number of participating nodes;
the relative in and out operation of any node to the consensus set is strictly supervised by other nodes.
The deposit payment verification module:
the receiver of the deposit is that the deposit in the platform receives the intelligent contract script, and other nodes not only need to carry out deposit payment verification on the request node, but also need to carry out verification on the intelligent contract script so as to ensure the high safety of the link. When the payment verification of the deposit and the verification of the intelligent contract script are qualified, the node normally works subsequently; otherwise, the node can not work normally until the node submits the intelligent contract script and the guarantee fund which meet the requirements;
the reward and sanction checking module: one node a reports to another node B and node a needs to provide cryptographic evidence or other verification consensus for the nodes, otherwise the reporting of node a will not be accepted by all nodes until node a again provides cryptographic evidence or other verification consensus for the nodes.
Firstly, discovering that honest nodes serving as the malignant nodes can be rewarded by the intelligent contract script; if the report is not established, the node A is judged to be the malignant node and is exercised with penalty sanction.
Description of the drawings: the cryptographic evidence is a digital signature of the node B and is used for confirming the identity of the rogue node and tracking and sanctioning the rogue node. Digital signature is a method for authenticating digital information by using the technology in the field of public key encryption, and can be used for verifying the identity of a signer, so that when A provides the digital signature of node B, it can be confirmed that node B is the reported person.
When each time round rolls out the block, the node checks other nodes, and when the node checking result is found to be inconsistent with the result displayed by the node, the node is submitted to report. When the node A reports the node B, the rest nodes can redo the work of the node B and compare with the submitted result, and the verification consensus is the result.
If the results are the same, the report of the node A fails, the node A is judged as a malicious node, and the node A is sanctioned; if the result is different, the node B is judged as a malignant node, and sanction is carried out on the node B. The nodes that work seriously and the nodes that submit the correct reports are honest nodes.
The penalty sanctions include in detail: 1. the node does not produce blocks in the self block producing time period, deducts a certain integrity value and degrades from the consensus node to a common node; 2. the ordinary node broadcasts the block arbitrarily, deducts the integrity value and discards the broadcasted block; 3. packing the data in the non-data pool into a block, and degrading the data into a common node without receiving a guarantee fee; 4. broadcasting a plurality of blocks in the self block-out time period, and adding the block-out node into an integrity blacklist without receiving a guarantee fee; 5. packing the honeysuckle transaction into a block, adding the non-payment guarantee fee and the block-out node into an integrity blacklist; 6. and the node tries to branch the block chain, attacks the block chain, and adds the out-block node into the integrity blacklist without receiving the guarantee fund.
The double-flower transaction refers to the condition that a digital asset is reused, and as a non-third-party platform, the double-flower transaction needs to be ensured not to occur.
In a punishment mechanism, the first three nodes do not belong to serious violation, the nodes are violation nodes, and punishment is not too heavy; the last three are serious violations, and these nodes are considered as bad nodes and will be subjected to severe sanctions.
The content of sanctions comprises a common identification set and a deduction guarantee fund, and information is listed in a blacklist and cannot be added into the common identification set again.
Exit aggregate and margin redemption check module: to prevent the occurrence of a wanting situation, strict checks are required to check the node out of the consensus set and redeem the deposit. Strict checking refers to the checking by the system and other nodes of all the efforts submitted by the node. And when the node voluntarily exits the set, recording the integrity value of the node, calculating the reward and returning the guarantee fund.
The invention has the following beneficial effects:
PoH, a brand-new consensus mechanism is provided, the defect of high power resource consumption of the original mechanism is improved, the work done by people is improved to the maximum, the waste is avoided to the maximum extent, and the number of output blocks is greatly increased in the same time; the safety verification concept of the nodes is put forward for the first time, and the safety is greatly improved. The purpose of recording and storing information as a block is achieved, so that the function of the block chain is more definite and practical.
Drawings
FIG. 1 is a schematic view of the present invention.
Detailed Description
In view of the defects in the prior art, aiming at the situation that the existing consensus mechanism does not consider the differentiation, the reward and the punishment of the nodes, the invention provides a credit-based blockchain consensus mechanism (Proof of honocity, POH) which enables the nodes to compete for the accounting right through the credit value of the nodes and restricts and manages the behavior of the nodes in work.
As shown in the table 1 below, the following examples,
TABLE 1
Claims (1)
1. An integrity-based blockchain consensus system, comprising:
the system comprises five modules, namely an integrity value checking module, a dynamic deposit calculation module, a deposit payment checking module, a reward and sanction checking module and an exit set and deposit redemption checking module; when a node wants to join a consensus set, firstly, a dynamic deposit calculation module calculates a deposit to be paid by the node through the verification of an integrity value verification module, and a deposit payment verification module supervises the payment of the deposit; in the working process of the node, the behavior of the node is supervised and controlled by a reward and sanction checking module, and the module can reward or sanction the behavior of the node; when the node withdraws from the consensus set voluntarily, the withdrawal set and the guarantee fund redemption check module issues the remuneration and the guarantee fund of the node;
the integrity value checking module is specifically as follows:
if one node wants to join the consensus set and becomes one of the consensus nodes, the integrity value of other nodes is required to be checked, if the integrity value is found to be lower than the requirement of the consensus threshold, the request of the node is ignored and discarded, and if the integrity value is higher than the requirement of the consensus threshold, the node is added into the consensus set;
the dynamic deposit calculation module specifically comprises the following components:
when the node is added into the consensus set, the node also needs to submit dynamic guarantee funds to restrict illegal operation of the node in the consensus set; the dynamic security fund is set to prevent the malicious nodes with low cost; the dynamic security fund is dynamic, the number of the dynamic security fund is not different from the number of the nodes participating in consensus at present, and the size of the dynamic security fund is calculated by adopting a linear algorithm based on the number of the participating nodes, so that the size of the dynamic security fund and the number of the nodes participating in consensus at present meet a relationship of basic linear increase;
dynamic assurance gold Deposit formula:
wherein, maxDeposit is the maximum guarantee, maxSize is the maximum number of participating nodes, and size represents the current number of participating nodes;
the related access operation of any node to the consensus set is strictly supervised by other nodes;
the module for payment and verification of the deposit is as follows:
the receiver of the deposit is that the deposit in the platform receives the intelligent contract script, and other nodes not only need to carry out deposit payment verification on the request node, but also need to carry out verification on the intelligent contract script so as to ensure the high safety of the link; when the payment verification of the deposit and the verification of the intelligent contract script are qualified, the node normally works subsequently; otherwise, the node can not work normally until the node submits the intelligent contract script and the guarantee fund which meet the requirements;
the reward and sanction checking module is as follows:
one node A reports to another node B, the node A needs to provide cryptology evidence or other node verification consensus, otherwise, the report of the node A cannot be accepted by all the nodes until the node A provides the cryptology evidence or other node verification consensus again;
firstly, discovering that honest nodes serving as the malignant nodes can be rewarded by the intelligent contract script; if the report is not established, the node A is judged as the malignant node and is executed with penalty sanction;
the withdrawing set and the guarantee fund redemption checking module comprises the following specific steps:
in order to prevent the occurrence of the wanting situation, strict verification is required when the node exits the consensus set and redeems the deposit; strict verification refers to the verification of all achievements submitted by the node by the system and other nodes; when the node voluntarily exits the set, recording the integrity value of the node, calculating a reward and returning a guarantee fund;
the cryptographic evidence is a digital signature of the node B and is used for confirming the identity of the rogue node and tracking and sanctioning the rogue node; the digital signature is a method for identifying digital information by the technology in the field of public key encryption, and can be used for verifying the identity of a signatory, so that after A provides the digital signature of node B, the node B can be confirmed to be a reported person;
when each time wheel rolls out a block, the node checks other nodes, and when the node checking result is found to be inconsistent with the result displayed by the node, the node is submitted to report; when the node A reports the node B, the rest nodes can redo the work of the node B and compare with the submitted result, namely the verification consensus;
if the results are the same, the report of the node A fails, the node A is judged as a malicious node, and the node A is sanctioned; if the results are different, the node B is judged to be a malignant node, and the node B is sanctioned; the nodes which work seriously and the nodes which submit the correct report are honest nodes;
the penalty sanctions include in detail: 1. the node does not produce blocks in the self block producing time period, deducts a certain integrity value and degrades from the consensus node to a common node; 2. the ordinary node broadcasts the block arbitrarily, deducts the integrity value and discards the broadcasted block; 3. packing the data in the non-data pool into a block, and degrading the data into a common node without receiving a guarantee fee; 4. broadcasting a plurality of blocks in the self block-out time period, and adding the block-out node into an integrity blacklist without receiving a guarantee fee; 5. packing the honeysuckle transaction into a block, adding the non-payment guarantee fee and the block-out node into an integrity blacklist; 6. and the node tries to branch the block chain, attacks the block chain, and adds the out-block node into the integrity blacklist without receiving the guarantee fund.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910315876.8A CN110188137B (en) | 2019-04-19 | 2019-04-19 | Integrity-based block chain consensus mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910315876.8A CN110188137B (en) | 2019-04-19 | 2019-04-19 | Integrity-based block chain consensus mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110188137A CN110188137A (en) | 2019-08-30 |
| CN110188137B true CN110188137B (en) | 2021-08-31 |
Family
ID=67714768
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910315876.8A Active CN110188137B (en) | 2019-04-19 | 2019-04-19 | Integrity-based block chain consensus mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110188137B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110659901B (en) * | 2019-09-03 | 2022-06-17 | 北京航空航天大学 | Game model-based block chain complex transaction verification method and device |
| CN110610421B (en) * | 2019-09-03 | 2022-03-25 | 北京航空航天大学 | Guarantee fund management method and device under fragment framework |
| CN110752925B (en) * | 2019-10-31 | 2021-12-03 | 电子科技大学 | Improved PBFT consensus method suitable for Internet of things equipment management |
| CN111062730B (en) * | 2019-12-17 | 2023-08-18 | 浙江大学 | Pork information management method and system based on Internet of things and blockchain |
| CN111899094B (en) * | 2020-05-12 | 2024-06-11 | 成都梦马行远科技有限公司 | Block chain consensus method and system based on node credit scoring and pre-crossing loyalty |
| CN111654492B (en) * | 2020-06-01 | 2022-04-26 | 中国联合网络通信集团有限公司 | Method and device for preventing block chain attack |
| CN112101939A (en) * | 2020-09-14 | 2020-12-18 | 邢文超 | Node management method and system based on block chain |
| CN113222593B (en) * | 2021-03-24 | 2024-03-15 | 贵州大学 | Authorized big data transaction scheme based on intelligent contract and digital watermark |
| CN113783899B (en) * | 2021-11-12 | 2022-03-08 | 中国信息通信研究院 | Node exit method and blockchain system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012040377A1 (en) * | 2010-09-21 | 2012-03-29 | Visa International Service Association | Device enrollment system and method |
| CN108564468A (en) * | 2018-04-04 | 2018-09-21 | 上海金丘信息科技股份有限公司 | A kind of common recognition method based on the dynamic equity for trusting member |
| CN109064328A (en) * | 2018-07-09 | 2018-12-21 | 夸克链科技（深圳）有限公司 | A kind of construction and its common recognition algorithm of novel block chain |
| CN109493062A (en) * | 2018-12-29 | 2019-03-19 | 中国科学院合肥物质科学研究院 | A kind of block chain common recognition method proved based on prestige equity |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9875510B1 (en) * | 2015-02-03 | 2018-01-23 | Lance Kasper | Consensus system for tracking peer-to-peer digital records |
| CN109427012B (en) * | 2017-08-22 | 2021-06-01 | 汇链丰(北京)科技有限公司 | Transaction and verification method based on block chain |
| CN108241926B (en) * | 2017-08-25 | 2020-07-10 | 杭州复杂美科技有限公司 | Block chain authorization consensus method |
| CN108108487B (en) * | 2018-01-10 | 2019-11-22 | 杭州复杂美科技有限公司 | A kind of common recognition method of block chain |
| CN109165972A (en) * | 2018-07-30 | 2019-01-08 | 广东工业大学 | A kind of mobile block chain resource allocation methods of task based access control migration mechanism |
| CN109522456A (en) * | 2018-11-14 | 2019-03-26 | 全链通有限公司 | The node availability detection generated based on block |
| CN109639837B (en) * | 2019-01-31 | 2021-04-06 | 东南大学 | Block chain DPoS (distributed denial of service) consensus method based on trust mechanism |
-
2019
- 2019-04-19 CN CN201910315876.8A patent/CN110188137B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012040377A1 (en) * | 2010-09-21 | 2012-03-29 | Visa International Service Association | Device enrollment system and method |
| CN108564468A (en) * | 2018-04-04 | 2018-09-21 | 上海金丘信息科技股份有限公司 | A kind of common recognition method based on the dynamic equity for trusting member |
| CN109064328A (en) * | 2018-07-09 | 2018-12-21 | 夸克链科技（深圳）有限公司 | A kind of construction and its common recognition algorithm of novel block chain |
| CN109493062A (en) * | 2018-12-29 | 2019-03-19 | 中国科学院合肥物质科学研究院 | A kind of block chain common recognition method proved based on prestige equity |
Non-Patent Citations (2)
| Title |
|---|
| Blockchain-Based Proof of Delivery of Physical Assets With Single and Multiple Transporters;Haya R. Hasan 等;《IEEE Access》;20180821;第6卷;46781 - 46793 * |
| 基于拜占庭容错机制的区块链共识算法研究与应用;李剑锋;《中国优秀硕士学位论文全文数据库 信息科技辑》;20190115(第 01 期);I138-2095 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110188137A (en) | 2019-08-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110188137B (en) | Integrity-based block chain consensus mechanism | |
| Zhang et al. | Overview of blockchain consensus mechanism | |
| CN109639837B (en) | Block chain DPoS (distributed denial of service) consensus method based on trust mechanism | |
| Zheng et al. | Blockchain technology for enterprise credit information sharing in supply chain finance | |
| Wang et al. | Blockchain router: A cross-chain communication protocol | |
| Okada et al. | Proposed classification of blockchains based on authority and incentive dimensions | |
| CN114730422A (en) | System and method for commerce in a distributed system with blockchain protocol and intelligent contracts | |
| CN110333948A (en) | Virtual resource allocation method and apparatus based on block chain | |
| KR20190111707A (en) | Blockchain system with consensus algorithm based on proof-of -transaction and method there of | |
| Xue et al. | Hedging against sore loser attacks in cross-chain transactions | |
| Bao et al. | A survey of blockchain consensus safety and security: State-of-the-art, challenges, and future work | |
| CN108712468B (en) | Block chain profit distribution method and distribution system | |
| CN112446771A (en) | Online auction system, method, device and electronic equipment | |
| CN111476552A (en) | Block chain-based card and ticket transaction platform | |
| CN112184274A (en) | Online fulfillment system and method | |
| Lin | Proof of work vs. Proof of stake in cryptocurrency | |
| CN111539724A (en) | Electronic commercial acceptance bill financing method and device based on block chain architecture | |
| CN110930158A (en) | Block chain DPoS common recognition method based on reward and punishment mechanism | |
| Gramlich et al. | Decentralized Finance (DeFi): Foundations, Applications, Potentials, and Challenges | |
| Everaere et al. | Double spending protection for e-cash based on risk management | |
| CN111539719A (en) | Auditable mixed currency service method and system model based on blind signature | |
| CN113742761B (en) | Digital identity casting method and device | |
| Pandey et al. | Functional analysis of blockchain consensus algorithms | |
| Hajialikhani et al. | Uniqueid: decentralized proof-of-unique-human | |
| Ahuja et al. | A Regulatory System for Optimal Legal Transaction Throughput in Cryptocurrency Blockchains |
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 |