Blockchain transaction tracking method and device

By initializing the witness network in the blockchain transaction network and applying personalized web page ranking and local community discovery algorithms, the problem of difficulty in tracking blockchain transactions is solved, effective capture and tracking of transaction account paths is achieved, and transactions are improved Traceability and security.

CN114266323BActive Publication Date: 2024-11-22SUN YAT SEN UNIV
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202111661888.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-12-30
Publication Date
2024-11-22
Estimated Expiration
2041-12-30

AI Technical Summary

Technical Problem

Against the backdrop of the booming development of blockchain finance and digital currencies, it is difficult to track digital assets and easy to whitewash. How to effectively track transactions has become an urgent problem.

Method used

By initializing the witness network in the blockchain trading network, using personalized web page ranking algorithm and local community discovery algorithm, the target witness network is determined, and a local tracking network is built based on the network to achieve path capture and tracking between transaction accounts.

Benefits of technology

Effectively capture and track the capital flow paths between trading accounts, ensure the integrity and traceability of transaction information, and reduce the risk of transaction whitewashing.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114266323B_ABST
    Figure CN114266323B_ABST
Patent Text Reader

Abstract

The present application discloses a blockchain transaction tracking method and device, the method comprising: initializing a witness network based on a source node, wherein the witness network includes a node set, an edge set and the priority of each node, the source node is a node of interest in a transaction network, and the transaction network is a transaction network constructed based on transaction information of a blockchain network; determining a target witness network according to a personalized web page ranking algorithm, the witness network and the transaction network, wherein the importance residual of any node in the target witness network is less than a preset residual value; determining a local tracking network of the source node based on the target witness network according to a local community discovery algorithm. The local tracking network is a subnetwork of the target witness network, which can capture the path between the source node and other nodes, thereby realizing transaction tracking of the source node.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of blockchain technology, and more specifically, to a blockchain transaction tracking method and device. Background Art

[0002] Against the backdrop of the booming development of blockchain finance and digital currency, digital assets involved in cases are difficult to track and easy to launder. How to track transactions has become an urgent problem to be solved. Summary of the invention

[0003] In view of this, the present application provides a blockchain transaction tracking method and device to achieve transaction tracking.

[0004] To achieve the above objectives, the first aspect of the present application provides a blockchain transaction tracking method, comprising:

[0005] Initialize a witness network based on the source node, wherein the witness network includes a node set, an edge set, and the priority of each node. The source node is a node of interest in the transaction network, and the transaction network is a transaction network constructed based on the transaction information of the blockchain network.

[0006] Determine a target witness network according to the personalized web page ranking algorithm, the witness network and the transaction network, wherein the importance residual of any node in the target witness network is less than a preset residual value;

[0007] Based on the target witness network and according to a local community discovery algorithm, a local tracking network of the source node is determined, where the local tracking network is a subnetwork of the target witness network.

[0008] Preferably, the process of determining the target witness network according to the personalized web page ranking algorithm, the witness network and the transaction network includes:

[0009] The direction information of the neighbors of the node, the weight information of the edges connecting the adjacent nodes, and the time information of the edges connecting the adjacent nodes are embedded into the personalized web page ranking algorithm to obtain a transaction tracking ranking model;

[0010] A target witness network is determined according to the transaction tracking ranking model, the witness network, and the transaction network.

[0011] Preferably, the process of embedding the direction information of the neighbors of the node, the weight information of the edges connecting the adjacent nodes, and the time information of the edges connecting the adjacent nodes into the personalized web page ranking algorithm to obtain the transaction tracking ranking model includes:

[0012] According to the direction information of the node's neighbors and combined with the approximate calculation method of personalized web page ranking, the iterative equation and end condition of the transaction tracking ranking algorithm are determined;

[0013] The weight information of the edges connecting the adjacent nodes is embedded into the iterative equation to obtain a weighted iterative equation;

[0014] Embedding the time information of the edges connecting the adjacent nodes into the weighted iterative equation to obtain an iterative equation with time reasoning and weight;

[0015] The iterative equation with time reasoning and weight and the termination condition constitute the transaction tracking ranking model.

[0016] Preferably, the process of determining the iterative equation and the end condition of the transaction tracking ranking algorithm based on the directional information of the node's neighbors in combination with the approximate calculation method of the personalized web page ranking includes:

[0017] The iterative equations of the transaction tracking ranking algorithm are determined as the following set of equations:

[0018]

[0019] Among them, α∈[0,1] is a preset constant, β∈[0,1] is the tracking tendency parameter, and p s (u) is the importance of node u, r s (u) is the importance residual of node u, which is used to represent the priority of node u, v out ∈N out (u) and v in ∈N in (u) are the out-degree neighbors and in-degree neighbors of node u respectively;

[0020] θ β represents the allocation factor, which is expressed by the following mathematical formula:

[0021]

[0022]

[0023] Among them, d out (u) and d in (u) are the out-degree and in-degree values ​​of node u respectively;

[0024] The end condition is determined as: s (v)<∈, where ∈<1 and ∈ is a preset constant.

[0025] Preferably, the process of embedding the weight information of the edges between adjacent nodes into the iterative equation to obtain the weighted iterative equation includes:

[0026] The weighted iterative equation is determined as:

[0027]

[0028] Among them, θ w is a weighted allocation factor, expressed by the following mathematical formula:

[0029]

[0030]

[0031] in, and are the weighted out-degree value and weighted in-degree value of node u respectively.

[0032] Preferably, the process of embedding the time information of the edges between adjacent nodes into the weighted iterative equation to obtain the iterative equation with time reasoning and weight includes:

[0033] The iterative equation with time reasoning and weight is determined as:

[0034]

[0035] Among them, R s is a matrix of n×|V|, which is the importance residual of each node at each time point, ⊙ represents element multiplication, θ t is a distribution factor with time and weight, expressed by the following mathematical formula:

[0036]

[0037]

[0038] Among them, the vector w t (u,v) is the weight of the edge between node u and node v at time t, and are the weighted out-degree value and weighted in-degree value at each time point, Represents element-wise division.

[0039] Preferably, the process of determining the target witness network according to the transaction tracking ranking model, the witness network and the transaction network includes:

[0040] According to the transaction tracking ranking model, determine the target pop-up node with the highest priority in the witness network;

[0041] Based on the transaction network, obtain all neighbor nodes of the target pop-up node and the edges between each neighbor node and the target pop-up node;

[0042] Based on the neighbor nodes and the edges, and according to the transaction tracking ranking model, the witness network is updated to obtain an updated witness network;

[0043] Determining that the importance residual of any node in the updated witness network is less than a preset residual value;

[0044] If not, for the updated witness network, returning to the step of determining the target pop-up node with the highest priority in the witness network according to the transaction tracking ranking model;

[0045] If so, the updated witness network is determined as the target witness network.

[0046] Preferably, based on the neighbor nodes and the edges, and according to the transaction tracking ranking model, the witness network is updated to obtain an updated witness network, including:

[0047] According to the neighbor nodes and the edges, the node set and the edge set of the witness network are updated to obtain a first witness network;

[0048] According to the transaction tracking ranking model, the priority of each node in the first witness network is updated to obtain an updated witness network.

[0049] The second aspect of the present application provides a blockchain transaction tracking device, comprising:

[0050] A network initialization unit, configured to initialize a witness network based on a source node, wherein the witness network includes a node set, an edge set, and a priority of each node, the source node is a node of interest in a transaction network, and the transaction network is a transaction network constructed based on transaction information of a blockchain network;

[0051] A witness network construction unit, configured to determine a target witness network according to a personalized web page ranking algorithm, the witness network and the transaction network, wherein the importance residual of any node in the target witness network is less than a preset residual value;

[0052] A local tracing network determining unit is used to determine a local tracing network of a source node based on the target witness network and according to a local community discovery algorithm, wherein the local tracing network is a subnetwork of the target witness network.

[0053] Through the above technical solution, it can be known that the present application uses the node of interest in the transaction network as the source node, and initializes the witness network based on the source node. Among them, the transaction network is a transaction network constructed based on the transaction information of the blockchain network; the witness network includes a node set, an edge set and the priority of each node. It can be understood that the nodes in the node set represent the transaction accounts in the transaction network, the edges in the edge set represent the transaction situation between two nodes, i.e., the transaction accounts, and the priority of the node is used to characterize the priority of the node to the source node. Then, according to the personalized web page ranking algorithm, the witness network and the transaction network, the target witness network is determined. Among them, the importance residual of any node in the target witness network is less than the preset residual value. Since the importance residual of the node comes from the residual propagated from the source node, when the importance residual of any node in the target witness network is less than the preset residual value, it means that the target witness network has included all nodes with specific associations. Finally, based on the target witness network, according to the local community discovery algorithm, the local tracking network of the source node is determined. The local tracking network is a subnetwork of the target witness network, which can capture the path between the source node and other nodes, thereby realizing transaction tracking of the source node. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying any creative work.

[0055] Figure 1 A schematic diagram of a blockchain transaction tracking method disclosed in an embodiment of the present application;

[0056] Figure 2 This is a schematic diagram of the push-pop-up model process disclosed in the embodiment of the present application;

[0057] Figure 3 A schematic diagram of a blockchain transaction tracking device disclosed in an embodiment of the present application;

[0058] Figure 4 This is a schematic diagram of a blockchain transaction tracking device disclosed in an embodiment of the present application. DETAILED DESCRIPTION

[0059] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0060] The following describes the blockchain transaction tracking method provided by the embodiment of this application. Figure 1 The blockchain transaction tracking method provided in the embodiment of the present application may include the following steps:

[0061] Step S101, initializing the witness network based on the source node.

[0062] The witness network includes a node set, an edge set, and the priority of each node. It can be understood that the nodes in the node set represent each transaction account, and the edges in the edge set represent the transaction between two nodes, i.e., two transaction accounts. The priority of a node depends on the importance residual of the node relative to the source node, which can be used to characterize the priority of the node over the source node.

[0063] Source node is a pre-set node of interest in the trading network. Specifically, when it is necessary to track transactions for a certain trading account in the trading network, the node where the trading account is located is used as the source node. For a given source node in the trading network, transaction tracking aims to search for paths related to the source node through certain rules until the target node is found. The target node here can be the node where the capital flow from the source node finally arrives.

[0064] The transaction network is a transaction network built based on the transaction information of the blockchain network, which includes the transaction information recorded in the blockchain network.

[0065] For example, the transaction network can be represented as G = (V, E), where V represents the node set and E represents the edge set. Then, the witness network with source node s can be represented as in, and They represent the node set, edge set and priority of each node of the witness network. Next, we can Initialized to:

[0066]

[0067] in, Indicates an empty set, which means that transaction tracking has not started at this time; This means that during initialization, only the source node s has the highest priority. Here, 1 can also be understood as 100%, that is, the priority level is 100%.

[0068] Step S102, determining a target witness network according to the personalized web page ranking algorithm, the witness network and the transaction network.

[0069] Among them, the importance residual of any node in the target witness network is less than the preset residual value.

[0070] Personalized PageRank describes the probability that a user on a certain page in the network will visit other pages in the next step, which can be extended to the importance of other nodes in the network to a certain node. When the importance residual of any node in the target witness network is less than the preset residual value, it means that the target witness network has included all nodes with specific associations. That is, the target witness network has been built, and the important nodes and transaction information related to the source node's transaction have been included in the target witness network.

[0071] Step S103, based on the target witness network and according to the local community discovery algorithm, determine the local tracking network of the source node.

[0072] The local tracking network is a sub-network of the target witness network. Local community discovery is committed to starting from the source node and dividing a sub-network including the source node in the target witness network, so that the sub-network has a dense internal connection on the one hand and a sparse external connection on the other hand.

[0073] This application uses the node of interest in the transaction network as the source node, and initializes the witness network based on the source node. Wherein, the transaction network is a transaction network constructed based on the transaction information of the blockchain network; the witness network includes a node set, an edge set and the priority of each node. It can be understood that the nodes in the node set represent the transaction accounts in the transaction network, the edges in the edge set represent the transaction situation between two nodes, i.e., the transaction accounts, and the priority of the node is used to characterize the priority of the node to the source node. Then, according to the personalized web page ranking algorithm, the witness network and the transaction network, the target witness network is determined. Wherein, the importance residual of any node in the target witness network is less than the preset residual value. Since the importance residual of the node comes from the residual propagated from the source node, when the importance residual of any node in the target witness network is less than the preset residual value, it means that the target witness network has included all nodes with specific associations. Finally, based on the target witness network, according to the local community discovery algorithm, the local tracking network of the source node is determined. Wherein, the local tracking network is a subnetwork of the target witness network, which can capture the path between the source node and other nodes, thereby realizing the transaction tracking of the source node.

[0074] In some embodiments of the present application, the process of determining the target witness network according to the personalized web page ranking algorithm, the witness network and the transaction network in step S102 may include:

[0075] S1, embed the direction information of the node's neighbors, the weight information of the edges between adjacent nodes, and the time information of the edges between adjacent nodes into the personalized web page ranking algorithm to obtain a transaction tracking ranking model.

[0076] The direction information of the neighbor can be the out-degree and in-degree of the neighbor. For example, in the transaction between node A and node B, node A is the transferor of the transaction amount, and node B is the receiver of the transaction amount, then node B can be considered as the out-degree neighbor of node A; conversely, in the transaction between node A and node C, node C is the transferor of the transaction amount, and node A is the receiver of the transaction amount, then node C can be considered as the in-degree neighbor of node A. By embedding the direction information of the neighbor into the personalized web page ranking algorithm, the different influences and functions of the out-degree and in-degree can be better distinguished.

[0077] The weight information of the edge between adjacent nodes can be used to represent the total transaction amount of adjacent nodes. The larger the total transaction amount between two nodes, the greater the weight of the edge. By embedding the weight information of the edge between adjacent nodes into the personalized web page ranking algorithm, the different influences and effects brought by the size of the transaction amount can be better distinguished.

[0078] The time information of the edge between adjacent nodes can be used to represent the time when the transaction between the two nodes occurred. By embedding the time information of the edge between adjacent nodes into the personalized web page ranking algorithm, the different effects and functions brought by the distance of transaction time can be better distinguished.

[0079] S2, determine the target witness network based on the transaction tracking ranking model, witness network and transaction network.

[0080] Specifically, according to the transaction tracking ranking model, corresponding nodes and corresponding edges are obtained from the transaction network, and the witness network is updated through these nodes and edges, and finally the target witness network is obtained.

[0081] In some embodiments of the present application, the process of embedding the direction information of the neighbors of the node, the weight information of the edges of the adjacent nodes, and the time information of the edges of the adjacent nodes into the personalized web page ranking algorithm to obtain the transaction tracking ranking model may include:

[0082] S11, according to the directional information of the neighbors of the node, combined with the approximate calculation method of personalized web page ranking, determine the iterative equation and end condition of the transaction tracking ranking algorithm.

[0083] S12, embedding the weight information of the edges connecting the adjacent nodes into the iterative equation to obtain a weighted iterative equation.

[0084] S13, embedding the time information of the edges connecting the adjacent nodes into the weighted iterative equation to obtain the iterative equation with time reasoning and weight.

[0085] The iterative equation with time reasoning and weight and the termination condition constitute a transaction tracking ranking model.

[0086] Hypothesis about tracking tendency :

[0087] For S11 above, we can consider introducing a tracking tendency parameter β∈[0,1] to characterize the importance of out-degree neighbors and in-degree neighbors for a certain node. For example, the β value can be set as follows: when β>0.5, it tends to track out-degree neighbors; when β<0.5, it tends to track in-degree neighbors. At this time, the iterative equation of the transaction tracking ranking algorithm can be expressed as:

[0088] p s =αe s +(1-α)p s M β (1)

[0089] where p s Indicates the importance of each node, e s Represents the starting vector, only e s(s) = 1 and the remaining elements are 0; M β It represents the transfer matrix after adding the tracking tendency hypothesis, that is:

[0090]

[0091] Where A represents the adjacency matrix, D out represents the degree matrix, and D in represents the in-degree matrix.

[0092] Based on this, in some embodiments of the present application, the above S11 determines the iterative equation and the end condition of the transaction tracking ranking algorithm according to the direction information of the node's neighbors and the approximate calculation method of the personalized web page ranking, which may include:

[0093] The iterative equations of the transaction tracking ranking algorithm are determined as the following set of equations:

[0094]

[0095] Among them, α∈[0,1] is a preset constant, the typical value is 0.15, p s (u) is the importance of node u, r s (u) is the importance residual of node u, which is used to represent the priority of node u, v out ∈N out (u) and v in ∈N in (u) are the out-degree neighbors and in-degree neighbors of node u respectively;

[0096] θ β represents the allocation factor, which is expressed by the following mathematical formula:

[0097]

[0098]

[0099] Among them, d out (u) and d in (u) are the out-degree and in-degree values ​​of node u respectively;

[0100] The end condition is determined as: s (v)<∈, where ∈<1 and ∈ is a preset constant. The typical value of ∈ is 10 -2 , 10 -3 , 10 -4 or 10 -5 In addition, you can also use Property 3 given below in this application to customize the value that suits you.

[0101] Assumptions about weight contamination :

[0102] For S12 above, it is assumed that the weight of the edge between adjacent nodes represents the transaction amount. Therefore, for node u, the greater the weight of the edge between its neighbor and u, the more important the neighbor is to u. Based on this, equation (1) can be rewritten as:

[0103] p s =αe s +(1-α)p s M w (6)

[0104] Among them, M w Represents the transition matrix after adding the weight pollution hypothesis:

[0105]

[0106] Where W represents the weighted adjacency matrix, represents the weighted out-degree matrix, and represents the weighted in-degree matrix.

[0107] Based on this, in some embodiments of the present application, the process of embedding the weight information of the edges connecting the adjacent nodes into the iterative equation in the above S12 to obtain the weighted iterative equation may include:

[0108] The weighted iterative equation is determined as:

[0109]

[0110] Among them, θ w is a weighted allocation factor, expressed by the following mathematical formula:

[0111]

[0112]

[0113] in, and are the weighted out-degree value and weighted in-degree value of node u respectively.

[0114] Assumptions about Temporal Reasoning :

[0115] For the above S13, following a path that increases in time is more likely to track the destination of the capital flow, while following a path that decreases in time is more likely to track the source of the capital flow.

[0116] When the time information of the edge between adjacent nodes is used, the transaction network can be given timing information, and the time t∈{t1,…,t k ,…,t n The transaction network at} is represented as G (t), then equation (6) can be rewritten as:

[0117]

[0118] in represents the importance of each node at time t, represents the starting vector at time t, and represents the transfer matrix at time t after adding the temporal reasoning hypothesis. On this basis, p can be defined s is the mean over all time periods, that is:

[0119]

[0120] In addition, the transfer matrix in equation (11) can be expressed as:

[0121]

[0122] Where W (t) represents the weighted transfer matrix at time t, and They represent the accumulated weighted out-degree matrix and weighted in-degree matrix up to time t, respectively. Both can be expressed as the following equations:

[0123]

[0124]

[0125] Among them, there is t∈[t1,t n ], and i≤|V|.

[0126] Based on this, in some embodiments of the present application, the process of embedding the time information of the edges connecting the adjacent nodes into the weighted iterative equation in the above S13 to obtain the iterative equation with time reasoning and weight may include:

[0127] The iterative equation with time reasoning and weight is determined as:

[0128]

[0129] Among them, R s is a matrix of n×|V|, which is the importance residual of each node at each time point, ⊙ represents element multiplication, θ t is a distribution factor with time and weight, expressed by the following mathematical formula:

[0130]

[0131]

[0132] Among them, the vector wt (u,v) is the weight of the edge between node u and node v at time t, and are the weighted out-degree value and weighted in-degree value at each time point, Represents element-wise division.

[0133] In some embodiments of this application, please refer to Figure 2 , the process of determining the target witness network according to the transaction tracking ranking model, the witness network and the transaction network in S2 may include:

[0134] S21, according to the transaction tracking ranking model, determine the target pop-up node with the highest priority in the witness network.

[0135] This step mainly pops up the target pop-up node from the witness network, where the target pop-up node is the node with the highest priority in the witness network. The priority of the node can be calculated by the transaction tracking ranking model.

[0136] S22, based on the transaction network, obtain all neighbor nodes of the target pop-up node and the edges between each neighbor node and the target pop-up node.

[0137] This step mainly realizes the expansion of the witness network. Specifically, by obtaining all neighbor nodes of the target pop-up node and the edges between each neighbor node and the target pop-up node, these neighbors and edges are used to expand the witness network.

[0138] S23, based on the neighbor nodes and the edges between the neighbor nodes and the target pop-up nodes, according to the transaction tracking ranking model, the witness network is updated to obtain an updated witness network.

[0139] This step mainly implements the push of the witness network. Specifically, the neighbors and edges obtained in S22 are used to update the witness network, and the updated witness network is pushed out.

[0140] S24, determining whether the importance residual of any node in the updated witness network is less than a preset residual value. If so, executing S25; if not, executing S26.

[0141] S25, determining the updated witness network as the target witness network.

[0142] S26, for the updated witness network, return to execute the step in S21 to determine the target pop-up node with the highest priority in the witness network according to the transaction tracking ranking model.

[0143] In some embodiments of the present application, the above S23 updates the witness network based on the neighbor nodes and the edges between the neighbor nodes and the target pop-up nodes according to the transaction tracking ranking model to obtain the updated witness network, which may include:

[0144] S231, updating the node set and edge set of the witness network according to the neighbor nodes and the edges between the neighbor nodes and the target pop-up node to obtain a first witness network.

[0145] S232: Update the priority of each node in the first witness network according to the transaction tracking ranking model to obtain an updated witness network.

[0146] In some embodiments of the present application, the process of determining the local tracing network of the source node in step S103 based on the target witness network and according to the local community discovery algorithm may include:

[0147] S1, extracting a sub-network from the target witness network, so that the conductivity of the sub-network is less than a preset gap value.

[0148] S2, determining the sub-network as a local tracing network of the source node.

[0149] The conductivity of the subnetwork is expressed by the following mathematical formula:

[0150]

[0151] Among them, S is the node set of the sub-network, is the node directly associated with the subnetwork, p s (S) = ∑ u∈S p s (u).

[0152] When the conductivity satisfies Φ(S)<φ, the above goal can be considered to have been achieved, and the subnetwork composed of S is a local tracking network of the source node. Among them, Φ is a constant, generally φ<1, and the typical value is 10 -2 , 10 -3 or 10 -4 In addition, you can also use the property 3 given below to customize the value that suits you.

[0153] The blockchain transaction tracking method proposed in this application has the following three properties:

[0154] Property 1. The computational convergence complexity of the method proposed in this application is O(1 / ∈α), which is due to the approximate calculation method of personalized web page ranking. This application has low computational complexity, making it possible to quickly and effectively complete transaction tracking tasks on large-scale blockchain transaction networks.

[0155] Specifically, this application uses an approximate calculation method for personalized web page rankings, so the theorem proved by this method can still be directly applied to Property 1. For details, please refer to Theorem 1 in "Local Graph Partitioning using PageRankVectors".

[0156] Nature 2. The shortest path length n between the node in and the source node satisfies:

[0157]

[0158] This property reveals the upper bound of the depth that the method proposed in this application can track.

[0159] Specifically, let the importance residual of the n-th order neighbor of the source node s be If there is no node with an importance residual less than ∈ among the first n-order neighbors, then:

[0160]

[0161]

[0162]

[0163] Thus we can get:

[0164]

[0165] Property 3. Assume that the source node has only one target node, and the shortest path between the two is n. Considering the worst case, when all three assumptions of the transaction tracking ranking algorithm (tracking tendency, weight pollution, and time reasoning) fail, the model needs to meet the following conditions to find at least one path between the two:

[0166]

[0167] Here, Represents the average degree of nodes on the path.

[0168] Specifically, it is noted that the end condition of local community discovery in this application is:

[0169]

[0170] And from equation group (16), we know that the source node s must have:

[0171] p s (s)≥α

[0172] Since s∈S, p s (S)≥α, then:

[0173]

[0174] Let the n-th order target node be v n , when p s (v n )≥φα, the path between the source node and the target node can be found. To achieve this goal, substitute into equation (16):

[0175]

[0176] In addition, in order to ensure that the above inequality is satisfied before the transaction tracking ranking reaches the end condition, it must be:

[0177] φ≥∈

[0178] When all three assumptions of the transaction tracking ranking algorithm fail, let the target node v n The importance residual of the m-th order neighbor is Then we have:

[0179]

[0180]

[0181]

[0182] Among them, d i represents the degree of the i-th order neighbor, which can be known from the m-ary basic inequality:

[0183]

[0184] If the m-th order neighbor is the source node s, then:

[0185]

[0186] It can be seen that this application can ensure the effective completion of transaction tracking tasks even under harsh conditions.

[0187] The blockchain transaction tracking device provided in an embodiment of the present application is described below. The blockchain transaction tracking device described below and the blockchain transaction tracking method described above can be referenced to each other.

[0188] See also Figure 3 The blockchain transaction tracking device provided in the embodiment of the present application may include:

[0189] A network initialization unit 21 is used to initialize a witness network based on a source node, wherein the witness network includes a node set, an edge set, and a priority of each node, the source node is a node of interest in a transaction network, and the transaction network is a transaction network constructed based on transaction information of a blockchain network;

[0190] A witness network construction unit 22 is used to determine a target witness network according to the personalized web page ranking algorithm, the witness network and the transaction network, wherein the importance residual of any node in the target witness network is less than a preset residual value;

[0191] The local tracing network determining unit 23 is used to determine the local tracing network of the source node based on the target witness network and according to a local community discovery algorithm, wherein the local tracing network is a subnetwork of the target witness network.

[0192] In some embodiments of the present application, the process of the witness network construction unit 22 determining the target witness network according to the personalized web page ranking algorithm, the witness network and the transaction network may include:

[0193] The direction information of the neighbors of the node, the weight information of the edges connecting the adjacent nodes, and the time information of the edges connecting the adjacent nodes are embedded into the personalized web page ranking algorithm to obtain a transaction tracking ranking model;

[0194] A target witness network is determined according to the transaction tracking ranking model, the witness network, and the transaction network.

[0195] In some embodiments of the present application, the witness network construction unit 22 embeds the direction information of the node's neighbors, the weight information of the edges between the adjacent nodes, and the time information of the edges between the adjacent nodes into the personalized web page ranking algorithm to obtain the transaction tracking ranking model, which may include:

[0196] According to the direction information of the node's neighbors and combined with the approximate calculation method of personalized web page ranking, the iterative equation and end condition of the transaction tracking ranking algorithm are determined;

[0197] The weight information of the edges connecting the adjacent nodes is embedded into the iterative equation to obtain a weighted iterative equation;

[0198] Embedding the time information of the edges connecting the adjacent nodes into the weighted iterative equation to obtain an iterative equation with time reasoning and weight;

[0199] The iterative equation with time reasoning and weight and the termination condition constitute the transaction tracking ranking model.

[0200] In some embodiments of the present application, the process in which the witness network construction unit 22 determines the iterative equation and the end condition of the transaction tracking ranking algorithm based on the directional information of the node's neighbors and the approximate calculation method of the personalized web page ranking may include:

[0201] The iterative equations of the transaction tracking ranking algorithm are determined as the following set of equations:

[0202]

[0203] Among them, β∈[0,1] is the tracking tendency parameter, p s (u) is the importance of node u, r s (u) is the importance residual of node u, which is used to represent the priority of node u, v out ∈N out (u) and v in ∈N in (u) are the out-degree neighbors and in-degree neighbors of node u respectively;

[0204] θ β represents the allocation factor, which is expressed by the following mathematical formula:

[0205]

[0206]

[0207] Among them, d out (u) and d in (u) are the out-degree and in-degree values ​​of node u respectively;

[0208] The end condition is determined as: s (v)<∈, where ∈<1 and ∈ is a preset constant.

[0209] In some embodiments of the present application, the process in which the witness network construction unit 22 embeds the weight information of the edges between adjacent nodes into the iterative equation to obtain the weighted iterative equation may include:

[0210] The weighted iterative equation is determined as:

[0211]

[0212] Among them, θ w is a weighted allocation factor, expressed by the following mathematical formula:

[0213]

[0214]

[0215] in, and are the weighted out-degree value and weighted in-degree value of node u respectively.

[0216] In some embodiments of the present application, the process in which the witness network construction unit 22 embeds the time information of the edges of adjacent nodes into the weighted iterative equation to obtain the iterative equation with time reasoning and weight may include:

[0217] The iterative equation with time reasoning and weight is determined as:

[0218]

[0219] Among them, R s is a matrix of n×|V|, which is the importance residual of each node at each time point, ⊙ represents element multiplication, θ t is a distribution factor with time and weight, expressed by the following mathematical formula:

[0220]

[0221]

[0222] Among them, the vector w t (u,v) is the weight of the edge between node u and node v at time t, and are the weighted out-degree value and weighted in-degree value at each time point, Represents element-wise division.

[0223] In some embodiments of the present application, the process of the witness network construction unit 22 determining the target witness network according to the transaction tracking ranking model, the witness network and the transaction network may include:

[0224] According to the transaction tracking ranking model, determine the target pop-up node with the highest priority in the witness network;

[0225] Based on the transaction network, obtain all neighbor nodes of the target pop-up node and the edges between each neighbor node and the target pop-up node;

[0226] Based on the neighbor nodes and the edges, and according to the transaction tracking ranking model, the witness network is updated to obtain an updated witness network;

[0227] Determining that the importance residual of any node in the updated witness network is less than a preset residual value;

[0228] If not, for the updated witness network, returning to the step of determining the target pop-up node with the highest priority in the witness network according to the transaction tracking ranking model;

[0229] If so, the updated witness network is determined as the target witness network.

[0230] In some embodiments of the present application, the witness network construction unit 22 updates the witness network based on the neighbor nodes and the edges and according to the transaction tracking ranking model to obtain an updated witness network, which may include:

[0231] According to the neighbor nodes and the edges, the node set and the edge set of the witness network are updated to obtain a first witness network;

[0232] According to the transaction tracking ranking model, the priority of each node in the first witness network is updated to obtain an updated witness network.

[0233] In some embodiments of the present application, the process of the local tracing network determining unit 23 determining the local tracing network of the source node based on the target witness network and according to the local community discovery algorithm may include:

[0234] Extracting a sub-network from the target witness network such that the conductivity of the sub-network is less than a preset gap value;

[0235] Determine the subnetwork as a local tracing network of a source node;

[0236] The conductivity of the subnetwork is expressed by the following mathematical formula:

[0237]

[0238] Among them, S is the node set of the sub-network, is the node directly associated with the subnetwork, p s (S) = ∑ u∈S p s (u).

[0239] The blockchain transaction tracking device provided in the embodiment of the present application can be applied to blockchain transaction tracking devices, such as computers, etc. Optionally, Figure 4 The hardware structure diagram of the blockchain transaction tracking device is shown in FIG. Figure 4 The hardware structure of the blockchain transaction tracking device may include: at least one processor 31, at least one communication interface 32, at least one memory 33 and at least one communication bus 34.

[0240] In the embodiment of the present application, the number of the processor 31, the communication interface 32, the memory 33, and the communication bus 34 is at least one, and the processor 31, the communication interface 32, and the memory 33 communicate with each other through the communication bus 34;

[0241] The processor 31 may be a central processing unit CPU, or an application-specific integrated circuit ASIC (Application Specific Integrated Circuit), or one or more integrated circuits configured to implement the embodiments of the present application, etc.;

[0242] The memory 33 may include a high-speed RAM memory, and may also include a non-volatile memory, such as at least one disk memory;

[0243] The memory 33 stores a program, and the processor 31 can call the program stored in the memory 33, and the program is used to:

[0244] Initialize a witness network based on the source node, wherein the witness network includes a node set, an edge set, and the priority of each node. The source node is a node of interest in the transaction network, and the transaction network is a transaction network constructed based on the transaction information of the blockchain network.

[0245] Determine a target witness network according to the personalized web page ranking algorithm, the witness network and the transaction network, wherein the importance residual of any node in the target witness network is less than a preset residual value;

[0246] Based on the target witness network and according to a local community discovery algorithm, a local tracking network of the source node is determined, where the local tracking network is a subnetwork of the target witness network.

[0247] Optionally, the detailed functions and extended functions of the program may refer to the above description.

[0248] The embodiment of the present application further provides a storage medium, which may store a program suitable for execution by a processor, wherein the program is used to:

[0249] Initialize a witness network based on the source node, wherein the witness network includes a node set, an edge set, and the priority of each node. The source node is a node of interest in the transaction network, and the transaction network is a transaction network constructed based on the transaction information of the blockchain network.

[0250] Determine a target witness network according to the personalized web page ranking algorithm, the witness network and the transaction network, wherein the importance residual of any node in the target witness network is less than a preset residual value;

[0251] Based on the target witness network and according to a local community discovery algorithm, a local tracking network of the source node is determined, where the local tracking network is a subnetwork of the target witness network.

[0252] Optionally, the detailed functions and extended functions of the program may refer to the above description.

[0253] In summary:

[0254] This application uses the node of interest in the transaction network as the source node, and initializes the witness network based on the source node. Wherein, the transaction network is a transaction network constructed based on the transaction information of the blockchain network; the witness network includes a node set, an edge set and the priority of each node. It can be understood that the nodes in the node set represent the transaction accounts in the transaction network, the edges in the edge set represent the transaction situation between two nodes, i.e., the transaction accounts, and the priority of the node is used to characterize the priority of the node to the source node. Then, according to the personalized web page ranking algorithm, the witness network and the transaction network, the target witness network is determined. Wherein, the importance residual of any node in the target witness network is less than the preset residual value. Since the importance residual of the node comes from the residual propagated from the source node, when the importance residual of any node in the target witness network is less than the preset residual value, it means that the target witness network has included all nodes with specific associations. Finally, based on the target witness network, according to the local community discovery algorithm, the local tracking network of the source node is determined. Wherein, the local tracking network is a subnetwork of the target witness network, which can capture the path between the source node and other nodes, thereby realizing the transaction tracking of the source node.

[0255] Finally, it should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the presence of other identical elements in the process, method, article or device including the elements.

[0256] The various embodiments in this specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The various embodiments can be combined as needed, and the same or similar parts can refer to each other.

[0257] The above description of the disclosed embodiments enables those skilled in the art to implement or use the present application. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present application. Therefore, the present application will not be limited to the embodiments shown herein, but will conform to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A blockchain transaction tracking method, characterized in that: include: Initialize a witness network based on the source node, wherein the witness network includes a node set, an edge set and the priority of each node, the source node is a node of interest in the transaction network, and the transaction network is a transaction network constructed based on the transaction information of the blockchain network; the nodes in the node set represent each transaction account; the edges in the edge set represent the transaction status between two transaction accounts; Determine a target witness network according to the personalized web page ranking algorithm, the witness network and the transaction network, wherein the importance residual of any node in the target witness network is less than a preset residual value; Based on the target witness network, according to a local community discovery algorithm, a local tracking network of the source node is determined, where the local tracking network is a subnetwork of the target witness network; The process of determining the target witness network according to the personalized web page ranking algorithm, the witness network and the transaction network includes: The direction information of the neighbors of the node, the weight information of the edges connecting the adjacent nodes, and the time information of the edges connecting the adjacent nodes are embedded into the personalized web page ranking algorithm to obtain a transaction tracking ranking model; Determining a target witness network according to the transaction tracking ranking model, the witness network, and the transaction network includes: According to the transaction tracking ranking model, determine the target pop-up node with the highest priority in the witness network; Based on the transaction network, obtain all neighbor nodes of the target pop-up node and the edges between each neighbor node and the target pop-up node; Based on the neighbor nodes and the edges, and according to the transaction tracking ranking model, the witness network is updated to obtain an updated witness network; Determining that the importance residual of any node in the updated witness network is less than a preset residual value; If not, for the updated witness network, returning to the step of determining the target pop-up node with the highest priority in the witness network according to the transaction tracking ranking model; If so, the updated witness network is determined as the target witness network.

2. The method according to claim 1, characterized in that The process of embedding the direction information of the neighbors of the node, the weight information of the edges connecting the adjacent nodes, and the time information of the edges connecting the adjacent nodes into the personalized web page ranking algorithm to obtain the transaction tracking ranking model includes: According to the direction information of the node's neighbors and combined with the approximate calculation method of personalized web page ranking, the iterative equation and end condition of the transaction tracking ranking algorithm are determined; The weight information of the edges connecting the adjacent nodes is embedded into the iterative equation to obtain a weighted iterative equation; Embedding the time information of the edges connecting the adjacent nodes into the weighted iterative equation to obtain an iterative equation with time reasoning and weight; The iterative equation with time reasoning and weight and the termination condition constitute the transaction tracking ranking model.

3. The method according to claim 2, characterized in that The process of determining the iterative equation and the end condition of the transaction tracking ranking algorithm based on the directional information of the node's neighbors and the approximate calculation method of the personalized web page ranking includes: The iterative equations of the transaction tracking ranking algorithm are determined as the following set of equations: ; in, is a preset constant, To track the tendency parameters, For Node The importance of For Node The importance residual of The priority of and Node The out-degree neighbors and in-degree neighbors of ; represents the allocation factor, which is expressed by the following mathematical formula: ; in, and Node The out-degree and in-degree values ​​of ; The end condition is determined as: ,in, , is a preset constant.

4. The method according to claim 3, characterized in that The process of embedding the weight information of the edges connecting the adjacent nodes into the iterative equation to obtain the weighted iterative equation includes: The weighted iterative equation is determined as: ; in, is a weighted allocation factor, expressed by the following mathematical formula: ; in, and Node The weighted out-degree value and weighted in-degree value of .

5. The method according to claim 4, characterized in that The process of embedding the time information of the edges connecting the adjacent nodes into the weighted iterative equation to obtain the iterative equation with time reasoning and weight includes: The iterative equation with time reasoning and weight is determined as: ; in, for The matrix is ​​the importance residual of each node at each time point, represents element-wise multiplication, is a distribution factor with time and weight, expressed by the following mathematical formula: ; Among them, the vector For Node and nodes In time The weight of the edge on , and are the weighted out-degree value and weighted in-degree value at each time point, Represents element-wise division.

6. The method according to claim 1, characterized in that Based on the neighbor nodes and the edges, and according to the transaction tracking ranking model, the witness network is updated to obtain an updated witness network, including: According to the neighbor nodes and the edges, the node set and the edge set of the witness network are updated to obtain a first witness network; According to the transaction tracking ranking model, the priority of each node in the first witness network is updated to obtain an updated witness network.

7. The method according to claim 3, characterized in that Based on the target witness network, according to the local community discovery algorithm, a process of determining a local tracking network of a source node includes: Extracting a sub-network from the target witness network such that the conductivity of the sub-network is less than a preset gap value; Determine the subnetwork as a local tracing network of a source node; The conductivity of the subnetwork is expressed by the following mathematical formula: ; in, is the node set of the sub-network, is the node directly associated with the subnetwork, .

8. A blockchain transaction tracking device, characterized in that: include: A network initialization unit, configured to initialize a witness network based on a source node, wherein the witness network includes a node set, an edge set, and a priority of each node, the source node is a node of interest in a transaction network, and the transaction network is a transaction network constructed based on transaction information of a blockchain network; the nodes in the node set represent transaction accounts; and the edges in the edge set represent transaction conditions between two transaction accounts; A witness network construction unit, configured to determine a target witness network according to a personalized web page ranking algorithm, the witness network and the transaction network, wherein the importance residual of any node in the target witness network is less than a preset residual value; A local tracing network determining unit, configured to determine a local tracing network of a source node based on the target witness network and according to a local community discovery algorithm, wherein the local tracing network is a subnetwork of the target witness network; The witness network construction unit is specifically used to embed the direction information of the node's neighbors, the weight information of the edges between the adjacent nodes, and the time information of the edges between the adjacent nodes into the personalized web page ranking algorithm to obtain a transaction tracking ranking model; determine the target pop-up node with the highest priority in the witness network according to the transaction tracking ranking model; based on the transaction network, obtain all neighbor nodes of the target pop-up node, and the edges between each neighbor node and the target pop-up node; based on the neighbor nodes and the edges, and according to the transaction tracking ranking model, update the witness network to obtain an updated witness network; determine whether the importance residual of any node in the updated witness network is less than a preset residual value; if not, for the updated witness network, return to execute the step of determining the target pop-up node with the highest priority in the witness network according to the transaction tracking ranking model; if so, determine the updated witness network as the target witness network.