CN113849557A - Trusted deposit certificate based data borrowing uplink method and device - Google Patents
Trusted deposit certificate based data borrowing uplink method and device Download PDFInfo
- Publication number
- CN113849557A CN113849557A CN202110972339.8A CN202110972339A CN113849557A CN 113849557 A CN113849557 A CN 113849557A CN 202110972339 A CN202110972339 A CN 202110972339A CN 113849557 A CN113849557 A CN 113849557A
- Authority
- CN
- China
- Prior art keywords
- borrowing
- borrow
- service
- amount
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 238000012545 processing Methods 0.000 claims description 10
- 238000004364 calculation method Methods 0.000 description 14
- 230000008901 benefit Effects 0.000 description 4
- 238000012512 characterization method Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/03—Credit; Loans; Processing thereof
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- Development Economics (AREA)
- Technology Law (AREA)
- General Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Computing Systems (AREA)
- Economics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The embodiment of the specification provides a trusted deposit certificate based uplink borrowing method and device. In the method, a first borrow date and a first borrow amount are determined; determining to-be-linked chain loans from the loans to be processed according to the first borrow date and the first borrow amount; calling a trusted credit-storing service interface, and uploading the to-be-linked chain borrow to a block chain; wherein the first borrowing date and the first borrowing amount satisfy: and when the to-be-linked chain borrow determined according to the first borrow term and the first borrow amount is uploaded to the block chain, the service added value of the credible credit accreditation service is larger than a preset value. The scheme of the embodiment of the specification can reduce the cost of the trusted certificate storing service and improve the service value of the trusted certificate storing service.
Description
Technical Field
One or more embodiments of the present disclosure relate to electronic information technology, and more particularly, to a trusted credit based uplink borrowing method and apparatus.
Background
In the credit business, a borrower borrows money from a lender, and the lender keeps the corresponding borrowing data so as to be used as borrowing evidence. Therefore, loans need to be kept properly. With the development of internet and block chain technologies, trusted evidence storage services have emerged. The method can utilize the credible credit card service to keep the loans, and comprises the following specific steps: and uploading the borrow to a block chain for certificate storage, so that the certificate storage cannot be tampered, is convenient for sharing by all parties, and is used as an electronic evidence when disputes occur.
However, uploading the borrow to the blockchain through a trusted credentialing method incurs costs. Therefore, if all the borrows are uploaded to the blockchain for verification, the cost is excessive.
Disclosure of Invention
One or more embodiments of the present specification describe a method and an apparatus for uploading borrow data based on trusted credit, which can solve the problem of excessive cost caused when all borrow data is uploaded to a block chain for credit.
According to a first aspect, a trusted credit based uplink borrowing method is provided, which includes:
determining a first borrowing date and a first borrowing amount;
determining to-be-linked chain loans from the loans to be processed according to the first borrow date and the first borrow amount;
calling a trusted credit-storing service interface, and uploading the to-be-linked chain borrow to a block chain;
wherein the first borrowing date and the first borrowing amount satisfy: and when the to-be-linked chain borrow determined according to the first borrow term and the first borrow amount is uploaded to the block chain, the service added value of the credible credit accreditation service is larger than a preset value.
Wherein the determining the first data term and the first debit amount comprises:
determining T and Y; wherein T represents the value range of the borrow data period, T comprises at least two borrow data periods, Y represents the value range of the borrow amount, and Y comprises at least two borrow amounts;
combining each debit date in T and each debit data amount in Y in pairs;
determining a target combination which enables the service value added of the credible evidence storage service to be larger than a preset value from each combination;
and determining the borrow data period in the target combination as the first borrow data period, and determining the borrow amount in the target combination as the first borrow amount.
Wherein, the T represents the value range of the minimum borrowing data period; the Y represents the value range of the minimum borrowing amount;
the determining the to-be-linked chain borrowing data from the to-be-processed borrowing data according to the first borrowing date and the first borrowing amount comprises the following steps of:
and determining the borrowing data of which the borrowing data period is not less than the first borrowing data period and the borrowing data amount is not less than the first borrowing data amount in each piece of to-be-processed borrowing data as the to-be-linked chain borrowing data.
Wherein, the service value added greater than the predetermined value comprises: the service value is the largest.
Wherein the determining a target combination from the combinations, which makes the service added value of the trusted deposit certificate service larger than a predetermined value, comprises:
for each combination, calculating the service income corresponding to the combination and calculating the service cost corresponding to the combination;
obtaining the service increment corresponding to the combination by utilizing the service income and the service cost corresponding to the combination;
and determining the combination corresponding to the maximum service value added as the target combination according to each service value added corresponding to each combination.
According to a second aspect, a trusted credit based uplink borrowing apparatus is provided, including:
a borrowing information determining module configured to determine a first borrowing term and a first borrowing amount; wherein the first borrowing date and the first borrowing amount satisfy: when the to-be-linked chain borrow determined according to the first borrow date and the first borrow amount is uploaded to a block chain, the service added value of the credible credit accreditation service is larger than a preset value;
the to-be-linked chain borrowing data determining module is configured to determine to-be-linked chain borrowing data from the to-be-processed borrowing data according to the first borrowing data term and the first borrowing amount;
and the uplink processing module is configured to call a trusted credit-storing service interface and upload the to-be-uplink borrowing data to the block chain.
Wherein the borrowing information determination module is configured to perform:
determining T and Y; wherein T represents the value range of the borrow data period, T comprises at least two borrow data periods, Y represents the value range of the borrow amount, and Y comprises at least two borrow amounts;
combining each debit date in T and each debit data amount in Y in pairs;
determining a target combination which enables the service value added of the credible evidence storage service to be larger than a preset value from each combination;
and determining the borrow data period in the target combination as the first borrow data period, and determining the borrow amount in the target combination as the first borrow amount.
Wherein, the T represents the value range of the minimum borrowing data period; the Y represents the value range of the minimum debit amount;
the pending uplink borrowing determination module is configured to perform: and determining the borrowing data of which the borrowing data period is not less than the first borrowing data period and the borrowing data amount is not less than the first borrowing data amount in each piece of to-be-processed borrowing data as the to-be-linked chain borrowing data.
Wherein the borrowing information determination module is configured to perform:
for each combination, calculating the service income corresponding to the combination and calculating the service cost corresponding to the combination;
obtaining the service increment corresponding to the combination by utilizing the service income and the service cost corresponding to the combination;
and determining the combination corresponding to the maximum service value added as the target combination according to each service value added corresponding to each combination.
According to a third aspect, there is provided a computing device comprising a memory having stored therein executable code and a processor that, when executing the executable code, implements a method as described in any of the embodiments of the present specification.
The credit-based debit data chaining method and device provided by the embodiments of the present specification determine which debit data in all the debit data are to-be-chained debit data according to the first debit data period and the first debit data amount, and only upload the determined to-be-chained debit data to the block chain. Because all the borrows do not need to be uploaded to the blockchain, the cost is reduced. On the other hand, the first borrow date and the first borrow amount meet the condition that the service added value of the credible credit card deposit service is larger than a preset value when the to-be-linked borrow data is uploaded to the block chain. Therefore, the service value of the credible credit card service is ensured.
Drawings
In order to more clearly illustrate the embodiments of the present specification or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present specification, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a schematic diagram of a system architecture to which one embodiment of the present description is applied.
Fig. 2 is a flowchart of a trusted credentialing service based uplink borrowing method in one embodiment of the present specification.
Fig. 3 is a flow chart of a method for determining a first debit data term and a first debit amount in one embodiment of the present description.
FIG. 4 is a flow diagram of a method of determining a combination of targets in one embodiment of the present description.
Fig. 5 is a schematic structural diagram of a trusted credit card service based uplink borrowing apparatus according to an embodiment of the present disclosure.
Detailed Description
The scheme provided by the specification is described below with reference to the accompanying drawings.
To facilitate understanding of the present specification, a system architecture to which the present specification applies will be described first. As shown in fig. 1, the system architecture mainly includes a credit system, a trusted credit server, and a blockchain system. Wherein the credit system is used for borrowing the borrower and generating the to-be-processed borrowing data. The credible deposit certificate server is used for determining to-be-linked chain borrowing and uploading the to-be-linked chain borrowing to the block chain system for deposit certificate. The credit system, the trusted deposit server and the blockchain system are interacted through a network. The network may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
Fig. 2 is a flowchart illustrating a trusted credit based uplink borrowing method according to an embodiment of the present disclosure. The main execution body of the method is a trusted deposit certificate based uplink borrowing device. The apparatus may be located in a trusted certificate store server as shown in figure 1. It is to be understood that the method may also be performed by any apparatus, device, platform, cluster of devices having computing, processing capabilities. Referring to fig. 2, the method includes:
step 201: determining a first borrowing date and a first borrowing amount; wherein the first borrow date and the first borrow amount satisfy: and when the to-be-linked borrow determined according to the first borrow date and the first borrow amount is uploaded to the block chain, the service added value of the credible credit accreditation service is larger than a preset value.
Step 203: and determining the to-be-linked chain borrowing data from the to-be-processed borrowing data according to the first borrowing date and the first borrowing amount.
Step 205: and calling a trusted credit-storing service interface, and uploading the to-be-linked chain borrow to the block chain.
As can be seen from the above-mentioned flow shown in fig. 2, in the embodiment of the present specification, on one hand, the amount of loans on the uplink cannot be too large, and all loans cannot be uploaded into the blockchain. Therefore, it is determined which loans in all the loans are to-be-uplink loans according to the boundary values, i.e., the first loan term and the first loan amount, and only the determined to-be-uplink loans are uploaded to the block chain. Compared with the prior art of chaining all borrowings, the method has the advantage that the cost is reduced. For example, uplink processing time of the server is reduced, occupation of processing resources of the server is reduced, and the like. As another example, the number of calls to the interface of the blockchain is reduced, thereby reducing call costs. On the other hand, the number of the uplink borrowings cannot be too small, and if the number of the uplink borrowings is too small, the electronic evidence of the subsequently available trusted deposit certificate cannot be guaranteed, so that the business value added by the trusted deposit certificate service is too small, and even loss is generated. Therefore, in the method shown in fig. 2, the boundary values, i.e., the first borrow date and the first borrow amount, which can ensure a better service added value are found, so that when the to-be-linked chain borrow is uploaded to the block chain, the service added value of the trusted deposit evidence service is greater than a predetermined value. In summary, the method shown in fig. 2 solves the problem of excessive cost caused by uploading all the borrows to the block chain for crediting, and ensures the business value of the trusted crediting service.
The following is a description of each step in fig. 2.
First, in step 201, a first data term and a first debit amount are determined.
On the one hand, if the amount of uplink borrowed data is too large, the cost is too high, and the business value of the trusted deposit certificate service is reduced. On the other hand, if the amount of uplink borrowed data is too small, the revenue will be too small, which also results in a decrease in the business value of trusted credit services. Therefore, it is desirable to find an appropriate amount of uplink borrowed data based on both revenue and cost by determining the boundary values, i.e., the first borrowed data period and the first borrowed amount.
The first borrow date and the first borrow amount can be regarded as boundary values, so that the boundary values are utilized to screen borrows which can be chained in subsequent processing.
In an embodiment of the present specification, an implementation process of this step 201 is shown in fig. 3, and includes:
step 2011: determining T and Y; wherein T represents the value range of the borrow data period, T comprises at least two borrow data periods, Y represents the value range of the borrow amount, and Y comprises at least two borrow amounts.
Step 2013: each debit term in T is combined with each debit amount in Y in pairs.
Step 2015: and determining a target combination which enables the service increment of the trusted evidence storing service to be larger than a preset value from all combinations.
Step 2017: and determining the borrow data period in the target combination as a first borrow data period, and determining the borrow data amount in the target combination as a first borrow data amount.
When the first borrow date and the first borrow amount are determined, if a value is directly given, for example, the first borrow date is set to be 3 (namely the borrowing time is 3 months), and the first borrow amount is set to be 1 ten thousand, the number of subsequently determined borrows needing to be linked up is lack of rationality, and the service value can not be increased greatly. Thus, by processing through the process shown in fig. 3, a suitable range is first given, and then the first borrowing period and the first borrowing amount are screened from the range.
The following is a description of each step in fig. 3.
First, for step 2011, determine T and Y; wherein T represents the value range of the borrow data period, T comprises at least two borrow data periods, Y represents the value range of the borrow amount, and Y comprises at least two borrow amounts.
In one implementation, the following ideas, denoted as idea 1, can be employed: the first borrowing date and the first borrowing amount correspond to the minimum borrowing date and the minimum borrowing amount which can be linked, and if the borrowing date of a piece of borrowing data is not less than the first borrowing date and the borrowing amount of the borrowing data is not less than the first borrowing amount, then the borrowing data can be linked. The reason for considering the minimum borrowing date and the minimum borrowing amount is as follows: under the same annual badness rate of a single loan, the bigger the period number is, the bigger the annual profit is, and the cost of the uplink is unchanged; under the same annual badness rate of a single loan, the larger the amount of money is, the larger the annual profit is, and the cost of the chain is unchanged.
According to the above-mentioned concept 1 of the embodiment of the present invention, in this step 2011, T represents a value range of the minimum borrow date; y represents the value range of the minimum debit amount. For example, T ═ 1, 3, 6, 9, 12, i.e., a value is found from the set as the minimum borrowing period number capable of uplink, i.e., the first borrowing period number. For another example, Y ≦ 50, Y ∈ N }, that is, a value is found from the natural numbers between 0 and 50 as the minimum debit amount that can be linked, i.e., the first debit amount.
The above idea 1 is only one implementation manner of this specification. In practical service implementation, other ideas may also be adopted, such as that the first borrowing term and the first borrowing amount are not the minimum value capable of uplink, but only a smaller value capable of uplink, and then, for example, 90% of uplink borrowings are: borrowing data of which the borrowing data term is not less than the first borrowing data term and the borrowing data amount is not less than the first borrowing data amount, wherein 10 percent of the uplink borrowing data are as follows: the borrowing period is smaller than the first borrowing period by a first preset value, and the borrowing amount is smaller than the first borrowing amount by a second preset value.
Next for step 2013, combine each debit term in T with each debit amount in Y, two by two.
Taking the above idea 1 as an example:
for example, if T is {1, 3, 6, 9, 12}, and Y is { Y |0 ≦ Y ≦ 50, Y ∈ N }, then it is necessary to combine the minimum borrowing data period 1 with each of the natural numbers in the minimum borrowing data amounts 0 to 50, then combine the minimum borrowing data period 3 with each of the natural numbers in the minimum borrowing data amounts 0 to 50, then combine the minimum borrowing data period 6 with each of the natural numbers in the minimum borrowing data amounts 0 to 50, and so on until the minimum borrowing data period 12 and each of the natural numbers in the minimum borrowing data amounts 0 to 50 are combined.
Next, for step 2015, a target combination that causes the value of service of the trusted credit service to be greater than a predetermined value is determined from the respective combinations. Wherein, the service value added being greater than the predetermined value may include: the service value is the largest. That is, the service added values corresponding to the respective combinations may be sorted in descending order, where the predetermined value may be the service added value ranked second, and when the service added value is greater than the service added value ranked second, the service added value is obtained as the largest. Therefore, in step 2015, the target combination that maximizes the service value of the trusted credit card service can be determined.
Referring to fig. 4, a specific implementation of step 2015 includes:
step 401: for each combination, calculating the service income corresponding to the combination and calculating the service cost corresponding to the combination;
step 403: obtaining the service increment corresponding to the combination by utilizing the service income and the service cost corresponding to the combination;
step 405: and determining the combination corresponding to the maximum service value as a target combination according to each service value corresponding to each combination.
In an embodiment of the present specification, for step 401, when calculating the business benefit corresponding to each combination, the business benefit corresponding to each combination may be calculated by using the following calculation formula (1):
wherein x represents the number of borrow periods in a combination, and x belongs to T; y represents the debit amount in a combination, and Y belongs to Y;
gain (x, y) characterization: the borrowing term number is the value of x in the current combination, and the borrowing amount is the service income when the value of y in the current combination;
i, j are variables;
Cntdebtrepresenting the number of the loans to be processed; for example, if there are 1 ten thousand pending loans, it is necessary to determine which loans of the 1 ten thousand pending loans are linked.
Ratiodebt(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]The proportion of the interval borrowed, S, K is a preset value;
in an embodiment of the present specification, for example, S may be 1000, K may be 1, and then the interval is (1000 × j, 1000 × (j +1) ];
AvgAmtdebt(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]Average payment amount of the borrowed data in the interval, wherein the average payment amount refers to the average borrowed amount;
RatiobadAmt(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]The reject ratio of the payment amount of the borrowing of the interval refers to the proportion of overdue non-repayment amount;
RatiobadReduce(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]The reduction proportion of the reject ratio of the branch brought by the uploading block chain of the section indicates the proportion of the collection of the payment.
The business income corresponding to each combination can be calculated through the calculation formula (1), namely, the amount of the returned money which is brought by urging after the borrowing data corresponding to the borrowing data period and the borrowing amount in the combination are uploaded to the block chain, namely, the amount of the lost account is reduced.
The above calculation formula (1) is only one implementation, and other calculation formulas such as a modification of the calculation formula (1) may be used in actual service implementation.
For step 401, when calculating the service cost corresponding to each combination, the service cost corresponding to each combination may be calculated in the following three ways:
mode 1:
calculated using the following calculation equation (2):
since uploading a loan to a blockchain may result in technical costs for uplink and judicial costs for uplink, both costs are considered in the calculation (2).
Wherein x represents the number of borrow periods in a combination, and x belongs to T; y represents the debit amount in a combination, and Y belongs to Y;
cost (x, y) characterization: the borrowing term is the value of x in the current combination, and the borrowing amount is the service cost when the value of y in the current combination;
i, j are variables;
Cntdebtrepresenting the number of the loans to be processed;
Ratiodebt(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]The proportion of the interval to be borrowed;
CostperDebtthe technical cost of each uplink borrow is represented as a set value, for example, each uplink borrow needs to generate an interface calling cost of 0.5 yuan when uploading the blockchain, and for example, each uplink borrow needs to consume a manual processing cost of 0.3 yuan when uploading the blockchain.
AvgDebtCntperson(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]Borrowing data quantity of the corresponding person according to the borrowing data of the interval;
RatiobadCnt(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]The reject ratio of the number of people for payment in the section refers to the proportion of the number of people who do not pay for payment;
Ratiolitigation(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]The litigation proportion of the bad population in the interval, wherein the litigation proportion of the bad population refers to the proportion of raising judicial litigation for the number of people who do not pay for the repayment;
Costlitigation(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]The litigation cost of the litigation crowd in the interval.
Mode 2:
when a borrow is uploaded to a block chain, according to the service setting and the actual service expenditure, only the technical cost of uplink can be generated, but the judicial litigation cost of uplink is not generated, so that the following calculation formula (3) can be adopted for calculation:
mode 3: when uploading a borrow to a blockchain, according to the business setting and the actual expenditure, only the judicial litigation cost of the uplink can be generated, but the technical cost of the uplink is not generated, so that the following calculation formula (4) can be adopted for calculation:
in the step 403, when the service gain and the service cost corresponding to the combination are used to obtain the service added value corresponding to the combination, the service gain may be subtracted by the service cost to obtain the service added value corresponding to the combination.
For step 405 above, in an embodiment of the present specification, the following idea, denoted as idea 2, may be adopted: the first borrow date and the first borrow amount correspond to the maximum service increment capable of chaining, that is, when the first borrow date and the first borrow amount are used for calculating the service income and the service cost, the calculated difference between the service income and the service cost is maximum, namely the service increment is maximum, so that the income is maximized.
Under the idea 2, the process of the step 405 can be embodied by the following calculation formula (5):
the finally obtained combination of x and y is the target combination. Accordingly, the values of x and y in the target combination are the first borrow term and the first borrow amount.
The processing in step 201 in fig. 2 is completed, and the first borrow date and the first borrow amount are determined, so that when the to-be-linked chain borrowed data determined according to the first borrow date and the first borrow amount is uploaded to the block chain, the service added value of the trusted credit card service is greater than a predetermined value (for example, the service added value is the largest).
Next, in step 203, the to-be-linked loan is determined from the to-be-processed loans according to the first loan term and the first loan amount.
If the above-mentioned concept 1 is adopted in the above-mentioned step 201, in this step 203, a piece of borrowing data of which the borrowing data term is not less than the first borrowing data term and the borrowing data amount is not less than the first borrowing data amount in each piece of to-be-processed borrowing data is determined as the to-be-linked chain borrowing data. For example, if the determined first borrow date is 6 and the first borrow amount is 1 ten thousand, then, for a piece of borrow data, if the borrow data simultaneously satisfies that the borrow date is not less than 6, for example, the borrow date is 12, and the borrow amount is not less than 1 ten thousand, for example, the borrow amount is 1.2 ten thousand, then the borrow data may be determined as the to-be-uplink borrow data, and the interface uplink is called in subsequent step 205.
In one embodiment of the present disclosure, a trusted credit based uplink borrowing apparatus is provided, and referring to fig. 5, the apparatus 500 includes:
a borrowing information determining module 501 configured to determine a first borrowing term and a first borrowing amount; wherein the first borrowing date and the first borrowing amount satisfy: when the to-be-linked chain borrow determined according to the first borrow date and the first borrow amount is uploaded to a block chain, the service added value of the credible credit accreditation service is larger than a preset value;
a to-be-linked chain borrow determining module 502 configured to determine to-be-linked chain borrows from the to-be-processed loans according to the first borrow term and the first borrow amount;
the uplink processing module 503 is configured to invoke a trusted credentialing service interface, and upload the to-be-uplink loan to the block chain.
In one embodiment of the apparatus of the present specification, the borrowing information determining module 501 is configured to perform:
determining T and Y; wherein T represents the value range of the borrow data period, T comprises at least two borrow data periods, Y represents the value range of the borrow amount, and Y comprises at least two borrow amounts;
combining each debit date in T and each debit data amount in Y in pairs;
determining a target combination which enables the service value added of the credible evidence storage service to be larger than a preset value from each combination;
and determining the borrow data period in the target combination as the first borrow data period, and determining the borrow amount in the target combination as the first borrow amount.
In an embodiment of the apparatus of the present disclosure, the T represents a value range of the minimum borrowing period; the Y represents the value range of the minimum debit amount;
accordingly, the to-be-uplink-borrow determining module 502 is configured to perform: and determining the borrowing data of which the borrowing data period is not less than the first borrowing data period and the borrowing data amount is not less than the first borrowing data amount in each piece of to-be-processed borrowing data as the to-be-linked chain borrowing data.
In one embodiment of the apparatus of the present disclosure, T comprises: 1,3,6,9, 12.
In one embodiment of the apparatus of the present disclosure, Y comprises: from 0 to 50.
In one embodiment of the apparatus of the present specification, the borrowing information determining module 501 is configured to perform:
for each combination, calculating the service income corresponding to the combination and calculating the service cost corresponding to the combination;
obtaining the service increment corresponding to the combination by utilizing the service income and the service cost corresponding to the combination;
and determining the combination corresponding to the maximum service value added as the target combination according to each service value added corresponding to each combination.
In one embodiment of the apparatus of the present specification, the borrowing information determining module 501 is configured to perform:
calculating the business profit corresponding to each combination by using the following calculation formula:
wherein x represents the number of borrow data periods and belongs to T; y represents the debit amount, and Y belongs to Y;
gain (x, y) characterization: the borrowing term number is the value of x in the current combination, and the borrowing amount is the service income when the value of y in the current combination;
i, j are variables;
Cntdebtcharacterizing the quantity of the loans to be processed;
Ratiodebt(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]The proportion of the interval to be borrowed; s, K are all predetermined values;
AvgAmtdebt(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]Average amount of debits between intervals;
RatiobadAmt(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]Bad rates of the borrowing amounts of the intervals;
RatiobadReduce(i, j) characterizing that in said pending borrowed data, the borrow time period is i, and the borrow amount is (S + j, S + K)]The borrowing of the interval is uploaded to the reduction ratio of the bad supporting rate caused by the block chain.
In one embodiment of the apparatus of the present specification, the borrowing information determining module 501 is configured to perform: calculating the service cost corresponding to each combination by using any one of the following calculation formulas:
wherein x represents the number of borrow data periods and belongs to T; y represents the debit amount, and Y belongs to Y;
cost (x, y) characterization: the borrowing term is the value of x in the current combination, and the borrowing amount is the service cost when the value of y in the current combination;
i, j are variables;
Cntdebtcharacterizing the quantity of the loans to be processed;
Ratiodebt(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]The proportion of the interval to be borrowed; s, K are all predetermined values.
CostperDebtCharacterizing the technical cost of each borrow uplink;
AvgDebtCntperson(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]Borrowing data quantity of the corresponding person according to the borrowing data of the interval;
RatiobadCnt(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]The reject rate of the number of the branch users in the section;
Ratiolitigation(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]Litigation ratios of interval bad populations;
Costlitigation(i, j) characterizing that in the loans to be processed, the term of the eligible loans is i, and the amount of the loans is (S + j, S + K)]The litigation cost of the litigation crowd in the interval.
In one embodiment of the apparatus of the present disclosure, Cost (x, y) satisfies the following conditional expression:
wherein Cnt iscreditRepresenting the credit granting people number corresponding to the to-be-processed borrowing data; α is a predetermined constant.
An embodiment of the present specification provides a computer-readable storage medium having stored thereon a computer program which, when executed in a computer, causes the computer to perform the method of any of the embodiments of the specification.
One embodiment of the present specification provides a computing device comprising a memory and a processor, the memory having stored therein executable code, the processor implementing a method in accordance with any one of the embodiments of the specification when executing the executable code.
It is to be understood that the illustrated construction of the embodiments herein is not to be construed as limiting the apparatus of the embodiments herein specifically. In other embodiments of the description, the apparatus may include more or fewer components than illustrated, or some components may be combined, some components may be separated, or a different arrangement of components may be used. The illustrated components may be implemented in hardware, software, or a combination of software and hardware.
For the information interaction, execution process and other contents between the modules in the above-mentioned apparatus and system, because the same concept is based on the embodiment of the method in this specification, specific contents may refer to the description in the embodiment of the method in this specification, and are not described herein again.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, as for the apparatus embodiment, since it is substantially similar to the method embodiment, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
Those skilled in the art will recognize that, in one or more of the examples described above, the functions described in this disclosure may be implemented in hardware, software, hardware, or any combination thereof. When implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium.
The above-mentioned embodiments, objects, technical solutions and advantages of the present invention are further described in detail, it should be understood that the above-mentioned embodiments are only exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made on the basis of the technical solutions of the present invention should be included in the scope of the present invention.
Claims (10)
1. The data borrowing uplink method based on the credible deposit certificate comprises the following steps:
determining a first borrowing date and a first borrowing amount;
determining to-be-linked chain loans from the loans to be processed according to the first borrow date and the first borrow amount;
calling a trusted credit-storing service interface, and uploading the to-be-linked chain borrow to a block chain;
wherein the first borrowing date and the first borrowing amount satisfy: and when the to-be-linked chain borrow determined according to the first borrow term and the first borrow amount is uploaded to the block chain, the service added value of the credible credit accreditation service is larger than a preset value.
2. The method of claim 1 wherein said determining a first debit data term and a first debit amount comprises:
determining T and Y; wherein T represents the value range of the borrow data period, T comprises at least two borrow data periods, Y represents the value range of the borrow amount, and Y comprises at least two borrow amounts;
combining each debit date in T and each debit data amount in Y in pairs;
determining a target combination which enables the service value added of the credible evidence storage service to be larger than a preset value from each combination;
and determining the borrow data period in the target combination as the first borrow data period, and determining the borrow amount in the target combination as the first borrow amount.
3. The method of claim 2, wherein,
the T represents the value range of the minimum borrowing date; the Y represents the value range of the minimum borrowing amount;
the determining the to-be-linked chain borrowing data from the to-be-processed borrowing data according to the first borrowing date and the first borrowing amount comprises the following steps of:
and determining the borrowing data of which the borrowing data period is not less than the first borrowing data period and the borrowing data amount is not less than the first borrowing data amount in each piece of to-be-processed borrowing data as the to-be-linked chain borrowing data.
4. The method of claim 2, wherein the service added value being greater than a predetermined value comprises: the service value is the largest.
5. The method of claim 4, wherein the determining a target combination from the combinations that causes the value of service of the trusted credit service to be greater than a predetermined value comprises:
for each combination, calculating the service income corresponding to the combination and calculating the service cost corresponding to the combination;
obtaining the service increment corresponding to the combination by utilizing the service income and the service cost corresponding to the combination;
and determining the combination corresponding to the maximum service value added as the target combination according to each service value added corresponding to each combination.
6. Borrow data cochain device based on trusted deposit certificate includes:
a borrowing information determining module configured to determine a first borrowing term and a first borrowing amount; wherein the first borrowing date and the first borrowing amount satisfy: when the to-be-linked chain borrow determined according to the first borrow date and the first borrow amount is uploaded to a block chain, the service added value of the credible credit accreditation service is larger than a preset value;
the to-be-linked chain borrowing data determining module is configured to determine to-be-linked chain borrowing data from the to-be-processed borrowing data according to the first borrowing data term and the first borrowing amount;
and the uplink processing module is configured to call a trusted credit-storing service interface and upload the to-be-uplink borrowing data to the block chain.
7. The apparatus of claim 6, wherein the collateral information determination module is configured to perform:
determining T and Y; wherein T represents the value range of the borrow data period, T comprises at least two borrow data periods, Y represents the value range of the borrow amount, and Y comprises at least two borrow amounts;
combining each debit date in T and each debit data amount in Y in pairs;
determining a target combination which enables the service value added of the credible evidence storage service to be larger than a preset value from each combination;
and determining the borrow data period in the target combination as the first borrow data period, and determining the borrow amount in the target combination as the first borrow amount.
8. The apparatus of claim 7, wherein T characterizes a range of values for a minimum number of borrow data periods; the Y represents the value range of the minimum debit amount;
the pending uplink borrowing determination module is configured to perform: and determining the borrowing data of which the borrowing data period is not less than the first borrowing data period and the borrowing data amount is not less than the first borrowing data amount in each piece of to-be-processed borrowing data as the to-be-linked chain borrowing data.
9. The apparatus of claim 7, wherein the collateral information determination module is configured to perform:
for each combination, calculating the service income corresponding to the combination and calculating the service cost corresponding to the combination;
obtaining the service increment corresponding to the combination by utilizing the service income and the service cost corresponding to the combination;
and determining the combination corresponding to the maximum service value added as the target combination according to each service value added corresponding to each combination.
10. A computing device comprising a memory having executable code stored therein and a processor that, when executing the executable code, implements the method of any of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110972339.8A CN113849557B (en) | 2021-08-24 | 2021-08-24 | Borrowing and uplink method and device based on trusted memory card |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110972339.8A CN113849557B (en) | 2021-08-24 | 2021-08-24 | Borrowing and uplink method and device based on trusted memory card |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113849557A true CN113849557A (en) | 2021-12-28 |
| CN113849557B CN113849557B (en) | 2024-08-06 |
Family
ID=78976032
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110972339.8A Active CN113849557B (en) | 2021-08-24 | 2021-08-24 | Borrowing and uplink method and device based on trusted memory card |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113849557B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109409886A (en) * | 2018-10-29 | 2019-03-01 | 杭州复杂美科技有限公司 | Pledge loaning bill method, equipment and storage medium |
| CN110084602A (en) * | 2019-04-30 | 2019-08-02 | 杭州复杂美科技有限公司 | A kind of shielded debt-credit method and system of privacy information, equipment and storage medium |
| CN110264348A (en) * | 2019-05-07 | 2019-09-20 | 北京奇艺世纪科技有限公司 | A kind of processing method, device and the storage medium of cochain of trading |
| CN111078745A (en) * | 2019-12-20 | 2020-04-28 | 京东数字科技控股有限公司 | Data uplink method and device based on block chain technology |
| WO2020098084A1 (en) * | 2018-11-13 | 2020-05-22 | 平安科技（深圳）有限公司 | Processing method and apparatus for loan service, and computer device |
| CN111986025A (en) * | 2020-09-02 | 2020-11-24 | 深圳壹账通智能科技有限公司 | Loan transaction processing method and system based on block chain |
| CN112926980A (en) * | 2021-02-26 | 2021-06-08 | 贵州鑫众搏骏科技有限公司 | Payment data transaction method based on block chain |
| TWM615249U (en) * | 2021-04-26 | 2021-08-01 | 兆豐國際商業銀行股份有限公司 | Lending system based on blockchain |
-
2021
- 2021-08-24 CN CN202110972339.8A patent/CN113849557B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109409886A (en) * | 2018-10-29 | 2019-03-01 | 杭州复杂美科技有限公司 | Pledge loaning bill method, equipment and storage medium |
| WO2020098084A1 (en) * | 2018-11-13 | 2020-05-22 | 平安科技（深圳）有限公司 | Processing method and apparatus for loan service, and computer device |
| CN110084602A (en) * | 2019-04-30 | 2019-08-02 | 杭州复杂美科技有限公司 | A kind of shielded debt-credit method and system of privacy information, equipment and storage medium |
| CN110264348A (en) * | 2019-05-07 | 2019-09-20 | 北京奇艺世纪科技有限公司 | A kind of processing method, device and the storage medium of cochain of trading |
| CN111078745A (en) * | 2019-12-20 | 2020-04-28 | 京东数字科技控股有限公司 | Data uplink method and device based on block chain technology |
| CN111986025A (en) * | 2020-09-02 | 2020-11-24 | 深圳壹账通智能科技有限公司 | Loan transaction processing method and system based on block chain |
| CN112926980A (en) * | 2021-02-26 | 2021-06-08 | 贵州鑫众搏骏科技有限公司 | Payment data transaction method based on block chain |
| TWM615249U (en) * | 2021-04-26 | 2021-08-01 | 兆豐國際商業銀行股份有限公司 | Lending system based on blockchain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113849557B (en) | 2024-08-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2020192272A1 (en) | Blockchain-based transfer method and system, computing device and storage medium | |
| US20100017315A1 (en) | Resource-allocation processing system and approach with adaptive-assessment processing | |
| CN111738844A (en) | Resource allocation system, method and device based on block chain | |
| CN112132674A (en) | Transaction processing method and device | |
| WO2019196257A1 (en) | Automatic repayment method and system, and terminal device | |
| CN111833179A (en) | Resource allocation platform, resource allocation method and device | |
| CN111784509A (en) | Dynamic verification method and device, electronic equipment and storage medium | |
| CN109615508A (en) | Data summarization checking method and subsystem for internet banking system | |
| CN109146674A (en) | A kind of method and system of Dynamic Matching loaning bill platform fund | |
| CN114282011B (en) | Knowledge graph construction method and device, and graph calculation method and device | |
| CN110634066A (en) | Method, device and equipment for determining settlement interest | |
| CN114004701A (en) | Method and device for generating transaction result, electronic equipment and storage medium | |
| CN117828209A (en) | Data preloading method in transaction system and electronic equipment | |
| CN111681092B (en) | Resource scheduling method, server, electronic equipment and storage medium | |
| CN117541172A (en) | Hot account concurrent processing method, device and equipment based on sub-account splitting | |
| CN112907361A (en) | Method and device for processing loan application | |
| CN112465613A (en) | Loan interest parameterization counting and submitting method and device | |
| CN113849557A (en) | Trusted deposit certificate based data borrowing uplink method and device | |
| CN111640000A (en) | Data source calling method based on real-time decision | |
| CN111429251A (en) | Method and device for processing data under multiple modes | |
| CN111192041A (en) | Resource transfer method and resource transfer device | |
| CN112182400B (en) | Message processing method, message processing device, electronic equipment and storage medium | |
| CN112950358A (en) | Traceable financial market transaction guarantee management method, device, equipment and medium | |
| CN113283981A (en) | Data splitting method and device, computer equipment and storage medium | |
| CN112907362A (en) | Loan transaction processing method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |