Computing power bidding method and computing power bidding system

Abstract

The invention provides a computing power bidding method and a computing power bidding system, and relates to the technical field of communication. The method comprises the following steps: generating first quotation information according to a real-time computing power resource corresponding to a computing power node and a first random factor corresponding to the computing power node; when it is determined that the real-time computing power resource does not meet the computing power requirement, a computing power task processing request is sent to a subordinate node, and the computing power node and the subordinate node are connected with the user node through a block chain network; in response to a computing power task processing response fed back by the subordinate node, obtaining second quotation information of the subordinate node of the computing power node; according to the first quotation information and the second quotation information, quotation release information is generated and sent to the block chain network, the quotation release information is information for the user node to screen bid-winning nodes, and the bid-winning nodes are used for providing computing power for the user node to achieve the computing power demand of the user node. According to the embodiment of the invention, the utilization efficiency of computing power resources can be improved.

Description

Technical Field

[0001] The present disclosure relates to the field of communication technology, and in particular to a computing power bidding method and a computing power bidding system. Background Art

[0002] A computing power server is a server with certain computing, storage and network connection capabilities, which can meet the computing power needs of users based on its computing power resources.

[0003] Since different computing power servers provide different computing power resources, in order to meet the computing power needs of users, only computing power servers that can meet the computing power needs can make quotations. Although other computing power servers have idle computing power resources, they cannot independently meet the computing power needs and cannot provide computing power servers for user nodes, resulting in a certain amount of computing power resources. Waste. Summary of the invention

[0004] To this end, the present invention provides a computing power bidding method and a computing power bidding system to solve the problem of how to fully utilize computing power resources and avoid wasting computing power resources.

[0005] In a first aspect, the present disclosure provides a computing power bidding method, which is applied to a computing power node, and the computing power node has subordinate nodes. The method includes: generating first quotation information according to real-time computing power resources corresponding to the computing power node and a first random factor corresponding to the computing power node; when it is determined that the real-time computing power resources do not meet the computing power demand, sending a computing power task processing request to the subordinate node, wherein the computing power demand is a demand issued by a user node, the computing power node and its subordinate nodes are connected to the user node through a blockchain network, and the computing power task is a task determined based on the difference information between the computing power demand and the real-time computing power resources; in response to the computing power task processing response fed back by the subordinate node, obtaining second quotation information of the subordinate node of the computing power node; based on the first quotation information and the second quotation information, generating and sending quotation release information to the blockchain network, the quotation release information is information for the user node to screen the winning node, and the winning node is used to provide computing power for the user node to achieve its computing power demand.

[0006] In a second aspect, the present disclosure provides a computing power bidding method, which is applied to the subordinate nodes of the computing power node. The method includes: responding to a computing power task processing request sent by the computing power node, obtaining a computing power task, wherein the computing power task is a task determined based on the difference information between the computing power demand published by the user node and the real-time computing power resources of the computing power node; generating second quotation information according to the idle computing power resources corresponding to the subordinate node and the first random factor; sending a computing power task processing response carrying the second quotation information to the computing power node, so that the computing power node can generate and send quotation release information to the blockchain network based on the first quotation information and the second quotation information.

[0007] In a third aspect, the present disclosure provides a computing power bidding system, which includes: a user node connected through a blockchain network, at least two computing power nodes and their subordinate nodes; the computing power node is configured to implement any computing power bidding method applied to the computing power node; the subordinate nodes of the computing power node are configured to implement any computing power bidding method applied to the subordinate nodes of the computing power node; the user node is configured to publish computing power requirements to the blockchain network, and select a winning node based on the quotation release information sent by at least two real-time online nodes, and the winning node is used to provide computing power resources for the user node to achieve its computing power requirements.

[0008] The computing power bidding method and computing power bidding system disclosed in the present invention generate first quotation information according to the real-time computing power resources corresponding to the computing power node and the first random factor corresponding to the computing power node to determine the quotation corresponding to the real-time computing power resources provided by the computing power node; when it is determined that the corresponding real-time computing power resources do not meet the computing power demand, send a computing power task processing request to the subordinate node so that the subordinate node can cooperate with the computing power node to make a quotation together, so that the computing power resources of the computing power node and its subordinate nodes can participate in the computing power bidding process, thereby reducing the waste of computing power resources, wherein the computing power task is a task determined based on the difference information between the computing power demand and the real-time computing power resources, therefore, in the subordinate node When the node receives the computing power task processing request, it can clearly know how much computing power resources need to be provided for the computing power node. When the idle computing power resources of the subordinate node can meet the computing power task, it will feedback the computing power task processing response to the computing power node, thereby obtaining the second quotation information of the subordinate node of the computing power node; then, based on the first quotation information and the second quotation information, it generates quotation release information and sends the quotation release information to the user node. When the user node obtains the quotation release information, it compares the quotation release information with the quotation release information released by other computing power nodes, so as to screen out the best winning node, and use the winning node to provide computing power for the user node to achieve its computing power requirements. BRIEF DESCRIPTION OF THE DRAWINGS

[0009] The accompanying drawings are used to provide a further understanding of the embodiments of the present disclosure and constitute a part of the specification. Together with the embodiments of the present disclosure, they are used to explain the present disclosure and do not constitute a limitation of the present disclosure. The above and other features and advantages will become more apparent to those skilled in the art by describing detailed example embodiments with reference to the accompanying drawings, in which:

[0010] Figure 1 A schematic diagram showing a flow chart of a computing power bidding method provided by an embodiment of the present disclosure;

[0011] Figure 2 A schematic diagram showing a flow chart of another computing power bidding method provided by an embodiment of the present disclosure;

[0012] Figure 3 A block diagram showing a computing power bidding system provided by an embodiment of the present disclosure is shown;

[0013] Figure 4 A block diagram showing another computing power bidding system provided by an embodiment of the present disclosure is shown;

[0014] Figure 5 A flowchart showing a working method of a computing power bidding system provided by an embodiment of the present disclosure is shown;

[0015] Figure 6 A block diagram showing a computing node device provided by an embodiment of the present disclosure is shown;

[0016] Figure 7 A block diagram showing the composition of a subordinate node of a computing power node device provided by an embodiment of the present disclosure;

[0017] Figure 8 A block diagram of a composition of an electronic device provided by an embodiment of the present disclosure is shown. DETAILED DESCRIPTION

[0018] The specific embodiments of the present disclosure are described in detail below in conjunction with the accompanying drawings. It should be understood that the specific embodiments described herein are only used to illustrate and explain the present disclosure and are not intended to limit the present disclosure. For those skilled in the art, the present disclosure can be implemented without the need for some of these specific details. The following description of the embodiments is only intended to provide a better understanding of the present disclosure by illustrating examples of the present disclosure.

[0019] In order to make the objectives, technical solutions and advantages of the present disclosure more clear, the embodiments of the present disclosure will be further described in detail below with reference to the accompanying drawings.

[0020] In a first aspect, an embodiment of the present disclosure provides a computing power bidding method.

[0021] Figure 1 A flowchart of a computing power bidding method provided by an embodiment of the present disclosure is shown. The computing power bidding method can be applied to computing power nodes. Figure 1 As shown, the computing power bidding method includes but is not limited to the following steps.

[0022] Step S101, generating first quotation information according to the real-time computing power resources corresponding to the computing power node and the first random factor corresponding to the computing power node.

[0023] Among them, the first random factor is a calculation factor randomly generated by the supervisory node according to the blockchain identifier of the computing power node.

[0024] It should be noted that each computing power node corresponds to a random factor, which has a certain degree of randomness. However, since the random factors corresponding to each computing power node are different, each computing power node can process the information it wants to send based on its corresponding random factor to ensure that the information it sends is not known to third-party devices during the transmission process, thereby improving the security of information transmission.

[0025] Step S102: When it is determined that the real-time computing power resources do not meet the computing power requirements, a computing power task processing request is sent to the subordinate node.

[0026] Among them, computing power demand is the demand published by user nodes. The computing power node and its subordinate nodes are connected to the user node through the blockchain network.

[0027] The computing task processing request includes a computing task, which is a task determined based on the difference information between the computing demand and the real-time computing resources.

[0028] By sending computing task processing requests to subordinate nodes, subordinate nodes can assist computing nodes in making quotations together, and the idle computing resources of subordinate nodes can be fully utilized, thereby improving the utilization efficiency of computing resources.

[0029] Step S103, in response to the computing power task processing response fed back by the subordinate node, obtain the second quotation information of the subordinate node of the computing power node.

[0030] The second quotation information is the real quotation value determined by the subordinate node according to its idle computing resources, and the quotation information determined by the first random factor.

[0031] Since the computing power node and its subordinate nodes use the same random factor (i.e., the first random factor) when quoting, the computing power node and its subordinate nodes will be treated as a whole when reporting the value to the outside world. This not only integrates the computing power resources of the computing power node and its subordinate nodes, but also enables user nodes to have more computing power resource options.

[0032] Step S104: Generate and send quotation release information to the blockchain network based on the first quotation information and the second quotation information.

[0033] Among them, the quotation release information is used for user nodes to screen the winning nodes, and the winning nodes are used to provide computing power for user nodes to meet their computing power needs.

[0034] The winning node is the node with the best cost-effectiveness among all computing power nodes. Not only does its computing power capacity meet the computing power requirements of the user node, but the bid of the winning node is better than other computing power nodes to meet the budget of the user node.

[0035] In this embodiment, first quotation information is generated according to the real-time computing power resources corresponding to the computing power node and the first random factor corresponding to the computing power node to determine the quotation corresponding to the real-time computing power resources provided by the computing power node; when it is determined that the corresponding real-time computing power resources do not meet the computing power demand, a computing power task processing request is sent to the subordinate node, so that the subordinate node can cooperate with the computing power node to make a quotation together, so that the computing power resources of the computing power node and its subordinate nodes can participate in the computing power bidding process, thereby reducing the waste of computing power resources. The computing power task is a task determined based on the difference information between the computing power demand and the real-time computing power resources. Therefore, when the subordinate node receives the computing power task, the computing power task is sent to the subordinate node. When a computing task is processed, it can clearly know how much computing power resources are needed to be provided to the computing power node. When the idle computing power resources of the subordinate node can meet the computing power task, it will feedback the computing power task processing response to the computing power node, thereby obtaining the second quotation information of the subordinate node of the computing power node; then, according to the first quotation information and the second quotation information, it generates quotation release information, and sends the quotation release information to the user node. When the user node obtains the quotation release information, it compares the quotation release information with the quotation release information released by other computing power nodes, so as to screen out the best winning node, and use the winning node to provide computing power for the user node to achieve its computing power needs.

[0036] In some exemplary embodiments, the computing power task processing request further includes: a wake-up instruction. The computing power bidding method further includes: when the working state of the subordinate node of the computing power node is a dormant state, waking up the subordinate node of the computing power node based on the wake-up instruction.

[0037] Among them, when the working state of the subordinate node of the computing power node is a dormant state, the wake-up instruction includes the blockchain identifier of the subordinate node of the computing power node. When the subordinate node of the computing power node receives the wake-up instruction, the subordinate node of the computing power node confirms that it needs to change its working state, that is, to change its working state from a dormant state to an activated state.

[0038] Since the working status of the computing power node and its subordinate nodes can be either activated or dormant, by determining the working status of different computing power nodes at different levels, the conversion of the working status of multi-level computing power nodes can be realized, so that different computing power nodes at all levels can participate in the computing power quotation, so that user nodes can obtain better quality computing power services.

[0039] In some exemplary embodiments, the quotation release information also includes difference quotation information.

[0040] The computing power bidding method also includes: obtaining third quotation information published by the paired node from the blockchain network; determining the quotation and value based on the first quotation information and the second quotation information; and determining difference quotation information based on the quotation and value, and the third quotation information.

[0041] Among them, the paired node is a computing power node in the blockchain network that can provide computing power resources for the user node.

[0042] The first quotation information includes a first quotation value, the second quotation information includes a second quotation value, and the third quotation information includes a third quotation value. The third quotation value is a quotation value determined based on a real quotation value of the paired node and a random factor corresponding to the paired node.

[0043] The differential quotation information includes a quotation difference value, which can be calculated in the following manner: calculate the sum of the first quotation value and the second quotation value to obtain the quotation sum value; then, calculate the difference between the quotation sum value and the third quotation value (or, calculate the difference between the third quotation value and the quotation sum value), thereby determining the quotation difference value to reflect the difference in the quotation values ​​of the two computing power nodes.

[0044] It should be noted that in the quotation process, the paired node and the computing power node (including its subordinate nodes) are in a combined relationship, and the two computing power nodes jointly quote to the user node, so that the user node can easily determine which computing power node has a higher quotation and which computing power node has a lower quotation point based on the difference quotation information between the two computing power nodes, thereby screening the computing power nodes.

[0045] Since the quotation release information sent by each computing power node not only includes the bid value of the computing power node (such as the first bid value generated based on the real bid value of the computing power node and the random factor corresponding to the computing power node), but also reflects the difference in bid information between the computing power node and its corresponding paired node, the user node can accurately know the bid difference between it and the paired node without exposing the real bid value of the computing power node (and its subordinate nodes), quickly screen out the winning node from multiple computing power nodes, improve the screening speed of computing power nodes, and ensure the fairness of the bidding process.

[0046] In some exemplary embodiments, the computing power node includes multiple subordinate nodes; the second quotation information includes the sum of the bid values ​​of the multiple subordinate nodes, and the bid value of each subordinate node is determined based on the idle computing power resources of the subordinate node and the random factor corresponding to the subordinate node.

[0047] For example, if the computing power node has k subordinate nodes (e.g., the first subordinate node, the second subordinate node, ..., the kth subordinate node, where k is an integer greater than or equal to 2), the second quotation information is the sum of the quotation values ​​of the k subordinate nodes. For example, if the quotation value corresponding to the first subordinate node is set to M1, the quotation value corresponding to the second subordinate node is set to M2, ..., and the quotation value corresponding to the kth subordinate node is set to Mk, then the sum of the quotation values ​​included in the second quotation information is: M1+M2+...+Mk.

[0048] Among them, Mk is the bidding value obtained by processing (such as adding, or performing difference calculation, etc.) the real bidding value corresponding to the idle computing power resources of the k-th subordinate node using its corresponding random factor.

[0049] In some exemplary embodiments, the blockchain network further includes: a supervisory node.

[0050] Before executing step S101 to generate first quotation information according to the real-time computing power resources corresponding to the computing power node and the first random factor corresponding to the computing power node, the computing power bidding method also includes: obtaining the first random factor from the blockchain network.

[0051] Among them, the first random factor is a calculation factor randomly generated by the supervisory node according to the blockchain identifier of the computing power node.

[0052] In some embodiments, the first random factor can be obtained by the supervisory node processing the blockchain identifier of the computing power node based on a preset random function.

[0053] For example, the supervisory node inputs the blockchain identifier of a computing power node into a preset random function, and the random function outputs a corresponding random value, which can be used as a random factor corresponding to the computing power node.

[0054] Since the random factor has a certain degree of randomness, when the computing power node obtains the corresponding random factor, it can encapsulate the real bid value published by the computing power node based on the random factor and generate the corresponding quotation information, so that the real bid value of the computing power node will not be leaked during the quotation process, thereby ensuring the fairness of the entire computing power bidding process.

[0055] In some exemplary embodiments, the blockchain network further includes: a parent node of the computing power node.

[0056] The computing power bidding method further includes: when the working state of the computing power node is a dormant state, adjusting the working state of the computing power node from the dormant state to the activated state according to a wake-up instruction sent by the upper node;

[0057] And / or, obtain pending computing tasks sent by the upper node from the blockchain network.

[0058] Among them, when the working state of the computing power node is the dormant state, at this time, the computing power node will receive a wake-up command sent by the superior node of the computing power node, so that the computing power node can convert the working state (that is, convert the dormant state to the active state) and participate in the computing power quotation, so as to provide user nodes with more abundant computing power selection options.

[0059] Among them, the pending computing power tasks are used to instruct the computing power nodes to jointly provide computing power quotation information to the user nodes with the upper-level nodes.

[0060] In some embodiments, the pending computing task is a task determined by the superior node based on the difference information between the computing power demand obtained by the superior node and the computing power resources that the superior node can provide in real time. For example, if the computing power demand issued by the user node obtained by the superior node from the blockchain network indicates that the computing power resources required are 100, and the computing power resources that the superior node can provide in real time are 70, then the pending computing task indicates that the computing power resources that the current computing power node needs to provide to its superior node are 30 (i.e., 100-70=30).

[0061] By combining computing power nodes of different levels, computing power resources can be fully utilized to improve the utilization efficiency of computing power resources.

[0062] Figure 2 A schematic diagram of another computing power bidding method provided by an embodiment of the present disclosure is shown. The computing power bidding method can be applied to subordinate nodes of a computing power node. Figure 2 As shown, the computing power bidding method includes but is not limited to the following steps.

[0063] Step S201, in response to a computing task processing request sent by a computing node, obtain a computing task.

[0064] Among them, the computing power task is a task determined based on the difference information between the computing power demand published by the user node and the real-time computing power resources of the computing power node.

[0065] For example, if the computing power resources required in the computing power requirement are set to 10, and the real-time computing power resources of the computing power node are 8, the corresponding difference information is 10-8=2, and the computing power resources provided by the subordinate nodes of the computing power node required by the computing power task are 2.

[0066] When the subordinate nodes of the computing power node match their corresponding idle computing resources with the computing power resources required in the computing power task, if it is determined that its idle computing power resources can meet the computing power resources required in the computing power task, step S202 will be executed to facilitate the joint computing power nodes to jointly bid, so that the idle computing power resources of the subordinate nodes of the computing power node can be used, thereby improving the utilization efficiency of computing power resources.

[0067] Step S202: Generate second quotation information according to the idle computing resources corresponding to the subordinate node and the first random factor.

[0068] Among them, the first random factor is a calculation factor randomly generated by the supervisory node according to the blockchain identifier of the computing power node. Since the first random factor has a certain degree of randomness and corresponds to the computing power node one by one, the real quotation information corresponding to the subordinate node is determined based on the idle computing power resources corresponding to the subordinate node, and the real quotation information and the first random factor are processed, so that the generated second quotation information is not easily cracked by a third-party device during the transmission process, thereby ensuring the transmission security of the real quotation information of the subordinate node.

[0069] Step S203: Send a computing power task processing response carrying the second quotation information to the computing power node.

[0070] After obtaining the computing task processing response, the computing power node can parse the computing task processing response to obtain the second quotation information it carries, so as to clarify the quotation situation of the subordinate nodes. Then, based on the first quotation information and the second quotation information, it generates and sends the quotation release information to the blockchain network, so as to realize the computing power node and its subordinate nodes to make quotations together, so that the computing power resources of the computing power node and its subordinate nodes can be fully utilized, thereby improving the utilization efficiency of computing power resources.

[0071] In some exemplary embodiments, the computing task processing request further includes: a wake-up instruction. The wake-up instruction is used to wake up the subordinate nodes of the computing node.

[0072] The step S201 of responding to the computing task processing request sent by the computing node includes: parsing the received computing task processing request to obtain a wake-up instruction;

[0073] The computing power bidding method also includes: according to the wake-up instruction, converting the working state of the subordinate node of the computing power node from a dormant state to an activated state.

[0074] Among them, when the subordinate node of the computing power node obtains the wake-up instruction carried in the computing power task processing request, the subordinate node clearly knows that the computing power node needs it to provide corresponding computing power resource support. At this time, the subordinate node of the computing power node will change its working state from sleep state to activation state, so as to assist the computing power node to make quotations together, so that the computing power resources of the computing power node and its subordinate nodes can be integrated, and provide computing power services to the user node as a whole, which can not only make full use of the computing power resources of the computing power node and its subordinate nodes, but also enable the user node to obtain more computing power options, thereby improving the user experience.

[0075] In this embodiment, by responding to the computing task processing request sent by the computing node, a computing task is obtained. The computing task is a task determined based on the difference information between the computing demand published by the user node and the real-time computing resources of the computing node. It can clarify the computing processing situation that the computing node needs the current subordinate node to complete, so as to assist the computing node in making a quotation together, so that the idle computing resources of the current subordinate node can be fully utilized, and the utilization efficiency of the computing resources is improved; then, according to the idle computing resources corresponding to the subordinate node and the second random factor, the second quotation information is generated, so that the subordinate node needs to obtain the corresponding return when providing its idle computing resources to the outside through the second quotation information; a computing task processing response carrying the second quotation information is sent to the computing node, so that the computing node can generate and send the quotation release information to the blockchain network according to its own first quotation information and the second quotation information of the subordinate node, so as to realize the computing node and its subordinate nodes to make a quotation together, and improve the utilization efficiency of the computing resources of each computing node in the blockchain network.

[0076] In a second aspect, an embodiment of the present disclosure provides a computing power bidding system.

[0077] Figure 3 FIG. 1 is a block diagram showing a computing power bidding system provided by an embodiment of the present disclosure. Figure 3 As shown, the computing power bidding system includes but is not limited to the following devices: a user node 310 connected through a blockchain network, at least two computing power nodes (e.g., a first computing power node 321, a first computing power node 322) and their subordinate nodes (e.g., the subordinate nodes of the first computing power node 321 include a first subordinate node 3211 and a second subordinate node 3212; the subordinate nodes of the second computing power node 322 include a third subordinate node 3221 and a fourth subordinate node 3222).

[0078] Among them, the computing power node is configured to implement any computing power bidding method applied to the computing power node.

[0079] The subordinate nodes of the computing power node are configured to implement any computing power bidding method applied to the subordinate nodes of the computing power node.

[0080] The user node 310 is configured to publish computing power requirements to the blockchain network, and select a winning node based on the quotation release information sent by at least two real-time online nodes. The winning node is used to provide computing power resources for the user node to achieve its computing power requirements.

[0081] In some exemplary embodiments, the computing power bidding system further includes:

[0082] The supervisory node (not shown in the figure) is configured to obtain the computing power requirements published by the user node from the blockchain network, determine the number of real-time online nodes, generate a random factor corresponding to each real-time online node according to the number of real-time online nodes, and send the corresponding random factor to each real-time online node;

[0083] Among them, the real-time online node includes at least two computing power nodes, and / or subordinate nodes of the computing power nodes.

[0084] The supervisory node randomly generates a random factor corresponding to each real-time online node based on the blockchain identifier of each real-time online node, so that each real-time online node can obtain a random factor corresponding to it, and based on the random factor, the real quotation information of each real-time online node is protected to prevent the quotation information of each real-time online node from being stolen by third-party devices when providing quotation information to the blockchain network, thereby ensuring fairness in the quotation process.

[0085] In addition, the random factors corresponding to each real-time online node can be known by the user node, so that the user node can compare the quotations of each real-time online node based on the random factors corresponding to each real-time online node to determine the most suitable winning node, so that the winning node can provide computing power services for the user node.

[0086] Figure 4 FIG. 2 shows a block diagram of another computing power bidding system provided by an embodiment of the present disclosure. Figure 4 As shown, the computing power bidding system includes but is not limited to the following nodes: user node 410, multiple first-level computing power nodes (such as first-level computing power node 421, first-level computing power node 422, first-level computing power node 423, first-level computing power node 424, first-level computing power node 425, etc.), multiple second-level computing power nodes (such as second-level computing power node 431, second-level computing power node 432, etc.), multiple third-level computing power nodes (such as third-level computing power node 441, third-level computing power node 442, third-level computing power node 443, third-level computing power node 444, etc.), and supervision node 450.

[0087] Among them, the user node 410 is connected to multiple first-level computing nodes using a blockchain network. Each first-level computing node can be used as a bookkeeping node of the blockchain network. In other words, the first-level computing node needs to save the blockchain ledger, while the second-level computing node and the third-level computing node do not need to save the blockchain ledger.

[0088] When the computing power node is a first-level computing power node, its corresponding subordinate nodes include multiple second-level computing power nodes and multiple third-level computing power nodes;

[0089] When the computing power node is a second-level computing power node, its corresponding subordinate nodes include multiple third-level computing power nodes connected to it, and its corresponding upper-level nodes include first-level computing power nodes connected to it.

[0090] When the user node 410 publishes its computing power demand, multiple computing power nodes can quote and bid against each other, so that the user node 410 can select a winning node based on the quotation release information published by multiple computing power nodes. The target winning node is used to provide computing power for the user node 410 to achieve its computing power demand.

[0091] like Figure 5 As shown, the first-level computing power node 422 has two subordinate second-level computing power nodes (i.e., second-level computing power node 431 and second-level computing power node 432), the second-level computing power node 431 has two subordinate third-level computing power nodes (i.e., third-level computing power node 441 and third-level computing power node 442), and the second-level computing power node 432 has two subordinate third-level computing power nodes (i.e., third-level computing power node 443 and third-level computing power node 444).

[0092] In some embodiments, the first-level computing power node can be implemented using an intelligent computing center node, the second computing power node can be implemented using a computing power base node, and the third computing power node can be implemented using a computing power access node.

[0093] Among them, when the blockchain network is initially created, the genesis block includes multiple first-level computing power nodes, and each first-level computing power node corresponds to a blockchain identifier and public key.

[0094] During initialization, the working status of the second-level computing power nodes and the third-level computing power nodes are both in sleep mode to save energy consumption of the computing power nodes, and there is no need to synchronize the ledger information of the blockchain network.

[0095] In the subsequent computing power processing process, the working status of each second-level computing power node and third-level computing power node is determined by its upper-level computing power node (that is, the computing power nodes at each level have the characteristics of step-by-step communication and step-by-step awakening).

[0096] For example, a first-level computing power node can wake up each of its subordinate second-level computing power nodes, and each second-level computing power node can also wake up each of its subordinate third-level computing power nodes.

[0097] For another example, the first-level computing power node sends a broadcast message (the broadcast message includes the blockchain identifier of the first-level computing power node) to each of its subordinate second-level computing power nodes at a preset interval, so that each of its subordinate second-level computing power nodes knows that the first-level computing power node is in an activated state and obtains the computing power tasks issued by the first-level computing power node.

[0098] Figure 5A flowchart of a working method of a computing power bidding system provided by an embodiment of the present disclosure is shown. Figure 5 As shown, the working method of the computing power bidding system includes but is not limited to the following steps.

[0099] In step S501, the user node 410 uses the private key to sign its public key and blockchain identifier, and broadcasts the signed information to the blockchain network to register in the computing power trading system; the user node 410 uses the private key to sign the computing power demand it proposes, and broadcasts the signed computing power demand to the blockchain network.

[0100] Among them, the computing power demand does not specify a specific computing power node to provide computing power services. Therefore, all activated computing power nodes at all levels in the blockchain network can provide their corresponding quotation information to the user node.

[0101] In step S502, the supervisory node 450 obtains the computing power demand signed by the user node 410 from the blockchain network and verifies the signature information therein; if the verification is successful, the supervisory node 450 generates a random factor corresponding to the blockchain identifier of each computing power node based on the blockchain identifier of the computing power nodes at all levels in the blockchain network that it has queried; then, each random factor is sent to the computing power node corresponding to it.

[0102] Among them, if the number of computing power nodes in an activated state at each level in the blockchain network is set to n, and n is an integer greater than 2, then n random factors (such as n random numbers, etc.) are generated accordingly, and then the n random factors are sent to the corresponding computing power nodes respectively.

[0103] For example, the supervisory node 450 generates a random factor R1 corresponding to the second-level computing power node 432, a random factor R2 corresponding to the third-level computing power node 441, and so on.

[0104] Step S503, when the working state of the second-level computing power node 432 is activated, the second-level computing power node 432 will obtain the computing power demand sent by the user node 410 from the blockchain network; the second-level computing power node 432 generates the first quotation information according to its corresponding real-time computing power resources and the first random factor corresponding to the second-level computing power node 432.

[0105] The first quotation information includes a first quotation value.

[0106] If the first random factor corresponding to the second-level computing power node 432 is set to R1, and the computing power quotation corresponding to the real-time computing power resources corresponding to the second-level computing power node 432 is Pd11, then the first quotation value can be represented as Pd11-R1.

[0107] Step S504: When the second-level computing power node 432 determines that its real-time computing power resources do not meet the computing power requirements, it sends a computing power task processing request to its subordinate nodes.

[0108] The computing task processing request includes a wake-up instruction and a computing task. The computing task is a task determined based on the difference information between the computing demand and the real-time computing resources.

[0109] The wake-up instruction is used to wake up the subordinate nodes of the second-level computing power node 432. In other words, the wake-up instruction is used to adjust the working state of the subordinate nodes of the second-level computing power node 432 from a sleep state to an active state.

[0110] like Figure 4 As shown, the subordinate nodes of the second-level computing power node 432 include the third-level computing power node 443 and the third-level computing power node 444.

[0111] When the second-level computing power node 432 obtains the computing power demand sent by the user node 410, the working status of the third-level computing power node 443 and the third-level computing power node 444 are both in sleep mode. At this time, it is necessary to wake up each third-level computing power node first, and then send computing power tasks to each third-level computing power node.

[0112] Step S505, when the third-level computing power node 443 (and / or, the third-level computing power node 444) receives the computing power task processing request, the third-level computing power node 443 (and / or, the third-level computing power node 444) parses the computing power task processing request, obtains the wake-up instruction, and then converts its own working state to the activated state according to the wake-up instruction.

[0113] Step S506: the third-level computing power node 443 (and / or the third-level computing power node 444) generates second quotation information according to its idle computing power resources and the first random factor.

[0114] Among them, the first random factor is the random factor corresponding to the second-level computing power node 432. When the second-level computing power node 432 needs its subordinate nodes to cooperate with it to make a joint quotation, the second-level computing power node 432 will send its corresponding first random factor to each of its awakened subordinate nodes, so that each subordinate node can generate the corresponding quotation information of the subordinate node based on the first random factor.

[0115] For example, if only the third-level computing power node 443 is awakened, and the quotation value corresponding to the idle computing power resources of the third-level computing power node 443 is set to Pd111, the second quotation value included in the second quotation information generated by the third-level computing power node 443 is Pd111-R1.

[0116] For another example, if only the third-level computing power node 444 is awakened, and the quotation value corresponding to the idle computing power resources of the third-level computing power node 444 is set to Pd112, the second quotation value included in the second quotation information generated by the third-level computing power node 444 is Pd112-R1.

[0117] For another example, if the third-level computing power node 443 and the third-level computing power node 444 are awakened at the same time, and the quotation value corresponding to the idle computing power resources of the third-level computing power node 443 is set to Pd111, and the quotation value corresponding to the idle computing power resources of the third-level computing power node 444 is set to Pd112, then the above two third-level computing power nodes generate their corresponding quotation values ​​Pd111-R1 and Pd112-R1 respectively; then, the above two third-level computing power nodes will respectively send their generated quotation values ​​to the second-level computing power node 432.

[0118] In some embodiments, the third-level computing power node 443 will use its own private key to sign Pd111-R1, and then send the signed information to the second-level computing power node 432; similarly, the third-level computing power node 444 will also use its own private key to sign Pd112-R1, and then send the generated signature information (such as computing power task processing response) to the second-level computing power node 432.

[0119] Step S507, when the second-level computing power node 432 receives the computing power task processing response fed back by its subordinate node, it can obtain the second quotation information by parsing the computing power task processing response; and generate quotation release information based on the first quotation information and the second quotation information.

[0120] In some embodiments, the second-level computing power node 432 needs to verify the private key signature carried in the computing power task processing response, and if the verification passes, use a preset algorithm to parse the second quotation information from the computing power task processing response.

[0121] In some embodiments, when the second-level computing power node 432 receives a computing power task processing response sent by its subordinate nodes, the second-level computing power node 432 can also directly use the private key of the second-level computing power node 432 to perform a second signature on the computing power task processing response to indicate that the second quotation information carried in the computing power task processing response is not only quotation information recognized by the subordinate nodes of the second-level computing power node 432, but also quotation information recognized by the second-level computing power node 432.

[0122] In step S508, the second-level computing power node 432 also obtains the third quotation information published by the paired node from the blockchain network; then, according to the first quotation information and the second quotation information, determines the quotation and value; according to the quotation and value, and the third quotation information, determines the difference quotation information, and adds the difference quotation information to the quotation publishing information.

[0123] The paired node is a computing node in the blockchain network that can provide computing resources for the user node 410. For example, the paired node is a subordinate node of the second-level computing node 431: the third-level computing node 441.

[0124] The third quotation information is the quotation information generated by the paired node based on the actual quotation value corresponding to its real-time computing power resources (such as PM111) and the second random factor corresponding to the paired node (such as set to R2).

[0125] In some embodiments, if the third quotation information of the paired node includes a third quotation value of PM111-R2, the difference quotation information of the second-level computing power node 432 relative to the paired node can be represented as PM111-R2-Pd11.

[0126] In some embodiments, the third quotation information is the private key of the third-level computing power node 441, which is information encrypted according to a preset encryption algorithm. When the second-level computing power node 432 obtains the quotation information sent by the third-level computing power node 441 from the blockchain network, the second-level computing power node 432 will first use the public key of the third-level computing power node 441 to verify the quotation information. If the verification passes, the preset decryption algorithm is used to process the verified quotation information to obtain the third quotation information.

[0127] Among them, the preset decryption algorithm and the preset encryption algorithm are corresponding encryption and decryption algorithms.

[0128] Step S509, the second-level computing power node 432 sends the quotation release information to the blockchain network so that the user node 410 obtains the quotation release information.

[0129] The quotation release information includes not only the first quotation information (eg, Pd11-R1) and the second quotation information (eg, Pd111-R1 and / or Pd112-R1), but also quotation difference information (eg, PM111-R2-Pd11).

[0130] Similarly, the paired node will also send the quotation release information it generates to the blockchain network, so the user node 410 can obtain at least two quotation release information.

[0131] For example, if the pairing node is set to the third-level computing power node 441, and its corresponding second random factor is R2, the quotation release information sent by the pairing node includes its own quotation information (e.g., PM111-R2), and the quotation difference information of the pairing node relative to the second-level computing power node 432 (e.g., Pd11-R1-PM111).

[0132] In step S510, the user node 410 applies to the supervisory node 450 for the random factor of each computing power node; then, the quotation release information published by at least two computing power nodes is obtained from the blockchain network; and then the winning node is selected based on the quotation release information published by at least two computing power nodes.

[0133] The winning node is used to provide computing resources for the user node 410 to meet its computing power requirements.

[0134] For example, the user node obtains from the supervisory node 450 the random factor R1 corresponding to the second-level computing power node 432, the random factor R2 corresponding to the third-level computing power node 441, and so on.

[0135] In some embodiments, the user node 410 also verifies the quotation publishing information published by each computing power node to determine whether there are false quotations.

[0136] For example, after the user node 410 obtains the quotation release information of the second-level computing power node 432 and the third-level computing power node 441 respectively, the user node will add R2 to the difference between the quotation value sent by the second-level computing power node 432 and the quotation value of the third-level computing power node 441 (i.e., PM111-R2-Pd11) to obtain a first calculation result (PM111-R2-Pd11+R2); then, add R1 to the difference between the quotation value sent by the third-level computing power node 441 and the second-level computing power node 432 (i.e., Pd11-R1-PM111) to obtain a second calculation result (Pd11-R1-PM111+R1); further, the first calculation result and the second calculation result are added to obtain the sum.

[0137] When the obtained sum value is 0, it indicates that the quotation release information of the second-level computing power node 531 and the third-level computing power node 541 is accurate.

[0138] When the obtained sum is greater than 0, it indicates that the bid of the second-level computing power node 432 (including its subordinate third-level computing power node 443 and third-level computing power node 444) is higher than that of the third-level computing power node 441, so that the optimal winning node is determined based on the difference in bids of different computing power nodes. That is, the winning node is the node that meets the computing power requirements of the user node and has a moderate bid value. In other words, the winning node is the node with the highest cost performance.

[0139] In step S511, the user node 410 uses its own private key to sign the blockchain identifier of the winning node, and sends the signed information to the blockchain network so that each computing power node can know the blockchain identifier of the winning node.

[0140] Among them, the winning node will initiate a transfer transaction record in the blockchain network, and the user node 410 will obtain the corresponding computing power resource usage rights from the winning node based on the actual quotation information of the winning node and the computing power requirements published by the user node 410.

[0141] For example, if the winning node is determined to be the second-level computing power node 432, the user node 410 uses its own private key to sign the blockchain identifier of the second-level computing power node 432, and sends the signed information to the blockchain network.

[0142] Furthermore, when the second-level computing power node 432 determines that it is the winning node, it will generate different computing power tasks based on the computing power requirements, and allocate the computing power tasks to its subordinate third-level computing power nodes 443 and 444, respectively, so that the third-level computing power nodes 443 and 444 can use their idle computing power resources to provide computing power services for the user node 410.

[0143] Among them, when each subordinate node completes the above computing task, the second-level computing node 432 will initiate a transfer transaction with each subordinate node based on the corresponding quotation information of each subordinate node, so that each subordinate node can obtain its corresponding reward.

[0144] In this embodiment, the first quotation information is generated according to the real-time computing power resources corresponding to the computing power node and the first random factor corresponding to the computing power node to determine the quotation corresponding to the real-time computing power resources provided by the computing power node; when it is determined that the corresponding real-time computing power resources do not meet the computing power requirements, a computing power task processing request is sent to the subordinate node, so that the subordinate node can cooperate with the computing power node to make a quotation together, so that the computing power resources of the computing power node and its subordinate nodes can participate in the computing power bidding process, thereby reducing the waste of computing power resources. The computing power task is a task determined based on the difference information between the computing power requirements and the real-time computing power resources. Therefore, when the subordinate node receives the computing power task, the computing power task is determined based on the difference information between the computing power requirements and the real-time computing power resources. When a computing power task processing request is made, it can clearly know how much computing power resources need to be provided to the computing power node. When the idle computing power resources of the subordinate node can meet the computing power task, it will feedback the computing power task processing response to the computing power node, thereby obtaining the second quotation information of the subordinate node of the computing power node; then, based on the first quotation information and the second quotation information, it generates quotation release information and sends the quotation release information to the user node. When the user node obtains the quotation release information, it compares the quotation release information with the quotation release information released by other computing power nodes, so as to screen out the best winning node, and use the winning node to provide computing power for the user node to achieve its computing power needs.

[0145] In a third aspect, an embodiment of the present disclosure provides a computing power node and its subordinate nodes.

[0146] Figure 6 FIG. 1 is a block diagram showing a computing power node device provided by an embodiment of the present disclosure. Figure 6 As shown, the computing power node device 600 includes but is not limited to the following modules.

[0147] The first generating module 601 is configured to generate first quotation information according to the real-time computing power resources corresponding to the computing power node and the first random factor corresponding to the computing power node.

[0148] The first sending module 602 is configured to send a computing power task processing request to a subordinate node when it is determined that the real-time computing power resources do not meet the computing power demand.

[0149] Among them, computing power demand is the demand released by user nodes. The computing power node and its subordinate nodes are connected to the user node through the blockchain network. The computing power task is the task determined based on the difference information between the computing power demand and the real-time computing power resources.

[0150] The first acquisition module 603 is configured to acquire second quotation information of subordinate nodes of the computing power node in response to the computing power task processing response fed back by the subordinate node.

[0151] The processing module 604 is configured to generate and send quotation release information to the blockchain network based on the first quotation information and the second quotation information.

[0152] Among them, the quotation release information is used for user nodes to screen the winning nodes, and the winning nodes are used to provide computing power for user nodes to meet their computing power needs.

[0153] It should be noted that the computing power node device 600 can implement any one of the computing power bidding methods applied to computing power node devices in the present disclosure.

[0154] In this embodiment, a first quotation information is generated by using a first generation module according to the real-time computing power resources corresponding to the computing power node and the first random factor corresponding to the computing power node to determine the quotation corresponding to the real-time computing power resources provided by the computing power node; when it is determined that the corresponding real-time computing power resources do not meet the computing power requirements, a first sending module is used to send a computing power task processing request to the subordinate node, so that the subordinate node can cooperate with the computing power node to make a quotation together, so that the computing power resources of the computing power node and its subordinate nodes can participate in the computing power bidding process, thereby reducing the waste of computing power resources. The computing power task is a task determined based on the difference information between the computing power requirements and the real-time computing power resources. Therefore, when the subordinate node receives the computing power task, the computing power task is sent to the subordinate node. When a computing task is processed by a computing node, it can clearly know how much computing power resources are needed to be provided to the computing node. When the idle computing power resources of the subordinate node can meet the computing task, it will feedback the computing task processing response to the computing node, so that the computing node obtains the second quotation information of the subordinate node of the computing node based on the first acquisition module; then, the processing module is used to generate quotation release information according to the first quotation information and the second quotation information, and send the quotation release information to the user node. When the user node obtains the quotation release information, it will compare the quotation release information with the quotation release information released by other computing nodes, so as to screen out the best winning node, and use the winning node to provide computing power for the user node to achieve its computing power needs.

[0155] Figure 7 The following is a block diagram showing the composition of a subordinate node of a computing power node device provided by an embodiment of the present disclosure. Figure 7 As shown, the subordinate node device 700 includes but is not limited to the following modules.

[0156] The second acquisition module 701 is configured to acquire a computing task in response to a computing task processing request sent by a computing node.

[0157] Among them, the computing power task is a task determined based on the difference information between the computing power demand published by the user node and the real-time computing power resources of the computing power node.

[0158] The second generating module 702 is configured to generate second quotation information according to the idle computing resources corresponding to the subordinate node and the first random factor.

[0159] The second sending module 703 is configured to send a computing task processing response carrying the second quotation information to the computing power node, so that the computing power node can generate and send quotation release information to the blockchain network based on the first quotation information and the second quotation information.

[0160] It should be noted that the subordinate node device 700 can implement any one of the computing power bidding methods applied to subordinate node devices in the present disclosure.

[0161] In this embodiment, a computing task is acquired by a second acquisition module in response to a computing task processing request sent by a computing node. The computing task is a task determined based on the difference information between the computing demand published by the user node and the real-time computing resources of the computing node. The computing processing situation that the computing node needs the current subordinate node to complete can be clearly defined, so as to assist the computing node in making a quotation together, so that the idle computing resources of the current subordinate node can be fully utilized, thereby improving the utilization efficiency of computing resources; then, a second generation module is used to generate second quotation information according to the idle computing resources and the second random factor corresponding to the subordinate node, so as to characterize the subordinate node through the second quotation information that needs to obtain the corresponding return when providing its idle computing resources to the outside; a second sending module is used to send a computing task processing response carrying the second quotation information to the computing node, so that the computing node can generate and send quotation release information to the blockchain network according to its own first quotation information and the second quotation information of the subordinate node, so as to realize that the computing node jointly quotes with its subordinate nodes, thereby improving the utilization efficiency of computing resources of each computing node in the blockchain network.

[0162] It is worth mentioning that all modules involved in this embodiment are logic modules. In practical applications, a logic unit can be a physical unit, a part of a physical unit, or a combination of multiple physical units. In addition, in order to highlight the innovative part of the present disclosure, this embodiment does not introduce units that are not closely related to solving the technical problems proposed by the present disclosure, but this does not mean that there are no other units in this embodiment.

[0163] On the fourth aspect, the embodiments of the present disclosure provide electronic devices, computer-readable media and computer program products, all of which can be used to implement any computing power bidding method in the embodiments of the present disclosure. The corresponding technical solutions and descriptions are referred to the corresponding records in the method part and will not be repeated here.

[0164] Figure 8 A block diagram of a composition of an electronic device provided by an embodiment of the present disclosure is shown.

[0165] like Figure 8 As shown, the electronic device includes: at least one processor 801, at least one memory 802, and one or more I / O interfaces 803. The processor 801, the memory 802, and the I / O interface 803 are interconnected via a bus 804. The memory 802 stores one or more computer programs, and the one or more computer programs are executed by at least one processor 801, so that the at least one processor 801 can implement any one of the computing power bidding methods recorded in the above embodiments.

[0166] Each module in the above electronic device can be implemented in whole or in part by software, hardware, or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute operations corresponding to each module.

[0167] The embodiments of the present disclosure also provide a computer-readable storage medium on which a computer program is stored, wherein the computer program implements any one of the computing power bidding methods described in the above embodiments when executed by a processor. The computer-readable storage medium may be a volatile or non-volatile computer-readable storage medium.

[0168] The embodiments of the present disclosure also provide a computer program product, including a computer-readable code, or a non-volatile computer-readable storage medium carrying the computer-readable code. When the computer-readable code runs in a processor of an electronic device, the processor in the electronic device executes the above-mentioned computing power bidding method.

[0169] Those skilled in the art will appreciate that all or some of the steps, systems, and functional modules / units in the above disclosed methods may be implemented as software, firmware, hardware, and appropriate combinations thereof. In hardware implementations, the division between the functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed by several physical components in cooperation.

[0170] Some physical components or all physical components can be implemented as software executed by a processor, such as a central processing unit, a digital signal processor or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. Such software can be distributed on a computer-readable storage medium, which can include a computer storage medium (or a non-temporary medium) and a communication medium (or a temporary medium). As known to those of ordinary skill in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable program instructions, data structures, program modules or other data). Computer storage media include, but are not limited to, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), static random access memory (SRAM), flash memory or other memory technology, portable compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical disk storage, magnetic cassette, magnetic tape, disk storage or other magnetic storage device, or any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, it is well known to those skilled in the art that communication media typically embodies computer-readable program instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0171] The computer-readable program instructions described herein can be downloaded from a computer-readable storage medium to each computing / processing device, or downloaded to an external computer or external storage device via a network, such as the Internet, a local area network, a wide area network, and / or a wireless network. The network can include copper transmission cables, optical fiber transmissions, wireless transmissions, routers, firewalls, switches, gateway computers, and / or edge servers. The network adapter card or network interface in each computing / processing device receives the computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in the computer-readable storage medium in each computing / processing device.

[0172] The computer program instructions for performing the operation of the present disclosure may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages, including object-oriented programming languages, such as Smalltalk, C++, etc., and conventional procedural programming languages, such as "C" language or similar programming languages. Computer-readable program instructions may be executed completely on a user's computer, partially on a user's computer, as an independent software package, partially on a user's computer, partially on a remote computer, or completely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., using an Internet service provider to connect via the Internet). In some embodiments, an electronic circuit, such as a programmable logic circuit, a field programmable gate array (FPGA), or a programmable logic array (PLA), may be customized by utilizing the state information of the computer-readable program instructions, and the electronic circuit may execute the computer-readable program instructions, thereby realizing various aspects of the present disclosure.

[0173] The computer program product described herein may be implemented in hardware, software, or a combination thereof. In one optional embodiment, the computer program product is embodied as a computer storage medium, and in another optional embodiment, the computer program product is embodied as a software product, such as a software development kit (SDK), etc.

[0174] Various aspects of the present disclosure are described herein with reference to the flowcharts and / or block diagrams of the methods, devices (systems) and computer program products according to the embodiments of the present disclosure. It should be understood that each box in the flowchart and / or block diagram and the combination of each box in the flowchart and / or block diagram can be implemented by computer-readable program instructions.

[0175] These computer-readable program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, thereby producing a machine, so that when these instructions are executed by the processor of the computer or other programmable data processing device, a device that implements the functions / actions specified in one or more boxes in the flowchart and / or block diagram is generated. These computer-readable program instructions can also be stored in a computer-readable storage medium, and these instructions cause the computer, programmable data processing device, and / or other equipment to work in a specific manner, so that the computer-readable medium storing the instructions includes a manufactured product, which includes instructions for implementing various aspects of the functions / actions specified in one or more boxes in the flowchart and / or block diagram.

[0176] Computer-readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device so that a series of operating steps are performed on the computer, other programmable data processing apparatus, or other device to produce a computer-implemented process, thereby causing the instructions executed on the computer, other programmable data processing apparatus, or other device to implement the functions / actions specified in one or more boxes in the flowchart and / or block diagram.

[0177] The flow chart and block diagram in the accompanying drawings show the possible architecture, function and operation of the system, method and computer program product according to multiple embodiments of the present disclosure. In this regard, each box in the flow chart or block diagram can represent a part of a module, program segment or instruction, and the part of the module, program segment or instruction contains one or more executable instructions for realizing the specified logical function. In some alternative implementations, the functions marked in the box can also occur in a sequence different from that marked in the accompanying drawings. For example, two continuous boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, and the execution order between each box can be determined according to the functions involved in each box. It should also be noted that each box in the block diagram and / or flow chart, and the combination of the boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or action, or can be implemented with a combination of dedicated hardware and computer instructions.

[0178] Example embodiments have been disclosed herein, and although specific terms are employed, they are used and should be interpreted only in a general illustrative sense and not for limiting purposes. In some instances, it will be apparent to those skilled in the art that, unless otherwise expressly noted, features, characteristics, and / or elements described in conjunction with a particular embodiment may be used alone or in combination with features, characteristics, and / or elements described in conjunction with other embodiments. Therefore, those skilled in the art will appreciate that various changes in form and detail may be made without departing from the scope of the present disclosure.

Claims

1. A computing power bidding method, applied to a computing power node, wherein the computing power node has subordinate nodes, characterized in that: The method comprises: Generate first quotation information according to the real-time computing power resources corresponding to the computing power node and the first random factor corresponding to the computing power node; When it is determined that the real-time computing power resources do not meet the computing power demand, a computing power task processing request is sent to the subordinate node, wherein the computing power demand is a demand issued by the user node, the computing power node and its subordinate nodes are connected to the user node through a blockchain network, and the computing power task is a task determined based on the difference information between the computing power demand and the real-time computing power resources; In response to the computing task processing response fed back by the subordinate node, obtaining second quotation information of the subordinate node of the computing node; Based on the first quotation information and the second quotation information, generate and send quotation release information to the blockchain network, the quotation release information is used for the user node to screen the winning node, and the winning node is used to provide computing power for the user node to meet its computing power requirements.

2. The method according to claim 1, characterized in that The computing task processing request also includes: a wake-up instruction; The method further comprises: When the working state of the subordinate node of the computing power node is a sleep state, the subordinate node of the computing power node is woken up based on the wake-up instruction.

3. The method according to claim 1, characterized in that: The quotation release information also includes differential quotation information; The method further comprises: Obtaining third quotation information published by a paired node from the blockchain network, wherein the paired node is a computing power node in the blockchain network that can provide computing power resources for the user node; Determining a price and a value according to the first price information and the second price information; The difference quotation information is determined according to the quotation and value, and the third quotation information.

4. The method according to claim 3, characterized in that The computing power node includes multiple subordinate nodes; The second quotation information includes the sum of the quotation values ​​of the plurality of subordinate nodes, and the quotation value of each subordinate node is determined based on the idle computing resources of the subordinate node and the random factor corresponding to the subordinate node.

5. The method according to any one of claims 1 to 4, characterized in that: The blockchain network also includes: a supervisory node; Before generating the first quotation information according to the real-time computing power resources corresponding to the computing power node and the first random factor corresponding to the computing power node, the method further includes: The first random factor is obtained from the blockchain network, where the first random factor is a calculation factor randomly generated by the supervisory node according to the blockchain identifier of the computing power node.

6. The method according to any one of claims 1 to 4, characterized in that The blockchain network also includes: a superior node of the computing power node; The method further comprises: When the working state of the computing power node is a dormant state, according to the wake-up instruction sent by the upper node, the working state of the computing power node is adjusted from the dormant state to the activated state; and / or, Obtain the pending computing power task sent by the upper node from the blockchain network, where the pending computing power task is used to instruct the computing power node to jointly provide computing power quotation information for the user node with the upper node.

7. A computing power bidding method, applied to subordinate nodes of computing power nodes, characterized in that: The method comprises: In response to a computing task processing request sent by the computing node, a computing task is obtained, where the computing task is a task determined based on difference information between a computing demand published by a user node and a real-time computing resource of the computing node; Generate second quotation information according to the idle computing resources corresponding to the subordinate node and the first random factor; A computing task processing response carrying the second quotation information is sent to the computing power node, so that the computing power node can generate and send quotation release information to the blockchain network based on the first quotation information and the second quotation information.

8. The method according to claim 7, characterized in that The computing task processing request further includes: a wake-up instruction; Responding to the computing task processing request sent by the computing node, including: parsing the received computing task processing request to obtain the wake-up instruction; The method also includes: according to the wake-up instruction, converting the working state of the subordinate node of the computing power node from a dormant state to an activated state.

9. A computing power bidding system, characterized in that: include: User nodes, at least two computing nodes and their subordinate nodes connected through the blockchain network; The computing power node is configured to implement the computing power bidding method according to any one of claims 1 to 6; The subordinate node of the computing power node is configured to implement the computing power bidding method according to any one of claims 7 to 8; The user node is configured to publish computing power requirements to the blockchain network, and select a winning node based on the quotation publishing information sent by at least two real-time online nodes. The winning node is used to provide computing power resources for the user node to achieve its computing power requirements.

10. The system according to claim 9, characterized in that The system further comprises: A supervisory node is configured to obtain the computing power requirements published by the user node from the blockchain network, determine the number of the real-time online nodes, generate a random factor corresponding to each of the real-time online nodes according to the number of the real-time online nodes, and send the corresponding random factor to each of the real-time online nodes; Among them, the real-time online node includes the at least two computing power nodes and / or the subordinate nodes of the computing power nodes.

Images