CN112468552B - Lightweight reputation consensus realization method of double-layer distributed blockchain network model - Google Patents
Lightweight reputation consensus realization method of double-layer distributed blockchain network model Download PDFInfo
- Publication number
- CN112468552B CN112468552B CN202011278222.1A CN202011278222A CN112468552B CN 112468552 B CN112468552 B CN 112468552B CN 202011278222 A CN202011278222 A CN 202011278222A CN 112468552 B CN112468552 B CN 112468552B
- Authority
- CN
- China
- Prior art keywords
- node
- block
- reputation
- value
- current
- 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
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- General Health & Medical Sciences (AREA)
- Bioethics (AREA)
- Computer Hardware Design (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a realization method of lightweight reputation consensus of a double-layer distributed blockchain network model, which comprises the following steps that step 1, current cluster nodes participating in consensus acquire the latest block information of a local blockchain, and the signature of a next block to be generated is calculated according to the latest block signature and the ID of a latest block generator; step 2, the signature and the block height of the next block are sent to a consensus algorithm program for processing; step 3, the current cluster node participating in consensus packages the transaction and related information in the transaction pool into blocks, broadcasts the blocks to a block chain network and participates in the block out competition of the current block height; finally, the block producer with the smallest loadline attribute value obtains the block out weight. Compared with the prior art, the invention can improve the expandability of the blockchain 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 blockchain network, a consensus mechanism and a reputation system, in particular to a lightweight reputation consensus method of a blockchain network model
Background
As blockchain technology fires in the digital currency field, great value is increasingly being discovered. However, blockchain technology still has a major disadvantage in terms of scalability, mainly in two ways: performance is insufficient to support actual traffic, storage capacity cannot be extended continuously. The security and reliability of a blockchain system relies on a distributed consensus of multi-node participation, the more nodes the more secure. However, the cost of distributed consensus increases substantially with the number of nodes, making the blockchain performance unsatisfactory. The continuous growth in volume of data also places tremendous data redundancy and storage pressure on the blockchain system. The research of the scalability of the blockchain has attracted extensive attention in academia and industry, and the scheme is endless, but the related technology is still in the early development stage, and needs to be further optimized and perfected.
Ideally, as the number of block link points increases, the throughput and storage capacity of a block chain system with good scalability should correspondingly increase. However, in the existing blockchain network structure, there is a relationship between security, decentralization and scalability of the system. Simply adding blockchain nodes can eventually only result in a greater degree of redundancy of the data, and the storage pressure of a single node is not reduced. And the increase in block synchronization latency instead reduces the throughput of the blockchain system due to the need to agree among more nodes. Therefore, to promote scalability of blockchain systems, it is an object of the present disclosure to improve blockchain network architecture.
In addition, in the blockchain system, the main content of the consensus mechanism is that the block-out right of a new block participates in competition or becomes a candidate, and nodes with successful competition or candidate broadcast the new block to the whole network, and the generation of the block is approved and accepted by the whole network so as to achieve distributed agreement. The consensus mechanism ensures trust among nodes in the blockchain system. The blockchain nodes do not need to trust each other, and a centralized organization does not need to provide trust evidence or identity evidence. As long as all users follow and operate the unified blockchain protocol, publicly transparent, non-tamperable data storage and transactions can be achieved. Currently, the mainstream consensus mechanism in the blockchain system comprises a workload proving mechanism, a rights proving mechanism, a share authorization mechanism, a Bayesian consensus mechanism and the like. However, improvements to blockchain network architectures necessitate re-adaptation and design of the consensus mechanism to counteract part of the security sacrificed by improving scalability.
Disclosure of Invention
In order to solve the technical problems, the invention provides a lightweight reputation consensus implementation method for a double-layer distributed blockchain network model, which utilizes the distributed consensus and the double-layer distributed blockchain network model stored in a distributed manner to realize a lightweight reputation-based consensus mechanism.
The invention discloses a lightweight reputation consensus realization method of a double-layer distributed blockchain network model, which specifically comprises the following steps of:
step 1: the master node in the current cluster 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: the signature and the block height of the next block are sent 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 last block and the number of the last node, then calculates the hash value of the current block according to the signature of the current block and the block height, the signature GenSig (i, j) of the current block is defined by the formula (1), and the hash value GenHash (i, j) of the current block is defined by the formula (2);
GenSig(i,j)＝Hash(GenSig(i-1,j-1),BlockGen i-1 ) (1)
wherein, blockGen i-1 GenSig (i-1, j-1) generates a signature of the j-1 th block for the i-1 st node, for the number of the i-1 st node;
GenHash(i,j)＝Hash(GenSig(i,j),BlockHeight j ) (2)
wherein, blockHeight j Block height for the j-th block;
the consensus algorithm program performs remainder operation on the hash values, and calculates storage positions of a large number of hash values in the Plot file, wherein the specific hash storage position Scoop No. (i, j) is defined by a formula (3);
ScoopNo.(i,j)＝GenHash(i,j)％4096 (3)
acquiring attribute values of a basic reputation, a growing reputation and a social reputation of a current node, and calculating the current node reputation value;
the consensus algorithm program calculates all target values target and selects the minimum value from the positioned hash values, and the target value minimum value target (i, j) of the j-th block of the i-th node is defined by a formula (4);
target(i,j)＝Hash(Scoopdata(i,j),GenSig(i,j)) (4)
wherein, scoopdata (i, j) is a specific hash value located;
according to the minimum value of the node reputation value and the target value target (i, j), calculating the Deadline of the current block out of the block, wherein a specific calculation formula is defined by a formula (5):
wherein Re is i The base target is the basic target value of the result after the reputation normalization of the ith node;
the consensus algorithm program adds the calculated loadline to the next block to be generated;
step 3: the master node in the current cluster participating in consensus packs the transaction in the transaction pool and related information into blocks, broadcasts the blocks to a block chain network and participates in the block out competition of the current block height;
finally, the block producer with the smallest loadline attribute value obtains the block out weight.
Compared with the prior art, the invention can improve the expandability of the blockchain 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 in accordance with an embodiment of the present invention;
FIG. 2 is a lightweight reputation consensus mechanism in accordance with an embodiment of the present invention;
FIG. 3 is a flowchart of a lightweight reputation consensus implementation method for a dual-layer distributed blockchain network model of the present invention.
Detailed Description
The structure, function and function of the frame designed according to this invention will be described in detail with reference to the accompanying drawings and detailed description.
As shown in FIG. 1, a dual-layer distributed blockchain network model is shown in an embodiment of the present invention. By introducing cluster nodes, the traditional blockchain network is clustered, different roles and tasks are given to the nodes, and each transaction in the blockchain is efficiently completed through cooperation, reputation evaluation and election algorithm between the master node and the slave node. Finally, the decentralization characteristic is guaranteed through the first-layer distributed consensus among the cluster nodes, and the second-layer distributed storage in the cluster nodes improves the expandability of the system, so that the dual improvement of the performance and the expandability is realized.
In this network model, three node types include cluster nodes, master nodes, and slave nodes.
In the blockchain network structure of the present invention:
(1) Cluster node
A cluster node is composed of a master node and a number of slave nodes. All cluster nodes communicate through a P2P network protocol, a distributed consensus mechanism is agreed, and finally a block chain network is formed. Cluster nodes are functionally identical to full nodes in a conventional blockchain, but there are more mechanisms within to solve the task allocation and resource fairness issues of master and slave nodes. Cluster nodes store a full amount of blockchain data that is scattered across distributed nodes within the cluster nodes. The cluster nodes cooperate with each other to jointly complete consensus and updating of all transactions in the blockchain network.
(2) Main node
Is the center of the cluster node, is responsible for communication, synchronization and consensus with other logic nodes, and is responsible for communication and data interaction with slave nodes. In the cluster nodes, 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 as to realize the expansion of storage. In addition, the slave node is also a candidate node of the master node, and when the reelection of the master node is triggered, a new master node is selected from the slave nodes. In order to ensure long-term stable operation of the system under the network structure, performance balance among cluster nodes needs to be considered. The public chain of the blockchain is global-oriented, any node can join and exit, and in such an environment, there can be a large difference in the performance of the nodes. Therefore, when the blockchain is created, the logic nodes are required 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 are required to be dynamically adjusted.
In capacity certification (Proof of Capacity, POC), the common identified block among distributed nodes is determined by a default value, which is the latency from last block out to next block out. In a block-out process, a node with the minimum loadline value is selected to give out block weight. The value of the loadline is mainly affected by the size of the storage capacity of the node, and the larger the storage capacity is, the greater the probability that the value of the loadline is minimized. For nodes participating in consensus, the smaller the loadline value is, the larger the probability of obtaining the block weight is, and the time for obtaining the block weight can be shortened. Thus, for blockchain systems, the overall storage capacity of the system is increased to speed up overall speed, thereby elevating TPS. The capacity reputation proving (Proof of Capacity and Reputation, POCR) provided by the invention is to integrate the reputation influence of the node into the calculation formula of the loadline. The block-out parameter, loadline, that a node can acquire is not only determined by storage capacity, but also depends on its own reputation value. The higher the reputation value, the smaller the loadline, the higher the probability of obtaining the block weights, and the shorter the interval of the blocks. Therefore, enhancing the overall reputation of the system also brings about an effective boost in TPS.
As shown in fig. 2, the poc r consensus process is mainly referred to as a globally recognized block generation and broadcast synchronization for the blockchain system. Wherein, how the blocks are generated and approved by all distributed nodes are mainly globally approved. The POCR of the invention integrates the excellent ideas of capacity consensus and reputation consensus, thus enhancing the safety of the system to a certain extent and reducing the resource consumption of the system.
As shown in FIG. 3, the overall flowchart of the lightweight reputation consensus implementation method of the dual-layer distributed blockchain network model of the invention is shown, and the specific consensus process of the method 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: the signature and the block height of the next block are sent 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 last block and the number of the last node, then calculates the hash value of the current block according to the signature of the current block and the block height, the signature GenSig (i, j) of the current block is defined by the formula (1), and the hash value GenHash (i, j) of the current block is defined by the formula (2);
GenSig(i,j)＝Hash(GenSig(i-1,j-1),BlockGen i-1 ) (1)
wherein, blockGen i-1 GenSig (i-1, j-1) generates a signature of the j-1 th block for the i-1 st node, for the number of the i-1 st node.
GenHash(i,j)＝Hash(GenSig(i,j),BlockHeight j ) (2)
Wherein, blockHeight j The block height of the j-th block.
The consensus algorithm program performs remainder operation on the hash values, and calculates storage positions of a large number of hash values in the Plot file, wherein the specific hash storage position Scoop No. (i, j) is defined by a formula (3);
ScoopNo.(i,j)＝GenHash(i,j)％4096 (3)
acquiring attribute values of a basic reputation, a growing reputation and a social reputation of a current node, and calculating the current node reputation value, wherein a specific calculation formula is elaborated below;
the consensus algorithm program calculates all targets in the positioned hash values and selects the minimum value, and the Target value Target (i, j) of the j-th block of the i-th node is defined by a formula (4);
target(i,j)＝Hash(Scoopdata(i,j),GenSig(i,j)) (4)
where scanopdata (i, j) is the specific hash value that is located.
Solving the Deadline of the current block according to the node reputation value and the Target, wherein a specific calculation formula is defined by a formula (5);
wherein Re is i The reputation value of the ith node is defined by the system when the system is initialized, wherein the base target is the basic target value.
The consensus algorithm program adds the calculated loadline to the next block to be generated;
step 3: and the current nodes participating in the consensus package the transactions and related information in the transaction pool into blocks, broadcast the blocks to a block chain network and participate in the block out competition of the current block height. Finally, the block producer with the smallest loadline attribute value obtains the block out weight.
The reputation of each node includes a base reputation, a growing reputation, and a social reputation. Where the base reputation represents the hardware facility capabilities of the node, the growing 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 together determine the reputation of the node, so that the fairness and the rationality of the evaluation system are enhanced.
When the blockchain system is successfully created, registration and joining are opened to the whole network. When a new node joins the blockchain, the new node is distributed into a logic node, becomes a slave node of a master node in the logic node, participates in related transactions of the blockchain, calculates the basic credit of the node and uploads the basic credit to a blockchain ledger. 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. The trusted node includes a government machineConstruct, bank, university, etc. The following is the calculation mode of the basic credit, wherein the hard disk capacity factor CptF i Defined by formula (6). cpu factor CpuF i Defined by formula (7). Bandwidth factor BWF i Defined by formula (8). Node type factor TypeF i The two main categories are trusted nodes and common nodes, the trusted nodes generally comprise government, banking and university institutions passing identity verification, and the trusted nodes are defined by a formula (9). Basic reputation BaseRe i Defined by formula (10).
Wherein cpt i Cpt, hard disk capacity value of the ith node max Is the maximum value of the hard disk capacity of the node in the current block chain system.
Wherein Cpu is i Cpu performance value, cpu, for the ith node max Is the maximum value of the performance of the node cpu in the current blockchain system.
Wherein BW is i BW for the bandwidth value of the ith node max Is the maximum of node bandwidths in the current blockchain system.
BaseRe i ＝CapacityF i +CpuF i +BWF i +TypeF(0≤BaseRe i ≤4) (10)
After a node joins a blockchain system, its own monetary assets and actions directly affect the growing reputation of the node. Possess more timesThe virtual currency issued by the front blockchain system is more concerned about the safe and stable operation of the system, the system is more willing to be maintained, and the system is better served by having more positive actions. Thus, the growing reputation of the node includes online time, number of credits held, and number of days held. The following is a calculation of the growing reputation, in which the online time factor TF i Defined by formula (11), coin-age factor CoinAF i Defined by formulas (12) (13), a growing reputation GrowRe i Defined by equation (14).
Wherein, time is online As the online time of the ith node, curTime is the current time of the ith node, time enroll Registration time of the i-th node.
CoinA i ＝CoinN i ·CoinD i (12)
Wherein CoinN i The number of the coinage for the ith node; coinD i The number of days in hand for the ith node.
Wherein, coinA max Coin age for the ith node; coinA max Is the maximum of the node coin ages in the current blockchain system.
GrowingRe i ＝TimeF i +CoinAF i (0≤GrowingRe i ≤4) (14)
The nodes behave differently in undertaking blockchain transactions. These actions directly affect the social reputation of the node. Social reputation includes the number of cheating actions, honest actions, verification transactions, and node chunking. The cheating actions include double-flower attacks, fake transaction signatures, denial of service attacks, lazy verification (submitting only the old transaction verification results each time, not verifying the new transaction), etc. Provision is made herein for whenever node cheating occursThe action will zero its social reputation and growing reputation. The following is a calculation formula for social reputation, wherein honestB is an honestB i Defined by formula (15). The cheating behavior mainly comprises the behavior of double-flower attack, lazy verification and the like. Social reputation SocialRe i Defined by equation (16), primarily by honesty of the node i HB i Characterization.
Wherein tranV i Verifying the number of transactions for the ith node, blockV i Packing the number of blocks for the ith node; tranV max Verifying a maximum value of a transaction number for a node in a current blockchain system max Packing a maximum value of the block number for a node in the current blockchain system;
SocialRe i ＝HonestB i (0≤SocialRe i ≤4) (16)
the node reputation is stored in the blockchain every time it is updated, and the reputation value of some other node can be queried by any node.
Node reputation NodeRe i Defined by equation (17), equation (18) is the result Re after node reputation normalization i 。
NodeRe i ＝BaseRe i +GrowingRe i +SocialRe i (0≤NodeRe i ≤12) (17)
The invention 1) comprehensively evaluates the credit value of the nodes through indexes such as capability, behavior, contribution and the like, so that the nodes with different roles perform their own roles, cooperate with each other and restrict each other; 2) By performing reputation evaluation on all the blockchain nodes, the nodes with honest behaviors and enough contribution to the system are ensured to bear important work in the system, so that the safety and stability of the system are ensured; 3) Clustering nodes in the block chain network, and improving the expandability of the system by introducing a double-layer distributed architecture; 4) An evaluation system for measuring the reputation value of the node is provided.
Claims (2)
1. A lightweight reputation consensus implementation method of a double-layer distributed blockchain network model is characterized by comprising the following steps of:
step 1: the master node in the current cluster 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: the signature and the block height of the next block are sent 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 last block and the number of the last node, then calculates the hash value of the current block according to the signature of the current block and the block height, the signature GenSig (i, j) of the current block is defined by the formula (1), and the hash value GenHash (i, j) of the current block is defined by the formula (2);
GenSig(i,j)＝Hash(GenSig(i-1,j-1),BlockGen i-1 ) (1)
wherein, blockGen i-1 GenSig (i-1, j-1) generates a signature of the j-1 th block for the i-1 st node, for the number of the i-1 st node;
GenHash(i,j)＝Hash(GenSig(i,j),BlockHeigh t j ) (2)
wherein, blockHeight j Block height for the j-th block;
the consensus algorithm program performs remainder operation on the hash values, and calculates storage positions of a large number of hash values in the Plot file, wherein the specific hash storage position Scoop No. (i, j) is defined by a formula (3);
ScoopNo.(i,j)＝GenHash(i,j)％4096 (3)
acquiring attribute values of a basic reputation, a growing reputation and a social reputation of a current node, and calculating the current node reputation value;
the consensus algorithm program calculates all target values target and selects the minimum value from the positioned hash values, and the minimum value of target values target (i, j) of the j-th block of the i-th node is defined by a formula (4);
target(i,j)＝Hash(Scoopdata(i,j),GenSig(i,j)) (4)
wherein, scoopdata (i, j) is a specific hash value located;
according to the minimum value of the node reputation value and the target value target (i, j), calculating the Deadline of the current block out of the block, wherein a specific calculation formula is defined by a formula (5):
wherein Re is i The base target is the basic target value of the result after the reputation normalization of the ith node;
the consensus algorithm program adds the calculated loadline to the next block to be generated;
step 3: the master node in the current cluster participating in consensus packs the transaction in the transaction pool and related information into blocks, broadcasts the blocks to a block chain network and participates in the block out competition of the current block height;
finally, the block producer with the smallest loadline attribute value obtains the block out weight.
2. The method for implementing lightweight reputation consensus for a two-tier distributed blockchain network model of claim 1, wherein the current node reputation value is calculated as follows:
the basic reputation comprises the hard disk capacity, CPU capacity, bandwidth size and node type of the node;
basic reputation BaseRe i The definition is as follows:
BaseRe i ＝CapacityF i +CpuF i +BWF i +TypeF
the relevant parameters in the above formula include:
CapacityF i the following is defined for the hard disk capacity factor:
wherein cpt i Cpt, hard disk capacity value of the ith node max The maximum value of the capacity of the node hard disk in the current block chain system;
CpuF i the following is defined for the base reputation cpu factor:
wherein Cpu is i Cpu performance value, cpu, for the ith node max The maximum value of the performance of the node cpu in the current blockchain system;
BWF i the following is defined for the bandwidth factor:
wherein BW is i BW for the bandwidth value of the ith node max Maximum value of node bandwidth in the current block chain system;
TypeF i the following is defined for the node type factor:
the growing reputation comprises online time, number of notes held, number of days of notes held, wherein:
on-line time TimeF i The definition is as follows:
wherein, time is online As the online time of the ith node, curTime is the current time of the ith node, time enroll Registration time for the ith node；
Coin-holding days CoinAF i The definition is as follows:
CoinA i ＝CoinN i ·CoinD i
wherein CN i For the number of coinage of the ith node, CD i Coin-holding days for the ith node, CA i Coin-age for the ith node, CA max The maximum value of the node coin age in the current block chain system;
growth reputation growth Re i The definition is as follows:
GrowingRe i ＝TimeF i +CoinAF i
social reputation includes cheating, honest, verifying the number of transactions, and the number of node blocks; honesty is a HonestB i The definition is as follows:
wherein tranV i Verifying the number of transactions for the ith node, blockV i Packing the number of blocks for the ith node; tranV max Verifying a maximum value of a transaction number for a node in a current blockchain system max Packing a maximum value of the block number for a node in the current blockchain system;
social reputation SocialRe i The definition is as follows:
SocialRe i ＝HonestB i
the node reputation is stored in the blockchain every time the node is updated, and any node can inquire the reputation value of a certain node;
node reputation NodeRe i The definition is as follows:
NodeRe i ＝αBaseRe i +βGrowingRe i +γSocialRie
the results after normalization of node reputation are 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 CN112468552A (en) | 2021-03-09 |
| CN112468552B true 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) |
Families Citing this family (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 |
| 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 |
| 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 |
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 |
|---|
| 《Blockchain Technology Based Decentralized Energy Trading for Multiple-Microgrid System》;Ting Li等;《Preprints of the 3rd IEEE conference on Energy Internet and Energy System Integration》;20191010;全文 * |
| 《SEBDB：Semantics Empowered BlockChain DataBase》;Yanchao Zhu等;《2019 IEEE 35th International Conference on Data Engineering （ICDE）》;20191231;全文 * |
| 《基于区块链的可修改信誉评价系统的设计与分析》;李昊轩;《西安电子科技大学硕士学位论文》;20190229;全文 * |
| 《基于区块链的数据存储应用研究》;李亚楠;《北京交通大学硕士学位论文》;20180630;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112468552A (en) | 2021-03-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112468552B (en) | Lightweight reputation consensus realization method of double-layer distributed blockchain network model | |
| Ferdous et al. | Blockchain consensus algorithms: A survey | |
| US11669811B2 (en) | Blockchain-based digital token utilization | |
| US10965446B2 (en) | Blockchain-based automated user matching | |
| 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 | |
| Jourenko et al. | Sok: A taxonomy for layer-2 scalability related protocols for cryptocurrencies | |
| CN109697606A (en) | The distributed network and the ecosystem of common recognition agreement are proved based on innovative prestige | |
| Wang et al. | Beh-Raft-Chain: a behavior-based fast blockchain protocol for complex networks | |
| Tsai et al. | A multi-chain model for CBDC | |
| CN111951108A (en) | Chain structure design method with intelligent contract block chain with complete picture | |
| Pandey et al. | Maintaining scalability in blockchain | |
| Moudoud et al. | An overview of blockchain and 5G networks | |
| Kaur et al. | Blockchain consensus protocols: State-of-the-art and future directions | |
| Sohrabi et al. | On the scalability of blockchain systems | |
| Li et al. | Game theory based compatible incentive mechanism design for non-cryptocurrency blockchain systems | |
| Xi et al. | [Retracted] A Comprehensive Survey on Sharding in Blockchains | |
| Guo et al. | A double auction for charging scheduling among vehicles using dag-blockchains | |
| Liang et al. | Blockchain-based privacy preserving trust management model in VANET | |
| Suo et al. | SV-PBFT: an efficient and stable blockchain PBFT improved consensus algorithm for vehicle-to-vehicle energy transactions | |
| Wu et al. | Master-slave blockchain framework: Cross-domain trust management mechanism using trust ticket | |
| Liao et al. | Proof-of-balance: Game-theoretic consensus for controller load balancing of sdn | |
| KR102386922B1 (en) | Blockchain system | |
| Xiong et al. | Comparative Research On Blockchain Consensus Algorithms | |
| Panigrahi et al. | Impact of Clustering technique in enhancing the Blockchain network performance | |
| Singh et al. | PoSC: Combined Score for Consensus in Intemet-of-Things Applications |
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 |