CN109389485B - Block chain dynamic excitation method based on information sharing contribution value in autonomous domain mode - Google Patents
Block chain dynamic excitation method based on information sharing contribution value in autonomous domain mode Download PDFInfo
- Publication number
- CN109389485B CN109389485B CN201811153945.1A CN201811153945A CN109389485B CN 109389485 B CN109389485 B CN 109389485B CN 201811153945 A CN201811153945 A CN 201811153945A CN 109389485 B CN109389485 B CN 109389485B
- Authority
- CN
- China
- Prior art keywords
- committee
- autonomous
- block
- current
- domains
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/04—Payment circuits
- G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
- G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/12—Accounting
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Technology Law (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a block chain dynamic excitation method based on an information sharing contribution value in an autonomous domain mode, which comprises the following steps: and accounting nodes of all autonomous domains in the current committee of the block chain network sequentially execute block outputting operation, and judge whether (M-Q)/N is larger than or equal to P, if so, the current committee carries out comprehensive ranking according to the information sharing contribution value, the wager amount and the credit score in all autonomous domains of the current committee, the K autonomous domains before ranking in the comprehensive ranking result are used as the next committee to be recorded in the block chain network, the current committee judges whether all the autonomous domains complete block outputting in the current block outputting period, and if so, the next committee corresponding to the next committee list is used as the current committee. The invention can solve the technical problems of improper excitation and poor liquidity in the consensus process of the conventional consensus mechanism.
Description
Technical Field
The invention belongs to the technical field of block chains, and particularly relates to a block chain dynamic excitation method based on an information sharing contribution value in an autonomous domain mode.
Background
The block chain (Blockchain) is a decentralized distributed system, the same data can be maintained on a plurality of nodes through Consensus (Consensus), and the transaction process is transparent, traceable and convenient for auditing; the consensus in the block chain is the process that all peers agree on data and processes, and honest nodes are stimulated through block rewards, transaction fees and the like.
The mainstream consensus mechanism in the current blockchain includes Proof of workload (Proof of Work, POW for short) and Proof of rights and interests (Proof of stamp, POS for short). The POW obtains corresponding rewards through a certain workload, and the workload proves the contribution of the POW to the community so as to obtain the rewards, namely the so-called "too much labor"; the POS generates interest by holding money, and the judgment criterion is the money age, which is the number of days the user holds the money, that is, a system for paying interest to the user according to the amount and time the user holds the money.
However, the above-mentioned consensus mechanisms all have some non-negligible problems: firstly, the main object of POW excitation is a miner, the rest participants are not well excited, and the POW excitation does not accord with the actual application requirement, so that the application is difficult to fall on the ground; in addition, POS incentives tend to reward high dollar groups, such that their currency is affected.
Disclosure of Invention
In view of the above defects or improvement needs of the prior art, the present invention provides a block chain dynamic incentive method based on an information sharing contribution value in an autonomous domain mode, which aims to solve the technical problems of inappropriate incentive and poor liquidity in the consensus process of the existing consensus mechanism, and to encourage the occurrence of information sharing behavior by starting from the actual needs of information sharing and dynamically issuing rewards based on factors such as the information sharing contribution value.
To achieve the above object, according to an aspect of the present invention, there is provided a method for dynamically exciting a blockchain based on an information sharing contribution value in an autonomous domain mode, including the steps of:
(1) sequentially executing block output operation by the accounting nodes of all autonomous domains in the current committee of the block chain network, judging whether (M '-Q)/N is more than or equal to P', if so, entering the step (2), otherwise, switching to the accounting node of the next autonomous domain, and continuously executing the block output operation; wherein M 'represents the total number of blocks to be generated in all autonomous domains in the committee in each block generating period, N represents the number of autonomous domains in the committee, Q represents the number of blocks generated in all autonomous domains in the current committee in the block generating period, and P' represents a preset threshold;
(2) the current committee carries out comprehensive ranking according to information sharing contribution values, wager amounts and credit points in all autonomous domains of the current committee, and records K autonomous domains which are ranked first in a comprehensive ranking result as a next committee in a block chain network, wherein the upper limit value of K is 20;
(3) each autonomous domain obtains a next committee list and judges whether the autonomous domain is in a current committee or the next committee list, if so, the step (5) is carried out, and otherwise, the step (4) is carried out;
(4) the pre-accounting node of the autonomous domain judges whether to select to resolve the autonomous domain and exit the block chain network, if so, the process is ended, otherwise, the step (5) is entered;
(5) and (4) judging whether all the self-treatment domains of the current committee complete block output in the current block output period, if so, taking the next committee corresponding to the next committee list as the current committee, returning to the step (1), and otherwise, directly returning to the step (1).
Preferably, the step (2) comprises the steps of:
(2-1) sorting the election weights W of all autonomous domains by the committee according to information sharing contribution values, bet amounts and credit points in all autonomous domains from large to small to obtain K autonomous domains before ranking;
and (2-2) selecting K autonomy domain generation committee lists before the ranking, and writing the autonomy domain generation committee lists into the block as a next committee list.
Preferably, the calculation formula of the election weight is as follows:
W＝V*α+C*β+P*τ
wherein, V represents the deposit amount of the accounting node in the autonomous domain, C represents the total amount of the reward obtained by all the nodes in the autonomous domain as the information contributors to complete information sharing, that is, the information sharing contribution value of all the nodes in the autonomous domain as the information contributors to the autonomous domain, P represents the credit integral of all the nodes in the autonomous domain, and α, β and τ represent adjustable parameters respectively.
Preferably, during the block output operation, the current accounting node reads the transaction amount of the information sharing behavior in the block of the block operation by calling the intelligent contract interface and according to each transaction amount M and the corresponding reward coefficient
Awarding rewards R to information contributorsi：
Wherein
Represents the reward factor for the current time period and has:
where T represents a time period, V' represents a nominal number of awards dispensed during the time period T,
representing the current award coefficient, V 'representing the actual number of awards issued within the time period T, Ti representing the time taken to finish issuing V' awards,
representing the reward factor for the next time period T.
Preferably, during the block export, if a new node wishes to join an autonomous domain in the blockchain network, the node sends its own public key, hash address, related information about the autonomous domain to be joined, and node description information (for example, the node description information may be, for example, a website of a company, a name of the company, etc.) to a committee of the blockchain network, and the committee of the blockchain network joins the node to a member list of the corresponding autonomous domain and establishes a mapping relationship between the node and its own public key, hash address, related information about the autonomous domain to be joined, and node description information in the member list.
Preferably, during the block output, if a new node needs to create a new autonomous domain, the node creates a new autonomous domain according to its own public key, hash address, wager information, description information of the node, allocation policy required by the autonomous domain, and relevant information required by the autonomous domain, and the node becomes a pre-billing node of the autonomous domain.
According to another aspect of the present invention, there is provided a system for dynamically exciting a blockchain based on information sharing contribution values in an autonomous domain mode, comprising:
the first module is used for sequentially executing block output operation by the accounting nodes of all autonomous domains in the current committee of the block chain network, judging whether (M '-Q)/N is more than or equal to P', if so, entering the step (2), otherwise, switching to the accounting node of the next autonomous domain, and continuously executing the block output operation; wherein M 'represents the total number of blocks to be generated in all autonomous domains in the committee in each block generating period, N represents the number of autonomous domains in the committee, Q represents the number of blocks generated in all autonomous domains in the current committee in the block generating period, and P' represents a preset threshold;
the second module is used for comprehensively ranking the current committees according to the information sharing contribution values, the wager amount and the credit points in all autonomous domains of the current committees, and recording K autonomous domains before ranking in a comprehensive ranking result as the next committee in a block chain network, wherein the upper limit value of K is 20;
the third module is used for acquiring a next committee list from each autonomous domain, judging whether the autonomous domain is in the current committee or the next committee list, if so, entering the fifth module, and otherwise, turning to the fourth module;
a fourth module, configured to determine, by the pre-accounting node of the autonomous domain, whether to select to resolve the autonomous domain and exit the blockchain network, if so, ending the process, otherwise, entering the fifth module;
and the fifth module is used for judging whether all the self-treatment domains of the current committee finish block output in the current block output period or not, if so, taking the next committee corresponding to the next committee list as the current committee, returning to the first module, and otherwise, directly returning to the first module.
In general, compared with the prior art, the above technical solution contemplated by the present invention can achieve the following beneficial effects:
(1) the invention can effectively stimulate the user and the node to share the information: because the invention adopts the step (1), the consensus design principle aims at stimulating the information contribution behavior, and attracts and generates more information sharing behaviors through the dynamic change of the system reward in different block-out periods, thereby forming ecology.
(2) The invention can effectively stimulate the transaction to be carried out: because the invention adopts the step (1), after each transaction of the user is packed into the block, the block reward is issued according to the account ratio of the money in the current information sharing contract, and compared with the situation that the reward is stocked, actively conducting the transaction can obtain more benefits, thereby promoting circulation.
Drawings
FIG. 1 is a flowchart illustrating a dynamic excitation method of a blockchain based on information sharing contributions in autonomous domain mode according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. In addition, the technical features involved in the embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
The technical terms of the present invention are explained and explained first:
information sharing behavior: defined by a smart contract, is a set of logical operations for meeting the shared information needs of a real-world business scenario.
Information contributors: a node or user assisting in information sharing in an information sharing behavior.
Information sharing contribution value: and the measurement unit is converted by the reward in the information sharing behavior and is used for measuring the value created by the information sharing behavior.
Credit integration: and the measuring unit is used for measuring the credit-keeping condition of the user in the information sharing behavior, and the mutual evaluation of all the participants after the information sharing behavior is generated through weighted average calculation.
The autonomous domain: the autonomous domain is the minimum logic unit of the output block of the invention and consists of an accounting node and a plurality of common nodes.
Committee: the method comprises the steps that a set of autonomous domains of top K (K < ═ 20) names generated after RANK ranking is performed by common competition (factors such as calculating information contribution values) of all autonomous domains, the autonomous domains as committee members need to be responsible for block output tasks in a certain block output period, and accounting nodes of all autonomous domains are responsible for specific implementation.
Accounting node: the nodes for organizing and creating the autonomous domain are called pre-accounting nodes before the autonomous domain joins the committee, and are responsible for receiving transaction requests after joining the committee, agreeing on results corresponding to user requests in a block chain to generate new blocks, acquiring block rewards and performing distribution operation on the rewards in the domain.
And (3) common nodes: and the nodes participating in the maintenance of the autonomous domain are responsible for maintaining the data generated by the accounting nodes after the autonomous domain joins the committee and supervising the intelligent contract execution result.
The overall thought of the invention is that the global autonomous domain ranking is calculated according to the wager amount of the accounting node, the information contribution value of all the members of the autonomous domain and the credit score by combining the block chain and the information sharing intelligent contract, so that a committee list is generated, and blocks are flowed out by the accounting node of the autonomous domain in the committee. The block-out node issues the information sharing reward according to the product of the reward coefficient and the information sharing reward amount in the current time period, and the reward coefficient is dynamically adjusted according to the coin issuing speed of the system. To prevent node fraud, the accounting node portion deposit is deducted after most node authentication fails.
As shown in fig. 1, the method for dynamically activating a blockchain based on information sharing contribution values in autonomous domain mode of the present invention includes the following steps:
(1) sequentially executing block output operation by the accounting nodes of all autonomous domains in the current committee of the block chain network, judging whether (M '-Q)/N is more than or equal to P', if so, entering the step (2), otherwise, switching to the accounting node of the next autonomous domain, and continuously executing the block output operation;
wherein M ' represents the total number of blocks to be output in all autonomous domains in the committee in each block output period, N represents the number of autonomous domains in the committee, M '/N represents the number of blocks to be output in each autonomous domain in the committee in each block output period, Q represents the number of blocks to be output in all autonomous domains in the committee in the current block output period, and P ' represents a preset threshold value, and the value of the preset threshold value is between 0.2 and 0.4.
During the block output operation, the current accounting node reads the transaction amount of the information sharing behavior in the block of the block operation by calling the intelligent contract interface and according to each transaction amount M and the corresponding reward coefficient
Awarding rewards R to information contributorsi：
Wherein
Represents the reward factor for the current time period and has:
where T represents a time period, V' represents a nominal number of awards dispensed during the time period T,
representing the current award coefficient, V 'representing the actual number of awards issued within the time period T, Ti representing the time taken to finish issuing V' awards,
representing the reward factor in the next time period T;
during the block export, if a new node wishes to join an autonomous domain in the blockchain network, the node sends its own public key, the Hash address, the related information of the autonomous domain to be joined, and node description information (for example, the node description information may be, for example, a website of a company, a name of the company, etc.) to a committee of the blockchain network, and the committee of the blockchain network joins the node in a member list of the corresponding autonomous domain and establishes a mapping relationship between the node and its own public key, the Hash address, the related information of the autonomous domain to be joined, and the node description information in the member list.
During the process of leaving the block, if a new node needs to create a new autonomous domain, the node creates the new autonomous domain according to its own public key, the Hash address, the wager information, the description information of the node, the allocation policy required by the autonomous domain (for example, how to allocate the reward of leaving the block in the autonomous domain), and the relevant information required by the autonomous domain (including the name of the autonomous domain, etc.), and the node becomes the pre-accounting node of the autonomous domain.
By adopting the step, more information sharing behaviors are attracted and generated by rewarding the dynamic change in different block-out periods, so that ecology can be formed; in addition, after each transaction of the user is packaged into a block, the block reward is issued according to the proportion of the amount in the current information sharing contract, and compared with the situation that the reward is stocked, the transaction is actively carried out, more benefits can be obtained, and circulation is promoted.
(2) The current committee carries out comprehensive ranking according to information sharing contribution values, wager amounts and credit points in all autonomous domains of the current committee, and records K autonomous domains which are ranked first in a comprehensive ranking result as a next committee in a block chain network, wherein the upper limit value of K is 20;
specifically, the method comprises the following steps:
(2-1) the committee sorts the election weights W of all autonomous domains according to the information sharing contribution values, the wager amount and the credit points in all autonomous domains from large to small to obtain K autonomous domains before ranking, and the calculation formula of the election weights is as follows:
W＝V*α+C*β+P*τ
wherein, V represents the deposit amount of the accounting node in the autonomous domain, C represents the total amount of the rewards obtained by all the nodes in the autonomous domain as the information contributors to complete information sharing, namely the information sharing contribution value of all the nodes in the autonomous domain as the information contributors to the autonomous domain, and P represents the credit integral of all the nodes in the autonomous domain; alpha, beta and tau respectively represent adjustable parameters, the greater the value of the adjustable parameters, the higher the importance degree of the bet amount, the information sharing contribution value and the credit score, and the lower the importance degree.
(2-2) selecting K autonomy domain generation committee lists before ranking, and writing the K autonomy domain generation committee lists as a next committee list into a block;
(3) each autonomous domain obtains a next committee list and judges whether the autonomous domain is in a current committee or the next committee list, if so, the step (5) is carried out, and otherwise, the step (4) is carried out;
(4) the pre-accounting node of the autonomous domain judges whether to select to resolve the autonomous domain and exit the block chain network, if so, the process is ended, otherwise, the step (5) is entered;
(5) and (4) judging whether all the self-treatment domains of the current committee complete block output in the current block output period, if so, taking the next committee corresponding to the next committee list as the current committee, returning to the step (1), and otherwise, directly returning to the step (1).
In summary, since the invention adopts the step (1), the consensus design principle aims at stimulating the information contribution behavior, and attracts and generates more information sharing behaviors through the dynamic change of the system reward in different block-out periods, thereby forming ecology; in addition, because the invention adopts the step (1), after each transaction of the user is packed into the block, the block reward is issued according to the account ratio of the money in the current information sharing contract, and compared with the situation that the reward is stocked in hands, the transaction is actively carried out, so that more benefits can be obtained, and the circulation is promoted.
It will be understood by those skilled in the art that the foregoing is only a preferred embodiment of the present invention, and is not intended to limit the invention, and that any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (6)
1. A block chain dynamic excitation method based on information sharing contribution values in an autonomous domain mode is characterized by comprising the following steps:
(1) sequentially executing block output operation by the accounting nodes of all autonomous domains in the current committee of the block chain network, judging whether (M '-Q)/N is more than or equal to P', if so, entering the step (2), otherwise, switching to the accounting node of the next autonomous domain, and continuously executing the block output operation; wherein M 'represents the total number of blocks to be generated in all autonomous domains in the committee in each block generating period, N represents the number of autonomous domains in the committee, Q represents the number of blocks generated in all autonomous domains in the current committee in the block generating period, and P' represents a preset threshold; during the block output operation period, the current accounting node reads the transaction amount of the information sharing behavior in the block of the block operation by calling the intelligent contract interface and according to each transaction amount M and the corresponding reward coefficient
Awarding rewards R to information contributorsi：
Wherein
Represents the reward factor for the current time period and has:
where T represents a time period, V' represents a nominal number of awards dispensed during the time period T,
indicating the current prizeThe incentive coefficient, V 'represents the actual number of awards issued within the time period T, Ti represents the time taken for V' awards to be issued,
representing the reward factor in the next time period T; the autonomous domain is a minimum logic unit of an output block and consists of an accounting node and a plurality of common nodes; the committee is a set of autonomous domains with top K names generated by all autonomous domains after common election and ranking, the autonomous domains as committee members need to be responsible for block output tasks in a certain block output period, accounting nodes of all the autonomous domains are responsible for specific implementation, and the upper limit value of K is 20;
(2) the current committee carries out comprehensive ranking according to the information sharing contribution values, the wager amount and the credit points in all autonomous domains of the current committee, and takes K autonomous domains which are ranked before in the comprehensive ranking result as the next committee to be recorded in the block chain network;
(3) each autonomous domain obtains a next committee list and judges whether the autonomous domain is in a current committee or the next committee list, if so, the step (5) is carried out, and otherwise, the step (4) is carried out;
(4) the pre-accounting node of the autonomous domain judges whether to select to resolve the autonomous domain and exit the block chain network, if so, the process is ended, otherwise, the step (5) is entered;
(5) and (4) judging whether all the self-treatment domains of the current committee complete block output in the current block output period, if so, taking the next committee corresponding to the next committee list as the current committee, returning to the step (1), and otherwise, directly returning to the step (1).
2. The method of claim 1, wherein step (2) comprises the steps of:
(2-1) sorting the election weights W of all autonomous domains by the committee according to information sharing contribution values, bet amounts and credit points in all autonomous domains from large to small to obtain K autonomous domains before ranking;
and (2-2) selecting K autonomy domain generation committee lists before the ranking, and writing the autonomy domain generation committee lists into the block as a next committee list.
3. A method for dynamically exciting blockchain according to claim 2, wherein the calculation formula of the election weight is as follows:
W＝V*α+C*β+P*τ
wherein, V represents the deposit amount of the accounting node in the autonomous domain, C represents the total amount of the reward obtained by all the nodes in the autonomous domain as the information contributors to complete information sharing, that is, the information sharing contribution value of all the nodes in the autonomous domain as the information contributors to the autonomous domain, P represents the credit integral of all the nodes in the autonomous domain, and α, β and τ represent adjustable parameters respectively.
4. The method of claim 1, wherein during the out-of-block period, if a new node wishes to join an autonomous domain in the blockchain network, the node sends its own public key, hash address, information about autonomous domains to be joined, and node description information to a committee of the blockchain network, and the committee of the blockchain network adds the node to a member list of the corresponding autonomous domain and establishes a mapping relationship between the node and its own public key, hash address, information about autonomous domains to be joined, and node description information in the member list.
5. The method of claim 1, wherein during the out-of-block period, if a new node needs to create a new autonomous domain, the node creates a new autonomous domain according to its own public key, hash address, betting information, description information of the node, allocation policy required by the autonomous domain, and related information required by the autonomous domain, and the node becomes a pre-booked node of the autonomous domain.
6. A system for dynamically exciting a blockchain based on information sharing contribution values in autonomous domain mode, comprising:
the first module is used for sequentially executing block output operation by the accounting nodes of all autonomous domains in the current committee of the block chain network, judging whether (M '-Q)/N is more than or equal to P', if so, entering the second module, otherwise, switching to the accounting node of the next autonomous domain, and continuously executing the block output operation; wherein M 'represents the total number of blocks to be generated in all autonomous domains in the committee in each block generating period, N represents the number of autonomous domains in the committee, Q represents the number of blocks generated in all autonomous domains in the current committee in the block generating period, and P' represents a preset threshold; during the block output operation period, the current accounting node reads the transaction amount of the information sharing behavior in the block of the block operation by calling the intelligent contract interface and according to each transaction amount M and the corresponding reward coefficient
Awarding rewards R to information contributorsi：
Wherein
Represents the reward factor for the current time period and has:
where T represents a time period, V' represents a nominal number of awards dispensed during the time period T,
representing the current award coefficient, V 'representing the actual number of awards issued within the time period T, Ti representing the time taken to finish issuing V' awards,
representing the reward factor in the next time period T; the autonomous domain is a minimum logic unit of an output block and consists of an accounting node and a plurality of common nodes; the committee is a set of autonomous domains with top K names generated by all autonomous domains after common election and ranking, the autonomous domains as committee members need to be responsible for block output tasks in a certain block output period, accounting nodes of all the autonomous domains are responsible for specific implementation, and the upper limit value of K is 20;
the second module is used for carrying out comprehensive ranking by the current committee according to the information sharing contribution values, the wager amount and the credit points in all autonomous domains of the current committee, and recording the K autonomous domains before ranking in the comprehensive ranking result as the next committee in the block chain network;
the third module is used for acquiring a next committee list from each autonomous domain, judging whether the autonomous domain is in the current committee or the next committee list, if so, entering the fifth module, and otherwise, turning to the fourth module;
a fourth module, configured to determine, by the pre-accounting node of the autonomous domain, whether to select to resolve the autonomous domain and exit the blockchain network, if so, ending the process, otherwise, entering the fifth module;
and the fifth module is used for judging whether all the self-treatment domains of the current committee finish block output in the current block output period or not, if so, taking the next committee corresponding to the next committee list as the current committee, returning to the first module, and otherwise, directly returning to the first module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811153945.1A CN109389485B (en) | 2018-09-30 | 2018-09-30 | Block chain dynamic excitation method based on information sharing contribution value in autonomous domain mode |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811153945.1A CN109389485B (en) | 2018-09-30 | 2018-09-30 | Block chain dynamic excitation method based on information sharing contribution value in autonomous domain mode |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109389485A CN109389485A (en) | 2019-02-26 |
| CN109389485B true CN109389485B (en) | 2021-02-09 |
Family
ID=65419122
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811153945.1A Active CN109389485B (en) | 2018-09-30 | 2018-09-30 | Block chain dynamic excitation method based on information sharing contribution value in autonomous domain mode |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109389485B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109785139A (en) * | 2019-03-14 | 2019-05-21 | 哈尔滨工程大学 | A kind of data sharing motivational techniques based on intelligent contract |
| CN109993004B (en) * | 2019-04-10 | 2020-02-11 | 广州蚁比特区块链科技有限公司 | Block chain autonomous method and system based on credit mechanism |
| CN110175867B (en) * | 2019-04-26 | 2021-07-27 | 华中科技大学 | Block chain excitation method and system based on shared integral |
| CN110189161B (en) * | 2019-04-26 | 2022-06-17 | 华中科技大学 | Block chain consensus method and system for realizing marketing label sharing |
| CN111047454A (en) * | 2019-12-10 | 2020-04-21 | 山东浪潮人工智能研究院有限公司 | Block chain-based open-source community code contribution incentive method and equipment |
| CN111339206B (en) * | 2020-03-11 | 2023-07-18 | 建信金融科技有限责任公司 | Block chain-based data sharing method and device |
| CN111510347B (en) * | 2020-04-08 | 2021-10-26 | 北京链化未来科技有限公司 | Method for improving block chain consensus efficiency |
| CN114531438A (en) * | 2020-10-30 | 2022-05-24 | 中国移动通信有限公司研究院 | Data transmission method and system |
| CN112598515A (en) * | 2020-12-22 | 2021-04-02 | 王斌 | Incentive method applied to block chain and transaction platform |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105591753A (en) * | 2016-01-13 | 2016-05-18 | 杭州复杂美科技有限公司 | Application method of CA certificate on block chain |
| WO2017142931A1 (en) * | 2016-02-15 | 2017-08-24 | Allstate Insurance Company | Early notification of non-autonomous area |
| CN107424066B (en) * | 2017-07-19 | 2020-11-10 | 武汉凤链科技有限公司 | Method and system for establishing consensus mechanism based on value quantity |
| CN107403377A (en) * | 2017-07-19 | 2017-11-28 | 武汉凤链科技有限公司 | A kind of method and its system established an incentive mechanism based on the magnitude of value |
| CN108053137A (en) * | 2017-12-27 | 2018-05-18 | 邵美 | A kind of block chain intelligence contract sort method |
| CN108595467A (en) * | 2018-02-28 | 2018-09-28 | 武汉龙津科技有限公司 | A kind of rewards and punishments user behavior common recognition method and system based on backtracking block chain history |
| CN108377206B (en) * | 2018-03-12 | 2021-04-06 | 众安信息技术服务有限公司 | Method, apparatus and computer-readable storage medium for configuring consensus algorithm |
| CN108429765B (en) * | 2018-05-28 | 2021-10-26 | 北京奇虎科技有限公司 | Method, server and storage medium for realizing domain name resolution based on block chain |
-
2018
- 2018-09-30 CN CN201811153945.1A patent/CN109389485B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN109389485A (en) | 2019-02-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109389485B (en) | Block chain dynamic excitation method based on information sharing contribution value in autonomous domain mode | |
| CN109410054B (en) | Block chain consensus method based on information sharing contribution value in autonomous domain mode | |
| Xiao et al. | How to restrain participants opt out in shared parking market? A fair recurrent double auction approach | |
| Wurman et al. | Specifying rules for electronic auctions | |
| Buchanan et al. | An experiment on protecting intellectual property | |
| Jain et al. | Dual sourcing under suppliers' capacity investments | |
| Sarne et al. | Effective prize structure for simple crowdsourcing contests with participation costs | |
| Meub et al. | Experimental evidence on the resilience of a cap & trade system for land consumption in Germany | |
| CN110517081A (en) | The polynary segmentation marketing management system of point-line-surface | |
| Kim et al. | Determination of equilibrium transaction fees in the Bitcoin network: A rank-order contest | |
| Alahdadi et al. | A truthful and budget-balanced double auction model for resource allocation in cloud computing | |
| Mihet | Who benefits from innovations in financial technology? | |
| Burtch et al. | An empirical examination of the antecedents of contribution patterns in crowdfunded markets | |
| Erkal et al. | Scarcity of ideas and optimal prizes in innovation contests | |
| Barro et al. | Quality improvements in models of growth | |
| Andrei | Information percolation driving volatility | |
| Yang et al. | Open innovation: strategic design of online contests | |
| Olivier et al. | Time-varying incentives in the mutual fund industry | |
| Kaplan et al. | Two-stage contests with preferences over style | |
| Walasek et al. | Endowment effect despite the odds | |
| Naughtin et al. | South African super-exporters: Are they different and what does this mean for policy? | |
| Head et al. | Search, market power, and inflation dynamics | |
| Fudenberg | Tirole's Industrial Regulation and Organization Legacy in Economics | |
| Zhang et al. | Choosing a self-built or an intermediary platform for hosting winner-take-all crowdsourcing contests? | |
| Liljeström | Efficiency of cryptocurrency exchanges: Risk exposure analysis of identical assets |
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 |