CN110570202B - Hybrid consensus method based on fragmentation technology - Google Patents
Hybrid consensus method based on fragmentation technology Download PDFInfo
- Publication number
- CN110570202B CN110570202B CN201910822480.2A CN201910822480A CN110570202B CN 110570202 B CN110570202 B CN 110570202B CN 201910822480 A CN201910822480 A CN 201910822480A CN 110570202 B CN110570202 B CN 110570202B
- Authority
- CN
- China
- Prior art keywords
- node
- consensus
- fragment
- transactions
- nodes
- 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
- G06F16/278—Data partitioning, e.g. horizontal or vertical partitioning
-
- 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
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
- G06Q20/401—Transaction verification
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Databases & Information Systems (AREA)
- General Business, Economics & Management (AREA)
- Computer Security & Cryptography (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Computing Systems (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Technology Law (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a hybrid consensus method based on a fragmentation technology, which designs a fragmentation technology applied to a block chain system, divides all nodes and transaction addresses into a plurality of fragments, records a secondary chain for a common node in each fragment, records a main chain for a representative node, and divides the consensus process into two layers, wherein the first layer is performed in the fragment
Consensus, the result of consensus is recorded in the slave chain, and the consensus result is submitted to the main chain through the representative node of the segment, the second layer is 3% of the consensus performed across the segments), 7% of consensus is performed, and the transaction across the segments is mainly processed, verified and recorded. The consensus method is based on the fragmentation technology, and can improve the expandability of the block chain system while ensuring the decentralization and the safety of the block chain.
Description
Technical Field
The invention mainly relates to a block chain technology, in particular to a hybrid consensus method based on fragmentation.
Background
The block chain technology is a distributed database technology, combines the encryption algorithm, distributed data storage, point-to-point network transmission, a consensus mechanism and other technologies, and creates a decentralized, transparent and autonomous, trust-open and non-falsification value interaction platform.
The consensus mechanism of the blockchain is to ensure that all nodes can obey certain rules, so that the blockchain system can correctly process reasonable transactions. Common consensus mechanisms in a block chain are mainly PoW, PoS, DPoS and PBET, and the consensus mechanisms have advantages and disadvantages and cannot achieve satisfactory effects on decentralization, safety and expandability. The hybrid consensus mechanism applies multiple consensus mechanisms to the same block chain, and can make up for the deficiency of a single consensus mechanism.
In the blockchain, the fragmentation technology fragments nodes or data in the blockchain system according to a certain rule, so that the overall performance of the system is optimized. At present, the fragmentation technology is mainly divided into a network fragmentation technology, a transaction fragmentation technology and a state fragmentation technology. The network fragmentation technology divides all nodes into different fragments according to corresponding rules; the transaction slicing technology divides all transaction data in the system into different slices according to corresponding rules for processing; state fragmentation stores all block chain state information separately in each fragment.
Both the fragmentation technology and the hybrid consensus mechanism greatly help to improve the performance of the blockchain, but at present, no good application is available to combine the advantages of the fragmentation technology and the hybrid consensus mechanism.
Disclosure of Invention
The invention aims to provide a hybrid consensus method based on a fragmentation technology aiming at the defects of the prior art, and the throughput of a system is improved as much as possible under the condition of ensuring the decentralization and the safety of the system. The specific technical scheme is as follows:
a hybrid consensus method based on a fragmentation technology is characterized in that a block chain system is provided with N fragments, and each fragment comprises a representative node and at least one common node; the representative node is responsible for communicating with other fragments and participating in cross-fragment transaction consensus; the common node is responsible for carrying out consensus on the on-chip transactions and collecting the transactions related to the fragment address; one representative node is used as a main node, and the other representative nodes are used as slave nodes; the cross-chip transaction can be identified between chips by a representative node, and the on-chip transaction can be identified between chips by a common node in the sub-chip; all common nodes in the fragment store a slave chain, wherein the slave chain is a block chain recording all transactions in the fragment; all the representative nodes store a main chain, wherein the main chain is a block chain for recording all transactions in the system; each transaction address exists only in a certain segment.
The hybrid consensus method specifically comprises the following steps:
s1: and the common node of each fragment receives the transaction information uploaded by the address contained in the fragment, performs classification processing, submits the cross-fragment transaction to a representative node for inter-fragment consensus, and broadcasts the intra-fragment transaction to the common node in the fragment for intra-fragment consensus.
S2: carrying out in-chip consensus and inter-chip consensus at the same time;
for the on-chip consensus, a common node in each fragment can select one common node in the fragment as an accounting node of the fragment, the accounting node uploads the verified transactions to the representative node of the fragment, and the representative node broadcasts the transactions to the rest representative nodes;
for inter-chip consensus, each slave node sends the cross-chip transactions to be processed by the consensus to the master node, the master node integrates the transactions, and the master node and all the slave nodes perform consensus verification on the integrated data together; the master node broadcasts the verified transactions to all the slave nodes, and the slave nodes send all the transactions related to the fragment where the slave nodes are located to the common node of the fragment.
S3: accounting nodes in each fragment pack verified in-fragment transactions and cross-fragment transactions related to the fragment into blocks, and the blocks are added to a slave chain of the fragment; the main node packs all the slice-in transactions and slice-across transactions passed by the slices into a block, adds the block to the main chain, ends the consensus of the round and starts the consensus of the next round.
Further, all the representative nodes record a version number, and the master node can be determined according to the version number and the number N of the fragments.
Further, the PBFT consensus mechanism is adopted for performing inter-chip consensus on the representative node.
Furthermore, the representative node of each segment is generated by election, during the election process, all nodes of the segment do not perform consensus and do not generate new blocks, meanwhile, the master node and the slave nodes do not process transaction contents related to the segment, and the nodes of the segment do not start consensus again until the election is finished and new representative nodes are generated.
Further, election of representative nodes may occur automatically when malicious behavior occurs with the primary table nodes.
Further, the ordinary nodes in the chip adopt a PoS consensus mechanism to select accounting nodes.
Furthermore, the accounting node verifies all the transactions received in the previous round of consensus again and uploads the verified transactions to the representative node; the representative node verifies the transaction contents again, thereby ensuring the accuracy of the data contents.
The invention has the beneficial effects that:
the invention realizes a consensus mechanism based on a fragmentation technology, can be used for a block chain system, and improves the throughput of the block chain while ensuring the decentralization and the safety of the block chain.
Drawings
Fig. 1 is a block diagram of the block chain system of the present invention.
Fig. 2 is a flow chart of the consensus method of the present invention.
Detailed Description
The present invention will be described in detail below with reference to the accompanying drawings and preferred embodiments, and the objects and effects of the present invention will become more apparent, it being understood that the specific embodiments described herein are merely illustrative of the present invention and are not intended to limit the present invention.
FIG. 1 shows a block diagram of a system architecture according to one embodiment of the invention. As shown in fig. 1, the blockchain system is divided into a plurality of relatively independent segments, and each segment includes a representative node participating in the inter-segment consensus and a plurality of common nodes participating in the intra-segment consensus. Each shard manages a set of transaction addresses having a particular relationship.
The representative node stores a main chain, wherein the main chain is a block chain which records all transaction information of the block chain; the common node stores a slave chain, wherein the slave chain is a block chain recording all address transaction information in the fragment. The common node stores a slave link user balance table, and the slave link user balance table records the balance of all the addresses in the current fragment.
Each address is within only one slice. An on-chip transaction refers to a transaction performed by addresses within two identical slices, and an off-chip transaction refers to a transaction performed by addresses between two different slices. The representative node only recognizes the off-chip transaction, and the common node only recognizes the on-chip transaction of the fragment.
The hybrid consensus method based on the fragmentation technology specifically comprises the following steps:
s1: transaction collection and classification
All addresses upload own transaction information to the common nodes of the segments where the addresses are located, the common nodes of each segment receive the transaction information uploaded by the addresses contained in the segment, the transaction information is classified, cross-segment transactions are submitted to representative nodes for inter-segment consensus, and the intra-segment transactions are broadcasted to the common nodes in the segments for intra-segment consensus.
In S1, all nodes may be multithreaded, and trade is collected at all times while consensus is in progress.
In S1, an address only uploads transaction contents to one node, and if the node goes down, another node is automatically selected. The common node immediately uploads the cross-fragment transaction to the representative node after receiving the cross-fragment transaction, and the on-fragment transaction is broadcasted to other nodes after the consensus starts. The common node integrates the previously received on-chip transactions together and rebroadcasts them after consensus starts, which can reduce on-chip traffic. The time of the whole consensus process is longer than the time of the node communication in the chip, so that all transactions can be processed in time.
S2: carrying out in-chip consensus and inter-chip consensus at the same time;
for the on-chip consensus, a common node in each fragment can select one common node in the fragment as an accounting node of the fragment, the accounting node uploads the verified transactions to the representative node of the fragment, and the representative node broadcasts the transactions to the rest representative nodes;
for inter-chip consensus, each slave node sends the cross-chip transactions to be processed in the current round of consensus to the master node, the master node integrates the transactions, and the master node and all the slave nodes perform consensus verification on the integrated data together; the master node broadcasts the verified transactions to all the slave nodes, and the slave nodes send all the transactions related to the fragment where the slave nodes are located to the common node of the fragment.
S3: accounting nodes in each fragment pack verified in-fragment transactions and cross-fragment transactions related to the fragment into blocks, and the blocks are added to a slave chain of the fragment; the main node packs all the slice-in transactions and slice-across transactions passed by the slices into a block, adds the block to the main chain, ends the consensus of the round and starts the consensus of the next round.
FIG. 2 illustrates a hybrid consensus flow diagram according to one embodiment of the present invention. As shown in fig. 2, there are N segments in total, PoS consensus in the segments is finished, and each segment representative node broadcasts the transaction passing verification to the other representative nodes; the PBFT consensus among the representative nodes is over, and each representative node broadcasts the transaction that passes the verification and is related to the segment to the ordinary nodes in the segment. All consensus is over, the master and slave chains within each segment are updated, and the next round of consensus begins.
In S2, all the representative nodes record a version number, and the master node can be determined according to the version number and the number N of the fragments.
In S2, the election of the representative node includes two steps, namely, a pre-entry stage and a voting stage. In the stage of forecasting names, a node which is expected to become a representative node firstly proposes an application and provides a certain deposit, and then the node is reported as a candidate node. In the voting phase, the nodes in the sub-slices vote for candidate nodes through voting. The node with the most votes will be the representative node of the segment, and is responsible for the PBFT consensus of communication with other segments and participation in cross-segment transaction.
In S2, the consensus protocol in the segment adopts a PoS consensus mechanism, and only performs consensus on the intra-chip transaction of the segment. The consensus protocol within a slice is only participated by the common nodes of each slice. The common node processes the SHA256 mathematical problem to find a Nonce value according to the Target value Target and the coin age CoinAge of the common node, so that the Nonce value meets F (Nonce) < Target x Coinage; the ordinary node finding the Nonce value broadcasts the Nonce value to other ordinary nodes in the chip; the ordinary node for the Nonce value is found first as the accounting node.
In S2, the slave node sends the local round of consensus cross-piece transaction to the master node, and the master node integrates all transaction information and broadcasts the information to all slave nodes; each slave node broadcasts the received transaction content to the master node and other slave nodes and attaches the signature of the slave node; when the master node or slave node receives the excess
When the transaction contents are the same, the transaction is verified; after the verification is finished, broadcasting the verification result to the main node and the other slave nodes, and attaching own signatures; when a node receives a excess
And when the verification results are the same, sending the verification results to the main node, wherein the verification results are the transaction sets which are finally verified.
In S2, the malicious behavior of the node includes fake information and malicious response. The node is not supposed to be in bad condition when the down behavior occurs.
In S2, the chain may be regarded as a lightweight main chain in terms of storage capacity, and may be regarded as a partial copy of the main chain in terms of storage capacity.
In S2, each segment represents a node to maintain a main chain together, which ensures data consistency.
In S2, the representative node is generated by on-chip election. After the representative nodes are successfully selected in an election way, the representative nodes of the rest fragments are expandedA message is broadcast that replaces the representative node. After receiving the message, the other representative nodes send the address of the last block of the main chain to the representative node. As long as the data content of the last block in a block chain is known, the data content of the last block can be obtained according to the address of the last block in the block head, and the data content of all the blocks can be sequentially obtained. There may be some nodes as bad, the representative node needs to be selected more than
A block of signatures.
In S2, the election of the representative node increases the traffic of the whole blockchain system, and a new representative node cannot be elected too frequently. The representative node can collect all the deposit once doing the malice, so that the node can be prevented from doing the malice.
In S2, the election of the new representative node may occur at any time period. In the election process, all nodes of the segment do not know together and do not generate new blocks. At the same time, the master node and the slave nodes do not process the transaction content associated with the segment. And the nodes of the fragment can not start to perform consensus again until a new representative node is generated after the election is finished.
In S2, each Nonce value found has a timestamp indicating the time when the Nonce value was found, and the timestamp is accurate to microseconds (10)-6s) to ensure that no duplication of timestamps occurs.
In S2, the accounting node verifies all transactions received in the previous round, and uploads the transactions to the representative node after verification. The representative node verifies the transaction contents again to ensure the accuracy of the data contents. If the data is found to be in a problem, the wrong data is broadcasted to the rest ordinary nodes of the fragment, and all the ordinary nodes are required to search for the Nonce value again. The searching of the Nonce value requires computer operation, consumes resources, and can ensure profit only by becoming a billing node and obtaining a reward, so that the situation that a node is malicious after becoming a billing node does not occur.
In S2, the accounting node of each segment obtains the reward of the consensus after successfully packing and linking the blocks.
In S2, if the host node performs a malicious behavior or a downtime behavior, a view change operation is performed, and a new host node is automatically generated by adding 1 to the version view. The master node itself is also a representative node of a segment, which acts as a malicious node to collect all its deposit.
In S2, the master node and the slave nodes participating in the consensus receive the reward, which is equal in number of coins. The master node needs to exceed the transaction contents of the transaction which are successfully verified finally
Individual signatures, slave nodes not among these signatures are considered to be not participating in the consensus and cannot receive a reward. The reward is automatically issued by the system to the master node and the co-owned slave nodes after the master node creates blocks and chains.
In S2, after each accounting node generates a block and chains it, the representative node of the block will notify the primary node of the information. And the master node waits for the notification of all fragmented representative nodes, and broadcasts a message for starting the next round of consensus to all the slave nodes after receiving the responses of all the slave nodes. After receiving the message of starting to identify, each segment represents that the node broadcasts the message of starting to identify next round to all the common nodes in the segment. So far, a new round of consensus formally starts.
It will be understood by those skilled in the art that the foregoing is only a preferred embodiment of the invention and is not intended to limit the invention to the particular forms disclosed, and that modifications may be made, or equivalents may be substituted for elements thereof, while remaining within the scope of the claims that follow. All modifications, equivalents and the like which come within the spirit and principle of the invention are intended to be included within the scope of the invention.
Claims (7)
1. Based on fragmentationA hybrid consensus method of technology, characterized in that a blockchain system has
Each fragment comprises a representative node and at least one common node; the representative node is responsible for communicating with other fragments and participating in cross-fragment transaction consensus; the common node is responsible for carrying out consensus on the on-chip transactions and collecting the transactions related to the fragment address; one representative node is used as a main node, and the other representative nodes are used as slave nodes; the cross-chip transaction can be identified between chips by a representative node, and the on-chip transaction can be identified between chips by a common node in the sub-chip; all common nodes in the fragment store a slave chain, wherein the slave chain is a block chain recording all transactions in the fragment; all the representative nodes store a main chain, wherein the main chain is a block chain for recording all transactions in the system; each transaction address exists only in a certain segment;
the hybrid consensus method specifically comprises the following steps:
s1: the common node of each fragment receives the transaction information uploaded by the address contained in the fragment, carries out classification processing, submits the cross-fragment transaction to a representative node for inter-fragment consensus, and broadcasts the intra-fragment transaction to the common node in the fragment for intra-fragment consensus;
s2: carrying out in-chip consensus and inter-chip consensus at the same time;
for the on-chip consensus, a common node in each fragment can select one common node in the fragment as an accounting node of the fragment, the accounting node uploads the verified transactions to the representative node of the fragment, and the representative node broadcasts the transactions to the rest representative nodes;
for inter-chip consensus, each slave node sends the cross-chip transactions to be processed by the consensus to the master node, the master node integrates the transactions, and the master node and all the slave nodes perform consensus verification on the integrated data together; the master node broadcasts the verified transactions to all slave nodes, and the slave nodes send all the transactions related to the segment where the slave nodes are located to the common node of the segment;
s3: accounting nodes in each fragment pack verified in-fragment transactions and cross-fragment transactions related to the fragment into blocks, and the blocks are added to a slave chain of the fragment; the main node packs all the slice-in transactions and slice-across transactions passed by the slices into a block, adds the block to the main chain, ends the consensus of the round and starts the consensus of the next round.
2. A hybrid consensus method based on sharding techniques as claimed in claim 1, wherein all delegate nodes record a version number, and the master node is determined based on the version number and the number of shards N.
3. The hybrid consensus method based on slice technology of claim 1, wherein a PBFT consensus mechanism is employed for inter-slice consensus on behalf of a node.
4. A hybrid consensus method based on fragmentation technology as claimed in claim 1, wherein the representative node of each fragment is generated by election, and during the election process, all nodes of the fragment do not perform consensus nor generate new blocks, and meanwhile, the master node and the slave nodes do not process transaction contents related to the fragment, and the nodes of the fragment do not start to perform consensus again until a new representative node is generated after the election is finished.
5. A hybrid consensus method based on sharding techniques as claimed in claim 1, wherein election of a representative node occurs automatically when a malicious behavior occurs in the primary table node.
6. The hybrid consensus method based on fragmentation technology of claim 1, wherein a common node within a fragment selects an accounting node using a PoS consensus mechanism.
7. The hybrid consensus method based on fragmentation technology as claimed in claim 1, wherein the accounting node re-verifies all transactions received in the previous consensus and uploads the verified transactions to the representative node; the representative node verifies the transaction contents again, thereby ensuring the accuracy of the data contents.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910822480.2A CN110570202B (en) | 2019-09-02 | 2019-09-02 | Hybrid consensus method based on fragmentation technology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910822480.2A CN110570202B (en) | 2019-09-02 | 2019-09-02 | Hybrid consensus method based on fragmentation technology |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110570202A CN110570202A (en) | 2019-12-13 |
| CN110570202B true CN110570202B (en) | 2022-06-03 |
Family
ID=68777429
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910822480.2A Active CN110570202B (en) | 2019-09-02 | 2019-09-02 | Hybrid consensus method based on fragmentation technology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110570202B (en) |
Families Citing this family (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111080452B (en) * | 2019-12-17 | 2023-12-29 | 电子科技大学 | Hierarchical transaction method suitable for energy block chain |
| CN111274313B (en) * | 2020-01-12 | 2023-05-30 | 杭州复杂美科技有限公司 | Segment consensus method, device and storage medium |
| CN111526194B (en) * | 2020-04-17 | 2021-04-23 | 中南大学 | Block chain system parallel common mining method based on fragmentation technology |
| CN111680050B (en) * | 2020-05-25 | 2023-09-26 | 杭州趣链科技有限公司 | Fragment processing method, device and storage medium for alliance chain data |
| CN112039860B (en) * | 2020-08-18 | 2021-04-06 | 上海简苏网络科技有限公司 | Method and device for realizing joint consensus fragmentation in alliance chain |
| CN112235382B (en) * | 2020-09-30 | 2021-09-10 | 厦门攸基数据科技有限公司 | Transaction management system and method based on block chain fragmentation |
| CN112261158B (en) * | 2020-12-21 | 2021-04-20 | 支付宝(杭州)信息技术有限公司 | Method and system for returning cross-fragment transaction response, main chain node and source fragment node |
| CN112269423B (en) * | 2020-12-21 | 2021-03-19 | 支付宝(杭州)信息技术有限公司 | Method for locking global clock in blockchain system and blockchain system |
| CN112650812A (en) * | 2020-12-22 | 2021-04-13 | 深圳壹账通智能科技有限公司 | Data fragment storage method and device, computer equipment and storage medium |
| CN112788139B (en) * | 2021-01-12 | 2022-11-18 | 北京工业大学 | Block chain storage capacity optimization method and system |
| CN112866025B (en) * | 2021-01-14 | 2022-10-11 | 公安部第三研究所 | Intelligent contract fragmentation processing method |
| CN112910965B (en) * | 2021-01-18 | 2022-12-06 | 香港理工大学深圳研究院 | Method and system for submitting fragmented block chain down-across-fragmentation transaction |
| CN113268382B (en) * | 2021-04-19 | 2022-08-09 | 支付宝(杭州)信息技术有限公司 | Method and device for switching fragment nodes in block chain system |
| CN113568974B (en) * | 2021-07-23 | 2024-07-16 | 中信银行股份有限公司 | Block chain system-based shard consensus method, equipment and readable storage medium |
| CN114861233B (en) * | 2022-04-19 | 2023-12-19 | 湖南天河国云科技有限公司 | Fragmenting asynchronous Bayesian family fault-tolerant consensus method and device without trusted third party |
| CN117411894A (en) * | 2022-07-08 | 2024-01-16 | 腾讯科技（深圳）有限公司 | Data processing method, apparatus, program product, device and medium for consensus network |
| CN115689760B (en) * | 2022-12-30 | 2023-03-03 | 国网区块链科技(北京)有限公司 | Block chain fragmentation consensus method, device and equipment for high concurrent power transaction |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107171829A (en) * | 2017-04-24 | 2017-09-15 | 杭州趣链科技有限公司 | A kind of dynamic node management method for algorithm realization of being known together based on BFT |
| CN109150972A (en) * | 2018-07-17 | 2019-01-04 | 湖南宸瀚信息科技有限责任公司 | A kind of the common recognition mechanism and its working method of the efficient block chain of bilayer fragment |
| CN109274674A (en) * | 2018-09-27 | 2019-01-25 | 福建福链科技有限公司 | A kind of block chain isomerism common recognition method and terminal with high security |
| CN109544334A (en) * | 2018-10-22 | 2019-03-29 | 绿州蔚来(深圳)控股有限公司 | A kind of network scalability block chain implementation method |
| CN109819022A (en) * | 2019-01-11 | 2019-05-28 | 华侨大学 | A kind of block chain common recognition method based on credit appraisal |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9090948B2 (en) * | 2008-09-30 | 2015-07-28 | Abbott Molecular Inc. | Primers and probes for detecting human papillomavirus and human beta globin sequences in test samples |
| US10158527B2 (en) * | 2016-10-28 | 2018-12-18 | International Business Machines Corporation | Changing an existing blockchain trust configuration |
-
2019
- 2019-09-02 CN CN201910822480.2A patent/CN110570202B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107171829A (en) * | 2017-04-24 | 2017-09-15 | 杭州趣链科技有限公司 | A kind of dynamic node management method for algorithm realization of being known together based on BFT |
| CN109150972A (en) * | 2018-07-17 | 2019-01-04 | 湖南宸瀚信息科技有限责任公司 | A kind of the common recognition mechanism and its working method of the efficient block chain of bilayer fragment |
| CN109274674A (en) * | 2018-09-27 | 2019-01-25 | 福建福链科技有限公司 | A kind of block chain isomerism common recognition method and terminal with high security |
| CN109544334A (en) * | 2018-10-22 | 2019-03-29 | 绿州蔚来(深圳)控股有限公司 | A kind of network scalability block chain implementation method |
| CN109819022A (en) * | 2019-01-11 | 2019-05-28 | 华侨大学 | A kind of block chain common recognition method based on credit appraisal |
Non-Patent Citations (2)
| Title |
|---|
| State of the Art and Challenges Facing Consensus Protocols on Blockchain;Nutthakorn Chalaemwongwan等;《2018 International Conference on Information Networking》;20180423;第957-962页 * |
| 区块链共识机制研究综述;刘懿中 等;《密码学报》;20190815;第6卷(第4期);第395-432页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110570202A (en) | 2019-12-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110570202B (en) | Hybrid consensus method based on fragmentation technology | |
| US11893017B2 (en) | Utilizing a prioritized feedback communication mechanism based on backlog detection data | |
| CN109165945B (en) | Representative node device election method and device, computer device and storage medium | |
| US11636450B2 (en) | Blockchain system to which proof-of-transaction consensus algorithm is applied, and method therefor | |
| CN108492103A (en) | A kind of alliance's block chain common recognition method | |
| CN111010278B (en) | High-fault-tolerance layering consensus method based on DPoS | |
| CN109242484A (en) | A kind of common recognition motivational techniques of block chain | |
| CN113610531B (en) | Consensus method, block chain system and consensus node | |
| CN111935207A (en) | Block chain system consensus method based on improved C4.5 algorithm | |
| CN113347164A (en) | Block chain-based distributed consensus system, method, device and storage medium | |
| CN111080452A (en) | Hierarchical transaction method suitable for energy source block chain | |
| CN112235429B (en) | Central accounting type decentralized distributed data processing method and system | |
| CN111698094A (en) | Consensus method based on block chain system and block chain system | |
| CN114726517A (en) | Method, system and consensus node for generating random number seeds on block chain | |
| CN114553434A (en) | Consensus method, block chain system and consensus node | |
| CN118077171A (en) | Method for pooling in a spatial-proof-based blockchain via singleton | |
| CN110597922A (en) | Data processing method, device, terminal and storage medium | |
| CN114219650B (en) | Block chain consensus method with low transaction delay | |
| CN112184454B (en) | Block chain consensus method, device, system and storage medium | |
| WO2024113956A1 (en) | Node selection method and apparatus, first node, storage medium and program product | |
| CN115545928A (en) | Method and device for determining message playback sequence | |
| CN112258184B (en) | Method, apparatus, electronic device and readable storage medium for freezing blockchain network | |
| CN114861233B (en) | Fragmenting asynchronous Bayesian family fault-tolerant consensus method and device without trusted third party | |
| US12074853B1 (en) | Method and apparatus for providing secure information to a decentralized computing environment | |
| CN105610921A (en) | Erasure code filing method based on data cache in cluster |
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 |