Financial guarantee method and device based on block chain, electronic equipment and storage medium

Abstract

The invention relates to the technical field of financial guarantee, and discloses a financial guarantee method and device based on a block chain, electronic equipment and a computer readable storage medium, and the financial guarantee method comprises the steps: receiving transaction information of a transaction initiator in response to a guarantee application request of the transaction initiator; determining a risk level of the guarantee application according to the transaction information; if the guarantee application is in a low risk level, a fast channel is allocated to the guarantee application, and the fast channel comprises a first number of first verification nodes; if the guarantee application is in the high-risk level, a security channel is allocated to the guarantee application, the security channel comprises a second number of second verification nodes, the second number is larger than the first number, and the weight of the first verification node is higher than that of the second verification node. Through the above mode, the security of the financial guarantee is maintained while the financial guarantee efficiency is improved.

Description

Technical Field

[0001] The embodiments of the present application relate to the field of financial guarantee technology, and specifically to a blockchain-based financial guarantee method, device, electronic device, and computer-readable storage medium. Background Art

[0002] Currently, more and more transactions are being conducted on the blockchain. For example, when a Chinese company purchases equipment from overseas, the two parties conduct transactions through a blockchain platform. During this process, the buyer needs to pledge assets as collateral, and the seller will only ship the goods after receiving confirmation of the guarantee.

[0003] The existing blockchain-based financial guarantee process includes: the buyer submits a guarantee application, the system broadcasts the buyer's guarantee application to all nodes (participants) in the blockchain network, the nodes verify whether the buyer's assets are authentic and valid (such as whether the real estate actually exists and there is no duplicate mortgage), the majority of nodes reach a consensus, confirm that the guarantee is valid and record it in the blockchain, and the seller ships the goods after seeing that the guarantee has been confirmed, and the transaction is completed.

[0004] In the above process, to ensure the security of the transaction, all nodes are usually required to participate in the transaction to verify whether the purchased assets are authentic and valid, and it is necessary to wait for enough nodes to participate in the voting to prevent the minority from tampering with the results. Therefore, nodes are usually slow to provide financial guarantees, and sellers may miss other orders due to waiting, resulting in low transaction efficiency.

[0005] Therefore, how to improve the efficiency of financial guarantees while maintaining their security has become a technical problem that needs to be solved urgently. Summary of the Invention

[0006] In view of the above problems, the embodiments of the present application provide a blockchain-based financial guarantee method, device, electronic device and computer-readable storage medium to solve the problem of low efficiency of financial guarantees by blockchain nodes in the prior art.

[0007] According to one aspect of an embodiment of the present application, a blockchain-based financial guarantee method is provided, the financial guarantee method comprising: receiving transaction information of the transaction initiator in response to a guarantee application request from the transaction initiator; determining the risk level of the guarantee application based on the transaction information; if the guarantee application is of a low risk level, allocating a fast channel to the guarantee application, the fast channel comprising a first number of first verification nodes; if the guarantee application is of a high risk level, allocating a safe channel to the guarantee application, the safe channel comprising a second number of second verification nodes, the second number being greater than the first number, and the weight of the first verification node being higher than that of the second verification node.

[0008] Preferably, the financial guarantee method also includes: setting a basic spot check rate for all nodes in the node pool of the blockchain; increasing a first spot check rate for nodes participating in financial guarantees with low risk levels; increasing a second spot check rate for nodes participating in financial guarantees with high risk levels, wherein the second spot check rate is less than the first spot check rate; increasing a third spot check rate for nodes whose health scores are lower than a preset health score threshold, wherein the third spot check rate is not greater than the first spot check rate, and the third spot check rate is not less than the second spot check rate; spot checking the nodes in the node pool at a spot check frequency not lower than the preset spot check rate; if a malicious node is found through the spot check, the mortgage assets of the malicious node are deducted and the credit score of the malicious node is reduced.

[0009] Preferably, if the guarantee application is of a low risk level, a fast channel is allocated to the guarantee application, including: if the guarantee application is of a low risk level, a node whose weight ranking is within a first preset sequence is screened from the node pool as a preliminary first node, wherein the sequence number of the first sequence is greater than the first quantity; obtaining the real-time health of the preliminary first node; removing the node whose health is lower than the first preset health threshold from the preliminary first node; determining the first verification node from the preliminary first node based on the weight and health; determining the fast channel based on the first verification node; and / or, if the guarantee application is of a high risk level, a safe channel is allocated to the guarantee application, including: if the guarantee application is of a high risk level, a node whose health is higher than a second preset health threshold is screened from the node pool as a preliminary second node, wherein the second preset health threshold is higher than the first preset health threshold; determining the second verification node from the preliminary second node; determining the safe channel based on the second verification node; wherein the health of the node is negatively correlated with the node's central processing unit occupancy rate, the node's memory occupancy rate, and the node's network delay value; the node's weight is positively correlated with the node's credit score and the node's mortgage assets.

[0010] Preferably, after determining the fast channel based on the first verification node, the financial guarantee method also includes: monitoring the health of the first verification node; removing nodes whose health is lower than a third preset health threshold from the safe channel, and suspending all transactions of the node until the health of the node is higher than the third preset health threshold, wherein the third preset health threshold is lower than the first preset health threshold; determining a first supplementary verification node from the prepared first nodes based on weight and health; and adding the first supplementary verification node to the fast channel.

[0011] Preferably, after determining the fast channel based on the first verification node, the financial guarantee method also includes: if the voting result of the first verification node is not received within the preset response time, the first verification node is determined as a timeout node; the timeout node is frozen for a preset freezing period, and all transactions of the frozen node are suspended until the preset freezing period expires, and the transaction restrictions on the frozen node are lifted; a second supplementary verification node is determined from the prepared first nodes based on weight and health; and the suspended transactions of the frozen node are allocated to the second supplementary verification node.

[0012] Preferably, the financial guarantee method further includes: determining a decision variable based on the first verification node and the second verification node; determining a target optimization function based on the quality score, the cost score, and the collaboration score; determining target constraints of the target optimization function, the target constraints including: quantity constraints, health constraints, resource constraints, and collaboration efficiency constraints; determining the optimal decision variable when the target optimization function is optimal based on the target constraints; determining the first verification node and the second verification node based on the optimal decision variable; wherein the decision variable is represented by the following formula:

[0013]

[0014] The quality score is expressed by the following formula:

[0015]

[0016] The cost is expressed by the following formula:

[0017]

[0018] The synergy score is expressed by the following formula:

[0019]

[0020] z mn =x m x n or y m y n

[0021] z mn Used to indicate whether nodes m and n work together, z mn =x m x n Represents that node m and node n cooperate in a secure channel, z mn =y m y n Indicates that nodes m and n collaborate in the fast lane;

[0022] The objective optimization function is expressed as follows:

[0023]

[0024] The quantity constraint is expressed by the following formula:

[0025]

[0026] K=K1+K2

[0027] The health constraint is expressed by the following formula:

[0028]

[0029] Resource constraints are expressed as follows:

[0030]

[0031] The collaborative efficiency constraint is expressed by the following formula:

[0032]

[0033] In the above formula, N is the total number of nodes in the node pool, K is the total number of nodes required for the secure channel and the fast channel, K1 is the first number, K2 is the second number, H1 is the first preset health threshold, H2 is the second preset health threshold, α is the preset time weight coefficient, β is the preset cost weight coefficient, γ is the preset collaborative efficiency coefficient, and w i is the weight of the node, h i is the health of the node, η mn is the collaborative efficiency, which is used to characterize the statistical value of the historical cooperation success rate between node m and node n, c i is the cost of node i, η mn is the historical cooperation success rate between node m and node n, Rk is the total amount of resources of type k (CPU / memory / bandwidth), r jk is the proportion of node j occupying resource k, θ1 is the preset lower limit of fast channel collaboration efficiency, and θ2 is the preset lower limit of secure channel collaboration efficiency.

[0034] Preferably, if the guarantee application is of a low risk level, then after allocating a fast channel to the guarantee application, the financial guarantee method further includes: obtaining the voting result of the first verification node; if the nodes exceeding the preset node threshold among the first verification nodes of the fast channel agree to the guarantee application, then determining that the guarantee of the transaction information is effective; if the guarantee application is of a high risk level, then after allocating a safe channel to the guarantee application, the financial guarantee method further includes: obtaining the voting result of the second verification node; if the ratio of the sum of the weights of the second verification nodes in the safe channel that agree to the guarantee application to the sum of the weights of all the second verification nodes in the safe channel exceeds the preset weight coefficient, then determining that the guarantee of the transaction information is effective.

[0035] According to another aspect of an embodiment of the present application, a blockchain-based financial guarantee device is provided, which includes: a processing module for responding to a guarantee application request from the transaction initiator and receiving transaction information from the transaction initiator; a determination module for determining the risk level of the guarantee application based on the transaction information; a first allocation module for allocating a fast channel to the guarantee application if the guarantee application is at a low risk level, the fast channel including a first number of first verification nodes; a second allocation module for allocating a safe channel to the guarantee application if the guarantee application is at a high risk level, the safe channel including a second number of second verification nodes, the second number being greater than the first number, and the weight of the first verification node being higher than that of the second verification node.

[0036] According to another aspect of an embodiment of the present application, an electronic device is provided, comprising a memory, a processor, and a computer program stored on the memory, wherein the processor executes the computer program to implement the steps of the blockchain-based financial guarantee method as described in any of the above embodiments.

[0037] According to another aspect of the embodiments of the present application, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps of the blockchain-based financial guarantee method described in any of the above embodiments are implemented.

[0038] The embodiment of the present application determines the risk level of the guarantee application based on the transaction information, and allocates a fast channel with a small number of nodes and a high node weight to the guarantee application with a low risk level, and allocates a safe channel with a large number of nodes to the guarantee application with a high risk level, so as to improve the efficiency of financial guarantees through the fast channel; and the nodes in the fast channel have high weights, their bribery costs are high, and the cost of nodes doing evil is high, which can effectively suppress the evil behavior of the nodes in the fast channel, thereby improving the efficiency of financial guarantees through the fast channel while ensuring the security of transactions in the fast channel. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] Figure 1 A schematic diagram of the basic process of a blockchain-based financial guarantee method provided for one embodiment of the present invention. DETAILED DESCRIPTION

[0040] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, the specific implementation methods of the present invention are described in detail below in conjunction with the drawings. It is obvious that the described embodiments are only part of the embodiments of the present invention, but not all of the embodiments.

[0041] Example 1, with reference to Figure 1 , as an embodiment of the present invention, provides a blockchain-based financial guarantee method, the financial guarantee method comprising:

[0042] S110, in response to the guarantee application request of the transaction initiator, receiving the transaction information of the transaction initiator.

[0043] The buyer uploads proof of assets (such as an electronic version of the real estate certificate) on the blockchain platform and applies for it as a transaction guarantee.

[0044] S130: Determine the risk level of the guarantee application based on the transaction information.

[0045] Risk levels can be divided according to asset value (for example, $100,000 is the risk threshold) and buyer's credit score (based on historical transaction records). For example, low risk (assets < $100,000 and credit score > 80) will take the fast track, while high risk (assets ≥ $100,000 or credit score ≤ 80) will take the safe track.

[0046] Among them, the risk threshold supports dynamic adjustment (for example, automatically updating the $100,000 standard based on market fluctuations).

[0047] Furthermore, lightweight AI models are used to assess risks in real time (such as logistic regression to judge credit).

[0048] S150: If the guarantee application is of a low risk level, a fast track is allocated for the guarantee application, where the fast track includes a first number of first verification nodes.

[0049] Low-risk transactions can be broadcast only to a group of fast nodes in the fast channel, such as a preset group of three high-response nodes. Nodes in the fast node group must meet high online rates, high collateral margins, and a zero history of malicious activity.

[0050] When performing guarantee confirmation, specifically, after S150, the financial guarantee method further includes:

[0051] S161, obtaining the voting result of the first verification node.

[0052] S163: If more than a preset node threshold of the first verification nodes in the fast channel agree to the guarantee application, the guarantee of the transaction information is determined to be effective.

[0053] If all transactions require the consent of more than 50% of the nodes in the node pool, it is likely to take a long time and the efficiency of the fast channel will still be low. Therefore, low-risk transactions can be set up so that only consensus within the fast node group is required (such as 2 out of 3 nodes agree). This allows the nodes in the fast channel to reach consensus quickly, thereby improving transaction efficiency.

[0054] S170, if the guarantee application is of a high risk level, a safe channel is allocated for the guarantee application, the safe channel includes a second number of second verification nodes, the second number is greater than the first number, and the weight of the first verification node is higher than that of the second verification node.

[0055] High-risk transactions can be broadcast to all nodes in the entire network (for example, 50 nodes).

[0056] When performing guarantee confirmation, a guarantee approval method that still requires the consent of more than 50% of the nodes in the node pool may be implemented. Specifically, after S170, the financial guarantee method further includes:

[0057] S171, obtaining the voting result of the second verification node;

[0058] S173, if the ratio of the sum of the weights of the second verification nodes in the secure channel that agree to the guarantee application to the sum of the weights of all the second verification nodes in the secure channel exceeds the preset weight coefficient, it is determined that the guarantee of the transaction information is effective.

[0059] For example, the guarantee will be passed only when the weight of the nodes agreeing to guarantee exceeds 50%, and the node voting weight will be linked to the mortgaged assets to improve the security of high-risk guarantees.

[0060] The seller will ship the goods immediately after receiving the guarantee confirmation from the blockchain. The transaction record will be uploaded to the chain using a hash chain structure. Any modification will destroy the hash value of subsequent blocks. The data is distributed and stored in the full node group, and there is no possibility of single point tampering. The buyer and seller can see the status update in real time. After the low-risk transaction is confirmed, the smart contract will be triggered to automatically notify the seller without manual review. All transaction data is encrypted and stored on the blockchain, including risk classification labels and verification node information.

[0061] Transactions are divided into fast channels and safe channels. For small / low-risk transactions (such as less than US$100,000), the number of verification nodes can be reduced (such as 3 nodes), and confirmation can be achieved in seconds; for large / high-risk transactions (such as more than US$100,000), the number of verification nodes can be increased (such as 50 nodes), sacrificing speed in exchange for security.

[0062] The number of verification nodes in the fast channel is very small (for example, only 3), which makes it easy for the same high-weight node to participate in a large number of small / low-risk transactions. Therefore, the bribery cost of the nodes in the fast channel needs to be increased. For example, the weight of the first verification node is very high, and the node needs a large amount of collateral assets to suppress the cost of malicious behavior of the fast channel nodes.

[0063] The cost of malicious behavior in the fast channel can be further increased through a spot check mechanism to prevent nodes in the fast channel from doing malicious behavior, and the spot check does not affect the user experience. Specifically, the financial guarantee method also includes:

[0064] S210, set a basic spot check rate for all nodes in the node pool of the blockchain.

[0065] For example, 5%.

[0066] S220, increase the first spot check rate for nodes participating in financial guarantees with low risk levels.

[0067] For example, 20%.

[0068] S230, increasing a second spot check rate for nodes participating in financial guarantees with a high risk level, wherein the second spot check rate is lower than the first spot check rate.

[0069] For example, 10%.

[0070] S240, increasing a third spot check rate for nodes whose health scores are lower than a preset health score threshold, wherein the third spot check rate is not greater than the first spot check rate, and the third spot check rate is not less than the second spot check rate.

[0071] For example, 10% to 20%.

[0072] S250: Perform spot checks on the nodes in the node pool at a spot check frequency that is no less than a preset spot check rate.

[0073] For example, spot checks could be conducted daily.

[0074] S260: If a malicious node is found through spot checks, the malicious node’s collateral assets will be deducted and its credit score will be reduced.

[0075] The number of nodes involved in low-risk transactions is relatively small. If the first verification node is bribed, the transactions involved will be quite wide. Therefore, the first spot check rate can be increased for nodes participating in low-risk financial guarantees, and the second spot check rate can be increased for nodes participating in high-risk financial guarantees. The second spot check rate is lower than the first spot check rate to avoid nodes participating in low-risk transactions being bribed, which may lead to large-scale transaction problems.

[0076] To explain the determination of the fast track in detail, preferably, S150 includes:

[0077] S151: If the guarantee application is of a low risk level, a node whose weight ranking is within a first preset sequence is selected from the node pool as a preliminary first node, wherein the sequence number of the first sequence is greater than the first quantity.

[0078] For example, 100 nodes are sorted from high to low in terms of weight value, and the first 30 nodes are used as preliminary first nodes.

[0079] The weight of a node is positively correlated with its reputation score and its collateral assets. For example, the weight of a node = its reputation score × its collateral assets.

[0080] S152: Obtain the real-time health of the standby first node.

[0081] The health of a node is negatively correlated with the CPU occupancy rate, memory occupancy rate, and network latency of the node. For example, the health of a node is 100-(CPU occupancy of the node × 0.3 + memory occupancy of the node × 0.2 + network latency of the node × 0.5).

[0082] S153: Remove nodes whose health is lower than a first preset health threshold from the prepared first nodes.

[0083] For example, nodes with a health score lower than 70 are removed from the reserve first nodes.

[0084] S154: Determine a first verification node from the prepared first nodes based on the weight and health.

[0085] In one optional method, the score of the preliminary first node can be calculated as a*weight+b*health, and the first verification nodes can be screened from high to low according to the score of the preliminary first node. For example, from 20 preliminary first nodes, the nodes with the top 10 scores are screened as the first verification nodes; in another optional method, the first verification node can also be selected from the preliminary first nodes. For example, a basic probability is set for all preliminary first nodes, and then the probability of the node is increased according to the proportion of weight and health in all preliminary first nodes.

[0086] Assign tasks to the first verification node, such as verifying the authenticity of transactions, verifying asset certificates, etc.

[0087] To explain the determination of the secure channel in detail, preferably, S170 includes:

[0088] S172: If the guarantee application is at a high risk level, a node with a health higher than a second preset health threshold is selected from the node pool as a reserve second node, where the second preset health threshold is higher than the first preset health threshold.

[0089] S174: Determine a second verification node from the prepared second nodes.

[0090] S176: Determine a secure channel based on the second verification node.

[0091] Among them, a larger number of second verification nodes can be set up to form a secure channel, for example, 50 nodes, so as to cross-verify the guarantee and verification results, thereby ensuring the security of the guarantee.

[0092] Nodes with high weights are prioritized for fast-track selection. This requires nodes to increase their collateral and maintain a high reputation in order to increase their weight. This leads to a higher probability of spot checks due to their high participation in transactions (for example, Node A, with a high weight, is likely responsible for 80% of fast-track transactions). This results in slower node responses, a decrease in reputation, and a higher rate of misjudgment of transactions, making them more likely to be misjudged as malicious nodes during spot checks. Therefore, when a fast-track node's health score is very low, its transactions are suspended and new nodes are added to complete the transaction.

[0093] Specifically, after S155, the financial guarantee method further includes:

[0094] S156: Monitor the health of the first verification node.

[0095] S157, remove the node whose health is lower than the third preset health threshold from the security channel, and suspend all transactions of the node until the health of the node is higher than the third preset health threshold, wherein the third preset health threshold is lower than the first preset health threshold.

[0096] For example, if the health of the first verification node is lower than 50, the first verification node will be removed from the secure channel.

[0097] S158: Determine the first supplementary verification node from the prepared first nodes according to the weight and health.

[0098] S159: Add the first verification node to the fast track.

[0099] When the health score of a fast channel node is very low, its transactions are suspended and new nodes are added to complete the transactions. This can ensure the normal progress of transactions and reduce the misjudgment rate of nodes.

[0100] The nodes of the fast channel are prone to high concurrency and instantaneous occurrence under malicious attacks, which may cause a node of the fast channel to be paralyzed, resulting in the transaction of the secure channel being voted incorrectly. For example, two nodes bribe node 1 and attack node 2 to paralyze it. If it cannot be detected, then after the timeout, the voting result of node 1 will represent the voting result of node 1 and node 2. Therefore, it is necessary to deal with the paralyzed node to improve the security of the guarantee. Preferably, after S155, the financial guarantee method further includes:

[0101] S162: If the voting result of the first verification node is not received within a preset response time, the first verification node is determined as a timed-out node.

[0102] S164: Freeze the timed-out node for a preset freezing period, and suspend all transactions on the frozen node until the preset freezing period has passed, at which point the transaction restrictions on the frozen node are lifted.

[0103] S166: Determine a second supplementary verification node from the prepared first nodes based on the weight and health.

[0104] S168: Allocate the suspended transaction of the frozen node to the second replenishment verification node.

[0105] By suspending paralyzed nodes, the security of the guarantee can be further improved.

[0106] When dynamically planning nodes in a node pool, the efficiency of the guarantee can be improved by converting the planning problem into an optimization problem. Specifically, the financial guarantee method also includes:

[0107] S310: Determine a decision variable according to the first verification node and the second verification node.

[0108] S320: Determine a target optimization function based on the quality score, cost score, and collaboration score.

[0109] S330, determining target constraints of the target optimization function, where the target constraints include: quantity constraints, health constraints, resource constraints, and collaborative efficiency constraints.

[0110] S340, determining the optimal decision variables when the target optimization function is optimal according to the target constraint conditions.

[0111] S350: Determine a first verification node and a second verification node according to the optimal decision variable.

[0112] The decision variables are expressed by the following formula:

[0113]

[0114] The quality score is expressed by the following formula:

[0115]

[0116] The cost is expressed by the following formula:

[0117]

[0118] The synergy score is expressed by the following formula:

[0119]

[0120] z mn =x m x n or y m y n

[0121] z mn Used to indicate whether nodes m and n work together, z mn=x m x n Represents that node m and node n cooperate in a secure channel, z mn =y m y n Indicates that nodes m and n collaborate in the fast lane;

[0122] The objective optimization function is expressed as follows:

[0123]

[0124] The quantity constraint is expressed by the following formula:

[0125]

[0126] K=K1+K2

[0127] The health constraint is expressed by the following formula:

[0128]

[0129] Resource constraints are expressed as follows:

[0130]

[0131] The collaborative efficiency constraint is expressed by the following formula:

[0132]

[0133]

[0134] In the above formula, N is the total number of nodes in the node pool, K is the total number of nodes required for the secure channel and the fast channel, K1 is the first number, K2 is the second number, H1 is the first preset health threshold, H2 is the second preset health threshold, α is the preset time weight coefficient, β is the preset cost weight coefficient, γ is the preset collaborative efficiency coefficient, and w i is the weight of the node, h i is the health of the node, η mn is the collaborative efficiency, which is used to characterize the statistical value of the historical cooperation success rate between node m and node n, c i is the cost of node i, η mn is the historical cooperation success rate between node m and node n, Rk is the total amount of resources of type k (CPU / memory / bandwidth), r jk is the proportion of node j occupying resource k, θ1 is the preset lower limit of fast channel collaboration efficiency, and θ2 is the preset lower limit of secure channel collaboration efficiency.

[0135] The embodiment of the present application determines the risk level of the guarantee application based on the transaction information, and allocates a fast channel with a small number of nodes and a high node weight to the guarantee application with a low risk level, and allocates a safe channel with a large number of nodes to the guarantee application with a high risk level, so as to improve the efficiency of financial guarantees through the fast channel; and the nodes in the fast channel have high weights, their bribery costs are high, and the cost of nodes doing evil is high, which can effectively suppress the evil behavior of the nodes in the fast channel, thereby improving the efficiency of financial guarantees through the fast channel while ensuring the security of transactions in the fast channel.

[0136] According to another aspect of an embodiment of the present application, a blockchain-based financial guarantee device is provided, which includes: a processing module for responding to a guarantee application request from the transaction initiator and receiving transaction information from the transaction initiator; a determination module for determining the risk level of the guarantee application based on the transaction information; a first allocation module for allocating a fast channel to the guarantee application if the guarantee application is at a low risk level, the fast channel including a first number of first verification nodes; a second allocation module for allocating a safe channel to the guarantee application if the guarantee application is at a high risk level, the safe channel including a second number of second verification nodes, the second number being greater than the first number, and the weight of the first verification node being higher than that of the second verification node.

[0137] According to another aspect of an embodiment of the present application, an electronic device is provided, comprising a memory, a processor, and a computer program stored on the memory, wherein the processor executes the computer program to implement the steps of the blockchain-based financial guarantee method as described in any of the above embodiments.

[0138] According to another aspect of the embodiments of the present application, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps of the blockchain-based financial guarantee method described in any of the above embodiments are implemented.

[0139] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a fully hardware embodiment, a fully software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media containing computer-usable program code. The storage medium may be implemented by any type of volatile or non-volatile storage device, or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic storage, flash memory, magnetic disk, or optical disk. These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0140] It should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit the present invention. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solutions of the present invention may be modified or replaced by equivalents without departing from the spirit and scope of the technical solutions of the present invention, which should all be included in the scope of the claims of the present invention.

Claims

1. A financial guarantee method based on blockchain, characterized in that: The financial guarantee methods include: In response to a guarantee application request from a transaction initiator, receiving transaction information from the transaction initiator; determining a risk level of the guarantee application based on the transaction information; If the guarantee application is of a low risk level, assigning a fast track to the guarantee application, wherein the fast track includes a first number of first verification nodes; If the guarantee application is of a high risk level, a safe channel is allocated for the guarantee application, where the safe channel includes a second number of second verification nodes, where the second number is greater than the first number, and the weight of the first verification node is higher than that of the second verification node.

2. The financial guarantee method according to claim 1, characterized in that: The financial guarantee method further includes: Set a basic spot check rate for all nodes in the blockchain's node pool; Increase the first spot check rate for nodes participating in low-risk financial guarantees; Increase a second spot check rate for nodes participating in high-risk financial guarantees, where the second spot check rate is lower than the first spot check rate; Adding a third random check rate for nodes whose health score is lower than a preset health score threshold, wherein the third random check rate is not greater than the first random check rate and the third random check rate is not less than the second random check rate; Performing spot checks on the nodes in the node pool at a spot check frequency that is no less than a preset spot check rate; If a malicious node is found through random inspection, the mortgage assets of the malicious node will be deducted and the reputation score of the malicious node will be reduced.

3. The financial guarantee method according to claim 2, characterized in that: If the guarantee application is of low risk, a fast track will be assigned to the guarantee application, including: If the guarantee application is of a low risk level, selecting a node in a first preset sequence of weight sorting from the node pool as a preliminary first node, wherein the sequence number of the first sequence is greater than the first quantity; Obtaining the real-time health of the first standby node; Eliminate the node whose health is lower than a first preset health threshold from the prepared first node; Determine the first verification node from the prepared first nodes according to the weight and the health; Determining the fast channel according to the first verification node; and / or, If the guarantee application is of a high risk level, a safe channel is allocated for the guarantee application, including: If the guarantee application is at a high risk level, a node having a health higher than a second preset health threshold is selected from the node pool as a reserve second node, where the second preset health threshold is higher than the first preset health threshold; Determine the second verification node from the prepared second nodes; determining the secure channel according to the second verification node; The health of the node is negatively correlated with the CPU occupancy rate of the node, the memory occupancy rate of the node, and the network delay value of the node. The weight of the node is positively correlated with the node's reputation score and the node's mortgage assets.

4. The financial guarantee method according to claim 3, characterized in that: After determining the fast channel according to the first verification node, the financial guarantee method further includes: Monitoring the health of the first verification node; Remove a node whose health is lower than a third preset health threshold from the secure channel and suspend all transactions of the node until the health of the node is higher than the third preset health threshold, wherein the third preset health threshold is lower than the first preset health threshold; Determine a first supplementary verification node from the prepared first nodes according to the weight and the health; Add the first supplementary verification node to the fast channel.

5. The financial guarantee method according to claim 4, characterized in that: After determining the fast channel according to the first verification node, the financial guarantee method further includes: If the voting result of the first verification node is not received within a preset response time, the first verification node is determined to be a timed-out node; Freeze the timeout node for a preset freezing period and suspend all transactions on the frozen node until the preset freezing period expires, at which point the transaction restrictions on the frozen node are lifted; Determine a second supplementary verification node from the prepared first node according to the weight and the health; Allocate the suspended transactions of the frozen node to the second replenishment verification node.

6. The financial guarantee method according to claim 5, characterized in that: The financial guarantee method further includes: determining a decision variable according to the first verification node and the second verification node; Determine the target optimization function based on the quality score, cost score and collaboration score; Determining target constraints of the target optimization function, wherein the target constraints include: quantity constraints, health constraints, resource constraints, and collaborative efficiency constraints; Determining the optimal decision variables when the objective optimization function is optimal according to the objective constraint conditions; Determine the first verification node and the second verification node according to the optimal decision variable; The decision variables are expressed by the following formula: The quality score is expressed by the following formula: The cost is expressed by the following formula: The synergy score is expressed by the following formula: z mn = x m x n or y m y n z mn Used to indicate whether nodes m and n work together, z mn =x m x n Characterizes that node m and node n cooperate in the secure channel, z mn =y m y n Indicates that node m and node n cooperate in the fast channel; The objective optimization function is expressed by the following formula: The quantity constraint is expressed by the following formula: K=K1+K2 The health constraint condition is expressed by the following formula: The resource constraint condition is expressed by the following formula: The collaborative efficiency constraint condition is expressed by the following formula: In the above formula, N is the total number of nodes in the node pool, K is the total number of nodes required for the secure channel and the fast channel, K1 is the first number, K2 is the second number, H1 is the first preset health threshold, H2 is the second preset health threshold, α is the preset time weight coefficient, β is the preset cost weight coefficient, γ is the preset collaborative efficiency coefficient, and w i is the weight of the node, h i is the health of the node, η mn is the collaborative efficiency, which is used to characterize the statistical value of the historical cooperation success rate between node m and node n, c i is the cost of the node i, η mn is the historical cooperation success rate between node m and node n, R k is the total amount of resources of type k (CPU / memory / bandwidth), r jk is the proportion of node j occupying resource k, θ1 is the preset lower limit of fast channel collaboration efficiency, and θ2 is the preset lower limit of secure channel collaboration efficiency.

7. The financial guarantee method according to claim 1, characterized in that: After allocating a fast track to the guarantee application if the guarantee application is of a low risk level, the financial guarantee method further includes: Obtaining the voting result of the first verification node; If more than a preset node threshold of the first verification nodes of the fast channel agree to the guarantee application, then the guarantee of the transaction information is determined to be effective; After allocating a safe channel for the guarantee application if the guarantee application is of a high risk level, the financial guarantee method further includes: Obtain the voting result of the second verification node; If the ratio of the sum of the weights of the second verification nodes in the secure channel that agree to the guarantee application to the sum of the weights of all second verification nodes in the secure channel exceeds a preset weight coefficient, it is determined that the guarantee of the transaction information is effective.

8. A financial guarantee device based on blockchain, characterized in that: The financial guarantee device includes: a processing module, configured to receive transaction information from a transaction initiator in response to a guarantee application request from the transaction initiator; a determination module, configured to determine a risk level of the guarantee application based on the transaction information; A first allocation module is configured to allocate a fast track for the guarantee application if the guarantee application is of a low risk level, wherein the fast track includes a first number of first verification nodes; The second allocation module is used to allocate a safe channel for the guarantee application if the guarantee application is of a high risk level, and the safe channel includes a second number of second verification nodes, the second number is greater than the first number, and the weight of the first verification node is higher than that of the second verification node.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory, wherein: The processor executes the computer program to implement the steps of the blockchain-based financial guarantee method according to any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the blockchain-based financial guarantee method described in any one of claims 1 to 7 are implemented.

Images