CN108648076B - Method and system for electing common node and generating node information table - Google Patents
Method and system for electing common node and generating node information table Download PDFInfo
- Publication number
- CN108648076B CN108648076B CN201810356600.XA CN201810356600A CN108648076B CN 108648076 B CN108648076 B CN 108648076B CN 201810356600 A CN201810356600 A CN 201810356600A CN 108648076 B CN108648076 B CN 108648076B
- Authority
- CN
- China
- Prior art keywords
- node
- consensus
- information table
- nodes
- new
- 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
- 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
Abstract
The application discloses a method for electing a consensus node and generating a node information table, which comprises the following steps: a statistical step: and counting the mortgage interest value of each synchronous node. And (3) election step: and selecting the synchronous node with the highest mortgage interest value as a new consensus node. A calculation step: and calculating the repeated occurrence times of each new consensus node in the node information table, wherein the repeated occurrence times are positively correlated with the mortgage interest value of the node. A table generating step: and generating a node information table of the new consensus node. Out-of-order steps: and (4) disordering the data sequence in the node information table to form a final new node information table of the consensus node for selecting the consensus node from the new node information table to participate in the consensus process. The application also discloses a system for electing the consensus node and generating the node information table. The application can ensure that the consensus nodes with higher mortgage interest value participate in the consensus process more, and the nodes are reliable, thereby reducing the probability of Byzantine errors of the consensus algorithm.
Description
Technical Field
The present application relates to a consensus mechanism (consensus) in a Blockchain (Blockchain) network, and more particularly, to a selection method of a consensus node therein.
Background
In the white paper of the Chinese blockchain technology and the application development issued by the Ministry of industry and informatization, 10.10.18.2016, a blockchain is defined as a technology which can maintain a set of untrustworthy account book records among untrustworthy or weakly-trusted participants without the participation of intermediaries. First, a block chain is a chain (chain) like data structure in units of blocks, each block being cryptographically certified with a preceding block. Second, the blockchain is a distributed ledger (distributed ledger) shared throughout the network. In many scenarios, the two technical terms of blockchain and distributed ledger have the same meaning.
Typically, the blockchain technique is used by all or some of the nodes of a P2P network (peer-to-peer network) to verify new blocks according to some consensus algorithm, and new blocks that pass the verification are added to the end of the blockchain data structure. A P2P network that employs the blockchain technique is referred to as a blockchain network. The consensus refers to a process that a plurality of nodes participate in a process of agreeing on certain data, behaviors or processes through interaction of the nodes under a preset rule. Consensus mechanisms are algorithms, protocols, and rules that define a consensus process.
Commonly used consensus algorithms include proof-of-merit (PoS) algorithms, trusted proof-of-merit (DPoS) algorithms, and the like.
The main idea of the equity proving algorithm is that the difficulty of obtaining the node accounting right is inversely proportional to the equity held by the node, i.e. the higher the equity held by the node, the easier it is to obtain the accounting right, and vice versa. The accounting right mainly refers to the right of proposing a new alternative block in each round of consensus process.
The main idea of the delegation rights certification algorithm is to elect several witnesses (witness) from all nodes, only the witness having the accounting right. The accounting right also mainly refers to the right of proposing a new alternative block in each round of consensus process.
In each round of consensus in the blockchain network, the new candidate blocks are proposed and then need to be checked and verified to finally identify the blocks that have completed consensus. In the process of checking, verifying and confirming, the participation of a Byzantine node, i.e., a node which makes an error or a malicious node, cannot be avoided, so that a Byzantine error (Byzantine failure), i.e., a consensus failure, may be caused.
Disclosure of Invention
The technical problem to be solved by the application is to provide a method for selecting a consensus node and generating a node information table in a delegation interest proving algorithm, so that the probability of Byzantine errors can be reduced. Therefore, the application also provides a system for selecting the consensus nodes and generating the node information table in the delegation rights and interests certification algorithm.
In order to solve the above technical problem, the present application provides a method for electing a consensus node and generating a node information table, which includes the following steps. A statistical step: and counting the mortgage interest value of each synchronous node. And (3) election step: and selecting the synchronous nodes with the highest mortgage interest value and the same number as the common nodes from all the synchronous nodes as new common nodes, wherein if the number of the nodes with the mortgage interest values larger than zero in all the synchronous nodes is smaller than the number of the common nodes, the election fails, the existing common nodes serve as the common nodes again in a new period, and the new common nodes are waited for being elected in the next period. A calculation step: calculating the repeated occurrence times of each new consensus node in the node information table according to the mortgage interest value of each new consensus node and the length of the node information table; the higher the mortgage interest value is, the more times the new consensus node appears in the node information table is; the lower the mortgage equity value, the fewer the number of occurrences in the node information table. A table generating step: and generating a node information table of the new consensus node, and adding the new consensus node into the generated node information table according to the repeated occurrence times. Out-of-order steps: and (4) disordering the data sequence in the node information table to form a final new node information table of the consensus node for selecting the consensus node from the new node information table to participate in the consensus process.
Therefore, the nodes without the mortgage interest value can be prevented from becoming the common identification nodes, and the nodes without the mortgage interest value can be prevented from participating in the common identification process. Nodes without a mortgage entitlement value are not trustworthy, e.g., participation in the consensus process may increase the probability of a byzantine error in the consensus algorithm.
Preferably, in the calculating step, the number of times each new consensus node appears repeatedly in the node information table is proportional to the mortgage interest value. This provides a specific implementation of the calculation method.
Preferably, in the step of disordering, a random algorithm is adopted to disorder the data sequence in the table. For example, using the Fisher-Yates Shuffle (also called Fisher-Yates Shuffle) algorithm to Shuffle the order of data in the table. This provides a specific implementation of an out-of-order method.
Further, the method for electing the common node and generating the node information table further comprises a gathering step before the counting step: and forming a virtual synchronization node by a plurality of physical synchronization nodes. In the counting step, the mortgage equity value of the virtual synchronization node is the sum of the mortgage equity values of all the physical synchronization nodes forming the virtual synchronization node. In the counting step, the calculating step, the table generating step and the disorder step, the virtual synchronous node is treated as a synchronous node, and if the virtual synchronous node is selected as a consensus node, the virtual synchronous node is treated as a consensus node. Therefore, the computing power of the synchronous node can be improved, and the computing power of the consensus node can also be improved if the consensus node is elected, so that the computing efficiency of the consensus process is improved, and the time required by the consensus process is shortened.
In order to solve the technical problem, the application also provides a system for electing the common node and generating the node information table, which comprises a statistical unit, an electing unit, a calculating unit, a table generating unit and an out-of-order unit. The statistic unit is used for counting the mortgage interest value of each synchronous node. The election unit is used for selecting the synchronous nodes with the highest mortgage interest value and the same number as the common nodes from all the synchronous nodes to become new common nodes, and the election unit also gives up the election common nodes when the number of the nodes with the mortgage interest value larger than zero in all the synchronous nodes is smaller than the number of the common nodes, and the existing common nodes serve as the common nodes again in a new period to wait for the new common nodes to be elected in the next period. The calculating unit is used for calculating the repeated occurrence times of each new consensus node in the node information table according to the mortgage interest value of each new consensus node and the length of the node information table; the higher the mortgage interest value is, the more times the new consensus node appears in the node information table is; the lower the mortgage equity value, the fewer the number of occurrences in the node information table. The table generating unit is used for generating a node information table of the new consensus node and adding the new consensus node into the generated node information table according to the repeated occurrence times. The disordering unit is used for disordering the data sequence in the node information table to form a final new node information table of the consensus node, and the final new node information table of the consensus node is used for selecting the consensus node from the final new node information table to participate in the consensus process.
Therefore, the nodes without the mortgage interest value can be prevented from becoming the common identification nodes, and the nodes without the mortgage interest value can be prevented from participating in the common identification process. Nodes without a mortgage entitlement value are not trustworthy, e.g., participation in the consensus process may increase the probability of a byzantine error in the consensus algorithm.
Preferably, the calculating unit further makes the number of times that each new consensus node repeatedly appears in the node information table proportional to the mortgage interest value thereof. This provides a specific implementation of the calculation method.
Preferably, the disordering unit further uses a random algorithm to disorder the data sequence in the table. For example, using a fisher-tropsch random scrambling algorithm to scramble the data order in the table. This provides a specific implementation of an out-of-order method.
Further, the system for electing the common node and generating the node information table further comprises a collecting unit. The aggregation unit is used for forming a plurality of physical synchronization nodes into a virtual synchronization node. The statistical unit takes the sum of the mortgage equity values of all physical synchronous nodes forming the virtual synchronous node as the mortgage equity value of the virtual synchronous node. The statistical unit, the calculation unit, the table generation unit and the disorder unit treat the virtual synchronous node as a synchronous node, and if the virtual synchronous node is selected as a consensus node, the virtual synchronous node is treated as a consensus node. Therefore, the computing power of the synchronous node can be improved, and the computing power of the consensus node can also be improved if the consensus node is elected, so that the computing efficiency of the consensus process is improved, and the time required by the consensus process is shortened.
The application provides a method and a system for electing consensus nodes and generating a node information table, wherein the new consensus nodes are arranged in each period to generate the node information table, so that the consensus nodes with higher mortgage right interest values can participate in the consensus process more, and the nodes are reliable, and the probability of the occurrence of byzantine errors in the consensus algorithm is reduced.
Drawings
Fig. 1 is a flowchart illustrating a first embodiment of a method for electing a common node and generating a node information table according to the present application.
Fig. 2 is a flowchart illustrating a second embodiment of a method for electing a common node and generating a node information table according to the present application.
Detailed Description
In the block chain network applicable to the application, all nodes can be divided into two categories according to whether to participate in consensus, the nodes participating in consensus are called consensus nodes, and the nodes not participating in consensus are called non-consensus nodes.
The consensus node is used for performing consensus on data, behaviors or processes in the block chain network, generating the data which completes the consensus into blocks, and distributing the blocks which complete the consensus to the synchronous nodes. The consensus node also maintains a distributed account book of the blockchain network, namely, blocks which finish consensus are added and stored in a blockchain data structure stored by the consensus node.
The non-consensus node is used for monitoring the state of the consensus node, verifying the block which completes consensus and assisting in arbitrating and managing the consensus node. The non-consensus nodes mainly comprise synchronization nodes. The synchronization node does not participate in the consensus but maintains the same synchronization state as the consensus node. When the consensus node achieves a new consensus, the blocks with the consensus are distributed to the synchronization nodes. The synchronization node also maintains a distributed book of the blockchain network, i.e. a block which completes consensus is added and stored in a blockchain data structure stored by the synchronization node. The non-consensus nodes may also include non-consensus nodes other than the synchronization nodes.
When each node joins the block chain network, the mortgage right value of the node is set. The setting mode is that part or all of the interest value of the newly added node is selected as the mortgage interest value.
The election consensus node and the method for generating the node information table are applicable to the delegation rights and interests certification algorithm and are performed periodically. For example, after each 100 rounds of consensus process, a new consensus node is elected and a node information table of the new consensus node is generated. The periodicity may be adjusted as needed.
Referring to fig. 1, a first embodiment of a method for electing a common node and generating a node information table according to the present application includes the following steps.
A statistical step 102: and counting the mortgage interest value of each synchronous node.
An election step 104: and selecting the K synchronous nodes with the highest mortgage interest value from all the synchronous nodes as new consensus nodes. Where K is the number of consensus nodes. For example, the synchronization nodes are sorted from high to low according to the mortgage interest value, and the K synchronization nodes arranged at the top are selected as new consensus nodes.
A calculation step 106: and calculating the repeated occurrence times of each new consensus node in the node information table according to the mortgage interest value of each new consensus node and the length L of the node information table. The principle of calculation is as follows: the higher the mortgage interest value is, the more times the new consensus node appears in the node information table is; the lower the mortgage equity value, the fewer the number of occurrences in the node information table. Optionally, the number of times each new consensus node appears repeatedly in the node information table is proportional to its mortgage benefit value. For example, if there are two new nodes a and B that are commonly identified, and the mortgage interest values of the nodes a and B are 100 and 10 respectively, the nodes a and B may repeat 500 times and 50 times in the node information table by some calculation.
Table generation step 108: and generating a node information table of the new consensus node, and adding the new consensus node into the generated node information table according to the repeated occurrence times. The length L of the node information table refers to the number of items of data contained in the node information table, and L is far larger than K, so that each new consensus node can repeatedly appear in the node information table for multiple times.
An out-of-order step 110: and (4) disordering the data sequence in the node information table to form a final new node information table of the consensus node for selecting the consensus node from the new node information table to participate in the consensus process. For example, a random algorithm is used to shuffle the data order in the table. Optionally, the order of the data in the table is scrambled using a fexiez random scrambling algorithm. The participation in the consensus process comprises operations of proposing a new candidate block in each round of consensus process, checking and/or verifying the new candidate block, confirming the new candidate block as a block which completes the consensus, and the like.
Further, in the election step 104, the mortgage interest value defining the new consensus node must be greater than zero. And if the number of the nodes with the mortgage interest value larger than zero in all the synchronous nodes is smaller than K, the election fails, the existing consensus node acts as the consensus node again in a new period, and the new consensus node is waited to be elected in the next period.
Corresponding to fig. 1, an embodiment of the system for electing a common node and generating a node information table provided in the present application includes a statistical unit, an electing unit, a calculating unit, a table generating unit, and an out-of-order unit.
The statistic unit is used for counting the mortgage interest value of each synchronous node.
The election unit is used for selecting the K synchronous nodes with the highest mortgage interest value from all the synchronous nodes to become new consensus nodes. Where K is the number of consensus nodes.
The calculating unit is used for calculating the repeated occurrence times of each new consensus node in the node information table according to the mortgage interest value of each new consensus node and the length L of the node information table. The principle of calculation is as follows: the higher the mortgage interest value is, the more times the new consensus node appears in the node information table is; the lower the mortgage equity value, the fewer the number of occurrences in the node information table. Optionally, the number of times each new consensus node appears repeatedly in the node information table is proportional to its mortgage benefit value.
The table generating unit is used for generating a node information table of the new consensus node and adding the new consensus node into the generated node information table according to the repeated occurrence times. The length L of the node information table refers to the number of items of data contained in the node information table, and L is far larger than K, so that each new consensus node can repeatedly appear in the node information table for multiple times.
The disordering unit is used for disordering the data sequence in the node information table to form a final new node information table of the consensus node, and the final new node information table of the consensus node is used for selecting the consensus node from the final new node information table to participate in the consensus process. For example, a random algorithm is used to shuffle the data order in the table. The participation in the consensus process comprises the operations of proposing a new candidate block, checking and/or verifying the new candidate block, confirming the new candidate block as a block which completes consensus, and the like.
Furthermore, the election unit gives up the election common node when the number of the nodes with the mortgage interest value larger than zero in all the synchronous nodes is smaller than K, and the existing common node serves as the common node again in a new period to wait for the new common node to be elected in the next period.
Referring to fig. 2, a second embodiment of the method for electing a consensus node and generating a node information table provided in the present application includes the following steps.
An aggregation step 101: and forming a virtual synchronization node by a plurality of physical synchronization nodes. For example, using Sharding (Sharding) techniques, distributed computing techniques, etc. The main purpose of such operation is to integrate the computing capabilities of multiple physical synchronization nodes to form a unified and strong computing capability. If the consensus node has a certain requirement on the computing capability and a single physical synchronization node cannot meet the requirement on the computing capability, a plurality of physical synchronization nodes can be combined into a virtual synchronization node to meet the requirement on the computing capability.
The subsequent steps are the same as those in the first embodiment, and the virtual synchronization node is treated as a synchronization node, and if the virtual synchronization node is selected as a consensus node, the virtual synchronization node is treated as a consensus node. In the statistical step 102, for a virtual synchronization node, the sum of the mortgage right values of all physical synchronization nodes constituting the virtual synchronization node is used as the mortgage right value of the virtual synchronization node.
Corresponding to fig. 1, the embodiment of the system for electing a consensus node and generating a node information table provided by the present application includes a collecting unit, a counting unit, an electing unit, a calculating unit, a table generating unit, and an out-of-order unit.
The aggregation unit is used for forming a plurality of physical synchronization nodes into a virtual synchronization node.
The other units are the same as the first embodiment, and treat the virtual synchronization node as a synchronization node, and treat the virtual synchronization node as a consensus node if the virtual synchronization node is elected as the consensus node. The statistic unit takes the sum of the mortgage equity values of all physical synchronous nodes forming the virtual synchronous node as the mortgage equity value of the virtual synchronous node.
The application provides a new election consensus node and a method and a system for generating a node information table on the basis of the existing entrusting equity certification algorithm, and is mainly characterized in that the node information table is generated for the new consensus node in each period, and the length L of the node information table is far larger than the number K of the consensus nodes. Each new consensus node repeatedly appears in the node information table, and the repeated times are positively correlated with the mortgage right interest value of each new consensus node. The subsequent consensus algorithm is just to select a consensus node from the node information table to perform the consensus process. Therefore, the application can enable the consensus nodes with higher mortgage right value to participate in the consensus process more, and the nodes are considered to be reliable, so that the probability of the occurrence of byzantine errors in the consensus algorithm is reduced.
The above are merely preferred embodiments of the present application and are not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (8)
1. A method for electing a common node and generating a node information table is characterized by comprising the following steps:
a statistical step: counting the mortgage interest value of each synchronous node;
and (3) election step: selecting the synchronous nodes with the highest mortgage interest value and the same number as the common nodes from all the synchronous nodes as new common nodes; if the number of the nodes with the mortgage interest value larger than zero in all the synchronous nodes is smaller than the number of the common-knowledge nodes, the election fails, the existing common-knowledge nodes serve as the common-knowledge nodes again in a new period, and the new common-knowledge nodes are waited to be elected in the next period;
a calculation step: calculating the repeated occurrence times of each new consensus node in the node information table according to the mortgage interest value of each new consensus node and the length of the node information table; the higher the mortgage interest value is, the more times the new consensus node appears in the node information table is; the lower the mortgage interest value is, the fewer the times of occurrence of the new consensus node in the node information table are;
a table generating step: generating a node information table of a new consensus node, and adding the new consensus node into the generated node information table according to the repeated occurrence times;
out-of-order steps: and (4) disordering the data sequence in the node information table to form a final new node information table of the consensus node for selecting the consensus node from the new node information table to participate in the consensus process.
2. The method of claim 1 wherein the calculating step is performed such that the number of times each new consensus node appears repeatedly in the table is proportional to its mortgage benefit value.
3. The method of claim 1, wherein the step of de-ordering comprises using a random algorithm to de-order data in the table.
4. The method of claim 1, further comprising before the step of counting, the step of aggregating: forming a virtual synchronization node by a plurality of physical synchronization nodes;
in the counting step, the mortgage equity value of the virtual synchronization node is the sum of the mortgage equity values of all physical synchronization nodes forming the virtual synchronization node;
in the counting step, the calculating step, the table generating step and the disorder step, the virtual synchronous node is treated as a synchronous node, and if the virtual synchronous node is selected as a consensus node, the virtual synchronous node is treated as a consensus node.
5. A system for electing a common node and generating a node information table is characterized by comprising a statistical unit, an electing unit, a calculating unit, a table generating unit and an out-of-order unit;
the statistic unit is used for counting the mortgage right value of each synchronous node;
the election unit is used for selecting the synchronous nodes with the highest mortgage interest value and the same number as the common nodes from all the synchronous nodes to become new common nodes; the election unit gives up the election of the common-knowledge node when the number of the nodes with the mortgage interest value larger than zero in all the synchronous nodes is smaller than the number of the common-knowledge nodes, and the existing common-knowledge nodes serve as the common-knowledge nodes again in a new period to wait for the next period to elect a new common-knowledge node;
the calculating unit is used for calculating the repeated occurrence times of each new consensus node in the node information table according to the mortgage interest value of each new consensus node and the length of the node information table; the higher the mortgage interest value is, the more times the new consensus node appears in the node information table is; the lower the mortgage interest value is, the fewer the times of occurrence of the new consensus node in the node information table are;
the table generating unit is used for generating a node information table of the new consensus node and adding the new consensus node into the generated node information table according to repeated occurrence times;
the disordering unit is used for disordering the data sequence in the node information table to form a final new node information table of the consensus node, and the final new node information table of the consensus node is used for selecting the consensus node from the final new node information table to participate in the consensus process.
6. The system according to claim 5, wherein the computing unit further causes each new consensus node to occur repeatedly within the table of node information in proportion to its mortgage benefit value.
7. The system of claim 5, wherein the de-ordering unit further uses a random algorithm to de-order data in the table.
8. The system of claim 5, further comprising a collecting unit;
the aggregation unit is used for forming a plurality of physical synchronization nodes into a virtual synchronization node;
the statistical unit takes the sum of the mortgage equity values of all physical synchronous nodes forming the virtual synchronous node as the mortgage equity value of the virtual synchronous node;
the statistical unit, the calculation unit, the table generation unit and the disorder unit treat the virtual synchronous node as a synchronous node, and if the virtual synchronous node is selected as a consensus node, the virtual synchronous node is treated as a consensus node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810356600.XA CN108648076B (en) | 2018-04-19 | 2018-04-19 | Method and system for electing common node and generating node information table |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810356600.XA CN108648076B (en) | 2018-04-19 | 2018-04-19 | Method and system for electing common node and generating node information table |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108648076A CN108648076A (en) | 2018-10-12 |
| CN108648076B true CN108648076B (en) | 2021-03-19 |
Family
ID=63747084
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810356600.XA Active CN108648076B (en) | 2018-04-19 | 2018-04-19 | Method and system for electing common node and generating node information table |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108648076B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111478785B (en) * | 2019-01-24 | 2021-11-02 | 北京京东尚科信息技术有限公司 | Consensus method in block chain network, node and storage medium |
| CN112418859B (en) * | 2020-12-04 | 2022-04-29 | 腾讯科技（深圳）有限公司 | Block chain consensus method and device, electronic equipment and readable storage medium |
| CN114499846A (en) * | 2022-01-20 | 2022-05-13 | 浙江吉利控股集团有限公司 | Verification node distribution method, device, equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106952124A (en) * | 2017-03-16 | 2017-07-14 | 北京牛链科技有限公司 | Electronic bill management system and method based on distribution book keeping operation |
| CN107194666A (en) * | 2017-05-19 | 2017-09-22 | 中链科技有限公司 | Report Server Management method and terminal device based on block chain technology |
| CN107292735A (en) * | 2017-05-27 | 2017-10-24 | 唐盛（北京）物联技术有限公司 | A kind of mortgage finance method and system based on block chain technology |
| CN107341660A (en) * | 2017-05-27 | 2017-11-10 | 唐盛（北京）物联技术有限公司 | A kind of block chain bottom common recognition mechanism and the block catenary system based on the common recognition mechanism |
| CN107423962A (en) * | 2017-07-11 | 2017-12-01 | 成都励睿德企业管理有限公司 | Data block chain mandate based on rewards and punishments participates in the Byzantine failure tolerance method and its rewards and punishments method of common recognition |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160164884A1 (en) * | 2014-12-05 | 2016-06-09 | Skuchain, Inc. | Cryptographic verification of provenance in a supply chain |
| WO2016164496A1 (en) * | 2015-04-06 | 2016-10-13 | Bitmark, Inc. | System and method for decentralized title recordation and authentication |
-
2018
- 2018-04-19 CN CN201810356600.XA patent/CN108648076B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106952124A (en) * | 2017-03-16 | 2017-07-14 | 北京牛链科技有限公司 | Electronic bill management system and method based on distribution book keeping operation |
| CN107194666A (en) * | 2017-05-19 | 2017-09-22 | 中链科技有限公司 | Report Server Management method and terminal device based on block chain technology |
| CN107292735A (en) * | 2017-05-27 | 2017-10-24 | 唐盛（北京）物联技术有限公司 | A kind of mortgage finance method and system based on block chain technology |
| CN107341660A (en) * | 2017-05-27 | 2017-11-10 | 唐盛（北京）物联技术有限公司 | A kind of block chain bottom common recognition mechanism and the block catenary system based on the common recognition mechanism |
| CN107423962A (en) * | 2017-07-11 | 2017-12-01 | 成都励睿德企业管理有限公司 | Data block chain mandate based on rewards and punishments participates in the Byzantine failure tolerance method and its rewards and punishments method of common recognition |
Non-Patent Citations (2)
| Title |
|---|
| 一种改进的区块链共识机制的研究与实现;张永，李晓辉;《电子设计工程》;20180131;全文 * |
| 区块链技术共识算法综述;王晓光;《信息与电脑》;20170531;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108648076A (en) | 2018-10-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110868440B (en) | Block chain male chain | |
| JP7184959B2 (en) | Method and apparatus for distributed database in network | |
| CN106850536B (en) | Block chain consensus method and system | |
| CN106530083B (en) | Multichain management method and system based on block chain | |
| CN108377206B (en) | Method, apparatus and computer-readable storage medium for configuring consensus algorithm | |
| US11734260B2 (en) | Methods and apparatus for a distributed database within a network | |
| CN108648076B (en) | Method and system for electing common node and generating node information table | |
| CN109951474B (en) | Method for realizing block chain common identification block | |
| CN110602217B (en) | Block chain-based alliance management method, device, equipment and storage medium | |
| CN111026578A (en) | Intelligent contract security detection method based on prediction machine | |
| CN113347164A (en) | Block chain-based distributed consensus system, method, device and storage medium | |
| CN111400112A (en) | Writing method and device of storage system of distributed cluster and readable storage medium | |
| EP3891952A2 (en) | A node testing method and apparatus for a blockchain system | |
| CN113014635A (en) | Node type division method and device of block chain system and block chain system | |
| CN112187866B (en) | Novel block chain consensus method based on shared storage | |
| CN112232619A (en) | Block output and sequencing method, node and block chain network system of alliance chain | |
| CN113469371A (en) | Federal learning method and device | |
| CN114449476A (en) | Block link point consensus method for safety communication in Internet of vehicles | |
| CN114189325A (en) | Scalable Byzantine fault-tolerant method with high fault tolerance, device and storage medium | |
| CN113783899A (en) | Node exit method and blockchain | |
| KR20220082074A (en) | Decentralized network with consensus mechanism | |
| CN109409899B (en) | Transaction verification method, device and system | |
| Diarra | Choosing a consensus protocol for uses cases in distributed ledger technologies | |
| CN114827176A (en) | Method and system for defending Sybil attack in distributed storage system | |
| CN112860807B (en) | Fault-tolerant consensus method suitable for wireless block chain network |
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 |