Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments may be embodied in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the example embodiments to those skilled in the art.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the disclosed aspects may be practiced without one or more of the specific details, or with other methods, components, devices, steps, etc. In other instances, well-known methods, devices, implementations, or operations are not shown or described in detail to avoid obscuring aspects of the disclosure.
The block diagrams depicted in the figures are merely functional entities and do not necessarily correspond to physically separate entities. That is, the functional entities may be implemented in software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.
The flow diagrams depicted in the figures are exemplary only, and do not necessarily include all of the elements and operations/steps, nor must they be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the order of actual execution may be changed according to actual situations.
In this exemplary embodiment, a system architecture for implementing a processing method of credit return data is provided first, and may be applied to various data processing scenarios, for example: the processing of the repayment data of the sponsor in the credit business, the repayment data of the lender in the credit business, etc.
Referring to fig. 1, the system architecture 100 may include terminals 101, 102, 103, a network 104, and a server 105. The network 104 is used as a medium to provide communication links between the terminals 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
The user may interact with the server 105 via the network 104 using the terminals 101, 102, 103 to receive or send request instructions or the like. Various communication client applications, such as a picture processing application, a shopping class application, a web browser application, a search class application, an instant messaging tool, a mailbox client, social platform software, etc., may be installed on the terminals 101, 102, 103.
Terminals 101, 102, 103 may be a variety of electronic devices having a display screen and supporting web browsing, including but not limited to smartphones, tablets, laptop and desktop computers, and the like. Specifically, in the embodiment provided in the technical solution, the terminals 101, 102, 103 may schematically represent a plurality of sponsor terminals, and the server 105 may schematically represent the above-mentioned refund processing server.
The server 105 may be a server providing various services, such as receiving sponsor duty ratios (by way of example only) for a plurality of sponsors corresponding to a target credit service entered by a sponsor user using the terminals 101, 102, 103. The refund processing server may determine a refund total amount of the target credit service in each of the M stages, and determine a refund amount of the first sponsor in the kth stage (by way of example only) based on a sum of the refund total amounts of the first k stages, a fund ratio of the first sponsor, and a sum of the refund amounts that the first sponsor has obtained, to send the refund amount of the first sponsor in the kth stage to the corresponding sponsor terminal via the refund processing server.
In the calculation of the refund data of the credit service, when the total refund is cut, the amount of money is less than 0.01 yuan after the cut, and rounding is needed to solve the problem, thus causing errors. Meanwhile, the existence of such an error is inevitable in combination with the actual situation.
However, when the number of stages of a credit service is large, if the total refund of each stage is divided according to the respective fund ratios according to the scheme provided by the related art, an error may be very large, so that the final refund amount ratio of each sponsor is not matched with the fund ratio.
The following is an example: in a credit service, borrowers borrow 0.48 yuan, and the sponsor comprises two parties, namely a sponsor A and a sponsor B. Wherein, the fund of the fund party A is 0.14 yuan, and the fund ratio is 30%; the fund of sponsor B is 0.34 yuan, then its fund ratio is 70%. Specifically, the credit service is staged for 12 stages, and the following data of the refund principal of the sponsor A, B are recorded according to a single granularity of the stages:
TABLE 1
Referring to the summary data in Table 1, it can be seen that the total amount of the return funds for sponsor A after 12 stages is 0.12 yuan, which is less than the 0.14 yuan of the funds they pay; meanwhile, the total sum of the returned principal of the sponsor B after 12 stages is 0.36 yuan, which is more than 0.34 yuan of the fund. It can be seen that while the payback principal amount of the borrower in this credit service is unchanged (i.e., the payback principal amount in table 1), the payback principal amount is changed for sponsor a and sponsor B, and the end result is not distributed in terms of the payback duty ratio.
The following provides a method for processing credit return data based on the system architecture 100 in fig. 1, which at least solves the problem of low processing accuracy of the existing credit return data to some extent.
In an exemplary embodiment, fig. 2 shows a flow diagram of a method of processing credit return data, applied to information interaction between a return processing server and a plurality of sponsor terminals, according to an embodiment of the present disclosure. Referring to fig. 2, the method for processing credit return data may include the steps of:
step S210, obtaining the fund ratios of a plurality of sponsors corresponding to a target credit service from a plurality of sponsor terminals through a fund returning processing server, wherein the target credit service is divided into M stages, and M is an integer larger than 1;
step S220, determining the refund total amount of each of the M stages of the target credit business through the refund processing server; the method comprises the steps of,
and step S230, determining the refund quota of the first sponsor in the kth stage according to the sum of the refund total quota of the previous k stages, the fund ratio of the first sponsor and the sum of the refund quota obtained by the first sponsor through the refund processing server, so as to send the refund quota of the first sponsor in the kth stage to the corresponding sponsor terminal through the refund processing server, wherein k is a positive integer less than or equal to M.
In the technical solution of the embodiment shown in fig. 2, the payoff ratios of a plurality of sponsors corresponding to a target credit service are obtained from a plurality of sponsor terminals through a payoff processing server, and then the payoff total amount corresponding to each stage of the target credit service is determined through the payoff processing server. Further, the calculation method of the refund quota of the kth period for the first sponsor adopts: and determining by the refund processing server according to the sum of the refund total amounts of the first k stages, the fund ratio of the first sponsor, and the sum of the refund scores obtained by the first sponsor. The refund share of the kth stage is corrected by accumulating principal errors through the first k stages. Therefore, the technical scheme adopts a calculation mode of summarizing the amounts to reduce the generation of errors, and the technical scheme can ensure that the error of the refund quota in each period does not exceed 1 part.
Details of the implementation of the individual steps shown in fig. 2 are explained in detail below:
in an exemplary embodiment, in a multi-stage credit service, the payback of each stage of the sponsor includes both principal and interest. In this embodiment, description will be made with respect to the return of the principal part. That is, the total amount of the return is the total amount of the return principal, and the return share is the return principal.
In an exemplary embodiment, in step S210, the funding ratios of a plurality of sponsors corresponding to a target credit service are obtained from a plurality of sponsor terminals through a refund processing server, where the target credit service is M stages, and M is an integer greater than 1.
Exemplary, the above-mentioned target credit service includes three sponsors and their sponsor ratios: [ sponsor A, sponsor B, sponsor C ] and sponsor C. Wherein, a% + b% + c% = 100%.
In an exemplary embodiment, in step S220, a refund total amount for each of the M installments for the target credit service is determined by the refund processing server.
Illustratively, the total amount of refund for each stage refers to the refund Jin Eshu of the lender in each stage, and since there are multiple payouts, the total amount of refund is divided into multiple copies, so that each payout can obtain a corresponding refund (referred to as a refund amount) during the stage.
For example, for the target credit service described above, the total amount of refunds corresponding to each of the M segments may be the same; the method can also be as follows: the sum of the returns of the first stage is x 1 The second is that the sum of the refunds in the stage is x 2 … …, that is, the amount of refund corresponding to each of the M phases may be different. However, the sum of the total amount of the M staged returns is the same as the total amount of the loan for the target credit business described above.
The total amount of the refund of each stage can be calculated according to the total amount of the loan of the target credit business and the M stages. For example, for the target credit service described above, the total amount of refunds corresponding to each of the M segments may be the same. The sum of the returns for each stage may be based on the quotient of the loan sum X of the target credit service and the M stages.
In an exemplary embodiment, in step S230, the payback share of the first sponsor in the kth stage is determined by the payback processing server according to the sum of payback sums of the first k stages, the payback ratio of the first sponsor, and the sum of payback principal that the first sponsor has obtained, so that the payback share of the first sponsor in the kth stage is sent to the corresponding payback terminal by the payback processing server.
In an exemplary embodiment, in order to ensure that the sum of the payback principal scores of the respective payouts obtained by the splitting is equal to the payback principal sum (i.e., referring to table 1, "payback sum" = "a payback score" + "B payback score") in each line, therefore, in determining the payback principal score of the respective payouts in each stage, any one of the plurality of payouts of the above-described target credit service is regarded as the second payoff party, and the other payouts other than the second payoff party are regarded as the first payoff party. Wherein the first sponsor determines the refund principal (which may be referred to as "first refund principal") in each of its minutes using the scheme provided in step S230. After the first payback principal in the kth stage is determined, a difference between the payback principal in the kth stage and the payback principal of the first sponsor in the kth stage is calculated as the payback principal of the second sponsor in the kth stage (which may be referred to as a "second payback principal").
In an exemplary embodiment, fig. 3 is a schematic flow chart of a method for determining the first refund score in each stage according to an embodiment of the disclosure, which may be used as a specific implementation of step S230. Referring to fig. 3, the method for determining the refund share may include the steps of:
step S310, determining a first amount by the refund processing server according to the sum of the refund total of the first k stages and the fund ratio of the first sponsor; the method comprises the steps of,
step S320, calculating, by the payback processing server, a difference between the first amount and the sum of the obtained payback amounts as a payback amount of the first sponsor at the kth stage.
In an exemplary embodiment, the detailed implementation of step S310 and step S320 is described in detail in connection with table 2 below. In this embodiment, the stage number M of the target credit service is 12, and the target credit service includes two sponsors.
TABLE 2
In an exemplary embodiment, the method for calculating the first refund principal share of the kth stage by the first sponsor includes: in step S310, a first amount is determined by the payback processing server according to the sum of the total amounts of the paybacks of the first k stages and the payback ratio of the first sponsor. Further, in step S320, a difference between the first amount and the sum of the refund principal points obtained by the first sponsor is calculated by the refund processing server as the first refund principal point of the first sponsor in the kth stage.
Illustratively, at k with respect to the first sponsorFirst refund principal point P of each stage k The calculation can be based on the following formula:
wherein,representing the sum of the paybacks of the first k stages, Q i Money amount representing the i-th stage,/-money amount>Representing the sum of the principal points of the refund obtained by the first sponsor, P i Representing the principal credit earned by the first sponsor at the ith stage.
Referring to table 2, when k=1, there is no return before the first stage, the "sum of the return principal amounts of the first k stages" is the return principal total amount corresponding to the first stageFurther, if the fund ratio of the first sponsor is 30%, the first amount may be determined as: 0.04 x 30% = 0.012 yuan. And because the first sponsor does not pay back before the first stage, the sum of the payback principal scores obtained by the first sponsor is zero. Whereas the amount is generally accurate to "x-ary y-angle z-minutes", the first amount is rounded to 0.01 yuan. In summary, the first payoff principal of the first sponsor at stage 1 is 0.01 yuan.
For example, when k=2, the sum of the total amounts of the returns of the first k stages is the total amount of the return corresponding to the first stage The return principal sum corresponding to the second stage +.>And (3) summing; further, in step S310, since the fund ratio of the first sponsor is 30%, the first amount may be determined as: (0.04+0.04) ×30% =0.024 element. Further, the sum of the obtained return principal points is the return principal point (0.01 yuan) obtained in the first stage, in step S320, and obtaining the return principal credit of the first sponsor in the 2 nd stage as 0.014 yuan by making a difference between the first amount of money 0.024 and the sum of the obtained return principal credits of 0.01. Whereas the amount is generally accurate to "x-ary y-angle z minutes", the first return principal in stage 2 is 0.01 yuan.
For example, when k=3, the sum of the return sums of the first k phases is the return sum corresponding to the first three phasesAnd (3) summing; further, in step S310, since the fund ratio of the first sponsor is 30%, the first amount may be determined as: (0.04×3) ×30% =0.036 yuan. Further, the sum of the obtained return principal scores is the sum of the return principal scores obtained in the first two stages (0.01 element +0.01 element = 0.02 element), in step S320, and obtaining the return principal point of the first sponsor in the 3 rd stage as 0.024 yuan by making a difference between the first amount of 0.036 yuan and the sum of the obtained return principal points of 0.02 yuan. Whereas the amount is generally accurate to "x-ary y-angle z minutes", the first return principal in stage 3 above is 0.02 yuan.
Similarly, when k has a value of 4 to 12, the first principal point of the first payback of the first sponsor in the kth stage can be calculated in the above manner.
In an exemplary embodiment, the method of determining the second payback principal share for the second sponsor at the kth stage is as follows:
referring to table 2, when k=1, the second payoff principal at stage 1 is the second payoff principal: the difference between the total amount of the return principal in the 1 st stage and the first return principal in the 1 st stage is 0.04-0.01=0.03 yuan.
Referring to table 2, when k=2, the second payoff principal at stage 2 is the second payoff principal: the difference between the total amount of the return principal in the 2 nd stage and the first return principal in the 2 nd stage is 0.04-0.01=0.03 yuan.
Referring to table 2, when k=3, the second payoff principal at stage 3 is the second payoff principal: the difference between the total amount of the return principal in the 3 rd stage and the first return principal in the 3 rd stage is 0.04-0.02=0.02 yuan.
Similarly, when k has a value of 4 to 12, the second principal point of return of the second sponsor in the kth stage can be calculated in the above manner.
As can be seen from the above embodiments, the return principal share of the kth stage is corrected by accumulating principal errors for the first k stages. Therefore, the technical scheme adopts a calculation mode of summarizing the amounts to reduce the generation of errors, and the technical scheme can ensure that the error of the return principal share in each period does not exceed 1 share.
After the above embodiments explain the principal determination method in the refund of each sponsor, the following embodiments explain the interest determination method in the refund of each sponsor.
In an exemplary embodiment, FIG. 4 shows a flow diagram of a method of processing credit return data according to another embodiment of the disclosure. Referring to fig. 4, the method for processing credit return data may include the steps of:
step S410, obtaining the fund ratios of a plurality of sponsors corresponding to a target credit service from a plurality of sponsor terminals through a fund returning processing server, wherein the target credit service is M stages, and M is an integer greater than 1;
step S420, calculating, by the refund processing server, refund interest amounts of each stage according to the loan amounts, interest rate information and the M stages of the target credit business;
step S430, determining, by the refund processing server, a second amount according to the sum of the refund interest amounts of the first k stages and the fund ratio of the first sponsor; the method comprises the steps of,
step S440, calculating the difference value of the sum of the second amount and the obtained refund interest amount through the refund processing server, and using the difference value as the refund interest amount of the first sponsor in the kth stage, so as to send the refund interest amount of the second sponsor in the kth stage to the corresponding sponsor terminal through the refund processing server.
In an exemplary embodiment, the specific implementation of step S410 is the same as the specific implementation of step S210, and will not be described herein.
In an exemplary embodiment, in the step S420, the refund interest amount of each stage is calculated by the refund processing server according to the loan amount, interest rate information, and the M stages of the target credit service.
Illustratively, the interest rate information includes a daily interest rate, a monthly interest rate, an annual interest rate, and the like. Taking the daily interest rate as an example, the total amount of the refund funds in each of the M stages and the number of days in each stage are calculated according to the specific embodiment of step S220, and the total amount of the refund interest in the kth stage can be calculated.
In an exemplary embodiment, the above-mentioned step S430 and step S440 may be another specific implementation manner of step S230.
In an exemplary embodiment, in step S430, a second amount is determined by the payback processing server from the sum of the total of payback interest amounts for the first k installments and the payback ratio of the first sponsor; and calculating, by the refund processing server, a difference value of the sum of the second amount and the obtained refund interest amount as a refund interest amount of the first sponsor in the kth stage to send the refund interest amount of the second sponsor in the kth stage to a corresponding sponsor terminal by the refund processing server in step S440.
Exemplary, the kth stage at the kth with respect to the first sponsorRefund interest share P k ' may be calculated according to the following formula:
wherein P is k A first payback principal credit at a kth stage representing a first sponsor,representing the sum of the total amount of interest paid back for the first k stages, R representing interest information, Q i Representing the i-th staged return principal sum,representing the sum of the refund interest fractions obtained by the first sponsor, P i Representing the principal credit earned by the first sponsor at the ith stage.
The embodiment of step S430 is the same as the embodiment of step S310, and the embodiment of step S440 is the same as the embodiment of step S320, which are not described herein.
According to the solution provided by the embodiment shown in fig. 4, a first refund interest score of a first investor in a kth stage can be determined, and a second refund principal score of a second investor in a kth stage can be determined. The return interest share of the kth stage is corrected by accumulating interest errors in the first k stages. Therefore, the technical scheme adopts a calculation mode of summarizing the amounts to reduce the generation of errors, and by way of example, the technical scheme can ensure that the errors of the refund interest fractions in each period are not more than 1 division, thereby effectively ensuring the refund interests of each sponsor and being beneficial to improving the credit experience of the sponsor.
The following describes an embodiment of an apparatus of the present disclosure that may be used to perform the above-described method of processing credit return data of the present disclosure.
Fig. 5 shows a schematic structural diagram of a processing apparatus for credit return data according to an embodiment of the present disclosure, and referring to fig. 5, the processing apparatus 500 for credit return data is applied to information interaction between a return processing server and a plurality of sponsor terminals, including: an acquisition module 501, a refund total amount determination module 502, and a refund share determination module 503.
The acquiring module 501 is configured to: obtaining the fund ratios of a plurality of sponsors corresponding to a target credit service from a plurality of sponsor terminals through a fund returning processing server, wherein the target credit service is divided into M stages, and M is an integer larger than 1;
the determining module returns total amount determining module 502 is configured to: determining, by the refund processing server, a refund total amount for each of the M stages of the target credit service; the method comprises the steps of,
the refund quota determination module 503 is configured to: determining, by the refund processing server, a refund share of the first sponsor in a kth stage according to a sum of refund sums of the first k stages, a refund duty ratio of the first sponsor, and a sum of refund shares obtained by the first sponsor, so as to send the refund share of the first sponsor in the kth stage to a corresponding sponsor terminal through the refund processing server, where k is a positive integer less than or equal to M.
In some embodiments of the present disclosure, based on the foregoing scheme, the refund quota determination module 503 is further configured to: calculating a difference between the total amount of the refund in the kth stage and the refund amount of the first sponsor in the kth stage as a refund amount of the second sponsor in the kth stage by the refund processing server, so as to send the refund amount of the second sponsor in the kth stage to a corresponding sponsor terminal by the refund processing server.
In some embodiments of the disclosure, based on the foregoing, the second sponsor is any one of the plurality of sponsors.
In some embodiments of the present disclosure, based on the foregoing solution, the refund total determining module 502 is specifically configured to: and calculating the total amount of the refund of each stage according to the total amount of the loan of the target credit business and the M stages by the refund processing server.
In some embodiments of the present disclosure, based on the foregoing solution, the refund quota determination module 503 includes: a first amount determination unit 5031 and a return principal share calculation unit 5032.
Wherein:
the first amount determining unit 5031 is configured to: determining, by the refund processing server, a first amount based on a sum of the refund totals of the first k installments and a fund ratio of the first sponsor;
The return principal share calculating unit 5032 is configured to: and calculating a difference between the first amount and the sum of the obtained refund scores as a refund score of the kth stage by the refund processing server.
In some embodiments of the disclosure, based on the foregoing scheme, the refund total is a refund principal total, and the refund quota is a refund principal quota.
In some embodiments of the present disclosure, based on the foregoing scheme, the refund total determination module 502 is specifically further configured to: calculating, by the refund processing server, a refund interest amount for each of the M stages according to the loan amount, interest rate information, and the M stages of the target credit service;
in this embodiment, the refund quota determination module 503 further includes: a second amount determination unit 5033 and a refund interest share calculation unit 5034. Wherein:
the second amount determining unit 5033 is configured to: determining, by the payback processing server, a second amount based on a sum of the total of payback interest amounts for the first k installments and a payback ratio of the first sponsor;
the refund interest share calculation unit 5034 is configured to: calculating a difference between the second amount and the sum of the obtained refund interest amounts as a refund interest amount of the second sponsor in the kth stage by the refund processing server, so as to send the refund interest amount of the second sponsor in the kth stage to a corresponding sponsor terminal by the refund processing server.
Since each functional module of the processing apparatus for credit return data according to the exemplary embodiment of the present disclosure corresponds to a step of the exemplary embodiment of the processing method for credit return data described above, for details not disclosed in the embodiments of the apparatus of the present disclosure, please refer to the embodiments of the processing method for credit return data described above in the present disclosure.
It should be noted that although in the above detailed description several modules or units of a device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit in accordance with embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into a plurality of modules or units to be embodied.
Furthermore, although the steps of the methods in the present disclosure are depicted in a particular order in the drawings, this does not require or imply that the steps must be performed in that particular order or that all illustrated steps be performed in order to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step to perform, and/or one step decomposed into multiple steps to perform, etc.
From the above description of embodiments, those skilled in the art will readily appreciate that the example embodiments described herein may be implemented in software, or may be implemented in software in combination with the necessary hardware. Thus, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disk, a mobile hard disk, etc.) or on a network, including several instructions to cause a computing device (may be a personal computer, a server, a mobile terminal, or a network device, etc.) to perform the method according to the embodiments of the present disclosure.
In an exemplary embodiment of the present disclosure, a computer storage medium capable of implementing the above method is also provided. On which a program product is stored which enables the implementation of the method described above in the present specification. In some possible embodiments, the various aspects of the present disclosure may also be implemented in the form of a program product comprising program code for causing a terminal device to carry out the steps according to the various exemplary embodiments of the disclosure as described in the "exemplary methods" section of this specification, when the program product is run on the terminal device.
Referring to fig. 6, a program product 600 for implementing the above-described method according to an embodiment of the present disclosure is described, which may employ a portable compact disc read-only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present disclosure is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The program product described above may take the form of any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium would include the following: an electrical connection having one or more wires, a portable disk, a hard disk, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
The computer readable signal medium may include a data signal propagated in baseband or as part of a carrier wave with readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of remote computing devices, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., connected via the Internet using an Internet service provider).
In addition, in an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.
Those skilled in the art will appreciate that the various aspects of the present disclosure may be implemented as a system, method, or program product. Accordingly, various aspects of the disclosure may be embodied in the following forms, namely: an entirely hardware embodiment, an entirely software embodiment (including firmware, micro-code, etc.) or an embodiment combining hardware and software aspects may be referred to herein as a "circuit," module "or" system.
An electronic device 700 according to such an embodiment of the present disclosure is described below with reference to fig. 7. The electronic device 700 shown in fig. 7 is merely an example and should not be construed to limit the functionality and scope of use of embodiments of the present disclosure in any way.
As shown in fig. 7, the electronic device 700 is embodied in the form of a general purpose computing device. Components of electronic device 700 may include, but are not limited to: the at least one processing unit 710, the at least one memory unit 720, and a bus 730 connecting the different system components, including the memory unit 720 and the processing unit 710.
Wherein the storage unit stores program code that is executable by the processing unit 710 such that the processing unit 710 performs steps according to various exemplary embodiments of the present disclosure described in the "exemplary method" section of the present specification. For example, the processing unit 710 may perform the operations as shown in fig. 2: step S210, obtaining the fund ratios of a plurality of sponsors corresponding to a target credit service from a plurality of sponsor terminals through a fund returning processing server, wherein the target credit service is divided into M stages, and M is an integer larger than 1; step S220, determining the refund total amount of each of the M stages of the target credit business through the refund processing server; and step S230, determining the refund quota of the first sponsor in the kth stage according to the sum of the refund total quota of the previous k stages, the fund ratio of the first sponsor and the sum of the refund quota obtained by the first sponsor through the refund processing server, so as to send the refund quota of the first sponsor in the kth stage to the corresponding sponsor terminal through the refund processing server, wherein k is a positive integer less than or equal to M.
For example, the processing unit 710 may also perform a blockchain-based payment information processing method as shown in fig. 2 or 3 or 4.
The memory unit 720 may include readable media in the form of volatile memory units, such as Random Access Memory (RAM) 7201 and/or cache memory 7202, and may further include Read Only Memory (ROM) 7203.
The storage unit 720 may also include a program/utility 7204 having a set (at least one) of program modules 7205, such program modules 7205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment.
Bus 730 may be a bus representing one or more of several types of bus structures including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.
The electronic device 700 may also communicate with one or more external devices 800 (e.g., keyboard, pointing device, bluetooth device, etc.), one or more devices that enable a user to interact with the electronic device 700, and/or any device (e.g., router, modem, etc.) that enables the electronic device 700 to communicate with one or more other computing devices. Such communication may occur through an input/output (I/O) interface 750. Also, the electronic device 700 may communicate with one or more networks such as a Local Area Network (LAN), a Wide Area Network (WAN) and/or a public network, such as the Internet, through a network adapter 770. As shown, network adapter 760 communicates with other modules of electronic device 700 over bus 730. It should be appreciated that although not shown, other hardware and/or software modules may be used in connection with electronic device 700, including, but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, data backup storage systems, and the like.
From the above description of embodiments, those skilled in the art will readily appreciate that the example embodiments described herein may be implemented in software, or may be implemented in software in combination with the necessary hardware. Thus, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disk, a mobile hard disk, etc.) or on a network, including several instructions to cause a computing device (may be a personal computer, a server, a terminal device, or a network device, etc.) to perform the method according to the embodiments of the present disclosure.
Furthermore, the above-described figures are only schematic illustrations of processes included in the method according to the exemplary embodiments of the present disclosure, and are not intended to be limiting. It will be readily appreciated that the processes shown in the above figures do not indicate or limit the temporal order of these processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, for example, among a plurality of modules.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any adaptations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.