A global host-guest wisdom and trust coding assembly, method and system based on everything isomorphic
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- SHENZHEN ZHIXIN ANGEL TECHNOLOGY CO LTD
- Filing Date
- 2026-05-23
- Publication Date
- 2026-08-07
AI Technical Summary
1、缺乏全域统一编码标准,客体编码异构,数据孤岛严重,无法适配全域主客体标准化管控需求;
1、万物同构,适配全域管控需求:实现全域主客体统一编码,消除数据孤岛,与上层根载体标准化管控逻辑高度契合,支撑全域主客体统一建模与管控;
Smart Images

Figure CN122533703A_ABST
Abstract
Description
Technical Field
[0001] This invention belongs to the fields of global data standardization, blockchain underlying data structure, distributed parallel sharding and hardware-level data processing technology. Specifically, it relates to a global subject-object intelligent information coding component, method and system based on the isomorphism of all things, which is used to provide unified underlying data identification support for the upper root carrier management system. Background Technology
[0002] With the large-scale implementation of the digital economy, trusted data spaces, and consortium blockchains, the total number of users across all domains is growing by tens of billions. Existing coding technologies suffer from the following technical shortcomings: 1. Lack of a unified coding standard across the entire domain, heterogeneous object coding, serious data silos, and inability to adapt to the standardized management and control requirements of the entire domain's subjects and objects; 2. It cannot natively adapt to the parallel sharding routing mechanism, and the problems of sharding skew and load imbalance are difficult to eradicate, affecting the efficiency of batch calculation of massive subjects and objects and cross-domain transfer. 3. Relying on hashing or plaintext parsing results in high computational cost and low query efficiency, failing to meet the real-time addressing requirements in high-concurrency processing scenarios. 4. Extensions require modification of the core code, making incremental adaptation impossible and causing a disconnect from the needs of managing multiple scenarios and types of subjects and objects; 5. Lacking hardware-level bitwise computing capabilities, it cannot support nanosecond-level processing and is difficult to adapt to the real-time requirements of distributed transactions and batch accounting. 6. Using plaintext or weakly encoded storage does not comply with privacy protection requirements and is inconsistent with compliant evidence storage and data security management requirements; 7. It is disconnected from upper-level technology systems such as blockchain, distributed transactions, and trusted data spaces, making it impossible to achieve end-to-end collaboration; 8. The underlying coding technology has weak barriers, is easily circumvented, and is difficult to form a systematic technical protection.
[0003] This invention systematically solves the above-mentioned technical defects by using fixed-layer intelligent information coding based on the isomorphism of all things and native bit operations of CPU. It provides a unique underlying data foundation for functions such as parallel sharding, dynamic scheduling, and hybrid consensus in the upper-layer root carrier management system, and realizes full-link technical collaboration.
[0004] 1. Intelligent Encoding: The core encoding of this invention is the bottom-level identifier of the upper-level root carrier control system. It adopts a fixed hierarchical structure and includes at least a classification bit, a body bit, a same-value differentiation bit, and a check bit. After conversion, it forms a globally unique identifier with constant-level ultra-fast traceability and nanosecond-level addressing capabilities. 2. Universal Isomorphism: Adapts to unified coding rules for heterogeneous subjects and objects across the entire domain, realizes standardized coding for different types of subjects and objects, and supports unified management and control of subjects and objects across the entire domain; 3. Classification bit: The core field of the intelligent information coding. Its value range has a one-to-one mapping relationship with the parallel shard number. It also carries dynamic scheduling attribute tags and permission control information to support shard routing and scheduling. 4. Subject Part: As-needed allocation, carrying object business data, adapting to the business attributes of different types of objects, achieving extreme compression, and eliminating redundant storage; 5. Same Value Differentiation: Supports unique differentiation of massive amounts of objects with the same value, adapting to batch accounting and parallel management scenarios; 6. CPU native bitwise operations: The shard index is directly calculated through bitwise operation instructions, achieving nanosecond-level addressing and supporting high-concurrency processing requirements. Summary of the Invention
[0005] I. Purpose of the Invention This invention aims to construct a globally unique, homogeneous, hardware-level, zero-skew, scalable, and highly compliant intelligent information coding system as the core underlying support for the upper-layer root carrier management system; to achieve direct mapping of classification bits to parallel sharding indexes, support zero-skew routing and dynamic scheduling, and adapt to high concurrency and batch processing requirements; and to provide unique data identification support for the upper-layer technology system, enabling deep collaboration across the entire link.
[0006] Technical solution The overall technical solution of this invention is as follows: object adaptation configuration → layered encoding → CPU bitwise operation to generate fragment index → intelligent information encoding generation → encoding and decoding and batch processing → linkage with related upper-layer functional modules.
[0007] 1. The intelligent information encoding adopts a fixed hierarchical binary structure, including classification bits, body bits, same-value distinguishing bits, and check bits. After base conversion, it forms a globally unique identifier, which is completely consistent with the encoding format of the upper-level root carrier. 1. Classification bit: The value range is mapped one-to-one with the parallel shard number, and dynamic scheduling attributes and permission control information are marked at the same time to support shard routing and collaborative and isolated scheduling; 2. Body location: allocated on demand, carrying the business data of the object, adapting to the business needs of different types of objects, achieving extreme compression, and eliminating redundant storage; 3. Same-value differentiation: Supports differentiation of massive amounts of objects with the same value, adapting to batch accounting and parallel management scenarios; 4. Check bit: Used for code verification to ensure the uniqueness and integrity of the code, and to support the code binding and rights verification logic.
[0008] 2. Encoding Components The encoding component includes the following three functional modules: 1. Atomic operation module: Performs native CPU bitwise operations, number system conversion, and parallel slicing index mapping to achieve nanosecond-level constant-level addressing and connect to the upper-layer encoding and parsing logic; 2. Object Adaptation Module: Configures a universal isomorphic subject-object library, covering various types of subjects and objects, supporting incremental configuration and zero-code extension, and adapting to subject-object management needs in multiple scenarios; 3. Global Identifier Module: Responsible for encoding generation, parsing, and global uniqueness management. It connects to the encoding binding engine of the upper root carrier to achieve unique binding between the encoding and the subject and object.
[0009] 3. Encoding Method 1. Object Adaptation Configuration: Load the isomorphic rules of all things through the object adaptation module to match the control requirements of the corresponding type of subject and object; 2. Obtain plaintext data of subjects and objects: Collect core data such as the classification, ontology, and serial number of subjects and objects; 3. Layered binary encoding: The binary code is constructed by concatenating the data into a classification bit, a body bit, a bit to distinguish the same value, and a check bit, forming a complete binary code string. 4. Bitwise operations generate sharded indexes: Generate indexes corresponding to parallel shards through native CPU bitwise operations; 5. Convert to a globally unique identifier and store it: After encoding is completed, synchronize it to the encoding binding field of the upper root carrier to support rights confirmation and fragment scheduling.
[0010] 4. Decoding Method 1. Obtain the encoded string: Read the globally unique identifier from the upper-level root carrier; 2. Restore the binary string: Convert it to a binary string, separate the core encoding and check bits, and complete the encoding verification; 3. Segmentation and splitting: Segment into category position, body position, and same value distinction position according to a fixed structure; 4. Restore plaintext data and shard index: Restore object plaintext data, parse shard index and scheduling attributes to support upper-layer shard routing and management.
[0011] 5. Batch processing method It supports batch encoding and decoding parallel execution, constant-level bitwise operation retrieval, single-item exception isolation, and batch accounting of millions of items. It is fully compatible with parallel sharding batch management logic and supports scenarios such as batch accounting of full-domain assets and batch registration of massive subjects and objects.
[0012] 6. Global Data Processing System It includes encoding components, a sharding mapping library, a blockchain interface, a trusted data space interface, and an auditing module, enabling full-link collaboration with the upper-layer technology system. Beneficial effects
[0013] Compared with the prior art, the present invention has the following beneficial effects: 1. Isomorphic structure for all things, adapting to the needs of full-domain management and control: realizes unified coding of all subjects and objects in the whole domain, eliminates data silos, and is highly consistent with the standardized management and control logic of the upper root carrier, supporting unified modeling and management of subjects and objects in the whole domain; 2. Native sharding adaptation for efficient scheduling: Category positions are directly mapped to parallel sharding indexes, with zero sharding skew, adapting to parallel sharding routing and dynamic scheduling requirements, and improving the efficiency of cross-domain transfer and batch processing; 3. Hardware-level performance to meet real-time requirements: CPU native bitwise operations enable constant-level addressing, significantly reducing computing power overhead, and nanosecond-level processing capability supports the real-time requirements of distributed transactions and high-concurrency flow. 4. Simplified and adaptable to multiple scenarios: The kernel is fixed, and adding new object types only requires configuration with zero code modification, which can quickly adapt to the object management needs of multiple scenarios such as government affairs, rural revitalization, and enterprise operation; 5. Compliant and secure, meeting data security requirements: Anonymous encoding is used to meet data security regulations and compliance requirements, and is consistent with the upper-level risk control and evidence storage and data security management logic; 6. Underlying technological barriers support the entire stack system: As a foundational patent, the technical solution is unavoidable and irreplaceable, providing unique underlying data support for the upper-level technology system; 7. Full-system collaboration, filling technical gaps: It achieves full-link collaboration with the upper-layer root carrier, parallel sharding, hybrid consensus, distributed transactions, and trusted data space access, solving the technical problem of insufficient collaboration between existing coding and upper-layer management systems. Attached Figure Description
[0014] Figure 1 Here is a block diagram of the intelligent information coding component structure; Figure 2 Flowchart for encoding generation and fragment mapping; Figure 3 This is a flowchart for decoding and object data restoration.
[0015] 10 - Atomic operation module; 20 - Object adaptation module; 30 - Global identification module; 40 - Classification unit; 50 - Subject unit; 60 - Differentiation unit; 70 - Slice index mapping unit; 80 - Data storage unit. Detailed Implementation
[0016] The present invention will be further described in detail below with reference to specific embodiments.
[0017] 1. Configuration: In accordance with the requirements for the management of natural persons, configure the classification bit, the subject bit, the distinguishing bit, and the check bit to form a complete binary code; 2. Plaintext data: Collect the attribute data of natural persons and keep it consistent with the data in the upper-level root carrier's rights confirmation field module; 3. Encoding: Generate a binary encoded string, convert it to a base to form a globally unique identifier, and synchronize it to the encoding binding field of the upper-level root carrier; 4. Shard Mapping: Shard indexes are generated through native CPU bitwise operations and mapped to target parallel shards to support upper-layer shard scheduling; 5. Decoding: Restore the binary string and split each field, restore the identity data and shard index, and synchronize it to the upper-level rights confirmation field module.
[0018] Multiple asset data are batch-integrated into the coding system to match the isomorphic rules of all things; codes are generated in batches according to asset accounting requirements, and the classification bits are automatically mapped to parallel shards to achieve load balancing; constant-level bitwise operations are performed in batches for querying and exception isolation to ensure batch processing efficiency; the coding results are synchronized to the upper-level root carrier coding binding field, and simultaneously written to the compliance evidence storage field module through the blockchain interface to complete on-chain evidence storage.
[0019] The data capsule, in accordance with the requirements for trusted data space management, loads the isomorphic coding rules of everything and completes the coding configuration; it classifies, marks, segments, indexes, and schedules attributes to support dynamic collaborative scheduling; it generates a globally unique identifier and stores it on the blockchain through the blockchain interface; the coding results are synchronized to the upper-level root carrier to support cross-domain circulation and full-link traceability of trusted data space.
Claims
1. A global subject-object intelligent information coding component based on the isomorphism of all things, characterized in that, The intelligent information code is the underlying identifier of the upper-level root carrier control system, and the components include: The atomic operation module is used to perform CPU native bitwise operations, number system conversions, and parallel sharding index mapping. The object adaptation module configures a universal isomorphic subject-object library, covering various types of objects, and supports incremental configuration and zero-code extension. The global identifier module is used to generate and parse the globally unique intelligent information code, and connect to the encoding binding engine of the upper root carrier; The component adopts a fixed hierarchical coding structure, which includes at least a classification bit, a body bit, a same-value distinguishing bit, and a check bit, and is completely consistent with the coding format of the upper root carrier. The classification bit is used to directly map the parallel sharding index to achieve zero-skew sharding routing, while marking dynamic scheduling attributes and permission control information.
2. The component according to claim 1, characterized in that, The capacity of the classification bit corresponds to the number of parallel shards and is used for shard mapping, scheduling attribute marking, and permission control; the same value differentiation bit is used to distinguish objects with the same ontology value, adapting to the scenario of batch accounting of massive subject and object; the ontology bit is allocated on demand and stored without redundancy, carrying business data of different types of objects.
3. The component according to claim 1, characterized in that, The atomic operation module uses native CPU bitwise operation instructions to calculate the shard index, achieving nanosecond-level constant-level addressing, and adapting to high concurrency and real-time management requirements.
4. A global subject-object intelligent information coding method based on the components described in any one of claims 1-3, characterized in that, Includes the following steps:
1. Object Adaptation Configuration: Load the isomorphic rules of all things through the object adaptation module to match the control requirements of the corresponding type of object; 2. Obtain plaintext data of the object: including classification value, ontology value, and same-value distinguishing sequence number, which is consistent with the data in the upper-level root carrier rights confirmation field module; 3. Layered binary encoding: Concatenate the data into a classification bit, a body bit, a same-value distinguishing bit, and a check bit to form a complete binary encoded string; 4. Bitwise operations generate parallel sharded indexes; 5. Convert to a globally unique intelligent information code, complete the code storage, and synchronize it to the code binding field of the upper-level root carrier.
5. A global subject-object atomic decoding method based on the component described in any one of claims 1-3, characterized in that, Includes the following steps:
1. Obtain the intelligent information code: Read the globally unique intelligent information code from the upper-level root carrier; 2. Restore the binary string: Convert it to a binary string, separate the core encoding and check bits, and complete the encoding verification; 3. Based on a fixed structure, separate the classification position, the body position, and the same value differentiation position; 4. Restore the plaintext data of the object and the parallel sharding index, and synchronize them to the relevant field modules of the upper root carrier.
6. The method according to claim 5, characterized in that, The decoding process synchronously parses the shard index and scheduling attributes for parallel shard routing, isolation, and collaborative management, supporting cross-domain transfer and high-risk management scenarios.
7. A method for batch processing of subjects and objects across the entire domain based on the components described in any one of claims 1-3, characterized in that: It performs batch encoding and decoding in parallel; it achieves constant-level batch retrieval through bitwise operations; it isolates individual data anomalies independently, without affecting global batch tasks; it is adapted to batch accounting and parallel sharding processing at the million-level, supporting massive subject-object management scenarios.
8. A global subject-object data processing system, characterized in that, The system includes: The intelligent information coding component according to any one of claims 1-3; Parallel sharded mapping database; Blockchain-based evidence storage interface; Trusted data space interface; Audit and traceability module; The system executes the method described in any one of claims 4-7 to achieve full-link collaboration with the upper-level root carrier control system.
9. A computer-readable storage medium for storing a computer program, characterized in that, When the program is executed by the processor, it implements the method described in any one of claims 4-7.
10. An electronic device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the program, it implements the method described in any one of claims 4-7.