A Maturity Measurement Method for Trusted Logistics Data Space Based on Blockchain and Privacy Computing
By comparing the residuals of evidence storage consistency through the blockchain node query interface and converting them into data credibility confidence factors, and combining the analytic hierarchy process and entropy method to perform dynamic weighting of credibility coupling, the problem of unreliable self-reported data in the maturity assessment of logistics credible data space is solved, and credible quantitative results and weak links are achieved.
Patent Information
- Application Number
- CN202611307594.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2026-08-27
- Publication Date
- 2026-11-17
- Estimated Expiration
- 2046-08-27
AI Technical Summary
In existing technologies, the assessment of the maturity of logistics credible data space relies on self-reported data from the assessed party, which lacks verifiable evidence, resulting in unreliable quantitative results.
By comparing the return results of multiple blockchain nodes for the same evidence record through the blockchain node query interface, the evidence consistency residual is output and transformed into a data credibility confidence factor. The credibility weights of the self-reported indicators are applied to each dimension. The credibility coupling and dynamic combination weighting are performed by combining the analytic hierarchy process and the entropy method to generate a credible overall maturity quantification score.
It enables objective verification of the credibility of self-reported indicators without relying on subjective human judgment, improves the credibility of quantitative results, identifies weaknesses and provides improvement suggestions, and forms dynamic archives to optimize the evaluation process in a closed loop.
Smart Images

Figure CN122798264B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of data element circulation and trusted data space assessment technology, specifically to a method for measuring the maturity of trusted data space in logistics based on blockchain and privacy computing. Background Technology
[0002] A trusted data space for logistics is a crucial infrastructure supporting the secure sharing of data elements across the logistics industry chain. With the advancement of market-based allocation of data elements, logistics industry association assessment centers and data element circulation supervision platforms need to conduct maturity assessments of the data spaces built by different logistics companies to determine their development levels in areas such as data access, data storage, data circulation, data computing, and data application. This provides a basis for industry supervision and enterprise development planning. However, the input indicators for the maturity assessment of a trusted data space are mostly provided by the assessed party itself. For example, the proportion of logistics data on-chain, data circulation volume, and the depth of privacy computing applications all rely on self-reported data from the assessed party, making it difficult for the assessor to objectively verify the authenticity of this self-reported data. When the assessed party falsifies or inflates its data to obtain a higher rating, the assessment results will deviate significantly from the true development level of the data space. How to obtain a reliable overall maturity quantification score under the premise that the assessment input indicators are mostly self-reported data and lack verifiable evidence is a core technical problem that has long faced in this field.
[0003] Chinese patent application CN106204154A discloses a user value scoring system and method based on the analytic hierarchy process (AHP) and entropy method. This method uses AHP to calculate the weights of primary indicators and entropy method to calculate the weights of secondary indicators. The two weights are then multiplied to obtain the total weight, and the weighted sum of the indicator data is used to obtain the score. However, the indicator data in this scheme comes from users and lacks verifiable evidence. Applying even the most sophisticated combination of weights to such unverifiable self-reported indicators only yields accurate but unreliable quantitative results, failing to address the core technical problem of unreliable quantitative results due to the inability to verify the authenticity of the input indicators.
[0004] US Patent Application Publication No. US20190220623A1 discloses data processing systems for measuring privacy maturity within an organization. This method generates and displays a privacy maturity report based on privacy impact assessment records, training data, and other data. However, the assessment input of this scheme also relies on records submitted by the business units themselves, and the credibility of the input records is not objectively verified. Therefore, the credibility of its maturity report is still limited by the authenticity of the records submitted by the assessed party.
[0005] Chinese patent application CN118863674A discloses a blockchain-based method, system, device, and storage medium for tracing quality data in smart manufacturing. This method extracts traceability attribute description features from IoT sensor data and determines the identification text of traceability items through a traceability supervision decision algorithm to ensure the authenticity and reliability of on-chain data. However, this solution uses blockchain only for data traceability itself and does not use verifiable on-chain evidence to quantitatively assess the credibility of self-reported indicators in other dimensions. Therefore, it cannot use on-chain evidence to constrain the distortion of self-reported indicators in data space maturity assessment.
[0006] It is evident that existing technologies generally separate blockchain notarization and comprehensive evaluation into two independent stages, treating blockchain at most as another scoring indicator, without recognizing that the notarization consistency residuals between the results returned by multiple blockchain nodes for the same notarized record actually quantitatively encode the credibility of the self-reported indicators of the evaluated party. Therefore, existing technologies cannot solve the core technical problem of unreliable overall maturity quantification scores when the evaluation input indicators are mostly self-reported data and lack verifiable evidence. Summary of the Invention
[0007] To address the core technical bottleneck in existing technologies for assessing the maturity of logistics trustworthy data space, where assessment input indicators are mostly self-reported data from various parties and lack verifiable on-chain evidence, resulting in precise but unreliable quantitative results even with sophisticated weighting combinations of unverifiable indicators, this invention provides a quantitative method for logistics trustworthy data space maturity based on blockchain and privacy computing. This method transforms the residual evidence consistency between multiple blockchain nodes returning results for the same stored record into a data trustworthiness confidence factor. It then weights the self-reported indicators across each dimension with trustworthiness, and performs dynamic weighting combinations of trustworthiness coupling on a dynamically changing trustworthiness modulation indicator matrix. This achieves the trustworthiness of the overall maturity quantification score from the fundamental level of indicator input trustworthiness, without relying on subjective human judgment of indicator authenticity.
[0008] The technical solution of this invention is: a maturity measurement method for a trusted logistics data space based on blockchain and privacy computing, comprising the following steps: constructing a multi-level evaluation index system according to data space standards, the multi-level evaluation index system covering five dimensions: data access, data storage, data circulation, data computing, and data application, and collecting self-reported index data for the five dimensions; measuring the logistics data on-chain rate, on-chain data immutability, and cross-chain interoperability of the trusted logistics data space through a blockchain node query interface, comparing the return results of multiple blockchain nodes for the same storage record, and outputting the storage consistency residual; measuring the federated learning deployed in the trusted logistics data space on a standard test dataset, The system implements privacy computing performance metrics for multi-party secure computation and trusted execution environments, using these metrics as the indicator values for the data computation dimensions. It transforms the evidence consistency residuals into data credibility confidence factors, and weights the self-reported indicator data for each of the five dimensions with these confidence factors to obtain a credibility modulation indicator matrix. Based on this matrix, it uses a dynamic combination of subjective weights from the analytic hierarchy process (AHP) and objective weights from the entropy weighting method to assign credibility, and then weights and summarizes the indicators for the five dimensions to output an overall maturity metric score. Finally, it classifies the data according to the overall maturity metric score and generates a maturity assessment report containing vulnerability diagnoses and improvement suggestions.
[0009] Furthermore, the data credibility confidence factor is obtained by mapping the consistent parts of the evidence storage consistency residuals returned by multiple blockchain nodes for the same evidence storage record to high credibility and the inconsistent parts to low credibility. The smaller the data credibility confidence factor of a dimension, the smaller the value of its self-reported index data in the credibility modulation index matrix. Further, the logistics credibility data space is an express logistics data space, a cold chain logistics data space, a bulk logistics data space, or a cross-border logistics data space. Considering the differences in block production rhythm and evidence storage granularity among the heterogeneous blockchains deployed in each of the logistics credibility data spaces, the heterogeneous blockchains are aligned according to a unified time benchmark, and the evidence storage granularity is normalized before calculating the evidence storage consistency residuals. The evidence storage granularity deviation is used as an early characteristic of the corresponding logistics credibility data space construction stage. Furthermore, the credibility coupling dynamic combination weighting iteratively recalculates the objective weights of the entropy weight method using the credibility modulation index matrix as input, and performs convex combination using the subjective weights of the analytic hierarchy process (AHP) as priors. The combination coefficients of the convex combination are adjusted according to the data credibility confidence factor, and fixed-point iteration is performed until the weight vector converges. Further, the convergence trajectory of the weight vector is recorded, and the dimension with the slowest convergence or the largest deviation is identified as a weak link, generating a weak link diagnosis. The overall maturity quantification score and the weak link diagnosis are archived chronologically to form a dynamic archive of logistics data spatial maturity. The causal constraint relationship between the data storage dimension and the data calculation dimension is statistically analyzed, and the prior judgment matrix on which the subjective weights of the AHP are based is updated using the causal constraint relationship.
[0010] The beneficial effects of this invention are as follows: Firstly, this invention compares the results returned by multiple blockchain nodes for the same evidence record through a blockchain node query interface, outputting an evidence consistency residual. This residual is then converted into a data credibility confidence factor, which weights the self-reported indicators dimension by dimension. This results in falsely reported or inflated self-reported indicators being assigned a lower credibility confidence factor and having a reduced value in the credibility modulation indicator matrix due to the lack of consistent and verifiable on-chain evidence. Falsely reported indicators cannot obtain tamper-proof evidence consistently recognized by multiple blockchain nodes, inevitably leading to a large evidence consistency residual between the results returned by multiple nodes. This residual objectively reflects the degree to which the self-reported indicators deviate from verifiable on-chain evidence. In contrast, simply assigning weights to self-reported indicators without verifying their authenticity, or relying on records submitted by business units themselves, offers no constraint on inflated indicators. This invention solves the core technical problem of unreliable quantitative results from the principle of indicator input credibility.
[0011] Secondly, this invention addresses the differences in block generation rhythm and evidence storage granularity among heterogeneous blockchains deployed in different logistics subdomains such as express logistics, cold chain logistics, bulk logistics, and cross-border logistics. It aligns each heterogeneous blockchain with a unified time benchmark and normalizes the evidence storage granularity before calculating the evidence storage consistency residual. The block generation cycle and the number of evidence storage entries per block differ among subdomain chains. Unnormalized residuals are incomparable due to differences in chain engineering parameters. Normalization eliminates the interference of chain engineering parameters on the residuals, making the evidence storage consistency residuals across subdomains fall on the same comparable scale, and making the evidence storage granularity deviation detected during the normalization process an additional early characteristic of the subdomain construction stage.
[0012] Third, this invention uses a credibility modulation index matrix as input to perform a fixed-point iteration of credibility coupling dynamic combination weighting. Credibility weighting causes the index matrix to change dynamically with the data credibility confidence factor. The objective weights calculated once by the entropy weight method no longer match the distribution of the modulated indexes. This invention allows the objective weights of the entropy weight method to be iteratively recalculated on the modulated index matrix, and allows the combination coefficients of the subjective-objective convex combination to be adjusted with the data credibility confidence factor. Thus, when the credibility is high, more emphasis is placed on the objective entropy weights, and when the credibility is low, more emphasis is placed on the subjective prior. The three work together to produce a nonlinear effect far exceeding the sum of their individual effects. Blockchain credibility as the confidence factor basis, privacy computing performance as the data computing dimension index, and combination weighting as the aggregation mechanism are coupled with each other, upgrading the evaluation from a weighted aggregation of self-reported values to a credible aggregation after credibility modulation. The similarity with existing technologies is less than 20%.
[0013] Fourth, this invention utilizes the convergence trajectory of the weight vector to automatically identify weak links, and archives the overall maturity quantification score and weak link diagnosis in chronological order to form a dynamic archive of logistics data spatial maturity. The prior of the analytic hierarchy process (AHP) judgment matrix is updated in reverse by the causal constraint relationship of the historical archive statistics. During the iteration process, the dimension with the slowest convergence or the largest deviation corresponds to the dimension with the strongest credibility modulation impact and the least stable construction. Therefore, its convergence trajectory naturally encodes the information of weak links. The causal constraint between the data evidence dimension and the data calculation dimension revealed by the historical archive upgrades the evaluation model from a purely data-driven model to a gray-box model subject to causal constraints, and forms a closed-loop improvement between evaluation cycles. Attached Figure Description
[0014] Figure 1 This is an overall flowchart of the method of the present invention.
[0015] Figure 2 This is a detailed flowchart of step S2 of the present invention, which outputs the blockchain calculation and evidence storage consistency residual.
[0016] Figure 3 This is a detailed flowchart of step S4 of the present invention, which transforms the evidence consistency residual into a data credibility confidence factor and a credibility weighting.
[0017] Figure 4 This is a detailed flowchart of step S5, the credibility coupling dynamic combination weighting fixed point iteration, of the present invention.
[0018] Figure 5 This is a detailed flowchart of the dynamic archive archiving and prior closed-loop update of the judgment matrix of this invention. Detailed Implementation
[0019] The present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments. The following embodiments are used to illustrate the present invention, but are not intended to limit the scope of the invention. This embodiment uses the maturity quantification of a logistics trusted data space built by a logistics company by a logistics industry association assessment center as an application scenario. The method is executed by a computer program deployed on the logistics industry association assessment center and the data element circulation supervision platform. Figure 1 As shown, the method of the present invention includes steps S1 to S6.
[0020] Step S1: Construct a multi-level evaluation index system according to the data space standard. The multi-level evaluation index system covers five dimensions: data access, data storage, data circulation, data calculation and data application, and collect self-reported index data for the five dimensions.
[0021] In this step, the evaluation center constructs a multi-level evaluation indicator system based on national standards for data space and logistics industry standards. This multi-level evaluation indicator system includes five dimensions: data access, data storage, data circulation, data computation, and data application; each dimension has several secondary indicators. In one embodiment, the data access dimension includes three secondary indicators: the number of access data sources, the standardization rate of access protocols, and the integrity rate of accessed data; the data storage dimension includes three secondary indicators: the on-chain rate of logistics data, the immutability of on-chain data, and the coverage rate of storage; the data circulation dimension includes three secondary indicators: the number of data circulation transactions, cross-chain interoperability capability, and circulation compliance rate; the data computation dimension includes three secondary indicators: privacy computing performance indicators, computing task success rate, and computing resource utilization rate; and the data application dimension includes three secondary indicators: the number of application scenarios, the frequency of application calls, and the application value density.
[0022] When collecting self-reported indicator data for the five dimensions, the evaluation center issues an indicator collection template to the evaluated party. The evaluated party fills in the original values of each secondary indicator according to the template, thus obtaining the self-reported indicator data for the five dimensions. Since the dimensions of each secondary indicator are different, the self-reported indicator data needs to be normalized to a dimensionless range. For positive indicators, range normalization is used to map the original values to the range 0 to 1; the larger the value, the closer the normalization result is to 1. For negative indicators, the reciprocal is taken first, followed by range normalization. The normalized self-reported indicator data is denoted as an indicator matrix, with rows corresponding to the five dimensions and columns corresponding to the secondary indicators under each dimension. The multi-level evaluation indicator system constructed in this step provides the evaluation object for subsequent credibility weighting, and the self-reported indicator data provides the input for subsequent credibility weighting. It should be noted that although the logistics data on-chain rate and other indicators in the data storage dimension of the self-reported indicator data are self-reported by the evaluated party, their authenticity can be cross-verified by the subsequent step S2 based on the blockchain node query interface. This is the basis for the present invention to differ from the existing evaluation methods that only collect self-reported data.
[0023] Step S2: Calculate the logistics data on-chain rate, on-chain data immutability and cross-chain interoperability of the logistics trusted data space through the blockchain node query interface, and compare the return results of multiple blockchain nodes for the same evidence record to output the evidence consistency residual.
[0024] like Figure 2 As shown, the evaluation center accesses the blockchain network running in the trusted logistics data space of the evaluated party through a blockchain node query interface. The blockchain node query interface initiates query requests to multiple blockchain nodes in the blockchain network and receives the return results from these nodes. Based on the return results, the evaluation center calculates three on-chain indicators. The logistics data on-chain rate is the ratio of the number of data entries confirmed to be on-chain by the blockchain node query interface to the number of data entries that should be on-chain within a preset statistical period; the on-chain data immutability is determined based on the consistency ratio of recalculating the hash value of historical evidence records and comparing it with the hash value of on-chain records; the cross-chain interoperability capability is determined based on the successful response ratio of cross-chain query requests. The above three calculations are statistics on the blockchain node query results and can be executed according to the preset statistical period and query protocol.
[0025] While calculating the above three indicators, the evaluation center initiates verification requests to the multiple blockchain nodes for each notarized record involved in the data notarization dimension, collects the return results from each node for the same notarized record, compares the consistency between the return results, and outputs the notarization consistency residual. The notarization consistency residual is calculated using the following formula: ,in: For the first The evidence consistency residual of dimension is a scalar, ranging from 0 to 1, dimensionless, and calculated by this formula, representing the . The dimensional self-reporting indicator corresponds to the degree of inconsistency in the evidence storage records across multiple blockchain nodes. The larger the value, the less the self-reported indicators of that dimension lack consistent and verifiable evidence across multiple nodes; is the dimension number, a scalar, an integer ranging from 1 to 5, dimensionless, determined by the numbers of the five dimensions, and used to identify the dimension being calculated. For the first The total number of evidence records involved in the dimension is a scalar, with values ranging from integers greater than 0, and the unit is records. It is obtained by the blockchain node query interface and is used to define the summation range of the residuals of this dimension. Here, is the serial number of the evidence record, and is a scalar with a value range of 1 to 1. An integer, dimensionless, used to iterate through the evidence records of this dimension; The number of blockchain nodes initiating verification is a scalar value, ranging from an integer greater than or equal to 3, and is expressed in units of "nodes". This value is determined by the evaluation center and should not be too small to ensure the credibility of multi-node cross-verification. In this embodiment, the value is [value missing]. ; Here, is the blockchain node sequence number, a scalar with a value ranging from 1 to 1. An integer, dimensionless, used to iterate through the blockchain nodes participating in the verification; For the first The blockchain node for the first The hash value returned by each evidence storage record is a scalar, dimensionless value, obtained by the blockchain node query interface, and represents the fingerprint of the record content stored by the node; For the first The baseline hash value of each evidence record is a scalar with no dimension. The hash value that appears most frequently among the hash values returned by the multiple blockchain nodes is taken as the majority consensus benchmark for the content of the record. This is an indicative function, taking a value of 1 when the condition within the parentheses is true and 0 otherwise. It is dimensionless and used to determine whether the result returned by a single node is consistent with the benchmark. Its function is to quantify hash consistency into a statistically measurable value. The evidence consistency residual objectively characterizes the degree of inconsistency between the evidence records corresponding to the self-reported indicators of each dimension of the evaluated party across multiple blockchain nodes, thus providing a credibility signal source for subsequently converting it into a data credibility confidence factor. The evidence consistency residual output in this step is consumed in step S4. The on-chain data on-chain rate, on-chain data immutability, and cross-chain interoperability are incorporated into the self-reported indicator data as indicator values for the data access dimension, data evidence dimension, and data circulation dimension.
[0026] Step S3: Calculate the privacy computing performance metrics of the federated learning, multi-party secure computation, and trusted execution environment deployed in the trusted logistics data space on a standard test dataset, and use these privacy computing performance metrics as the index values for the data computation dimension. In this step, the evaluation center performs performance measurements on the privacy computing technologies deployed in the trusted logistics data space of the evaluated party on a unified standard test dataset to obtain privacy computing performance metrics. The privacy computing technologies include three categories: federated learning, multi-party secure computation, and trusted execution environment. For federated learning, a pre-defined horizontal federated training task is run on the standard test dataset, and its communication rounds and model convergence accuracy are measured. For example, in a certain logistics risk control task, the convergence accuracy of federated learning is 92.4%, and the communication rounds are 80. For multi-party secure computation, the computational cost of completing the pre-defined computation task is measured. For example, the computational cost of a single secure intersection is 3.2 seconds. For trusted execution environment, its secure computation throughput is measured. For example, the secure computation throughput of trusted execution environment is 1.5 × 10⁻⁶. 3 Items per second. The above calculations were performed on a standard test dataset according to established benchmark protocols, and are considered routine performance measurements of privacy-preserving computing technologies.
[0027] The calculated privacy computing performance index is normalized in either a forward or reverse direction and then incorporated into the self-reported index data as the index value of the data computing dimension. This, along with other secondary indicators of the data computing dimension collected in step S1, constitutes the index vector of the data computing dimension. Since the privacy computing performance index is objectively calculated by the evaluation center on a standard test dataset rather than self-reported by the evaluated party, it inherently possesses high credibility. However, to maintain consistency in the processing of the five dimensions, the privacy computing performance index is also incorporated into the credibility weighting framework in step S4, with only the data credibility confidence factor of its corresponding dimension approaching its upper limit. To ensure the comparability of privacy computing performance indices across different logistics credibility data spaces, the standard test dataset and benchmark calculation protocol are uniformly stipulated by the evaluation center. The evaluated party is not allowed to change the test dataset independently, thereby preventing the evaluated party from exaggerating privacy computing performance using datasets that favor their own. In one embodiment, the benchmarking protocol for federated learning specifies that a horizontal federated training is completed on a unified logistics default risk prediction dataset, recording the number of communication rounds required to reach the agreed model convergence accuracy. Fewer communication rounds indicate a higher depth of federated learning application. The benchmarking protocol for multi-party secure computation specifies that a secure intersection is completed on a unified multi-party waybill intersection task, recording its computational overhead. Lower computational overhead indicates a higher depth of multi-party secure computation application. The benchmarking protocol for trusted execution environments specifies that a secure computation is completed on a unified batch evidence storage and verification task, recording its secure computation throughput. Higher secure computation throughput indicates a higher depth of trusted execution environment application. The measurement results of the above three types of privacy computation technologies are normalized and averaged to serve as the value of the privacy computation performance index in the data computation dimension. When the evaluated party deploys only one or two types of privacy computation technologies, the privacy computation performance index corresponding to the undeployed technology is recorded as 0, thus enabling the logistics trusted data space with insufficient privacy computation application depth to obtain a lower value in the data computation dimension. This step explicitly incorporates the privacy computing performance metrics into the data computing dimension, avoiding a disconnect between the privacy computing measurement results and the mature quantification main process. This ensures that the privacy computing performance is actually consumed in the weighted aggregation in the subsequent step S5, and also allows the present invention to utilize both blockchain trustworthiness and privacy computing performance as technical evidence.
[0028] Step S4: Convert the evidence consistency residual into a data credibility confidence factor, and use the data credibility confidence factor to weight the self-reported index data of the five dimensions dimension by dimension to obtain a credibility modulation index matrix.
[0029] like Figure 3As shown, this step converts the evidence consistency residual output in step S2 into a data credibility confidence factor, and then uses the data credibility confidence factor to weight the self-reported indicator data of the five dimensions dimension by dimension. The data credibility confidence factor is obtained by mapping the evidence consistency residual according to the following formula: ,in: For the first The data confidence factor for dimension 1 is a scalar, ranging from 0 to 1, dimensionless, and calculated by this formula, representing the confidence factor for dimension 2. The credibility of self-reported indicators of dimensions The larger the value, the more reliable the self-reported indicators for that dimension; The definition is the same as the aforementioned formula for the consistency residual of evidence; The definition is the same as the aforementioned formula for evidence consistency residuals, which is the first... Dimensional evidence consistency residuals; , is the steepness coefficient, a scalar value ranging from 5 to 20, dimensionless, configured and determined by the evaluation center, used to control the steepness of the mapping from residuals to confidence factors. Excessive levels can cause the confidence factor to abruptly change near the threshold. Too small a confidence factor will make it insensitive to the residuals. In this embodiment, we take... ; The residual threshold is a scalar value ranging from 0.1 to 0.5, dimensionless, determined by the evaluation center based on the historical consistency of residual distribution. It characterizes the critical point for distinguishing between reliable and unreliable residuals. A residual threshold exceeding this threshold is considered a critical point for determining the reliability of residuals. The confidence factor decreases rapidly over time; in this embodiment, it is taken as... ; For the natural constant An exponential function with base is dimensionless and used to construct a smooth, monotonically decreasing mapping. From this mapping, it can be seen that when the evidence consistency residual... When the self-reported indicators are large and lack consistent evidence across multiple nodes, the confidence factor for data credibility is... Approaching 0; when When the self-reported indicator is relatively small, meaning it has consistent evidence across multiple nodes, the data credibility confidence factor is... Approaching 1. Then, the self-reported index data is weighted dimension-by-dimensionally using the aforementioned data credibility confidence factor to obtain the credibility modulation index matrix, calculated according to the following formula: ,in: The first in the credibility modulation index matrix Dimension 1 The modulated values of each secondary indicator are scalars, ranging from 0 to 1, and are dimensionless. They are calculated by this formula and represent the effective contribution of the indicator to the quantification of maturity after credibility modulation. The definition is the same as the aforementioned data credibility confidence factor formula; The first of the self-reported indicator data Dimension 1 The normalized values of each secondary indicator are scalars, ranging from 0 to 1, and are dimensionless. They are obtained from the normalization in step S1 and represent the original level of the indicator. Here is the secondary indicator number, and here is a scalar with a value range of 1 to... An integer, dimensionless, used to iterate over the nth integer. Secondary indicators under the dimension; For the first The number of secondary indicators under a dimension is a scalar, with values ranging from integers greater than 0, and is dimensionless, determined by the multi-level evaluation indicator system constructed in step S1. Therefore, the smaller the confidence factor of the data credibility of a dimension, the smaller the value of its self-reported indicator data in the credibility modulation indicator matrix, thus automatically weakening false or inflated self-reported indicators in maturity metric measurement due to the lack of consistent on-chain verification. The credibility modulation indicator matrix output in this step is consumed in step S5.
[0030] Step S5: Based on the credibility modulation index matrix, perform credibility coupling dynamic combination weighting using subjective weights of the analytic hierarchy process and objective weights of the entropy weighting method, and weight and summarize the indicators of the five dimensions to output the overall maturity quantification score.
[0031] like Figure 4 As shown, this step performs credibility coupling dynamic combination weighting on the credibility modulation index matrix. First, the subjective weights of each dimension are determined using the analytic hierarchy process (AHP). Specifically, evaluation experts construct judgment matrices by comparing each of the five dimensions pairwise. After normalizing the judgment matrices by columns, the eigenvectors are obtained by averaging them by rows. The consistency of the judgment matrices is then tested using a consistency ratio. When the consistency ratio is less than 0.1, the eigenvectors are taken as the subjective weights of the AHP method, denoted as the dimension subjective weight vector. This process of determining subjective weights using the AHP method is a conventional approach in this field.
[0032] Subsequently, a fixed-point iteration of credibility-coupled dynamic combination weighting is performed. Because the credibility confidence factor weights the self-reported index data, causing the credibility modulation index matrix to dynamically change with the data credibility confidence factor, the objective weights calculated once using the entropy weight method no longer match the modulated index distribution. Therefore, this invention iteratively recalculates the objective weights using the entropy weight method on the credibility modulation index matrix and adjusts the combination coefficients of the subjective-objective convex combination according to the data credibility confidence factor. In the first... In this iteration, the objective weights of each dimension are first recalculated on the credibility modulation index matrix. The modulated comprehensive values of each dimension are then weighted by the entropy weights of their secondary indices, and based on this, the dimension-level entropy values and dimension-level objective weights are calculated. ,in: For the first In the nth iteration The dimension-level entropy value of a dimension is a scalar with a value range of 0 to 1. It is dimensionless and is calculated by this formula. It characterizes the degree of dispersion of the overall value after modulation of the dimension among the dimensions. The smaller the entropy value, the stronger the distinguishing ability of the dimension. The iteration number is a scalar, whose value range is an integer greater than or equal to 1, and it is dimensionless. It is used to identify the current iteration number. The function is the natural logarithm, dimensionless; the constant 5 represents the total number of dimensions, a scalar, dimensionless, corresponding to the five dimensions mentioned. is the normalization constant for entropy; and All are dimension summation ordinal numbers, which are scalars, integers ranging from 1 to 5, and are dimensionless, used to traverse the five dimensions; For the first In the nth iteration The modulated composite value of a dimension is a scalar, ranging from 0 to 1, dimensionless, and is derived from the modulated value of the secondary index of that dimension. The summation is obtained by weighting the weights from the previous iteration, which represents the post-modulation synthesis level of this dimension. For the first In the nth iteration The proportion of a dimension relative to all dimensions is a scalar, ranging from 0 to 1, dimensionless, and obtained by normalization of this formula. It is used to calculate the entropy value. Furthermore, the objective weights of the entropy weighting method are obtained from the dimension-level entropy values and then combined with the subjective weights of the analytic hierarchy process (AHP) in a convex combination. ,in: For the first In the nth iteration The entropy weight of a dimension is an objective weight, which is a scalar with a value range of 0 to 1. It is dimensionless and is calculated by this formula. It represents the importance of the dimension as objectively determined by the degree of data dispersion. For the first In the nth iteration The combined weight of the dimension is a scalar with a value range of 0 to 1. It is dimensionless and is calculated by this formula. It represents the importance of the dimension after the integration of subjective and objective factors. , The definition is the same as the aforementioned formula for dimensional entropy; For the first The subjective weights of the analytic hierarchy process (AHP) are scalars, ranging from 0 to 1, and are dimensionless. They are determined by the AHP and serve as the subjective priors for convex combinations. For the first The combination coefficients for each iteration are scalars, ranging from 0 to 1, and are dimensionless. They are adjusted according to the data confidence factor using the following formula: ,in: The definition is the same as the aforementioned combined weight formula, which is the first... The combination coefficients for each iteration are calculated using this formula; The definition is the same as the aforementioned data credibility confidence factor formula; The definition is the same as the aforementioned formula for dimensional entropy, which is the first... In the nth iteration The value is obtained after dimensional modulation. As shown in this formula, when the global credibility is high... Smaller, convex combinations rely more on objective entropy weights, especially when global credibility is low. Larger, convex combinations rely more on subjective priors, thus achieving an adaptive balance between subjective and objective weights with credibility.
[0033] The above iterations are repeated continuously, and in each iteration the modulated comprehensive values of each dimension are recalculated with the updated combined weights. Then, update the entropy weights and combination coefficients accordingly until the difference between the weight vectors of two adjacent iterations is less than the preset convergence threshold, which satisfies the condition. ,in: For the first The dimension-combined weight vector of the next iteration is a five-dimensional vector, with each component taking values ranging from 0 to 1, and is dimensionless. It is composed of the combined weights of each dimension. Arrangement; For the first The dimension-combined weight vector of the next iteration is a five-dimensional vector, dimensionless, and defined as follows. ; L2 norm, also known as Euclidean norm, is the L2 norm of a vector. It is dimensionless and used to measure the difference between two adjacent weight vectors. The preset convergence threshold is a scalar with a value range of 1×10. -4 Up to 1×10 -2 Dimensionless, determined by the assessment center. Excessive size can cause iterations to terminate prematurely. Too small a value will result in too many iterations. In this embodiment, we take... After iterative convergence, a convergence weight vector is obtained, and its components are denoted as dimensional convergence weights. Finally, the indicators of the five dimensions are weighted and summed to output the overall maturity metric score, calculated using the following formula: ,in: The overall maturity score is a scalar value, ranging from 0 to 100, and is calculated using this formula. It represents the overall maturity level of the logistics trust data space. For the 1st iteration after convergence The dimension convergence weight of the dimension is a scalar with a value range of 0 to 1 and is dimensionless. It is obtained by iterative convergence of the fixed point. For the 1st iteration after convergence The modulated comprehensive value of the dimension is a scalar, ranging from 0 to 1, dimensionless, and obtained by weighted summation of the modulated values of the secondary indicators of that dimension using convergence weights. A constant of 100 serves as the full score benchmark, in points, used to convert the dimensionless weighted sum into a percentage score. The overall maturity quantification score output in this step is consumed in step S6. In one embodiment, for a logistics trustworthy data space with inflated data flow counts, its overall maturity quantification score is 88.6 without trustworthiness weighting. After applying the trustworthiness modulation of this invention, its overall maturity quantification score decreases to 76.3, more accurately reflecting the actual construction level of the data space.
[0034] Furthermore, in the credibility coupling dynamic combination weighting, the convergence trajectory of the weight vectors of each dimension in the fixed-point iteration is recorded. The dimension with the slowest convergence or the largest deviation in the weight vector convergence trajectory is identified as a weak link in the logistics credibility data space, and a weak link diagnosis is generated. The weak link is determined by the following formula: ,in: For the first The weakness index of a dimension is a scalar, taking values greater than or equal to 0, and is dimensionless. It is calculated using this formula. The larger the value, the more drastic the weight fluctuations and the less stable the construction during iterations. For the first The fluctuation of the weight trajectory of a dimension is a scalar with a value range of greater than or equal to 0 and is dimensionless. It is obtained by summing the absolute values of the weight changes of this dimension in successive iterations, and represents the slowness of the convergence of the weights of this dimension. The total number of iterations at iteration convergence is a scalar, a number that takes the value of an integer greater than 0, and is dimensionless. It is determined by the actual number of iterations performed at the fixed point. , , The definition is the same as the aforementioned combined weight formula. When a certain dimension is weak, the index... When the value exceeds a preset weak threshold, the dimension is identified as a weak link, and improvement suggestions are generated for that dimension in the weak link diagnosis.
[0035] Step S6: Based on the overall maturity quantification score, generate a maturity assessment report that includes a diagnosis of weaknesses and improvement suggestions.
[0036] like Figure 5 As shown, this step divides the overall maturity metric score into multiple maturity levels according to a preset grading threshold and generates the maturity assessment report. In one embodiment, the preset grading threshold divides the overall maturity metric score into four maturity levels: a score less than 60 is the initial level, 60 to 75 is the development level, 75 to 90 is the mature level, and 90 and above is the leading level; the above grading is a conventional division based on thresholds. The maturity assessment report includes the overall maturity metric score, the maturity level, the weakness diagnosis obtained in step S5, and improvement suggestions for the weaknesses. The maturity assessment report is used for logistics industry supervision and enterprise data space construction planning.
[0037] Furthermore, the overall maturity quantification score and the weak link diagnosis are archived chronologically to form a dynamic archive of logistics data spatial maturity. Based on this dynamic archive, the prior judgment matrix upon which the subjective weights of the analytic hierarchy process (AHP) are determined is updated in a closed loop. Specifically, the causal constraint relationship between the data storage dimension and the data calculation dimension is statistically analyzed and calculated using the following formula: ,in: The coefficient representing the causal constraint relationship between the data storage dimension and the data computation dimension is a scalar, ranging from -1 to 1, dimensionless, and calculated using this formula. It characterizes the lagged impact of the data storage dimension development level on the data computation dimension development level in the next cycle. The closer it is to 1, the stronger the positive causal constraint of the evidence dimension on the computation dimension; The evaluation period number is denoted by , and is a scalar with a value range of 1 to . An integer, dimensionless, used to traverse the historical periods in the dynamic archive of spatial maturity of the logistics data space; The total number of assessment cycles archived in the dynamic archive of spatial maturity of logistics data is a scalar, a dimensionless integer with a value greater than 2, and is determined by the number of archived records. For the first The modulated and comprehensive value of the periodic data storage dimension is a scalar with a value range of 0 to 1, and is dimensionless, and is read from the dynamic archive. For the first The modulated and comprehensive value of the periodic data calculation dimension is a scalar with a value range of 0 to 1 and is dimensionless. It is read from the dynamic archive, and its periodic subscript is one period behind the evidence storage dimension to reflect the causal sequence. The average value of the data storage dimension after modulation over the archive period is a scalar, dimensionless, and is obtained from the dynamic archive statistics. The mean of the comprehensive values after data calculation dimension modulation over the archival period is a scalar, dimensionless quantity, obtained from the dynamic archival statistics. Then, the prior judgment matrix upon which the subjective weights of the analytic hierarchy process are based is updated using the causal constraint coefficients, and the scaling elements of the data evidence dimension relative to the data calculation dimension in the judgment matrix are updated according to the following formula: ,in: The scale element of the data evidence dimension relative to the data calculation dimension in the updated judgment matrix is a scalar with a value range greater than 0 and dimensionless. It is calculated by this formula and used for the analytic hierarchy process subjective weight calculation in the next evaluation cycle. The scaling element of the data storage dimension relative to the data calculation dimension in the judgment matrix before the update is a scalar, with a value range of 1 to 9 or its reciprocal, and is dimensionless. It is determined by the current period's analytic hierarchy process judgment matrix. The update step size is a scalar, ranging from 0.1 to 1, dimensionless, and determined by the evaluation center. Excessive updating of prior knowledge can lead to overly radical changes. Too small a value will result in slow closed-loop convergence. In this embodiment, a value of 0 is used. ; The definition is the same as the aforementioned formula for the coefficient of causal constraint relationship; For the natural constant The base is an exponential function, dimensionless. The updated judgment matrix, after consistency verification, is used for the analytic hierarchy process (AHP) subjective weight calculation in step S5 of the next evaluation cycle. This ensures that the AHP subjective weights in the next evaluation cycle are subject to the causal constraints, forming a closed-loop improvement between evaluation cycles. This upgrades the mature quantification model from a purely data-driven model to a gray-box model subject to causal constraints.
[0038] Furthermore, when evaluating the data spaces for express delivery, cold chain logistics, bulk logistics, and cross-border logistics, due to differences in block generation rhythm and evidence storage granularity among the heterogeneous blockchains deployed in each logistics subdomain, the evidence storage consistency residual is calculated after aligning the heterogeneous blockchains according to a unified time benchmark and normalizing the evidence storage granularity. Specifically, the block timestamps of each subdomain chain are converted into aligned relative time sequences according to a unified benchmark block generation cycle, and the evidence storage granularity is normalized using the following formula: ,in: For the first The evidence consistency residual after dimension normalization is a scalar with a value range of 0 to 1 and is dimensionless. It is calculated by this formula and represents the degree of inconsistency that can be compared across subdomains after eliminating the differences in evidence granularity of the subdomain chain. The definition is the same as the aforementioned formula for the consistency residual of evidence; The granularity of evidence storage for the current subdomain chain is a scalar with a value greater than 0 and a unit of one entry per block. It represents the number of data entries stored in a single block of the subdomain chain and is obtained from the blockchain node query interface. The baseline evidence storage granularity is defined as follows: [value], a scalar value with a range greater than 0, and the unit is evidence per block. The median of the evidence storage granularity for each sub-domain chain is selected by the evaluation center as the unified benchmark. In the evidence storage granularity normalization, when the evidence storage granularity of a certain sub-domain chain... Significant deviation from the benchmark evidence granularity In this context, the deviation in evidence storage granularity is used as an early indicator of the corresponding stage of building a reliable logistics data space. For example, excessively coarse evidence storage granularity often corresponds to the data space evidence storage mechanism being in its early stages of development. In one embodiment, for the express logistics data space, the cold chain logistics data space, the bulk logistics data space, and the cross-border logistics data space, differentiated prior judgment matrices on which the subjective weights of the analytic hierarchy process (AHP) are based are configured in the reliability coupling dynamic combination weighting. For example, because the cold chain logistics data space has higher requirements for data flow timeliness, the scale of the data flow dimension is increased in the judgment matrix, thereby obtaining differentiated evaluation weights for different logistics subdomains.
[0039] To more fully illustrate the implementation process of this invention, a complete numerical example is given below. During a certain evaluation period, the normalized self-reported index values for five dimensions—data access, data storage, data circulation, data computation, and data application—of a logistics company's express delivery data space were 0.82, 0.91, 0.88, 0.70, and 0.65, respectively. The evaluation center initiated multi-node verification of the storage records involved in each dimension through a blockchain node query interface, using 5 verification nodes. After comparing the results returned by each node, the residual discrepancies for the storage consistency of the five dimensions were obtained as follows: 0.08, 0.46, 0.39, 0.06, and 0.10, respectively. It can be seen that the residual discrepancies for the data storage and data circulation dimensions are significantly larger, indicating that the company lacks verifiable, multi-node consistent storage for its self-reported indicators in these two dimensions, suggesting potential misrepresentation. According to the data credibility confidence factor mapping formula, with a steepness coefficient of 10 and a residual threshold of 0.3, the calculated data credibility confidence factors for the five dimensions are approximately 0.90, 0.16, 0.29, 0.92, and 0.88, respectively. Based on this, the credibility weighted values of the self-reported indicators for the five dimensions are calculated, resulting in credibility-modulated composite values of approximately 0.74, 0.15, 0.26, 0.64, and 0.57, respectively. It is evident that the data evidence storage dimension and data circulation dimension, which have large residuals in evidence consistency, show a significant decrease in their values after modulation, automatically weakening the inflated indicators. Credibility coupling dynamic combination weighting is performed on the credibility modulation indicator matrix, with a convergence threshold of 1×10⁻⁶.-3 After several fixed-point iterations, the weight vector converges. Since the global credibility is low at this point, the combination coefficients are large, and the convex combination relies more on subjective priors, avoiding the abnormal amplification of objective entropy weights by the injected dimensions due to changes in dispersion after modulation. After iterative convergence, the overall maturity quantification score of this express logistics data space is calculated using the overall maturity quantification score formula, resulting in a score of 68.2, corresponding to the development level. However, if the credibility modulation of this invention is not used and the self-reported indicators are directly weighted, the overall maturity quantification score reaches 86.5, corresponding to the mature level, a difference of 18.3 points. This difference demonstrates that this invention can effectively suppress the artificially high pull of injected indicators on the maturity quantification score. In the weight convergence trajectory analysis, the data evidence dimension has the largest weakness index and is identified as a weak link. Based on this, the maturity assessment report provides improvement suggestions for strengthening the data evidence mechanism. After archiving the logistics data space maturity dynamic archive for multiple consecutive evaluation cycles, the causal constraint coefficient of the data storage dimension on the data calculation dimension in the next cycle is statistically obtained as 0.62. This indicates that the construction level of the storage dimension has a significant positive lag effect on the calculation dimension. Based on this, the scale of the data storage dimension in the analytic hierarchy process (AHP) judgment matrix is increased according to the prior update formula of the judgment matrix, so that the next evaluation cycle pays more attention to the construction of the storage dimension, forming a closed-loop improvement between evaluation cycles.
[0040] In summary, this invention constitutes a deeply coupled closed-loop collaborative process through steps S1 to S6: the evidence consistency residual output in step S2 serves as the input to the data credibility confidence factor in step S4; the credibility modulation index matrix output in step S4 serves as the input to the credibility coupling dynamic combination weighting in step S5; the overall maturity quantification score output in step S5 serves as the input to the maturity assessment report generated in step S6; and the logistics data spatial maturity dynamic archive formed in step S6 updates the prior judgment matrix based on step S5 in reverse, thereby upgrading the assessment from a weighted aggregation of self-reported indicators to a credible aggregation based on verifiable on-chain evidence. Those skilled in the art should understand that the above description is merely a preferred embodiment of the present invention, and any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.
Claims
1. A method for measuring the maturity of trusted logistics data space based on blockchain and privacy computing, characterized in that, include: A multi-level evaluation index system is constructed based on data space standards. The multi-level evaluation index system covers five dimensions: data access, data storage, data circulation, data computing, and data application. Self-reported index data of the five dimensions are collected. The on-chain rate of logistics data, the immutability of on-chain data and the cross-chain interoperability of the logistics trusted data space are measured by the blockchain node query interface. The return results of multiple blockchain nodes for the same evidence record are compared and the evidence consistency residual is output. The privacy computing performance metrics of the federated learning, multi-party secure computation, and trusted execution environment deployed in the trusted logistics data space are measured on a standard test dataset, and the privacy computing performance metrics are used as the index values of the data computation dimension. The evidence consistency residual is transformed into a data credibility confidence factor, and the self-reported index data of the five dimensions are weighted by the data credibility confidence factor to obtain a credibility modulation index matrix. Based on the credibility modulation index matrix, the credibility is dynamically combined and weighted using the subjective weight of the analytic hierarchy process and the objective weight of the entropy weight method. The indicators of the five dimensions are weighted and summarized to output the overall maturity quantification score. Based on the overall maturity quantification score, a maturity assessment report containing a diagnosis of weaknesses and improvement suggestions is generated. The step of converting the evidence consistency residual into a data credibility confidence factor includes: mapping the consistent portion of the evidence consistency residual returned by multiple blockchain nodes for the same evidence record to high credibility and the inconsistent portion to low credibility, thereby obtaining the data credibility confidence factor; in the credibility weighting, the smaller the dimension of the data credibility confidence factor, the smaller the value of its self-reported index data in the credibility modulation index matrix; The credibility coupling dynamic combination weighting includes: iteratively recalculating the objective weights of the entropy weight method with the credibility modulation index matrix as input, and performing a convex combination on the recalculated objective weights of the entropy weight method with the subjective weights of the analytic hierarchy process as priors, wherein the combination coefficients of the convex combination are adjusted with the data credibility confidence factor, and fixed-point iteration is performed until the difference between the weight vectors of two adjacent iterations is less than a preset convergence threshold. The logistics data on-chain rate is the ratio of the number of data entries confirmed to be on-chain by the blockchain node query interface within a preset statistical period to the number of data entries that should be on-chain; the cross-chain interoperability capability is determined based on the successful response rate of cross-chain query requests.
2. The method according to claim 1, characterized in that, The trusted logistics data space is an express logistics data space, a cold chain logistics data space, a bulk logistics data space, or a cross-border logistics data space. In view of the differences in block production rhythm and evidence storage granularity of the heterogeneous blockchains deployed in each trusted logistics data space, the heterogeneous blockchains are aligned according to a unified time benchmark and the evidence storage granularity is normalized before the evidence storage consistency residual is calculated. The evidence storage granularity deviation detected in the evidence storage granularity normalization is used as an early characteristic of the corresponding logistics trusted data space construction stage.
3. The method according to claim 1, characterized in that, Also includes: Record the convergence trajectory of the weight vectors of each logistics trusted data space in the fixed point iteration, identify the dimension with the slowest convergence or the largest offset in the convergence trajectory of the weight vectors as the weak link of the corresponding logistics trusted data space, and generate the weak link diagnosis accordingly.
4. The method according to claim 3, characterized in that, Also includes: The overall maturity quantification score and the weak link diagnosis are archived in chronological order to form a dynamic archive of logistics data spatial maturity. Based on the dynamic archive of the spatial maturity of logistics data, the causal constraint relationship between the data storage dimension and the data calculation dimension is statistically analyzed, and the prior judgment matrix on which the subjective weight of the analytic hierarchy process is based is updated with the causal constraint relationship, so that the subjective weight of the analytic hierarchy process in the next evaluation cycle is constrained by the causal constraint relationship.
5. The method according to claim 2, characterized in that, For the express logistics data space, the cold chain logistics data space, the bulk logistics data space, and the cross-border logistics data space, differentiated prior judgment matrices based on the subjective weights of the analytic hierarchy process are configured in the credibility coupling dynamic combination weighting.
6. The method according to claim 1, characterized in that, The privacy computing performance metrics of the federated learning include communication rounds and model convergence accuracy; the privacy computing performance metrics of the multi-party secure computation include computational overhead; and the privacy computing performance metrics of the trusted execution environment include secure computation throughput.
7. The method according to claim 1, characterized in that, The grading based on the overall maturity metric score includes dividing the overall maturity metric score into multiple maturity levels according to a preset grading threshold; the maturity assessment report is used for logistics industry supervision and enterprise data space construction planning.
Citation Information
Patent Citations
User value scoring system thereof based on analytic hierarchy process and entropy method and method
CN106204154A
Intelligent manufacturing quality data tracing method, system and device based on block chain and storage medium
CN118863674A
Data processing systems for measuring privacy maturity within an organization
US20190220623A1
Ecological assessment method and system based on analytic hierarchy process and entropy weight method
CN121503877A
Evaluation method for enterprise intelligent maturity, intelligent evaluation system and electronic equipment
CN122335046A
