Computing power bidding methods and computing power bidding systems

Abstract

This disclosure provides a computing power bidding method and system, relating to the field of communication technology. The method includes: generating first bidding information based on the real-time computing power resources 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 resources do not meet the computing power demand, sending a computing power task processing request to subordinate nodes, wherein the computing power node and its subordinate nodes are connected to the user node through a blockchain network; in response to the computing power task processing response fed back by the subordinate nodes, obtaining second bidding information of the subordinate nodes of the computing power node; and generating and sending bidding announcement information to the blockchain network based on the first and second bidding information, wherein the bidding announcement information is used by the user node to screen for winning nodes, and the winning nodes are used to provide computing power to the user node to meet its computing power demand. According to the embodiments of this disclosure, the utilization efficiency of computing power resources can be improved.

Description

Technical Field

[0001] This disclosure relates to the field of communication technology, specifically to a computing power bidding method and a computing power bidding system. Background Technology

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

[0003] Since different computing power servers provide different computing power resources, only computing power servers that can meet the computing power needs of users can offer a price in order to meet the users' computing power needs. Other computing power servers may have idle computing power resources, but they cannot independently meet the computing power needs and therefore cannot provide computing power servers for user nodes, resulting in a certain waste of computing power resources. Summary of the Invention

[0004] To address this issue, this disclosure provides a computing power bidding method and a computing power bidding system, which solve the problem of how to fully utilize computing power resources and avoid wasting them.

[0005] Firstly, this disclosure provides a computing power bidding method applied to computing power nodes, which have subordinate nodes. The method includes: generating first bidding information based on the 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 nodes, wherein the computing power demand is a demand published 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; responding to the computing power task processing response fed back by the subordinate nodes, obtaining second bidding information of the subordinate nodes of the computing power node; and generating and sending bidding release information to the blockchain network based on the first bidding information and the second bidding information, wherein the bidding release information is used by the user node to select the winning node, and the winning node is used to provide computing power to the user node to meet its computing power demand.

[0006] Secondly, this disclosure provides a computing power bidding method applied to subordinate nodes of a 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 between the computing power demand published by the user node and the real-time computing power resources of the computing power node; generating second bidding information based on the idle computing power resources corresponding to the subordinate node and a first random factor; and sending a computing power task processing response carrying the second bidding information to the computing power node, so that the computing power node can generate and send bidding information to the blockchain network based on the first bidding information and the second bidding information.

[0007] Thirdly, this disclosure provides a computing power bidding system, comprising: user nodes connected through a blockchain network, at least two computing power nodes and their subordinate nodes; computing power nodes configured to implement any computing power bidding method applied to computing power nodes; subordinate nodes of computing power nodes configured to implement any computing power bidding method applied to subordinate nodes of computing power nodes; user nodes configured to publish computing power requirements to the blockchain network, and select a winning node based on the bid publication information obtained from at least two real-time online nodes, wherein the winning node is used to provide computing power resources to the user node to meet its computing power requirements.

[0008] The computing power bidding method and system disclosed herein generate first bidding information based on the real-time computing power resources corresponding to a computing power node and a first random factor corresponding to the computing power node, thereby determining the bidding situation corresponding to the real-time computing power resources provided by the computing power node. If 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 subordinate nodes, enabling subordinate nodes to cooperate with the computing power node in bidding. This ensures that the computing power resources of both the computing power node and its subordinate nodes can participate in the computing power bidding process, reducing the waste of computing power resources. The computing power task is determined based on the difference between the computing power demand and the real-time computing power resources. Therefore, in the subordinate nodes... When a node receives a computing power task processing request, it can determine how much computing power resources it needs to provide to the computing power node. When the idle computing power resources of its subordinate nodes can meet the computing power task, it will send a computing power task processing response back to the computing power node, thereby obtaining the second quotation information of the computing power node's subordinate nodes. Then, based on the first and 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 will compare the quotation release information with the quotation release information released by other computing power nodes in order to select the optimal winning node and use the winning node to provide computing power to the user node to meet its computing power needs. Attached Figure Description

[0009] The accompanying drawings are provided to further illustrate the embodiments of this disclosure and form part of the specification. They are used together with the embodiments of this disclosure to explain the disclosure and do not constitute a limitation thereof. The above and other features and advantages will become more apparent to those skilled in the art from the detailed description of exemplary embodiments with reference to the accompanying drawings, in which:

[0010] Figure 1 A flowchart illustrating a computing power bidding method provided in an embodiment of this disclosure is shown.

[0011] Figure 2 A flowchart illustrating another computing power bidding method provided in an embodiment of this disclosure is shown;

[0012] Figure 3 This diagram shows a block diagram of a computing power bidding system provided in an embodiment of the present disclosure;

[0013] Figure 4 This diagram illustrates a block diagram of another computing power bidding system provided in an embodiment of this disclosure;

[0014] Figure 5 A flowchart illustrating the working method of a computing power bidding system provided in an embodiment of this disclosure is shown.

[0015] Figure 6 This diagram illustrates a block diagram of a computing node device provided in an embodiment of the present disclosure.

[0016] Figure 7 This diagram illustrates the composition of subordinate nodes of a computing node device according to an embodiment of the present disclosure.

[0017] Figure 8 This diagram illustrates a block diagram of an electronic device provided in an embodiment of the present disclosure. Detailed Implementation

[0018] The specific embodiments of this disclosure will be described in detail below with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are for illustration and explanation only and are not intended to limit the scope of this disclosure. Those skilled in the art will recognize that this disclosure can be implemented without some of these specific details. The following description of the embodiments is merely intended to provide a better understanding of this disclosure by illustrating examples.

[0019] To make the objectives, technical solutions, and advantages of this disclosure clearer, the embodiments of this disclosure will be described in further detail below with reference to the accompanying drawings.

[0020] In a first aspect, the present disclosure provides a method for bidding on computing power.

[0021] Figure 1 This diagram illustrates a flowchart of a computing power bidding method provided in an embodiment of this disclosure. This 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: Generate first quotation information based on the real-time computing power resources corresponding to the computing power node and the first random factor corresponding to the computing power node.

[0023] The first random factor is a computation factor randomly generated by the supervisory node based on the blockchain identifier of the computing power node.

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

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

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

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

[0028] By sending computing power task processing requests to subordinate nodes, subordinate nodes can assist computing power nodes in bidding and make full use of the idle computing power resources of subordinate nodes, thereby improving the utilization efficiency of computing power 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 consists of the actual quotation value determined by the subordinate node based on its available computing power resources, and the quotation information determined by the first random factor.

[0031] Since the computing power node and its subordinate nodes all use the same random factor (i.e., the first random factor) when bidding, the computing power node and its subordinate nodes will be regarded as a whole when bidding value. This not only integrates the computing power resources of the computing power node and its subordinate nodes, but also gives user nodes more choices of computing power resources.

[0032] Step S104: Based on the first quotation information and the second quotation information, generate and send quotation publication information to the blockchain network.

[0033] The quotation information is used by user nodes to select winning nodes, which are used to provide computing power to user nodes to meet their computing power needs.

[0034] The winning node is the most cost-effective node among all computing power nodes. Not only does its computing power meet the computing power requirements of the user node, but its price is also better than other computing power nodes to meet the user node's budget.

[0035] In this embodiment, a first bid information is generated based on 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 bid situation corresponding to the real-time computing power resources provided by the computing power node; if 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 subordinate nodes, so that subordinate nodes can cooperate with the computing power node to bid together, so that the computing power resources of the computing power node and its subordinate nodes can participate in the computing power bidding process, 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, it sends a computing power task processing request. When a computing task processing request is made, it can clearly determine how much computing power resources need to be provided to the computing power node. When the idle computing power resources of the subordinate nodes can meet the computing power task, it will send a computing power task processing response back to the computing power node, thereby obtaining the second quotation information of the subordinate nodes 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 will compare the quotation release information with the quotation release information released by other computing power nodes in order to select the optimal winning node and use the winning node to provide computing power to the user node to meet its computing power needs.

[0036] In some exemplary embodiments, the computing power task processing request further includes a wake-up command. The computing power bidding method also includes waking up the subordinate nodes of the computing power node based on the wake-up command when the subordinate nodes of the computing power node are in a dormant state.

[0037] In the case where the subordinate node of the computing power node is in 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, change its working state from dormant state to active state.

[0038] Since computing power nodes and their subordinate nodes can be in an active or dormant state, by determining the working state of different computing power nodes at each level, it is possible to switch the working state of different computing power nodes at multiple levels, so that different computing power nodes at each level can participate in computing power bidding, and user nodes can obtain better computing power services.

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

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

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

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

[0043] The price difference information includes a price difference value, which can be calculated as follows: calculate the sum of the first price value and the second price value to obtain the price sum value; then, calculate the difference between the price sum value and the third price value (or, calculate the difference between the third price value and the price sum value) to determine the price difference value, so as to reflect the difference in the price value of the two computing power nodes.

[0044] It should be noted that during the bidding process, the pairing node and the computing power node (including its subordinate nodes) are in a combined relationship. The two computing power nodes jointly submit bids to the user node so that the user node can easily determine which computing power node has a higher bid and which has a lower bid based on the difference in bid information between the two computing power nodes, thereby filtering the computing power nodes.

[0045] Because the bid information sent by each computing power node not only includes the bid value of that computing power node (e.g., the first bid value generated based on the actual 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, it can enable user nodes to accurately know the bid difference between themselves and their paired nodes without exposing the actual bid value of the computing power node (and its subordinate nodes). This allows for the rapid selection of winning nodes from multiple computing power nodes, improving the selection speed of computing power nodes while ensuring the fairness and impartiality of the bidding process.

[0046] In some exemplary embodiments, the computing power node includes multiple subordinate nodes; the second bidding information includes the sum of the bid values ​​of 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 a computing node has k subordinate nodes (e.g., first subordinate node, second subordinate node, ..., kth subordinate node, where k is an integer greater than or equal to 2), then 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] Where Mk is the value obtained by processing the real value of the idle computing power resources of the k-th subordinate node using its corresponding random factor (e.g., summing, or performing difference calculation, etc.).

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

[0050] Before generating the first bid information based on the real-time computing power resources corresponding to the computing power node and the first random factor corresponding to the computing power node in step S101, the computing power bidding method further includes: obtaining the first random factor from the blockchain network.

[0051] The first random factor is a computation factor randomly generated by the supervisory node based on the blockchain identifier of the computing power node.

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

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

[0054] Because random factors have a certain degree of randomness, when a computing power node obtains its corresponding random factor, it can encapsulate the true bid value published by the computing power node based on the random factor and generate its corresponding bid information. This ensures that the true bid value of the computing power node is not leaked during the bidding process, thus guaranteeing the fairness and impartiality of the entire computing power bidding process.

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

[0056] The computing power bidding method also includes: when the computing power node is in a dormant state, adjusting the working state of the computing power node from a dormant state to an active state according to the wake-up command sent by the superior node;

[0057] And / or, obtain pending computing power tasks sent by superior nodes from the blockchain network.

[0058] When a computing node is in a dormant state, it will receive a wake-up command from its parent node to switch its working state (i.e., switch from dormant to active state) and participate in the computing power bidding, thus providing user nodes with a wider range of computing power options.

[0059] Among them, the computing power tasks to be processed are used to instruct computing power nodes to work with their superior nodes to provide computing power pricing information to user nodes.

[0060] In some embodiments, the computing power task to be processed is determined by the upper-level node based on the difference between the computing power demand it obtains and the computing power resources that the upper-level node can provide in real time. For example, if the computing power demand published by a user node obtained by the upper-level node from the blockchain network indicates that it needs 100 computing power resources, while the computing power resources that the upper-level node can provide in real time are 70, then the computing power task to be processed is to indicate that the current computing power node needs to provide 30 computing power resources to its upper-level node (i.e., 100-70=30).

[0061] By combining computing power nodes of different levels, the idle computing power resources of each node can be fully utilized, thereby improving the efficiency of computing power resource utilization.

[0062] Figure 2 This diagram illustrates a flowchart of another computing power bidding method provided in an embodiment of this disclosure. This computing power bidding method can be applied to subordinate nodes of a computing power node. For example... Figure 2 As shown, the computing power bidding method includes, but is not limited to, the following steps.

[0063] Step S201: In response to the computing task processing request sent by the computing node, obtain the computing task.

[0064] Among them, computing power tasks are tasks determined based on the difference between the computing power demand published by user nodes and the real-time computing power resources of computing power nodes.

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

[0066] When a subordinate node of a computing power node matches its corresponding idle computing power 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 so that the computing power nodes can 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 based on the idle computing power resources corresponding to the subordinate nodes and the first random factor.

[0068] The first random factor is a computational factor randomly generated by the supervisory node based on the blockchain identifier of the computing power node. Because the first random factor has a certain degree of randomness and corresponds one-to-one with a computing power node, determining the true bid information corresponding to that subordinate node based on its idle computing power resources, and processing this true bid information and the first random factor, makes the generated second bid information less susceptible to being cracked by third-party devices during transmission, thereby ensuring the security of the transmission of the subordinate node's true bid information.

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

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

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

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

[0073] The computing power bidding method also includes: changing the working state of the subordinate nodes of the computing power node from dormant to active state according to the wake-up command.

[0074] Specifically, when a subordinate node of a computing power node receives a wake-up command carried in a computing power task processing request, the subordinate node clearly indicates that the computing power node requires it to provide corresponding computing power resources. At this time, the subordinate node will change its working state from dormant to active, thereby assisting the computing power node in making a bid. This allows the computing power resources of the computing power node and its subordinate nodes to be integrated and provided as a whole to the user node. This not only ensures that the computing power resources of the computing power node and its subordinate nodes are fully utilized, but also provides the user node with more computing power options, improving the user experience.

[0075] In this embodiment, by responding to a computing task processing request sent by a computing power node, a computing power task is obtained. This computing power task is determined based on the difference between the computing power demand published by the user node and the real-time computing power resources of the computing power node. This clarifies the computing power processing that the computing power node needs to complete with its subordinate nodes, so as to assist the computing power node in making bids together. This allows the idle computing power resources of the current subordinate nodes to be fully utilized, improving the utilization efficiency of computing power resources. Then, based on the idle computing power resources corresponding to the subordinate nodes and a second random factor, second bidding information is generated. This second bidding information represents the corresponding return that the subordinate nodes need to obtain when providing their idle computing power resources. A computing task processing response carrying the second bidding information is sent to the computing power node, so that the computing power node can generate and send bidding information to the blockchain network based on its own first bidding information and the second bidding information of the subordinate nodes. This enables the computing power node to jointly bid with its subordinate nodes, improving the utilization efficiency of computing power resources of each computing power node in the blockchain network.

[0076] Secondly, this disclosure provides a computing power bidding system.

[0077] Figure 3 This diagram illustrates a block diagram of a computing power bidding system provided in an embodiment of this disclosure. Figure 3 As shown, the computing power bidding system includes, but is not limited to, the following devices: user node 310 connected through a blockchain network, at least two computing power nodes (e.g., first computing power node 321, first computing power node 322) and their subordinate nodes (e.g., the subordinate nodes of the first computing power node 321 include the first subordinate node 3211 and the second subordinate node 3212; the subordinate nodes of the second computing power node 322 include the third subordinate node 3221 and the 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 applicable to the subordinate nodes of the computing power node.

[0080] User node 310 is configured to publish computing power requirements to the blockchain network and select a winning node based on the bid information sent by at least two real-time online nodes. The winning node is used to provide computing power resources to the user node to meet 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 demand published by user nodes from the blockchain network, determine the number of real-time online nodes, generate a random factor corresponding to each real-time online node based on the number of real-time online nodes, and send the corresponding random factor to each real-time online node.

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

[0084] The monitoring node randomly generates a random factor corresponding to each real-time online node based on the blockchain identifier of each real-time online node. This enables each real-time online node to obtain a random factor that corresponds to it one-to-one. Based on this random factor, the real bidding information of each real-time online node is protected to prevent third-party devices from stealing the bidding information when each real-time online node provides bidding information to the blockchain network, thus ensuring the fairness and impartiality of the bidding process.

[0085] Furthermore, 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 bids of each real-time online node based on the random factors corresponding to each real-time online node, and determine the most suitable winning node, so that the winning node can provide computing power services to the user node.

[0086] Figure 4 This diagram illustrates a block diagram of another computing power bidding system provided in an embodiment of this 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 (e.g., 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 (e.g., second-level computing power node 431, second-level computing power node 432, etc.), multiple third-level computing power nodes (e.g., 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 supervisory node 450.

[0087] User node 410 is connected to multiple first-level computing power nodes via a blockchain network. Each first-level computing power node can act as a ledger node in this blockchain network. In other words, first-level computing power nodes are required to maintain the blockchain ledger, while second-level and third-level computing power nodes are not required to maintain the blockchain ledger.

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

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

[0090] When user node 410 publishes its computing power requirements, multiple computing power nodes can bid and compete for the rights and interests of each other. This allows user node 410 to select a winning node based on the bid information published by the multiple computing power nodes. The winning node is then used to provide computing power to user node 410 to meet its computing power requirements.

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

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

[0093] In the initial creation of the blockchain network, the genesis block includes multiple first-level computing nodes, each of which corresponds to a blockchain identifier and a public key.

[0094] During initialization, both the second-level and third-level computing nodes are in a dormant state to save energy consumption and do not require synchronization of the blockchain network's ledger information.

[0095] In the subsequent computing power processing, the working status of each second-level and third-level computing power node is determined by its superior computing power node (that is, each level of computing power node has the characteristics of hierarchical communication and hierarchical wake-up).

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

[0097] For example, at preset intervals, the first-level computing power node sends a broadcast message (which includes the blockchain identifier of the first-level computing power node) to each of its subordinate second-level computing power nodes, so that each of its subordinate second-level computing power nodes knows that the first-level computing power node is active and can obtain the computing power tasks issued by the first-level computing power node.

[0098] Figure 5This diagram illustrates a flowchart of a computing power bidding system according to an embodiment of the present disclosure. Figure 5 As shown, the working method of this computing power bidding system includes, but is not limited to, the following steps.

[0099] In step S501, user node 410 uses its 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; user node 410 uses its private key to sign its proposed computing power request, and broadcasts the signed computing power request to the blockchain network.

[0100] Since the computing power requirement does not specify a particular computing power node to provide computing power services, all active computing power nodes at all levels in the blockchain network can provide their corresponding quotation information to user nodes.

[0101] In step S502, the supervisory node 450 obtains the computing power request sent by the user node 410, which has been 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 active computing power nodes at all levels in the blockchain network that it has queried. Then, the supervisory node 450 sends each random factor to its corresponding computing power node.

[0102] If the number of active computing power nodes at each level in the blockchain network is set to n, where n is an integer greater than 2, then n random factors (such as n random numbers) are generated, and then the n random factors are sent to their corresponding computing power nodes.

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

[0104] In step S503, when the working state of the second-level computing power node 432 is active, 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 will generate the first quotation information based on 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 the first quoted value.

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

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

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

[0109] The wake-up command is used to wake up the subordinate nodes of the second-level computing node 432. In other words, the wake-up command is used to change the working state of the subordinate nodes of the second-level computing node 432 from the dormant state to the active state.

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

[0111] When the second-level computing node 432 receives the computing power request sent by the user node 410, the third-level computing nodes 443 and 444 are both in a dormant state. At this time, it is necessary to wake up each third-level computing node first, and then send computing power tasks to each third-level computing node.

[0112] Step S505: When the third-level computing node 443 (and / or the third-level computing node 444) receives a computing task processing request, the third-level computing node 443 (and / or the third-level computing node 444) parses the computing task processing request, obtains a wake-up instruction, and then changes its working state to an active state according to the wake-up instruction.

[0113] In step S506, the third-level computing node 443 (and / or the third-level computing node 444) generates the second quotation information based on its idle computing resources and the first random factor.

[0114] 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 in making a joint bid, 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 bid information corresponding to the subordinate node based on the first random factor.

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

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

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

[0118] In some embodiments, the third-level computing node 443 signs Pd111-R1 with its own private key and then sends the signed information to the second-level computing node 432; similarly, the third-level computing node 444 also signs Pd112-R1 with its own private key and then sends the generated signature information (e.g., computing task processing response) to the second-level computing node 432.

[0119] In step S507, when the second-level computing power node 432 receives the computing power task processing response from its subordinate nodes, 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 node 432 needs to verify the private key signature carried in the computing task processing response, and if the verification is successful, use a preset algorithm to parse the second quotation information from the computing 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 node, the second-level computing power node 432 can also directly use its private key to perform a secondary signature on the computing power task processing response, so as to indicate that the second quotation information carried in the computing power task processing response is not only quotation information recognized by the subordinate node 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 node 432 will also obtain the third quotation information published by the paired node from the blockchain network; then, based on the first quotation information and the second quotation information, determine the quotation and value; based on the quotation and value and the third quotation information, determine the difference quotation information, and add the difference quotation information to the quotation publication information.

[0123] In this context, a pairing node is a computing power node in the blockchain network that can provide computing power resources to user node 410. For example, a pairing node is a subordinate node of the second-level computing power node 431: the third-level computing power node 441.

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

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

[0126] In some embodiments, the third quote information is information encrypted using the private key of the third-level computing power node 441 according to a preset encryption algorithm. When the second-level computing power node 432 obtains the quote 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 quote information. If the verification is successful, the verified quote information will be processed using a preset decryption algorithm to obtain the third quote information.

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

[0128] In step S509, the second-level computing node 432 sends the quotation release information to the blockchain network so that the user node 410 can obtain the quotation release information.

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

[0130] Similarly, the matching node will also send its generated quote publication information to the blockchain network, so user node 410 can obtain at least two quote publication information.

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

[0132] In step S510, user node 410 requests random factors from supervisor node 450 for each computing power node; then, it obtains the bid release information published by at least two computing power nodes from the blockchain network; and then, based on the bid release information published by at least two computing power nodes, it selects the winning node.

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

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

[0135] In some embodiments, user node 410 may also verify the price release information published by each computing power node to determine whether there are any false prices.

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

[0137] When the sum is 0, it indicates that the quotation information published by the second-level computing node 531 and the third-level computing node 541 is accurate.

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

[0139] In step S511, 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] In this process, the winning node will initiate a transfer transaction record in the blockchain network, and user node 410 will obtain the corresponding computing power resource usage rights from the winning node based on the winning node's real bid information and the computing power demand published by user node 410.

[0141] For example, if the winning node is determined to be the second-level computing power node 432, then 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 node 432 is determined to be the winning node, it will generate different computing tasks based on the computing power requirements and allocate the computing power tasks to its subordinate third-level computing nodes 443 and 444 respectively, so that the third-level computing nodes 443 and 444 can use their idle computing power resources to provide computing power services to the user node 410.

[0143] When each subordinate node completes the aforementioned computing power task, the second-level computing power 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, first bidding information is generated based on 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 bidding situation corresponding to the real-time computing power resources provided by the computing power node. If 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 subordinate nodes, enabling subordinate nodes to cooperate with the computing power node in bidding. This ensures that the computing power resources of both the computing power node and its subordinate nodes can participate in the computing power bidding process, reducing the waste of computing power resources. The computing power task is a task determined based on the difference between the computing power demand and the real-time computing power resources. Therefore, when the subordinate node receives the request... When a computing task processing request is made, it can clearly determine how much computing power resources need to be provided to the computing power node. When the idle computing power resources of the subordinate nodes can meet the computing power task, it will send a computing power task processing response back to the computing power node, thereby obtaining the second quotation information of the subordinate nodes 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 will compare the quotation release information with the quotation release information released by other computing power nodes in order to select the optimal winning node and use the winning node to provide computing power to the user node to meet its computing power needs.

[0145] Thirdly, embodiments of this disclosure provide a computing node and its subordinate nodes.

[0146] Figure 6 This diagram illustrates a block diagram of a computing node device provided in an embodiment of this disclosure. Figure 6 As shown, the computing node device 600 includes, but is not limited to, the following modules.

[0147] The first generation module 601 is configured to generate first quotation information based on 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 task processing request to subordinate nodes when it is determined that the real-time computing resources do not meet the computing power requirements.

[0149] Among them, computing power demand is the demand published by user nodes. Computing power nodes and their subordinate nodes are connected to user nodes through the blockchain network. Computing power tasks are tasks determined based on the difference between computing power demand and real-time computing power resources.

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

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

[0152] The quotation information is used by user nodes to select winning nodes, which are used to provide computing power to user nodes to meet their computing power needs.

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

[0154] In this embodiment, a first generation module generates first bidding information based on the real-time computing power resources corresponding to the computing power node and a first random factor corresponding to the computing power node, thereby determining the bidding situation corresponding to the real-time computing power resources provided by the computing power node. If it is determined that the corresponding real-time computing power resources do not meet the computing power demand, a first sending module sends a computing power task processing request to subordinate nodes, enabling subordinate nodes to cooperate with the computing power node in bidding. This ensures that the computing power resources of both the computing power node and its subordinate nodes can participate in the computing power bidding process, reducing the waste of computing power resources. The computing power task is a task determined based on the difference between the computing power demand and the real-time computing power resources. Therefore, when a subordinate node receives the computing power task request... When a computing task processing request is made, it can clearly determine how much computing power resources need to be provided to the computing power node. When the idle computing power resources of the subordinate nodes can meet the computing power task, it will send a computing power task processing response back to the computing power node, so that the computing power node can obtain the second quotation information of the subordinate nodes of the computing power node based on the first acquisition module. Then, the processing module generates quotation release information based on the first quotation information and the second quotation information, and sends 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 power nodes in order to select the optimal winning node, and use the winning node to provide computing power to the user node to meet its computing power needs.

[0155] Figure 7 This diagram illustrates the composition of subordinate nodes in a computing node device according to an embodiment of this disclosure. Figure 7 As shown, the subordinate node devices 700 include, but are not limited to, the following modules.

[0156] The second acquisition module 701 is configured to acquire computing tasks in response to computing task processing requests sent by computing nodes.

[0157] Among them, computing power tasks are tasks determined based on the difference between the computing power demand published by user nodes and the real-time computing power resources of computing power nodes.

[0158] The second generation module 702 is configured to generate second quotation information based on the idle computing power resources corresponding to the subordinate nodes and the first random factor.

[0159] The second sending module 703 is configured to send a computing power task processing response carrying 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 of the computing power bidding methods disclosed herein for use in subordinate node devices.

[0161] In this embodiment, the second acquisition module responds to the computing power task processing request sent by the computing power node and acquires the computing power task. This computing power task is determined based on the difference between the computing power demand published by the user node and the real-time computing power resources of the computing power node. This clarifies the computing power processing that the computing power node needs to complete from its subordinate nodes, so as to assist the computing power nodes in bidding together, thereby making full use of the idle computing power resources of the current subordinate nodes and improving the utilization efficiency of computing power resources. Then, the second generation module generates second bidding information based on the idle computing power resources corresponding to the subordinate nodes and a second random factor, so as to represent the corresponding return that the subordinate nodes need to obtain when providing their idle computing power resources. The second sending module sends a computing power task processing response carrying the second bidding information to the computing power node, so that the computing power node can generate and send bidding information to the blockchain network based on its own first bidding information and the second bidding information of the subordinate nodes, realizing that the computing power node and its subordinate nodes jointly bid, thereby improving the utilization efficiency of the computing power resources of each computing power node in the blockchain network.

[0162] It is worth noting that all modules involved in this embodiment are logical modules. In practical applications, a logical unit can be a physical unit, a part of a physical unit, or a combination of multiple physical units. Furthermore, to highlight the innovative aspects of this disclosure, this embodiment does not introduce units that are not closely related to solving the technical problems proposed in this disclosure; however, this does not mean that other units are absent from this embodiment.

[0163] Fourthly, the embodiments of this disclosure provide electronic devices, computer-readable media, and computer program products, all of which can be used to implement any of the computing power bidding methods in the embodiments of this disclosure. The corresponding technical solutions and descriptions are as described in the corresponding descriptions in the method section, and will not be repeated here.

[0164] Figure 8 This diagram illustrates a block diagram of an electronic device provided in an embodiment of the present disclosure.

[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, memory 802, and I / O interfaces 803 are interconnected via a bus 804. The memory 802 stores one or more computer programs, which are executed by the at least one processor 801 to enable the at least one processor 801 to implement any of the computing power bidding methods described in the above embodiments.

[0166] The modules in the aforementioned electronic devices can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in the processor of a computer device in hardware form or independent of it, or stored in the memory of a computer device in software form, so that the processor can call and execute the operations corresponding to each module.

[0167] This disclosure also provides a computer-readable storage medium storing a computer program thereon, wherein the computer program, when executed by a processor, implements any of the computing power bidding methods described in the above embodiments. The computer-readable storage medium may be a volatile or non-volatile computer-readable storage medium.

[0168] This disclosure also provides a computer program product, including computer-readable code, or a non-volatile computer-readable storage medium carrying computer-readable code. When the computer-readable code is run in the processor of an electronic device, the processor in the electronic device executes the above-described computing power bidding method.

[0169] Those skilled in the art will understand that all or some of the steps, systems, and devices disclosed above, as well as the functional modules / units, can be implemented as software, firmware, hardware, or suitable combinations thereof. In hardware implementations, the division between 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 collaboratively by several physical components.

[0170] Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit (ASIC). Such software may be distributed on a computer-readable storage medium, which may include computer storage media (or non-transitory media) and communication media (or transient media). As is known to those skilled 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 technologies, portable compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical disc storage, magnetic cartridges, magnetic tape, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and is accessible to a computer. Furthermore, as is known to those skilled in the art, communication media typically contain computer-readable program instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.

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

[0172] Computer program instructions used to perform the operations of this disclosure may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, status 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 the "C" language or similar programming languages. The computer-readable program instructions may execute entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving 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., via the Internet using an Internet service provider). In some embodiments, electronic circuitry, such as programmable logic circuitry, field-programmable gate arrays (FPGAs), or programmable logic arrays (PLAs), is personalized by utilizing the status information of the computer-readable program instructions to implement various aspects of this disclosure.

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

[0174] Various aspects of this disclosure are described herein with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this disclosure. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, 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 apparatus to produce a machine such that, when executed by the processor of the computer or other programmable data processing apparatus, they create means for implementing the functions / actions specified in one or more blocks of the flowchart and / or block diagram. These computer-readable program instructions can also be stored in a computer-readable storage medium that causes a computer, programmable data processing apparatus, and / or other device to operate in a particular manner; thus, the computer-readable medium storing the instructions comprises an article of manufacture that includes instructions for implementing aspects of the functions / actions specified in one or more blocks of 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 to cause a series of operational steps to be 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 perform the functions / actions specified in one or more boxes of a flowchart and / or block diagram.

[0177] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of an instruction containing one or more executable instructions for implementing a specified logical function. In some alternative implementations, the functions marked in the blocks may occur in a different order than those marked in the drawings. For example, two consecutive blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, the execution order of which may be determined based on the functions involved in each block. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, may be implemented using a dedicated hardware-based system that performs the specified function or action, or using a combination of dedicated hardware and computer instructions.

[0178] Example embodiments have been disclosed herein, and while specific terminology has been used, it is for illustrative purposes only and should be construed as such, and is not intended to be limiting. In some instances, it will be apparent to those skilled in the art that features, characteristics, and / or elements described in connection with particular embodiments may be used alone, or in combination with features, characteristics, and / or elements described in connection with other embodiments, unless otherwise expressly indicated. Therefore, those skilled in the art will understand that various changes in form and detail may be made without departing from the scope of this disclosure.

Claims

1. A computing power bidding method, applied to computing power nodes, wherein the computing power nodes have subordinate nodes, characterized in that, The method includes: First quotation information is generated based on the real-time computing power resources corresponding to the computing power node and the first random factor corresponding to the computing power node; the first random factor is a computing factor randomly generated by the supervisory node in the blockchain network based on the blockchain identifier of the computing power node; If 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. The computing power demand is a demand published by the user node. The computing power node and its subordinate nodes are connected to the user node through a blockchain network. 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, the second quotation information of the subordinate node of the computing power node is obtained; Based on the first and second quotation information, quotation release information is generated and sent to the blockchain network. The quotation release information is used by the user node to select the winning node, which is used to provide computing power to the user node to meet its computing power needs.

2. The method according to claim 1, characterized in that, The computing power task processing request also includes: a wake-up command; The method further includes: When the subordinate nodes of the computing power node are in a dormant state, the subordinate nodes of the computing power node are woken up based on the wake-up command.

3. The method according to claim 1, characterized in that, The price release information also includes differential price information; The method further includes: Obtain third quote information published by the matching node from the blockchain network, wherein the matching node is a computing power node in the blockchain network that can provide computing power resources to the user node; Based on the first quotation information and the second quotation information, determine the quotation and value; The difference in price information is determined based on the quoted price and value, as well as the third price information.

4. The method according to claim 3, characterized in that, The subordinate nodes of the computing power node include multiple nodes; The second quotation information includes the sum of the quotation values ​​of multiple subordinate nodes, and the quotation 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.

5. The method according to any one of claims 1 to 4, characterized in that, Before generating the first quotation information based on 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.

6. The method according to any one of claims 1 to 4, characterized in that, The blockchain network also includes: the parent node of the computing power node; The method further includes: When the computing node is in a dormant state, the computing node's working state is adjusted from dormant to active state according to the wake-up command sent by the superior node. And / or, Obtain the pending computing power task sent by the upper-level node from the blockchain network. The pending computing power task is used to instruct the computing power node to work with the upper-level node to provide computing power quotation information to the user node.

7. A computing power bidding method, applied to subordinate nodes of a computing power node, characterized in that, The method includes: In response to the computing power task processing request sent by the computing power node, a computing power task is obtained, wherein the computing power task is 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. The second quotation information is generated based on the idle computing power resources corresponding to the subordinate nodes and the first random factor; the first random factor is a computing factor randomly generated by the supervisory node in the blockchain network based on the blockchain identifier of the computing power node. A computing power 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 power task processing request also includes: a wake-up command; Responding to a computing task processing request sent by the computing node includes: parsing the received computing task processing request to obtain the wake-up command; The method further includes: according to the wake-up instruction, changing the working state of the subordinate nodes of the computing power node from a dormant state to an active state.

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

10. The system according to claim 9, characterized in that, The system also includes: The supervisory node is configured to obtain the computing power demand 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 based on the number of real-time online nodes, and send the corresponding random factor to each real-time online node. The real-time online node includes the at least two computing power nodes and / or subordinate nodes of the computing power nodes.

Images