Financial resource allocation method and device and related equipment

Abstract

The invention 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 science and technology. The method comprises the following steps: obtaining reserve financial resources; configuring corresponding candidate codes for the first number of participating objects; performing splitting processing on each candidate code to obtain a corresponding candidate code block; wherein the candidate code block comprises at least one candidate sub-code; in response to completion of the preset participation task by the participation object, distributing candidate sub-codes of the candidate code group to the corresponding participation object; generating a target resource exchange code in response to the fact that a preset exchange condition is met; matching the target resource exchange code with each candidate code to match the candidate code with a participating object of the target resource exchange code, and determining the participating object as a resource allocation object; in response to all candidate sub-codes of the candidate code group being distributed to the resource allocation object, reserve financial resources are allocated to the resource allocation object. According to the invention, the flexibility of financial resource allocation can be improved.

Description

Technical Field

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

[0002] In the field of financial services, in order to achieve fair allocation and efficient management of various financial resources (such as financial product shares, coupons, credit lines, etc.), financial institutions usually adopt the technical solution of allocation code. Allocation code is a digital certificate used to identify and manage resource allocation rights. It realizes the allocation of financial resources by assigning unique allocation codes to users and mapping allocation codes with specific resources.

[0003] However, traditional allocation codes are usually in the form of a single long string. In scenarios with large-scale user participation, the system needs to process a large number of complete allocation codes at the same time, resulting in a long time-consuming process of code generation, storage and verification, making it difficult to achieve flexible allocation. Therefore, how to optimize the technical solution of allocation codes and achieve flexible allocation of financial resources has become a technical problem that needs to be solved urgently. Summary of the invention

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

[0005] To achieve the above objective, a first aspect of an embodiment of the present application proposes a method for allocating financial resources, the method comprising:

[0006] Access to reserve financial resources;

[0007] configuring corresponding candidate codes for a first number of participating objects;

[0008] Splitting each candidate code to obtain a corresponding candidate code group; wherein the candidate code group includes at least one candidate subcode;

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

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

[0011] Based on the target resource redemption code, the target resource redemption code is matched with each candidate code to determine the participating object whose candidate code is matched with the target resource redemption code as a resource allocation object;

[0012] 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.

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

[0014] Acquire task configuration information, wherein the task configuration information includes the number of the preset participating tasks;

[0015] Based on the number of the preset participating tasks, determining the number of candidate subcodes included in the candidate code group;

[0016] Splitting the candidate code according to the number of the candidate subcodes to obtain the corresponding candidate code group;

[0017] A corresponding mapping relationship is established between each candidate subcode in the candidate code group and one of the preset participating tasks.

[0018] In some embodiments, in response to the participant completing a preset participation task, distributing the candidate subcodes of the candidate code group to the corresponding participant includes:

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

[0020] In response to detecting that the participant has completed any of the preset participation tasks, acquiring the candidate subcode corresponding to the preset participation task according to the mapping relationship;

[0021] The candidate subcodes are distributed to the participating objects.

[0022] In some embodiments, the response to detecting that the participant completes any of the preset participation tasks further includes:

[0023] Acquire the task completion record of the participant, wherein the task completion record includes the completion time of each of the preset participating tasks and the completion device information of each of the preset participating tasks;

[0024] 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 performed on multiple different devices at the same time, it is determined that the participating object has abnormal behavior;

[0025] marking the participating object as a restricted object, and prohibiting distribution of the candidate subcode to the restricted object;

[0026] The plurality of candidate subcodes obtained by the restriction object are marked as invalid.

[0027] In some embodiments, the matching of the target resource redemption code with each candidate code to match the candidate code with the target resource redemption code to determine the participating object as a resource allocation object includes:

[0028] Obtaining preset resource allocation level configuration information, wherein the resource allocation level configuration information includes a plurality of allocation levels, each of the allocation levels corresponding to a different matching bit number requirement;

[0029] Compare the candidate code with the target resource redemption code bit by bit to obtain the number of matching bits;

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

[0031] The participating object whose candidate code has the target allocation level is determined as the resource allocation object.

[0032] In some embodiments, in response to all the candidate sub-codes of the candidate code group being distributed to the resource allocation object, allocating the reserve financial resources to the resource allocation object includes:

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

[0034] Detecting the distribution status of the candidate subcodes in the candidate code group;

[0035] Determining whether all the candidate subcodes in the candidate code group are in a distributed state;

[0036] 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;

[0037] When there are candidate subcodes in the candidate code group that are not distributed, the distributed candidate subcodes in the candidate code group are marked as being in an invalid state.

[0038] In some embodiments, in response to a preset redemption condition being satisfied, generating a target resource redemption code includes:

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

[0040] Real-time detection of the number of participating objects and the time interval from the last generation of the target resource redemption code;

[0041] When the number of the participating objects reaches the number threshold, or the time interval from 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 the target resource redemption code is 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] The acquisition module is used to obtain reserve financial resources;

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

[0046] A splitting module, used for splitting 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 subcodes 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 of the candidate codes, so as to match the candidate code with the participating object of the target resource redemption code and determine the participating object as a resource allocation object;

[0050] An allocation module is configured to allocate the reserve financial resource 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 objectives, a 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 when the processor executes the computer program, the method described in the first aspect is implemented.

[0052] To achieve the above-mentioned purpose, the fourth aspect of an embodiment of the present application proposes a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method described in the first aspect is implemented.

[0053] The financial resource allocation method, device and related equipment proposed in the present application obtain reserve 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 includes at least one candidate subcode; in response to the participating object completing a preset participating task, distribute the candidate subcode of the candidate code group to the corresponding participating object; in response to the preset exchange condition being met, generate a target resource exchange code; based on the target resource exchange code, match each candidate code to determine the participating object whose candidate code is matched with the target resource exchange code as a resource allocation object; in response to all the candidate subcodes of the candidate code group being distributed to the resource allocation object, allocate reserve financial resources to the resource allocation object.

[0054] According to the financial resource allocation method provided by the present invention, firstly, the reserve financial resources are obtained and candidate codes are configured for the participating objects; then, by splitting the candidate code into multiple candidate subcodes and forming a candidate code group, the management of a single code is transformed into the decentralized management of multiple subcodes, so that the allocation and tracking are more flexible and controllable; at the same time, by binding the candidate subcode with the completion status of the preset participating tasks, the controllability of resource allocation is achieved; then, the target resource redemption code is generated based on the preset redemption conditions, and the resource allocation object is determined through a strict code matching process; finally, by verifying the distribution status of all candidate subcodes in the candidate code group, the integrity of the allocation process is ensured. Through the above method, the present invention can improve the flexibility of financial resource allocation. BRIEF DESCRIPTION OF THE DRAWINGS

[0055] Figure 1 is a flow chart of a financial resource allocation method provided in an embodiment of the present application;

[0056] Figure 2 is another flow chart of the financial resource allocation method provided in the embodiment of the present application;

[0057] Figure 3 is another flow chart of the financial resource allocation method provided in the embodiment of the present application;

[0058] Figure 4 is another flow chart of the financial resource allocation method provided in the embodiment of the present application;

[0059] Figure 5 is another flow chart of the financial resource allocation method provided in the embodiment of the present application;

[0060] Figure 6 is another flow chart of the financial resource allocation method provided in the embodiment of the present application;

[0061] Figure 7 is another flow chart of the financial resource allocation method provided in the embodiment of the present application;

[0062] Figure 8 is a structural diagram of a financial resource allocation device provided in an embodiment of the present application;

[0063] Fig. 9 It is a schematic diagram of the hardware structure of the electronic device provided in the embodiment of the present application. DETAILED DESCRIPTION

[0064] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

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

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

[0067] Based on this, the embodiments of the present application provide a financial resource allocation method, apparatus and related equipment, aiming to improve the flexibility of financial resource allocation.

[0068] The financial resource allocation method, apparatus and related equipment provided in the embodiments of the present application are specifically described through 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 in the embodiment of the present application relates to the field of lottery management. The financial resource allocation method provided in the embodiment of the present application can be applied to a terminal, can be applied to a server side, or can be software running in a terminal or a server side. In some embodiments, the terminal can be a smart phone, a tablet computer, a laptop computer, a desktop computer, etc.; the server side can be configured as an independent physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms; the software can be an application that implements the financial resource allocation method, etc., but is not limited to the above forms.

[0070] The present application can be used in many general or special computer system environments or configurations. For example: personal computers, server computers, handheld or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments including any of the above systems or devices, etc. The present application can be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. The present application can also be practiced in distributed computing environments, in which tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules can be located in local and remote computer storage media including storage devices.

[0071] It should be noted that in each specific implementation of the present application, when it comes to the need to perform relevant processing based on data related to user identity or characteristics such as user information, user behavior data, user historical data, and user location information, the user's permission or consent will be obtained first, and the collection, use, and processing of these data will comply with relevant laws, regulations, and standards. In addition, when the embodiment of the present application needs to obtain the user's sensitive personal information, the user's separate permission or consent will be obtained through a pop-up window or by jumping to a confirmation page. After clearly obtaining the user's separate permission or consent, the necessary user-related data for the normal operation of the embodiment of the present application will be obtained.

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

[0073] Step S101, obtaining reserve financial resources.

[0074] Step S102: configuring corresponding candidate codes for a first number of participating objects.

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

[0076] Step S104: in response to the participant completing the preset participation task, distributing candidate sub-codes of the candidate code group to the corresponding participant.

[0077] Step S105: in response to the preset redemption condition being met, a target resource redemption code is generated.

[0078] Step S106: Matching the target resource redemption code with each candidate code to match the candidate code with the target resource redemption code as a participating object for resource allocation.

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

[0080] Steps S101 to S107 shown in the embodiment of the present application first obtain the reserve financial resources and configure the candidate code for the participating object; then, by splitting the candidate code into multiple candidate subcodes and forming a candidate code group, the management of a single code is transformed into the decentralized management of multiple subcodes, so that the allocation and tracking are more flexible and controllable; at the same time, by binding the candidate subcode with the completion status of the preset participating task, the controllability of resource allocation is achieved; then, the target resource redemption code is generated based on the preset redemption conditions, and the resource allocation object is determined through a strict code matching process; finally, by verifying the distribution status of all candidate subcodes in the candidate code group, the integrity of the allocation process is ensured. The present invention can improve the flexibility of financial resource allocation through the above method.

[0081] In step S101 of some embodiments, a financial resource pool may be pre-set, and the financial resource pool includes different types of financial resources to be allocated. The reserve financial resources may include but are not limited to: cash red envelopes, vouchers, coupons, etc. Specifically, the acquisition of reserve financial resources may include the following steps:

[0082] First, set the resource type and quantity of the financial resource pool. For example, you can set up a financial resource pool containing 1,000 cash red packets and 500 vouchers. The specific attributes such as the amount of each cash red packet and the face value of each voucher can be configured according to actual business needs.

[0083] Secondly, configure the allocation rules of financial resources. The allocation rules are used to limit the allocation scope of financial resources, 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 overall allocation, etc. For example, the validity period of a cash red envelope can be set to 30 days, and the maximum number of single allocations can be set to 10.

[0084] Finally, the reserve financial resources that meet the allocation rules are obtained from the financial resource pool. For example, according to the preset allocation rules, 50 cash red envelopes and 30 vouchers are obtained as the reserve financial resources to be allocated this time. The quantity and status information of the reserve financial resources are 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 resources, it is necessary to configure the corresponding candidate code for the participating object. The first number is used to limit the number range of participating objects, and can be configured according to actual business needs. 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 participant. Optionally, a unique candidate code can be generated for each participant 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 be randomly selected from a preset candidate code pool and assigned to a participant. Among them, a candidate code can only be assigned to one participant, while a participant can be assigned multiple candidate codes.

[0087] Finally, the corresponding relationship between the participating objects and the candidate codes 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 present application can flexibly configure candidate codes for participating objects and provide 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 subcodes, and these candidate subcodes together constitute a candidate code group. The number of splits can be configured according to actual business needs. 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 subcode information contained in the candidate code group, to facilitate subsequent distribution management.

[0089] See also Figure 2 In some embodiments, step S103 may 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 subcodes included in the candidate code group based on the number of preset participating tasks.

[0092] Step S203, splitting the candidate code according to the number of candidate subcodes to obtain corresponding candidate code groups.

[0093] Step S204: establish a corresponding mapping relationship between each candidate subcode in the candidate code group and a preset participating task.

[0094] In step S201 of some embodiments, the task configuration information includes the number of preset participating tasks. Specifically, the configuration parameters related to the activity can be set in advance in the configuration table, including but not limited to: the number of preset participating tasks, the type of preset participating tasks, etc. For example, three preset participating tasks can be set: daily check-in, inviting friends, and commodity purchase. Before performing candidate code splitting, it is necessary to first obtain these configuration information.

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

[0096] In step S203 of some embodiments, the candidate code is split according to the determined number of candidate subcodes 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 subcode contains 4 bits: "A1 B2", "C3D4", "E5F6". Optionally, an unequal-length splitting method can also be used. For example, for a 10-bit candidate code "A1 B2C3D4EF", different numbers of bits can be allocated according to the importance of the tasks to obtain "A1 B2", "C3D", "4EF". During the splitting process, it is necessary to record the starting position and ending position information of each candidate subcode in the original candidate code.

[0097] Each candidate subcode is associated with a specific preset participating task. This one-to-one correspondence ensures that the user can obtain the corresponding candidate subcode after completing a specific task. Therefore, the mapping relationship between the subcode and the task needs to be established and maintained during the segmentation process.

[0098] The following are possible implementations:

[0099] Implementation method 1: equal length segmentation. For a 12-bit candidate code "A1 B2C3D4E5F6", when the preset number of participating tasks is 3, first, calculate the number of digits that each subcode should contain: 12÷3=4 digits, and then segment according to 4 digits:

[0100] The first subcode: "A1 B2", position information: 1-4 digits;

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

[0102] The third subcode: "E5F6", position information: 9-12 bits;

[0103] Next, establish the matching relationship between the subcode and the task:

[0104] “A1 B2” corresponds to the “Daily Sign-in” task;

[0105] "C3D4" corresponds to the "Invite Friends" task;

[0106] "E5F6" corresponds to the "commodity purchase" task;

[0107] Implementation method 2: unequal length segmentation. For a 10-digit candidate code "A1 B2C3D4EF", when the preset number of participating tasks is 3:

[0108] First, we can allocate the number of bits according to the importance of the task:

[0109] 4 people are assigned important tasks;

[0110] 3 people are assigned to general tasks;

[0111] Simple tasks are assigned to 3 people;

[0112] Then, split according to the plan:

[0113] The first subcode: "A1 B2", position information: 1-4 digits;

[0114] The second subcode: "C3D", position information: 5-7 bits;

[0115] The third subcode: "4EF", location information: 8-10 bits;

[0116] Record the location information and task matching relationship at the same time;

[0117] During the segmentation process, the following information of each subcode needs to be recorded synchronously: subcode content, starting position and ending position in the corresponding candidate code, corresponding preset participating task identifier and subcode status (initial undistributed status);

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

[0119] In step S104 of some embodiments, after the candidate code splitting is completed, the task completion status of the participating object can be obtained in real time. First, the task completion status 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 subcode is triggered. Secondly, the candidate subcode that has a mapping relationship with the completed task is obtained. According to the mapping relationship established in step S204, the candidate subcode 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 subcode "A1B2" corresponding to the task. Finally, the obtained candidate subcode is distributed to the participating object, and the status of the candidate subcode is updated, and the distribution status of the candidate subcode is recorded as distributed, and the distribution time, distribution object and other information are recorded at the same time.

[0120] Through the implementation of step S104, the present application associates the distribution of candidate subcodes with the task completion status, so that the participating objects need to complete the corresponding preset participating tasks to obtain the candidate subcodes, thereby improving the flexibility of resource allocation.

[0121] See also Figure 3 In some embodiments, step S104 may include but is not limited to steps S301 to S303:

[0122] Step S301, obtaining the task completion status of the target user in real time.

[0123] Step S302, in response to detecting that the target user completes any preset participation task, obtaining a candidate subcode corresponding to the preset participation task according to a mapping relationship;

[0124] Step S303: distribute the candidate subcodes to the participants.

[0125] In step S301 of some embodiments, the user's execution of the preset participation task can be captured in real time by means of timed polling or event monitoring. For example, when the user clicks a 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 status. 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 preset participation task, the subsequent retrieval operation is immediately initiated. For example, when it is detected that the user has completed the "daily check-in" task, the subcode retrieval process corresponding to the task will be immediately triggered. In specific implementation, the following methods can be used:

[0127] Assume that the candidate code is a 12-digit string "A1B2C3D4E5F6", which has been divided into three sub-codes according to the preset number of participating tasks:

[0128] The first subcode "A1B2" corresponds to the "Daily Sign-in" task;

[0129] The second subcode "C3D4" corresponds to the "Invite Friends" task;

[0130] The third subcode "E5F6" corresponds to the "commodity purchase" task;

[0131] When the user completes the "Daily Sign-in" task, the subcode "A1B2" matching the "Daily Sign-in" task will be retrieved from the code pool.

[0132] See also Figure 4 In some embodiments, step S302 may include but is not limited to steps S401 to 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 performed on multiple different devices at the same time, it is determined that the participating object has abnormal behavior.

[0135] Step S403: Mark the participating object as a restricted object, and prohibit the distribution of candidate subcodes to the restricted object.

[0136] Step S404: Mark the multiple candidate subcodes obtained by the restriction object as invalid.

[0137] In step S401 of some embodiments, the task completion record mainly includes information of two core dimensions: completion time and completion device information. Among them, completion time refers to the time interval from the user starting to perform the task to the completion of the task, which can be accurately recorded to the second or millisecond level 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 includes multiple feature data of the device, including the device's unique identification code, device type, specific model, operating system version, and network environment information. The collection of these device information provides a reliable data basis for subsequent cheating behavior judgments.

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

[0139] In step S403 of some embodiments, when a user is judged to have cheated, strict restriction list management measures will be implemented. First, a restriction list mark is added to the user information, and the specific time and trigger reason of joining the restriction list are recorded. Secondly, a mapping relationship between the user and its associated account is established to prevent circumvention of restrictions by changing accounts. For users on the restricted list, comprehensive restriction measures will be implemented, including prohibiting the acquisition of new candidate subcodes, restricting participation in new preset participation tasks, and continuously recording the user's subsequent behavior to provide a basis for subsequent risk control optimization.

[0140] In step S404 of some embodiments, in terms of subcode status processing, the relevant candidate subcode of the restricted list user is marked as invalid, and the invalidation time and reason are recorded in detail. In terms of associated data processing, it is necessary to update the association between the candidate subcode and the user, clear the validity mark of the candidate subcode, and remove the binding relationship between the candidate subcode and the preset participation task.

[0141] Through step S401 to step S404, the embodiment of the present application constructs a complete anti-cheating protection mechanism. This mechanism improves the accuracy of cheating behavior identification through multi-dimensional data collection and multiple judgment criteria; effectively blocks the continued occurrence of cheating behavior through perfect restriction list management and candidate subcode cancellation measures; and ensures the traceability of the entire anti-cheating process through standardized data processing procedures. This multi-level protection mechanism not only effectively prevents users from obtaining candidate subcodes through technical means or other abnormal methods, 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 subcode is retrieved. The distribution process includes establishing an association between the candidate subcode and the user and updating the distribution status of the candidate subcode. The distribution information will be recorded in the database, including key data such as the distribution time, the candidate subcode content, and the user identification. These records not only prevent duplicate distribution, but also provide a basis for subsequent data statistics and status inquiries. The timely update of the candidate subcode status ensures the rigor and traceability of the distribution process.

[0143] Through steps S301 to S303, the mechanism of obtaining the task completion status in real time ensures the timeliness of candidate subcode distribution, and the accurate control of candidate subcode distribution is achieved based on the task-triggered retrieval mechanism. By establishing a correspondence between candidate subcodes and specific tasks, it is ensured that each distributed candidate subcode strictly corresponds to the completed task, avoiding the confusion of candidate subcode distribution. The candidate subcode status marking mechanism is introduced to ensure the uniqueness of candidate subcode distribution. By marking the status of the distributed candidate subcode, the repeated distribution of candidate subcodes is effectively prevented, and the fairness of the lottery activity is improved.

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

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

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

[0147] Step S501, obtaining a preset redemption condition threshold.

[0148] Step S502: Detect in real time the number of participating objects and the time interval from the last generation of the target resource redemption code.

[0149] Step S503: when the number of participants reaches a threshold number of people, or when the time interval from the last generation of a target resource redemption code reaches a time threshold, a target resource redemption code is generated based on a target resource redemption code generation rule.

[0150] In step S501 of some embodiments, the redemption condition threshold includes a time threshold and a number threshold; the time threshold is used to define the minimum time interval between two consecutive generation of the target resource redemption code, and the number threshold is used to define the minimum number of participating objects required to trigger the generation of the target resource redemption 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 generation of the target resource redemption code are detected in real time. The system will continuously count the current number of participating objects and calculate the time difference from the last generation of the target resource redemption code to determine whether the trigger 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 generation of the target resource redemption code reaches the time threshold, the target resource redemption code is generated based on the target resource redemption code generation rule. When any trigger condition is met, a new target resource redemption code is generated according to the preset target resource redemption code generation rule. After the generation is completed, the system will store the target resource redemption code and send the redemption code to the participating object so that the participating object can confirm whether he or she is qualified for resource redemption.

[0153] In step S106 of some embodiments, the generated target resource exchange code is matched with the candidate code corresponding to the participating object to determine the participating object that meets the resource allocation conditions. Specifically, the candidate code information of all participating objects is first obtained from the database, which includes basic information such as the content, generation time and current status of the candidate code. Then, the candidate code and the target resource exchange code are compared based on the preset matching rules, and the matching rules may include encoding rule matching, specific position character matching or association matching. When a candidate code successfully matches the target resource exchange code, the corresponding matching result is recorded, and the participating object corresponding to the candidate code is determined as the resource allocation object. Among them, the matching result includes information such as the matching time and the matching rules adopted, 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 a clear basis for object determination for subsequent resource allocation.

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

[0155] Step S601: Obtain preset resource allocation level configuration information.

[0156] Step S602, compare the candidate code with the target resource redemption code bit by bit to obtain the matching digit number.

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

[0158] Step S604: determine the participating objects whose candidate codes have the target allocation level as resource allocation objects.

[0159] The following describes in detail steps S601 to S604 of the financial resource allocation method provided in the embodiment of the present application.

[0160] In step S601 of some embodiments, resource allocation level configuration information is a basic parameter of the resource allocation process, which predefines resource allocation standards of different levels. Specifically, in an allocation activity using an N-bit candidate code, multiple resource allocation levels can be set, and each level corresponds to a different number of 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 includes the number of matching bits, but also key parameters such as the resource type, allocation amount, and allocation quota of the level. This hierarchical configuration mechanism makes resource allocation more accurate and reasonable.

[0161] In step S602 of some embodiments, the degree of match between the candidate code and the target resource redemption code is calculated by bit-by-bit comparison. Specifically, the characters at each corresponding position of the candidate code and the target resource redemption code are compared sequentially. For example, for the 6-digit candidate code "123ABC" and the target resource redemption code "123ADE", starting from the first digit, the characters at each position are compared in turn to see if they are consistent. During the comparison process, the number of digits that are successfully matched is recorded, and the specific matching position information can also be recorded. In the above example, bit-by-bit comparison can determine that the first 4 characters are successfully matched, and the last 2 characters are different.

[0162] In step S603 of some embodiments, based on the number of matching digits obtained in step S602, the target allocation level is determined by comparing the resource allocation level configuration information. Specifically, the calculation result of the number of matching digits is first obtained, and then the highest level that meets the matching digit requirement is searched in the resource allocation level configuration information. For example, when a candidate code matches the target resource redemption code by 5 digits, its eligibility for obtaining the secondary resource allocation can be determined by comparing the level configuration information. While determining the target allocation level, detailed matching information also needs to be recorded, including key data such as the specific matching position, target allocation level, and matching time.

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

[0164] Through the implementation of step S601 to step S604, a hierarchical resource allocation mechanism based on the number of matching bits is established. The progressive resource allocation method not only improves the chances of participants 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, it provides a flexible resource configuration space, and can formulate a variety of allocation plans 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, it is necessary to perform specific resource allocation operations according to the target allocation level obtained. The resource allocation rules define key information such as resource type, allocation quantity, and allocation method corresponding to each allocation level. For example, the first-level resources can include higher-value resource shares or higher-quality resource types, the second-level resources correspond to medium-value resource shares, and the third-level resources can be allocated with basic-value resource shares, thereby realizing differentiated resource allocation.

[0166] Specifically, resource allocation rules can include quantity rules, time rules, and usage rules for resource allocation. Quantity rules are used to determine the quantity or amount of resources available for each allocation level; time rules are used to limit the validity period of resources, and resources of different levels can have different validity periods; usage rules define the specific conditions and restrictions for resource use. When executing resource allocation, first obtain the corresponding resource allocation rules based on the target allocation level of the resource allocation object. Then, allocate the corresponding resources to the resource allocation object according to the parameters defined in the rules. During the allocation process, it is also necessary to update the resource status in the resource pool in real time, including information such as the number of allocated resources and the number of remaining allocable resources. At the same time, it is also necessary to generate and record detailed resource allocation records, including information such as the time of resource allocation, allocation level, resource type, allocation quantity, and validity period.

[0167] See also Figure 7 In some embodiments, step S107 may include but is not limited to steps S701 to S705:

[0168] Step S701: Acquire a candidate code group corresponding to a resource allocation object.

[0169] Step S702: Detect the distribution status of the candidate subcodes in the candidate code group.

[0170] Step S703: determine whether all candidate subcodes in the candidate code group are in a distributed state.

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

[0172] Step S705: when there are candidate subcodes in the candidate code group that are not distributed, the distributed candidate subcodes in the candidate code group are marked as invalid.

[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 subcodes obtained by the resource allocation object, and these candidate subcodes are important basis for executing resource allocation. Each candidate code group has a unique identifier, which is used to distinguish the candidate code information of different resource allocation objects.

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

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

[0176] In step S704 of some embodiments, when all candidate subcodes in the candidate code group are in the distributed state, the reserve 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, according to the corresponding resource allocation rules, a specified amount of resources are allocated from the reserve financial resources. At the same time, a resource allocation record is generated, including information such as allocation time, allocation level, resource type and quantity.

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

[0178] Through the implementation of step S701 to step S705, a strict resource allocation process is established. This process ensures the accuracy of resource allocation through the integrity check of the candidate code group; ensures the effectiveness of resource allocation through the verification of the distribution status; and realizes safety protection in abnormal situations through the invalidation processing mechanism.

[0179] The financial resource allocation method, device and related equipment proposed in the present application obtain reserve 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 includes at least one candidate subcode; in response to the participating object completing a preset participating task, distribute the candidate subcode of the candidate code group to the corresponding participating object; in response to the preset exchange condition being met, generate a target resource exchange code; based on the target resource exchange code, match each candidate code to determine the participating object whose candidate code is matched with the target resource exchange code as a resource allocation object; in response to all the candidate subcodes of the candidate code group being distributed to the resource allocation object, allocate reserve financial resources to the resource allocation object.

[0180] According to the financial resource allocation method provided by the present invention, firstly, the reserve financial resources are obtained and candidate codes are configured for the participating objects; then, by splitting the candidate code into multiple candidate subcodes and forming a candidate code group, the management of a single code is transformed into the decentralized management of multiple subcodes, so that the allocation and tracking are more flexible and controllable; at the same time, by binding the candidate subcode with the completion status of the preset participating tasks, the controllability of resource allocation is achieved; then, the target resource redemption code is generated based on the preset redemption conditions, and the resource allocation object is determined through a strict code matching process; finally, by verifying the distribution status of all candidate subcodes in the candidate code group, the integrity of the allocation process is ensured. Through the above method, the present invention can improve the flexibility of financial resource allocation.

[0181] See also Figure 8 The embodiment of the present application further provides a financial resource allocation device, which can implement the above-mentioned financial resource allocation method, and the device includes:

[0182] The acquisition module is used to obtain reserve financial resources;

[0183] A configuration module, configured to configure corresponding candidate codes for a first number of participating objects;

[0184] A splitting module is used to split each candidate code to obtain a corresponding candidate code group; wherein the candidate code group includes at least one candidate subcode;

[0185] A distribution module, configured to distribute candidate subcodes of the candidate code group to corresponding participants in response to the participants completing a preset participation task;

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

[0187] A matching module, used for matching each candidate code based on the target resource redemption code, so as to match the candidate code with the participating object of the target resource redemption code and determine it as a resource allocation object;

[0188] The 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.

[0189] The specific implementation of the financial resource allocation device is substantially the same as the specific implementation of the above-mentioned financial resource allocation method, and will not be described in detail herein.

[0190] The embodiment of the present application also provides an electronic device, the electronic device includes a memory and a processor, the memory stores a computer program, and the processor implements the above financial resource allocation method when executing the computer program. The electronic device can be any intelligent terminal including a tablet computer, a car computer, etc.

[0191] See also Fig. 9 , Fig. 9 The hardware structure of an electronic device of another embodiment is illustrated, and the electronic device includes:

[0192] The processor 901 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of the present application;

[0193] The memory 902 can be implemented in the form of a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 902 can store an operating system and other application programs. When the technical solution provided in the embodiment of this specification is implemented by software or firmware, the relevant program code is stored in the memory 902, and the processor 901 calls and executes the financial resource allocation method of the embodiment of this application;

[0194] Input / output interface 903, used to implement information input and output;

[0195] Communication interface 904, used to realize communication interaction between the device and other devices, which can be realized through wired mode (such as USB, network cable, etc.) or wireless mode (such as mobile network, WI FI, Bluetooth, etc.);

[0196] A bus 905 that transmits information between the various components of the device (e.g., the processor 901, the memory 902, the input / output interface 903, and the communication interface 904);

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

[0198] An embodiment of the present application further provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, the above-mentioned financial resource allocation method is implemented.

[0199] The memory, as a non-transient computer-readable storage medium, can be used to store non-transient software programs and non-transient computer executable programs. In addition, the memory may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some embodiments, the memory may optionally include a memory remotely disposed relative to the processor, and these remote memories may be connected to the processor via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0200] The financial resource allocation method, device and related equipment proposed in the present application obtain reserve 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 includes at least one candidate subcode; in response to the participating object completing a preset participating task, distribute the candidate subcode of the candidate code group to the corresponding participating object; in response to the preset exchange condition being met, generate a target resource exchange code; based on the target resource exchange code, match each candidate code to determine the participating object whose candidate code is matched with the target resource exchange code as a resource allocation object; in response to all the candidate subcodes of the candidate code group being distributed to the resource allocation object, allocate reserve financial resources to the resource allocation object.

[0201] According to the financial resource allocation method provided by the present invention, firstly, the reserve financial resources are obtained and candidate codes are configured for the participating objects; then, by splitting the candidate code into multiple candidate subcodes and forming a candidate code group, the management of a single code is transformed into the decentralized management of multiple subcodes, so that the allocation and tracking are more flexible and controllable; at the same time, by binding the candidate subcode with the completion status of the preset participating tasks, the controllability of resource allocation is achieved; then, the target resource redemption code is generated based on the preset redemption conditions, and the resource allocation object is determined through a strict code matching process; finally, by verifying the distribution status of all candidate subcodes in the candidate code group, the integrity of the allocation process is ensured. Through the above method, the present invention can improve the flexibility of financial resource allocation.

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

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

[0204] The device embodiments described above are merely illustrative, and the units described as separate components may or may not be physically separated, that is, they may be located in one place or distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0205] Those skilled in the art will appreciate that all or some of the steps in the methods disclosed above, and the functional modules / units in the systems and devices may be implemented as software, firmware, hardware, or a suitable combination thereof.

[0206] The terms "first", "second", "third", "fourth", etc. (if any) in the specification of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0207] It should be understood that in the present application, "at least one (item)" means one or more, and "plurality" means two or more. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can mean: 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 indicates that the objects associated before and after are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.

[0208] In the several embodiments provided in the present 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 schematic. For example, the division of the above units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

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

[0210] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0211] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including multiple instructions to enable a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of various embodiments of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (Read-Only Memory, referred to as ROM), random access memory (Random Access Memory, referred to as RAM), disk or optical disk and other media that can store programs.

[0212] The preferred embodiments of the present invention are described above with reference to the accompanying drawings, but the scope of the rights of the present invention is not limited thereto. Any modification, equivalent substitution and improvement made by a person skilled in the art without departing from the scope and essence of the present invention should be within the scope of the rights of the present invention.

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 to obtain a corresponding candidate code group; wherein the candidate code group includes at least one candidate subcode; In response to the participant completing a preset participation task, distributing the candidate sub-codes of the candidate code group to the corresponding participant; In response to a preset redemption condition being met, generating a target resource redemption code; Based on the target resource redemption code, the target resource redemption code is matched with each candidate code to determine the participating object whose candidate code is matched with the target resource redemption code as a resource allocation object; 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 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; Based on the number of the preset participating tasks, determining the number of candidate subcodes included in the candidate code group; Splitting the candidate code according to the number of the candidate subcodes to obtain the corresponding candidate code group; A corresponding mapping relationship is established between each candidate subcode in the candidate code group and one of the preset participating tasks.

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 subcodes of the candidate code group to the corresponding participant, comprises: Obtaining the task completion status of the participating object in real time; In response to detecting that the participant has completed any of the preset participation tasks, acquiring the candidate subcode corresponding to the preset participation task according to the mapping relationship; The candidate subcodes are distributed to the participating objects.

4. The method for allocating financial resources according to claim 3, characterized in that: In response to detecting that the participant completes any of the preset participation tasks, the method further includes: Acquire the task completion record of the participant, wherein the task completion record includes the completion time of each of the preset participating tasks and the completion device information of each of the preset participating tasks; 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 performed on multiple different devices at the same time, it is determined that the participating object has abnormal behavior; marking the participating object as a restricted object, and prohibiting distribution of the candidate subcode to the restricted object; The plurality of candidate subcodes obtained by the restriction object are marked as invalid.

5. The financial resource allocation method according to claim 1, characterized in that: The matching of the target resource exchange code with each of the candidate codes to match the candidate code with the target resource exchange code to determine the participating object as a resource allocation object includes: Obtaining preset resource allocation level configuration information, wherein the resource allocation level configuration information includes a plurality of allocation levels, each of the allocation levels corresponding to a different matching bit number 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.

6. The method for allocating financial resources according to claim 5, characterized in that: In response to all the candidate sub-codes of the candidate code group being distributed to the resource allocation object, allocating the reserve financial resources to the resource allocation object comprises: Obtaining a candidate code group corresponding to the resource allocation object; Detecting the distribution status of the 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 the candidate code group that are not distributed, the distributed candidate subcodes in the candidate code group are marked as being in an invalid state.

7. 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 threshold; Real-time detection of the number of participating objects and the time interval from the last generation of the target resource redemption code; When the number of the participating objects reaches the number threshold, or the time interval from 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 the target resource redemption code is sent to the participating object.

8. A financial resource allocation device, characterized in that: The device comprises: The acquisition module is 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, used for splitting each candidate code to obtain a corresponding candidate code group; wherein the candidate code group includes at least one candidate subcode; a distribution module, configured to distribute the candidate subcodes of the candidate code group to the corresponding participant in response to the participant completing a preset participation task; A generating module, configured to generate a target resource redemption code in response to a preset redemption condition being met; a matching module, configured to match the target resource redemption code with each of the candidate codes, so as to match the candidate code with the participating object of the target resource redemption code and determine the participating object as a resource allocation object; An allocation module is configured to allocate the reserve financial resource 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.

9. An electronic device, characterized in that: The electronic device comprises 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 7 when executing the computer program.

10. 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 7 when executed by a processor.

Images