CN112468552A - Lightweight reputation consensus realization method of double-layer distributed block chain network model - Google Patents
Lightweight reputation consensus realization method of double-layer distributed block chain network model Download PDFInfo
- Publication number
- CN112468552A CN112468552A CN202011278222.1A CN202011278222A CN112468552A CN 112468552 A CN112468552 A CN 112468552A CN 202011278222 A CN202011278222 A CN 202011278222A CN 112468552 A CN112468552 A CN 112468552A
- Authority
- CN
- China
- Prior art keywords
- block
- node
- reputation
- value
- consensus
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The invention discloses a lightweight credit consensus realization method of a double-layer distributed block chain network model, which comprises the following steps that 1, a current cluster node participating in consensus acquires the latest block information of a local block chain, and the signature of the next block to be generated is calculated according to the latest block signature and the ID of a latest block generator; step 2, sending the signature and block height of the next block to a consensus algorithm program for processing; step 3, the current cluster nodes participating in consensus pack the transaction and related information in the transaction pool into blocks, broadcast the blocks to a block chain network, and participate in block competition of the current block higher than the current block; finally, the block producer with the smallest Deadline attribute value obtains the block right. Compared with the prior art, the invention can improve the expandability of the block chain network and the safety and stability of the system, and effectively balances the contradiction between the safety and the expandability.
Description
Technical Field
The invention mainly relates to a block chain network, a consensus mechanism and a credit system, in particular to a lightweight credit consensus method of a block chain network model
Background
With the big fire of the block chain technology in the field of digital currency, people gradually find great value. However, the blockchain technique still has a large disadvantage in scalability, which mainly manifests in two aspects: the performance is not enough to support the actual service, and the storage capacity cannot be continuously expanded. The security and reliability of the blockchain system depend on the distributed consensus of the participation of the multiple nodes, and the more and the safer the nodes are. However, the cost of distributed consensus increases greatly as the number of nodes increases, so that the performance of the blockchain cannot meet the requirements. The continuous increase in the amount of data also places a tremendous amount of data redundancy and storage pressure on the blockchain system. The research on the expandability of the block chain has attracted extensive attention in academia and industry, and the scheme is endlessly developed, but the related technology is still in the early development stage and needs further optimization and perfection.
Ideally, as the number of block link points increases, the throughput and storage capacity of a block link system with good scalability should increase accordingly. However, in the existing blockchain network structure, there is a mutually restricted relationship between the security, decentralization and scalability of the system. The simple addition of the blockchain nodes can only result in a larger redundancy degree of data, and the storage pressure of a single node cannot be reduced. And the increased delay in the synchronization of the blocks, due to the need to be consistent among more nodes, reduces the throughput of the blockchain system. Therefore, to improve the scalability of blockchain systems, it is an object herein to improve the blockchain network structure.
In addition, in the blockchain system, the main content of the consensus mechanism is that a new block is authorized to participate in competition or become a candidate, and a node which successfully competes or becomes a candidate broadcasts the new block to the whole network, and the block is approved and accepted by the whole network so as to achieve distributed consensus. The consensus mechanism guarantees trust among nodes in the blockchain system. The block chain nodes do not need to trust each other, and a centralized mechanism does not need to provide trust certification or identity certification. As long as all users follow and run a unified blockchain protocol, public transparent, non-tamperable data storage and transaction can be achieved. At present, the mainstream consensus mechanism in the block chain system includes a workload proving mechanism, a rights and interests proving mechanism, a shares authorizing mechanism, a Byzantine consensus mechanism, and the like. However, improvements to blockchain network architectures necessitate a re-adaptation and design of consensus mechanisms to offset some of the security sacrificed by increased scalability.
Disclosure of Invention
In order to solve the technical problems, the invention provides a lightweight reputation consensus realization method of a double-layer distributed block chain network model, which realizes a lightweight consensus mechanism based on reputation by using the double-layer distributed block chain network model of distributed consensus and distributed storage.
The invention discloses a lightweight reputation consensus realization method of a double-layer distributed block chain network model, which specifically comprises the following steps:
step 1: a main node in a current cluster participating in consensus acquires the latest block information of a local block chain, and calculates the signature of the next block to be generated according to the latest block signature and the latest block generator ID;
step 2: sending the signature and block height of the next block to a consensus algorithm program; the consensus algorithm program performs the following operations:
the consensus algorithm program calculates the signature of the current block according to the signature of the previous block and the number of the previous node, and then calculates the hash value of the current block according to the signature and the block height of the current block, wherein the signature GenSig (i, j) of the current block is defined by formula (1), and the hash value GenHash (i, j) of the current block is defined by formula (2);
GenSig(i,j)＝Hash(GenSig(i-1,j-1),BlockGeni-1) (1)
among them, BlockGeni-1GenSig (i-1, j-1) generates a signature of a j-1 block for the i-1 node as the number of the i-1 node;
GenHash(i,j)＝Hash(GenSig(i,j),BlockHeigh tj) (2)
wherein, Block heightjBlock height for jth block;
the consensus algorithm program carries out remainder operation on the hash values, storage positions of a large number of hash values in the Plot file are calculated, and the specific hash storage position ScoopNo. (i, j) is defined by the formula (3);
ScoopNo.(i,j)＝GenHash(i,j)％4096 (3)
obtaining attribute values of a current node basic credit, a growth credit and a social credit, and calculating a current node credit value, wherein a specific calculation formula is elaborated in detail below;
calculating all targets and selecting the minimum value in the located multiple hash values by the consensus algorithm program, wherein the Target value Target (i, j) of the jth block of the ith node is defined by formula (4);
target(i,j)＝Hash(Scoopdata(i,j),GenSig(i,j)) (4)
wherein, Scoopdata (i, j) is the located specific hash value;
solving the Deadline of the block output of the current block according to the node reputation value and Target, wherein a specific calculation formula is defined by formula (5);
wherein, ReiThe reputation value of the ith node is taken as the base target value;
adding the calculated Deadline into the next block to be generated by the consensus algorithm program;
and step 3: the main nodes participating in the consensus pack the transaction and related information in the transaction pool into blocks, broadcast the blocks to a block chain network, and participate in block competition higher than the current block;
finally, the block producer with the smallest Deadline attribute value obtains the block right.
Compared with the prior art, the invention can improve the expandability of the block chain network and the safety and stability of the system, and effectively balances the contradiction between the safety and the expandability.
Drawings
FIG. 1 is a diagram of a two-tier distributed blockchain network model according to an embodiment of the present invention;
FIG. 2 is a lightweight reputation consensus mechanism of an embodiment of the present invention;
fig. 3 is an overall flowchart of a lightweight reputation consensus implementation method of a double-layer distributed blockchain network model according to the present invention.
Detailed Description
The structure, function and operation of the frame according to the present invention will be described in detail below with reference to the accompanying drawings and embodiments.
As shown in fig. 1, a two-layer distributed blockchain network model according to an embodiment of the present invention is shown. Through introduction of cluster nodes, a traditional block chain network is clustered, different roles and tasks are given to the nodes, and various transactions in the block chain are efficiently completed through cooperation, credit evaluation and election algorithms between a main node and a slave node. Finally, the decentralized characteristic is guaranteed through the first-layer distributed consensus among the cluster nodes, and the expandability of the system is improved through the second-layer distributed storage in the cluster nodes, so that the dual improvement of the performance and the expandability is realized.
In the network model, three node types include a cluster node, a master node, and a slave node.
In the blockchain network structure of the present invention:
(1) cluster node
A cluster node is composed of a main node and a plurality of slave nodes. All cluster nodes communicate through a P2P network protocol, and a distributed consensus mechanism is agreed to finally form a block chain network. The cluster nodes are functionally the same as all nodes in a traditional block chain, but more mechanisms are arranged inside the cluster nodes to solve the problems of task allocation and resource fairness of the master nodes and the slave nodes. The cluster nodes store the full amount of data of the blockchain, which is spread over the distributed nodes within the cluster nodes. The cluster nodes cooperate with each other to jointly complete the common identification and update of all the transactions in the block chain network.
(2) Master node
The cluster node is a central pivot of the cluster node, and is externally responsible for communication, synchronization and consensus with other logic nodes and internally responsible for communication and data interaction with slave nodes. In the cluster node, in order to ensure fairness and safety, the master node is not constant, but the switching between the master node and the slave node is realized by an election algorithm.
(3) Slave node
The main function of the slave node is to share the storage pressure of the master node, so that the storage is expandable. In addition, the slave nodes are also candidate nodes of the master node, and when the re-election of the master node is triggered, a new master node is selected from the slave nodes. In order to ensure that the system operates stably for a long time under the network structure, performance balance among cluster nodes needs to be considered. The public link of the blockchain is global-oriented, any node can be added and withdrawn, and in such an environment, the performance of the nodes can have large difference. Therefore, when the blockchain is created, the logical nodes need to be divided according to a certain strategy, and in the running process of the blockchain, the addition and rotation of the nodes in the cluster nodes need to be dynamically adjusted.
In the Proof of Capacity (POC), the common identification block between distributed nodes is determined by a Deadline value, which is the waiting time from the last block to the next block. In the process of one block output, a node with the minimum Deadline value is selected to give the block output weight. The value of the Deadline is mainly affected by the size of the storage capacity of the node, and the greater the storage capacity is, the greater the probability that the value of the Deadline is the minimum is. For nodes participating in consensus, the smaller the Deadline value is, the greater the probability of obtaining the block weight is, and the time for obtaining the block weight can also be shortened. Therefore, for the blockchain system, increasing the overall storage capacity of the system will increase the overall speed, thereby increasing the TPS. The Proof of Reputation of Capacity (POCR) proposed by the present invention is to integrate the Reputation influence of the node into the calculation formula of the Deadline. The de-blocking parameter Deadline that a node can obtain is not only determined by storage capacity, but also depends on its own reputation value. The higher the reputation value is, the smaller the Deadline is, the higher the probability of obtaining the block weights is, and the shorter the interval between block outputs is. Thus, enhancing the overall reputation of the system also results in an effective boost for the TPS.
As shown in fig. 2, a common identification process of a POCR is shown, and for the blockchain system, a common identification process mainly refers to a globally acknowledged block generation and broadcast synchronization thereof. Among them is how the globally approved block is generated and approved by all distributed nodes. The POCR of the invention integrates the excellent ideas of capacity consensus and reputation consensus, enhances the safety of the system to a certain extent and reduces the resource consumption of the system.
As shown in fig. 3, a method for implementing lightweight reputation consensus of a double-layer distributed blockchain network model according to the present invention is described as follows:
step 1: the current node participating in consensus acquires the latest block information of the local block chain, and calculates the signature of the next block to be generated according to the latest block signature and the latest block generator ID;
step 2: sending the signature and block height of the next block to a consensus algorithm program;
the consensus algorithm program performs the following operations:
the consensus algorithm program calculates the signature of the current block according to the signature of the previous block and the number of the previous node, and then calculates the hash value of the current block according to the signature and the block height of the current block, wherein the signature GenSig (i, j) of the current block is defined by formula (1), and the hash value GenHash (i, j) of the current block is defined by formula (2);
GenSig(i,j)＝Hash(GenSig(i-1,j-1),BlockGeni-1) (1)
among them, BlockGeni-1GenSig (i-1, j-1) generates a signature of the j-1 block for the i-1 node as the number of the i-1 node.
GenHash(i,j)＝Hash(GenSig(i,j),BlockHeigh tj) (2)
Wherein, Block heightjIs the block height of the jth block.
The consensus algorithm program carries out remainder operation on the hash values, storage positions of a large number of hash values in the Plot file are calculated, and the specific hash storage position ScoopNo. (i, j) is defined by the formula (3);
ScoopNo.(i,j)＝GenHash(i,j)％4096 (3)
obtaining attribute values of a current node basic credit, a growth credit and a social credit, and calculating a current node credit value, wherein a specific calculation formula is elaborated in detail below;
calculating all targets and selecting the minimum value in the located multiple hash values by the consensus algorithm program, wherein the Target value Target (i, j) of the jth block of the ith node is defined by formula (4);
target(i,j)＝Hash(Scoopdata(i,j),GenSig(i,j)) (4)
wherein, Scoopdata (i, j) is the located specific hash value.
Solving the Deadline of the block output of the current block according to the node reputation value and Target, wherein a specific calculation formula is defined by formula (5);
wherein, ReiThe reputation value of the ith node is the base target value defined by the system initialization.
Adding the calculated Deadline into the next block to be generated by the consensus algorithm program;
and step 3: and packaging the transaction and related information in the transaction pool into blocks by the current nodes participating in consensus, broadcasting the blocks into a block chain network, and participating in block competition higher than the current block. And finally, obtaining the block weight by the block producer with the minimum Deadline attribute value.
The reputation of each node includes a base reputation, a growth reputation, and a social reputation. Wherein the base reputation represents the hardware facility capability of the node, the growth reputation represents the contribution of the node to the system, and the social reputation represents whether the behavior of the node is trustworthy. The three dimensions jointly determine the reputation condition of the node, so that the fairness and the rationality of the evaluation system are enhanced.
When the blockchain system is successfully created, the whole network is opened to register and join. When a new node joins the block chain, the new node is distributed into a logic node to become a slave node of a main node in the logic node, participates in relevant transactions of the block chain, calculates the basic credit of the node and uploads the basic credit to the block chain account book. The base reputation includes the hard disk capacity, CPU capability, bandwidth size, and node type of the node. The node types are divided into common nodes and trusted nodes. Trusted nodes include government agencies, banks, universities, and the like. The following is a calculation of the base reputation, wherein the hard disk capacity factor CptFiIs defined by formula (6). cpu factor CpuFiIs defined by formula (7). Bandwidth factor BWFiIs defined by formula (8). Node type factor TypeFiThe method mainly includes two categories, namely a trusted node and a common node, wherein the trusted node generally comprises organizations such as governments, banks and universities which pass identity verification, and is defined by formula (9). Base reputation base ReiIs defined by formula (10).
Wherein, CptiIs the hard disk capacity value, Cpt, of the ith nodemaxThe maximum value of the hard disk capacity of the node in the current block chain system.
Wherein, CpuiCpu Performance value, Cpu, for the ith nodemaxIs the maximum value of the cpu performance of the node in the current blockchain system.
Wherein, BWiIs the bandwidth value, BW, of the ith nodemaxIs at presentMaximum value of node bandwidth in a blockchain system.
BaseRei＝CapacityFi+CpuFi+BWFi+TypeF(0≤BaseRei≤4) (10)
After a node joins the blockchain system, its own monetary assets and actions directly affect the node's growing reputation. Having more virtual currency issued by current blockchain systems places more attention on the safe and stable operation of the system, and may have greater willingness to maintain the system, having more positive actions may better serve the system. Thus, the growth reputation of a node includes online time, number of tokens held, and number of days spent holding. The following is a calculation of growth reputation, where the online time factor TFiA coin age factor CAF defined by formula (11)iDefined by the formulas (12) and (13), growth reputation growniIs defined by formula (14).
Wherein, TOLiIs the on-line time of the ith node, CurTiIs the current time of the ith node, TERiIs the registration time of the ith node.
CoinAi＝CoinNi·CoinDi (12)
Wherein, CNiThe number of held coins of the ith node; CD (compact disc)iThe number of currency holding days of the ith node.
Wherein, CAiThe currency age of the ith node; CAmaxThe node currency age is the maximum value in the current block chain system.
GrowingRei＝TimeFi+CoinAFi(0≤GrowingRei≤4) (14)
During the process of assuming block chain transaction, the node has different behaviors. These actions may directly affect the social reputation of the node. The social reputation includes the cheating behavior, the honesty behavior, the number of verified transactions, and the number of node out blocks. The cheating behaviors include double-flower attacks, forged transaction signatures, denial of service attacks, lazy authentication (only submitting old transaction authentication results each time, not authenticating new transactions), and the like. It is specified herein that whenever a node has a cheating action, its social reputation and growth reputation will be zeroed. The following is a formula for calculating social reputation, where honest behavior is HonestBiHBiIs defined by formula (15). The cheating behaviors mainly comprise the behaviors of double-flower attack, lazy-Han verification and the like. Social reputation socialReiDefined by equation (16), mainly by the honest behavior of the nodes, HonestBiHBiAnd (5) characterizing.
Wherein, tranViVerifying the number of transactions for the ith node, Block ViPacking the number of blocks for the ith node; TranVmaxVerifying the maximum value of the transaction number, Block V, for the nodes in the current blockchain systemmaxPacking the maximum value of the block quantity for the nodes in the current block chain system;
SocialRei＝HonestBi(0≤SocialRei≤4) (16)
each update of the node reputation is stored in the block chain, and the reputation value of some other node can be queried through any node.
Node reputation nodeReiIs defined by the formula (17), and the formula (18) is the result Re after the node reputation normalizationi。
NodeRei＝BaseRei+GrowingRei+SocialRei(0≤NodeRei≤12) (17)
The invention 1) comprehensively evaluates the credit values of the nodes through indexes such as capability, behavior and contribution, so that the nodes with different roles respectively play roles, cooperate with each other and restrict each other; 2) by evaluating the credit of all block link points, the nodes which have honest behaviors and sufficiently contribute to the system are guaranteed to undertake important work in the system, so that the safety and the stability of the system are guaranteed; 3) clustering nodes in a block chain network, and improving the expandability of the system by introducing a double-layer distributed architecture; 4) and an evaluation system for measuring the node reputation value is provided.
Claims (2)
1. A lightweight reputation consensus realization method of a double-layer distributed block chain network model is characterized by specifically comprising the following steps:
step 1: a main node in a current cluster participating in consensus acquires the latest block information of a local block chain, and calculates the signature of the next block to be generated according to the latest block signature and the latest block generator ID;
step 2: sending the signature and block height of the next block to a consensus algorithm program; the consensus algorithm program performs the following operations:
the consensus algorithm program calculates the signature of the current block according to the signature of the previous block and the number of the previous node, and then calculates the hash value of the current block according to the signature and the block height of the current block, wherein the signature GenSig (i, j) of the current block is defined by formula (1), and the hash value GenHash (i, j) of the current block is defined by formula (2);
GenSig(i,j)＝Hash(GenSig(i-1,j-1),BlockGeni-1) (1)
among them, BlockGeni-1GenSig (i-1, j-1) generates a signature of a j-1 block for the i-1 node as the number of the i-1 node;
GenHash(i,j)＝Hash(GenSig(i,j),BlockHeigh tj) (2)
wherein, Block heightjBlock height for jth block;
the consensus algorithm program carries out remainder operation on the hash values, storage positions of a large number of hash values in the Plot file are calculated, and the specific hash storage position ScoopNo. (i, j) is defined by the formula (3);
ScoopNo.(i,j)＝GenHash(i,j)％4096 (3)
obtaining attribute values of a current node basic credit, a growth credit and a social credit, and calculating a current node credit value, wherein a specific calculation formula is elaborated in detail below;
calculating all targets and selecting the minimum value in the located multiple hash values by the consensus algorithm program, wherein the Target value Target (i, j) of the jth block of the ith node is defined by formula (4);
target(i,j)＝Hash(Scoopdata(i,j),GenSig(i,j)) (4)
wherein, Scoopdata (i, j) is the located specific hash value;
solving the Deadline of the block output of the current block according to the node reputation value and Target, wherein a specific calculation formula is defined by formula (5);
wherein, ReiThe reputation value of the ith node is taken as the base target value;
adding the calculated Deadline into the next block to be generated by the consensus algorithm program;
and step 3: the main nodes participating in the consensus pack the transaction and related information in the transaction pool into blocks, broadcast the blocks to a block chain network, and participate in block competition higher than the current block;
finally, the block producer with the smallest Deadline attribute value obtains the block right.
2. The method for implementing lightweight reputation consensus of a two-tier distributed blockchain network model according to claim 1, wherein the calculation of the current node reputation value is as follows:
the basic credit comprises the hard disk capacity, the CPU capacity, the bandwidth size and the node type of the node;
base reputation base ReiIs defined by the formula:
BaseRei＝CapacityFi+CpuFi+BWFi+TypeF
relevant parameters in the above formula include:
CptFithe following is defined for the hard disk capacity factor:
wherein, CptiIs the hard disk capacity value, Cpt, of the ith nodemaxThe maximum value of the capacity of the node hard disk in the current block chain system is obtained;
CpuFithe cpu factor is defined as follows for the base reputation:
wherein, CpuiCpu Performance value, Cpu, for the ith nodemaxThe maximum value of the performance of the cpu of the node in the current block chain system is obtained;
BWFithe following is defined for the bandwidth factor:
wherein, BWiIs the bandwidth value, BW, of the ith nodemaxThe maximum value of the node bandwidth in the current block chain system;
TypeFithe following is defined for the node type factor:
the growth credit comprises online time, the number of held coins and the number of held coins, wherein:
on-line time factor TFiThe definition is as follows:
wherein, TOLiIs the on-line time of the ith node, CurTiIs the current time of the ith node, TERiIs the registration time of the ith node;
age of coin factor CAFiThe definition is as follows:
CoinAi＝CoinNi·CoinDi
wherein, CNiNumber of tokens, CD, for the ith nodeiNumber of days spent for ith node, CAiIs the age of the coin of the ith node, CAmaxThe maximum value of the node currency age in the current block chain system is obtained;
growth reputation growth ReiThe definition is as follows:
GrowingRei＝TimeFi+CoinAFi
the social reputation comprises cheating behavior, honesty behavior, the number of verification transactions and the number of node blocks; honest implementation of HonestBiHBiThe definition is as follows:
wherein, tranViVerifying the number of transactions for the ith node, Block ViPacking the number of blocks for the ith node; TranVmaxVerifying the maximum number of transactions for a node in a current blockchain systemLarge value, Block VmaxPacking the maximum value of the block quantity for the nodes in the current block chain system;
social reputation socialReiThe definition is as follows:
SocialRei＝HonestBi
each time the node reputation is updated, the node reputation is stored in the block chain, and any node can inquire the reputation value of a certain node;
node reputation nodeReiThe definition is as follows: NodeRei＝αBaseRei+βGrowingRei+γSocialRei
The result after node reputation normalization is defined as follows:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011278222.1A CN112468552B (en) | 2020-11-16 | 2020-11-16 | Lightweight reputation consensus realization method of double-layer distributed blockchain network model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011278222.1A CN112468552B (en) | 2020-11-16 | 2020-11-16 | Lightweight reputation consensus realization method of double-layer distributed blockchain network model |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112468552A true CN112468552A (en) | 2021-03-09 |
| CN112468552B CN112468552B (en) | 2023-06-30 |
Family
ID=74837575
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011278222.1A Active CN112468552B (en) | 2020-11-16 | 2020-11-16 | Lightweight reputation consensus realization method of double-layer distributed blockchain network model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112468552B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113256149A (en) * | 2021-06-11 | 2021-08-13 | 武汉龙津科技有限公司 | Block chain node reputation adjusting method and device, electronic equipment and storage medium |
| CN113553380A (en) * | 2021-07-23 | 2021-10-26 | 东北大学 | Reputation-behavior association-oriented data traceability system with double block chains |
| CN113645074A (en) * | 2021-08-11 | 2021-11-12 | 永旗(北京)科技有限公司 | Consensus method based on block chain |
| CN114258015A (en) * | 2021-12-23 | 2022-03-29 | 成都三零瑞通移动通信有限公司 | Cluster terminal out-of-control prevention method and system based on whole network consensus |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109767199A (en) * | 2018-12-10 | 2019-05-17 | 西安电子科技大学 | PBFT common recognition system and method, block chain data processing system based on prestige |
| CN110245956A (en) * | 2019-05-15 | 2019-09-17 | 众安信息技术服务有限公司 | A kind of block chain transaction confirmation method and system based on asynchronous multichain |
-
2020
- 2020-11-16 CN CN202011278222.1A patent/CN112468552B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109767199A (en) * | 2018-12-10 | 2019-05-17 | 西安电子科技大学 | PBFT common recognition system and method, block chain data processing system based on prestige |
| CN110245956A (en) * | 2019-05-15 | 2019-09-17 | 众安信息技术服务有限公司 | A kind of block chain transaction confirmation method and system based on asynchronous multichain |
Non-Patent Citations (4)
| Title |
|---|
| TING LI等: "《Blockchain Technology Based Decentralized Energy Trading for Multiple-Microgrid System》", 《PREPRINTS OF THE 3RD IEEE CONFERENCE ON ENERGY INTERNET AND ENERGY SYSTEM INTEGRATION》 * |
| YANCHAO ZHU等: "《SEBDB：Semantics Empowered BlockChain DataBase》", 《2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING （ICDE）》 * |
| 李亚楠: "《基于区块链的数据存储应用研究》", 《北京交通大学硕士学位论文》 * |
| 李昊轩: "《基于区块链的可修改信誉评价系统的设计与分析》", 《西安电子科技大学硕士学位论文》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113256149A (en) * | 2021-06-11 | 2021-08-13 | 武汉龙津科技有限公司 | Block chain node reputation adjusting method and device, electronic equipment and storage medium |
| CN113553380A (en) * | 2021-07-23 | 2021-10-26 | 东北大学 | Reputation-behavior association-oriented data traceability system with double block chains |
| CN113553380B (en) * | 2021-07-23 | 2023-07-28 | 东北大学 | Reputation-behavior association-oriented data tracing system for double-block chain |
| CN113645074A (en) * | 2021-08-11 | 2021-11-12 | 永旗(北京)科技有限公司 | Consensus method based on block chain |
| CN114258015A (en) * | 2021-12-23 | 2022-03-29 | 成都三零瑞通移动通信有限公司 | Cluster terminal out-of-control prevention method and system based on whole network consensus |
| CN114258015B (en) * | 2021-12-23 | 2023-10-24 | 成都三零瑞通移动通信有限公司 | Method and system for preventing cluster terminal from being out of control based on whole network consensus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112468552B (en) | 2023-06-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110163600B (en) | Block chain system and method using the same | |
| CN112468552A (en) | Lightweight reputation consensus realization method of double-layer distributed block chain network model | |
| Zhou et al. | Solutions to scalability of blockchain: A survey | |
| US11177939B2 (en) | Blockchain system including a distributed network of a plurality of nodes and a method for achieving an agreement between the plurality of nodes executed by processors of the block chain system | |
| US20200059369A1 (en) | Determining consensus by parallel proof of voting in consortium blockchain | |
| Yu et al. | Proof-of-QoS: QoS based blockchain consensus protocol | |
| CN110611701B (en) | Parameter configuration and transaction processing method based on block chain | |
| Wang et al. | Beh-Raft-Chain: a behavior-based fast blockchain protocol for complex networks | |
| Singh et al. | A survey and taxonomy of consensus protocols for blockchains | |
| Du et al. | MBFT: A new consensus algorithm for consortium blockchain | |
| CN114626547A (en) | Group collaborative learning method based on block chain | |
| Liu et al. | Ltsm: Lightweight and trusted sharing mechanism of iot data in smart city | |
| CN114938292B (en) | Multi-level optimization PBFT consensus method based on node credibility | |
| Zhao | Comparison of hyperledger fabric and ethereum blockchain | |
| Xi et al. | A comprehensive survey on sharding in blockchains | |
| CN112187866A (en) | Novel block chain consensus method based on shared storage | |
| Gao et al. | Improved byzantine fault-tolerant algorithm based on alliance chain | |
| Nguyen et al. | StakeDag: Stake-based consensus for scalable trustless systems | |
| Al-Musharaf et al. | Improving blockchain consensus mechanism via network clusters | |
| CN111222885A (en) | Data processing request endorsement method and device, computer equipment and storage medium | |
| Materwala et al. | Secure and privacy-preserving lightweight blockchain for energy trading | |
| Leduc et al. | Sabine: Self-Adaptive BlockchaIn coNsEnsus | |
| KR102386922B1 (en) | Blockchain system | |
| Wu et al. | Blockchain consensus mechanism for distributed energy transactions | |
| Ameri et al. | The cellular goore game-based consensus protocol: a cognitive model for blockchain consensus |
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 |