CN112235425A - Block chain mine pool forming method, device and system and readable storage medium - Google Patents
Block chain mine pool forming method, device and system and readable storage medium Download PDFInfo
- Publication number
- CN112235425A CN112235425A CN202011461836.3A CN202011461836A CN112235425A CN 112235425 A CN112235425 A CN 112235425A CN 202011461836 A CN202011461836 A CN 202011461836A CN 112235425 A CN112235425 A CN 112235425A
- Authority
- CN
- China
- Prior art keywords
- node
- edge server
- user
- server node
- user node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
-
- 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/14—Session management
- H04L67/146—Markers for unambiguous identification of a particular session, e.g. session cookie or URL-encoding
Abstract
The invention discloses a block chain mine pool forming method, a device, a system and a computer readable storage medium, wherein the method allocates IDs for all user nodes and edge server nodes in a community, is used for resource transaction between the user nodes and the edge server nodes, obtains a first credit value of each edge server node according to the initial scoring of each user node aiming at the corresponding edge server node in the current scoring period, obtains a second credit value of each user node according to the activity of each user node in the current scoring period, screens each first credit value and each second credit value according to a first screening condition and a second screening condition, screens each honest server node and each honest user node which meet the requirements to form a mine pool, and the invention is beneficial to improving the quality and the screening efficiency of miners, the forming time of the high-quality ore pool is shortened, the quality of the ore pool is improved, and the process of digging the ore is facilitated.
Description
Technical Field
The present invention relates to the field of block chain technologies, and in particular, to a method, an apparatus, a system, and a computer-readable storage medium for forming a mine pool of a block chain.
Background
With the rapid development of the 6G field of massive Internet of things and edge computing, the number of equipment nodes in the environment of massive Internet of things is increased dramatically, resource transaction between an edge server and equipment is very frequent, and although the block chain technology can verify transaction validity and ensure that transaction data cannot be tampered, the huge transaction data can cause the reduction of efficiency and quality of qualified miner screening in the block chain technology, so that the time for forming a high-quality mine pool is long, the quality is affected, and the mining process can be further affected.
In view of the above, how to provide a method, an apparatus, a system and a computer readable storage medium for block-chain mine pool formation, which solve the above technical problems, is a problem that needs to be solved by those skilled in the art.
Disclosure of Invention
Embodiments of the present invention provide a method, an apparatus, a system, and a computer-readable storage medium for forming a mine pool of a block chain, which are beneficial to improving the quality and screening efficiency of miners, shortening the time for forming a high-quality mine pool, improving the quality of the mine pool, and facilitating the progress of an excavation process.
In order to solve the above technical problem, an embodiment of the present invention provides a method for forming a mine pit of a block chain, including:
respectively allocating an ID to each user node and each edge server node in a community so that the user nodes and the edge server nodes can communicate according to the corresponding IDs;
calculating a first credit value of each edge server node in a current scoring period according to an initial score of each user node for the corresponding edge server node in the current scoring period;
calculating a second credit value of each user node in the current grading period according to the activity of each user node in the current grading period;
screening out each edge server node with a first credit value meeting a first screening condition from each edge server node as each honest edge server node;
screening out user nodes with second reputation values meeting second screening addition from the user nodes as honest user nodes;
and forming a mine pool by each honest edge server node and each honest user node.
Optionally, the process of calculating, according to the initial score of each user node in the current scoring period for the corresponding edge server node, a first reputation value of each edge server node in the current scoring period is as follows:
obtaining an initial score of an ith user node on a jth edge server node, wherein i belongs to [1, M ], j =1,2,3 …, N, wherein M is the total number of user nodes in the community, and N is the total number of edge server nodes in the community;
when the initial score is not 0, judging whether the initial score is in a first preset range, if so, judging that the ith user node is an honest node, and calculating the actual score of the ith user node for the jth edge server node according to a first calculation relation; if not, the ith user node is a dishonest node, and the actual score of the ith user node for the jth edge server node is determined to be 0;
calculating the respective scoring weight of each user node according to the respective actual score of each user node aiming at the jth edge server node in the current scoring period;
and calculating a first reputation value of the jth edge server node in the current scoring period according to the actual score and the scoring weight corresponding to each user node of the jth edge server node.
Optionally, the first calculation relation is
Wherein, in the step (A),
representing the initial score of the ith user node for the jth edge server node,
representing the actual rating of the ith user node for the jth edge server node,
is a positive integer and is a non-zero integer,
representing an honest scoring behavior parameter of an ith user node;
then, the method further comprises: after the actual score of the ith user node for the jth edge server node is calculated according to the first calculation relation, calculating a second calculation relation
To pair
The update is performed, wherein,
to represent
The magnitude of the change;
or after the ith user node is a dishonest node, calculating the relational expression according to a third calculation formula
To pair
Updating is carried out;
or, when the initial score is 0, the ith user node aims at the jth edge server nodeActual score of the dots was 0, and the same was maintained
And is not changed.
Optionally, the process of calculating the scoring weight of each user node according to the actual score corresponding to each user node of the jth edge server node in the current scoring period is as follows:
calculating actual scores corresponding to the user nodes of the jth edge server node in the current scoring period according to a fourth calculation relation, and calculating a scoring weight of each user node, wherein the fourth calculation relation is as follows:
then, the process of calculating the first reputation value of the jth edge server node in the current scoring cycle according to the actual score and the scoring weight corresponding to each user node of the jth edge server node is as follows:
calculating a first reputation value of the jth edge server node in the current scoring period according to the fifth calculation relation and the actual score and the scoring weight corresponding to each user node of the jth edge server node, wherein the fifth calculation relation is as follows:
Optionally, the process of screening out each edge server node whose first reputation value meets the first screening condition from each edge server node as each honest edge server node is as follows:
calculating a first reputation value threshold of each edge server node according to a historical reputation value corresponding to each edge server node, wherein:
the first reputation value threshold of the jth edge server node is
，
，
Wherein, in the step (A),
is the jth edge server node
The value of the historical reputation is determined,
representing the average historical reputation value for the jth edge server node,
representing the number of the grading cycles which are currently passed by each edge server node;
calculating a first reputation threshold average value according to each first reputation threshold, and taking the first reputation threshold average value as a server reputation threshold;
screening out each edge server node satisfying a sixth calculation relation from each edge server node as each honest edge server node, wherein the sixth calculation relation is as follows:
Optionally, the process of calculating the second reputation value of each user node in the current scoring period according to the activity of each user node in the current scoring period is as follows:
according to the times f of resource request of the ith user node in the current grading period and the computing power of the ith user node
The duration T of the current grading period and a seventh calculation relational expression are used for calculating the activity degree of the ith user node in the current grading period
Wherein the seventh calculation relationship is:
according to each historical miner age of the ith user node
Token award corresponding to each historical miner age
And an eighth calculation relation for calculating a second reputation value of the ith user node in the current scoring period
Wherein, theThe eighth calculation relationship is:
Optionally, the process of screening out, from the user nodes, user nodes whose second reputation values satisfy the second screening addition as honest user nodes includes:
calculating a second reputation value threshold of each user node according to the historical reputation value corresponding to each user node, wherein:
the first reputation value threshold of the ith edge server node is
，
，
Wherein, in the step (A),
representing a y-th historical reputation value corresponding to the i-th user node,
representing the average historical reputation value for the ith user node,
representing the number of grading cycles that each user node has currently undergone;
calculating a second reputation threshold average value according to each second reputation threshold, and taking the second reputation threshold average value as a user reputation threshold;
screening out user nodes meeting a ninth calculation relational expression from the user nodes as honest user nodes, wherein the ninth calculation relational expression is as follows:
The embodiment of the invention also provides a mine pool forming device of the block chain, which comprises:
the distribution module is used for respectively distributing an ID for each user node and each edge server node in a community so that the user node and the edge server node can communicate according to the corresponding ID;
the first calculation module is used for calculating a first reputation value of each edge server node in the current scoring period according to the initial scoring of each user node for the corresponding edge server node in the current scoring period;
the second calculation module is used for calculating a second credit value of each user node in the current grading period according to the activity of each user node in the current grading period;
the first screening module is used for screening out each edge server node with a first credit value meeting a first screening condition from each edge server node as each honest edge server node;
the second screening module is used for screening out each user node with a second credit value meeting second screening addition from each user node as each honest user node;
and the ore grouping module is used for grouping each honest edge server node and each honest user node into an ore pool.
The embodiment of the invention also provides a mine pool forming system of the block chain, which comprises:
a memory for storing a computer program;
a processor for implementing the steps of the method of mine pool formation of a block chain as described above when executing the computer program.
An embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the steps of the mine pool forming method for the block chain are implemented as described above.
The embodiment of the invention provides a method, a device, a system and a computer readable storage medium for forming a mine pool of a block chain, wherein IDs are distributed to all user nodes and edge server nodes in a community for resource transaction between the user nodes and the edge server nodes, a first credit value of each edge server node is obtained according to the initial scoring of each user node aiming at the corresponding edge server node in the current scoring period, a second credit value of each user node is obtained according to the activity of each user node in the current scoring period, then each first credit value and each second credit value are screened according to the first screening condition and the second screening condition, and each honest server node and each honest user node which meet the requirements are screened to form the mine pool, so that the quality and the screening efficiency of miners are improved, the forming time of the high-quality ore pool is shortened, the quality of the ore pool is improved, and the process of digging the ore is facilitated.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed in the prior art and the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.
Fig. 1 is a schematic flow chart of a method for forming a mine pool of a block chain according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a mine pit forming apparatus of a block chain according to an embodiment of the present invention.
Detailed Description
The embodiment of the invention provides a block chain mine pool forming method, a block chain mine pool forming device, a block chain mine pool forming system and a computer readable storage medium, which are beneficial to improving the quality and screening efficiency of miners, shortening the forming time of high-quality mine pools, improving the quality of the mine pools and promoting the mine digging process.
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, fig. 1 is a schematic flow chart of a mine pool forming method of a block chain according to an embodiment of the present invention. The method comprises the following steps:
it should be noted that, a large number of internet of things nodes are divided into a plurality of communities in advance, each community includes a plurality of user nodes and a plurality of edge server nodes, and for each community, an honest user node and an honest edge server node are screened by the method provided by the present application to form a mine pool, wherein the mine pool forming method of the block chain provided in the embodiment of the present invention is an optimization of a miner screening policy of a POR (Proof of reporting, consensus) mechanism, and each community performs mine pool formation in one mine pool forming period by implementing the following method:
s110: respectively allocating an ID to each user node and each edge server node in a community so that the user nodes and the edge server nodes can communicate according to the corresponding IDs;
specifically, in practical applications, after receiving an application ID request sent by each user node and each edge server node, an ID may be assigned to each user node and each edge server node, where an anonymous ID may be specifically assigned to protect privacy of each node, and communication between the user node and the edge server node may be performed through the ID, where a plurality of user nodes may make resource requests to a plurality of edge server nodes in one scoring period, the edge server node may provide resources for a plurality of user nodes, and these resource transaction records are all stored in a block of a block chain. The user nodes and the edge server nodes can specifically send requests for applying for the ID to the evaluation center node, and the evaluation center node distributes the ID to each user node and each edge server node.
S120: calculating a first credit value of each edge server node in the current scoring period according to the initial scoring of each user node for the corresponding edge server node in the current scoring period;
it should be noted that, for the current scoring period, after each user node makes a resource request and acquires a resource, the user node scores an edge server node providing the resource for the user node, where for an edge server node, a first reputation value of the edge server node may be calculated according to an initial score of each user node scoring the edge server node, so as to calculate a respective first reputation value of each edge server node.
S130: calculating a second credit value of each user node in the current grading period according to the activity of each user node in the current grading period;
it should be noted that the liveness is a basis for measuring that each user node actively participates in resource transaction and honest scoring is performed on the edge server node in a scoring period, and is also one of indexes for evaluating the reputation of the user node, and the higher the liveness is, the more the user node is represented as an honest node, otherwise, the user node may be a lazy or malicious user node. Specifically, in the current scoring period, the second reputation value of the user node in the current scoring period can be calculated according to the activity of the user node.
Specifically, in practical applications, the processes of calculating the first reputation value of each edge server node and the second reputation value of each user node in the current scoring period in S120 and S130 may be performed by the evaluation center node.
S140: screening each edge server node with a first credit value meeting a first screening condition from each edge server node as each honest edge server node;
s150: screening out user nodes with second reputation values meeting second screening addition from the user nodes as honest user nodes;
s160: and forming the ore pool by each honest edge server node and each honest user node.
Specifically, a first screening condition for screening the honest edge server nodes and a second screening condition for screening the honest user nodes may be preset, then the honest edge server nodes are respectively screened from each edge server node according to the two screening conditions, the honest user nodes are screened from each user node, and each honest edge server node and each honest user node are added to the mine pond to form the mine pond. The honest nodes can be screened for each edge server node and each user node through the filtering nodes.
Further, in the above S120, the process of calculating the first reputation value of each edge server node in the current scoring period according to the initial score of each user node for the corresponding edge server node in the current scoring period may specifically be:
obtaining an initial score of an ith user node on a jth edge server node, wherein i belongs to [1, M ], j =1,2,3 …, N, wherein M is the total number of user nodes in a community, and N is the total number of edge server nodes in the community;
when the initial score is not 0, judging whether the initial score is in a first preset range, if so, determining that the ith user node is an honest node, and calculating the actual score of the ith user node for the jth edge server node according to a first calculation relational expression; if not, the ith user node is a dishonest node, and the actual score of the ith user node for the jth edge server node is determined to be 0;
calculating the respective scoring weight of each user node according to the actual score corresponding to each user node of the jth edge server node in the current scoring period;
and calculating a first reputation value of the jth edge server node in the current scoring period according to the actual score and the scoring weight corresponding to each user node of the jth edge server node.
It should be noted that, in this embodiment, for one edge server node, the edge server node provides resources to a plurality of user nodes, the user nodes score the edge server node and give respective initial scores, and each initial score is not zero, and for other user nodes that do not score the edge server node, it may be considered that the initial scores of the user nodes for the edge server node are 0.
Specifically, j =1,2,3 …, N in this embodiment is for the jth edge server node, where the initial score of the ith user node for the jth edge server node is
If the initial score is not 0 and is within the first preset range { alpha, beta }, it indicates that the ith user node is an honest user node, and at this time, the corresponding actual score is calculated according to the initial score and a first calculation relation, wherein the first calculation relation is
Wherein, in the step (A),
representing the initial score of the ith user node for the jth edge server node,
representing the actual rating of the ith user node for the jth edge server node,
is a positive integer and is a non-zero integer,
representing an honest scoring behavior parameter of an ith user node; and calculating the relational expression according to the second
To pair
For the ith user node
The update is performed, wherein,
to represent
The magnitude of the change; when the initial score is not 0 and is not within the first preset range { alpha, beta }, the ith user node is a dishonest node, and the third calculation relational expression is used
To pair
Updating is carried out; when the initial score is 0, the actual score of the ith user node for the jth edge server node is 0, and the actual score is kept
And is not changed.
It should be noted that each user node corresponds to one user honest scoring behavior parameter, and the ith user node honest scoring behavior parameter is used
(i =1,2,3 …, N), and for each user node it
Are all 0, and after the user node has been honesty scored, the corresponding one
The score is increased according to the preset amplitude, the corresponding actual score is calculated according to the first calculation relation, otherwise, after the user node is subjected to dishonest scoring, the score corresponding to the user node is obtained
The value is reduced by a preset margin and its actual score is considered as 0, i.e. its score is discarded; when the initial score of the ith user node for the jth edge server node is 0, it can be regarded that the ith user node does not score the jth edge server node, and the actual score of the ith user node for the jth edge server node is directly regarded as 0 and kept
Unchanged, thereby obtaining the actual scores of all user nodes aiming at the jth edge server node and updated values aiming at each user node
The value is obtained.
Because one edge server node may provide resources for a plurality of user nodes, the number of user nodes is greater than the number of edge server nodes in a scoring period, which may cause the reputation of the edge server nodes to be much greater than the reputation of the user nodes, so that in order to keep the reputation of the user nodes and the reputation of the edge server nodes in a range, a weighted average of actual scores of the plurality of user nodes may be calculated, wherein, that is, after actual scores of each user node for a jth edge server node are obtained, a scoring weight of each user node for the jth edge server node may be obtained according to each actual score, that is, each edge server node corresponds to a respective scoring weight of each user, and then a first reputation value of the jth edge server is obtained according to each scoring weight and each actual score, specifically, the method comprises the following steps:
calculating actual scores corresponding to all user nodes of the jth edge server node in the current scoring period according to a fourth calculation relation, and calculating respective scoring weight of each user node, wherein the fourth calculation relation is as follows:
that is, when a certain user node is a dishonest node or the jth edge server node is not scored, the corresponding actual score is 0, and the corresponding scoring weight is also 0.
Correspondingly, the process of calculating the first reputation value of the jth edge server node in the current scoring period according to the actual score and the scoring weight corresponding to each user node of the jth edge server node is as follows:
calculating a first reputation value of the jth edge server node in the current scoring period according to a fifth calculation relation and the actual scoring and scoring weight corresponding to each user node of the jth edge server node, wherein the fifth calculation relation is as follows:
It should be noted that j =1,2,3 …, N, so as to obtain a first reputation value of each edge server, and may further store the calculated first reputation value into the zone block, where the first reputation value may be specifically stored into a history reputation list corresponding to the jth edge server node in the zone block.
Further, after obtaining each first reputation value, the process of screening each edge server node whose first reputation value satisfies the first screening condition from each edge server node in S10 as each honest edge server node may specifically be:
calculating a first reputation value threshold of each edge server node according to the historical reputation value corresponding to each edge server node, wherein:
the first reputation value threshold of the jth edge server node is
，
，
Wherein, in the step (A),
is the jth edge server node
The value of the historical reputation is determined,
representing the average historical reputation value for the jth edge server node,
representing the number of the grading cycles which are currently passed by each edge server node;
calculating a first reputation threshold average value according to each first reputation threshold, and taking the first reputation threshold average value as a server reputation threshold;
screening out each edge server node meeting a sixth calculation relational expression from each edge server node as each honest edge server node, wherein the sixth calculation relational expression is as follows:
It should be noted that, each historical reputation value corresponding to each edge server node may be specifically obtained from the block, where each historical reputation value of the jth edge server node may be a great curl
，
,…
…，
And then calculating a respective first reputation value threshold of each edge server node, wherein the first reputation value threshold of the jth edge server node is
Then, according to each first credit value threshold value, calculating the average value of the first credit value threshold values
In particular
The average value of the first reputation threshold is the server reputation threshold, and then the relational expression is calculated according to the sixth calculation
And screening the first reputation value corresponding to each edge server node to obtain each edge server node meeting the sixth calculation relation, wherein the edge server nodes are honest edge server nodes and are used for forming the mine pool.
Further, in the step S130, the process of calculating the second reputation value of each user node in the current scoring period according to the activity of each user node in the current scoring period may specifically be:
according to the times f of resource request of the ith user node in the current grading period and the computing power of the ith user node
The duration T of the current grading period and a seventh calculation relational expression are used for calculating the activity of the ith user node in the current grading period
Wherein the seventh calculation relationship is:
according to each historical miner age of the ith user node
Token award corresponding to each historical miner age
And an eighth calculation relation for calculating a second reputation value of the ith user node in the current scoring period
Wherein the eighth calculation relationship is:
It should be noted that the calculation power of the user node and the corresponding historical miner ages are stored in the block body, the calculation power and the historical miner ages corresponding to the user node and the current miner age can be obtained from the block body in the using process, wherein the current miner age is increased by 1 at the previous miner age each time the user participates in the mine group composition, and after the user node miner contributes to the calculation resource and successfully excavates the mine after participating in the mine group composition, the corresponding token reward is obtained, and the token reward obtained by a user node (such as the ith user node) miner in an excavation period is obtained
Is in direct proportion to the ratio of the calculated force H contributed by the user in the mining period to the total calculated force H of the mine pool, wherein,
，
for the scale factor, the obtained token award is accumulated as the user nodes continuously participate in the group pool and the ore excavation process, wherein, one user node continuously participates in the group pool and the ore excavation process, and each miner age of the ith user node
Will correspond to a token award value
If the current miner age of the ith user node is
The accumulated token award is the accumulated token award for the ith user node from the miner age 1 to the miner age Q
Further, the activity of the ith user node, i =1,2,3 … M, can be obtained according to the eighth calculation relation, so as to obtain the activity of each user node.
Further, in the above S150, the process of screening, from the user nodes, the user nodes whose second reputation values satisfy the second screening and adding as honest user nodes may specifically be:
calculating a second reputation value threshold of each user node according to the historical reputation value corresponding to each user node, wherein:
the first reputation value threshold of the ith edge server node is
，
，
Wherein, in the step (A),
representing the y-th historical reputation value corresponding to the i-th user node,
representing the average historical reputation value for the ith user node,
representing the number of grading cycles that each user node has currently undergone;
calculating a second reputation threshold average value according to each second reputation threshold, and taking the second reputation threshold average value as a user reputation threshold; wherein the second reputation value threshold average is
Screening out all user nodes meeting a ninth calculation relation from all the user nodes as all honest user nodes, wherein the ninth calculation relation is as follows:
It should be noted that, each historical reputation value corresponding to each user node may be specifically obtained from the block, where each historical reputation value of the ith user node may be a last leaf
，
,…
…，
And then calculating a respective second reputation value threshold of each user node, wherein the second reputation value threshold of the ith user node is
Then, according to every second credit value threshold value, calculating second credit value threshold value average value
In particular
The average value of the second reputation threshold is the user reputation threshold, and then the relational expression is calculated according to the ninth calculation
And screening the second credit values corresponding to the user nodes to obtain the user nodes meeting the ninth calculation relation, wherein the user nodes are honest user nodes and are used for forming the mine pool.
In addition, after the ore pool is formed by screening out each honest user node and each honest edge server node, the total computing power of the ore pool can be recorded and stored in a process mode, so that token rewards of each honest user node in the current ore excavation period can be calculated.
The method comprises the steps of distributing IDs to all user nodes and edge server nodes in a community, conducting resource transaction between the user nodes and the edge server nodes, obtaining a first credit value of each edge server node according to initial scoring of each user node in a current scoring period aiming at the corresponding edge server node, obtaining a second credit value of each user node according to the activity of each user node in the current scoring period, screening each first credit value and each second credit value according to first screening conditions and second screening conditions, and screening each honest server node and each honest user node which meet requirements to form a mine.
On the basis of the above embodiment, an embodiment of the present invention further provides a mine pool forming apparatus of a block chain, specifically referring to fig. 2, the apparatus including:
the distribution module 21 is configured to distribute an ID to each user node and each edge server node in a community, so that the user node and the edge server node communicate with each other according to the corresponding ID;
the first calculating module 22 is configured to calculate, according to the initial score of each user node for a corresponding edge server node in the current scoring period, a first reputation value of each edge server node in the current scoring period;
the second calculating module 23 is configured to calculate a second reputation value of each user node in the current scoring period according to the activity of each user node in the current scoring period;
the first screening module 24 is configured to screen each edge server node, of which the first reputation value meets the first screening condition, from each edge server node as each honest edge server node;
the second screening module 25 is configured to screen out, from the user nodes, user nodes whose second reputation values satisfy the second screening addition as honest user nodes;
and a mine grouping module 26 for grouping each honest edge server node and each honest user node into a mine pool.
It should be noted that the mine pool forming device of the block chain provided in this embodiment has the same beneficial effects as the mine pool forming method of the block chain provided in the foregoing embodiment, and for the specific description of the mine pool forming method of the block chain related in this embodiment, please refer to the foregoing embodiment, which is not described herein again.
On the basis of the above embodiment, an embodiment of the present invention further provides a mine pit forming system of a block chain, including:
a memory for storing a computer program;
a processor for implementing the steps of the mine pool forming method of a block chain as described above when executing a computer program.
Specifically, the processor in this embodiment may be specifically configured to implement that an ID is respectively allocated to each user node and each edge server node in a community, so that the user node and the edge server node communicate according to the corresponding ID; calculating a first credit value of each edge server node in the current scoring period according to the initial scoring of each user node for the corresponding edge server node in the current scoring period; calculating a second credit value of each user node in the current grading period according to the activity of each user node in the current grading period; screening each edge server node with a first credit value meeting a first screening condition from each edge server node as each honest edge server node; screening out user nodes with second reputation values meeting second screening addition from the user nodes as honest user nodes; and forming the ore pool by each honest edge server node and each honest user node.
The embodiment of the invention also provides a computer readable storage medium, wherein a computer program is stored on the computer readable storage medium, and when being executed by a processor, the computer program realizes the steps of the mine pool forming method of the block chain.
The computer-readable storage medium may include: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. The device disclosed by the embodiment corresponds to the method disclosed by the embodiment, so that the description is simple, and the relevant points can be referred to the method part for description.
It is further noted that, in the present specification, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A method of forming a blockchain mine pit, comprising:
respectively allocating an ID to each user node and each edge server node in a community so that the user nodes and the edge server nodes can communicate according to the corresponding IDs;
calculating a first credit value of each edge server node in a current scoring period according to an initial score of each user node for the corresponding edge server node in the current scoring period;
calculating a second credit value of each user node in the current grading period according to the activity of each user node in the current grading period;
screening out each edge server node with a first credit value meeting a first screening condition from each edge server node as each honest edge server node;
screening out user nodes with second reputation values meeting second screening addition from the user nodes as honest user nodes;
and forming a mine pool by each honest edge server node and each honest user node.
2. The method according to claim 1, wherein the step of calculating the first reputation value of each edge server node in the current scoring cycle according to the initial score of each user node for the corresponding edge server node in the current scoring cycle is:
obtaining an initial score of an ith user node on a jth edge server node, wherein i belongs to [1, M ], j =1,2,3 …, N, wherein M is the total number of user nodes in the community, and N is the total number of edge server nodes in the community;
when the initial score is not 0, judging whether the initial score is in a first preset range, if so, judging that the ith user node is an honest node, and calculating the actual score of the ith user node for the jth edge server node according to a first calculation relation; if not, the ith user node is a dishonest node, and the actual score of the ith user node for the jth edge server node is determined to be 0;
calculating the respective scoring weight of each user node according to the respective actual score of each user node aiming at the jth edge server node in the current scoring period;
and calculating a first reputation value of the jth edge server node in the current scoring period according to the actual score and the scoring weight corresponding to each user node of the jth edge server node.
3. The method of claim 2, wherein the first calculation relationship is
Wherein, in the step (A),
representing the initial score of the ith user node for the jth edge server node,
representing the actual rating of the ith user node for the jth edge server node,
is a positive integer and is a non-zero integer,
representing an honest scoring behavior parameter of an ith user node;
then, the method further comprises: after the actual score of the ith user node for the jth edge server node is calculated according to the first calculation relation, calculating a second calculation relation
To pair
The update is performed, wherein,
to represent
The magnitude of the change;
or after the ith user node is a dishonest node, calculating the relational expression according to a third calculation formula
To pair
Updating is carried out;
or, when the initial score is 0, the ith user node is specific to the jth user nodeThe actual score of the edge server node is 0 and holds
And is not changed.
4. The method according to claim 2, wherein the calculating the scoring weight of each user node according to the actual score corresponding to each user node of the jth edge server node in the current scoring period comprises:
calculating actual scores corresponding to the user nodes of the jth edge server node in the current scoring period according to a fourth calculation relation, and calculating a scoring weight of each user node, wherein the fourth calculation relation is as follows:
then, the process of calculating the first reputation value of the jth edge server node in the current scoring cycle according to the actual score and the scoring weight corresponding to each user node of the jth edge server node is as follows:
calculating a first reputation value of the jth edge server node in the current scoring period according to the fifth calculation relation and the actual score and the scoring weight corresponding to each user node of the jth edge server node, wherein the fifth calculation relation is as follows:
5. The method according to claim 2, wherein the step of screening each edge server node having the first reputation value satisfying the first screening condition from the edge server nodes as the honest edge server nodes comprises:
calculating a first reputation value threshold of each edge server node according to a historical reputation value corresponding to each edge server node, wherein:
the first reputation value threshold of the jth edge server node is
，
，
Wherein, in the step (A),
is the jth edge server node
The value of the historical reputation is determined,
representing the average historical reputation value for the jth edge server node,
representing the number of the grading cycles which are currently passed by each edge server node;
calculating a first reputation threshold average value according to each first reputation threshold, and taking the first reputation threshold average value as a server reputation threshold;
screening out each edge server node satisfying a sixth calculation relation from each edge server node as each honest edge server node, wherein the sixth calculation relation is as follows:
6. The method according to claim 3, wherein the step of calculating the second reputation value of each user node in the current scoring period according to the activity of each user node in the current scoring period comprises:
according to the times f of resource request of the ith user node in the current grading period and the computing power of the ith user node
The duration T of the current grading period and a seventh calculation relational expression are used for calculating the activity degree of the ith user node in the current grading period
Wherein the seventh calculation relationship is:
according to each historical miner age of the ith user node
Token award corresponding to each historical miner age
And an eighth calculation relation for calculating a second reputation value of the ith user node in the current scoring period
Wherein the eighth calculation relationship is:
7. The method of claim 6, wherein the step of screening out the user nodes with the second reputation value satisfying the second screening addition from the user nodes as honest user nodes comprises:
calculating a second reputation value threshold of each user node according to the historical reputation value corresponding to each user node, wherein:
the first reputation value threshold of the ith edge server node is
，
，
Wherein, in the step (A),
representing a y-th historical reputation value corresponding to the i-th user node,
representing the average historical reputation value for the ith user node,
representing the number of grading cycles that each user node has currently undergone;
calculating a second reputation threshold average value according to each second reputation threshold, and taking the second reputation threshold average value as a user reputation threshold;
screening out user nodes meeting a ninth calculation relational expression from the user nodes as honest user nodes, wherein the ninth calculation relational expression is as follows:
8. A block chain mine pit forming apparatus comprising:
the distribution module is used for respectively distributing an ID for each user node and each edge server node in a community so that the user node and the edge server node can communicate according to the corresponding ID;
the first calculation module is used for calculating a first reputation value of each edge server node in the current scoring period according to the initial scoring of each user node for the corresponding edge server node in the current scoring period;
the second calculation module is used for calculating a second credit value of each user node in the current grading period according to the activity of each user node in the current grading period;
the first screening module is used for screening out each edge server node with a first credit value meeting a first screening condition from each edge server node as each honest edge server node;
the second screening module is used for screening out each user node with a second credit value meeting second screening addition from each user node as each honest user node;
and the ore grouping module is used for grouping each honest edge server node and each honest user node into an ore pool.
9. A block chain mine pit forming system, comprising:
a memory for storing a computer program;
a processor for implementing the steps of the mine pool forming method of a block chain according to any one of claims 1 to 7 when executing the computer program.
10. A computer-readable storage medium, characterized in that a computer program is stored thereon, which computer program, when being executed by a processor, carries out the steps of the method of mine pool formation of a block chain according to any one of the claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011461836.3A CN112235425B (en) | 2020-12-14 | 2020-12-14 | Block chain mine pool forming method, device and system and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011461836.3A CN112235425B (en) | 2020-12-14 | 2020-12-14 | Block chain mine pool forming method, device and system and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112235425A true CN112235425A (en) | 2021-01-15 |
| CN112235425B CN112235425B (en) | 2021-03-09 |
Family
ID=74124742
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011461836.3A Active CN112235425B (en) | 2020-12-14 | 2020-12-14 | Block chain mine pool forming method, device and system and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112235425B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113268322A (en) * | 2021-05-17 | 2021-08-17 | 深圳番多拉信息科技有限公司 | Method, system, device and storage medium for calculating resource capacity |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050131848A1 (en) * | 2003-12-10 | 2005-06-16 | Chickering David M. | Scalable methods for learning bayesian networks |
| CN106911470A (en) * | 2017-01-23 | 2017-06-30 | 北京航空航天大学 | A kind of bit coin transaction privacy Enhancement Method |
| CN107945020A (en) * | 2017-11-28 | 2018-04-20 | 浙江师范大学 | A kind of block chain is sustainable to dig ore deposit method and system |
| CN110046035A (en) * | 2018-01-15 | 2019-07-23 | 比特大陆科技有限公司 | System switching method, device and electronic equipment |
| US20190268141A1 (en) * | 2018-02-23 | 2019-08-29 | Samsung Electronics Co., Ltd. | Programmable blockchain solid state drive and switch |
| US20190319861A1 (en) * | 2018-04-13 | 2019-10-17 | The Curators Of The University Of Missouri | Method and system for secure resource management utilizing blockchain and smart contracts |
| US20190392406A1 (en) * | 2018-06-20 | 2019-12-26 | International Business Machines Corporation | Privacy preserving transactions with probabilistic transaction fees |
| CN110910102A (en) * | 2019-10-28 | 2020-03-24 | 三域有限公司 | Ether mill mine pool |
| US10674007B2 (en) * | 2013-02-12 | 2020-06-02 | Unify Square, Inc. | Enhanced data capture, analysis, and reporting for unified communications |
| CN111415141A (en) * | 2020-03-05 | 2020-07-14 | 浙江树人学院（浙江树人大学） | Ore pool computing power distribution method under block interception attack among multiple ore pools |
| CN111431695A (en) * | 2020-03-24 | 2020-07-17 | 武汉理工大学 | Software defined tactical network node credit management method based on block chain |
-
2020
- 2020-12-14 CN CN202011461836.3A patent/CN112235425B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050131848A1 (en) * | 2003-12-10 | 2005-06-16 | Chickering David M. | Scalable methods for learning bayesian networks |
| US10674007B2 (en) * | 2013-02-12 | 2020-06-02 | Unify Square, Inc. | Enhanced data capture, analysis, and reporting for unified communications |
| CN106911470A (en) * | 2017-01-23 | 2017-06-30 | 北京航空航天大学 | A kind of bit coin transaction privacy Enhancement Method |
| CN107945020A (en) * | 2017-11-28 | 2018-04-20 | 浙江师范大学 | A kind of block chain is sustainable to dig ore deposit method and system |
| CN110046035A (en) * | 2018-01-15 | 2019-07-23 | 比特大陆科技有限公司 | System switching method, device and electronic equipment |
| US20190268141A1 (en) * | 2018-02-23 | 2019-08-29 | Samsung Electronics Co., Ltd. | Programmable blockchain solid state drive and switch |
| US20190319861A1 (en) * | 2018-04-13 | 2019-10-17 | The Curators Of The University Of Missouri | Method and system for secure resource management utilizing blockchain and smart contracts |
| US20190392406A1 (en) * | 2018-06-20 | 2019-12-26 | International Business Machines Corporation | Privacy preserving transactions with probabilistic transaction fees |
| CN110910102A (en) * | 2019-10-28 | 2020-03-24 | 三域有限公司 | Ether mill mine pool |
| CN111415141A (en) * | 2020-03-05 | 2020-07-14 | 浙江树人学院（浙江树人大学） | Ore pool computing power distribution method under block interception attack among multiple ore pools |
| CN111431695A (en) * | 2020-03-24 | 2020-07-17 | 武汉理工大学 | Software defined tactical network node credit management method based on block chain |
Non-Patent Citations (3)
| Title |
|---|
| 李凯: "物联网时代地球空间信息学的应用与发展趋势研究", 《测绘地理信息》 * |
| 范丽: "基于自适应零行列式策略的区块链矿池合作演化方法", 《计算机应用》 * |
| 邸剑: "区块链中矿池选择策略的研究与分析", 《计算机应用研究》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113268322A (en) * | 2021-05-17 | 2021-08-17 | 深圳番多拉信息科技有限公司 | Method, system, device and storage medium for calculating resource capacity |
| CN113268322B (en) * | 2021-05-17 | 2023-11-07 | 深圳番多拉信息科技有限公司 | Method, system, device and storage medium for computing owned resource capacity |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112235425B (en) | 2021-03-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114297722B (en) | Privacy protection asynchronous federal sharing method and system based on block chain | |
| CN112416986B (en) | User portrait realizing method and system based on hierarchical personalized federal learning | |
| Agliari et al. | Inflation targeting, recursive inattentiveness, and heterogeneous beliefs | |
| Xie et al. | A multistage stochastic robust optimization model with fuzzy probability distribution for water supply management under uncertainty | |
| CN110991789B (en) | Method and device for determining confidence interval, storage medium and electronic device | |
| CN112235425B (en) | Block chain mine pool forming method, device and system and readable storage medium | |
| CN107194721A (en) | Service recommendation person based on reputation record analysis has found method | |
| Krumme et al. | Lending behavior and community structure in an online peer-to-peer economic network | |
| CN114817946A (en) | Credible execution environment-based federated learning gradient boosting decision tree training method | |
| Adepeju et al. | Anchored k-medoids: a novel adaptation of k-medoids further refined to measure long-term instability in the exposure to crime | |
| Nguyen et al. | Understanding the dynamics of inter-provincial migration in the Mekong Delta, Vietnam: an agent-based modeling study | |
| CN112668871B (en) | Method for dynamically distributing special weights in multi-round group decision | |
| Zlatić et al. | Reduction of systemic risk by means of Pigouvian taxation | |
| CN108595669A (en) | A kind of unordered classified variable processing method and processing device | |
| CN111260468B (en) | Block chain-based data operation method, related equipment and storage medium | |
| WO2020199179A1 (en) | Method and apparatus for determining consensus node, and computer device and storage medium | |
| CN110062023B (en) | Safety education information pushing method, device and equipment | |
| Dambanemuya et al. | Understanding (IR) rational herding online | |
| CN115034788A (en) | Transaction risk assessment method and device, electronic equipment and storage medium | |
| CN111882349A (en) | Data processing method, device and storage medium | |
| Hernández-Chanto | Centralized assignment of students to majors: Evidence from the university of costa rica | |
| CN110889431A (en) | High-frequency professional skill life curve clustering method improved based on K-Means algorithm | |
| Alizadeh et al. | The impact of land tenure security on housing investment at informal settlements (the case of EslamAbad neighborhood, tehran) | |
| Xie et al. | IAPE Exploration under the International Communication Environment Based on Big Data Analysis of Social Network | |
| Song et al. | Contribution Assessment and Comparison of High-Level Universities in the Four Bay Areas: An Analytic Network Process Approach |
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 |