A cell owner online voting system and method supporting a temporary ticket locking mechanism

Abstract

The application relates to the technical field of community owner voting, and discloses a community owner online voting system and method supporting a temporary voting locking mechanism, which comprises the following modules: a voting terminal module used for collecting voting messages; a voting processing module used for analyzing and extracting a house property identifier and processing data to generate desensitization intention data; a voting locking cache module used for establishing mutual exclusion index bits in memory to lock the intention data; an identity verification module used for querying a property right database and triggering comparison; an effective period control module used for setting a constraint window; and a ticket generation module used for releasing write protection permission and realizing atomic storage when the window is valid and the comparison is passed. The application uses a memory mutual exclusion locking architecture based on a house property identifier, solves voting right conflicts under shared property rights, reduces property right database query pressure, and guarantees the certainty of voting intention under complex working conditions.

Description

Technical Field

[0001] This invention relates to an online voting system and method for community homeowners that supports a temporary vote-locking mechanism, belonging to the field of community homeowner voting technology. Background Technology

[0002] Currently, online voting in smart community governance adopts a linear processing model that verifies identity information first and grants voting rights only after successful verification. Under normal circumstances, this approach maintains the rigor of the voting process and provides basic data support for decision-making on major community matters. However, when faced with high-concurrency voting demands or complex property rights verification scenarios, the backend system experiences significant response delays due to its real-time traversal of massive amounts of real estate registration information. This prevents the system from responding promptly when homeowners express their voting intentions. This linear verification-based model sacrifices system processing timeliness to maintain voting compliance, resulting in data loss during the restricted voting window.

[0003] To alleviate the aforementioned contradictions, conventional improvement approaches attempt to introduce pre-locking mechanisms from the general e-commerce field. This involves recording voting intentions and then asynchronously verifying identities to improve throughput. However, community owner voting has a strong physical asset binding attribute; that is, the exercise of voting rights is linked to a specific physical property unit rather than a single natural person. Furthermore, there are often multiple mapping relationships between multiple co-owners and the same property unit. Conventional locking strategies based on communication sessions or terminal identifiers, when handling such mappings, can lead to data conflicts at the memory addressing level due to multiple co-owners initiating opposing votes within a short period. For example, Chinese invention patent CN118074916B discloses a method and system for owner voting and public announcement based on synchronously uploading voting codes to the blockchain, which achieves this through CA institution authentication and hashed voting codes. The on-chain mapping of homeowner identities enhances credibility. Analyzing the underlying logic, the technical path relies on locking the identity of individual homeowners. In the context of homeowner voting, the essence of the voting right is bound to a specific physical property unit, making it a non-homogeneous asset. This presents a complex mapping relationship where multiple co-owners correspond to the same property unit. In a high-concurrency access environment, the user-identity-based preprocessing mode cannot establish underlying mutual exclusion constraints for the property at the memory addressing level. The asynchronous verification callback cycle is prone to overwriting of the property voting intention logic or data conflicts, making it difficult to guarantee the uniqueness and certainty of the voting results for shared ownership. Since the aforementioned user-side pre-storage methods cannot reach the underlying physical property unit, simply increasing computing resources or simple session isolation methods cannot fundamentally solve the concurrent conflicts of asset intentions.

[0004] Therefore, the technical problem to be solved by this invention is how to construct an online voting system for community owners that supports a temporary vote-locking mechanism, which can achieve mutual exclusion locking based on the physical identifier of the property unit and maintain the consistency of voting data in an asynchronous verification environment. Summary of the Invention

[0005] To address the problems mentioned in the background art, the technical solution of the present invention is as follows: An online voting system for community owners supporting a temporary vote-locking mechanism, comprising: The voting terminal module is used to perform operator verification of three key elements: name, ID number, and mobile phone number. After the verification is successful, it collects real-name voting messages and generates raw voting data. The voting processing module is used to receive the original voting data and parse and extract the property unit identifier. The voting processing module uses a one-way desensitization algorithm to desensitize the original voting data to remove terminal feature information and generate intention status data representing the intention status of the ownership target. The ticket locking cache module is used to establish a mutual exclusion index bit in the memory address space based on the property unit identifier and synchronously retrieve the current occupancy status of the user identity identifier. If the mutual exclusion index bit corresponding to the property unit identifier is in an idle state and the user identity identifier is not associated with other unconfirmed intentions in the current ticket locking period, the amount of intention status data is locked through the mutual exclusion index bit. The identity verification module is used to perform concurrent queries on the property rights association database during the asynchronous verification period. The identity verification module triggers a legality comparison process for the amount of data in the intended state based on the occupancy status of the mutual exclusion index bit. The validity period control module is used to set a validity constraint window that decreases over time for the amount of intention status data. The validity period control module communicates with the ticket locking cache module to maintain the state occupancy of the mutual exclusion index bit. The ballot generation module is used to realize the directional migration of intention status data to the ballot storage area. When the judgment logic of valid constraint window not being overdue and legality comparison being passed is met, the ballot generation module releases the write protection permission of memory address space to complete the atomic storage of voting intention and generate a valid ballot signal.

[0006] Preferably, the ticket locking cache module adopts a hash table-based concurrent access control mechanism. The ticket locking cache module maps the property unit identifier to a globally unique memory key value, and when processing the intention state data, it queries the mutex index bit corresponding to the memory key value. If the mutex index bit is in an idle state, it flips the mutex index bit to an occupied state and loads the intention state data. If the mutex index bit is in an occupied state, it discards the currently accessed original voting data, thereby ensuring that each property unit identifier has only a unique intention data state in the memory address space before the asynchronous feedback result of the property association database is returned.

[0007] Preferably, the voting processing module performs the anonymization process as follows: Step 31: Extract the communication layer message features and business layer load features from the original voting data; Step 32: Use a one-way hash algorithm to perform irreversible masking on the communication layer message features to generate anonymized credentials; Step 33: Separate the property unit identifier and voting option variable from the business layer load features, and encapsulate the property unit identifier, voting option variable, and anonymized credentials into intention state data.

[0008] Preferably, the process of the identity verification module performing legality comparison includes: Step 41: Initiating an asynchronous query request containing the property unit identifier to the external property management server; Step 42: Receiving the co-owner mapping list returned by the property management server; Step 43: Performing topological matching between the identity declaration information recorded in the intention status data and the co-owner mapping list, and feeding back a Boolean flag indicating that the legality comparison has passed when the matching is successful.

[0009] Preferably, the validity period control module is also used to perform expired cache cleanup. When the validity period control module detects that the valid constraint window has expired and the legality comparison has not returned a success signal, it sends a forced release instruction to the ticket lock cache module to clear the corresponding mutex index bit in the memory address space.

[0010] Preferably, the ticket locking cache module also includes a write protection unit, which is used to block the rewrite permission for the physical memory address where the intended state data is located while the mutex index bit is in the occupied state, until atomic storage is completed or a forced release instruction is received from the validity period control module.

[0011] Preferably, after the ticket generation module completes atomic notarization, it sends a successful notarization receipt of the intention status data to the voting terminal module and instructs the ticket locking cache module to cancel the corresponding mutual exclusion index bit.

[0012] Preferably, the system also includes a load balancing unit, which is connected to the front end of the voting processing module and is used to schedule the access rate of the raw voting data according to the real-time memory throughput pressure of the vote caching module.

[0013] Preferably, the bill generation module also includes a result disclosure unit, which is used to convert the intention status data into a desensitized disclosure message and send it to the public display area after the atomic evidence storage is completed, so as to realize the public disclosure of the voting results.

[0014] A method for online voting by community residents that supports a temporary vote-locking mechanism includes the following steps: Step 1001: Collect raw voting data and generate voting messages; Step 1002: Parse and extract the property unit identifier, and remove terminal feature information by desensitizing the original voting data, thereby generating the intention status data volume; Step 1003: Establish a mutex index in the memory address space based on the property unit identifier, and use the mutex index to lock a unique amount of intentional state data in order to establish a data isolation environment during the asynchronous verification period. Step 1004: During the asynchronous verification period, compare the property rights association database and initiate a legality comparison process for the amount of data in the intended state based on the occupancy status of the mutual exclusion index bit. Step 1005: Set an effective constraint window that decreases over time for the amount of intention state data, and protect memory resources by maintaining the state occupancy of the mutual exclusion index bit. Step 1006: When the valid constraint window has not expired and the legality comparison is passed, release the write protection permission of the memory address space, realize the atomic storage of voting intention to the ballot storage area and generate a valid ballot signal.

[0015] Compared with the prior art, the beneficial effects of the present invention are: 1. In the online voting system for community owners, a memory addressing mechanism with the physical identifier of the property as the unique addressing key is established in the vote locking cache module. Combined with the desensitization and stripping of terminal identifiers by the voting processing module, the underlying mutual exclusion locking of physical assets is achieved. This mechanism enables the system to eliminate logical overwrite conflicts caused by multiple rights holders launching opposite votes for the same property unit in the community shared ownership scenario when processing intention data based on operator real-name verification but not yet completed property identity association during the asynchronous verification period. This ensures that during the asynchronous verification window, the memory address space corresponding to each property unit retains only a unique intention state vector, maintaining the consistency of governance data.

[0016] 2. By asynchronously decoupling the voting intention locking from the property rights verification process, and by using the mutual exclusion status bits inside the vote locking cache module to pre-intercept redundant requests, the instantaneous query throughput pressure of the identity verification module on the external property rights mapping topology database is significantly reduced. When facing high-concurrency voting scenarios, this architecture enables system resources to accurately converge to the verification of asset intentions with unique exclusivity, avoiding system bus blockage caused by a large number of repetitive or invalid property rights traversal operations, and improving the processing determinism of the identity verification process within the limited time window.

[0017] 3. By linking the validity period control module and the ticket locking cache module, a strong constraint window that decreases over time is established for each locked intention state vector. Combined with the logical formula judgment of the ticket issuance trigger module, an atomic transformation path from temporary intention to formal ballot is constructed. When the preset mutually exclusive lock Boolean state and property rights mapping legality state quantity are met, the system realizes highly reliable flow of voting intention under complex dynamic conditions through the directional transfer of intention state vector to formal storage area and the release of write protection in memory address space, ensuring that the voting result has physical irreversibility and determinism. Attached Figure Description

[0018] Figure 1 This is a diagram showing the full-process architecture and asynchronous verification business flow of the voting system of this invention; Figure 2 This is a diagram showing the logical judgment and memory state transition of the ticket locking cache module of the present invention.

[0019] The objectives, features, and advantages of this invention will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. Detailed Implementation

[0020] The technical solutions of the embodiments of this application will be clearly described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of this application are within the scope of protection of this application.

[0021] An online voting system for homeowners in a residential community that supports a temporary vote-locking mechanism includes: The voting terminal module is used to perform operator verification of three key elements: name, ID number, and mobile phone number. After the verification is successful, it collects real-name voting messages and generates raw voting data. The voting processing module is used to receive the original voting data and parse and extract the property unit identifier. The voting processing module uses a one-way desensitization algorithm to desensitize the original voting data to remove terminal feature information and generate intention status data representing the intention status of the ownership target. The ticket locking cache module is used to establish a mutual exclusion index bit in the memory address space based on the property unit identifier and synchronously retrieve the current occupancy status of the user identity identifier. If the mutual exclusion index bit corresponding to the property unit identifier is in an idle state and the user identity identifier is not associated with other unconfirmed intentions in the current ticket locking period, the amount of intention status data is locked through the mutual exclusion index bit. The identity verification module is used to perform concurrent queries on the property rights association database during the asynchronous verification period. The identity verification module triggers a legality comparison process for the amount of data in the intended state based on the occupancy status of the mutual exclusion index bit. The validity period control module is used to set a validity constraint window that decreases over time for the amount of intention status data. The validity period control module communicates with the ticket locking cache module to maintain the state occupancy of the mutual exclusion index bit. The ballot generation module is used to realize the directional migration of intention status data to the ballot storage area. When the judgment logic of valid constraint window not being overdue and legality comparison being passed is met, the ballot generation module releases the write protection permission of memory address space to complete the atomic storage of voting intention and generate a valid ballot signal.

[0022] Preferably, the ticket locking cache module adopts a hash table-based concurrent access control mechanism. The ticket locking cache module maps the property unit identifier to a globally unique memory key value, and when processing the intention state data, it queries the mutex index bit corresponding to the memory key value. If the mutex index bit is in an idle state, it flips the mutex index bit to an occupied state and loads the intention state data. If the mutex index bit is in an occupied state, it discards the currently accessed original voting data, thereby ensuring that each property unit identifier has only a unique intention data state in the memory address space before the asynchronous feedback result of the property association database is returned.

[0023] Preferably, the voting processing module performs the anonymization process as follows: Step 31: Extract the communication layer message features and business layer load features from the original voting data; Step 32: Use a one-way hash algorithm to perform irreversible masking on the communication layer message features to generate anonymized credentials; Step 33: Separate the property unit identifier and voting option variable from the business layer load features, and encapsulate the property unit identifier, voting option variable, and anonymized credentials into intention state data.

[0024] Preferably, the process of the identity verification module performing legality comparison includes: Step 41: Initiating an asynchronous query request containing the property unit identifier to the external property management server; Step 42: Receiving the co-owner mapping list returned by the property management server; Step 43: Performing topological matching between the identity declaration information recorded in the intention status data and the co-owner mapping list, and feeding back a Boolean flag indicating that the legality comparison has passed when the matching is successful.

[0025] Preferably, the validity period control module is also used to perform expired cache cleanup. When the validity period control module detects that the valid constraint window has expired and the legality comparison has not returned a success signal, it sends a forced release instruction to the ticket lock cache module to clear the corresponding mutex index bit in the memory address space.

[0026] Preferably, the ticket locking cache module also includes a write protection unit, which is used to block the rewrite permission for the physical memory address where the intended state data is located while the mutex index bit is in the occupied state, until atomic storage is completed or a forced release instruction is received from the validity period control module.

[0027] Preferably, after the ticket generation module completes atomic notarization, it sends a successful notarization receipt of the intention status data to the voting terminal module and instructs the ticket locking cache module to cancel the corresponding mutual exclusion index bit.

[0028] Preferably, the system also includes a load balancing unit, which is connected to the front end of the voting processing module and is used to schedule the access rate of the raw voting data according to the real-time memory throughput pressure of the vote caching module.

[0029] Preferably, the bill generation module also includes a result disclosure unit, which is used to convert the intention status data into a desensitized disclosure message and send it to the public display area after the atomic evidence storage is completed, so as to realize the public disclosure of the voting results.

[0030] A method for online voting by community residents that supports a temporary vote-locking mechanism includes the following steps: Step 1001: Collect raw voting data and generate voting messages; Step 1002: Parse and extract the property unit identifier, and remove terminal feature information by desensitizing the original voting data, thereby generating the intention status data volume; Step 1003: Establish a mutex index in the memory address space based on the property unit identifier, and use the mutex index to lock a unique amount of intentional state data in order to establish a data isolation environment during the asynchronous verification period. Step 1004: During the asynchronous verification period, compare the property rights association database and initiate a legality comparison process for the amount of data in the intended state based on the occupancy status of the mutual exclusion index bit. Step 1005: Set an effective constraint window that decreases over time for the amount of intention state data, and protect memory resources by maintaining the state occupancy of the mutual exclusion index bit. Step 1006: When the valid constraint window has not expired and the legality comparison is passed, release the write protection permission of the memory address space, realize the atomic storage of voting intention to the ballot storage area and generate a valid ballot signal.

[0031] Example 1: In the operating environment of an online voting system for homeowners in a community with shared ownership, multiple homeowners concurrently input opposing voting options for the same physical property unit. In this case, the traditional mechanism of caching based on communication sessions or terminal identifiers causes the backend property management server to bear redundant verification and query loads, and triggers storage overwrite conflicts regarding the voting rights of the same property unit during the asynchronous callback period. The online voting system for homeowners supporting a temporary vote-locking mechanism receives data input to initiate the processing flow. The voting terminal module collects intentional voting messages based on operator real-name verification but for which property identity association has not yet been completed during the asynchronous verification period and generates raw voting data. The voting processing module receives and parses the raw voting data. The property unit identifier is extracted, and the voting processing module uses a one-way hash algorithm to de-identify the original voting data to remove terminal feature information, generating a volume of intention state data representing the intention state of the ownership target. The ticket locking and caching module establishes a globally unique mutual exclusion index bit in the memory address space based on the property unit identifier and queries its current status. If the mutual exclusion index bit is in an idle state, its state is flipped to an occupied state and the intention state data is loaded. If the mutual exclusion index bit is in an occupied state, the ticket locking and caching module discards the currently accessed conflicting original voting data. Using this physical target identifier as the addressing key, concurrent unordered requests are converged into a single intention lock. During the asynchronous verification period, conflicting requests for the same property unit identifier are intercepted to establish an underlying data isolation environment.

[0032] After establishing a data isolation environment, the identity verification module initiates an asynchronous query request containing the property unit identifier to the external property management server. Based on the occupancy status of the mutex index bit, the identity verification module triggers a legality comparison of the intention state data. The validity period control module sets a time-decreasing valid constraint window for the intention state data. The validity period control module communicates with the ticket locking cache module to maintain the occupancy status of the mutex index bit. During the occupancy period, the write protection unit inside the ticket locking cache module blocks the rewrite permission for the physical memory address where the intention state data is located. The aforementioned time constraints restrict the indefinite suspension of memory space and simultaneously block the generation path of massive redundant query instructions to allocate system computing power to a single, exclusive asset intention verification task. During the decreasing cycle of the valid constraint window, the system continuously monitors the status. If the valid constraint window has not expired and the identity verification module reports that the legality comparison has passed, the ticket generation module releases the write protection permission of the memory address space. The ticket generation module then migrates the intention state data to the ballot storage area to complete the atomic storage of voting intentions and generate a valid ticket signal. The ticket generation module then sends a notification to the voting terminal module. The system sends a successful receipt for the storage of the intended status data and instructs the validity period control module to send a forced release command to the ticket caching module to clear the corresponding mutex index bit. This restores the system memory to a ready state for receiving subsequent interactions for the property unit identifier. During the initial system startup phase, the voting terminal module does not directly collect data but first guides the user to enter their name, ID number, and mobile phone number. The system calls the external operator's three-factor verification interface to ensure the authenticity of the operator's identity. This solves the problem of the person's actual existence. The subsequent identity verification module then solves the problem of matching the person with the property, forming a double endorsement. To prevent malicious users from frequently initiating locking commands using their real-name identities and occupying memory resources, the ticket caching module introduces user-level status monitoring. In the mutex index bit establishment logic, the system not only checks whether the property is locked but also whether the real-name user already has a processing ticket. If user A has initiated a lock on room 101 and has not yet received confirmation from the property database, the system will refuse any subsequent ticket locking operations initiated by user A until the lock is released or confirmed. To achieve refined concurrency control, this invention defines a user lock status function. , ,in, This represents a globally unique user identity identifier (such as an encrypted hash value of an ID card) verified by the operator's three elements. Represents the physical identifier of a property unit; the system maintains global variables. That is, at any sampling time, a single user identifier In the entire set of real estate units, at most one mutually exclusive index bit in an occupied state can be held. This logic ensures that during the blind window period of asynchronous property rights comparison, system resources will not be maliciously exhausted by a single real-name entity, thus guaranteeing the fairness of the allocation of public voting resources.

[0033] Example 2: This example uses a distributed stress testing platform to simulate a multi-user concurrent voting environment. Random network latency parameters distributed between 20ms and 500ms and a 5% packet loss rate are injected into the data link of this testing platform. The effective constraint window value is determined based on the asynchronous verification callback latency and memory usage cycle. When the average response latency of the property management server exceeds a preset threshold, the effective constraint window value is reduced to release the system computing bus. According to this rule, under the test condition where the average response latency is set to 150ms, the effective constraint window value is set to 200ms. The testing platform sets up a comparison sample group and the present invention sample group and inputs the original concurrent voting data. The comparison sample group is configured with a conventional communication session caching mechanism, while the present invention sample group applies memory mutual exclusion isolation based on property unit identifiers. The mechanism, under the condition of 5000 concurrent requests per second, the test platform collected heap memory read and write logs. The raw log data showed that the peak of repeated write instructions for the same property unit identifier was 42 times per second. The sample of this invention used a one-way hash algorithm to extract terminal feature information to generate intention state data and mapped the property unit identifier as a mutex index bit. The underlying memory addressing data showed that the mutex index bit of the sample of this invention completed the physical state flip from idle state to occupied state within 2.5ms. When the mutex index bit is in the occupied state, it blocks the subsequent 41 conflicting instructions from rewriting the physical address of the intention state data. The measured memory overwrite rate was 0%. The heap memory overwrite rate of the comparison sample under the same network latency disturbance was 18.5%. The heap memory overwrite rate increased exponentially with the increase of concurrency.

[0034] During the asynchronous verification period, the test platform recorded the number of query commands output by the identity verification module to the external property management server and the document generation status. Monitoring data showed that the redundant query requests output by the comparison sample to the property management server were 4850 times per second, while the redundant query requests output by the present invention sample to the property management server were 0 times. The effective verification throughput of the system was maintained at 4950 times per second. An out-of-range control group with a constraint window parameter of 50ms was established. The test results showed that when the constraint window was set to 50ms, the time for the legality comparison signal to reach the system bus exceeded the window period. The cancellation of the mutual exclusion index bit in the bill generation module resulted in a 45.2% abandonment rate for the intention state data. The sudden change in the abandonment rate caused by the reduction of the constraint window indicates that the 200ms effective constraint window covers the 150ms asynchronous callback lag and maintains the isolation of the underlying data. The sample of this invention, through the memory mutual exclusion isolation mechanism based on the property unit identifier, coordinates with the effective constraint window to limit the write protection permission of the same property unit identifier in the memory address. Under the wide area network lag parameter and packet loss disturbance, this mechanism blocks conflicting writes and outputs effective bill signals, realizing the exclusive storage and state transition of voting intentions of multiple concurrent targets.

[0035] Example 3: This example combines Figures 1 to 2 This document describes an online voting system and method for community residents that supports a temporary vote-locking mechanism, such as... Figure 1 As shown, the system's workflow begins with the voting terminal module collecting intention data voting messages based on operator real-name verification but not yet completed with property identity association during the asynchronous verification period, and generating raw voting data. The raw voting data is then transmitted to the voting processing module for desensitization processing to extract identifiers and generate intention status data. The ticket locking and caching module establishes a mutual exclusion index bit lock based on the property unit identifier, and triggers the identity verification module to perform a legality comparison based on the occupancy of the mutual exclusion status. At the same time, the validity period control module is responsible for setting the valid constraint window and maintaining the occupancy of the mutual exclusion index bit. When the judgment logic of passing the legality comparison and the valid constraint window not expiring is met, the system drives the intention status data to migrate to the ballot storage area, and the ticket generation module finally completes the atomic storage.

[0036] like Figure 2 As shown, the system uses querying the status of the memory key value as the core judgment step. If the judgment result is that the mutex index bit is occupied, the system will, on the one hand, discard the original data of the current access voting, and on the other hand, the write protection unit associated with the dotted line will block the memory physical address rewriting permission to block the current memory address to maintain isolation. If the mutex index bit is judged or returns to the mutex index bit free state, its state switch is controlled by the cancellation instruction after the atomic evidence is completed, or by the cleanup action triggered by the forced release of the valid constraint window after it expires.

[0037] Example 4: In a voting scenario involving multi-generational inheritance of property rights, the response latency of the external property rights management server fluctuates due to limitations in its database concurrency performance. The system selects the validity period control module to calibrate validity period parameters to resolve the memory deadlock. The validity period control module sends a message to the external property rights management server. Group test messages are used to determine the asynchronous callback delay sequence, in which The value is 100; this validity period control module calculates the mean of the asynchronous callback delay sequence. and standard deviation Determine the effective constraint window based on the mean and standard deviation. The specific value is calculated using the following formula: ,in, To effectively constrain the window, This is the mean of the asynchronous callback delay sequence. The confidence factor has a value of 3. The standard deviation of the asynchronous callback delay sequence is set by this formula. The numerical coverage of the asynchronous verification callback latency of the external property rights management server allows the identity verification module to extract the original timestamp of the sending time from the transmission protocol header of the voting message before performing the legality comparison. It then uses a random number generator function synchronized with the voting terminal module to reconstruct the dynamic salt value at that specific time point on the server side. The identity verification module performs a secondary combination operation on the dynamic salt value and the static feature vector stored in the property rights management server's database to generate a temporary reference hash value that matches the current message environment and has a timeliness. This reference hash value is fully aligned with the anonymized credentials carried in the intention state data in both the time domain and logical dimension, thus supporting subsequent determination of whether the two are from the same source through binary XOR operation.

[0038] The identity verification module receives a list of co-owner mappings from an external property management server. This list uses a fixed-length hash array to store the hash values ​​of the legal owners corresponding to each property unit. Based on the principle of deterministic mapping of terminal fingerprints, the property management server pre-collects the baseband hardware identification codes of the authorized devices of each legal co-owner, inputs them into a one-way hash function to generate static feature vectors, and sets these as the hash values ​​of the legal owners. During the initial environment initialization phase, the voting terminal module reads the production serial number embedded in the baseband chip within the user-authorized secure isolation zone (TEE) by calling the AT command set interface (such as AT+CGSN) of the underlying communication firmware. Because this reading occurs in a trusted execution environment, the obtained hardware identifier is converted into an irreversible hash vector by the terminal's internal encryption engine. Furthermore, the application layer can only access the converted hash result and cannot access the original physical code, thus satisfying the privacy protection mechanism. This ensures the unique acquisition of hardware-level fingerprints. Based on the physical reality of dynamic variables carried by communication layer message characteristics, the data link layer configures interference elimination procedures to intercept network messages output by the voting terminal module, truncating the flow control sequence, routing hop count, and dynamic timestamp in the transmission protocol header, and stripping out the pre-authorization state same-source static baseband feature sequence. The identity verification module extracts the voter's anonymized credentials from the intention state data and converts them into a hash value to be verified. The identity verification module traverses a fixed-length hash array and calculates the XOR result between the hash value to be verified and each element in the array. If there is an XOR result of zero, the identity verification module determines that the legality comparison has passed and outputs a Boolean flag with a logical value of 1 to the ticket generation module; if there is no XOR result of zero, the identity verification module determines that the legality comparison has failed and outputs a Boolean flag with a logical value of 0 to the ticket generation module. The above comparison path performs identity matching verification based on the binary XOR result, and the validity period control module performs identity matching verification based on the measured... The duration for which the numerical value maintains the locked state ensures that the duration of the intention state data in memory covers the processing latency of the external property management server; this processing path blocks the mutual exclusion index bit cancellation operation caused by the lag in the verification signal, and realizes the storage of voting intentions in the voting situation with shared property rights.

[0039] Example 5: When the system faces concurrent deployment across multiple regions and the underlying hardware heap memory address space is non-uniform, the voting processing module initiates offline memory baseline mapping and encrypted salt injection before receiving the first raw voting data. The system selects a preset contiguous block of physical memory as a dedicated vote-locking storage pool, based on the preset maximum total number of property units. Allocate a memory addressing space with a fixed step size, where The initial dynamic salt value is generated by a constant positive integer obtained from the community property topology database. Simultaneously, the random number generator within the voting processing module extracts the XOR result of the server's network card's physical media access control address and the current system timestamp. The voting processing module writes this initial dynamic salt value into the one-way hash algorithm's operation register, ensuring the generated anonymized credentials maintain independent distribution of the ciphertext space across different physical server nodes. This pre-mapping and injection constructs a low-level isolation addressing benchmark and hash operation initial state based on hardware physical characteristics. After establishing the low-level isolation addressing benchmark and hash operation initial state, the ticket locking and caching module intercepts concurrent write commands targeting the same property unit identifier, extracts the target property unit identifier, and merges it with the initial dynamic salt value. The salt value initiates an irreversible mask operation to generate an addressing key. The ticket caching module directly maps the addressing key to the corresponding step-size mutex index bit in the dedicated ticket storage pool. When the conditions are met, such as the identity verification module outputting a Boolean flag with a logical value of 1 and the validity period control module setting a valid constraint window that has not expired, the ticket generation module reads the occupancy state characteristics of the mutex index bit and triggers the physical migration of the intended state data. It provides the ticket caching module with a zero-character matrix overwritten by the original pointer to erase the residual level signal of the original memory physical address. The above-mentioned low-level addressing and physical erasure cut off the logical path of reverse tracing the terminal feature information through memory snapshots, and establishes the response boundary of concurrent isolation instructions and the data destruction state at the system architecture level.

[0040] During the atomic storage phase of the ticket generation module, the system utilizes atomic exchange primitives provided by the processor instruction set to synchronously update state variables and reset physical addresses. When the ticket generation module detects a Boolean flag with a logical value of 1 from the identity verification module and the valid constraint window from the validity period control module has not expired, it locks the memory bus access cycle corresponding to the target mutex index bit. Within a single instruction cycle, it switches the memory address pointer pointing to the intended state data from the dedicated ticket storage pool to the ticket storage area. Based on the principle of physical latency isolation for direct memory access in hardware, the memory address pointer switching manifests as rewriting the logical status register in the CPU cache. The register level flip triggers an interrupt on the underlying peripheral interconnect standard PCIe bus, waking up the motherboard's independent direct memory access controller, which is decoupled from the main processor instruction pipeline. In the background, it asynchronously takes over the main memory controller to overwrite the underlying page table physical mapping entries and update the attribute control word. It absorbs the microsecond-level inherent clock hysteresis caused by the system kernel-mode handling of memory page write protection exceptions. In actual hardware deployment environments... The voting processing module establishes communication with the Hardware Abstraction Layer (HAL) through a pre-loaded kernel-mode dedicated driver. This driver has Ring 0 level execution privileges, enabling it to bypass the operating system's standard memory allocation API and directly access the memory controller's control registers. When the authentication pass signal is triggered to the interrupt controller by the processor pin, the driver sends a specially coded hardware interrupt request (IRQ) to the PCIe bus through the I / O port (MMIO) mapped to the memory space. This allows the DMA controller to complete the physical address replacement of the page table entry (PTE) through atomic bus lock operations without interference from kernel process scheduling. Simultaneously, it triggers the write protection unit inside the ticket lock cache module to revoke the rewrite blocking permission for the original memory physical address. This atomic logic ensures that during the transient process of the intended data migrating to persistent storage, the system does not respond to any external read / write requests for the property unit identifier, thus maintaining the indivisibility of voting state changes at the physical level.

[0041] Example 6: When the system faces boundary conditions such as high concurrency requests caused by centralized voting or continuous issuance of vote-locking instructions by abnormal nodes, the mutex index bits of the vote-locking cache module may experience hash collisions and present a risk of memory address pool exhaustion. Before deployment, the system initiates an offline optimization calibration procedure for the system's circuit breaker objective function. The test platform is configured with an offline test server, which continuously injects simulated voting requests conforming to the Poisson distribution characteristics into the vote-locking cache module. The monitoring probe of the vote-locking cache module extracts the hash collision rate triggered by the simulated voting requests. and the occupancy rate of mutex index bits The system processor calculates the system circuit breaker objective function based on the hash collision rate and occupancy rate. The corresponding mathematical calculation logic is presented as follows ,in, Let the system's circuit breaker objective function be... For hash collision rate, The occupancy rate of the mutex index bits. and These are dimensionless constant weighting coefficients set based on the physical memory bus bandwidth and the processor cache capacity, respectively.

[0042] In the actual performance calibration of this invention, the coefficient The value of is determined by measuring the instruction queuing latency of the memory bus under different concurrent loads, and it characterizes the weight of the impact of hash collisions on the system bus addressing efficiency; coefficient The value is determined by monitoring the trend of L3 cache miss rate as index usage increases. This value characterizes the degree to which memory pool saturation crowds out computing power allocation. When physical memory bandwidth redundancy is high but cache capacity is limited, the system increases... The value is chosen to trigger the circuit breaker in advance; conversely, if the core frequency is high but memory access bandwidth becomes the bottleneck, the value is increased. The value of is chosen to enhance sensitivity to hash collision risk; the system compares the objective function of the system circuit breaker. Compared with the set physical memory capacity limit, in the system circuit breaker target function When the physical capacity limit of memory is reached, the system extracts the current instantaneous concurrent request density and sets this instantaneous concurrent request density as the static circuit breaker threshold. During the period when the system is in the online sending and receiving state, the ticket locking cache module counts the number of voting write requests in the sliding monitoring window in real time. When it is determined that the number of voting write requests exceeds the static circuit breaker threshold, the ticket locking cache module sends a hardware-level blocking signal to the underlying network controller. The underlying network controller directly discards the communication packets of the abnormal source at the driver layer. The blocking signal maintains effective computing power allocation and reserves physical read and write space for the memory mutual exclusion mapping path of the normal intention state data volume.

[0043] It will be apparent to those skilled in the art that the present invention is not limited to the details of the exemplary embodiments described above, and that the present invention can be implemented in other specific forms without departing from the spirit or essential characteristics of the present invention.

[0044] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit it. Although the present invention has been described in detail with reference to preferred embodiments, those skilled in the art should understand that modifications or equivalent substitutions can be made to the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention.

Claims

1. A community homeowners' online voting system supporting a temporary vote-locking mechanism, characterized in that, include: The voting terminal module is used to perform operator verification of three key elements: name, ID number, and mobile phone number. After the verification is successful, it collects real-name voting messages and generates raw voting data. The voting processing module is used to receive the original voting data and parse and extract the property unit identifier. The voting processing module uses a one-way desensitization algorithm to desensitize the original voting data to remove terminal feature information and generate intention status data representing the intention status of the ownership target. The ticket locking cache module is used to establish a mutual exclusion index bit in the memory address space based on the property unit identifier and synchronously retrieve the current occupancy status of the user identity identifier. If the mutual exclusion index bit corresponding to the property unit identifier is in an idle state and the user identity identifier is not associated with other unconfirmed intentions in the current ticket locking period, the amount of intention status data is locked through the mutual exclusion index bit. The identity verification module is used to perform concurrent queries on the property rights association database during the asynchronous verification period. The identity verification module triggers a legality comparison process for the amount of data in the intended state based on the occupancy status of the mutual exclusion index bit. The validity period control module is used to set a validity constraint window that decreases over time for the amount of intention status data. The validity period control module communicates with the ticket locking cache module to maintain the state occupancy of the mutual exclusion index bit. The ballot generation module is used to realize the directional migration of intention status data to the ballot storage area. When the judgment logic of valid constraint window not being overdue and legality comparison being passed is met, the ballot generation module releases the write protection permission of memory address space to complete the atomic storage of voting intention and generate a valid ballot signal.

2. The online voting system for community owners supporting a temporary vote-locking mechanism according to claim 1, characterized in that, The ticket locking and caching module adopts a hash table-based concurrent access control mechanism. The module maps property unit identifiers to globally unique memory key values ​​and queries the mutex index corresponding to the memory key value when processing the intention state data. If the mutex index is in an idle state, it flips the mutex index to an occupied state and loads the intention state data. If the mutex index is in an occupied state, it discards the currently accessed original voting data. This ensures that each property unit identifier has only a unique intention data state in the memory address space before the asynchronous feedback result from the property rights association database is returned.

3. The online voting system for community owners supporting a temporary vote-locking mechanism according to claim 1, characterized in that, The voting processing module performs the following desensitization process: Step 31, extracting communication layer message features and business layer load features from the original voting data; Step 32, using a one-way hash algorithm to perform irreversible masking on the communication layer message features to generate anonymized credentials; Step 33, separating the property unit identifier and voting option variable from the business layer load features, and encapsulating the property unit identifier, voting option variable, and anonymized credentials into intention state data.

4. The online voting system for community owners supporting a temporary vote-locking mechanism according to claim 1, characterized in that, The process of the identity verification module performing legality comparison includes: Step 41, initiating an asynchronous query request containing the property unit identifier to the external property management server; Step 42, receiving the co-owner mapping list returned by the property management server; Step 43, performing topological matching between the identity declaration information recorded in the intention status data and the co-owner mapping list, and feeding back a Boolean flag indicating that the legality comparison has passed when the matching is successful to the ticket generation module.

5. A community homeowner online voting system supporting a temporary vote-locking mechanism as described in claim 1, characterized in that, The validity period control module is also used to clean up expired cache. When the validity period control module detects that the valid constraint window has expired and the legality comparison has not returned a success signal, it sends a forced release instruction to the ticket lock cache module to clear the corresponding mutex index bit in the memory address space.

6. A community homeowners' online voting system supporting a temporary vote-locking mechanism as described in claim 1, characterized in that, The ticket locking cache module also includes a write protection unit, which is used to block the rewrite permission for the physical memory address where the intended state data is located while the mutex index bit is in the occupied state, until atomic storage is completed or a forced release instruction is received from the validity period control module.

7. A community homeowner online voting system supporting a temporary vote-locking mechanism as described in claim 1, characterized in that, After the ticket generation module completes atomic notarization, it sends a successful notarization receipt of the intention status data to the voting terminal module and instructs the ticket locking cache module to cancel the corresponding mutex index bit.

8. A community homeowner online voting system supporting a temporary vote-locking mechanism according to claim 1, characterized in that, The system also includes a load balancing unit, which is connected to the front end of the voting processing module and is used to schedule the access rate of the raw voting data according to the real-time memory throughput pressure of the vote caching module.

9. A community homeowners' online voting system supporting a temporary vote-locking mechanism according to claim 1, characterized in that, The bill generation module also includes a result disclosure unit, which is used to convert the intention status data into a desensitized disclosure message and send it to the public display area after the atomic evidence storage is completed, so as to realize the public disclosure of the voting results.

10. A method for online voting by community homeowners supporting a temporary vote-locking mechanism, used to implement the online voting system for community homeowners as described in claim 1, characterized in that, Includes the following steps: Step 1001: Collect raw voting data and generate voting messages; Step 1002: Parse and extract the property unit identifier, and remove terminal feature information by desensitizing the original voting data, thereby generating the intention status data volume; Step 1003: Establish a mutex index in the memory address space based on the property unit identifier, and use the mutex index to lock a unique amount of intentional state data in order to establish a data isolation environment during the asynchronous verification period. Step 1004: During the asynchronous verification period, compare the property rights association database and initiate a legality comparison process for the amount of data in the intended state based on the occupancy status of the mutual exclusion index bit. Step 1005: Set an effective constraint window that decreases over time for the amount of intention state data, and protect memory resources by maintaining the state occupancy of the mutual exclusion index bit. Step 1006: When the valid constraint window has not expired and the legality comparison is passed, release the write protection permission of the memory address space, realize the atomic storage of voting intention to the ballot storage area and generate a valid ballot signal.

Images