Block chain RWA resource intelligent distribution system fusing trusted data

Abstract

The invention relates to the technical field of resource allocation, in particular to a trusted data fused block chain RWA resource intelligent allocation system, which comprises a trusted data node identification module, a path cross resource identification module, a limited path content adjustment module, a task path relation disassembly module and a resource execution path screening module. In the invention, sharing association between task paths is constructed through a resource calling sequence and a node index, a path relationship of resource use behaviors is constructed by combining serial number differences of resource positions in a cross path, content replacement is carried out by combining node positions in a path control field, and a task path set with a coordinated sequence is generated; according to the method, path conflict items are removed, contents consistent in sequence are reserved, matching numbers are screened in combination with calling states of suspended paths and resource permission information, a configuration structure bound with resources and the paths is generated, and a task scheduling process is pushed to keep path-ordered, permission-matched and behavior-coordinated running states in a multi-path environment.

Description

Technical Field

[0001] This invention relates to the field of resource allocation technology, and in particular to a blockchain-based RWA resource intelligent allocation system that integrates trusted data. Background Technology

[0002] The field of resource allocation technology involves technologies related to the optimal allocation of limited physical or virtual resources among multiple entities. Its core aspects include resource scheduling strategy formulation, resource status assessment, allocation rule modeling, and data support and execution mechanisms for the allocation process. It is widely applied in various scenarios such as logistics scheduling, computing resource management, financial asset allocation, and power load scheduling. This technology emphasizes the rational allocation of resources through structured data input, rule-based or learning-based model construction, and dynamic update mechanisms, requiring the system to perform efficient, transparent, and traceable allocation operations under multiple constraints. Among these, the traditional blockchain-based RWA (Resource-Based Asset) intelligent allocation system, which integrates trusted data, refers to the system that uses blockchain technology to manage real-world asset data, implements the mapping, registration, and access control of RWA resources, and supports the resource allocation process through the parsing of trusted on-chain data. Its technical challenge is the trusted integration of on-chain data and RWA asset data. Traditional systems typically use a collaborative approach between off-chain databases and on-chain smart contracts to build data mapping relationships and complete the resource allocation process through transaction processing logic based on predefined rules.

[0003] Traditional systems lack a dynamic mapping mechanism between the order of resource calls and node indexes in task paths. The cross-use of shared resources between paths lacks fine-grained tracking at the numbering level. When resources have inconsistent call positions in multiple paths, it is difficult to identify conflict relationships. Path control items cannot be adjusted or replaced based on the order of calls, resulting in logical conflicts in task paths that cannot be resolved. Path status updates lag behind changes in resource interactions, and there is an imbalance between path activation conditions and resource permissions. Especially under conditions of intertwined multi-task paths and frequent resource reuse, this can easily lead to scheduling decision deviations and execution failures, restricting the response efficiency of the overall resource configuration chain and the execution consistency of the scheduling system. Summary of the Invention

[0004] To address the technical problems existing in current technologies, this invention provides a blockchain-based RWA (Resource Intelligent Allocation) system that integrates trusted data. The technical solution is as follows: On the one hand, a blockchain-based RWA resource intelligent allocation system integrating trusted data is provided, the system comprising: The trusted data node identification module obtains the trusted label, node index and task number of RWA resources, compares the node index with the resource call order of the task path, identifies duplicate nodes and maps them to the path, and obtains the scheduling shared node list. Based on the scheduling shared node list, the path intersection resource identification module extracts the resource call number of the shared node, compares the path number order, analyzes the differences in the call position of resources between paths, and obtains a resource path interaction record set. The restriction path content adjustment module extracts the path control nodes and their numbers, corresponding node order, and replaces them with the calling nodes in the cross path based on the resource path interaction record set, thus obtaining the restriction condition update task table. The task path relationship decomposition module updates the task table based on the constraints, extracts the path number and permission tag from the task list, splits the path order conflict items, and includes the order matching path into the task list to obtain the path reordering structure table. Based on the path reordering structure table, the resource execution path screening module extracts the suspended path number and the number of calls, stops inactive paths, and obtains the RWA resource allocation configuration structure according to the resource data and permission identifier corresponding to the path number.

[0005] As a further embodiment of the present invention, the scheduling shared node list includes node index, resource call order, and blockchain task number; the resource path interaction record set includes resource call number, path arrangement position, and cross-path usage behavior; the constraint update task table includes path control node name, resource path number, and path status content; the path reordering structure table includes task number, resource permission tag, and scheduling order number; and the RWA resource allocation configuration structure includes task path number, execution frame number, resource data, and permission identifier.

[0006] As a further aspect of the present invention, the RWA resource trust label refers to a boolean field that identifies whether the resource has been authenticated, indicating whether the RWA resource data is trustworthy; The node index refers to the location number of the resource in the logic, which is associated with the task number to construct the resource calling order structure in the task path.

[0007] As a further aspect of the present invention, the shared node refers to a resource node that is repeatedly invoked in the task path, and the index of the same node that appears repeatedly in the differentiated path is identified. The path order conflict refers to the inconsistent order in which the same resource is called in different task paths, resulting in logical contradictions between the paths.

[0008] As a further aspect of the present invention, the trusted data node identification module includes: The resource information extraction submodule obtains the trusted tags, node indexes, and task numbers of resources in the RWA resource registration record. It reads the trusted tag field, the corresponding task number and node index data, extracts the corresponding node positions according to the arrangement of task numbers in the registration table, reads the node list order, and obtains the task number associated node list. The path order comparison submodule extracts the resource call order number of the nodes in the task path based on the task number associated node list, compares the order number with the node index, determines whether the number order is consistent with the node arrangement, identifies offset inconsistencies, and matches the node order with the resource call sequence to obtain the node order offset result in the path. The duplicate node identification submodule extracts the node index field based on the node order offset result in the path and tracks the occurrence of nodes in the task path. It compares the node indexes according to the number of times they appear in the task path, filters the index items that are called repeatedly, matches the corresponding resources and node paths, and obtains the scheduling shared node list.

[0009] As a further aspect of the present invention, the path intersection resource identification module includes: The resource order extraction submodule extracts the resource number and call position in the task path corresponding to each shared node based on the scheduling shared node list, classifies the resource call positions according to the task path number, extracts the resource order sequence in each task path, and sorts the call positions according to the task number to which the node belongs, to obtain the resource order arrangement dataset. The path location comparison submodule compares the positions of resource call numbers between paths in the task path based on the resource order arrangement dataset, maps the correspondence between resource numbers and path numbers, extracts the set of resource nodes with inconsistent call positions in the differentiated paths, and obtains a list of path order difference nodes. The cross-behavior retrieval submodule extracts the usage trajectory and task path number of the corresponding resource based on the path order difference node list, extracts the access behavior of the resource in the path according to the resource number, analyzes the resource entries of the cross path number, outputs the resource path mapping record of non-sequential calls, and obtains the resource path interaction record set.

[0010] As a further aspect of the present invention, the restricted path content adjustment module includes: The path node extraction submodule extracts the node name and resource call identifier associated with each path number based on the path number and node information in the resource path interaction record set, arranges the node set according to the path number index order, filters the node data containing path control fields, maps the nodes to the path numbers, and obtains the path node index table. The node order alignment submodule extracts the occurrence order data of the path control nodes based on the path node index table, compares it with the node calling order in the cross path, aligns the position sequence of the nodes in the two paths, analyzes the difference fields in the order correspondence, records the information of the node called first in the cross path as the priority node, and obtains the node order alignment result set. The path control update submodule extracts the corresponding node identifier from the path control field based on the node order alignment result set, replaces the priority node with the original node, updates the corresponding path status data in the task activation control item, and rearranges the path control sequence according to the updated field structure to obtain the constraint update task table.

[0011] As a further aspect of the present invention, during the process of obtaining the node order alignment result set, the position sequence order of the alignment nodes in the two paths is compared, and the path control nodes whose node calling order in the path control field has an order difference are retained. During the extraction of the corresponding node identifier in the path control field, the identifier is selected from the path node index table at the node where the calling behavior occurs repeatedly; In the operation of replacing the priority node and the original node, the order in which the nodes are called in the path node index table corresponds to the order in which the nodes are arranged in the replacement path status data. After the path status data is updated according to the updated field structure, the path control sequence is arranged in order according to the correspondence between the node identifier and the path number in the field structure.

[0012] As a further aspect of the present invention, the task path relationship decomposition module includes: The field extraction submodule updates the task table based on the aforementioned constraints, extracts the task field with node order adjustment marker from the task list, parses the resource permission tag, path number and scheduling order number data included in the field, and uses the path number as the task index basis to obtain the path order number group distribution. The conflict elimination submodule, based on the path sequence number group distribution, extracts sequential conflict pairs in the number combination according to the combination relationship between the path number and the scheduling sequence number in the task field, determines whether there are task numbers with different path number arrangement positions in the conflict pair, and removes the task numbers to obtain a set of task numbers with consistent sequence. The path summarization submodule extracts the corresponding resource permission tags and path numbers from the task fields based on the set of sequentially consistent task numbers, constructs a path sequence with resource permission sorting features, arranges the paths according to the scheduling order number to form a path set, and adds the path set to the task list to obtain the path reordering structure table.

[0013] As a further aspect of the present invention, the resource execution path screening module includes: The task status extraction submodule extracts the suspended task path number and corresponding execution frame number based on the path reordering structure table, reads the task activation status data and call count information under the path number, matches the path number index, filters the task paths with call count associated with activation status, and obtains task path status comparison information. The path status determination submodule compares the number of calls with the task activation status based on the task path status comparison information to determine whether the task path is in an inactive state. It then marks the status of paths that are in a paused state to obtain a path execution status identifier set. The resource permission corresponding submodule filters the path numbers that are in the executable state based on the path execution status identifier set, extracts the resource data and permission identifiers corresponding to the path numbers, and compares the resource data items and permission identifier items to obtain the RWA resource allocation configuration structure.

[0014] Compared with the prior art, the advantages and positive effects of the present invention are as follows: In this invention, a shared association between task paths is constructed by resource call order and node index. The path relationship of resource usage behavior is constructed by combining the differences in resource position numbers in cross paths. The content is replaced by combining the node position in the path control field to generate a set of task paths with coordinated order. Path conflict items are eliminated and content with consistent order is retained. The call status of suspended paths and resource permission information are combined to filter and match numbers to generate a configuration structure that binds resources and paths. This promotes the task scheduling process to maintain an orderly, permission-matched, and behavior-coordinated running state in a multi-path environment. Attached Figure Description

[0015] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0016] Figure 1 This is a system flowchart of the present invention; Figure 2 This is a system block diagram of the present invention; Figure 3 This is a flowchart of the trusted data node identification module in this invention; Figure 4 This is a flowchart of the path intersection resource identification module in this invention; Figure 5 This is a flowchart of the path content adjustment module in this invention; Figure 6 This is a flowchart of the task path relationship decomposition module in this invention; Figure 7 This is a flowchart of the resource execution path screening module in this invention. Detailed Implementation

[0017] The technical solution of the present invention will now be described with reference to the accompanying drawings.

[0018] In embodiments of the present invention, words such as "exemplarily," "for example," etc., are used to indicate that something is an example, illustration, or description. Any embodiment or design described as "exemplary" in the present invention should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of the word "exemplary" is intended to present the concept in a concrete manner. Furthermore, in embodiments of the present invention, the meaning expressed by "and / or" can be both, or either one.

[0019] In the embodiments of this invention, the terms "image" and "picture" may sometimes be used interchangeably. It should be noted that, without emphasizing the distinction between them, their intended meanings are consistent. Similarly, the terms "of," "corresponding (relevant)," and "corresponding" may sometimes be used interchangeably. It should be noted that, without emphasizing the distinction between them, their intended meanings are consistent.

[0020] In this embodiment of the invention, sometimes a subscript such as W1 may be written in a non-subscript form such as W1. When the difference is not emphasized, the meaning they express is the same.

[0021] To make the technical problems, technical solutions and advantages of the present invention clearer, a detailed description will be given below in conjunction with the accompanying drawings and specific embodiments.

[0022] This invention provides a blockchain-based RWA resource intelligent allocation system that integrates trusted data, such as... Figure 1-2 The diagram shown illustrates a blockchain-based RWA resource intelligent allocation system that integrates trusted data. This system includes: The trusted data node identification module obtains the trusted data tag, the node index, and the corresponding blockchain task number of each resource in the current RWA resource registration record. Based on the correspondence between the node index and the task number, it compares the resource call order of the nodes in the task path, identifies whether there are nodes that are called repeatedly, and associates resources with the same node index to the corresponding task path to obtain the scheduling shared node list. The path cross-resource identification module is based on the scheduling shared node list. It extracts the call numbers of the resources associated with the shared nodes in the task path, compares the positions of the numbers in the path, identifies resource items with inconsistent call orders in the path, and cross-searches the usage behavior of resources between paths to obtain a resource path interaction record set. The restricted path content adjustment module extracts the node names and resource path numbers of the path control in the contract based on the resource path interaction record set, matches the order of the nodes in the path with the order of the cross paths, replaces the node names in the path control information with the corresponding nodes that are called first in the cross paths, and modifies the path status content in the task activation control item to obtain the restricted condition update task table. The task path relationship decomposition module updates the task table based on constraints, extracts the task field with node order update and the resource permission label, path number and scheduling order number in the field from the task list, excludes the task number that conflicts with the path order, re-divides the path number, retains the task path content with consistent resource permissions and order and puts it into the current task list, and obtains the path reordering structure table. The resource execution path screening module extracts the task path number and execution frame number in the suspended state based on the path reordering structure table, extracts the task activation status and call count corresponding to each number, and the path with the stopped call count is an inactive path. The resource data associated with the executable path is matched with the permission identifier to obtain the RWA resource allocation configuration structure.

[0023] The scheduling shared node list includes node index, resource call order, and blockchain task number; the resource path interaction record set includes resource call number, path arrangement position, and cross-path usage behavior; the constraint update task table includes path control node name, resource path number, and path status content; the path reordering structure table includes task number, resource permission tag, and scheduling order number; and the RWA resource allocation configuration structure includes task path number, execution frame number, resource data, and permission identifier.

[0024] Specifically, such as Figure 2 , 3 As shown, the trusted data node identification module includes: The resource information extraction submodule obtains the trusted tags, node indexes, and task numbers of resources in the RWA resource registration record. It reads the trusted tag field, the corresponding task number and node index data, extracts the corresponding node positions according to the arrangement of task numbers in the registration table, reads the node list order, and obtains the task number associated node list. First, retrieve the data from the "Trusted Tag" field in the record table. This field uses Boolean values ​​to indicate whether a resource has passed authentication, where 1 represents trusted and 0 represents untrusted. Next, read the "Task Number" and "Node Index" fields. The Task Number is a string, such as "TASK1001", "TASK1002", etc., and the Node Index is an integer representing the physical or logical location of the node, such as "1", "3", "5", etc. The read results are then temporarily stored in a cache list. Each record in the cache list is stored as a key-value pair, where the key is the Task Number and the value is an object containing the Trusted Tag and Node Index. When sorting the Task Numbers, they are arranged in ascending order according to their top-down sequence in the registration records. For example, the reading order would be "TASK1003", "TASK1001", "TASK1002", etc. If "002" is used, the order is 1, 2, 3, which correspond to the relative index positions of the original task numbers. This index is written into the corresponding task number data. Then, according to the arrangement order of each task number, the node position corresponding to the task number is extracted from the original node index table. Assuming that the node index corresponding to the task number "TASK1001" is 3 and the arrangement index is 2, the node position value is obtained by reading the second index position in the node position list. The node position value is used to associate the node list. The node list is an array of numbers listed in the physical deployment order, such as [2, 3, 5, 7, 9]. Here, the node number obtained when the node index position is 2 is 3, which is recorded as the associated node of the task number "TASK1001". The association extraction of all task numbers and node numbers is completed in turn, and finally the task number associated node list is obtained.

[0025] The path order comparison submodule extracts the resource call order number of the nodes in the task path based on the task number associated node list, compares the order number with the node index, determines whether the number order is consistent with the node arrangement, identifies the offset inconsistencies, and matches the node order with the resource call sequence to obtain the node order offset result in the path. First, the path node sequence associated with the task number as the key field is read from the path data record table. Each record in the node sequence is the resource node number that the task calls sequentially during execution. For example, if the node path associated with task number "TASK2001" is [3, 5, 7], it means that the task calls node resources number 3, 5, and 7 sequentially during execution. Next, a sequence number extraction operation is performed on each task number, that is, a sequence number is assigned according to the order position of the node in the path list. For example, in the above example, the sequence numbers are 1, 2, and 3. The sequence number is then compared with the node index obtained in the previous paragraph. The node index is the original physical order registered in the task and resource registration table at the beginning. For example, in task number "TASK2001", the original index of node 3 is 2, the original index of node 5 is 4, and the original index of node 7 is 5. After pairing the sequence number with the node index, a one-to-one comparison is performed. The specific judgment operation is to traverse the two arrays composed of sequence number and node index, and through the position comparison rule, if the i-th node is selected... If the node number corresponding to a sequential number is not equal to the node number corresponding to the i-th node index, it is identified as an offset. For example, if the sequential number 2 corresponds to node 5, while the node index position 2 corresponds to node 3, then the offset item is recorded as the position of sequential number 2 being offset. At the same time, the offset node number and its relative position in the original index and sequence are recorded. Continue processing all task numbers to obtain the comparison structure of the node number corresponding to each task with its sequential number and index. When constructing the correspondence between node order and resource call sequence, the sequential number array and the node index array are taken respectively. Using the node number as an intermediary, a position mapping matrix is ​​established. If the node number has inconsistent positions in the two arrays, then the difference between the actual sequence number and the registered position of the node in the call sequence is marked in the matrix. For example, if node number 5 is the 2nd position in the call sequence and the 4th position in the registration table, then the offset value is 2, and the offset direction is forward. Finally, the offset between the order of all nodes and the resource call sequence is confirmed, and the node order offset result in the path is obtained.

[0026] The duplicate node identification submodule extracts the node index field based on the node order offset result in the path and tracks the occurrence of nodes in the task path. It compares the node indexes according to the number of times they appear in the task path, filters the index items that are called repeatedly, matches the corresponding resources and node paths, and obtains the scheduling shared node list. First, read the node sequence offset data table. This table records three fields: node number, sequence number, and offset position corresponding to the task number. Extract the node number field data and aggregate all node numbers by task number. Extract the path node sequence corresponding to each task number one by one and construct a node index mapping table. The mapping table uses the node number as the key and the list of the first occurrence position and subsequent repeated occurrence positions of the node in the task path as the value. When traversing the task path sequence, check whether the node number has already appeared in the mapping table according to the index position. If the node number already exists, append the current position to the corresponding value list. If it does not exist, initialize a new item and record the current position as the first position. After traversing all path sequences, determine the number of times each node number appears in the task path. The number of times is the length of the position list in the mapping table. Filter the node number items with a count greater than 1. Here, the judgment condition is count>1. Identify that in the node number [3, 5, 7, 3, 5], nodes 3 and 5 appear twice in the path, which meets the filtering condition, and record them in the path. All index positions are determined, for example, node 3 appears in the 1st and 4th positions, and node 5 appears in the 2nd and 5th positions. Then, the filtered node numbers are matched with the node resource mapping record table. The resource mapping table records the resource number field corresponding to the node number. For example, the resource corresponding to node 3 is R1003, and the resource corresponding to node 5 is R1005. Combining the correspondence between task number and path node sequence in the path record table, the complete node call order in the task path is obtained. A binding array of node number and resource number is constructed. All resource numbers corresponding to duplicate node numbers are compared and recorded in the shared node list. The list structure is a key-value pair set, where the key is the resource number and the value is an array of node position indexes that are called repeatedly in multiple paths. For example, the path node index associated with resource number R1003 is [1, 4], and the path node index associated with resource number R1005 is [2, 5]. After completing the node traversal and duplicate item filtering of all task paths, all duplicate node numbers and their resource number and path index relationship are output to obtain the scheduling shared node list.

[0027] Specifically, such as Figure 2 , 4 As shown, the path intersection resource identification module includes: The resource order extraction submodule extracts the resource number and its call position in the task path for each shared node based on the scheduling shared node list. It categorizes the resource call positions by task path number, extracts the resource order sequence in each task path, and sorts the call positions by the task number to which the node belongs, thus obtaining the resource order arrangement dataset. First, the shared node list data is read. Each record in this data corresponds to a resource ID and the node call position of that resource in multiple task paths. The structure is a key-value pair, where the key is the resource ID and the value is a list. Each item is a record item composed of a task ID and a node position. For example, the record items associated with resource ID R3001 are [{TASK301, 2}, {TASK305, 4}, {TASK301, 5}]. The resource ID field and the call position field are extracted from this list to construct a task path classification table. The task path classification table uses the task ID as the key and an array consisting of all resource IDs and their corresponding call positions in that task path as the value. During execution, all record items in the shared node list are traversed. For each item processed, it is checked whether the task ID already exists in the task path classification table. If it exists, the current resource ID and its call position are appended as new array elements. If it does not exist, a new item is initialized and the first resource ID and call position are recorded. After classifying by location, the process proceeds to extract the resource order sequence. It iterates through each task number in the task path classification table, sorting all resource numbers and call positions recorded in that task path in ascending order of the call position field. For example, if task TASK301 has records [{R3001, 2}, {R3002, 1}, {R3003, 3}], after sorting, it becomes [{R3002, 1}, {R3001, 2}, {R3003, 3}]. The sorted resource numbers form the order sequence [R3002, R3001, R3003], which is the resource order sequence for that task path. After processing all task number paths and completing the sorting operation, a resource order arrangement dataset is constructed. The dataset structure is key-value pairs, where the key is the task number and the value is an array of resource numbers arranged in order of call position under that task path. This results in the final resource order arrangement dataset.

[0028] The path location comparison submodule compares the positions of resource call numbers between paths in the task path based on the resource order arrangement dataset, maps the correspondence between resource numbers and path numbers, extracts the set of resource nodes with inconsistent call positions in the differentiated paths, and obtains a list of path order difference nodes. First, extract all task numbers and their corresponding resource call sequences from the resource sequence sorting dataset. Each call sequence consists of resource numbers under that task path in the order of their calls. For example, the resource sequence for task number TASK401 is [R4001, R4002, R4003], and the resource sequence for TASK402 is [R4001, R4003, R4002]. Then, construct a resource number position mapping table. This table structure uses the resource number as the key and a dictionary of the resource's call position in each task path as the value. For example, resource number R4001 is at position 1 in TASK401 and position 1 in TASK402, while resource number R4002 is at position 2 in TASK401 and position 3 in TASK402. By comparing the positions of the same resource number in different task paths, if there is a discrepancy, the resource number is recorded as a sequence difference node. During the comparison process, the resource number is used as the traversal axis, and the call positions are compared along the task number dimension to determine if they are the same. The judgment method is: if the same resource... If the call position of a resource ID is inconsistent in any two task paths, it is considered to have a difference. This judgment does not rely on threshold judgment, but is directly based on the difference in position values. For example, R4002 is the 2nd position in path TASK401 and the 3rd position in path TASK402. Since 2≠3, this resource ID is marked as a sequence difference node. After performing this type of position comparison for all resource IDs, a correspondence between path IDs and resource IDs is constructed. The sequence difference of each different resource ID is recorded in which task paths, and the difference position value is also recorded. The difference position value is the absolute value of the difference between the position indices between paths. In the example, the difference value of R4002 is |2-3|=1. After comparing all resource positions, all resource IDs with inconsistent call positions in at least two paths are extracted to form a set of difference resource nodes. This set is in the form of an array structure, and each item contains a resource ID, a list of task paths, and a correspondence of position indices. Finally, the set of difference resource nodes is sorted, and the difference resource node IDs are output in sequence to obtain a list of path sequence difference nodes.

[0029] The cross-behavior retrieval submodule extracts the usage trajectory and task path number of the corresponding resource based on the list of path order difference nodes, extracts the access behavior of the resource in the path according to the resource number, analyzes the resource entries with cross path numbers, outputs the resource path mapping record of non-sequential calls, and obtains the resource path interaction record set. First, extract all resource IDs from the list of differing nodes and construct a resource path mapping table. Each entry in the mapping table uses the resource ID as the key and a record consisting of all task path IDs containing that resource ID and their call position sequences as the value. For example, if resource ID R5001 appears in both task paths TASK501 and TASK502, located at positions 2 and 4 respectively, then the mapping table record would be {R5001: [{TASK501, 2}, {TASK502, 4}]}. Then, for each resource ID, refine the resource access behavior... The process involves iterating through each task path record in the mapping table, sequentially calling resources, arranging the complete resource call sequence corresponding to the task number in the dataset, locating the position index of the target resource number in the sequence, and extracting the resource number before and after it as context nodes. For example, in TASK501, the resource call sequence is [R5003, R5001, R5004], then the context resources are R5003 and R5004. This information is then combined to form the resource trajectory data item {TASK501, R5003→R5001→R5004}. After processing all task path record items, the access trajectory record of the resource number in all paths is completed, forming a resource access trajectory table. Each item in the table is a set of access trajectories corresponding to the resource number. Then, the cross path number comparison operation is performed. The positions of multiple task path access trajectories recorded in the access trajectory table for each resource number are compared. The judgment process is as follows: the index value of the position of the resource number in any two paths is compared. If the index values ​​are different, it is marked as a non-sequential call. The context resource number is further compared. If there are inconsistent nodes in the context, it is marked as a cross behavior path. For example, R5001 is located in the 2nd position in TASK501 with contexts of R5003 and R5004, while it is located in the 4th position in TASK502 with contexts of R5002 and R5006. It is confirmed that the access order and access context of the resource are different in the two paths, which meets the cross judgment condition. The resource number, path number and trajectory record are added to the resource path interaction mapping set. After processing all the different resource numbers, the resource path interaction record set is obtained.

[0030] Specifically, such as Figure 2 , 5 As shown, the module for restricting path content adjustment includes: The path node extraction submodule extracts the node name and resource call identifier associated with each path number based on the path number and node information in the resource path interaction record set. It arranges the node set according to the path number index order, filters the node data containing path control fields, maps the nodes to the path numbers, and obtains the path node index table. First, all path numbers are read from the interaction record set, and their corresponding resource node sets are located. Each resource node consists of a resource number and a node name, for example, a record item {TASK601, R6001, Node-A}. All task paths are traversed and extracted to construct an initial path node mapping table. The structure is a set of key-value pairs, where the key is the path number and the value is a sequence of node names arranged in the order of resource invocation. Then, an index sorting operation is performed on this node name sequence, sorted in ascending order based on the index value of the resource invocation position in the path. For example, in task path TASK601, the node sequence is [Node-B, Node-A, Node-C], and its corresponding resource invocation order is [R6002, R6001, R6003]. The resource positions in the path are 2, 1, and 3. After sorting, the node sequence is adjusted to [Node-A, Node-B, Node-C]. After completing the sequential arrangement of nodes within the path, a path control field filtering operation is performed. This filtering process iterates through the node names in the node sequence one by one. The process involves retrieving node attribute fields from the node information database, extracting nodes marked as path control type, and determining if the field value equals "CONTROL". For example, if only Node-B has the path control attribute between Node-B and Node-C, then Node-B is selected. The selected node names are then combined with the path numbers to construct a path control node mapping structure. This structure records the names of all nodes with path control attributes under the path number and their index values ​​in the node sequence. If multiple nodes in the same path have control attributes, all are recorded in this structure. For example, Node-B is the second control node in TASK601, and Node-D is the first control node in TASK602. The final record is {TASK601: {Node-B, 2}, TASK602: {Node-D, 1}}. After completing all path traversal and node information filtering, the control node index relationship corresponding to all task paths is output, resulting in a path node index table.

[0031] The node order alignment submodule extracts the occurrence order data of path control nodes based on the path node index table, compares it with the node calling order in the cross path, aligns the position sequence of nodes in the two paths, analyzes the difference fields in the order correspondence, records the information of the node called first in the cross path as the priority node, and obtains the node order alignment result set. First, extract all records from the path node index table. Each record contains a path number, a control node name, and its index position in the path. Combine all path numbers in pairs to form a set of cross-path pairs; for example, path numbers TASK701 and TASK702 form a cross-path pair. Then, for each cross-path pair, read the list of control nodes corresponding to their respective path numbers and their sequential index positions in the path to construct a node alignment matrix. Each row of the matrix corresponds to a control node name, the column is the path number, and the cell value is the position index value of that node in the corresponding path. If a node exists only in one path, the other column is set to missing values. After the alignment matrix is ​​built, perform a position value comparison operation on each row of the matrix. The comparison process involves determining the size relationship between the position index values ​​corresponding to the same node name in two paths. If the index values ​​are different, the node with the smaller index value is considered superior in that path. First, the node is called. For example, node Node-A has an index of 2 in TASK701 and an index of 4 in TASK702. Since 2 < 4, it is determined that Node-A appears first in TASK701, and this node is recorded as the priority node. After processing all control nodes, the names of all nodes with order differences and their position index differences in each path are recorded in the order difference field set. This field set is used to count the difference in the order of node calls in the path pair. A path priority node mapping table is established by combining the path pair number and the node name, and the control node identified as the priority caller in each path pair is recorded, for example, {(TASK701, TASK702): Node-A}. The node position comparison and priority node identification operation of all path pairs is continued. After completion, the alignment result of the priority caller information in all path number pairs is output, and the node order alignment result set is obtained.

[0032] The path control update submodule extracts the corresponding node identifier from the path control field based on the node order alignment result set, replaces the priority node with the original node, updates the corresponding path status data in the task activation control item, and rearranges the path control sequence according to the updated field structure to obtain the constraint update task table. First, read all path numbers and priority node names from the node alignment result set to construct a node replacement mapping table. The mapping table uses the path number as the key and the original and priority node identifiers of the node to be replaced in the corresponding path as values. For example, the record item is {TASK801: {Node-B→Node-A}}. Then, read the path control field data table. Each record in this table corresponds to a path number, its control node identifier, and an activation status parameter. The parameter is stored as a Boolean value, where 1 indicates a node is active and 0 indicates a node is inactive. Iterate through each path control record, checking if the path number exists in the node replacement mapping table. If it exists, extract the corresponding node replacement item and replace the node name in the original control node identifier field with the priority node identifier name. If the path number does not exist in the mapping table, it remains unchanged. The replacement operation is performed sequentially according to the field position to ensure that the association between the node identifier and the path number field remains consistent after replacement. For example, the original record {TASK801, Node-B, Active=1} corresponds to the replacement item {Node-B→Node-A}. After the replacement of A}, the record is updated to {TASK801, Node-A, Active=1}. After the replacement, the task activation control item update stage begins. The control items corresponding to the path numbers in the task activation table are read one by one, and the original node identifier in the field is updated synchronously to the replaced node name. At the same time, a consistency check is performed on the activation status field to determine whether the updated node has a corresponding status record in the path control field. If it exists, the original status value is maintained; if it does not exist, the status field is initialized to 0. After continuing to perform field update operations for all path numbers, the updated dataset is restructured. The control items are reordered according to the natural ascending order of the path numbers. During the sorting process, the node positions are arranged in ascending order of the node index value. For example, the node index order in path TASK801 is [3, 1, 2], which is adjusted to [1, 2, 3] after sorting. The order of the corresponding node names is also adjusted synchronously to form a rearranged path control sequence. Finally, the updated path number, node name, activation status, and index sequence are recorded in the constraint update task table to obtain the constraint update task table.

[0033] Specifically, such as Figure 2 , 6 As shown, the task path relationship decomposition module includes: The field extraction submodule updates the task table based on constraints, extracts the task field with node order adjustment mark from the task list, parses the resource permission label, path number and scheduling order number data included in the field, uses the path number as the task index basis, and obtains the path order number group distribution; First, all task records in the constraint update task table are read. Each record contains task number, node name, resource identifier, activation status, and sequence flag fields. A filtering operation is performed on all records, extracting task data where the sequence flag value is 1. This flag indicates that the task has node order adjustment characteristics. The filtering operation iterates through each record to determine if the field sequence flag value is equal to 1. If the condition is met, the record is added to the task field set; otherwise, it is ignored. In the example, the task list contains {TASK901, Node-A, R9001, 1, 1} and {TASK9... Two records, 02, Node-B, R9002, 0, 0, are filtered, leaving only TASK901. Then, field parsing is performed on each record in the task field set, reading the resource permission tag, path number, and scheduling sequence number. The resource permission tag represents the access level as a string, such as "RWX" indicating read, write, and execute permissions. The path number is the task's associated path identifier, such as "PATH01". The scheduling sequence number is the task's relative sequence position in the execution plan, stored as an integer, such as "3". During parsing, these fields are extracted one by one and stored in the field parsing table. The table is parsed, with the structure {task number: {resource permission, path number, scheduling sequence number}}. After parsing, the fields of the parsed table are indexed by path number. Using the path number as the basis for task indexing, a path index mapping set is established. The set structure uses the path number as the key and the key value as an array of scheduling sequence numbers of all tasks under that path number. For example, if the scheduling sequence numbers of tasks TASK901 and TASK905 corresponding to PATH01 are 3 and 5 respectively, then the mapping record is {PATH01: [3, 5]}. During the mapping establishment process, the scheduling sequence number array is sorted in ascending order. To ensure that the numbering distribution is arranged from smallest to largest, a stable numbering distribution set is formed after sorting. Then, the index mapping records of all path numbers are traversed, and the scheduling number array under each path number is summarized into path sequence number group values. In the example, the number group value of PATH01 is {3, 5}, and the number group value of PATH02 is {1, 2, 4}. The corresponding distribution relationship between paths and sequence numbers is obtained through the summarization operation and recorded in the path number group value mapping table. Each item in the table records the path number, task number set and corresponding sequence number sequence. After all path numbers are processed, the path sequence number group distribution is obtained.

[0034] The conflict elimination submodule is based on the distribution of path sequence number groups. According to the combination relationship between path number and scheduling sequence number in the task field, it extracts sequential conflict pairs in the number combination, determines whether there are task numbers with different path number arrangement positions in the conflict pair, and removes the task numbers to obtain a set of task numbers with consistent sequence. First, all path numbers and scheduling sequence numbers corresponding to each other are read from the path sequence number distribution table. Each record uses the path number as the key and the scheduling sequence number array under that path as the value. For example, the number array corresponding to PATH1001 is [1, 2, 4], and the number array corresponding to PATH1002 is [1, 3, 4]. Then, the path number and scheduling sequence number corresponding to each task number are extracted from the task field set and combined to form a pair. For example, task TASK1101 corresponds to {PATH1001, 2}, and TASK1102 corresponds to {PATH1002, 3}. After constructing the combined index table, pairwise comparison operations are performed on the number array corresponding to each group of path numbers. The comparison process is to pair the sequential numbers within the task group with the same path number, and combine each number in the sequential number array with the number after it to form a sequential pair, forming a set of path sequence pairs. For example, the sequential array [1, 2, 4] in path PATH1001 forms the sequential pairs (1, 2) and (2, 4), and path PATH1002 forms the sequential pairs (1, 3) and (3, 4). After generating all path sequence pairs, a conflict pair extraction operation is performed. The conflict judgment condition is: if two path numbers have the same number element but their subsequent numbers are different, they are defined as a sequence conflict pair. In the example, number 1 is followed by number 2 in PATH1001 and number 3 in PATH1002. Since 2≠3, the conflict pair (1,2)-(1,3) is recorded. The sequence number combinations in all path number pairs are compared. After identifying all conflict pairs, the differential task screening stage is entered. The differential judgment is compared according to the arrangement position of the path numbers. The position difference detection is performed on the task numbers in the same conflict pair. If the arrangement index of the path numbers in the path group distribution table is different, it is determined to be a path position differential task number. Such task numbers are recorded as items to be removed. For example, the arrangement index of PATH1001 is 1 and the arrangement index of PATH1002 is 2. Tasks TASK1101 and TASK1102 correspond to a conflict pair, so they are identified as differential task pairs. Then these task numbers are removed from the task set to obtain a set of sequentially consistent task numbers.

[0035] The path summarization submodule extracts the corresponding resource permission tags and path numbers from the task fields based on the set of sequentially consistent task numbers, constructs a path sequence with resource permission sorting characteristics, arranges the paths according to the scheduling order number to form a path set, and adds the path set to the task list to obtain the path reordering structure table. First, read the complete list of task numbers from the sequentially consistent task number set. Then, search the corresponding task records in the task field table one by one. Extract the resource permission tag field and path number field from each record. The resource permission tag uses character combinations to represent the access level, such as "R" for read-only, "RW" for read-write, and "RWX" for read-write-execute. The path number field identifies the execution path number to which the task belongs, such as "PATH1201" and "PATH1202". Combine the resource permission tag and path number in each task record to form a feature pair. For example, TASK1201... {RWX, PATH1201}, TASK1202 is {R, PATH1202}. Based on this, a resource permission sorting feature set is established. The set structure is a key-value list with resource permission tags as index keys and corresponding path numbers as values. If the same permission tag corresponds to multiple path numbers, all path items under that tag are recorded as an array of path numbers. After completing the feature set construction, a scheduling sequence number field is further extracted from the path number items in the set. This field identifies the relative order position of the task in the specific scheduling sequence and is in integer form, such as TASK1201 sequence number. For example, TASK1202 is 1. After obtaining all the sequence numbers, the path numbers under each resource permission tag are sorted in ascending order according to their corresponding sequence numbers. For example, under RWX, the corresponding sequence numbers of PATH1201 and PATH1203 are 2 and 4 respectively, and the sorted path sequence is [PATH1201, PATH1203]. After sorting, a path set table is constructed. Each item in the table records the resource permission tag and the array of path numbers arranged in order. After performing the above sorting on all resource permission tags, a complete path set data structure is formed. This path set is then classified. The task list is entered by finding the corresponding path set based on the resource permission tag of each task number, and updating the sorted path number records to the task list table. The task list table structure is updated to task number, resource permission tag, path number and corresponding sort index value. In the example, the TASK1201 record is updated to {TASK1201, RWX, PATH1201, 1}, and TASK1203 is updated to {TASK1203, RWX, PATH1203, 2}. After the entry operation of all task records is completed, the path reordering structure table is obtained.

[0036] Specifically, such as Figure 2 , 7 As shown, the resource execution path filtering module includes: The task status extraction submodule extracts the suspended task path number and corresponding execution frame number based on the path reordering structure table, reads the task activation status data and call count information under the path number, matches the path number index, filters the task paths with call count associated with activation status, and obtains task path status comparison information. First, all records in the path reordering structure table are read. Each record contains a task number, path number, resource identifier, and node order information. Records with a status field marked as "suspended" are filtered out. This field value is set to "P" to indicate the task is suspended; other status values ​​such as "A" represent activated and "C" represent completed. During the filtering operation, each record is traversed, and the status field value is checked against "P". If the condition is met, the path number and corresponding execution frame number are written to the suspended path list. The execution frame number field is an integer value used to identify the frame position of the task during scheduling. For example, task TASK1301 with path number PATH1301 and execution frame number 5 will form the record {PATH1301, 5} after filtering. After filtering, the task status data reading stage begins. For each suspended path number, the task activation status data and call count information under that path number are extracted from the task status table. The activation status data is a boolean type, where 1 indicates the current task can be activated and 0 indicates it cannot be activated. The call count information is an integer type, recording the cumulative number of calls made by the task within the execution cycle. For example, under PATH1301... TASK1301 has been called 3 times and is in activation status 1. This information is aggregated by path number to generate a path status matching table. Then, a matching operation is performed on each path number. The corresponding record is searched in the path reordering structure table according to the path number index order, mapping the execution frame number of the suspended task to the path number. The activation status is then matched and associated with the call count data. The comparison rule is: if the path numbers are the same and the execution frame numbers are within two adjacent frames, they are determined to be in the same task status path group. The call count and activation status within this group are used to form a status comparison item. For example, PATH1301 has two records under frame number 5 and frame number 6, with call counts of 3 and 4, and activation statuses of 1 and 1 respectively. After matching, a status reference item {PATH1301, call count: [3, 4], activation status: [1, 1]} is generated. Then, all path numbers are traversed to determine if there is a matching result where both the call count and activation status are not empty. If so, it is written into the status reference information table. If any item is empty, the path number record is removed. Finally, all matched path numbers and their status information are summarized to obtain the task path status reference information.

[0037] The path status judgment submodule compares the number of calls with the task activation status based on the task path status comparison information to determine whether the task path is in an inactive state. It also marks the status of paths that are in a paused state to obtain a set of path execution status identifiers. First, all path numbers recorded in the status comparison information are read. For each path number, the activation status field and call count field are extracted in pairs. Each path number corresponds to a data structure consisting of two parallel arrays: an activation status sequence and a call count sequence. For example, PATH1501 corresponds to activation status [1, 1, 0, 1] and call counts [5, 6, 6, 7]. After data extraction, the activation status and call count fields for each path number are read in pairs at each index position. By reading data pairs at the same index position, a status judgment benchmark is formed. For example, if the activation status is 0 and the call count is not increasing, the current path record is considered an inactive record. The path numbers of records meeting the above conditions are marked. The path number marking structure is in key-value pair format, where the key is the path number and the value is "paused". After processing all path numbers, the initial status marking of all paths is completed. The marking results are then merged, with path numbers sharing the same status mark grouped and stored to construct a path status mark list. The activation status values ​​of each path number in the list are arranged in index order, forming a status sequence mapping structure. All values ​​in the status sequence are then read and the order of status label changes is recorded. For example, in the sequence [1, 1, 0, 0, 1], the label change is 1→0→1. The status change process of path number PATH1501 is recorded as this label sequence. This sequence is mapped one-to-one with the path number, forming a path number status label mapping structure. The status marking results and the label mapping structure are merged to form a structure set recording the path number, activation status flag, and status label sequence, ultimately yielding the path execution status mark set.

[0038] The resource permission corresponding submodule filters the path numbers that are in the executable state based on the path execution status identifier set, extracts the resource data and permission identifiers corresponding to the path numbers, and compares the resource data items and permission identifier items to obtain the RWA resource allocation configuration structure. First, all records in the status identifier set are read. Each record contains a path number and its corresponding activation status identifier. During the filtering process, path numbers with a status value of 1 are extracted as an executable path set. This set constitutes the range of paths that can be scheduled for execution in the current scheduling cycle. The filtering method involves checking if the status field of each record is equal to 1. If it is true, it is written into the path set. For example, if the status values ​​of path numbers PATH1401 and PATH1402 are 1 and 0 respectively, only PATH1401 will be included. Next, the resource data extraction process begins. For each path number in the executable path set, the path resource information table is called to read all associated resource data items under that path. The resource data uses the resource number as the primary key and includes attribute fields such as resource type, physical address, access count, and usage rights flag. After reading, the permission identifier extraction stage begins. The permission identifier field corresponding to the path number is found in the task field table. The permission identifier records resource usage rights restrictions using character labels, such as "R" for read-only, "RW" for read-write, and "RWX" for read-write-execute. A permission table structure is established that corresponds one-to-one between path numbers and permission identifiers. For example, PATH1401 corresponds to... The permissions are RW, and PATH1403 corresponds to permissions R. After completing the bidirectional mapping between path numbers, resource data, and permission identifiers, an association comparison operation is performed. For each path number, the access identifier in its resource data is compared with the permission tag to determine whether the permission level conditions are met. The judgment rule is that the permission tag level must be greater than or equal to the minimum access permission level required by the resource. For example, if the required permission for resource number R1401 is RW, and the permission identifier for path number PATH1401 is RWX, then the condition is met; otherwise, it is marked as insufficient permission. The permission level comparison is based on permissions. Based on character length and operation permission weight (R = 1, RW = 2, RWX = 3), the resource and permission comparison is performed for all path numbers. A resource permission matching record table is then constructed. Each item in the table is a path number, a resource number, and a Boolean value for the matching result. If the matching result is true, the resource is marked as accessible by the current path; otherwise, it is marked as an unschedulable resource. Finally, all successfully matched path numbers and their resource numbers are written into the RWA resource allocation configuration structure, forming a key-value structure set with the path number as the key and the resource number and permission level as the value, thus obtaining the RWA resource allocation configuration structure.

[0039] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the present invention should be included within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. A blockchain-based RWA resource intelligent allocation system integrating trusted data, characterized in that, The system includes: The trusted data node identification module obtains the trusted label, node index and task number of RWA resources, compares the node index with the resource call order of the task path, identifies duplicate nodes and maps them to the path, and obtains the scheduling shared node list. Based on the scheduling shared node list, the path intersection resource identification module extracts the resource call number of the shared node, compares the path number order, analyzes the differences in the call position of resources between paths, and obtains a resource path interaction record set. The restriction path content adjustment module extracts the path control nodes and their numbers, corresponding node order, and replaces them with the calling nodes in the cross path based on the resource path interaction record set, thus obtaining the restriction condition update task table. The task path relationship decomposition module updates the task table based on the constraints, extracts the path number and permission tag from the task list, splits the path order conflict items, and includes the order matching path into the task list to obtain the path reordering structure table. Based on the path reordering structure table, the resource execution path screening module extracts the suspended path number and the number of calls, stops inactive paths, and obtains the RWA resource allocation configuration structure according to the resource data and permission identifier corresponding to the path number.

2. The blockchain RWA resource intelligent allocation system integrating trusted data according to claim 1, characterized in that, The scheduling shared node list includes node index, resource call order, and blockchain task number; the resource path interaction record set includes resource call number, path arrangement position, and cross-path usage behavior; the constraint update task table includes path control node name, resource path number, and path status content; the path reordering structure table includes task number, resource permission tag, and scheduling order number; and the RWA resource allocation configuration structure includes task path number, execution frame number, resource data, and permission identifier.

3. The blockchain RWA resource intelligent allocation system integrating trusted data according to claim 1, characterized in that, The RWA resource trust label is a boolean field that identifies whether a resource has been authenticated, indicating whether the RWA resource data is trustworthy. The node index refers to the location number of the resource in the logic, which is associated with the task number to construct the resource calling order structure in the task path.

4. The blockchain RWA resource intelligent allocation system integrating trusted data according to claim 1, characterized in that, The shared node refers to the resource node that is repeatedly called in the task path, and the index of the same node that appears repeatedly in the differentiated path is identified. The path order conflict refers to the inconsistent order in which the same resource is called in different task paths, resulting in logical contradictions between the paths.

5. The blockchain RWA resource intelligent allocation system integrating trusted data according to claim 1, characterized in that, The trusted data node identification module includes: The resource information extraction submodule obtains the trusted tags, node indexes, and task numbers of resources in the RWA resource registration record. It reads the trusted tag field, the corresponding task number and node index data, extracts the corresponding node positions according to the arrangement of task numbers in the registration table, reads the node list order, and obtains the task number associated node list. The path order comparison submodule extracts the resource call order number of the nodes in the task path based on the task number associated node list, compares the order number with the node index, determines whether the number order is consistent with the node arrangement, identifies offset inconsistencies, and matches the node order with the resource call sequence to obtain the node order offset result in the path. The duplicate node identification submodule extracts the node index field based on the node order offset result in the path and tracks the occurrence of nodes in the task path. It compares the node indexes according to the number of times they appear in the task path, filters the index items that are called repeatedly, matches the corresponding resources and node paths, and obtains the scheduling shared node list.

6. The blockchain RWA resource intelligent allocation system integrating trusted data according to claim 1, characterized in that, The path intersection resource identification module includes: The resource order extraction submodule extracts the resource number and call position in the task path corresponding to each shared node based on the scheduling shared node list, classifies the resource call positions according to the task path number, extracts the resource order sequence in each task path, and sorts the call positions according to the task number to which the node belongs, to obtain the resource order arrangement dataset. The path location comparison submodule compares the positions of resource call numbers between paths in the task path based on the resource order arrangement dataset, maps the correspondence between resource numbers and path numbers, extracts the set of resource nodes with inconsistent call positions in the differentiated paths, and obtains a list of path order difference nodes. The cross-behavior retrieval submodule extracts the usage trajectory and task path number of the corresponding resource based on the path order difference node list, extracts the access behavior of the resource in the path according to the resource number, analyzes the resource entries of the cross path number, outputs the resource path mapping record of non-sequential calls, and obtains the resource path interaction record set.

7. The blockchain RWA resource intelligent allocation system integrating trusted data according to claim 1, characterized in that, The restricted path content adjustment module includes: The path node extraction submodule extracts the node name and resource call identifier associated with each path number based on the path number and node information in the resource path interaction record set, arranges the node set according to the path number index order, filters the node data containing path control fields, maps the nodes to the path numbers, and obtains the path node index table. The node order alignment submodule extracts the occurrence order data of the path control nodes based on the path node index table, compares it with the node calling order in the cross path, aligns the position sequence of the nodes in the two paths, analyzes the difference fields in the order correspondence, records the information of the node called first in the cross path as the priority node, and obtains the node order alignment result set. The path control update submodule extracts the corresponding node identifier from the path control field based on the node order alignment result set, replaces the priority node with the original node, updates the corresponding path status data in the task activation control item, and rearranges the path control sequence according to the updated field structure to obtain the constraint update task table.

8. The blockchain RWA resource intelligent allocation system integrating trusted data according to claim 7, characterized in that, During the process of obtaining the node order alignment result set, the position sequence order of the alignment nodes in the two paths is compared, and the path control nodes whose node call order in the path control field has a difference in order are retained. During the extraction of the corresponding node identifier in the path control field, the identifier is selected from the path node index table at the node where the calling behavior occurs repeatedly; In the operation of replacing the priority node and the original node, the order in which the nodes are called in the path node index table corresponds to the order in which the nodes are arranged in the replacement path status data. After the path status data is updated according to the updated field structure, the path control sequence is arranged in order according to the correspondence between the node identifier and the path number in the field structure.

9. The blockchain RWA resource intelligent allocation system integrating trusted data according to claim 1, characterized in that, The task path relationship decomposition module includes: The field extraction submodule updates the task table based on the aforementioned constraints, extracts the task field with node order adjustment marker from the task list, parses the resource permission tag, path number and scheduling order number data included in the field, and uses the path number as the task index basis to obtain the path order number group distribution. The conflict elimination submodule, based on the path sequence number group distribution, extracts sequential conflict pairs in the number combination according to the combination relationship between the path number and the scheduling sequence number in the task field, determines whether there are task numbers with different path number arrangement positions in the conflict pair, and removes the task numbers to obtain a set of task numbers with consistent sequence. The path summarization submodule extracts the corresponding resource permission tags and path numbers from the task fields based on the set of sequentially consistent task numbers, constructs a path sequence with resource permission sorting features, arranges the paths according to the scheduling order number to form a path set, and adds the path set to the task list to obtain the path reordering structure table.

10. The blockchain RWA resource intelligent allocation system integrating trusted data according to claim 1, characterized in that, The resource execution path filtering module includes: The task status extraction submodule extracts the suspended task path number and corresponding execution frame number based on the path reordering structure table, reads the task activation status data and call count information under the path number, matches the path number index, filters the task paths with call count associated with activation status, and obtains task path status comparison information. The path status determination submodule compares the number of calls with the task activation status based on the task path status comparison information to determine whether the task path is in an inactive state. It then marks the status of paths that are in a paused state to obtain a path execution status identifier set. The resource permission corresponding submodule filters the path numbers that are in the executable state based on the path execution status identifier set, extracts the resource data and permission identifiers corresponding to the path numbers, and compares the resource data items and permission identifier items to obtain the RWA resource allocation configuration structure.

Images