Block chain centralized comprehensive evaluation treatment method and system
Through the Hegselmann-Krause clustering algorithm, the reward allocation is optimized, combined with the pledge function and the three-party game model, the problem of insufficient blockchain centralization assessment and reward allocation mechanism is solved, and security improvement and fairness in blockchain governance is achieved. Enhanced.
Patent Information
- Application Number
- CN202410981463.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-22
- Publication Date
- 2024-11-22
AI Technical Summary
The existing technology has failed to conduct a comprehensive and comprehensive quantitative assessment of the centralization degree of blockchain, and the reward distribution mechanism under the incentive mechanism is insufficient in accuracy and fairness, which increases the risk of the system being attacked and manipulated.
The Hegselmann-Krause clustering algorithm is used to optimize the reward allocation mechanism, obtain voting rights through the pledge function, combine the three-party game interaction model, verify and calculate the rewards of nodes, and achieve fair and accurate distribution of rewards.
A comprehensive quantitative assessment of the degree of centralization of blockchain has been achieved, which improves the accuracy and fairness of reward distribution under the incentive mechanism, encourages participants to adopt positive and upright behaviors, reduces the probability of inappropriate behavior, and increases the blockchain Security of governance.
Smart Images

Figure CN119011600A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of blockchain security governance, and specifically to a blockchain centralized comprehensive assessment governance method and system for Web3.0. Background Art
[0002] As one of the core technologies of Web 3.0, blockchain is characterized by decentralization. In recent years, major countries around the world have been accelerating the development of blockchain technology, and the blockchain industry in my country is also in a period of rapid ecological development. However, as some blockchain projects develop towards scale and commercialization, their governance structures have shown more and more centralized tendencies, resulting in power and control being gradually concentrated in the hands of a few participants. This not only deviates from the original intention of blockchain technology to be decentralized, but also increases the risk of the system being attacked and manipulated, thus posing a threat to the security and credibility of the entire blockchain. Web 3.0 is the next stage of development of the Internet, which places greater emphasis on the importance of decentralization. Therefore, it is necessary to discover and improve some processes in blockchain updates in a targeted manner.
[0003] The main indicators for measuring the degree of centralization of blockchains include the Nakamoto coefficient, the Gini coefficient, and the Shannon entropy. The analysis of the changes in these indicators at different granularities and in different years can reflect the changing trend of the degree of centralization of blockchains, but a single indicator cannot fully reflect the degree of centralization of blockchains. Incentive mechanisms based on economy, reputation, and reciprocity can affect the decision-making behavior of participants (validators, users, etc.) in blockchain systems. Game theory provides a framework for analyzing and predicting the behavior of rational decision makers in complex interactive environments. The HK clustering algorithm is mainly used to simulate how individuals (or nodes) reach consensus through communication in social networks. This algorithm is particularly suitable for distributed environments, such as blockchain networks, and can be used to optimize incentive mechanisms.
[0004] Similar solutions to existing technologies
[0005] Li C, Palanisamy B, Xu R, Duan L, Liu J, Wang W. How hard is takeover indpos blockchains? understanding the security of coin-based voting governance [C] the 2023 ACM SIGSAC Conference on Computer and Communications Security. New York, United States: Association for Computing Machinery, 2023: 150-164, doi: 10.1145 / 3576915.3623171. This paper models the resistance of DPoS blockchain to takeover as active resistance and passive resistance, and proves that the resistance of DPoS blockchain to takeover is determined by the theoretical design and practical use of its token-based voting governance system.
[0006] Yang Liping. Research on the governance of speculative behavior in content production in virtual knowledge communities based on blockchain[D]. South China University of Technology, 2022, doi:10.27151 / d.cnki.ghnlu.2022.003687. This paper takes Steemit as the object to establish a governance model and game model for speculative behavior in content production based on blockchain, and conducts simulation analysis on the model, draws suggestions for improving the mechanism of the existing community and proposes corresponding governance strategies.
[0007] Bao Q, Li B, Hu T, Sun XA survey of blockchain consensus safety and security: State-of-the-art, challenges, and future work[J].Journal of Systems and Software, 2023(196): 1-14, doi: 10.1016 / J.JSS.2022.111555. This paper conducts a comprehensive investigation on the security of blockchain consensus protocols, and discusses in detail the classification of blockchain consensus protocols, potential security issues, security assurance approaches, and verification methods.
[0008] In the paper "How hard is takeover in DPoS blockchains? Understanding the security of coin-based voting governance", the authors modeled the resistance of DPoS blockchain to takeover as active resistance and passive resistance, and proved that the resistance of DPoS blockchain to takeover is determined by the theoretical design and practical use of its token-based voting governance system, providing new insights into the security of coin-based voting governance and new considerations for blockchain decentralized governance rules.
[0009] In the paper "Research on the Governance of Speculative Behavior in Content Production in Virtual Knowledge Communities Based on Blockchain", the author focuses on the speculative behavior of the blockchain knowledge community Steemit. Based on the literature on speculative behavior in the fields of economics, knowledge sharing, token incentives, etc., and combines game theory, mathematical modeling, system simulation and other means, he constructs a governance model for speculative behavior in knowledge communities and considers the reward mechanism. He proposes that certain economic rewards should be given to those who click on the content, and corresponding punishments should be given to speculative creators who are clicked on.
[0010] In the paper "A survey of blockchain consensus safety and security: State-of-the-art, challenges, and future work", the authors discussed the different stakeholders involved in the security of blockchain consensus protocols and analyzed the safety and security issues in blockchain consensus proposals, and studied the verification of blockchain consensus security and security assurance methods.
[0011] The above technical solutions have the following two shortcomings: First, similar technical solutions do not make a comprehensive and integrated quantitative assessment of the degree of centralization of the blockchain; second, the reward distribution mechanism under the incentive mechanism in similar technical solutions lacks accuracy and fairness. Summary of the invention
[0012] The purpose of the present invention is to provide a centralized comprehensive evaluation and governance method and system for blockchain for Web3.0 to solve at least one technical problem existing in the above-mentioned background technology.
[0013] In order to achieve the above object, the present invention adopts the following technical solutions:
[0014] In a first aspect, the present invention provides a blockchain centralized comprehensive evaluation governance method, comprising:
[0015] Determine whether the node participates in the voting, conduct the voting, count the number of nodes participating in the voting, and determine the effective reward issuance period;
[0016] Verify effective reporting and regulatory information, determine nodes that meet the reward conditions, and calculate the specific amount of rewards that each node should receive;
[0017] Execute reward distribution and distribute the calculated reward amount to the corresponding nodes.
[0018] Furthermore, determine whether the node participates in the voting, conduct the voting, count the number of nodes participating in the voting, and determine the effective reward issuance time, including: Voter V i Through the pledge function freeze(amount(token) i ,σ)→P i Get a certain voting right P i , where token represents the type of token required to participate in voting, amount(token) i Representative Voter V i The amount of tokens pledged, the parameter σ controls the voting rights obtained by each token; the candidate group C, the voting group V and the spontaneous supervisor group A conduct a three-party game interaction; the strategy space of the candidate group C is S C ={S C1 ,S C2} = {bribe, no bribe}, the strategy space of the voting group V is S V ={S V1 ,S V2}={accept, report}, the strategy space of the spontaneous supervisor group A is S A ={S A1 ,S A2}={supervision, no supervision}; candidate nodes decide whether to take bribery actions, voting nodes decide whether to report, and spontaneous supervisor nodes decide whether to perform supervisory functions. The strategy choices of candidate group C, voting group V and spontaneous supervisor group A are independent of each other and do not affect each other; after each round of elections, the number of participating nodes is counted and the effective reward issuance period is determined.
[0019] Furthermore, we verify the effective reporting and regulatory information, determine the nodes that meet the reward conditions, and calculate the specific amount of rewards that each node should receive, including:
[0020] Based on the transaction information generated in the main voting phase, verify effective reporting and supervision behaviors, and confirm the nodes that meet the reward conditions in each round of voting;
[0021] Define voting node V i point of view;
[0022] Define the autonomous supervisor A i point of view;
[0023] Calculate the opinions of the voter nodes and the spontaneous supervisor nodes and the updated opinions, and determine the opinion update rules of the voter nodes and the spontaneous supervisor nodes according to the Hegselmann-Krause opinion dynamic clustering algorithm;
[0024] The final reward of the computing node.
[0025] Furthermore, the voter node benefits are:
[0026]
[0027] Where N v represents the number of valid nodes participating in the vote, p2 is the reward benchmark value set by the system, and W i is the weight assigned to each round of voting in the past ten rounds, and S(V) represents whether the voting node votes in this round.
[0028] Furthermore, the node benefits for reporters and voters are: Where a and γ represent the reward coefficients for reporting behavior set by the system. and Represent voting nodes V i With the autonomous supervisor node A i The number of effective reports and supervisions in this round of nodes.
[0029] Furthermore, the viewpoint update rule is:
[0030] N i (x(t))={j∈V|||v i (t)-v j (t)|| 2 <ε}.
[0031] Furthermore, we define the voting node V i The viewpoint is v i =(δ1,δ2), where To measure the recent voting performance, δ2 = vote n (V i ) / vote n +(tT) / T is an indicator to measure the performance of this round of voting, where W i is the weight assigned to each round of voting in the past ten rounds. S(V) represents whether the voting node has voted in this round. n (V i ) represents the nth round V i The number of votes cast by the node, vote n Represents the total number of votes in the nth round of voting;
[0032] Define the autonomous supervisor A i The viewpoint is a i =(ρ1,ρ2), where To measure the recent monitoring performance, ρ2 = monitoring n (A i ) / monitoring n An indicator to measure the performance of this round of voting.
[0033] In a second aspect, the present invention provides a blockchain centralized comprehensive evaluation and governance system, comprising:
[0034] The voting module is used to determine whether the node participates in the voting, conduct the voting, count the number of nodes participating in the voting, and determine the effective reward issuance period;
[0035] Verification and calculation module, used to verify effective reporting and regulatory information, determine nodes that meet the reward conditions, and calculate the specific amount of rewards that each node should receive;
[0036] The allocation module is used to execute reward allocation and distribute the calculated reward amount to the corresponding nodes.
[0037] In a third aspect, the present invention provides a non-transitory computer-readable storage medium, which is used to store computer instructions. When the computer instructions are executed by a processor, the centralized comprehensive assessment and governance method of blockchain for Web3.0 as described in the first aspect is implemented.
[0038] In a fourth aspect, the present invention provides a computer device comprising a memory and a processor, wherein the processor and the memory communicate with each other, the memory stores program instructions executable by the processor, and the processor calls the program instructions to execute the centralized comprehensive assessment and governance method of blockchain for Web3.0 as described in the first aspect.
[0039] In a fifth aspect, the present invention provides an electronic device comprising: a processor, a memory and a computer program; wherein the processor is connected to the memory, the computer program is stored in the memory, and when the electronic device is running, the processor executes the computer program stored in the memory so that the electronic device executes instructions for implementing the centralized comprehensive assessment and governance method of blockchain for Web3.0 as described in the first aspect.
[0040] Terminology explanation:
[0041] Incentive mechanism: Incentive refers to measures to mobilize individuals to carry out certain activities through internal or external efforts. Incentive mechanism is composed of two words, incentive and mechanism, and can be defined as a set of rules or reward and punishment mechanisms used to mobilize or guide individual or group behavior to achieve specific goals.
[0042] HK clustering algorithm: The Hegselmann-Krause (HK) clustering algorithm is an algorithm based on the Hegselmann-Krause opinion dynamics model, which can simulate how individuals (or nodes) reach consensus through communication in social networks.
[0043] Game theory: also known as strategy theory, is a mathematical theory and method for studying the interaction and decision-making between rational decision makers with conflict and cooperation characteristics.
[0044] The beneficial effects of the present invention are as follows: it integrates multiple evaluation indicators of the degree of centralization of blockchain, comprehensively analyzes the degree of centralization of blockchain systems using different consensus protocols, and proposes abstract governance models for different consensus mechanisms. It uses the Hegselmann-Krause (HK) clustering algorithm to optimize the reward distribution mechanism to encourage a wide range of participants to take positive and upright behaviors in blockchain governance, and constructs a three-party evolutionary game model of blockchain governance for Web3.0 based on an incentive mechanism to evaluate the improved security.
[0045] Additional advantages of the present invention will be more clearly given in the following description or learned through the practice of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS
[0046] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without paying creative work.
[0047] Figure 1 This is a principle framework diagram of the centralized comprehensive assessment and governance method of blockchain for Web3.0 described in an embodiment of the present invention.
[0048] Figure 2 This is a flow chart of the centralized comprehensive assessment and governance method of blockchain for Web3.0 described in an embodiment of the present invention. DETAILED DESCRIPTION
[0049] The embodiments of the present invention are described in detail below, and examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements with the same or similar functions. The embodiments described below by the accompanying drawings are exemplary and are only used to explain the present invention, and cannot be interpreted as limiting the present invention.
[0050] It should be understood by those skilled in the art that unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by those skilled in the art to which this invention belongs.
[0051] It should also be understood that terms, such as those defined in commonly used dictionaries, should be understood to have a meaning consistent with that in the context of the prior art and will not be interpreted in an idealized or overly formal sense unless as defined herein.
[0052] Those skilled in the art will appreciate that, unless otherwise stated, the singular forms "a", "an", "said" and "the" used herein may also include plural forms. It should be further understood that the term "comprising" used in the specification of the present invention refers to the presence of the features, integers, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, integers, steps, operations, elements and / or groups thereof.
[0053] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner. Different embodiments or examples described in this specification and features of different embodiments or examples may be combined and combined by those skilled in the art without contradiction.
[0054] To facilitate understanding of the present invention, the present invention is further explained below with reference to specific embodiments in conjunction with the accompanying drawings, and the specific embodiments do not constitute a limitation on the embodiments of the present invention.
[0055] Those skilled in the art should understand that the drawings are merely schematic diagrams of embodiments, and the components in the drawings are not necessarily necessary for implementing the present invention.
[0056] Decentralization is the core feature of blockchain technology. This mechanism essentially enhances the blockchain's anti-tampering ability. The evaluation of the degree of decentralization can objectively reflect the security of the blockchain to a certain extent. Current research lacks a comprehensive quantitative evaluation system for the degree of decentralization of various blockchains. In the improved governance mechanism, the reward mechanism for participants who have taken positive and upright behaviors is also inaccurate and unfair to a certain extent. In order to improve the above-mentioned defects in the current blockchain decentralization evaluation and governance mechanism, the present invention integrates multiple evaluation indicators of the degree of centralization of blockchains, comprehensively analyzes the degree of centralization of blockchain systems using different consensus protocols, and proposes an abstract governance model for different consensus mechanisms. The Hegselmann-Krause (HK) clustering algorithm is used to optimize the reward distribution mechanism to encourage a wide range of participants to take positive and upright behaviors in blockchain governance. On this basis, a three-party evolutionary game model of blockchain governance for Web3.0 based on an incentive mechanism is constructed to evaluate the improved security.
[0057] The present invention constructs a comprehensive evaluation method for the centralized evaluation and governance security of blockchain governance in the Web3.0 environment. The method uses a timestamp-based sliding window technology to reveal the key issues of governance centralization, introduces an incentive strategy based on rewards, and uses the Hegselmann-Krause (HK) clustering algorithm to optimize the reward distribution mechanism to encourage a wide range of participants to take positive and upright behaviors in blockchain governance. A three-party evolutionary game model of blockchain governance for Web3.0 based on an incentive mechanism is constructed to simulate the blockchain governance process. The method realizes three functions: first, a comprehensive quantitative evaluation of the degree of centralization of blockchain systems using different consensus protocols is conducted; second, an abstract governance model is proposed for different consensus mechanisms, and the governance process of blockchain is simulated by establishing a three-party evolutionary model of blockchain governance based on an incentive mechanism; third, the accuracy and fairness of the reward distribution mechanism are improved by introducing the HK clustering algorithm.
[0058] Example 1
[0059] In this embodiment 1, a blockchain centralized comprehensive evaluation and governance system is first provided, including: a voting module, which is used to determine whether a node participates in voting, and to vote, to count the number of nodes participating in the voting, and to determine the effective reward issuance period; a verification and calculation module, which is used to verify effective reporting and supervision information, determine the nodes that meet the reward conditions, and calculate the specific reward amount that each node should receive; and a distribution module, which is used to execute reward distribution and distribute the calculated reward amount to the corresponding node.
[0060] In this embodiment, the above-mentioned system is used to implement a centralized comprehensive evaluation and governance method for blockchain, including: determining whether a node participates in voting and voting, counting the number of nodes participating in voting, and determining the effective reward issuance period; verifying effective reporting and regulatory information, determining nodes that meet the reward conditions, and calculating the specific reward amount that each node should receive; executing reward distribution and distributing the calculated reward amount to the corresponding node.
[0061] Determine whether the node participates in the vote, conduct the vote, count the number of nodes participating in the vote, and determine the effective reward issuance time, including: Voter V i Through the pledge function freeze(amount(token) i ,σ)→P i Get a certain voting right P i , where token represents the type of token required to participate in voting, amount(token) i Representative Voter V i The amount of tokens pledged, the parameter σ controls the voting rights obtained by each token; the candidate group C, the voting group V and the spontaneous supervisor group A conduct a three-party game interaction; the strategy space of the candidate group C is S C ={S C1 ,S C2} = {bribe, no bribe}, the strategy space of the voting group V is S V ={S V1 ,S V2}={accept, report}, the strategy space of the spontaneous supervisor group A is S A ={S A1 ,S A2}={supervision, no supervision}; candidate nodes decide whether to take bribery actions, voting nodes decide whether to report, and spontaneous supervisor nodes decide whether to perform supervisory functions. The strategy choices of candidate group C, voting group V and spontaneous supervisor group A are independent of each other and do not affect each other; after each round of elections, the number of participating nodes is counted and the effective reward issuance period is determined.
[0062] Verify effective reporting and regulatory information, determine nodes that meet the reward conditions, and calculate the specific amount of rewards that each node should receive, including:
[0063] Based on the transaction information generated in the main voting phase, verify effective reporting and supervision behaviors, and confirm the nodes that meet the reward conditions in each round of voting;
[0064] Define voting node V i point of view;
[0065] Define the autonomous supervisor A i point of view;
[0066] Calculate the opinions of the voter nodes and the spontaneous supervisor nodes and the updated opinions, and determine the opinion update rules of the voter nodes and the spontaneous supervisor nodes according to the Hegselmann-Krause opinion dynamic clustering algorithm;
[0067] The final reward of the computing node.
[0068] Among them, the voter node income is:
[0069]
[0070] Where N v represents the number of valid nodes participating in the vote, p2 is the reward benchmark value set by the system, and W i is the weight assigned to each round of voting in the past ten rounds, and S(V) represents whether the voting node votes in this round.
[0071] The node benefits for reporting and voting are: Where a and γ represent the reward coefficients for reporting behavior set by the system. and Represent voting nodes V i With the autonomous supervisor node A i The number of effective reports and supervisions in this round of nodes.
[0072] The view updating rule is:
[0073] N i (x(t))={j∈V|||v i (t)-v j (t)|| 2 <ε}.
[0074] Define voting node V i The viewpoint is v i =(δ1,δ2), where To measure the recent voting performance, δ2 = vote n (V i ) / vote n +(tT) / T is an indicator to measure the performance of this round of voting, where W i is the weight assigned to each round of voting in the past ten rounds. S(V) represents whether the voting node has voted in this round. n (V i ) represents the nth round V i The number of votes cast by the node, vote n Represents the total number of votes in the nth round of voting;
[0075] Define the autonomous supervisor A i The viewpoint is a i =(ρ1,ρ2), where To measure the recent monitoring performance, ρ2 = monitoring n (A i ) / monitoring n An indicator to measure the performance of this round of voting.
[0076] Example 2
[0077] In this embodiment 2, a method for improving the governance mechanism of Web 3.0 blockchain based on HK clustering algorithm is proposed, and its system model is as follows: Figure 1 As shown in Figure 1, the model includes four entities: voting nodes, candidate nodes, and spontaneous supervisor nodes. In each round of voting, candidate nodes need to decide whether to bribe, voting nodes need to decide whether to report, and spontaneous supervisor nodes need to decide whether to perform supervisory functions. The strategy choices of these three entities are independent and do not affect each other.
[0078] This method mainly includes three stages of the process, namely S1 voting subject decision stage, S2 reward qualification confirmation stage and S3 reward distribution execution stage. The system flow chart is as follows: Figure 2 shown.
[0079] First, consider a group of voters V = {V1, V2, ..., V n} and a set of candidates C = {C1,C2,...,C m}, and based on this, a spontaneous supervision group A is introduced for modeling.
[0080] Each stage is described in detail as follows:
[0081] 1) The step S1 stage specifically includes the following steps:
[0082] S11: Voter V i Through the pledge function freeze(amount(token) i ,σ)→P i Get a certain voting right P i , where token represents the type of token required to participate in voting, amount(token) i Representative Voter V i The amount of tokens staked, and the parameter σ controls the voting rights each token obtains.
[0083] S12: Candidate group C, voting group V and spontaneous supervisor group A conduct a three-party game interaction. The strategy space of candidate group C is S C ={S C1 ,S C2} = {bribe, no bribe}, the strategy space of the voting group V is S V ={S V1 ,S V2}={accept, report}, the strategy space of the spontaneous supervisor group A is S A ={S A1 ,S A2}={supervision, no supervision}. Candidate nodes decide whether to take bribery actions, voting nodes decide whether to report, and spontaneous supervisor nodes decide whether to perform supervisory functions. The strategy choices of the three are independent and do not affect each other.
[0084] S13: After each round of election, the number of participating nodes is counted and the effective reward distribution period is determined.
[0085] 2) The step S2 specifically includes the following steps:
[0086] S21: Based on the transaction information generated in the main voting phase, verify effective reporting and supervision behaviors, and confirm the nodes that meet the reward conditions in each round of voting.
[0087] S22: Define voting node V i The viewpoint is v i =(δ1,δ2), where To measure the recent voting performance, δ2 = vote n (V i ) / vote n +(tT) / T is an indicator to measure the performance of this round of voting, where W i is the weight assigned to each round of voting in the past ten rounds. S(V) represents whether the voting node has voted in this round. n (V i ) represents the nth round V i The number of votes cast by the node, vote n Represents the total number of votes in the nth round of voting. Define the spontaneous supervisor A i The viewpoint is a i =(ρ1,ρ2), where To measure the recent monitoring performance, ρ2 = monitoring n (A i ) / monitoring n An indicator to measure the performance of this round of voting.
[0088] S23: Calculate the opinions of the voting node and the spontaneous supervisor node and the updated opinions. According to the Hegselmann-Krause opinion dynamic clustering algorithm, the opinion update rule of the voting node and the spontaneous supervisor node can be expressed as N i (x(t))={j∈V|||v i (t)-v j (t)|| 2 <ε}.
[0089] S24: The final reward of the calculation node, the voting node income is Where N v represents the number of valid nodes participating in the vote, p2 is the reward benchmark value set by the system, and W i is the weight assigned to each round of voting in the past ten rounds, and S(V) represents whether the voting node voted in this round. The benefits of the reporting and voting nodes are Where a and γ represent the reward coefficients for reporting behavior set by the system. and Represent voting nodes V i With the autonomous supervisor node A i The number of effective reports and supervisions in this round of nodes.
[0090] 3) The step S3 specifically includes the following steps:
[0091] S31: Distribute the calculated reward amount to the corresponding node.
[0092] Example 3
[0093] This embodiment 3 provides a non-transitory computer-readable storage medium, which is used to store computer instructions. When the computer instructions are executed by a processor, the centralized comprehensive evaluation and governance method of blockchain for Web3.0 as described above is implemented. The method includes:
[0094] Determine whether the node participates in the voting, conduct the voting, count the number of nodes participating in the voting, and determine the effective reward issuance period;
[0095] Verify effective reporting and regulatory information, determine nodes that meet the reward conditions, and calculate the specific amount of rewards that each node should receive;
[0096] Execute reward distribution and distribute the calculated reward amount to the corresponding nodes.
[0097] Example 4
[0098] This embodiment 4 provides a computer device, including a memory and a processor, the processor and the memory communicate with each other, the memory stores program instructions that can be executed by the processor, and the processor calls the program instructions to execute the above-mentioned blockchain centralized comprehensive evaluation and governance method for Web3.0, the method comprising:
[0099] Determine whether the node participates in the voting, conduct the voting, count the number of nodes participating in the voting, and determine the effective reward issuance period;
[0100] Verify effective reporting and regulatory information, determine nodes that meet the reward conditions, and calculate the specific amount of rewards that each node should receive;
[0101] Execute reward distribution and distribute the calculated reward amount to the corresponding nodes.
[0102] Example 5
[0103] This embodiment 5 provides an electronic device, including: a processor, a memory, and a computer program; wherein the processor is connected to the memory, the computer program is stored in the memory, and when the electronic device is running, the processor executes the computer program stored in the memory, so that the electronic device executes instructions for implementing the above-mentioned blockchain centralized comprehensive evaluation and governance method for Web3.0, the method comprising:
[0104] Determine whether the node participates in the voting, conduct the voting, count the number of nodes participating in the voting, and determine the effective reward issuance period;
[0105] Verify effective reporting and regulatory information, determine nodes that meet the reward conditions, and calculate the specific amount of rewards that each node should receive;
[0106] Execute reward distribution and distribute the calculated reward amount to the corresponding nodes.
[0107] In summary, the method described in the embodiment of the present invention integrates multiple evaluation indicators of the degree of centralization of blockchain, comprehensively analyzes the degree of centralization of blockchain systems using different consensus protocols, and proposes abstract governance models for different consensus mechanisms. The Hegselmann-Krause (HK) clustering algorithm is used to optimize the reward distribution mechanism to encourage a wide range of participants to take positive and upright behaviors in blockchain governance. On this basis, a three-party evolutionary game model of blockchain governance for Web3.0 based on an incentive mechanism is constructed to evaluate the improved security.
[0108] The method of the present invention makes a comprehensive quantitative assessment of the degree of centralization of blockchain governance. A single indicator cannot fully reflect the degree of centralization of blockchain, and the numerical value is not the only basis for judging the degree of centralization. The changing trend of each indicator should be observed, abnormal situations should be identified, and a comprehensive and comprehensive analysis should be conducted in combination with the actual situation. This method uses the Nakamoto coefficient, the Gini coefficient, and the Shannon entropy indicators to complementarily measure the degree of centralization of common blockchains from three aspects: the number of blockchain network participants that need to be united to destroy the blockchain network, the uniformity of the distribution of encryption algorithm capabilities, and the randomness of the distribution of encryption algorithm capabilities. The three indicators are observed at different granularities such as day, week, and month. A timestamp-based sliding window is introduced, and the original blockchain data is sharded and compared and analyzed according to the granularity. The blockchain governance centralization degree measurement method selects the voting link in blockchain governance as the research object, and makes certain adjustments to the parameters of the three indicators mentioned above that participate in the calculation according to the need to measure the centralization of blockchain governance. The Nakamoto coefficient, Gini coefficient, and Shannon entropy indicator calculation method for measuring the degree of centralization of blockchain governance are proposed, and the window for selecting data to participate in the calculation is adjusted according to the characteristics of the blockchain voting link, and a preliminary blockchain governance centralization degree measurement method is proposed. Therefore, the quantitative measurement of the degree of centralization of blockchain governance proposed by the method described in the present invention is comprehensive.
[0109] The method of the present invention improves the accuracy and fairness of the reward distribution mechanism under the incentive mechanism. By introducing the HK clustering algorithm, the method can cluster nodes that exhibit similar behavioral characteristics and distribute rewards in the form of clusters, thereby reducing the computational burden of executing reward distribution, improving the utilization efficiency of reward resources, and reducing the perception of unfairness caused by reward distribution. This clustering-based reward distribution method not only optimizes the utilization efficiency of reward resources, but also promotes a wider range of participants to take positive and upright behaviors in blockchain governance through collective incentives, reduces the probability of improper behavior, and improves the security of blockchain governance links.
[0110] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
[0111] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0112] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0113] These computer program instructions can also be loaded onto a computer or other programmable data processing device, and a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, so that the instructions executed on the computer or other programmable device provide for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0114] Although the above describes the specific implementation mode of the present invention in conjunction with the accompanying drawings, it is not intended to limit the scope of protection of the present invention. Those skilled in the art should understand that various modifications or variations that can be made by those skilled in the art without creative work on the basis of the technical solution disclosed in the present invention should be included in the scope of protection of the present invention.
Claims
1. A blockchain centralized comprehensive evaluation governance method, characterized in that: include: Determine whether the node participates in the voting, conduct the voting, count the number of nodes participating in the voting, and determine the effective reward issuance period; Verify effective reporting and regulatory information, determine nodes that meet the reward conditions, and calculate the specific amount of rewards that each node should receive; Execute reward distribution and distribute the calculated reward amount to the corresponding nodes.
2. The blockchain centralized comprehensive evaluation and governance method according to claim 1 is characterized in that: Determine whether the node participates in the vote, conduct the vote, count the number of nodes participating in the vote, and determine the effective reward issuance time, including: Voter V i Through the pledge function freeze(amount(token) i ,σ)→P i Get a certain voting right P i , where token represents the type of token required to participate in voting, amount(token) i Representative Voter V i The amount of tokens pledged, the parameter σ controls the voting rights obtained by each token; the candidate group C, the voting group V and the spontaneous supervisor group A conduct a three-party game interaction; the strategy space of the candidate group C is S C ={S C1 ,S C2 } = {bribe, no bribe}, the strategy space of the voting group V is S V ={S V1 ,S V2 }={accept, report}, the strategy space of the spontaneous supervisor group A is S A ={S A1 ,S A2 }={supervision, no supervision}; candidate nodes decide whether to take bribery actions, voting nodes decide whether to report, and spontaneous supervisor nodes decide whether to perform supervisory functions. The strategy choices of candidate group C, voting group V and spontaneous supervisor group A are independent of each other and do not affect each other; after each round of elections, the number of participating nodes is counted and the effective reward issuance period is determined.
3. The blockchain centralized comprehensive evaluation and governance method according to claim 1 is characterized in that: Verify effective reporting and regulatory information, determine nodes that meet the reward conditions, and calculate the specific amount of rewards that each node should receive, including: Based on the transaction information generated in the main voting phase, verify effective reporting and supervision behaviors, and confirm the nodes that meet the reward conditions in each round of voting; Define voting node V i point of view; Define the autonomous supervisor A i point of view; Calculate the opinions of the voter nodes and the spontaneous supervisor nodes and the updated opinions, and determine the opinion update rules of the voter nodes and the spontaneous supervisor nodes according to the Hegselmann-Krause opinion dynamic clustering algorithm; The final reward of the computing node; The benefits of voting nodes are: Where N v represents the number of valid nodes participating in the vote, p2 is the reward benchmark value set by the system, and W i is the weight assigned to each round of voting in the past ten rounds, and S(V) represents whether the voting node votes in this round.
4. The blockchain centralized comprehensive evaluation and governance method according to claim 2 is characterized in that: The node benefits for reporting and voting are: Where a and γ represent the reward coefficients for reporting behavior set by the system. and Represent voting nodes V i With the autonomous supervisor node A i The number of effective reports and supervisions in this round of nodes.
5. The blockchain centralized comprehensive evaluation and governance method according to claim 2 is characterized in that: The view updating rule is: N i (x(t))={j∈V|||v i (t)-v j (t)|| 2 <ε}。 6. The blockchain centralized comprehensive evaluation and governance method according to claim 2 is characterized in that: Define voting node V i The viewpoint is v i =(δ1,δ2), where To measure the recent voting performance, δ2 = vote n (V i ) / vote n +(tT) / T is an indicator to measure the performance of this round of voting, where W i is the weight assigned to each round of voting in the past ten rounds. S(V) represents whether the voting node has voted in this round. n (V i ) represents the nth round V i The number of votes cast by the node, vote n Represents the total number of votes in the nth round of voting; Define the autonomous supervisor A i The viewpoint is a i =(ρ1,ρ2), where To measure the recent monitoring performance, ρ2 = monitoring n (A i ) / monitoring n An indicator to measure the performance of this round of voting.
7. A blockchain centralized comprehensive evaluation and governance system, characterized in that: include: The voting module is used to determine whether the node participates in the voting, conduct the voting, count the number of nodes participating in the voting, and determine the effective reward issuance period; Verification and calculation module, used to verify effective reporting and regulatory information, determine nodes that meet the reward conditions, and calculate the specific amount of rewards that each node should receive; The allocation module is used to execute reward allocation and distribute the calculated reward amount to the corresponding nodes.
8. A non-transitory computer-readable storage medium, characterized in that: The non-transitory computer-readable storage medium is used to store computer instructions. When the computer instructions are executed by the processor, the blockchain centralized comprehensive assessment and governance method as described in any one of claims 1-6 is implemented.
9. A computer device, characterized in that: It includes a memory and a processor, the processor and the memory communicate with each other, the memory stores program instructions that can be executed by the processor, and the processor calls the program instructions to execute the blockchain centralized comprehensive assessment and governance method as described in any one of claims 1-6.
10. An electronic device, characterized in that: include: A processor, a memory and a computer program; wherein the processor is connected to the memory, the computer program is stored in the memory, and when the electronic device is running, the processor executes the computer program stored in the memory so that the electronic device executes instructions for implementing the blockchain centralized comprehensive assessment and governance method as described in any one of claims 1-6.
Citation Information
Cited By
Decentralization-based, secure and extensible block chain state identification method
CN121333518A
