CN110751563A - Novel block chain consensus mechanism - Google Patents
Novel block chain consensus mechanism Download PDFInfo
- Publication number
- CN110751563A CN110751563A CN201911054275.2A CN201911054275A CN110751563A CN 110751563 A CN110751563 A CN 110751563A CN 201911054275 A CN201911054275 A CN 201911054275A CN 110751563 A CN110751563 A CN 110751563A
- Authority
- CN
- China
- Prior art keywords
- node
- transaction
- information
- node group
- 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.)
- Pending
Links
- 230000007246 mechanism Effects 0.000 title claims abstract description 24
- 238000000034 method Methods 0.000 claims description 4
- 230000002159 abnormal effect Effects 0.000 claims description 3
- 230000001360 synchronised effect Effects 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
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
-
- 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/389—Keeping log of transactions for guaranteeing non-repudiation of a transaction
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Technology Law (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to the technical field of a block chain consensus mechanism, and discloses a novel block chain consensus mechanism. The invention can accelerate the consensus efficiency of the nodes by increasing the number of the nodes added in the network block chain, increasing the number of the nodes in the node group and increasing the transaction amount which can be received at the same time, and the invention adopts the scheme that the transaction flow is distributed to the nodes in the node group at one time by adopting the synchronization algorithm in the node group and the fault-tolerant algorithm between the node groups, so that the number of the nodes in the node group is increased, the transaction processing speed in one time is increased, and the consensus efficiency can be greatly improved.
Description
Technical Field
The invention relates to the technical field of a block chain consensus mechanism, in particular to a novel block chain consensus mechanism.
Background
The consensus mechanism is a very central part of the blockchain technology system, and the consensus is the knowledge that all participating nodes in the network agree on a certain information. The consensus mechanism is a consensus method designed to achieve consensus, and the common consensus mechanisms mainly include POW, POS, DPOS, PBFT, and the like.
The chinese patent discloses a block chain consensus mechanism (No. CN 109977166A), which is simple in calculation method, improves the block output efficiency, has short calculation time and low resource consumption, randomly generates miner numbers, improves the DDOS attack difficulty, and enhances the network security, but according to the above patent, the analysis is performed by combining the existing block chain consensus mechanism, and the existing block chain consensus mechanism causes the node consensus efficiency to be significantly reduced along with the continuous increase of the number of nodes in the calculation process, so that technical personnel in the art provide a new block chain consensus mechanism to solve the problems proposed in the background art.
Disclosure of Invention
The present invention provides a new block chain consensus mechanism to solve the problem of node consensus efficiency decreasing significantly as the number of nodes increases in the background art.
In order to achieve the purpose, the invention provides the following technical scheme: a new blockchain consensus mechanism is applied to a blockchain network, and a transaction node is established in a network blockchain, the method comprises the following steps:
s1, dividing all nodes in the block chain into a plurality of node groups, namely a node group 1, a node group 2 and a node group 3 … … node group N, wherein each node group comprises a plurality of nodes, namely a node 1, a node 2 and a node 3 … … node N;
s2: then the node groups are sequentially ordered according to the sequence of adding the nodes into the network, and a fault-tolerant algorithm is used among each node group;
s3, further, the transaction flow sequentially enters a block chain network and is divided into a plurality of transactions 1, 2 and 3 … …;
s4, when the node 1 of the node group receives the transaction information, recording the transaction information, and synchronizing to other nodes of the node group, so that other nodes in a single node group can record the same transaction record information sent by the node 1;
s5, for the same transaction: regarding each node group as a whole as one piece of information: namely N pieces of information can be regarded among N node groups;
the N parts of information adopt a fault-tolerant algorithm: namely N parts of information, f parts of abnormal information (different from other node data) satisfies N > =3f + 1;
if the fault tolerance algorithm is met, the transaction can be regarded as correct data, i.e. the transaction is successful.
As a further scheme of the invention: the number of the node groups in the S1 is not less than 4, and the number of the nodes in a single node group is not less than 4.
As a still further scheme of the invention: the node addition case in S2: if one hundred nodes are sequentially added and divided into 5 node groups, and each node group is 20 nodes, the transaction 1 is simultaneously sent to the first node of each node group, that is, the corresponding node numbers are respectively: 1. 21, 41, 61, 81.
As a still further scheme of the invention: the case where each transaction occurrence information is given to each node group in S3 is: transaction 1 is sent to only the 1 st node of each node group and transaction 2 is sent to only the 2 nd node … … of each node group and transaction N is sent to the nth node of the node group.
As a still further scheme of the invention: in S4, if one hundred nodes are sequentially added, after transaction 1 sends out information, after receiving the transaction information of transaction 1, node 1 in the node group records the transaction information and synchronizes to other nodes in the node group, that is, synchronizes to nodes 2 to 20, and nodes 2 to 20 record the same transaction record information sent by node 1.
As a still further scheme of the invention: in S5, for the same transaction, the transaction information recorded by each node in the node group is the same, and can be regarded as one piece of information, that is, the same transaction, where node group 1 is one piece of recorded information, node group 2 is one piece of information, and node group 3 is one piece of information … …, and node group N is one piece of information.
Compared with the prior art, the invention has the beneficial effects that: the invention designs a new block chain consensus mechanism, which is characterized in that during actual operation, a plurality of node groups are added into a network block chain, and each node group is internally provided with a plurality of nodes, so that the more the number of the nodes is, the more the nodes in the node groups are, the more the transaction amount can be received at the same time, and further the consensus efficiency of the nodes can be accelerated.
Drawings
Fig. 1 is a schematic diagram of a synchronization algorithm in a node group and a fault-tolerant algorithm in the node group in a new blockchain consensus mechanism.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, in an embodiment of the present invention, a new blockchain consensus mechanism is applied in a blockchain network to establish a transaction node in a network blockchain, including the following steps:
s1, dividing all nodes in the block chain into a plurality of node groups, namely a node group 1, a node group 2 and a node group 3 … … node group N, wherein each node group comprises a plurality of nodes, namely a node 1, a node 2 and a node 3 … … node N;
the number of the node groups is not less than 4, the number of the nodes in a single node group is not less than 4, and under the same condition, the more the number of the nodes in the single node group is, the better the node group is, so that the consensus efficiency is improved under the condition that the number of the nodes is increased;
s2: and then the node groups are sequentially ordered according to the sequence of adding the nodes into the network, and the node adding condition is as follows:
if one hundred nodes are sequentially added and divided into 5 node groups, and each node group is 20 nodes, the transaction 1 is simultaneously sent to the first node of each node group, that is, the corresponding node numbers are respectively: 1. 21, 41, 61, 81, and a fault-tolerant algorithm is used among each node group;
s3, further, the transaction flow sequentially enters into the blockchain network, and is divided into a plurality of transactions 1, 2, and 3 … …, and the case that each transaction occurs information to each node group is:
transaction 1 is sent to only the 1 st node of each node group, transaction 2 is sent to only the 2 nd node … … of each node group and transaction N is sent to the nth node of the node group;
s4, when the node 1 of the node group receives the transaction information, recording the transaction information, and synchronizing to other nodes of the node group, so that the other nodes in the single node group all record the same transaction record information sent by the node 1, for example: if one hundred nodes are added in sequence, after the transaction 1 sends information, the node 1 in the node group receives the transaction information of the transaction 1, records the transaction information and synchronizes to other nodes of the node group, namely synchronizes to the node 2 to the node 20, and the node 2 to the node 20 record the same transaction record information sent by the node 1, so as to realize synchronization in the node group;
s5, for the same transaction, the transaction information recorded by each node in the node group is the same, and can be regarded as one piece of information, that is, the same transaction, the node group 1 is one piece of recorded information, the node group 2 is one piece of information, the node group 3 is one piece of information … …, the node group N is one piece of information, and further, the whole of each node group is regarded as one piece of information: namely N pieces of information can be regarded among N node groups;
the N parts of information adopt a fault-tolerant algorithm: namely N parts of information, f parts of abnormal information (different from other node data) satisfies N > =3f + 1;
if the fault tolerance algorithm is met, the transaction can be regarded as correct data, i.e. the transaction is successful.
In conclusion, all nodes in the block chain network are grouped, then a transaction stream enters the network block chain in sequence, so that the transaction 1 is only sent to the 1 st node of each node group, the transaction 2 is only sent to the 2 nd node of each node group, and by analogy, the transaction N is sent to the Nth node of each node group, after the node 1 of each node group receives transaction information, the transaction information is recorded and synchronized to other nodes of the node group, so that other nodes in a single node group can record the same transaction record information sent by the node 1, and synchronization in the node group is realized;
and the more the number of nodes added in the network block chain, the more the nodes in the node group, and the more the transaction amount which can be received at the same time, so as to accelerate the consensus efficiency of the nodes.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned.
Furthermore, it should be understood that although the present description refers to embodiments, not every embodiment may contain only a single embodiment, and such description is for clarity only, and those skilled in the art should integrate the description, and the embodiments may be combined as appropriate to form other embodiments understood by those skilled in the art.
Claims (6)
1. A new blockchain consensus mechanism is applied to a blockchain network, wherein a transaction node is established in a network blockchain, and the method comprises the following steps:
s1, dividing all nodes in the block chain into a plurality of node groups, namely a node group 1, a node group 2 and a node group 3 … … node group N, wherein each node group comprises a plurality of nodes, namely a node 1, a node 2 and a node 3 … … node N;
s2: then the node groups are sequentially ordered according to the sequence of adding the nodes into the network, and a fault-tolerant algorithm is used among each node group;
s3, further, the transaction flow sequentially enters a block chain network and is divided into a plurality of transactions 1, 2 and 3 … …;
s4, when the node 1 of the node group receives the transaction information, recording the transaction information, and synchronizing to other nodes of the node group, so that other nodes in a single node group can record the same transaction record information sent by the node 1;
s5, for the same transaction: regarding each node group as a whole as one piece of information: namely N pieces of information can be regarded among N node groups;
the N parts of information adopt a fault-tolerant algorithm: namely N parts of information, f parts of abnormal information (different from other node data) satisfies N > =3f + 1;
if the fault tolerance algorithm is met, the transaction can be regarded as correct data, i.e. the transaction is successful.
2. The mechanism as claimed in claim 1, wherein the number of node groups in S1 is not less than 4, and the number of nodes in a single node group is not less than 4.
3. The mechanism as claimed in claim 1, wherein the node in S2 adds: if one hundred nodes are sequentially added and divided into 5 node groups, and each node group is 20 nodes, the transaction 1 is simultaneously sent to the first node of each node group, that is, the corresponding node numbers are respectively: 1. 21, 41, 61, 81.
4. The mechanism as claimed in claim 1, wherein the condition that each transaction occurrence information is given to each node group in S3 is: transaction 1 is sent to only the 1 st node of each node group and transaction 2 is sent to only the 2 nd node … … of each node group and transaction N is sent to the nth node of the node group.
5. The mechanism as claimed in claim 1, wherein in S4, if one hundred nodes are added in sequence, after transaction 1 sends out information, after node 1 in the node group receives the transaction information of transaction 1, the transaction information is recorded and synchronized to other nodes in the node group, i.e. synchronized to node 2 to node 20, and node 2 to node 20 record the same transaction record information sent by node 1.
6. The mechanism of claim 1, wherein in S5, for the same transaction, the transaction information recorded by each node in the node group is the same and can be regarded as one piece of information, i.e. the same transaction, and node group 1 is one piece of recorded information, node group 2 is one piece of information, and node group 3 is one piece of information … …, and node group N is one piece of information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911054275.2A CN110751563A (en) | 2019-10-31 | 2019-10-31 | Novel block chain consensus mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911054275.2A CN110751563A (en) | 2019-10-31 | 2019-10-31 | Novel block chain consensus mechanism |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110751563A true CN110751563A (en) | 2020-02-04 |
Family
ID=69281621
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911054275.2A Pending CN110751563A (en) | 2019-10-31 | 2019-10-31 | Novel block chain consensus mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110751563A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111639129A (en) * | 2020-05-24 | 2020-09-08 | 中信银行股份有限公司 | Transaction processing method and device, electronic equipment and computer-readable storage medium |
| CN117478299A (en) * | 2023-12-27 | 2024-01-30 | 湖南天河国云科技有限公司 | Block chain consensus algorithm switching method, device and computer equipment |
-
2019
- 2019-10-31 CN CN201911054275.2A patent/CN110751563A/en active Pending
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111639129A (en) * | 2020-05-24 | 2020-09-08 | 中信银行股份有限公司 | Transaction processing method and device, electronic equipment and computer-readable storage medium |
| CN117478299A (en) * | 2023-12-27 | 2024-01-30 | 湖南天河国云科技有限公司 | Block chain consensus algorithm switching method, device and computer equipment |
| CN117478299B (en) * | 2023-12-27 | 2024-03-01 | 湖南天河国云科技有限公司 | Block chain consensus algorithm switching method, device and computer equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107169865B (en) | Asset data processing system based on block chain technology | |
| CN106991607B (en) | Disordered transaction control method based on block chain account model | |
| CN108600353A (en) | A kind of parallel block synchronization method of block chain node | |
| CN110751563A (en) | Novel block chain consensus mechanism | |
| CN103856392A (en) | Message push method, outgoing server using message push method and outgoing server system | |
| CN113347164B (en) | Block chain-based distributed consensus system, method, device and storage medium | |
| CN111046109B (en) | Cross-chain task processing method, device, equipment and readable storage medium | |
| CN108366113B (en) | High fault-tolerant consensus mechanism of grouping based on DPOS | |
| WO2019101242A3 (en) | System and method for ending view change protocol | |
| CN106992966B (en) | Network information transmission implementation method for true and false messages | |
| CN111478795A (en) | Alliance block chain network consensus method based on mixed Byzantine fault tolerance | |
| CN109214817A (en) | A kind of block chain common recognition device based on calculation power parasitism | |
| CN115797070B (en) | Block chain transaction method, device and system based on man-in-the-middle account incentive | |
| CN109918044B (en) | Block chain technology-based drawing/sorting method | |
| CN109672733B (en) | Account book synchronization method and device based on DAG block chain | |
| EP2611109B1 (en) | System for high reliability and high performance application message delivery | |
| CN101561795A (en) | Method and device for synchronizing data in distribution-type system | |
| CN106656522A (en) | Data calculation method and system of cross-data center | |
| CN116707759B (en) | Lightweight alliance chain consensus method for high concurrency scene of data flow | |
| CN111082924B (en) | Election type Bayesian-busy family fault-tolerant consensus method based on workload demonstration | |
| CN106874341A (en) | A kind of database synchronization method | |
| CN115664724A (en) | Consensus method in block chain system, block chain system and consensus node | |
| CN111597268B (en) | Block chain extension method, block chain node and block chain system | |
| CN106599326A (en) | Duplication eliminating method and system for recorded data under cloud architecture | |
| CN114827176A (en) | Method and system for defending Sybil attack in distributed storage system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200204 |