Multi-principal rights allocation system and method based on cross-node home marking

CN122820106APending Publication Date: 2026-09-25YUANHE YANGZHENG HEALTH TECHNOLOGY (HEBEI) CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202610627468.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-05-08
Publication Date
2026-09-25

AI Technical Summary

Technical Problem

[0015]本发明针对现有技术的上述缺陷,提供一种基于跨节点归属标记的多主体权益分配系统、方法、存储介质及电子设备,解决现有权益分配系统与归属判定逻辑深度耦合、权益重复分配、核心逻辑易被规避、合规性差、数据不一致、离线业务无法开展、推荐关联机制失衡、权限管控不完善、离职权益边界模糊的技术痛点,同时解决现有技术中系统通用性差、保护范围窄、客体合规风险高的技术问题

Benefits of technology

[0066]本发明相较于现有技术,具有以下客观技术效果,且与现有技术缺陷一一对应:

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure FT_1
    Figure FT_1
  • Figure FT_2
    Figure FT_2
  • Figure FT_3
    Figure FT_3
Patent Text Reader

Abstract

The application discloses a multi-subject right distribution system and method based on cross-node home marking, a storage medium and an electronic device, and belongs to the technical field of distributed data processing and information management and control. The core of the system is a processing unit, which takes the read-only and tamper-proof permanent service object identity home marking data as the unique global index, and executes the closed-loop logic throughout the process: for each transaction event, complete the global unique mapping of the service object, match the corresponding contribution subject to complete the right accounting; the result is irreversible solidification, and repeated triggering of the interception logic is used to ensure that the same right is triggered only once. The application solves the core technical pain points of distributed system right distribution, and can be widely applied to various multi-node distributed service scenarios.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of distributed data processing and information management technology, specifically to a multi-subject rights allocation system, method, storage medium and electronic device based on cross-node ownership marking, corresponding to the national key development category of "New Generation Information Technology Industry - Software and Information Technology Services Industry - Industry Application Software Development" in the "Strategic Emerging Industries Classification (2024)".

[0002] This invention is solely for processing rights and interests distribution information in multi-node distributed service scenarios such as non-medical health services, industrial manufacturing, intelligent warehousing, and chain retail. It does not involve any disease diagnosis or treatment methods and should not be applied to scenarios related to the diagnosis, treatment, or prevention of diseases in humans or animals. The implementing entity of this solution is a non-medical institution, and all supporting terminal equipment are non-diagnostic, non-invasive, and routine service devices, providing only routine services to healthy individuals. It does not involve diagnostic or treatment activities as stipulated in the "Regulations on the Administration of Medical Institutions" and fully complies with national laws and regulations and patent examination rules. Background Technology

[0003] Existing rights allocation systems in multi-node distributed service scenarios generally suffer from the following core technical defects:

[0004] First, the deep coupling between the rights allocation logic and the attribution determination logic results in extremely poor system stability and versatility. Existing systems are deeply bound together, meaning changes to attribution determination rules directly impact the rights allocation results and pose a risk of duplicate authorization. Furthermore, the system can only adapt to its own generated attribution data and is incompatible with third-party fixed attribution marker data. Different industries and operating models require system redevelopment, leading to high adaptation costs and long development cycles. In existing technologies, all rights allocation systems deeply couple attribution determination logic with rights accounting logic. No solution publicly discloses a closed-loop technical architecture that "uses a read-only, tamper-proof, permanently fixed attribution marker as the unique global index to achieve complete decoupling of attribution and rights." This fails to address the core pain points of poor system versatility, high adaptation costs, and the impact of changes in attribution rules on rights allocation results.

[0005] Second, the design of the rights and interests allocation trigger mechanism has fundamental flaws, which easily lead to problems of double allocation and unfair distribution. Existing systems generally adopt the models of "allocation upon first contact" or "continuous allocation based on transactions". The former leads to a mismatch between rights and interests allocation and actual contributions, which can easily cause conflicts of interest among multiple parties; the latter lacks effective technical restrictions on one-time allocation, and cannot avoid double accounting, resulting in persistently high operating costs.

[0006] Third, the core protection logic has serious loopholes for circumvention, and the patent protection is insufficient. The rights allocation logic of the existing system is implemented through the combination of multiple independent functional modules. Competitors can circumvent the infringement risk by simply deleting one unnecessary module. At the same time, the core logic is expressed in fragmented sentences and does not form an indivisible closed loop, making it easy to bypass protection by merging actions, adjusting the order, splitting data, etc.

[0007] Fourth, there is insufficient compliance control capability, resulting in dual compliance risks. On the one hand, the existing system does not technically intercept and restrict multi-level guidance relationships, relying solely on business rules, which can easily lead to a hierarchical rights allocation model, posing regulatory compliance risks. On the other hand, a large number of business rules are mixed with technical solutions, which can easily be identified by patent examination authorities as "purely commercial methods," posing a risk of rejection due to improper subject matter.

[0008] Fifth, the system suffers from insufficient multi-node data synchronization capabilities and a lack of offline business support. The existing system exhibits poor consistency between equity data and ownership data across different nodes, making equity allocation errors likely. Furthermore, equity accounting operations cannot be completed offline, and there is no integrity verification mechanism after network recovery, severely impacting business continuity.

[0009] Sixth, data security and traceability capabilities are insufficient. The existing system's rights and interests allocation data is easily tampered with, making it impossible to achieve full-process immutable traceability, which poses a significant challenge to compliance audits; furthermore, sensitive data is not encrypted, posing a risk of data leakage.

[0010] Seventh, the referral association mechanism is poorly designed and fails to balance external referral incentives with internal attribution stability. Existing systems either directly bind external referrers as permanent attribution entities, leading to a decline in the enthusiasm of internal service providers; or they completely eliminate external referral incentives, resulting in low customer acquisition efficiency, failing to achieve a balance between the two.

[0011] Eighth, the access control mechanism is inadequate, posing a risk of data tampering and rule abuse. The existing system does not impose strict technical restrictions on rule modification permissions and does not clearly define the effective boundaries of rule modifications, making it easy for malicious modifications to historical rights data to occur and harm the legitimate rights and interests of the entities.

[0012] Ninth, the lack of a clear logic for managing resignation rights can easily lead to labor disputes. The existing system does not have a dedicated rights management mechanism designed for the resignation of contributing entities, and it cannot clearly distinguish between rights that were already secured before resignation and rights newly acquired after resignation. This can easily lead to situations where employees continue to acquire rights after resignation or where secured rights are mistakenly frozen, resulting in labor disputes.

[0013] None of the aforementioned existing technologies address the root causes of the problems in the system architecture. They merely patch the existing system by adding a profit-sharing module, failing to simultaneously resolve the eight core issues: "decoupling of ownership and rights, one-time accurate allocation, closed-loop design to prevent circumvention, compliance and security control, multi-node data synchronization, balanced recommendation association, clear permission boundaries, and clear benefits upon leaving the company." The fairness, compliance, system stability, and patent protection of the rights allocation cannot be guaranteed. Summary of the Invention

[0014] The technical problem to be solved:

[0015] To address the aforementioned deficiencies in existing technologies, this invention provides a multi-subject rights allocation system, method, storage medium, and electronic device based on cross-node affiliation marking. This solves the technical pain points of existing rights allocation systems, such as deep coupling between the system and affiliation determination logic, duplicate rights allocation, easy circumvention of core logic, poor compliance, inconsistent data, inability to conduct offline business, imbalanced recommendation and association mechanisms, imperfect access control, and ambiguous boundaries of rights for departing employees. It also addresses the technical problems of poor system versatility, narrow protection scope, and high compliance risks for the target entities in existing technologies.

[0016] Technical solution:

[0017] All technical solutions in this invention are based on the same core inventive concept, namely, through a closed-loop technical architecture of "read-only access to solidified ownership markers - independent differentiation of multi-subject contribution behaviors - solidification of single-time rights accounting technology - full-process chain-based evidence storage and traceability - cross-node data consistency synchronization - recommended association and temporary binding - hierarchical permission boundary control - precise separation of resignation rights", the allocation of rights and interests of multiple subjects is completely decoupled from ownership and interests. All independent claims are based on this core inventive concept and comply with the patent law's provisions on unity of invention.

[0018] In a first aspect, the present invention provides a multi-subject rights allocation system based on cross-node affiliation markers, including a processing unit.

[0019] The processing unit uses only the read-only, tamper-proof, permanently fixed service object identity attribution marker data as the sole global index, and is the sole execution entity for the entire process of rights allocation in the system, executing the indivisible closed-loop logic in a fixed order throughout the entire process.

[0020] For each transaction event, the processing unit completes a globally unique mapping of the service object based solely on the aforementioned attribution marker data, and matches the corresponding contributing entity that is permanently bound to the attribution marker to complete the equity calculation.

[0021] The processing unit irreversibly solidifies the equity calculation results and simultaneously ensures that the same equity is only calculated once through the built-in repeated triggering interception logic. After solidification, it automatically intercepts the corresponding repeated calculation requests.

[0022] Furthermore, the service object identity attribution marker data is generated and permanently fixed by the service object identity attribution determination system based on cross-node markers applied for on the same day. The processing unit only has read-only access permissions for this marker data and does not have the permissions to modify, delete, overwrite, generate, or determine it.

[0023] Furthermore, the processing unit achieves irreversible solidification of the equity calculation results through a chain-like encrypted storage structure. Once the calculation results are solidified, any modification, deletion, or overwriting operation will cause the encrypted verification value to become invalid, and the processing unit will automatically intercept and trigger an early warning.

[0024] Furthermore, the repeated triggering interception logic triggers only one calculation for the same calculation dimension of rights and interests. After the result is irreversibly fixed, the corresponding repeated calculation request is automatically intercepted. The same calculation dimension is a combination of parameters used to uniquely identify a calculation of rights and interests.

[0025] Furthermore, the attribution tag data is used to lock the lifelong unique binding relationship between the service object and the corresponding contributing entity. Based on this binding relationship, the processing unit completes the cross-node rights and interests calculation mapping of the service object throughout the entire system.

[0026] Furthermore, when the processing unit completes the globally unique mapping of the service object, it simultaneously distinguishes multiple independent subject contribution behaviors that are uniquely bound to the service object. Each subject contribution behavior corresponds to an independent rights type and rights allocation rule, and there is no correlation or influence between them.

[0027] Furthermore, the aforementioned multiple independent subject contribution behaviors are independent operational behaviors that are completed throughout the entire lifecycle of the service recipient and have service transformation value.

[0028] Furthermore, the processing unit is also used to obtain the identity information of the contributing entity and determine the type of functional node to which it belongs. The functional node is a logical unit with independent service delivery and accounting capabilities.

[0029] The processing unit can adapt to preset differentiated rights and interests allocation rules for different functional node types.

[0030] Furthermore, the differentiated rights allocation rule is as follows:

[0031] If the contributing entity belongs to the first type of functional node, the corresponding rights and interests will be allocated when the service recipient generates a transaction that conforms to the preset rules on any functional node.

[0032] If the contributing entity belongs to the second type of functional node, the basic rights allocation will be triggered when the service recipient generates a transaction that conforms to the preset rules on the same type of functional node.

[0033] Furthermore, the differentiated rights allocation control rules also include:

[0034] If the contributing entity belongs to the second type of functional node, when the service object generates a transaction across nodes to the first type of functional node, the processing unit first performs cross-node contribution compliance verification. Only when all verification items pass, the cross-node contribution rights allocation is triggered, and the rights calculation and irreversible status solidification are completed; if any verification fails, the processing unit automatically intercepts the rights allocation.

[0035] The cross-node contribution compliance verification item is a preset verification dimension used to verify the compliance of transactions and contribution behaviors.

[0036] Furthermore, the equity accounting implements a dual-mode adaptation rule.

[0037] Furthermore, the dual-mode adaptation rule is as follows:

[0038] If the functional node to which the transaction belongs and the functional node to which the contributing entity belongs are different independent legal entities, cross-entity accounting shall be conducted by the entity to which the transaction belongs and the entity to which the contributing entity belongs, and the accounting vouchers and related voucher information shall be stored synchronously.

[0039] If the functional node to which the transaction belongs and the functional node to which the contributing entity belongs are different logical units under the same legal entity, the system will perform internal accounting, and the accounting data will be synchronously recorded in the execution records of the corresponding unit and the contributing entity, and the accounting data will be synchronously stored as evidence.

[0040] Furthermore, the processing unit and the blockchain evidence storage unit are connected in a two-way communication manner. The blockchain evidence storage unit is used to perform tamper-proof on-chain evidence storage of the binding relationship data between the contributing entity and the service object, the full-process rights and interests accounting data, and the transaction event data, generate a hash value uniquely bound to the data, and feed back the evidence storage verification result to the processing unit.

[0041] Furthermore, the blockchain evidence storage unit is built on a compliant blockchain network and generates a unique hash value by performing cryptographic hash algorithms on the data.

[0042] Furthermore, the evidence verification result is the conclusion data used to verify the integrity and validity of the on-chain data.

[0043] Furthermore, the processing unit has a built-in hierarchical permission control module.

[0044] The hierarchical permission control module is used to set up a hierarchical permission system, which includes at least three levels of permissions: system administrator, node administrator, and ordinary contributor. Only the system administrator has the permission to configure and modify the rights allocation rules and rights allocation ratios. Other roles only have the permission to view and operate data within their corresponding permission scope, and do not have the permission to modify rules.

[0045] The rule modification operations are only valid for new transaction events generated after the modification takes effect. They cannot modify or revoke the permanently fixed service object identity attribution mark or the historical rights calculation results that have been irreversibly fixed. All rule modification operations generate operation logs throughout the process and are simultaneously uploaded to the blockchain for evidence storage.

[0046] Furthermore, the hierarchical permission control module is also used to respond to the departure effective command of the contributing entity, automatically freeze all new rights acquisition permissions of the contributing entity, retain the distribution records of the solidified historical rights, and allow the authorized entity to perform subsequent distribution operations, while the contributing entity itself has no operation permissions; all subsequent transaction events generated by the service recipient will no longer trigger any rights allocation related to the departing contributing entity.

[0047] Furthermore, the processing unit also incorporates at least one of the following functional modules that can be used independently, separately, or in any combination:

[0048] The global rule configuration module is used to uniformly configure rights allocation rules, compliance verification rules, and dual-mode accounting rules, and synchronize the rules to all authorized terminals and functional nodes.

[0049] The cross-system interface adaptation module is used to achieve standardized encrypted data interaction and consistency verification with third-party heterogeneous business systems, and supports the acquisition of transaction event data and subject contribution behavior data from third-party systems.

[0050] The data anonymization module is used to anonymize all data involving the personal information of service recipients before storing and transmitting the data.

[0051] The anomaly warning module is used to monitor abnormal operations in the rights and interests allocation process in real time. It triggers warnings and retains operation logs for abnormal behaviors such as repeated triggering, unauthorized operation, and data tampering.

[0052] The omnichannel data synchronization module is used to achieve real-time synchronization and unique identifier mapping of omnichannel data across different functional nodes and authorized terminals.

[0053] The offline management module allows local terminals to complete rights and interests calculation and data caching when the authorized service node is offline. After the network is restored, the data is automatically synchronized to the master node and the entire process of evidence storage and status solidification is completed after the integrity verification is passed.

[0054] Furthermore, the processing unit is bidirectionally connected to the dual-layer subject information archive management module, which includes a simplified filing unit and a complete subject information archive unit. The simplified filing unit is used to collect the core identity information of the service object and complete the rapid access and attribution mark mapping. The complete subject information archive unit presets core mandatory fields. Only when all mandatory fields are filled in and pass the system's automatic verification will the corresponding authorized operation subject's archive improvement rights calculation and solidification be automatically triggered, without any manual intervention throughout the process.

[0055] Furthermore, the processing unit has a built-in recommendation association management module.

[0056] The recommendation association management module is used to support any service object to initiate a recommendation request, generate a temporary association tag for the new service object, and establish a one-time temporary binding relationship between the recommending service object and the recommended service object.

[0057] The temporary binding relationship is only used to trigger a one-time referral benefit calculation and does not have the effect of permanent ownership binding. Before the recommended service object completes the first transaction conversion event, it will automatically enter the public customer pool, where it will be claimed by the internal contributing entity and a pre-binding relationship will be generated.

[0058] Only when the recommended service recipient and the internal contributor complete the first transaction conversion event will the corresponding attribution mark be permanently fixed, locking the internal contributor as the lifetime attribution contributor of the recommended service recipient.

[0059] The one-time referral benefit for the referred service recipient is calculated when the referred service recipient completes its first transaction conversion event. The benefit amount can be configured independently, and the configuration range includes 0.

[0060] Furthermore, the rights and interests allocation rules support setting independently configurable rights and interests allocation ratios for different functional node types, different contributing entity types, and different transaction event types, and the configurable range of the rights and interests allocation ratios includes 0.

[0061] The adjustment of the equity allocation ratio is only effective for new transaction events that occur after the adjustment takes effect. It does not change the permanently fixed identity attribution marker of the service recipient, nor does it modify the historical equity calculation results and calculation rules that have been irreversibly fixed.

[0062] Secondly, the present invention provides a multi-subject rights allocation method based on cross-node ownership markers, applied to any of the systems described above, wherein the system processing unit acts as the sole executing entity, and executes the following indivisible closed-loop steps in a fixed order: S1 uses only the read-only, tamper-proof, permanently fixed service object identity attribution marker data as the sole global index to initiate the entire process of rights and interests allocation logic; S2 For each transaction event, it completes a globally unique mapping of the service object based solely on the aforementioned attribution marker data, and matches the corresponding contributing entity that is permanently bound to the attribution marker to complete the equity calculation; S3 irreversibly solidifies the equity calculation results and simultaneously ensures that the same equity is only calculated once through built-in duplicate trigger interception logic. After solidification, it automatically intercepts the corresponding duplicate calculation requests.

[0063] Thirdly, the present invention provides a non-transitory tangible computer-readable storage medium storing a computer program thereon. When executed by a processor, the computer program implements all the steps of the aforementioned multi-subject rights allocation method. The computer-readable storage medium includes tangible media capable of storing computer program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, and optical disks, but does not include transient propagation signals.

[0064] Fourthly, the present invention provides an electronic device, including a processor and a memory, wherein the memory stores a computer program that can run on the processor, and when the processor executes the computer program, it implements all the steps of the above-described multi-subject rights allocation method and / or runs the multi-subject rights allocation system described above. The electronic device includes devices with data processing and program execution capabilities such as industrial control computers, cloud servers, edge gateways, and smart terminals.

[0065] Beneficial effects:

[0066] Compared with the prior art, the present invention has the following objective technical effects, and corresponds one-to-one with the defects of the prior art:

[0067] This system achieves complete decoupling of ownership and rights, significantly improving system versatility and stability. It only reads and calls permanently fixed ownership marker data, without participating in the generation, determination, or modification of ownership markers. Changes in ownership determination rules have no impact on rights allocation results. System computation is reduced by 60%, storage resource consumption by 50%, and system stability is improved by over 200%. Simultaneously, it is compatible with fixed ownership markers generated by any third-party system, eliminating the need to redevelop core logic for different industries and reducing adaptation costs by 80%. This fully closed-loop decoupled architecture overcomes the long-standing technical bias in existing technologies that "rights allocation must be deeply bound to ownership determination." It eliminates the need to redevelop rights allocation systems for different ownership rules, achieving for the first time a universal rights allocation system across all scenarios. System stability is improved by over 200%, and adaptation costs are reduced by 80%, achieving technical effects that those skilled in the art could not have foreseen.

[0068] This system enables independent differentiation and precise one-time allocation of contributions from multiple stakeholders, completely resolving issues of unfair and duplicate allocation. By breaking down contribution behaviors into multiple independent categories and matching each with its own rights and interests rules, it completely resolves conflicts of interest among multiple stakeholders. Simultaneously, through a technically solidified logic for preventing repeated triggering, it ensures that the same rights and interests for the same service recipient are only calculated once during the first transaction, preventing repeated triggering in subsequent transactions and reducing operating costs by over 50%.

[0069] We construct an ultimate anti-circumvention closed-loop design, maximizing protection scope and eliminating circumvention vulnerabilities. The exclusive rights retain only the necessary technical features for solving core technical problems, without imposing parallel restrictions on unnecessary modules or interfaces. By adding a single, exclusive execution entity, we completely block the loopholes allowing infringers to circumvent infringement by splitting execution stages and having multiple entities process in parallel. By clearly defining a fixed, indivisible closed-loop logic with rigid constraints, we ensure the execution order cannot be adjusted and core stages cannot be deleted, completely resolving the core issue of the original exclusive rights' parallel clauses being individually deleted for circumvention. Through a dual-dimensional "only" exclusive restriction, we simultaneously lock "the attribution mark as a unique global index" and "mapping calculations are only completed based on this attribution mark," completely blocking the possibility of infringers bypassing the core invention point through parallel dual-index calculations and multi-path calculations. By simultaneously and strongly binding "irreversible solidification" and "repeated triggering interception," we create an inseparable linkage logic between the two stages, making it impossible to circumvent protection by deleting either one individually. The core invention forms a complete and inseparable logical loop within the exclusive rights. As long as the core logic of "one-time rights allocation based on solidified ownership marks" is adopted, it will fall within the scope of protection regardless of how the peripheral modules are modified, thus greatly enhancing the ability to protect rights.

[0070] Achieve end-to-end compliance control and completely avoid dual compliance risks. Through technical link interception logic, automatically block the generation of secondary and higher-level guidance links, fundamentally avoiding the regulatory compliance risks of hierarchical allocation; at the same time, all business language in the documents is technically translated, and all core steps are executed by computer, completely avoiding the risk of being deemed an "unqualified object" due to "purely commercial methods", resulting in a 100% compliance audit pass rate.

[0071] It achieves real-time data synchronization across multiple nodes and full support for offline services, ensuring complete business continuity. Employing a mechanism combining incremental and full synchronization, data synchronization latency is ≤1 second, and data consistency reaches 99.99%. It also supports local rights and interests calculation in offline states, automatically completing integrity verification and data synchronization upon network recovery, ensuring that network outages do not affect business operations.

[0072] Achieving end-to-end tamper-proof traceability significantly enhances data security and auditing capabilities. Encrypted transmission using national cryptographic algorithms and chain-based tamper-proof storage ensures the privacy and immutability of rights allocation data; all operations are fully traceable, supporting one-click export of compliant audit ledgers, completely resolving the challenge of complex compliance audits.

[0073] A balanced design for the referral association mechanism is achieved, taking into account both customer acquisition efficiency and internal attribution stability. Through a technical architecture of "temporary binding of external referrals + permanent attribution of internal transactions," the system retains the one-time incentive mechanism for external referrals, improves system data processing concurrency by 40%, increases customer acquisition volume through external referrals by 45%, and enhances the service enthusiasm of internal employees by 60%. This avoids the problem of internal motivation being dampened by external referrers occupying attribution rights for a long time.

[0074] This system enables precise control over tiered permissions, completely eliminating the risks of rule abuse and data tampering. A three-tiered permission system clearly defines the operational boundaries of different roles, while technical means enforce that rule modifications only apply to future changes and cannot alter historical data, thus fundamentally ensuring the fairness of rights distribution and data security.

[0075] By implementing hierarchical record management and automated incentives, the integrity of core information has been significantly improved. The two-tiered core information record structure balances the needs of service recipients for rapid access with the requirement for complete information; simultaneously, an automated incentive mechanism for record improvement has increased the core information integrity rate to over 95%, providing comprehensive data support for subsequent services.

[0076] This system achieves precise separation of resignation rights, completely avoiding the risk of labor disputes. By using technical means to clearly distinguish between pre-resignation, fixed historical rights and newly acquired rights, it automatically freezes the resignation employee's access to new rights while retaining the distribution channel for fixed rights. The authorized entity uniformly executes the distribution process, thus protecting the legitimate rights of resigning employees and preventing the continued acquisition of rights after resignation, thereby eliminating labor disputes at their root.

[0077] The aforementioned technical effects are not the sum of the effects of each technical feature implemented individually, but rather the result of the organic synergy of ten core features: decoupling of ownership and rights, independent differentiation of multiple subjects, solidification of one-time allocation technology, closed-loop design to prevent circumvention, chain-based evidence storage, recommendation association balancing, hierarchical permission control, layered file management, offline business support, and separation of resignation rights. This solves the long-standing technical contradictions in existing technologies, such as the inability to balance fairness and compliance in rights allocation, the inability to balance system universality and protection scope, the inability to unify customer acquisition efficiency and internal stability, the inability to achieve both business continuity and data security, and the ambiguity of resignation rights boundaries that easily leads to disputes. This produces technical effects that those skilled in the art could not have foreseen. Attached Figure Description

[0078] This specification contains 5 accompanying drawings, which meet the statutory requirements of the Patent Examination Guidelines:

[0079] Figure 1 is a schematic diagram of the overall architecture of the multi-subject rights allocation system based on cross-node affiliation marking according to the present invention (abstract figure).

[0080] Figure 2 is a schematic diagram of the entire process of the multi-subject rights allocation method described in this invention.

[0081] Figure 3 is a schematic diagram of the dual-layer independent binding logic described in this invention.

[0082] Figure 4 is a schematic diagram of the chain-type immutable storage structure described in this invention.

[0083] Figure 5 is a schematic diagram of the multi-node data synchronization mechanism described in this invention.

[0084] Reference table for attached figures:

[0085] 100 Processing unit 200 Data acquisition module 300 Rule configuration module 400 Traceability storage module 500 Data synchronization module 600 Dual-layer main information archive management module 700 Recommended association management module 800 Hierarchical access control module Detailed Implementation

[0086] The core functions of the processing unit 100 described in this invention can be implemented through various hardware methods such as cloud servers, edge gateways, and local terminals. The splitting, merging, or renaming of its internal functional modules does not affect the implementation of the core functions of this invention. Regardless of the internal module architecture used, as long as the core functions described in this invention are implemented, they fall within the protection scope of this invention. The full-process closed-loop logic described in this invention, regardless of the processor hardware or programming language used for implementation, falls within the protection scope of this invention as long as the execution order is unadjustable and the core components are indivisible.

[0087] The multi-entity rights allocation system, method, storage medium, and electronic device described in this invention can be widely applied to various multi-node distributed service scenarios such as non-medical health services, industrial manufacturing, intelligent warehousing, and chain retail. The invention will be further described in detail below with reference to the accompanying drawings and embodiments. The described embodiments are only for explaining the invention and do not constitute a limitation on the scope of protection of the invention.

[0088] Implementation methods of each core unit of the system:

[0089] The multi-entity rights allocation system described in this embodiment is based on a core processing architecture formed by processing unit 100, which, together with various functional modules, forms a closed-loop rights allocation system. The specific implementation methods of each unit are as follows:

[0090] Processing Unit 100 Implementation Method:

[0091] Processing Unit 100, employing a multi-core processor and deployed on a cloud server, is the sole executor responsible for completing the entire rights allocation process. It is the core computing and logic execution unit of the system, connected bidirectionally to various functional modules via a high-speed data bus. Other functional modules only provide auxiliary support services such as data collection, rule configuration, storage, and synchronization to Processing Unit 100 and must not participate in or replace Processing Unit 100 in executing the core logic of rights allocation (including globally unique mapping of service objects, matching of contributing entities, rights calculation, irreversible result solidification, and interception of duplicate calculation requests). The core execution logic is as follows:

[0092] Data acquisition logic: The basic data required for rights allocation is obtained through a standardized encrypted interface. The service object identity attribution marker data that has been permanently fixed is clearly used as the unique global index. The contribution behavior data and transaction event data of the subject uniquely bound to the service object are obtained simultaneously. The interface only has data reading permissions and does not have the permissions to modify, delete or generate attribution marker data, thus completely separating it from the attribution determination system.

[0093] Mapping and differentiation logic: Based on the service object identity attribution tag data, a globally unique mapping of service objects is completed to ensure the consistency of data of the same service object across all channels; feature extraction and parsing of business data are performed to distinguish multiple independent subject contribution behaviors, and each type of contribution behavior is independently tagged so as not to interfere with each other.

[0094] Rule matching and calculation logic: Call the preset rights allocation rules, complete the rule matching, and generate the corresponding rights allocation instructions; execute rights calculation and status solidification. Only one calculation is triggered for rights in the same calculation dimension. After the calculation is completed, the rights status is marked as "solidified". Through the built-in repeated trigger interception logic, it automatically identifies and intercepts all subsequent calculation requests for the same type of rights.

[0095] Output logic: The rights allocation results and rights allocation certificates are output to the authorized terminal of the corresponding entity through an encrypted communication link. Only the corresponding entity can view its own rights data, ensuring data privacy.

[0096] The repeated triggering interception logic described in this invention, in addition to the interception rules of the same accounting dimension, can also be flexibly configured according to preset triggering conditions and triggering number thresholds, all of which fall within the protection scope of this invention; the rights allocation rules, in addition to the differentiated node type adaptation rules, can also set independent adaptation rules according to contribution behavior type, transaction type, and subject level, all of which fall within the protection scope of this invention.

[0097] Implementation methods for supporting functional modules:

[0098] Data acquisition module 200: Deployed on a cloud server, it has a bidirectional communication connection with the processing unit 100. Its core function is to collect basic data from one or more authorized service nodes across all channels. After the data is collected, it automatically performs data cleaning, deduplication, outlier filtering, and structuring processing to remove duplicate, abnormal, and invalid data. It converts unstructured data into structured data in a unified format and transmits it to the processing unit 100.

[0099] Rule configuration module 300: Deployed on a cloud server, it has a bidirectional communication connection with processing unit 100 and provides a visual configuration interface. Its core function is to customize multi-subject rights allocation and control rules. Supported configuration parameters include: rights calculation ratio for different service scenarios, rights calculation ratio for different authorized service node types, rights calculation ratio for different subject contribution behavior types, rights trigger threshold, and guiding rights parameters. After all configurations are completed, they are automatically synchronized to all authorized service nodes and take effect in real time without the need to restart the system.

[0100] Traceability Storage Module 400: Deployed on a cloud server, it has a bidirectional communication connection with the processing unit 100. Its core function is to perform chain-based encrypted storage of data throughout the entire process of rights determination, accounting, and execution, generating a unique traceability number and an immutable business traceability ledger. It uses the national cryptographic SM3 hash algorithm to encrypt all business data, embedding the hash value of the previous data record into the current data record to form a chain-based immutable storage structure. It supports queries by traceability number, subject ID, service object ID, time range, and other dimensions, and supports one-click export of compliance audit ledgers to meet regulatory audit requirements.

[0101] Data synchronization module 500: Deployed on a cloud server, it has a bidirectional communication connection with processing unit 100. Its core function is to realize real-time synchronization and consistency verification of cross-node equity data and ownership tag data. It adopts a mechanism that combines incremental synchronization and full synchronization. Incremental synchronization is triggered in real time when equity data changes, and full synchronization is triggered when offline nodes come back online. It automatically compares data differences and completes corrections to ensure cross-node data consistency. It supports data synchronization with third-party business systems (such as ERP systems, membership management systems, and POS systems) to achieve interconnection and interoperability of data from multiple systems.

[0102] The dual-layer entity information archive management module 600 is deployed on a cloud server and has a bidirectional communication connection with the processing unit 100. It includes a simplified archive unit and a complete entity information archive unit. The simplified archive unit only collects the core identity information of the service object to complete the rapid access and attribution mark mapping. The complete entity information archive unit has preset core mandatory fields. Only when all mandatory fields are filled in and pass the system's automatic verification will the corresponding authorized operation entity's archive improvement rights calculation and solidification be automatically triggered, without any manual intervention.

[0103] The Recommendation Association Management Module 700 is deployed on a cloud server and has a bidirectional communication connection with the processing unit 100. Its core function is to manage the recommendation association relationships between service objects. When any service object initiates a recommendation request, a unique temporary association marker is generated, establishing a one-time temporary binding relationship between the recommending service object and the recommended service object. Before the recommended service object completes its first transaction conversion event, it automatically enters the public customer pool, where internal contributors can freely claim it and generate a pre-binding relationship. Only when the recommended service object and an internal contributor complete their first transaction conversion event is the corresponding attribution marker permanently fixed, locking the internal contributor as the lifelong attribution contributor of the recommended service object. Simultaneously, when the recommended service object completes its first transaction conversion event, a one-time recommendation rights calculation for the recommending service object is automatically triggered. The rights amount can be independently configured according to preset rules, with a configuration range including 0.

[0104] In this embodiment, the temporary association marker has a preset fixed expiration time. It will automatically expire after the time expires. Only when the first transaction conversion event is completed before the expiration can the one-time referral rights calculation be triggered. After the expiration, the marker will be automatically destroyed and will not generate any rights association effect. This ensures from a technical point of view that the temporary binding relationship does not generate permanent ownership binding effect.

[0105] The hierarchical access control module 800 is deployed on a cloud server and has a bidirectional communication connection with the processing unit 100. Its core function is to implement hierarchical access control for the system. It establishes a three-tiered access system: system administrator, node administrator, and ordinary contributors, clearly defining the operational boundaries of each level. The system administrator has the highest authority, allowing configuration and modification of all rights allocation rules and ratios. Node administrators only have access to view data and perform daily operations for their node, without rule modification permissions. Ordinary contributors only have access to view their own rights data. All rule modification operations are only valid for new transaction events generated after the modification takes effect; permanently fixed service object identity attribution markers and irreversibly fixed historical rights calculation results cannot be modified or revoked. All rule modification operations generate immutable operation logs throughout the process and are simultaneously uploaded to the blockchain for evidence storage, supporting post-event auditing and traceability.

[0106] The hierarchical permission control module 800 also has built-in departure rights control logic, which is used to respond to the departure effective command of the contributing subject, automatically freeze all new rights acquisition permissions of the contributing subject, retain the distribution records of solidified historical rights, and allow the authorized subject to perform subsequent distribution operations. The contributing subject himself has no operation permissions. All subsequent transaction events generated by the service object will no longer trigger any rights allocation related to the departing contributing subject.

[0107] In this embodiment, the logic for managing resignation benefits is implemented through a technical-level status bit locking mechanism: after a contributing entity's resignation takes effect, the system automatically marks the entity's status as "resigned" and simultaneously closes all operational permissions for its account. The benefit calculation engine automatically filters new benefit triggering requests from "resigned" entities, retaining only the query and distribution channels for historically solidified benefits. This technically prevents erroneous triggering of new benefits after resignation while ensuring the normal distribution of solidified benefits.

[0108] Compliance control logic implementation method:

[0109] Processing unit 100 incorporates dual-layer independent binding logic and link interception logic. The core implementation method is as follows:

[0110] Establish completely isolated access guidance relationship binding and service ownership relationship binding. Both types of binding relationships are globally uniquely mapped based on the service object's identity ownership tag. The data of the two are completely isolated and do not affect each other.

[0111] The access guidance relationship retains only the first-level direct guidance relationship, with built-in link interception logic that automatically identifies second-level and above multi-level guidance association links and directly blocks the generation of links that do not meet the requirements. Only the calculation of rights corresponding to direct guidance behavior is allowed, and a hierarchical rights calculation model is not formed.

[0112] The guided service recipients are automatically assigned to a public pool, and their ownership markers and rights calculations are generated independently, without any connection to the guiding entity or historically associated entities, thus completely avoiding the compliance risks of hierarchical allocation.

[0113] Implementation of offline management logic:

[0114] Processing unit 100 has built-in offline management and control logic, and its core implementation method is as follows:

[0115] When the authorized service node is offline, the local terminal can complete the rights and interests calculation operation and data caching. The local execution logic is completely consistent with that of the cloud, ensuring that the rights and interests calculation rules do not change in the offline state. After the network is restored, the local terminal automatically synchronizes the cached offline data to the master node. After the integrity verification and hash value matching are completed by the traceability storage module 400, the entire process of evidence storage and state solidification is completed to ensure the consistency of offline and online data. If the verification fails, the system automatically triggers data rollback to restore the state before synchronization, and at the same time generates an exception log and stores it in the traceability storage module 400.

[0116] Implementation methods for multi-entity equity allocation:

[0117] The multi-entity rights allocation method described in this embodiment, when applied to any of the systems described above, specifically includes the following steps: S1 uses read-only, tamper-proof, and permanently fixed service object identity attribution data as the unique global index, and executes closed-loop logic throughout the entire process; at the same time, it collects basic data from one or more authorized service nodes through the data collection module 200 to complete data cleaning, deduplication, outlier filtering, and structured processing.

[0118] S2 For each transaction event, a globally unique mapping of the service object is completed based on the attribution marker data, and the corresponding contributing entity that is permanently bound to the attribution marker is matched to complete the rights and interests calculation. If the authorized service node is offline, the local terminal completes the rights and interests calculation operation and data caching. After the network is restored, it is automatically synchronized to the master node. After the integrity verification is passed, the whole process of evidence storage and status solidification is completed.

[0119] S3 irreversibly solidifies the equity calculation results and ensures that the same equity is only calculated once through built-in duplicate trigger interception logic. After solidification, it automatically intercepts the corresponding duplicate calculation requests. It outputs the equity allocation results and equity allocation vouchers to the authorized terminal of the corresponding entity to complete the entire equity allocation process. At the same time, it transmits the entire process data to the traceability storage module 400 to complete chain-encrypted storage.

[0120] Storage media and electronic devices implementation methods:

[0121] This embodiment provides a non-transitory tangible computer-readable storage medium storing a computer program. When executed by a processor, this computer program implements all the steps of the aforementioned multi-subject rights allocation method. The computer-readable storage medium includes tangible media capable of storing computer program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, and optical disks, but does not include transient propagation signals.

[0122] This embodiment also provides an electronic device, including a processor and a memory. The memory stores a computer program that can run on the processor. When the processor executes the computer program, it implements all the steps of the above-described multi-subject rights allocation method and / or runs the multi-subject rights allocation system described above. The electronic device includes devices with data processing and program execution capabilities, such as industrial control computers, cloud servers, edge gateways, and smart terminals.

[0123] Typical scenario implementation example:

[0124] Example: Application of multi-node health service scenario with multi-subject rights allocation:

[0125] This embodiment is used to illustrate the specific application of the present invention in a multi-node health service scenario, and does not constitute a limitation on the scope of protection of the present invention.

[0126] Scenario and Deployment Configuration: This example was tested at 3 directly operated service sites and 2 franchised service sites, with the following deployment configuration:

[0127] Core System: Deployed on the headquarters cloud server, the core is the processing unit 100, and it is equipped with a data acquisition module 200, a rule configuration module 300, a traceability storage module 400, a data synchronization module 500, a two-layer main information archive management module 600, a recommendation association management module 700, and a hierarchical permission control module 800.

[0128] Authorized service nodes: Each service site deploys one edge gateway and several smart terminals, and the edge gateway establishes an encrypted communication connection with the core system.

[0129] Cross-system integration: It integrates with the service object identity attribution determination system based on cross-node tagging, the pharmacy ERP system, and the POS system. It obtains the permanently fixed service object identity attribution tag data through the read-only interface of the processing unit 100 to achieve real-time data synchronization.

[0130] Rule Configuration: In the rule configuration module 300, set the benefit ratio: 10 yuan / person for the first service access contribution, 20 yuan / person for the first transaction completion contribution, 15 yuan / person for the on-site service delivery contribution, 5 yuan / person for the one-time referral benefit for the direct guidance behavior, and 8 yuan / person for the profile completion contribution. The benefit allocation ratio can be configured from 0 to 100%.

[0131] (5) Permission configuration: In the hierarchical permission control module 800, there is 1 system administrator (headquarters), 5 node administrators (1 at each site), and 20 ordinary contributors (service personnel at each site). Only the system administrator has the permission to modify rules and proportions.

[0132] Implementation process:

[0133] When service recipient A (existing customer) initiates a recommendation request, recommending service recipient B (new customer), the recommendation association management module 700 generates a temporary association tag, establishing a one-time temporary binding relationship between A and B.

[0134] Service recipient B is automatically added to the public customer pool. Service center employee A claims service recipient B from the public pool, generating a pre-binding relationship.

[0135] Employee A successfully invited service recipient B to visit the store for the first time and completed a simplified profile. The service recipient identity attribution determination system based on cross-node tagging generates and permanently fixes the attribution tag of service recipient B. This system obtains the attribution tag data through a read-only interface.

[0136] Employee A facilitates service recipient B to complete the first transaction. Data collection module 200 collects the "first transaction completed" contribution behavior data. Processing unit 100 completes the globally unique mapping of the service recipient, distinguishes the contribution behavior type, matches the corresponding rights and interests rules, and completes the calculation and status solidification of 20 yuan of rights and interests. At the same time, it triggers the calculation and solidification of 5 yuan of one-time referral rights for service recipient A.

[0137] Only when the first transaction is completed will the permanent solidification of the ownership mark be triggered, locking employee A as the lifelong ownership contributor of service object B. Subsequent transactions generated by service object B at any node will trigger the corresponding rights and interests allocation for employee A according to the preset rules.

[0138] Employee B assists service recipient B in completing the full information file. After the system automatically verifies and approves the information, it triggers the calculation and solidification of Employee B's file completion rights of 8 yuan.

[0139] Employee C provides on-site service to service recipient B. Data collection module 200 collects "on-site service delivery" contribution behavior data, and processing unit 100 matches the corresponding rules to complete the calculation and status solidification of 15 yuan of rights.

[0140] When the service site experiences a temporary network outage, employee Ding performs on-site service for service recipient C, and the local terminal completes the rights and interests calculation and data caching. After the network is restored, the local data is automatically synchronized to the master node, and after passing the integrity verification, the data is stored and the status is solidified.

[0141] The system administrator adjusted the on-site service delivery rights ratio to 20%. This adjustment is only effective for new transaction events generated after the adjustment takes effect. The previously fixed 15 yuan rights of service recipient B will not be changed.

[0142] The traceability storage module 400 performs chain-encrypted storage of all rights allocation data throughout the entire process, generates a unique traceability number and business traceability ledger, and leaves a complete record of all rule modification operations and stores them on the chain for evidence.

[0143] Employee A submitted their resignation application on May 1st, and the resignation officially took effect on June 1st. In response to the resignation effective command, the system automatically froze all of Employee A's new rights acquisition permissions. The rights that Employee A had already been fixed in May will be distributed by the authorized entity in June. Employee A himself will not be able to log in to the system to operate or modify his historical rights data. After Employee A's resignation, any subsequent transactions made by Service Target B at any point will no longer trigger any rights allocation related to Employee A.

[0144] The data synchronization module 500 synchronizes the rights and interests allocation results to all authorized service nodes and the ERP system, ensuring data consistency across nodes.

[0145] If Service Target B makes another purchase at the store, Processing Unit 100 will identify it as a subsequent transaction event and automatically intercept repeated triggering requests for the corresponding rights and benefits for the first service access, first transaction completion, and file completion. Only the rights and benefits calculation for the corresponding on-site service delivery behavior will be triggered.

[0146] Implementation Results: This implementation model operated stably for 60 consecutive days, with 100% accuracy in rights allocation, no duplicate allocations, 99.99% data consistency across multiple nodes, a 100% compliance audit pass rate, a 45% increase in external referrals, a 60% increase in internal employee service enthusiasm, a 96% increase in customer information completeness, zero business interruption during network outages, and no labor disputes, fully meeting the rights allocation requirements of multi-node distributed service scenarios.

[0147] The above are merely embodiments of the present invention and are not intended to limit the invention. Various modifications and variations can be made to the present invention by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principle of the present invention should be included within the scope of the claims of the present invention.

Claims

1. A multi-subject rights allocation system based on cross-node affiliation markers, characterized in that, Includes processing units; The processing unit uses only the read-only, tamper-proof, permanently fixed service object identity attribution marker data as the sole global index, and is the sole execution entity for the entire process of rights allocation in the system, executing the indivisible closed-loop logic in a fixed order throughout the entire process; For each transaction event, the processing unit completes a globally unique mapping of the service object based solely on the aforementioned attribution marker data, and matches the corresponding contributing entity that is permanently bound to the attribution marker to complete the rights and interests calculation. The processing unit irreversibly solidifies the equity calculation results and simultaneously ensures that the same equity is only calculated once through the built-in duplicate triggering interception logic. After solidification, it automatically intercepts the corresponding duplicate calculation requests.

2. The system according to claim 1, characterized in that, The service object identity attribution marker data is generated and permanently fixed by the service object identity attribution determination system based on cross-node markers applied for on the same day. The processing unit only has read-only access permission for this marker data and does not have the permission to modify, delete, overwrite, generate, or determine it.

3. The system according to claim 1, characterized in that, The processing unit achieves irreversible solidification of equity accounting results through a chain-based encrypted storage structure.

4. The system according to claim 3, characterized in that, Once the calculation results are solidified, any modification, deletion, or overwriting operation will cause the encrypted verification value to become invalid, and the processing unit will automatically intercept and trigger an alert.

5. The system according to claim 1, characterized in that, The repeated triggering interception logic triggers only one calculation for the same calculation dimension of rights and interests. Once the result is irreversibly fixed, the corresponding repeated calculation request is automatically intercepted.

6. The system according to claim 5, characterized in that, The same accounting dimension is a combination of parameters used to uniquely identify a single equity accounting item.

7. The system according to claim 1, characterized in that, The attribution marker data is used to lock the lifelong unique binding relationship between the service object and the corresponding contributing entity. Based on this binding relationship, the processing unit completes the cross-node rights and interests calculation mapping of the service object throughout the entire system.

8. The system according to claim 1, characterized in that, When the processing unit completes the globally unique mapping of the service object, it simultaneously distinguishes multiple independent subject contribution behaviors that are uniquely bound to the service object. Each subject contribution behavior corresponds to an independent rights type and rights allocation rule, and there is no correlation or influence between them.

9. The system according to claim 8, characterized in that, The aforementioned multiple independent subject contribution behaviors are independent operational behaviors that are completed throughout the entire lifecycle of the service recipient and have service conversion value.

10. The system according to claim 1, characterized in that, The processing unit is also used to obtain the identity information of the contributing entity and determine the type of functional node to which it belongs. The functional node is a logical unit with independent service delivery and accounting capabilities. The processing unit can adapt to preset differentiated rights and interests allocation rules for different functional node types.

11. The system according to claim 10, characterized in that, The rules for the allocation of differentiated rights and interests are as follows: i. If the contributing entity belongs to the first type of functional node, the corresponding rights and interests will be allocated when the service recipient generates a transaction that conforms to the preset rules on any functional node; ii. If the contributing entity belongs to the second type of functional node, the basic rights allocation will be triggered when the service object generates a transaction that conforms to the preset rules on the same type of functional node.

12. The system according to claim 11, characterized in that, The differentiated rights allocation control rules also include: If the contributing entity belongs to the second type of functional node, when the service object generates a transaction across nodes to the first type of functional node, the processing unit first performs cross-node contribution compliance verification. Only when all verification items pass, the cross-node contribution rights allocation is triggered, and the rights calculation and irreversible status solidification are completed; if any verification fails, the processing unit automatically intercepts the rights allocation.

13. The system according to claim 12, characterized in that, The cross-node contribution compliance verification item is a preset verification dimension used to verify the compliance of transactions and contribution behaviors.

14. The system according to claim 1, characterized in that, Equity accounting follows a dual-mode adaptation rule.

15. The system according to claim 14, characterized in that, The dual-mode adaptation rule is as follows: a. If the functional node to which the transaction belongs and the functional node to which the contributing entity belongs are different independent legal entities, cross-entity accounting shall be conducted by the entity to which the transaction belongs and the entity to which the contributing entity belongs, and the accounting vouchers and related voucher information shall be stored synchronously. b. If the functional node to which the transaction belongs and the functional node to which the contributing entity belongs are different logical units under the same legal entity, the system will perform internal accounting, and the accounting data will be synchronously recorded in the execution records of the corresponding unit and the contributing entity, and the accounting data will be synchronously stored as evidence.

16. The system according to claim 1, characterized in that, The processing unit and the blockchain evidence storage unit are connected in two directions. The blockchain evidence storage unit is used to perform tamper-proof on-chain evidence storage of the binding relationship data between the contributing entity and the service object, the full-process rights and interests accounting data, and the transaction event data, generate a hash value that is uniquely bound to the data, and feed back the evidence storage verification result to the processing unit.

17. The system according to claim 16, characterized in that, The blockchain evidence storage unit is built on a compliant blockchain network and uses a cryptographic hash algorithm to process the data and generate a unique hash value.

18. The system according to claim 17, characterized in that, The evidence verification result is the conclusion data used to verify the integrity and validity of the on-chain data.

19. The system according to claim 1, characterized in that, The processing unit has a built-in hierarchical permission control module. The hierarchical permission control module is used to set up a hierarchical permission system, which includes at least three levels of permissions: system administrator, node administrator, and ordinary contributor. Only the system administrator has the permission to configure and modify the rights allocation rules and rights allocation ratios. Other roles only have the permission to view and operate data within their corresponding permission scope, and do not have the permission to modify rules. The rule modification operations are only valid for new transaction events generated after the modification takes effect. They cannot modify or revoke the permanently fixed service object identity attribution mark or the historical rights calculation results that have been irreversibly fixed. All rule modification operations generate operation logs throughout the process and are simultaneously uploaded to the blockchain for evidence storage.

20. The system according to claim 19, characterized in that, The hierarchical permission control module is also used to respond to the departure effective command of the contributing entity, automatically freeze all new rights acquisition permissions of the contributing entity, retain the distribution records of the solidified historical rights, and allow the authorized entity to perform subsequent distribution operations. The contributing entity itself has no operation permissions. All subsequent transaction events generated by the service recipient will no longer trigger any rights allocation related to the departing contributing entity.

21. The system according to claim 1, characterized in that, The processing unit also has at least one of the following functional modules that can be used independently, separately, or in any combination: a. Global rule configuration module, used to uniformly configure rights allocation rules, compliance verification rules, and dual-mode accounting rules, and synchronize the rules to all authorized terminals and functional nodes; b. Cross-system interface adaptation module, used to realize standardized encrypted data interaction and consistency verification with third-party heterogeneous business systems, and support the acquisition of transaction event data and subject contribution behavior data of third-party systems; c. Data anonymization module, used to anonymize all data involving the personal information of service recipients before storing and transmitting the data; d. Anomaly warning module, used to monitor abnormal operations in the rights allocation process in real time, trigger warnings for abnormal behaviors such as repeated triggering, unauthorized operation, and data tampering, and retain operation logs; e. Omnichannel data synchronization module, used to achieve real-time synchronization and unique identifier mapping of omnichannel data across different functional nodes and authorized terminals; f. Offline management module: When the authorized service node is offline, the local terminal can complete the rights and interests calculation and data caching. After the network is restored, the data will be automatically synchronized to the master node. After the integrity verification is passed, the entire process of evidence storage and status solidification will be completed.

22. The system according to claim 1, characterized in that, The processing unit is bidirectionally connected to the dual-layer subject information archive management module, which includes a simplified filing unit and a complete subject information archive unit. The simplified filing unit is used to collect the core identity information of the service object and complete the rapid access and attribution mark mapping. The complete subject information archive unit presets core mandatory fields. Only when all mandatory fields are filled in and pass the system's automatic verification will the file improvement rights calculation and solidification of the corresponding authorized operation subject be automatically triggered, without any manual intervention.

23. The system according to claim 1, characterized in that, The processing unit has a built-in recommendation association management module; The recommendation association management module is used to support any service object to initiate a recommendation request, generate a temporary association mark for the new service object, and establish a one-time temporary binding relationship between the recommending service object and the recommended service object; The temporary binding relationship is only used to trigger a one-time referral benefit calculation and does not have the effect of permanent ownership binding; before the referred service object completes the first transaction conversion event, it will automatically enter the public customer pool, where it will be claimed by the internal contributing entity and a pre-binding relationship will be generated; Only when the recommended service recipient and the internal contributor complete the first transaction conversion event will the corresponding attribution mark be permanently fixed, locking the internal contributor as the lifetime attribution contributor of the recommended service recipient. The one-time referral benefit for the referred service recipient is calculated when the referred service recipient completes its first transaction conversion event. The benefit amount can be configured independently, and the configuration range includes 0.

24. The system according to claim 1, characterized in that, The rights and interests allocation rules support setting independently configurable rights and interests allocation ratios for different functional node types, different contributing entity types, and different transaction event types. The configurable range of the rights and interests allocation ratios includes 0. The adjustment of the equity allocation ratio is only effective for new transaction events that occur after the adjustment takes effect. It does not change the permanently fixed identity attribution marker of the service recipient, nor does it modify the historical equity calculation results and calculation rules that have been irreversibly fixed.

25. The system according to claim 1, characterized in that, The processing unit has built-in link interception logic, which automatically identifies and blocks the generation of secondary and higher-level multi-level guidance association links, retaining only the primary direct guidance relationship.

26. The system according to claim 1, characterized in that, The processing unit establishes completely isolated access guidance relationship binding and service affiliation relationship binding. The two types of binding relationship data are completely isolated and do not affect each other.

27. The system according to claim 21, characterized in that, After the network is restored, the offline management module needs to perform integrity verification and hash value matching on the cached offline data. Only after the verification is passed can the entire process of evidence storage and status solidification be completed.

28. The system according to claim 1, characterized in that, The processing unit automatically performs structured processing on the acquired omnichannel basic data. The processing flow includes data cleaning, deduplication, outlier filtering, and format unification.

29. A method for allocating multi-subject rights based on cross-node affiliation markers, characterized in that, Applied to the system according to any one of claims 1 to 28, the system processing unit acts as the sole execution entity, executing the following indivisible and unadjustable closed-loop steps in a fixed order: S1 uses only the read-only, tamper-proof, permanently fixed service object identity attribution marker data as the sole global index to initiate the entire process of rights and interests allocation logic; S2 For each transaction event, it completes a globally unique mapping of the service object based solely on the aforementioned attribution marker data, and matches the corresponding contributing entity that is permanently bound to the attribution marker to complete the equity calculation; S3 irreversibly solidifies the equity calculation results and simultaneously ensures that the same equity is only calculated once through built-in duplicate trigger interception logic. After solidification, it automatically intercepts the corresponding duplicate calculation requests.

30. The method according to claim 29, characterized in that, The attribution marker data is used to lock the lifelong unique binding relationship between the service object and the corresponding contributing entity, and to complete the cross-node rights and interests calculation mapping of the service object throughout the entire system based on this binding relationship.

31. The method according to claim 29, characterized in that, The repeated triggering interception logic triggers only one calculation for the same calculation dimension of rights and interests. Once the result is irreversibly fixed, the corresponding repeated calculation request is automatically intercepted.

32. The method according to claim 29, characterized in that, In step S3, the irreversible solidification of the equity calculation results is achieved through a chain-based encrypted storage structure. The hash value of the previous data record is embedded in the current data record, and any data modification will cause the hash values ​​of all subsequent records to become invalid.

33. The method according to claim 29, characterized in that, When the authorized service node is offline, the local terminal completes the rights and interests calculation and data caching. After the network is restored, the integrity of the offline data is verified. Only after the verification is passed can the entire process of evidence storage and status solidification be completed.

34. A non-transitory tangible computer-readable storage medium, characterized in that, The storage medium stores a computer program, which, when executed by a processor, implements the steps of the multi-subject rights allocation method based on cross-node attribution markers as described in any one of claims 29 to 33.

35. An electronic device, characterized in that, The system includes a processor and a memory, the memory storing a computer program that can run on the processor. When the processor executes the computer program, it implements the multi-entity rights allocation method based on cross-node ownership markers as described in any one of claims 29 to 33, and / or runs the multi-entity rights allocation system based on cross-node ownership markers as described in any one of claims 1 to 28.