A financial resource allocation method and device and related equipment

Abstract

The application provides a financial resource allocation method and device and related equipment, relates to the field of resource management, and is suitable for the field of financial technology. The method comprises the following steps: obtaining reserved financial resources; configuring corresponding candidate codes for a first number of participating objects; performing splitting processing on each candidate code to obtain a corresponding candidate code group; wherein the candidate code group comprises at least one candidate sub-code; in response to a participating object completing a preset participation task, distributing a candidate sub-code of the candidate code group to the corresponding participating object; in response to a preset exchange condition being met, generating a target resource exchange code; matching the target resource exchange code with each candidate code to determine a resource allocation object as a participating object that matches the candidate code to the target resource exchange code; and in response to all candidate sub-codes of the candidate code group being distributed to the resource allocation object, distributing the reserved financial resources to the resource allocation object. The application can improve the flexibility of financial resource allocation.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of resource management, and is suitable for the field of financial technology, and in particular relates to a financial resource allocation method and device and related equipment. BACKGROUND

[0002] In the field of financial services, in order to achieve fair allocation and efficient management of various financial resources (such as wealth management product shares, coupons, credit limits, etc.), financial institutions usually adopt a technical solution of allocation codes. The allocation code is a digital voucher for identifying and managing resource allocation rights, which realizes the allocation of financial resources by allocating a unique allocation code to a user and establishing a mapping relationship between the allocation code and a specific resource.

[0003] However, the traditional allocation code usually adopts a single long string form, and in the scenario of large-scale user participation, the system needs to handle a large number of complete allocation codes at the same time, resulting in a long time-consuming process of code generation, storage and verification, and it is difficult to realize flexible allocation. Therefore, how to optimize the technical solution of the allocation code to realize flexible allocation of financial resources has become a technical problem to be solved. SUMMARY

[0004] The main purpose of the embodiments of the present application is to propose a financial resource allocation method, device and related equipment, aiming to improve the flexibility of financial resource allocation.

[0005] To achieve the above-mentioned purpose, the first aspect of the embodiments of the present application proposes a financial resource allocation method, which comprises:

[0006] Obtaining reserved financial resources;

[0007] Configuring a corresponding candidate code for a first number of participating objects;

[0008] Splitting each candidate code to obtain a corresponding candidate code group; wherein the candidate code group contains at least one candidate sub-code;

[0009] In response to the participating object completing a preset participation task, distributing the candidate sub-codes of the candidate code group to the corresponding participating object;

[0010] In response to a preset exchange condition being met, generating a target resource exchange code;

[0011] Based on the matching of the target resource exchange code and each candidate code, determining the participating object whose candidate code is matched to the target resource exchange code as a resource allocation object;

[0012] In response to all candidate sub-codes of the candidate code group being distributed to the resource allocation object, allocating the reserved financial resources to the resource allocation object.

[0013] In some embodiments, the splitting each of the candidate codes to obtain a corresponding candidate code group comprises:

[0014] Obtaining task configuration information, wherein the task configuration information comprises a preset number of tasks to be participated in;

[0015] Based on the preset number of tasks to be participated in, determining the number of candidate sub-codes contained in the candidate code group;

[0016] According to the number of candidate sub-codes, the candidate codes are split to obtain the corresponding candidate code group;

[0017] Each candidate sub-code in the candidate code group is mapped to a preset task to be participated in.

[0018] In some embodiments, the candidate sub-codes of the candidate code group are distributed to the corresponding participating object in response to the participating object completing a preset task to be participated in, comprising:

[0019] Obtaining the task completion state of the participating object in real time;

[0020] In response to detecting that the participating object completes any of the preset tasks to be participated in, the candidate sub-code corresponding to the preset task to be participated in is obtained according to the mapping relationship;

[0021] The candidate sub-code is distributed to the participating object.

[0022] In some embodiments, in response to detecting that the participating object completes any of the preset tasks to be participated in, further comprising:

[0023] Obtaining the task completion record of the participating object, wherein the task completion record comprises the completion time of each of the preset tasks to be participated in and the completion device information of each of the preset tasks to be participated in;

[0024] When the completion time of the preset task to be participated in is less than a minimum completion time threshold, or when the same preset task to be participated in is performed on multiple different devices at the same time, it is determined that the participating object has abnormal behavior;

[0025] The participating object is marked as a restricted object, and the candidate sub-codes are prohibited from being distributed to the restricted object;

[0026] The multiple candidate sub-codes obtained by the restricted object are marked as invalid.

[0027] In some embodiments, the matching the target resource exchange code with each of the candidate codes to match the candidate code to the participating object of the target resource exchange code is determined as a resource allocation object, comprising

[0028] Obtaining preset resource allocation level configuration information, wherein the resource allocation level configuration information comprises a plurality of allocation levels, and each allocation level corresponds to different matching bit number requirements;

[0029] Comparing the candidate code with the target resource exchange code bit by bit to obtain the matching bit number;

[0030] Determining the target allocation level corresponding to the candidate code based on the matching bit number and the resource allocation level configuration information;

[0031] Determining the participating object of the candidate code with the target allocation level as the resource allocation object.

[0032] In some embodiments, the resource reserve is allocated to the resource allocation object in response to all candidate sub-codes of the candidate code group being distributed to the resource allocation object, comprising:

[0033] Obtaining a candidate code group corresponding to the resource allocation object;

[0034] Detecting the distribution state of the candidate sub-codes in the candidate code group;

[0035] Judging whether all candidate sub-codes in the candidate code group are in the distributed state;

[0036] When all candidate sub-codes in the candidate code group are in the distributed state, the resource reserve is allocated to the resource allocation object based on the target allocation level;

[0037] When there is a candidate sub-code in the candidate code group in the undistributed state, the distributed candidate sub-codes in the candidate code group are marked as invalid state.

[0038] In some embodiments, the target resource exchange code is generated in response to the preset exchange condition being met, comprising:

[0039] Obtaining a preset exchange condition threshold, wherein the exchange condition threshold comprises a time threshold and a number threshold;

[0040] Real-time detecting the number of participating objects and the time interval from the last time the target resource exchange code is generated;

[0041] When the number of the participating objects reaches the number threshold, or the time interval since the last generation of the target resource redemption code reaches the time threshold, generating the target resource redemption code based on the target resource redemption code generation rule;

[0042] The target resource redemption code is stored and sent to the participating object.

[0043] To achieve the above-mentioned purpose, a second aspect of an embodiment of the present application provides a financial resource allocation device, the device comprising:

[0044] Acquisition module, used to obtain reserve financial resources;

[0045] a configuration module, configured to configure corresponding candidate codes for a first number of participants;

[0046] a splitting module, configured to split each candidate code to obtain a corresponding candidate code group; wherein the candidate code group includes at least one candidate subcode;

[0047] a distribution module, configured to distribute the candidate sub-codes of the candidate code group to the corresponding participant in response to the participant completing a preset participation task;

[0048] A generating module, configured to generate a target resource redemption code in response to a preset redemption condition being met;

[0049] a matching module, configured to match the target resource redemption code with each candidate code, so as to determine the participant having the candidate code matched with the target resource redemption code as a resource allocation object;

[0050] An allocation module is configured to allocate the reserve financial resources to the resource allocation object in response to all the candidate sub-codes of the candidate code group being distributed to the resource allocation object.

[0051] To achieve the above-mentioned purpose, the third aspect of an embodiment of the present application proposes an electronic device, which includes a memory and a processor, wherein the memory stores a computer program, and the processor implements the method described in the first aspect when executing the computer program.

[0052] To achieve the above-mentioned purpose, the fourth aspect of the embodiments of the present application proposes a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, it implements the method described in the first aspect.

[0053] The financial resource allocation method, device and related equipment provided by the application obtain reserved financial resources, configure corresponding candidate codes for a first number of participating objects, split each candidate code to obtain a corresponding candidate code group, wherein the candidate code group contains at least one candidate sub-code, distribute the candidate sub-codes of the candidate code group to the corresponding participating object in response to the participating object completing a preset participation task, generate a target resource exchange code in response to a preset exchange condition being met, match the target resource exchange code with each candidate code to determine the participating object whose candidate code matches the target resource exchange code as a resource allocation object, and allocate the reserved financial resources to the resource allocation object in response to all candidate sub-codes of the candidate code group being distributed to the resource allocation object.

[0054] According to the financial resource allocation method provided by the application, the reserved financial resources are first obtained and the candidate codes are configured for the participating objects, then the management of a single code is changed into the dispersed management of multiple sub-codes by splitting the candidate codes into multiple candidate sub-codes and forming the candidate code groups, so that the allocation and tracking are more flexible and controllable, meanwhile, the controllability of resource allocation is realized by the mechanism of binding the candidate sub-codes with the completion of the preset participation task, then the target resource exchange code is generated based on the preset exchange condition, and the resource allocation object is determined through the strict code matching process, finally, the integrity of the allocation process is ensured by verifying the distribution state of all candidate sub-codes in the candidate code group. Through the above method, the flexibility of financial resource allocation can be improved. BRIEF DESCRIPTION OF DRAWINGS

[0055] Figure 1 is a flowchart of the financial resource allocation method provided by the embodiment of the application;

[0056] Figure 2 is another flowchart of the financial resource allocation method provided by the embodiment of the application;

[0057] Figure 3 is another flowchart of the financial resource allocation method provided by the embodiment of the application;

[0058] Figure 4 is another flowchart of the financial resource allocation method provided by the embodiment of the application;

[0059] Figure 5 is another flowchart of the financial resource allocation method provided by the embodiment of the application;

[0060] Figure 6 is another flowchart of the financial resource allocation method provided by the embodiment of the application;

[0061] Figure 7 is another flowchart of the financial resource allocation method provided by the embodiment of the application;

[0062] Figure 8 FIG. 1 is a structural schematic diagram of a financial resource allocation apparatus provided by an embodiment of the present application;

[0063] Figure 9 FIG. 2 is a hardware structural schematic diagram of an electronic device provided by an embodiment of the present application. DETAILED DESCRIPTION

[0064] In order to make the objectives, technical solutions and advantages of the present application clearer, the present application will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and should not be used to limit the present application.

[0065] It should be noted that although the functional modules are divided in the apparatus schematic diagram and the logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in a manner different from the module division in the apparatus or the order in the flowchart. The terms "first", "second", and the like in the specification and claims and the above-described drawings are used to distinguish similar objects, and do not necessarily describe a specific order or sequence.

[0066] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which the present application belongs. The terms used herein are only for the purpose of describing the embodiments of the present application and are not intended to limit the present application.

[0067] Therefore, the embodiments of the present application provide a financial resource allocation method, apparatus and related device, which aims to improve the flexibility of financial resource allocation.

[0068] The financial resource allocation method, apparatus and related device provided by the embodiments of the present application are specifically described by the following embodiments. First, the financial resource allocation method in the embodiments of the present application is described.

[0069] The financial resource allocation method provided by the embodiments of the present application relates to the field of lottery management. The financial resource allocation method provided by the embodiments of the present application can be applied to a terminal, can be applied to a server side, and can also be software running in a terminal or a server side. In some embodiments, the terminal can be a smart phone, a tablet computer, a notebook computer, a desktop computer, etc.; the server side can be configured as a stand-alone physical server, can be configured as a server cluster or a distributed system composed of multiple physical servers, can also be configured as a cloud server providing basic cloud computing services such as cloud service, cloud database, cloud computing, cloud function, cloud storage, network service, cloud communication, middleware service, domain name service, security service, CDN, and big data and artificial intelligence platform; and the software can be an application for implementing the financial resource allocation method, etc., but is not limited to the above forms.

[0070] The application is operable in a variety of general purpose or special purpose computer systems environments or configurations. Examples of well-known computing systems, environments, and / or configurations that can be suitable for use with the application include personal computers, server computers, handheld or laptop devices, tablet devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like. The application can be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, and the like, that perform particular tasks or implement particular abstract data types. The application can also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules can be located in both local and remote computer storage media including memory storage devices.

[0071] It should be noted that in each of the specific embodiments of the present application, when it is necessary to perform relevant processing according to user information, user behavior data, user historical data, and user location information, and other data related to the identity or characteristics of the user, the user's permission or consent will be obtained first, and the collection, use, and processing of such data will comply with relevant laws, regulations, and standards. In addition, when the embodiments of the present application need to obtain sensitive personal information of the user, the separate permission or separate consent of the user will be obtained through a pop-up window or by jumping to a confirmation page, and after obtaining the separate permission or separate consent of the user, the necessary user-related data for enabling the embodiments of the present application to function normally will be obtained.

[0072] Figure 1 is an optional flowchart of the financial resource allocation method provided by the embodiments of the present application, Figure 1 The method in the above embodiment can include, but is not limited to, steps S101 to S107.

[0073] Step S101, obtaining reserved financial resources.

[0074] Step S102, configuring a corresponding candidate code for each of the first number of participating objects.

[0075] Step S103, performing splitting processing on each candidate code to obtain a corresponding candidate code group; wherein the candidate code group contains at least one candidate sub-code.

[0076] Step S104, in response to the participating object completing a preset participation task, distributing a candidate sub-code of the candidate code group to the corresponding participating object.

[0077] Step S105, in response to a preset exchange condition being met, generating a target resource exchange code.

[0078] Step S106, based on the target resource exchange code and each candidate code, the candidate code is matched to the target resource exchange code to determine the candidate code as the resource allocation object.

[0079] Step S107, in response to all candidate sub-codes of the candidate code group being distributed to the resource allocation object, the resource allocation object is allocated the reserve financial resource.

[0080] The steps S101 to S106 shown in the embodiments of the present application first acquire the reserve financial resource and configure the candidate code for the participant; then, by splitting the candidate code into multiple candidate sub-codes and forming a candidate code group, the management of a single code is changed to the dispersed management of multiple sub-codes, realizing more flexible and controllable allocation and tracking; at the same time, through the mechanism of binding the candidate sub-code with the preset participation task completion, the controllability of resource allocation is realized; then, based on the preset exchange condition, the target resource exchange code is generated, and the resource allocation object is determined through the strict code matching process; finally, by verifying the distribution state of all candidate sub-codes in the candidate code group, the integrity of the allocation process is ensured. Through the above method, the present application can improve the flexibility of financial resource allocation.

[0081] In step S101 of some embodiments, a financial resource pool can be pre-set, which contains different types of financial resources to be allocated. The reserve financial resource can include but is not limited to cash red packets, gift cards, coupons, etc. Specifically, the acquisition of the reserve financial resource can include the following steps:

[0082] First, set the resource type and quantity of the financial resource pool. For example, a financial resource pool containing 1000 cash red packets and 500 gift cards can be set. The specific attributes of each cash red packet, such as the amount of each cash red packet, the face value of each gift card, etc. can be configured according to actual business needs.

[0083] Second, configure the allocation rules of the financial resource. The allocation rules are used to limit the allocation range of the financial resource, including but not limited to: the validity period of each financial resource, the maximum number of resources allocated at a time, the proportion limit of the total allocation, etc. For example, the validity period of the cash red packet can be set to 30 days, and the maximum number of resources allocated at a time can be set to 10.

[0084] Finally, acquire the reserve financial resource that meets the allocation rules from the financial resource pool. For example, according to the preset allocation rules, 50 cash red packets and 30 gift cards are acquired as the reserve financial resource to be allocated this time. The number and state information of the reserve financial resource is recorded and updated in real time to ensure the accuracy of resource allocation.

[0085] In step S102 of some embodiments, after obtaining the reserve financial resource, the corresponding candidate code needs to be configured for the participating object. Wherein, the first number is used to limit the number range of the participating object, which can be configured according to the actual business demand. For example, the first number can be set to 100, indicating that 100 participating objects are allowed to participate in this resource allocation activity.

[0086] Secondly, a candidate code is configured for each participating object. Optionally, a unique candidate code can be generated for each participating object based on a preset candidate code generation rule. For example, a candidate code in the form of "ABC123XYZ789" can be generated. Optionally, a candidate code can also be randomly selected from a preset candidate code pool and assigned to a participating object. Wherein, a candidate code can only be assigned to one participating object, and a participating object can be assigned multiple candidate codes.

[0087] Finally, the corresponding relationship between the participating object and the candidate code is recorded, and the mapping relationship between each participating object and its corresponding candidate code is recorded to ensure the uniqueness of the candidate code allocation. Through the implementation of step S102, the candidate code can be flexibly configured for the participating object, providing basic data support for subsequent splitting processing.

[0088] In step S103 of some embodiments, after configuring the candidate code for the participating object, each candidate code needs to be split, for example, a complete candidate code can be split into 3 candidate sub-codes, which together constitute a candidate code group. Wherein, the number of splitting can be configured according to the actual business demand. Secondly, the candidate code is split according to the splitting rule. At the same time, the mapping relationship between each candidate code and its corresponding candidate code group is recorded, including all candidate sub-code information contained in the candidate code group, which is convenient for subsequent distribution management.

[0089] Please refer to Figure 2 In some embodiments, step S103 can include but is not limited to steps S201 to S204:

[0090] Step S201, obtaining task configuration information.

[0091] Step S202, determining the number of candidate sub-codes contained in the candidate code group based on the number of participating tasks.

[0092] Step S203, splitting the candidate code according to the number of candidate sub-codes to obtain the corresponding candidate code group.

[0093] Step S204, establishing a corresponding mapping relationship between each candidate sub-code in the candidate code group and a preset participating task.

[0094] In step S201 of some embodiments, the task configuration information includes a preset number of participating tasks. Specifically, configuration parameters related to activities can be preset in a configuration table, including but not limited to: a preset number of participating tasks, a preset type of participating tasks, etc. For example, three preset participating tasks can be set: daily check-in, inviting friends, and purchasing goods. Before performing candidate code splitting, these configuration information needs to be obtained first.

[0095] In step S202 of some embodiments, according to the obtained preset number of participating tasks, the number of candidate sub-codes that the candidate code needs to be split into is determined. Specifically, the number of candidate sub-codes can be set to be equal to the number of preset participating tasks, that is, one candidate sub-code corresponds to one preset participating task. For example, when three preset participating tasks are configured, the candidate code is split into three candidate sub-codes. Through this one-to-one correspondence, the completion of each task can obtain the corresponding candidate sub-code.

[0096] In step S203 of some embodiments, according to the determined number of candidate sub-codes, the candidate code is split by using a preset splitting rule. Optionally, an equal-length splitting method can be used. For example, for a 12-bit candidate code "A1B2C3D4E5F6", when the number of tasks is 3, each candidate sub-code contains 4 bits: "A1B2", "C3D4", "E5F6". Optionally, an unequal-length splitting method can also be used. For example, for a 10-bit candidate code "A1B2C3D4EF", different bit lengths can be allocated according to the importance of the task to obtain "A1B2", "C3D", and "4EF". During the splitting process, the starting position and ending position information of each candidate sub-code in the original candidate code needs to be recorded.

[0097] Each candidate sub-code is in a one-to-one correspondence with a specific preset participating task. This one-to-one correspondence ensures that the user can obtain the corresponding candidate sub-code after completing a specific task, so the mapping relationship between the sub-code and the task also needs to be established and maintained during the splitting process.

[0098] The following are possible implementation manners:

[0099] Implementation manner one: equal-length splitting. For a 12-bit candidate code "A1B2C3D4E5F6", when the number of preset participating tasks is 3, first, the number of bits that each sub-code should contain is calculated: 12÷3=4 bits, and then splitting is performed according to 4 bits:

[0100] The first sub-code: "A1B2", position information: 1-4 bits;

[0101] The second sub-code: "C3D4", position information: 5-8 bits;

[0102] The third sub-code is "E5F6", and the position information is 9-12 bits.

[0103] Next, the matching relationship between the sub-codes and the tasks is established.

[0104] The "A1B2" corresponds to the "daily sign-in" task.

[0105] The "C3D4" corresponds to the "invite friends" task.

[0106] The "E5F6" corresponds to the "purchase goods" task.

[0107] Embodiment two: unequal length segmentation, for a 10-bit candidate code "A1B2C3D4EF", when the preset number of participating tasks is 3:

[0108] First, the number of bits can be allocated according to the importance of the task:

[0109] The important task is allocated 4 bits.

[0110] The general task is allocated 3 bits.

[0111] The simple task is allocated 3 bits.

[0112] Then, the segmentation is performed according to the plan:

[0113] The first sub-code is "A1B2", and the position information is 1-4 bits.

[0114] The second sub-code is "C3D", and the position information is 5-7 bits.

[0115] The third sub-code is "4EF", and the position information is 8-10 bits.

[0116] The position information and the task matching relationship are recorded at the same time.

[0117] During the segmentation process, the following information of each sub-code needs to be recorded synchronously: sub-code content, starting position and ending position in the corresponding candidate code, corresponding preset participating task identifier, and sub-code state (initially in an undistributed state)

[0118] Through steps S201 to S203, the embodiment of the application realizes segmentation of the candidate code based on the preset participating task, so that each sub-code establishes a corresponding relationship with a specific task, providing a reliable foundation for subsequent distribution and combination verification. This segmentation mechanism not only guarantees the integrity of the candidate code, but also realizes close combination with the preset participating task.

[0119] In step S104 of some embodiments, after the candidate code is split, the task completion of the participating object can be obtained in real time. First, the task completion state of the participating object is detected. For example, when it is detected that the participating object has completed the "daily check-in" task, the distribution process of the candidate sub-code is triggered. Second, the candidate sub-code that has a mapping relationship with the completed task is obtained. According to the mapping relationship established in step S204, the candidate sub-code corresponding to the preset participating task is determined. For example, when the participating object completes the "daily check-in" task, the system obtains the candidate sub-code "A1B2" corresponding to the task. Finally, the obtained candidate sub-code is distributed to the participating object, and the state of the candidate sub-code is updated, and the distribution state of the candidate sub-code is recorded as having been distributed, and the distribution time, the distribution object and other information are recorded.

[0120] Through the implementation of step S104, the present application associates the distribution of the candidate sub-code with the task completion, so that the participating object needs to complete the corresponding preset participating task to obtain the candidate sub-code, thereby improving the flexibility of resource allocation.

[0121] Please refer to Figure 3 In some embodiments, step S104 can include but is not limited to steps S301 to S303:

[0122] Step S301, the task completion state of the target user is obtained in real time.

[0123] Step S302, in response to detecting that the target user has completed any preset participating task, the candidate sub-code corresponding to the preset participating task is obtained according to the mapping relationship;

[0124] Step S303, the candidate sub-code is distributed to the participating object.

[0125] In step S301 of some embodiments, the execution of the preset participating task by the user can be captured in real time through timing polling or event listening. For example, when the user clicks on the task button, browses a specified page, or completes a specific operation, the relevant behavior will be captured in time and converted into a task completion state. This real-time acquisition mechanism provides a trigger basis for subsequent sub-code distribution.

[0126] In step S302 of some embodiments, when it is detected that the user has completed any one of the preset participating tasks, the subsequent retrieval operation is immediately started. For example, when it is detected that the user has completed the "daily check-in" task, the sub-code retrieval process corresponding to the task will be triggered immediately. In specific implementation, the following methods can be used:

[0127] Suppose the candidate code is a 12-character string "A1B2C3D4E5F6", and the candidate code has been divided into 3 sub-codes according to the number of preset participating tasks:

[0128] The first sub-code "A1B2" corresponds to the "daily sign-in" task.

[0129] The second sub-code "C3D4" corresponds to the "invite friends" task.

[0130] The third sub-code "E5F6" corresponds to the "purchase goods" task.

[0131] When the user completes the "daily sign-in" task, the sub-code "A1B2" matching the "daily sign-in" task will be called from the code pool.

[0132] Please refer to Figure 4 In some embodiments, step S302 can include, but is not limited to, steps S401-S404:

[0133] Step S401, obtaining the task completion record of the participating object.

[0134] Step S402, when the completion time of the preset participating task is less than the minimum completion time threshold, or when the same preset participating task is simultaneously performed on multiple different devices, it is determined that the participating object has abnormal behavior.

[0135] Step S403, marking the participating object as a restricted object, and prohibiting the distribution of candidate sub-codes to the restricted object.

[0136] Step S404, marking the multiple candidate sub-codes obtained by the restricted object as invalid.

[0137] In step S401 of some embodiments, the task completion record mainly contains information of two core dimensions: completion time and completion device information. Among them, the completion time refers to the time interval from the beginning of the user performing the task to the completion of the task, which can be accurately recorded to seconds or milliseconds, and is used to accurately judge the rationality of task completion. For example, for a task that requires watching a 3-minute video, the actual time from the start of the video to the end of the video will be recorded. The completion device information contains multiple characteristic data of the device, including the unique identification code of the device, the device type, the specific model, the operating system version, and the network environment information. The collection of these device information provides a reliable data basis for subsequent cheating behavior judgment.

[0138] In step S402 of some embodiments, a dual fraud judgment mechanism based on time dimension and device dimension is constructed. On the time dimension, minimum completion time thresholds are set for different types of preset participation tasks. For example, the minimum completion time for a video watching task can be set to 90% of the video duration, the minimum completion time for a product browsing task can be set to 30 seconds, and the minimum completion time for a questionnaire filling task can be dynamically calculated based on the number of questions. When the actual completion time of a user is lower than the preset threshold, fraud judgment is triggered. On the device dimension, by analyzing the task execution of a user on different devices, the time overlap of task execution is focused on. When it is found that the same user executes tasks on multiple devices at the same time or the switching frequency between devices is abnormal, fraud judgment is also triggered.

[0139] In step S403 of some embodiments, when a user is judged to have fraud behavior, strict blacklist management measures are performed. First, a blacklist flag is added to the user information, and the specific time of joining the blacklist and the triggering reason are recorded. Second, a mapping relationship between the user and the associated account is established to prevent evasion of restrictions by changing the account. For the users on the blacklist, comprehensive restriction measures are implemented, including prohibition of obtaining new candidate sub-codes, restriction of participating in new preset participation tasks, and continuous recording of subsequent behaviors of the user to provide basis for subsequent risk control optimization.

[0140] In step S404 of some embodiments, in the sub-code state processing aspect, the related candidate sub-codes of the users on the blacklist are marked as invalid, and the invalid time and reason are recorded in detail. In the associated data processing aspect, the association between the candidate sub-codes and the users needs to be updated, the validity flag of the candidate sub-codes is cleared, and the binding relationship between the candidate sub-codes and the preset participation tasks is removed.

[0141] Through steps S401 to S404, the embodiments of the present application construct a complete anti-fraud protection mechanism. The mechanism improves the accuracy of fraud behavior identification through multi-dimensional data collection and multiple judgment standards, effectively blocks the continuous occurrence of fraud behavior through perfect blacklist management and candidate sub-code invalidation measures, and ensures the traceability of the entire anti-fraud process through standardized data processing procedures. This multi-level protection mechanism not only effectively prevents users from obtaining candidate sub-codes through technical means or other abnormal ways, but also fundamentally guarantees the fairness of resource allocation.

[0142] In step S303 of some embodiments, the distribution operation can be performed after the appropriate candidate sub-code is retrieved. The distribution process includes establishing the association between the candidate sub-code and the user, and updating the distribution state of the candidate sub-code. The distribution information will be recorded in the database, including the distribution time, candidate sub-code content, user identification, and other key data. These records not only prevent repeated distribution, but also provide a basis for subsequent data statistics and state inquiries. Timely updating of the candidate sub-code state ensures the rigor and traceability of the distribution process.

[0143] Through steps S301 to S303, the mechanism for real-time acquisition of task completion status ensures the timeliness of candidate sub-code distribution, and the retrieval mechanism based on task triggering realizes precise control of candidate sub-code distribution. By establishing a correspondence between the candidate sub-code and the specific task, it is ensured that each distributed candidate sub-code strictly corresponds to the completed task, avoiding confusion in candidate sub-code distribution. The introduction of the candidate sub-code state marking mechanism ensures the uniqueness of candidate sub-code distribution. By marking the state of the distributed candidate sub-code, repeated distribution of candidate sub-codes is effectively prevented, improving the fairness of the draw activity.

[0144] In step S105 of some embodiments, the "preset draw time" refers to a previously determined draw node, which can be a specific time point or a time triggered by a specific condition. The combination of candidate sub-codes is the process of reassembling scattered sub-codes into complete candidate codes. The following key elements need to be considered when combining: First, determine the correct combination order according to the position information of the sub-code. For example, for the candidate code "A1B2-C3D4-E5F6" divided into three segments, the three sub-codes need to be spliced in the correct order according to the position identifier.

[0145] In step S105 of some embodiments, the generation of the target resource exchange code needs to be triggered according to the preset exchange condition. Specifically, the trigger condition can be set based on time and number of people to ensure the timeliness and reasonableness of the resource allocation process.

[0146] Please refer to Figure 5 In some embodiments, step S105 can also include, but is not limited to, steps S501 to S503:

[0147] Step S501, obtain the preset exchange condition threshold.

[0148] Step S502, real-time detection of the number of participants and the time interval from the last generation of the target resource exchange code.

[0149] Step S503, when the number of participants reaches the number threshold, or the time interval from the last generation of the target resource exchange code reaches the time threshold, generate the target resource exchange code based on the target resource exchange code generation rule.

[0150] In step S501 of some embodiments, the exchange condition threshold includes a time threshold and a number threshold; the time threshold is used to define a minimum time interval between two adjacent times of generating the target resource exchange code, and the number threshold is used to define a minimum number of participating objects required to trigger the generation of the target resource exchange code. For example, the time threshold can be set to 24 hours, and the number threshold can be set to 50 people.

[0151] In step S502 of some embodiments, the number of participating objects and the time interval from the last time of generating the target resource exchange code are detected in real time. The system continuously counts the current number of participating objects and calculates the time difference from the last time of generating the target resource exchange code to determine whether the triggering condition is met.

[0152] In step S503 of some embodiments, when the number of participating objects reaches the number threshold, or the time interval from the last time of generating the target resource exchange code reaches the time threshold, the target resource exchange code is generated based on the target resource exchange code generation rule. When any triggering condition is met, a new target resource exchange code will be generated according to the preset target resource exchange code generation rule. After generation, the system stores the target resource exchange code and sends it to the participating objects so that the participating objects can confirm whether they have resource exchange qualifications.

[0153] In step S106 of some embodiments, the participating objects that meet the resource allocation conditions are determined by matching the generated target resource exchange code with the candidate codes corresponding to the participating objects. Specifically, first, the candidate code information of all participating objects is obtained from the database, which includes basic information such as the content of the candidate code, the generation time, and the current state. Then, the candidate code and the target resource exchange code are compared based on the preset matching rule, which can include encoding rule matching, specific position character matching, or correlation degree matching. When a certain candidate code matches the target resource exchange code successfully, the corresponding matching result is recorded, and the participating object corresponding to the candidate code is determined as the resource allocation object. The matching result includes information such as the matching time and the matching rule used, which can be used in the subsequent resource allocation process. Through the above matching mechanism, the participating objects that meet the resource allocation conditions can be accurately identified, providing clear object determination basis for subsequent resource allocation.

[0154] Referring to Figure 6 In some embodiments, step S106 can include but is not limited to steps S601 to S604:

[0155] In step S601, the preset resource allocation level configuration information is obtained.

[0156] Step S602, the candidate code is compared with the target resource exchange code bit by bit to obtain the number of matching bits.

[0157] Step S603, based on the number of matching bits and the resource allocation level configuration information, the target allocation level corresponding to the candidate code is determined.

[0158] Step S604, the candidate code with the target allocation level is determined as the resource allocation object.

[0159] The steps S601 to S604 of the financial resource allocation method provided by the embodiments of the present application are described in detail below.

[0160] In step S601 of some embodiments, the resource allocation level configuration information is the basic parameter of the resource allocation process, and different levels of resource allocation standards are defined in advance. Specifically, in an allocation activity using an N-bit candidate code, multiple resource allocation levels can be set, and each level corresponds to different matching bit requirements. For example, when the candidate code is 6 bits, a complete match of 6 bits can be set as a first-level resource, a match of 5 bits can be set as a second-level resource, and a match of 4 bits can be set as a third-level resource. The configuration information of each level not only contains the matching bit requirement, but also contains the resource type, allocation quota, allocation quota, and other key parameters of the level. This hierarchical configuration mechanism makes the resource allocation more accurate and reasonable.

[0161] In step S602 of some embodiments, the matching degree of the candidate code and the target resource exchange code is calculated by bit-by-bit comparison. Specifically, the characters in each corresponding position of the candidate code and the target resource exchange code are compared in sequence. For example, for a 6-bit candidate code "123ABC" and a target resource exchange code "123ADE", starting from the first bit, the characters in each position are compared in sequence to determine whether they are consistent. During the comparison process, the number of matching bits is recorded, and the specific matching position information can also be recorded. In the above example, it can be determined through bit-by-bit comparison that the first 4 characters match successfully and the last 2 characters are different.

[0162] In step S603 of some embodiments, based on the number of matching bits obtained in step S602, the target allocation level is determined by referring to the resource allocation level configuration information. Specifically, the calculation result of the number of matching bits is first obtained, and then the highest level that meets the matching bit requirement is found in the resource allocation level configuration information. For example, when a certain candidate code matches 5 bits with the target resource exchange code, it can be determined that it has the allocation qualification of the second-level resource by referring to the level configuration information. While determining the target allocation level, detailed matching information needs to be recorded, including the specific matching position, the target allocation level, the matching time, and other key data.

[0163] In step S604 of some embodiments, the participant object with the target allocation level is determined as the resource allocation object. Specifically, when a certain candidate code successfully matches the target allocation level, the corresponding participant object is marked as the resource allocation object, and the specific allocation level information obtained by the object is recorded. These information will serve as an important basis for subsequent resource allocation, ensuring that resources can be accurately allocated to eligible participant objects.

[0164] Through the implementation of steps S601 to S604, a hierarchical resource allocation mechanism based on the number of matching bits is established. The progressive resource allocation method not only improves the opportunity of participant objects to obtain resources, but also realizes the differentiated allocation of resources. At the same time, since each allocation level can be configured with different types and quantities of resources, a flexible resource configuration space is provided, which can develop diversified allocation schemes according to actual needs, effectively improving the accuracy and rationality of resource allocation.

[0165] In step S107 of some embodiments, for the determined resource allocation object, specific resource allocation operations need to be performed according to the target allocation level obtained. The resource allocation rules define the key information such as the resource type, allocation quantity and allocation method corresponding to each allocation level. For example, the first-level resource can contain a higher amount of resource share or a higher quality resource type, the second-level resource corresponds to a medium amount of resource share, and the third-level resource can allocate a basic amount of resource share, thereby realizing the differentiated allocation of resources.

[0166] Specifically, the resource allocation rules can include quantity rules, time limit rules and use rules of resource allocation. The quantity rules are used to determine the quantity or amount of resources available at each allocation level; the time limit rules are used to limit the validity period of the resources, and different levels of resources can have different validity periods; the use rules define the specific conditions and restrictions of resource use. When performing resource allocation, first, the corresponding resource allocation rules are obtained according to the target allocation level of the resource allocation object. Then, according to the parameters defined in the rules, the corresponding resources are allocated to the resource allocation object. In the allocation process, the resource state in the resource pool also needs to be updated in real time, including the quantity of allocated resources, the quantity of remaining allocable resources and other information. At the same time, detailed resource allocation records need to be generated and recorded, including the time of resource allocation, the allocation level, the resource type, the allocation quantity and the validity period.

[0167] Please refer to Figure 7 In some embodiments, step S107 can include but is not limited to steps S701 to S705:

[0168] Step S701, obtaining the candidate code group corresponding to the resource allocation object.

[0169] Step S702, detecting the distribution state of the candidate sub-codes in the candidate code group.

[0170] Step S703, judging whether all candidate sub-codes in the candidate code group are in the distributed state.

[0171] Step S704, when all candidate sub-codes in the candidate code group are in the distributed state, allocating the reserved financial resources to the resource allocation object based on the target allocation level.

[0172] Step S705, when there are candidate sub-codes in the candidate code group in the undistributed state, marking the distributed candidate sub-codes in the candidate code group as invalid state.

[0173] In step S701 of some embodiments, for each resource allocation object, its complete candidate code group information needs to be obtained. The candidate code group contains all candidate sub-codes obtained by the resource allocation object, which is an important basis for performing resource allocation. Each candidate code group has a unique identifier to distinguish the candidate code information of different resource allocation objects.

[0174] In step S702 of some embodiments, the distribution state of the candidate sub-codes in the candidate code group is detected. For each candidate sub-code in the candidate code group, its current distribution state needs to be checked. The distribution state of the candidate sub-code can include the distributed state, the undistributed state, etc. By detecting the distribution state, the validity and integrity of the candidate sub-code can be confirmed.

[0175] In step S703 of some embodiments, it is judged whether all candidate sub-codes in the candidate code group are in the distributed state. Based on the detection result of step S702, the distribution state of all candidate sub-codes in the candidate code group is counted. Only when all candidate sub-codes in the candidate code group are in the distributed state, the subsequent resource allocation operation can be performed. This comprehensive checking mechanism can prevent allocation errors.

[0176] In step S704 of some embodiments, when all candidate sub-codes in the candidate code group are in the distributed state, the reserved financial resources are allocated to the resource allocation object based on the target allocation level. Specifically, according to the target allocation level obtained by the resource allocation object, a specified amount of resources is transferred from the reserved financial resources according to the corresponding resource allocation rules. At the same time, a resource allocation record is generated, containing information such as allocation time, allocation level, resource type and quantity.

[0177] In step S705 of some embodiments, when there are candidate sub-codes in the candidate code group in the undistributed state, the distributed candidate sub-codes in the candidate code group are marked as invalid state. This is a security protection mechanism. When it is found that the candidate code group is incomplete, by marking the distributed candidate sub-codes as invalid state, resource allocation errors can be prevented, and the accuracy of resource allocation can be ensured.

[0178] Through the implementation of steps S701 to S705, a strict resource allocation process is established. The process ensures the accuracy of resource allocation through the integrity check of the candidate code group, guarantees the effectiveness of resource allocation through the verification of the distribution state, and realizes the safety protection in abnormal conditions through the invalidation processing mechanism.

[0179] The financial resource allocation method, device and related equipment provided in the application obtain reserved financial resources, configure corresponding candidate codes for a first number of participating objects, split each candidate code to obtain a corresponding candidate code group, wherein the candidate code group contains at least one candidate sub-code, distribute the candidate sub-codes of the candidate code group to the corresponding participating objects in response to the participating objects completing a preset participation task, generate a target resource exchange code in response to a preset exchange condition being met, determine a resource allocation object based on matching the target resource exchange code with each candidate code to match the candidate code to the participating object of the target resource exchange code, and allocate the reserved financial resources to the resource allocation object in response to all candidate sub-codes of the candidate code group being distributed to the resource allocation object.

[0180] According to the financial resource allocation method provided in the application, the reserved financial resources are first obtained and candidate codes are configured for participating objects, then the management of a single code is changed to the dispersed management of multiple sub-codes by splitting the candidate codes into multiple candidate sub-codes and forming a candidate code group, so that the allocation and tracking are more flexible and controllable, meanwhile, the controllability of resource allocation is realized through the mechanism of binding the candidate sub-codes with the completion of the preset participation task, then the target resource exchange code is generated based on the preset exchange condition, and the resource allocation object is determined through a strict code matching process, finally, the distribution state of all candidate sub-codes in the candidate code group is verified to ensure the integrity of the allocation process. Through the above method, the flexibility of financial resource allocation can be improved.

[0181] Please refer to Figure 8 The application embodiment further provides a financial resource allocation device, which can implement the above-mentioned financial resource allocation method, and the device comprises:

[0182] The obtaining module is configured to obtain reserved financial resources.

[0183] The configuration module is configured to configure corresponding candidate codes for a first number of participating objects.

[0184] The splitting module is configured to split each candidate code to obtain a corresponding candidate code group, wherein the candidate code group contains at least one candidate sub-code.

[0185] The distribution module is configured to distribute the candidate sub-codes of the candidate code group to the corresponding participating objects in response to the participating objects completing a preset participation task.

[0186] generating a target resource exchange code in response to a preset exchange condition being met;

[0187] matching the target resource exchange code with each candidate code to match the candidate code with a participant of the target resource exchange code, and determining the participant as a resource allocation object;

[0188] allocating the reserve financial resource to the resource allocation object in response to all candidate sub-codes of the candidate code group being distributed to the resource allocation object.

[0189] The specific implementation of the financial resource allocation apparatus is basically the same as the specific implementation of the above-mentioned financial resource allocation method, and will not be repeated here.

[0190] The embodiments of the present application further provide an electronic device, which includes a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the above-mentioned financial resource allocation method. The electronic device can be any intelligent terminal including a tablet computer, a vehicle-mounted computer, etc.

[0191] Please refer to Figure 9 , Figure 9 which illustrates the hardware structure of the electronic device of another embodiment, which includes:

[0192] The processor 901 can be implemented in the form of a general-purpose CPU (Central Processing Unit), a microprocessor, an ASIC (Application Specific Integrated Circuit), or one or more integrated circuits, etc., for executing related programs to implement the technical solutions provided by the embodiments of the present application.

[0193] The memory 902 can be implemented in the form of a ROM (ReadOnly Memory), a static storage device, a dynamic storage device, or a RAM (Random Access Memory), etc. The memory 902 can store an operating system and other application programs. When the technical solutions provided by the embodiments of the present application are implemented by software or firmware, the related program codes are saved in the memory 902 and are called and executed by the processor 901 to implement the financial resource allocation method of the embodiments of the present application.

[0194] The input / output interface 903 is used to realize information input and output.

[0195] The communication interface 904 is configured to realize the communication interaction between the device and other devices, and can realize the communication through a wired manner (for example, a USB, a network cable, etc.) or a wireless manner (for example, a mobile network, WIFI, Bluetooth, etc.).

[0196] The bus 905 is configured to transmit information between various components (for example, the processor 901, the memory 902, the input / output interface 903 and the communication interface 904) of the device.

[0197] The processor 901, the memory 902, the input / output interface 903 and the communication interface 904 are connected to each other through the bus 905.

[0198] The application further provides a computer readable storage medium, which stores a computer program. The computer program is executed by a processor to implement the financial resource allocation method.

[0199] The memory is a non-transitory computer readable storage medium, and can be used to store a non-transitory software program and a non-transitory computer executable program. In addition, the memory can include a high-speed random access memory, and can also include a non-transitory memory, for example, at least one magnetic disk storage device, a flash memory device or other non-transitory solid-state memory device. In some embodiments, the memory can optionally include a memory remotely arranged relative to the processor, and the remote memory can be connected to the processor through a network. Examples of the network include but are not limited to the Internet, an intranet, a local area network, a mobile communication network and a combination thereof.

[0200] The financial resource allocation method, device and related equipment provided by the application obtain the reserved financial resource; configure a corresponding candidate code for each of the first number of participating objects; split each candidate code to obtain a corresponding candidate code group; wherein the candidate code group contains at least one candidate sub-code; in response to the participating object completing a preset participation task, the candidate sub-code of the candidate code group is distributed to the corresponding participating object; in response to the preset exchange condition being met, a target resource exchange code is generated; the target resource exchange code is matched with each candidate code to determine the participating object that matches the candidate code with the target resource exchange code as a resource allocation object; and in response to all candidate sub-codes of the candidate code group being distributed to the resource allocation object, the reserved financial resource is distributed to the resource allocation object.

[0201] According to the financial resource allocation method provided by the application, firstly, reserve financial resources are acquired and candidate codes are configured for participating objects; then, the management of single codes is changed into the dispersed management of multiple sub-codes by splitting the candidate codes into multiple candidate sub-codes and forming candidate code groups, so that the allocation and tracking are more flexible and controllable; meanwhile, the controllability of resource allocation is realized through the mechanism of binding the candidate sub-codes with preset participation task completion conditions; then, target resource exchange codes are generated based on preset exchange conditions, and resource allocation objects are determined through strict code matching processes; finally, the integrity of the allocation process is ensured by verifying the distribution state of all candidate sub-codes in the candidate code groups. Through the above method, the flexibility of financial resource allocation can be improved.

[0202] The embodiments described in the embodiments of the application are used to more clearly illustrate the technical solutions of the embodiments of the application, and do not constitute a limitation on the technical solutions provided by the embodiments of the application. Those skilled in the art can know that, with the evolution of technology and the appearance of new application scenarios, the technical solutions provided by the embodiments of the application are also applicable to similar technical problems.

[0203] Those skilled in the art can understand that the technical solutions shown in the figures do not constitute a limitation on the embodiments of the application, and can include more or fewer steps than shown in the figures, or combine certain steps or different steps.

[0204] The device embodiments described above are only schematic, and the units described as separate components can or can not be physically separate, that is, can be located in one place or distributed on multiple network units. Part or all of the modules can be selected according to actual needs to achieve the purpose of the embodiments of the application.

[0205] Those skilled in the art can understand that all or some of the steps in the above disclosed method, the function modules / units in the system and the device can be implemented as software, firmware, hardware and their appropriate combinations.

[0206] The terms "first", "second", "third", "fourth" and the like (if any) in the specification of the application and the above-described drawings are used to distinguish similar objects, and do not necessarily indicate a specific order or sequence. It should be understood that the data thus used can be interchanged under appropriate circumstances, so that the embodiments of the application described herein can be implemented in an order other than that illustrated or described herein. In addition, the terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusion, for example, a process, method, system, product or device including a series of steps or units does not necessarily limit to those steps or units clearly listed, but can include other steps or units not clearly listed or inherent to these processes, methods, products or devices.

[0207] It should be understood that, in the application, "at least one" means one or more, "multiple" means two or more. "And / or" is used to describe the relationship between the associated objects, which means that there can be three relationships, for example, "A and / or B" can represent three cases: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally represents an "or" relationship between the associated objects. "At least one of the following" or similar expressions means any combination of these items, including single or multiple combinations of items. For example, at least one of a, b or c can represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple.

[0208] In several embodiments provided in the application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only illustrative, for example, the division of the above units is only a logical function division, and actual implementation can have another division manner, for example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the displayed or discussed units can be indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0209] The units described above as separate components can or can not be physically separated, and the components shown as units can or can not be physical units, that is, they can be located in one place, or they can be distributed on multiple network units. According to actual needs, some or all of the units can be selected to achieve the purpose of the embodiment scheme.

[0210] In addition, the functional units in each embodiment of the application can be integrated in one processing unit, or each unit can be physically present separately, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit.

[0211] The integrated unit, if implemented in the form of a software function unit and sold or used as an independent product, can be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present application, essentially or in other words, the part that contributes to the prior art or the whole or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium, and includes multiple instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods of the various embodiments of the present application. The aforementioned storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and various program storage media.

[0212] The preferred embodiments of the embodiments of the present application are described above with reference to the accompanying drawings, and are not limited to the scope of the embodiments of the present application. Any modifications, equivalent replacements and improvements made by those skilled in the art without departing from the scope and essence of the embodiments of the present application shall be within the scope of the embodiments of the present application.

Claims

1. A method for allocating financial resources, characterized in that: The method comprises: access to reserve financial resources; configuring corresponding candidate codes for a first number of participating objects; Splitting each candidate code according to the number of preset participating tasks to obtain a corresponding candidate code group; wherein the candidate code group includes at least one candidate subcode, and establishing a corresponding mapping relationship between each candidate subcode in the candidate code group and one of the preset participating tasks; In response to the participant completing the preset participation task, distributing the candidate subcodes of the candidate code group to the corresponding participant; obtaining the participant's task completion record, the task completion record including the completion time of each preset participation task and the completion device information of each preset participation task; when the completion time of the preset participation task is less than a minimum completion time threshold, or when the same preset participation task is performed simultaneously on multiple different devices, determining that the participant has abnormal behavior; marking the participant as a restricted object, and prohibiting the distribution of the candidate subcodes to the restricted object; marking the multiple candidate subcodes obtained by the restricted object as invalid; In response to a preset redemption condition being met, generating a target resource redemption code; Reassemble the candidate subcodes corresponding to each candidate code group into a complete candidate code according to the position identifier; Based on a plurality of preset allocation levels, matching the target resource redemption code with each of the complete candidate codes, determining the target allocation level corresponding to the complete candidate code, and determining the participant whose complete candidate code has the target allocation level as a resource allocation target; In response to all of the candidate sub-codes of the candidate code group being distributed to the resource allocation object, the reserve financial resource is allocated to the resource allocation object.

2. The financial resource allocation method according to claim 1, characterized in that: The step of splitting each candidate code according to the number of preset participating tasks to obtain a corresponding candidate code group includes: Acquire task configuration information, wherein the task configuration information includes the number of the preset participating tasks; Determining the number of candidate subcodes included in the candidate code group based on the number of the preset participating tasks; The candidate code is split according to the number of the candidate subcodes to obtain the corresponding candidate code group.

3. The financial resource allocation method according to claim 2, characterized in that: In response to the participant completing the preset participation task, distributing the candidate sub-codes of the candidate code group to the corresponding participant includes: Obtaining the task completion status of the participating objects in real time; In response to detecting that the participant completes any of the preset participation tasks, obtaining the candidate subcode corresponding to the preset participation task according to the mapping relationship; The candidate subcodes are distributed to the participants.

4. The financial resource allocation method according to claim 1, characterized in that: The matching of the target resource redemption code with each candidate code to determine the participant whose candidate code matches the target resource redemption code as a resource allocation object includes: Obtaining preset resource allocation level configuration information, wherein the resource allocation level configuration information includes multiple allocation levels, each allocation level corresponding to a different matching bit requirement; Compare the candidate code with the target resource redemption code bit by bit to obtain the number of matching bits; Determining a target allocation level corresponding to the candidate code based on the number of matching bits and the resource allocation level configuration information; The participating object whose candidate code has the target allocation level is determined as the resource allocation object.

5. The financial resource allocation method according to claim 1, characterized in that: The matching of the target resource redemption code with each of the complete candidate codes based on a plurality of preset allocation levels, determining the target allocation level corresponding to the complete candidate code, and determining the participant having the complete candidate code having the target allocation level as the resource allocation object, includes: Obtaining a candidate code group corresponding to the resource allocation object; detecting a distribution status of candidate subcodes in the candidate code group; determining whether all the candidate subcodes in the candidate code group are in a distributed state; When all the candidate sub-codes in the candidate code group are in a distributed state, allocating the reserve financial resources to the resource allocation object based on the target allocation level; When there are candidate subcodes in an undistributed state in the candidate code group, the distributed candidate subcodes in the candidate code group are marked as invalid.

6. The financial resource allocation method according to claim 1, characterized in that: The step of generating a target resource redemption code in response to a preset redemption condition being met includes: Obtaining a preset exchange condition threshold, wherein the exchange condition threshold includes a time threshold and a number of people threshold; Real-time detection of the number of participating objects and the time interval since the last generation of the target resource redemption code; When the number of participants reaches the number threshold, or the time interval since the last generation of the target resource redemption code reaches the time threshold, generating the target resource redemption code based on the target resource redemption code generation rule; The target resource redemption code is stored and sent to the participating object.

7. A financial resource allocation device, characterized in that: The device comprises: Acquisition module, used to obtain reserve financial resources; A configuration module, configured to configure corresponding candidate codes for a first number of participating objects; a splitting module, configured to split each candidate code according to the number of preset participating tasks to obtain a corresponding candidate code group; wherein the candidate code group includes at least one candidate subcode, and establish a corresponding mapping relationship between each candidate subcode in the candidate code group and one of the preset participating tasks; a distribution module, configured to distribute the candidate subcodes of the candidate code group to the corresponding participant in response to the participant completing the preset participation task; wherein, in response to detecting that the participant has completed any of the preset participation tasks, the module further comprises: obtaining a task completion record of the participant, the task completion record including the completion time of each of the preset participation tasks and the completion device information of each of the preset participation tasks; determining that the participant has abnormal behavior when the completion time of the preset participation task is less than a minimum completion time threshold, or when the same preset participation task is performed simultaneously on multiple different devices; marking the participant as a restricted object, and prohibiting the distribution of the candidate subcodes to the restricted object; and marking the multiple candidate subcodes obtained by the restricted object as invalid; a generating module, configured to generate a target resource redemption code in response to a preset redemption condition being met, and reassemble the candidate subcodes corresponding to each candidate code group into the candidate code according to a position identifier; a matching module, configured to match the target resource redemption code with each candidate code based on a plurality of preset allocation levels, determine the target allocation level corresponding to the candidate code, and determine the participant whose candidate code has the target allocation level as the resource allocation target; An allocation module is configured to allocate the reserve financial resources to the resource allocation object in response to all the candidate sub-codes of the candidate code group being distributed to the resource allocation object.

8. An electronic device, characterized in that: The electronic device includes a memory and a processor, the memory stores a computer program, and the processor implements the financial resource allocation method according to any one of claims 1 to 6 when executing the computer program.

9. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, wherein the computer program implements the financial resource allocation method according to any one of claims 1 to 6 when executed by a processor.

Images