JP6234539B1 - Data structure, information processing apparatus, program, information processing method, and transaction system - Google Patents

Abstract

A data structure, an information processing apparatus, a program, or a method related to a debt transaction that is easy for a user to use. In an information processing apparatus, in a transaction system using a block chain, transaction data related to a block chain includes first debt amount data indicating an amount related to a first debt and a credit indicating a creditor of the first debt. And data specifying a transaction indicating the second receivable possessed by the first obligor associated with the first debt or data specifying a part of the transaction indicating the second receivable. [Selection] Figure 5

Description

The technology disclosed in the present application relates to an information processing apparatus, a program, an information processing method, and a transaction system that execute a data structure related to a debt transaction or information processing related to the debt transaction.

Since financial transactions deal with a large amount of information, techniques for processing financial transactions with computers have been developed. However, since electronic information processed by a computer can be easily falsified, it is necessary to strengthen security when handling information related to financial transactions. For example, there is a means using encryption as disclosed in Japanese Patent No. 5871347 (Patent Document 1). In addition, a technique for processing debts of financial transactions has been proposed as disclosed in JP 2014-99198 A (Patent Document 2).

Japanese Patent No. 5871347 JP 2014-99198 A

However, the desired debt transaction has not been realized by the prior art described in the above technical documents.
Therefore, according to various embodiments of the present invention, a data structure, an information processing apparatus, a program, or a method related to a debt transaction that can be easily used by a user is provided.

An embodiment of the present invention is an information processing apparatus or transaction system having first transaction data having debt amount data indicating an amount related to a debt and creditor data indicating a creditor of the debt, wherein the first transaction The data relates to a transaction system using a block chain, wherein the transaction system handles underlying debtor data, which is data associating the first transaction data with information relating to the debtor's underlying debtor. The information processing apparatus or transaction system.

An embodiment of the present invention is an information processing apparatus or transaction system further comprising: second transaction data having information relating to the debtor of the debt.

An embodiment of the present invention is transaction data related to a block chain, and includes an information processing apparatus having the transaction data, including debt amount data indicating an amount related to a debt and creditor data indicating a creditor of the debt, or Transaction system.

In one embodiment of the present invention, a first transaction data having debt amount data indicating an amount related to a debt and creditor data indicating a creditor of the debt, and a second transaction having information relating to an original debtor of the debt An information processing apparatus or transaction system having data, wherein the first transaction data and the second transaction data are related to a block chain.

In one embodiment of the present invention, a first transaction data having debt amount data indicating an amount related to a debt and creditor data indicating a creditor of the debt, and a second transaction having information relating to an original debtor of the debt An information processing apparatus or transaction system having data, wherein the first transaction data and the second transaction data relate to a transaction system using a block chain.

An embodiment of the present invention relates to an information processing apparatus or transaction characterized in that the transaction system handles underlying debtor data that is data associating the first transaction data with information relating to the debtor's underlying debtor. system.

An embodiment according to the present invention is an information processing apparatus or transaction system having first transaction data having debt amount data indicating an amount related to a debt and creditor data indicating a creditor of the debt,
The first transaction data relates to a transaction system using a block chain, and the transaction system handles underlying debtor data, which is data associating the first transaction data with information relating to the debtor debtor. The information processing apparatus or transaction system as a feature.

In one embodiment of the present invention, the sum of the debt amount data in the transaction system increases by a value different from a value based on a rule defined in the transaction system as the first transaction data is generated. An information processing apparatus or a transaction system.
The information relating to the debtor of the debt may be part of transaction data.
The information related to the debtor's underlying debtor may be any information that can directly or indirectly identify the underlying debtor. For example, the public key of the obligor, a part of the public key, a value obtained by applying a hash function to the public key, T data issued by the obligor, or a part of the T data may be used.
In addition, in the present specification, the data indicating a party and the data indicating a third party are similarly public key, a part of the public key, a value obtained by applying a hash function to the public key, The issued T data or a part of the T data may be used. In addition, the third party may be a real person or a corporation, a fictitious person who does not exist, or a person set on the system.

The value based on the rule defined in the transaction system indicates a value (reward amount) based on a rule of reward given based on mining in Bitcoin, for example. Therefore, the value different from the value based on the rule defined in the transaction system is, for example, the amount of data generated based on the instructions of the parties based on the contract between the parties, the debt amount of the debt, There is an amount related to the data generated with the approval in the system, or an amount related to the data generated based on the approval by the administrator of the system. Even if a fee is required when issuing data related to debt, the debt amount is added in addition to the fee, so the total amount of the debt amount and the fee is the rule defined in the transaction system. The value is different from the value based on.

One embodiment of the present invention is a transaction system using a block chain,
The transaction data related to the blockchain includes debt amount data indicating the amount related to the debt and creditor data indicating the creditor of the debt, and the transaction system relates to the transaction data and the original debtor of the debt An information processing apparatus or transaction system having the transaction data, wherein the debtor data having information associated therewith is handled.

An embodiment of the present invention is an information processing apparatus having the transaction data, wherein the total of the debt amount data in the transaction system increases as the transaction data is generated.
One embodiment of the present invention is characterized in that a sum of the debt amount data of all the transaction data increases as the transaction data is generated.
An information processing apparatus having the transaction data. The total of the data indicating the amount related to the debt may be increased by the data indicating the amount related to the debt of the transaction data as the transaction data is generated.

Here, the sum of the debt amount data in the transaction system or the sum of the debt amount data of all the transaction data does not include a used transaction in Bitcoin. In one embodiment of the present invention, unlike the bit coin which increases only due to excavation such as mining, it increases with the generation of the transaction data.

In one embodiment of the present invention, the transaction system handles first transaction data and third transaction data, and creditor data in the first transaction data and creditor data in the third transaction data. Are the same party, an information processing apparatus or a transaction system. Here, the creditor data in the first transaction data and the creditor data in the third transaction data indicate the same party. The creditor data in the first transaction data and the third transaction data Or the creditor data in the first transaction data and the creditor data in the third transaction data are associated with each other as pointing to the same party. Can be mentioned. If the data is the same, it can be determined by comparing the data. If the data to be associated exists, it can be determined by determining the presence / absence of the data to be associated. In the present specification, when the identity of a party or the identity of a third party is shown, a similar method may be taken.

In one embodiment of the present invention, debt amount data related to fourth transaction data having data indicating the second party as creditor data in a first party and a second party, which are a plurality of parties of multilateral netting, An information processing apparatus or a transaction system, characterized in that the first party is different from an amount related to an original obligation of the second party.

One embodiment of the present invention is first data indicating a transaction, including debt amount data indicating an amount related to a debt, creditor data indicating a creditor of the debt, and third data other than the debtor of the debt. Data relating to impersonation prevention for preventing impersonation of the first data by a person, wherein the transaction system using the first data includes the first data and the original debt of the debt An information processing apparatus or a transaction system having the first data, wherein the obligor debtor data having information related to the person in charge is handled.

In one embodiment of the present invention, debt amount data indicating an amount related to a debt, creditor data indicating a creditor of the debt, and spoofing of the first data by a third party other than the debtor of the debt are prevented. An information processing apparatus or transaction system comprising: first data indicating a transaction having data relating to impersonation prevention for performing; and second data indicating a transaction having information relating to the debtor's original obligor.

An embodiment of the present invention is characterized in that the transaction system using the first data handles underlying debtor data having the first data and information relating to the underlying debtor of the debt in association with each other. Device or transaction system.

In one embodiment of the present invention, the sum of the debt amount data of the first data in the transaction system is different from a value based on a rule defined in the transaction system as the first data is generated. An information processing apparatus or transaction system characterized by increasing by value.

In one embodiment of the present invention, the total of the debt amount data of all the first data increases with the generation of the first data, and the information processing apparatus having the first data Or a transaction system. Note that the sum of the data indicating the amount related to the debt may increase by the data indicating the amount related to the debt of the first data as the first data is generated.

In one embodiment of the present invention, the transaction system handles one first data and another first data, and creditor data in the first data and in the other first data. Information processing apparatus or transaction system, characterized in that the creditor data of each indicates the same party.

According to an embodiment of the present invention, the debt amount data relating to the first data having the data indicating the second party as creditor data in the first party and the second party which are a plurality of parties of multilateral netting, An information processing apparatus or a transaction system, characterized in that the first party differs from an amount related to an original debt held by the second party.

In one embodiment of the present invention, in a transaction system using a block chain, the transaction data related to the block chain includes debt amount data indicating the amount related to the debt and creditor data indicating the creditor of the debt. A program which operates as setting means for setting, means for handling underlying debtor data having the transaction data and information relating to the debtor's underlying debtor associated with each other.

In one embodiment of the present invention, in a transaction system using a block chain, a computer uses debt amount data indicating an amount related to a debt and creditor data indicating a creditor of the debt as transaction data related to the block chain. A setting step of setting, and a method in which the computer retains an obligor holding step of associating and holding the transaction data and information relating to the debtor obligor.

In one embodiment of the present invention, in a first party that is a party in multi-lateral netting and a second party that is different from the first party, the computer shows a debt to the first party from the party other than the first party. In transaction data, setting the first party in the creditor data; and in the transaction data indicating a debt from the party other than the second party to the second party, the second party in the transaction data Setting to creditor data.

One embodiment of the present invention is a transaction system using a block chain,
The transaction data related to the blockchain has the first debt amount data indicating the amount related to the first debt, the creditor data indicating the creditor of the first debt, and the first debtor related to the first debt. An information processing apparatus or transaction system having the transaction data, the data specifying transaction data indicating a second bond, or data specifying a part of transaction data indicating the second bond.

An embodiment of the present invention is an information processing apparatus or transaction system, wherein the transaction system handles underlying debtor data having the transaction data and information related to the underlying debtor of the debt in association with each other.

In one embodiment of the present invention, the total of the debt amount data of all the transaction data increases as the transaction data is generated. . The total of the data indicating the amount related to the debt may be increased by the data indicating the amount related to the debt of the transaction data as the transaction data is generated.

In one embodiment of the present invention, the total debt amount included in the transaction data is a debt related to data specifying transaction data indicating the second bond or data specifying a part of transaction data indicating the second bond An information processing apparatus or transaction system characterized by being identical to a forehead.

One embodiment of the present invention is first data indicating a transaction, first debt amount data indicating an amount related to a first debt, creditor data indicating a creditor of the first debt, and the first data Information specifying the first data indicating the second receivable possessed by the first obligor associated with the debt, or data identifying a part of the first data indicating the second receivable Device or transaction system.

In one embodiment of the present invention, the transaction system that handles the first data handles underlying debtor data having the first data and information relating to the underlying debtor of the debt in association with each other. Device or transaction system.

In one embodiment of the present invention, the total of the debt amount data of all the first data increases with the generation of the first data, and the information processing apparatus having the first data . Note that the sum of the data indicating the amount related to the debt may increase by the data indicating the amount related to the debt of the first data as the first data is generated.

In one embodiment of the present invention, the total debt amount of the first data is data specifying the first data indicating the second claim or data specifying a part of the first data indicating the second claim. An information processing apparatus or a transaction system, characterized in that the information processing apparatus has the same debt amount.

According to an embodiment of the present invention, in a transaction system using a block chain, a debt amount in which first debt amount data indicating an amount related to a first obligation is set in the first transaction data related to the block chain. Data setting means, creditor data setting means for setting first creditor data indicating a first creditor of the first debt, second debt amount data and second credit data in the second transaction data relating to the block chain A program which operates as transaction setting means for setting data for specifying the first transaction data set by one creditor or data for specifying a part of the first transaction data.

An embodiment of the present invention is a data structure indicating a transaction, wherein data indicating at least one amount related to a first debt and transaction data indicating a claim possessed by the first debtor related to the first debt are specified. And a data structure that specifies a part of transaction data indicating the bond, and the sum of the data indicating the amount is the same as the bond amount related to the transaction data indicating the bond A data structure characterized by

One embodiment of the present invention is a transaction system using a block chain,
The computer sets a debt amount data setting step for setting first debt amount data indicating the amount related to the first debt in the first transaction data relating to the block chain, and a first indicating the first creditor of the first debt. The creditor data setting step for setting 1 creditor data, and the computer includes the first transaction data in which the first debt amount data and the first creditor are set in the second transaction data related to the block chain. And a transaction setting step of setting data specifying a part of the first transaction data.

According to an embodiment of the present invention, transaction data in a transaction system using a block chain includes the transaction data having amount data indicating a debt amount and transaction date data indicating a date related to the transaction of the debt. A transaction system including one information processing apparatus.
In one embodiment of the present invention, a transaction system is characterized in that a date related to the transaction of the debt is a settlement date of the debt.

In one embodiment of the present invention, transaction data in a transaction system using a block chain includes amount data indicating a debt amount and transaction date data indicating a date related to the transaction of the debt, and the transaction data is A transaction system comprising the first information processing apparatus having the transaction data, which is not valid by the date including the date related to the transaction.

The term “invalid” means that the target transaction data is data that does not indicate information related to the existing debt, for example, the debt amount, the party related to the debt, and the like. For example, when distribution means is applied to target transaction data and other transaction data is generated, renewal means is applied and other transaction data is generated, or discarding means is applied Or transaction data that is not an object to be displayed.

In one embodiment of the present invention, based on the transaction date data or the data related to the transaction date data, the second information processing device related to the debtor of the debt or the third information processing device related to the creditor of the debt A transaction system having a fourth information processing device for generating information to be provided.
An embodiment of the present invention provides a transaction based on information provided from the second information processing apparatus related to the debtor of the debt or the third information processing apparatus related to the creditor of the debt. A transaction system comprising a fifth information processing device that generates data or information that enables processing corresponding to the debt of a third party.

An embodiment of the present invention includes a sixth information processing device that generates information that enables processing corresponding to the debt in transaction data or a third party based on information related to transaction data. Transaction system.
Here, the first to sixth information processing apparatuses may be different information processing apparatuses or the same information processing apparatus.
One embodiment of the present invention is a transaction system comprising: generation means for generating information for displaying a list of at least a part of the transaction data based on data indicating a date related to the transaction.

In one embodiment of the present invention, in a transaction system using a block chain, a setting means for setting amount data indicating a debt amount and data relating to the transaction date of the debt, the transaction date data or the Based on data related to transaction date data, the information processing device related to the debtor of the debt or the information processing device related to the creditor of the debt is operated as a generation unit that generates information to be provided. Program to do.

In one embodiment of the present invention, in a transaction system using a block chain, a setting means for setting amount data indicating a debt amount and data relating to the transaction date of the debt, the transaction date data or the A program that operates as generation means for generating transaction data or information that enables processing corresponding to the debt in a third party based on data related to transaction date data.

One embodiment of the present invention is a transaction system using a block chain,
A setting step in which the computer sets amount data indicating the amount of debt and data related to the transaction date of the debt, and the computer uses the transaction date data or the data related to the transaction date data to determine the debt of the debt A generation step of generating information to be provided to the information processing apparatus related to the person or the information processing apparatus related to the debtor of the debt.

According to an embodiment of the present invention, in a transaction system using a block chain, a setting step in which a computer sets amount data indicating a debt amount and data relating to a transaction date of the debt, and a computer A generation step of generating information that enables processing corresponding to the debt in transaction data or a third party based on date data or data relating to the transaction date data.

An embodiment of the present invention is a data structure indicating a transaction, which includes amount data indicating a debt amount, transaction date data indicating a date related to the transaction of the debt, and a command for generating the data structure by a third party. And a data structure for preventing impersonation for preventing impersonation.

In one embodiment of the present invention, first data indicating a transaction for performing multilateral netting includes data indicating a third party different from a party of the multilateral netting, and the first data includes the multi data An information processing apparatus or transaction system having the first data, wherein the information is data relating to a debt between the parties of lateral netting.

One embodiment of the present invention is the information processing apparatus or transaction system, wherein the first data further includes data specifying a transaction related to the one debt between the parties of the multilateral netting.

In one embodiment of the present invention, the first data is converted from the amount of debt that the first party has to the parties related to the multilateral netting other than the first party to the multilateral netting other than the first party. And an information processing apparatus or transaction system further comprising data indicating an amount obtained by deducting the amount of debt that the party has from the first party.

In one embodiment of the present invention, the first data indicates a transaction for performing multilateral netting between the first party and a party related to the multilateral netting other than the first party. An information processing apparatus or a transaction system generated based on data.

According to an embodiment of the present invention, in a transaction system using a block chain, transaction data for multi-lateral netting related to the block chain includes data indicating a third party different from a party of the multi-lateral netting. The information processing apparatus or transaction system having the transaction data, wherein the transaction data is data related to a debt between the parties of the multilateral netting.

An embodiment of the present invention is the information processing apparatus or transaction system, wherein the transaction data further includes data specifying a transaction related to the one debt between the parties of the multilateral netting.

In one embodiment of the present invention, the transaction data is calculated based on the amount of debt that the first party who is a creditor related to the debt has from the amount of debt held by the parties related to the multilateral netting other than the first party. And an information processing apparatus or transaction system further comprising data indicating an amount obtained by subtracting the amount of debt held by the party related to the multilateral netting other than the party from the first party.

In one embodiment of the present invention, the first data is transaction data indicating a transaction for performing multilateral netting between the first party and a party related to the multilateral netting other than the first party. An information processing apparatus or a transaction system generated based on

In one embodiment of the present invention, a first data structure indicating a transaction for performing multilateral netting has data indicating a third party different from a party of the multilateral netting, and the first data structure includes: A data structure, which is a data structure related to a debt between the parties of the multilateral netting.

One embodiment of the present invention is the data structure, wherein the first data structure further includes data specifying a transaction related to the one debt between the parties of the multilateral netting.
In one embodiment of the present invention, the first data structure indicates that the multi-lateral netting other than the first party is based on the amount of debt that the first party has to the parties related to the multi-lateral netting other than the first party. A data structure further comprising data indicating an amount obtained by deducting the amount of debt the first party has to the first party.

According to an embodiment of the present invention, the first data indicating a transaction for performing multilateral netting includes, as data relating to the debt between the parties of the multilateral netting, a third party different from the parties of the multilateral netting. A third party setting means for setting data indicative of a debt amount, a debt amount setting means for setting a debt amount related to the first party,
An information processing apparatus or a transaction system.

An embodiment of the present invention is an information processing apparatus, and further includes transaction information setting means for setting data for specifying a transaction relating to the one debt between the parties of the multilateral netting. Processing device or transaction system.
According to an embodiment of the present invention, the computer sets data indicating a third party different from the party of the multilateral netting as the creditor data of the first data indicating a transaction for performing the multilateral netting. Operating as a debt amount data setting means for setting data indicating the debt amount from the first party to the second party related to multilateral netting as the debt amount of the first data. Program to do.

In one embodiment of the present invention, the computer further sets transaction information setting for specifying data indicating data indicating a transaction relating to a debt of the second party from the first party between the parties of the multilateral netting A program characterized by operating as a means. According to an embodiment of the present invention, in a method for performing multilateral netting, data indicating a third party different from the parties of the multilateral netting is set as data relating to the debt between the parties of the multilateral netting. A third party setting step, a debt amount setting step for setting a debt amount relating to the first party, and a transaction information setting for setting data for specifying a transaction relating to the one debt between the parties in the multilateral netting And a method comprising:

One embodiment of the present invention includes data indicating the third party and data indicating the first debt amount in the first party and the second party that are parties of multilateral netting and a third party other than the party. Based on one data and second data including data indicating the second party and data indicating a second debt amount, the computer converts the data indicating the second party related to the second data into third data. A step of setting the creditor data of the third data, and the computer calculates a smaller data among the data indicating the first debt amount of the first data and the data indicating the second debt amount of the second data as the debt of the third data A method of performing multi-lateral netting comprising: setting to monetary data.

In one embodiment of the present invention, fourth data including data indicating the third party and data indicating a fourth debt amount, and fifth data including data indicating the third party and data indicating a fifth debt amount The computer further comprises: setting, as the first data, fifth data related to a fifth debt amount that is larger than data indicating a fourth debt amount related to the fourth data.

In one embodiment of the present invention, sixth data including data indicating the sixth party and data indicating the sixth debt amount, and seventh data including data indicating the seventh party and data indicating the seventh debt amount, A computer further comprising setting, as the second data, seventh data relating to a seventh debt amount larger than data indicating a sixth debt amount relating to the sixth data.

In an embodiment of the present invention, the computer has the largest eighth debt amount among a plurality of eighth data having data indicating the third party and data indicating the eighth debt amount as the first data. Setting the eighth data.

In an embodiment of the present invention, the computer has the largest ninth debt amount among a plurality of ninth data including, as the second data, data indicating a ninth party and data indicating a ninth debt amount. Setting the ninth data.

One embodiment of the present invention is a block including data indicating a third party and data indicating a first debt amount in a first party and a second party that are parties of multilateral netting and a third party other than the parties. Based on the first transaction related to the chain and the second transaction related to the block chain including the data indicating the second party and the data indicating the second debt amount, the computer performs the second party related to the second data. Data indicating the first debt amount of the first data and the data indicating the second debt amount of the second data. Setting a small amount of data as the amount data of the third transaction, How to do a multi-lateral netting to obtain.

According to an embodiment of the present invention, the computer includes the fourth debt among a plurality of fourth transactions related to a block chain having data indicating the third party and data indicating a fourth debt amount as the first transaction. Setting the fourth transaction with the largest amount.

In one embodiment of the present invention, the fifth debt amount among a plurality of fifth transactions relating to a block chain in which the computer has data indicating a fifth party and data indicating a fifth debt amount as the second transaction. Setting the fifth transaction having the largest value.

One embodiment of the present invention includes data indicating the third party and data indicating the first debt amount in the first party and the second party that are parties of multilateral netting and a third party other than the party. Based on one data and second data including data indicating the second party and data indicating the second debt amount, the data indicating the second party related to the second data is converted into a creditor of the third data. The creditor data setting means for setting the data, the smaller data among the data indicating the first debt amount of the first data and the data indicating the second debt amount of the second data, the debt amount data of the third data An information processing apparatus or a transaction system capable of multi-lateral netting.

In an embodiment of the present invention, the first data is the fourth data having the largest fourth debt amount among a plurality of fourth data having data indicating the third party and data indicating a fourth debt amount. The second data is the fifth data having the largest fifth debt amount among a plurality of fifth data including data indicating the fifth party and data indicating the fifth debt amount. An information processing apparatus or a transaction system.

An embodiment of the present invention relates to a data structure related to a multilateral netting transaction in a first party and a second party that are parties of multilateral netting and a third party other than the parties, The first data including data indicating the first debt amount and the second data including the second party data and the second data including the data indicating the second debt amount. A data structure including data indicating two parties, data indicating a first debt amount of the first data, and data smaller than data indicating a second debt amount of the second data.

In an embodiment of the present invention, the first data is the third data having the largest third debt amount among a plurality of third data having data indicating the third party and data indicating a third debt amount. The second data is the fourth data having the largest fourth debt amount among a plurality of fourth data including data indicating the fourth party and data indicating the fourth debt amount. A data structure characterized by

One embodiment of the present invention includes data indicating the third party and data indicating the first debt amount in the first party and the second party that are parties of multilateral netting and a third party other than the party. Based on the first data and the second data including the data indicating the second party and the data indicating the second debt amount, the computer indicates the data indicating the second party related to the second data as the third data. The creditor data setting means for setting the creditor data of the first data, the smaller of the data indicating the first debt amount of the first data and the data indicating the second debt amount of the second data, the debt of the third data A program capable of multilateral netting, which is operated as a debt amount setting means to be set in amount data.

In an embodiment of the present invention, the first data is the fourth data having the largest fourth debt amount among a plurality of fourth data having data indicating the third party and data indicating a fourth debt amount. The second data is the fifth data having the largest fifth debt amount among a plurality of fifth data including data indicating the fifth party and data indicating the fifth debt amount. A program characterized by

In the underlying debtor data, which is data that associates the transaction data with information relating to the debtor's underlying debtor, the transaction data is information that identifies the transaction data, for example, ID information, partial information of the ID , Information obtained by applying a hash function to the information, and the information relating to the obligor includes, for example, information identifying the obligor, information indicating the obligor, information relating to the public key of the obligor, A part of information related to the public key, information obtained by applying a hash function to the information, and the like can be given.

The amount may be a virtual currency amount or a currency amount.
The data for preventing impersonation that prevents the generation of the transaction by the debtor includes, for example, data relating to means using a public encryption method. For example, a public key, a part of the public key, a value obtained by processing the public key with a hash function, a part of the value, an encryption key, a part of the encryption key, and the like can be given.

The data indicating the creditor of the debt may be data that can identify the creditor alone or data that can identify the creditor in combination with other means. For example, the public key in the public key cryptosystem used by the creditor may be a public key or a part of the public key, or the information on which the public key is changed within a range that does not hinder the identification of the creditor. (For example, a hash value obtained by applying a hash function to a public key) may be used. In addition, since there can be a plurality of information specifying the same creditor, all the data specifying the creditor may not be the same or different in the system using this data structure.

A transaction indicates a process. This may or may not correspond to the number of real world transactions. For example, data for multiple transactions may be created when there is one transaction in the real world, or a data structure for one transaction may be created when there are multiple transactions in the real world. . Moreover, a part of this data structure may correspond to an actual transaction.
The total amount of debt is not a fixed upper limit of the amount of money generated as in bit coins, but can be increased without limit.

An embodiment of the present invention is a data structure indicating a transaction, data indicating an amount related to a debt, data indicating a creditor of the debt, data indicating a release condition for using the transaction, Data of a script that solves the cancellation condition.

The release condition data for using a transaction is a condition that needs to be satisfied when generating a transaction that the debtor bears the debt. Examples include, but are not limited to, a public key or an address indicating a debtor when a public cryptosystem is used.

The data indicating the creditor of the debt and the data indicating the release condition for using the transaction may function as impersonation prevention means.
The public key or the address related to the debtor and the public key or the secret key corresponding to the address may be data related to the spoofing prevention means.

The embodiment of the present invention is characterized in that the transaction is generated by permission of both the first obligor and the second obligor related to the transaction indicating the receivable possessed by the obligor. Data structure.

The obligor's permission indicates that the obligor's permission is required for the targeted transaction, and the obligor's permission for the transaction indicating the claim held by the obligor is the obligor of the claim held by the obligor. Or a person who can become a debtor of the receivable by distribution described in this specification.

An embodiment of the present invention is a data structure indicating a transaction, the data structure including data indicating a debt amount and data indicating a date related to the transaction of the debt.

The date relating to the transaction of the debt may be anything as long as it is related to the debt. For example, it may be a date related to a debt, or may be a date related to a debt opposite to the debt when the debt is a two-way contract. The date related to the debt may be the date related to the commencement of negotiations on the contract related to the debt, the date related to the agreement on the contract related to the debt, the signing date of the contract related to the debt, the transaction date related to the debt or the settlement date . Further, there may be one or a plurality of days related to the transaction of the debt that the data structure has. It should be noted that the date when information is input to the transaction data does not have a logical relationship with the date related to the debt transaction, and therefore does not correspond to the date related to the debt transaction.

Information provided includes a notification or a warning. By being notified or warned, the debtor can recognize that the due date or the date of fulfillment of the debt is approaching, and take appropriate action accordingly.

The information acquired from the information processing device related to the debtor of the debt or the information processing device related to the creditor of the debt is the information processing device related to the debtor of the debt or the information processing device related to the creditor of the debt Any information can be used as long as it is acquired, for example, information indicating that the debtor or debtor accepts the renewal, information regarding different payment dates when renewing, Information on how to pay debt. Even in the case of renewal, the obligation generated by the renewal may not have a fulfillment date because the fulfillment date need not be determined. Moreover, the payment method of the next created debt may not be determined.

Information that enables processing corresponding to the debt at a financial institution corresponds to the debt at a financial institution such as a bank, investment bank or post office, such as debt payment, debt payment preparation, debt payment adjustment, etc. It means information for enabling processing. The information may be a creditor, debtor, payment date, payment amount, or payment currency.

Information obtained from either the debtor or the creditor of the debt is, for example, information such as instructions from the debtor or creditor, identification of the bank to pay, identification of the payment deadline, or identification of the payment currency. Is mentioned.

At least a part of the transaction means that a part of a plurality of transactions can be displayed.
In one embodiment of the present invention, in the data structure indicating a transaction, the step of obtaining information relating to a date related to a debt transaction, and the data structure having the date satisfying a predetermined condition or the information relating to the data structure are obtained. A method comprising: identifying and providing information relating to the data structure to a predetermined party.

The third party different from the party of the multilateral netting is a party other than the party who is the holder of the debt that uses the multilateral netting, and represents, for example, another corporation, a controlling company, or the like. The supervising company may be a corporation, a bank, an investment company, a financial institution such as a post office.

The data indicating the total amount of the plurality of debts between the first party and the third party is data indicating the amount offset by adding up the plurality of debts between the first party and the third party. is there. As for the debts between the first party and the third party, the debtor may be the first party or the third party. It can be. However, as a data structure, the total amount may be always a positive number by exchanging the creditor and the debtor.

The different amount may be an increased amount or a decreased amount as compared with the amount related to the original debt. Note that there is no direct debt between the first party and the second party, and in the case of debt through a third party, it is a debt that does not have either the first party or the second party as a party. This is a case where the amount is 0, which is an example of a different amount.

An embodiment of the present invention is an information processing apparatus or transaction comprising generation means for generating transaction data having first debt amount data indicating an amount related to a debt and creditor data indicating a creditor of the debt It may be a system.

In one embodiment of the present invention, the first transaction data is specified based on first transaction data having first debt amount data indicating an amount related to a debt and creditor data indicating a creditor of the debt. Or an information processing apparatus or transaction system having distribution means for generating second transaction data including data or specific data for specifying a part of the first transaction data and the first debt amount data. Good.

In one embodiment of the present invention, the first transaction data is specified based on first transaction data having first debt amount data indicating an amount related to a debt and creditor data indicating a creditor of the debt. An information processing apparatus or transaction system comprising distribution means for generating second transaction data having data or specific data for specifying a part of the first transaction data, and a plurality of data indicating monetary amounts, The information processing apparatus or the transaction system may include the distribution unit, wherein a total of a plurality of data indicating the amount matches the first debt amount.

According to an embodiment of the present invention, based on first transaction data including first debt amount data indicating an amount related to a debt and first creditor data indicating a creditor of the debt, the second debt amount data The information processing apparatus or transaction system may further include a renewal unit that generates second transaction data including the creditor data.

According to an embodiment of the present invention, in transaction data having first debt amount data indicating an amount related to a debt and first creditor data indicating a creditor of the debt, the debt is determined based on a plurality of the transaction data. Renewal means for generating second transaction data having second debt amount data indicating such amount and second creditor data indicating creditors of the debt, wherein the first transaction data is related to the plurality of transaction data. The information processing apparatus or the transaction system having the renewal means may be characterized in that a total of the debt amount data matches the second debt amount data.

According to an embodiment of the present invention, in transaction data having first debt amount data indicating an amount related to a debt and first creditor data indicating a creditor of the debt, the debt is determined based on a plurality of the transaction data. Renewal means for generating second transaction data having second debt amount data indicating such amount and second creditor data indicating creditors of the debt, wherein the first transaction data is related to the plurality of transaction data. The information processing apparatus or the transaction system having the renewal means may be characterized in that creditor data and the second creditor data match.

According to an embodiment of the present invention, in transaction data having first debt amount data indicating an amount related to a debt and first creditor data indicating a creditor of the debt, the debt is determined based on a plurality of the transaction data. Renewal means for generating second transaction data having second debt amount data indicating such amount and second creditor data indicating creditors of the debt, wherein the first transaction data is related to the plurality of transaction data. The total of debt amount data matches the second debt amount data, and the first creditor data and the second creditor data related to the plurality of transaction data match, It may be an information processing apparatus or transaction system having renewal means.

An embodiment of the present invention relates to first transaction data having first debt amount data indicating an amount related to a first debt and first creditor data indicating a creditor of the first debt, and relating to the first debt. In a transaction system comprising: second debt amount data indicating an amount related to a second debt greater than the amount; and second transaction data having second creditor data indicating a creditor of the second debt, the second debt amount It may be an information processing apparatus or a transaction system having offsetting means for generating amount data obtained by subtracting the first debt amount and third transaction data having the second creditor data.

An embodiment of the present invention relates to first transaction data having first debt amount data indicating an amount related to a first debt and first creditor data indicating a creditor of the first debt, and relating to the first debt. Second transaction data having second debt amount data indicating an amount related to a second debt larger than the amount and second creditor data indicating a creditor of the second debt, and a first debtor relating to the first debt. In a transaction system comprising data for specifying and data for specifying a second debtor related to the second debt, if the data for specifying the first debtor and the second creditor data are substantially the same, or When the data specifying the second debtor and the first creditor data are substantially the same, the amount data obtained by subtracting the first debt amount from the second debt amount, and the second creditor data And canceling means for generating a third transaction data with may be an information processing apparatus or the transaction system having.

Here, the case where the data specifying the first debtor and the second creditor data are substantially the same is the case where the data specifying the first debtor and the second creditor data match. There may be data for associating the data identifying the first debtor with the second creditor data.

According to an embodiment of the present invention, it is possible to improve convenience for a user related to a debt transaction.

FIG. 1 is a block diagram showing a configuration of an information processing system according to a part of one embodiment of the present invention. FIG. 2 is a block diagram showing a configuration of an information processing system according to a part of another embodiment of the present invention. FIG. 3 is a block diagram showing a configuration of an information processing system according to a part of another embodiment of the present invention. FIG. 4 is a block diagram showing a configuration of an information processing system according to a part of one embodiment of the present invention. FIG. 5 is an example of a data structure according to a part of one embodiment of the present invention. FIG. 6 is an example of a data structure according to a part of one embodiment of the present invention. FIG. 7 is an example of a data structure according to a part of one embodiment of the present invention. FIG. 8 is an example of a data structure according to a part of one embodiment of the present invention. FIG. 9 is a block diagram illustrating an example of functions according to a part of one embodiment of the present invention. FIG. 10 is a flowchart showing an example of an operation according to a part of the embodiment of the present invention. FIG. 11 is a block diagram showing a situation of an information processing system including an information processing apparatus according to a part of one embodiment of the present invention. FIG. 12 is a block diagram illustrating an example of functions according to a part of one embodiment of the present invention. FIG. 13 is an example of a data structure according to a part of one embodiment of the present invention. FIG. 14 is a flowchart showing an example of an operation according to a part of one embodiment of the present invention. FIG. 15 is a block diagram illustrating an example of functions according to a part of one embodiment of the present invention. FIG. 16 is an example of a data structure according to a part of one embodiment of the present invention. FIG. 17 is an example of a data structure according to a part of one embodiment of the present invention. FIG. 18 is an example of a data structure according to a part of one embodiment of the present invention. FIG. 19 is a flowchart showing an example of an operation according to a part of the embodiment of the present invention. FIG. 20 is a block diagram illustrating an example of functions according to a part of one embodiment of the present invention. FIG. 21 is a flowchart showing an example of an operation according to a part of the embodiment of the present invention. FIG. 22 is an example of a data structure according to a part of one embodiment of the present invention. FIG. 23 is a flowchart showing an example of an operation according to a part of the embodiment of the present invention. FIG. 24 is a flowchart showing an example of an operation according to a part of one embodiment of the present invention. FIG. 25 is a flowchart showing an example of an operation according to a part of the embodiment of the present invention. FIG. 26 is a flowchart showing an example of an operation according to a part of the embodiment of the present invention. FIG. 27 is a flowchart showing an example of an operation according to a part of the embodiment of the present invention. FIG. 28 is a flowchart showing an example of an operation according to a part of the embodiment of the present invention. FIG. 29 is a flowchart showing an example of an operation according to a part of the embodiment of the present invention. FIG. 30 is a flowchart showing an example of an operation according to a part of the embodiment of the present invention. FIG. 31 is a flowchart showing an example of an operation according to a part of the embodiment of the present invention. FIG. 32 is a flowchart showing an example of an operation according to a part of the embodiment of the present invention. FIG. 33 is a block diagram showing a situation of an information processing system including an information processing apparatus according to a part of one embodiment of the present invention. FIG. 34 is a diagram showing an example of an application screen according to a part of the embodiment of the present invention. FIG. 35 is a diagram showing an example of an application screen according to a part of the embodiment of the present invention. FIG. 36 is a diagram showing an example of an application screen according to a part of the embodiment of the present invention. FIG. 37 is a diagram showing an example screen of an application according to a part of one embodiment of the present invention. FIG. 38 is a flowchart showing an example of an operation according to a part of the embodiment of the present invention. FIG. 38 is a diagram showing an example of a storage table according to a part of one embodiment of the present invention. FIG. 40 is a flowchart showing an example of an operation according to a part of the embodiment of the present invention. FIG. 41 is a block diagram illustrating an example of functions according to a part of one embodiment of the present invention. FIG. 42 is a diagram showing an example of options for a settlement method for functions according to a part of one embodiment of the present invention. FIG. 43 is a diagram showing an example of a storage table according to a part of one embodiment of the present invention. FIG. 44 is a diagram showing an example of a storage table according to a part of one embodiment of the present invention. FIG. 45 is a diagram showing an example of a storage table according to a part of one embodiment of the present invention. FIG. 46 is a diagram showing an example of a part of an embodiment of the present invention. FIG. 47 is a graph showing an image related to a part of one embodiment of the present invention. FIG. 48 is an example of the prior art. FIG. 49 is an example of a group of multilateral nettings that are part of one embodiment of the present invention. FIG. 50 is an example of a group of multilateral nettings that are part of one embodiment of the present invention. FIG. 51 is an example showing the relationship between the distribution of T data and the supply chain, which are part of one embodiment of the present invention.

Hereinafter, various embodiments of the present invention will be described with reference to the accompanying drawings. In addition, the same referential mark is attached | subjected to the common component in drawing.

1. Information processor configuration and applications
1-1. Application examples on information processing apparatus Applications on the information processing apparatus include applications that mainly handle blockchain, BC (Blockchain) application, applications that play the role of surrounding administrators, administrator applications, An application having a function related to an information processing apparatus used by a user can be classified as a user application.

Among these applications, the BC application is an application that holds block chain information. The user application and the administrator application are merely the difference between whether the block chain according to an embodiment of the present invention is supported on the user side or on the administrator side.

For example, information on the network may be directly transmitted from the BC application to the administrator application, or may be transmitted to the administrator application via the user application, and the information is finally transmitted. There is no difference in these points. That is, the contents of the user application and the administrator application can be interchanged with each other.

Further, if the block chain information according to an embodiment of the present invention is managed in the user information processing apparatus, the BC application and the user application may be executed in the same information processing apparatus. Moreover, if the information of the block chain which concerns on one Example of this invention is managed within an administrator's information processing apparatus, BC application and an administrator application may be performed within the same information processing apparatus. Furthermore, if the information of the block chain according to one embodiment of the present invention is managed in both the information processing apparatus of the user and the administrator, the BC application, the user application and the administrator application are within the same information processing apparatus. May be executed.

In such a gist, hereinafter, as an example, the configuration of each information processing apparatus and the application executed by them will be described, and the contents of each application will be described below as appropriate.

1-1. Information processing apparatus example 1
As shown in FIG. 1, the system 1 according to an embodiment of the present invention includes an information processing apparatus 10 that can include a bus 11, a calculation unit 12, a storage unit 13, an input unit 14, a display unit 15, and a communication IF 16; The network 20 and the information processing apparatus 30 that can include the bus 31, the arithmetic unit 32, the storage unit 33, the input unit 34, the display unit 35, and the communication IF 36 can be included. The system 1 may include an information processing device other than the information processing devices 10 and 30. The number of the information processing apparatuses may be several to several tens, or hundreds to thousands. In some cases, the number may be tens of thousands or more.

The bus 11 has a function of transmitting information between the calculation unit 12, the storage unit 13, the input unit 14, the display unit 15, and the communication IF 16, and the bus 31 includes a calculation unit 32, a storage unit 33, an input unit 34, It has a function of transmitting information between the display unit 35 and the communication IF 36.

The user application or the BC application mainly uses the bus 11 to transmit information between the calculation unit 12, the storage unit 13, the input unit 14, the display unit 15, and the communication IF 16, and the administrator application mainly Information is transmitted between the arithmetic unit 32, the storage unit 33, the input unit 34, the display unit 35, and the communication IF 36 using the bus 31.

As for the calculating part 12 or the calculating part 32, a processor is mentioned, for example. This may be a CPU or an MPU. In addition, a graphics processing unit, a digital signal processor, and the like may be included. In short, the calculation unit 12 or the calculation unit 32 only needs to have a function capable of executing a program instruction.

The user application or the BC application is mainly executed using the calculation unit 12, and the administrator application is mainly executed using the calculation unit 32.

The storage unit 13 or the storage unit 33 has a function of recording information. This may be either an external memory or an internal memory, and may be either a main storage device or an auxiliary storage device. Further, it may be a magnetic disk (hard disk), an optical disk, a magnetic tape, a semiconductor memory, or the like. Further, a storage device via a network, a storage device on a cloud, or the like may be used.

Note that registers, L1 caches, L2 caches, and the like that store information at positions close to the arithmetic unit are included in the arithmetic unit 12 (or the arithmetic unit 32) in that they are not via a bus in the schematic diagram of FIG. However, in the design of a computer architecture, the storage unit 13 (or the storage unit 33) may include these as a device for recording information. In short, it is only necessary that the arithmetic unit 12 (or the arithmetic unit 32), the storage unit 13 (or the storage unit 33), and the bus 11 (or the bus 31) cooperate to execute information processing.

Moreover, although the above described the case where the calculating part 12 (or calculating part 32) was performed based on the program with which the memory | storage part 13 (or memory | storage part 33) was equipped, said bus | bath 11 (or bus | bath 31) was described. ), As one of the combined forms of the calculation unit 12 (or calculation unit 32) and the storage unit 13 (or storage unit 33), the information processing according to the present system can be changed to change the hardware circuit itself It may be realized by a logic device or a dedicated circuit in which information processing to be executed is determined.

The storage unit 13 is mainly used for the user application or the BC application, and the storage unit 33 is mainly used for the administrator application.

The input unit 14 or the input unit 34 has a function of inputting information. Examples of the input unit 14 or the input unit 34 include a pointing device such as a keyboard, a mouse, a touch panel, or a pen-type pointing device.

The display unit 15 or the display unit 35 includes, for example, a display. The display unit 15 or the display unit 35 may be a liquid crystal display, a plasma display, an organic EL display, or the like. In short, any device capable of displaying information may be used. Moreover, you may provide the input part 14 or the input part 34 in part like a touch panel.

The input unit 14 is mainly used for the user application or the BC application, but the communication IF 16 may be used. The input unit 34 is mainly used for the administrator application, but the communication IF 36 is used. Also good.

The output unit 15 is mainly used for the user application or the BC application, and the output unit 35 is mainly used for the administrator application.

The network 30 has a function of transmitting information together with the communication IFs 16 and 36. In other words, the information processing apparatus 20 has a function of transmitting 20 information to another information processing apparatus 30 via a network. The communication IF 16 or 37 may be either serial connection or parallel connection, and may be USB, IEEE 1394, Ethernet (registered trademark), PCI, SCSI, or the like. The network 30 may be either wired or wireless, and may use an optical fiber, a coaxial cable, an Ethernet (registered trademark) cable, or the like.

The hardware constituting the system according to the embodiment of the present invention may be a general-purpose electronic computer or a dedicated electronic computer. The hardware may be a workstation, a desktop personal computer, a laptop personal computer, a notebook personal computer, a PDA, a mobile phone, a smart phone, or the like.

FIG. 2 is an example showing a case where there are a plurality of information processing apparatuses 10 and 30 in FIG. The information processing devices 10A to 10C correspond to the information processing device 10, and the information processing devices 30A to 30C correspond to the information processing device 30. Hereinafter, another example of the hardware system will be described with reference to FIG.
1-2. Information processing apparatus example 2

One embodiment of the present invention may be a client server type system.
The client server type system according to an embodiment of the present invention can include information processing devices 30A, 30B, and 30C as servers in addition to information processing devices 10A, 10B, and 10C as terminals.
Each of 10A to 10C and each of 30A to 30C can include a calculation unit, a storage unit, an input / output unit, or a communication IF.

Note that the information processing apparatus as a terminal, such as a thin client or an SBC method, may have a format that does not include a main storage medium. In this case, the information processing apparatuses 10A to 10C that are terminals can handle the data according to the embodiment of the present invention by inquiring the information processing apparatuses 30A to 30C that are servers.

Although an example of three terminals 10A to 10C has been shown, the number of terminals is not limited to three, and may be one or two, or four or more.
Similarly, although the example of three servers 30A to 30C has been shown, the number of servers is not limited to three, and may be one or two, or four or more.

The user application or the BC application is mainly executed on the information processing apparatuses 10A, 10B, and 10C that are terminals, and the administrator application is mainly executed on the information processing apparatuses 30A, 30B, and 30C that are servers. The

A system according to an embodiment of the present invention can be realized in cooperation with part or all of the above-described 10A to 10C and 30A to 30C.

1-3. Information processing apparatus example 3
The system according to an embodiment of the present invention may be a P2P (Peer to Peer) system. A system according to an embodiment of the present invention can include information processing apparatuses 10A to 10C and 30A to 30C which are terminals. In addition, since it is P2P, the function of 10A thru | or 10C and the function of 30A thru | or 30C may be the same. However, since P2P does not specify the functions of individual terminals, the functions of 10A to 10C and the functions of 30A to 30C may be different.

Each of 10A to 10C and each of 30A to 30C can include a calculation unit, a storage unit, an input / output unit, or a communication IF.
As described above, three examples of 10A to 10C and 30A to 30C are shown, but the number is not limited to three, and may be one or two, or four or more.

The user application or the BC application is mainly executed on the information processing apparatuses 10A, 10B, and 10C that are terminals, and the administrator application is mainly executed on the information processing apparatuses 30A, 30B, and 30C that are other terminals. Executed.

In one embodiment according to the present invention, a part or all of the above-described 10A to 10C and 30A to 30C can be realized in cooperation.

1-4. Information processing apparatus example 4
The system according to an embodiment of the present invention may be a cloud system. A system according to an embodiment of the present invention can include information processing apparatuses 10A to 10C, which are terminals, and information processing apparatuses 30A to 30C on the cloud.

Each of 10A to 10C and each of 30A to 30C can include a calculation unit, a storage unit, an input / output unit, or a communication IF.
As described above, three examples of 10A to 10C and 30A to 30C are shown, but the number is not limited to three, and may be one or two, or four or more.

The information processing apparatuses 10A to 10C may be provided with SaaS (Software as a Service), and the information processing apparatuses 30A to 30C may be provided with PaaS (Platform as a Service), but the present invention is not limited to this.

The user application or the BC application is mainly executed on the information processing apparatuses 10A, 10B, and 10C that are terminals, and the administrator application is mainly executed on the information processing apparatuses 30A, 30B, and 30C on the cloud. The

In one embodiment according to the present invention, a part or all of the above-described 10A to 10C and 30A to 30C can be realized in cooperation.

In addition, one embodiment related to the present invention may be in the form of a grid system, fog computing, or the like.

1-5. Information processing apparatus example 5
The system according to an embodiment of the present invention may be a mixed system of the systems described above. For example, a system according to an embodiment of the present invention can include information processing devices 10A to 10C and server information processing devices 30A to 30C as P2P terminals.

Each of 10A to 10C and each of 30A to 30C can include a calculation unit, a storage unit, an input / output unit, or a communication IF.
As described above, three examples of 10A to 10C and 30A to 30C are shown, but the number is not limited to three, and may be one or two, or four or more.

The user application or the BC application is mainly executed on the information processing apparatuses 10A, 10B, and 10C that are terminals, and the administrator application is mainly executed on the information processing apparatuses 30A, 30B, and 30C on the server. The

In one embodiment according to the present invention, a part or all of the above-described 10A to 10C and 30A to 30C can be realized in cooperation.

1-6. Information processing apparatus example 6
The system according to an embodiment of the present invention may be a mixed system of the systems described above. An example will be described with reference to FIG. For example, a system according to an embodiment of the present invention can include information processing devices 10A to 10C as terminals and information processing devices 30XA to 30XC and 30YA to 30YD as servers on the cloud. This example according to FIG. 3 shows a hardware configuration in particular when the characteristics of the servers 30XA to 30C and the servers 30YA to 30YD differ as the servers on the cloud.

In the relationship with the information processing devices 10 and 30 in FIG. 1, the information processing devices 10A to 10C correspond to the information processing device 10, and the information processing devices 30XA to 30XC and 30YA to 30YD correspond to the information processing device 30. .
Therefore, each of 10A to 10C, each of 30XA to 30XC, and 30YA to 30YD can include a calculation unit, a storage unit, an input / output unit, or a communication IF.

As described above, three examples of 10A to 10C and 30XA to 30XC are shown, but the number is not limited to three, and may be one or two, or four or more.
In addition, although four examples of 30YA to 30YD are shown, the number is not limited to four, and may be one to three or five or more.

The user application is mainly executed on the information processing apparatuses 10A, 10B, and 10C that are terminals, and the BC application is mainly executed on the information processing apparatuses 10A, 10B, and 10C on the server. Is mainly executed on the information processing devices 30A, 30B and 30C on the server.

One embodiment related to the present invention can be realized in cooperation with a part or all of the above-described 10A to 10C and 30A to 30C.

One embodiment of the invention according to the present application can be applied to any of the various hardware systems described above as long as the hardware system can realize any of the software functions described below.

2. Blockchain system
2-1. Configuration of block chain A system according to an embodiment of the present invention includes a block chain system 40. As the block chain, a block chain used for a well-known bit coin can be used. However, since there are a plurality of versions of the block chain, a block chain system according to an embodiment of the present invention will be described here as an example. A system to which the present invention can be applied will be described below. Needless to say, it is not limited to the system. A block chain system 40 according to an embodiment of the present invention includes block headings 41A to 43A and block bodies 41B to 43B.

The block heading 41A may include each block heading ID 41AA, a block heading reference ID 41AB, a block body reference ID 41AC, and a nonce value 41AD.

The block heading ID 41AA indicates the block heading ID. The block heading reference ID 41AB includes an ID that refers to the previous block heading in the block chain configured on the daisy chain. This may be any configuration as long as it points to the previous block heading, may have information that can indirectly point to the previous block heading, and the address on the recording medium of the previous block heading. May be pointed directly to.

The block heading reference ID 41AB may include a format that can be referred to by a hash value that is a result of applying a hash function to the previous block heading (the previous block heading or the previous block itself). When such a hash value is provided, if the value of the previous block is changed, this hash value is also changed, so that it is possible to find data tampering. In addition, since such a block chain is configured in a daisy chain as shown in FIG. 4, when the data information of a block positioned ahead is altered, the hash value is also altered. It is difficult to create an appearance as if there is no similar to the structure of the block chain used in the well-known bit coin.

The block body reference ID 41AC indicates the block body indicated by the block heading. This may be any configuration as long as it can point to the block body, may have information that can indirectly point to the block body, or may directly indicate the address of the block body on the recording medium. . In addition, since it is only necessary to be able to reach the block body indirectly, for example, the information of the portion corresponding to the root of the data structure on the tree with each transaction constituting the block body as a leaf is indirectly included. It is good also as a structure.

The block body 41B may include a plurality of transactions 41B1 to 41BN (N is a natural number). The structure of each transaction is described in the next section.

The nonce value 41AD is a numerical value that works as a proof of work in calculating the hash value, and may be the same as that of a block chain in a well-known bit coin. That is, the nonce value is changed and the hash value is calculated by the hash function, and the calculation is performed until a value that satisfies a certain condition is satisfied. Examples of the certain condition include, but are not limited to, a certain number of zeros or more arranged at the head of the hash value. By changing this condition, the burden required to be recognized as a correct block is changed. In the system according to the present application, the burden may be reduced as compared with a general block chain. For example, as a certain condition, the numerical value where 0 is arranged can be reduced, or a value other than 0 can be allowed.

Specifically, in one form of the information processing system of the present application, a data structure (also referred to as a block) having data relating to a transaction has a configuration of a daisy chain. Each block is created to have multiple transactions.

Data related to a transaction is held by a large number of information processing apparatuses in the same manner as a known block chain. This is because a transaction is generated by each information processing apparatus when a new transaction occurs. The validity of the block is implemented by the information processing apparatus confirming the nonce.

However, in one form of the information processing system according to the present application, unlike the block chain related to the well-known bitcoin, there is no calculation to find the hash function of the block called proof of work, or the calculation is 10 minutes or the like As such, the calculation may be easily terminated by reducing the calculation load or eliminating the load calculation.

Also, one form of the information processing system according to the present application is different from the blockchain related to the well-known bitcoin, so that no one can set up the information processing apparatus on the network (cannot share information on this blockchain). Good. In addition, sharing of transaction data according to an embodiment of the information processing system according to the present application may be management or permission processing.

Furthermore, one form of the information processing system according to the present application may be configured not to perform processing related to incentives, unlike a block chain related to known bit coins.
Also, one form of the information processing system according to the present application may be configured not to perform processing related to a fee for each transaction, unlike a block chain related to a well-known bit coin.
Further, one form of the information processing system according to the present application may be configured not to perform the processing related to the inflation rate, unlike the block chain related to the well-known bit coin.

3. Transaction data structure
3-1. Example of data structure of transaction Next, an example of a data structure related to the transaction 41B and the like in FIG. 4 will be described with reference to FIGS. In the present specification, an example of a data structure related to the transaction 41B or the like may be referred to as T data (meaning transaction data) or a debt document (derived only from meaning initial debt at the time of initial generation). .

In one embodiment according to the present invention, T data includes a transaction ID, a time stamp, a sender name ID, a recipient name ID, an amount, a currency type, a due date, a settlement method, an ID indicating an original transaction, and a transaction ID. You may have a history of the debtor.

The transaction ID is an ID for uniquely identifying a transaction. A method for uniquely determining the ID may be a well-known method.

The time stamp is a time stamp when the transaction is created.

The sender name (ID) is information related to a debtor of a debt transaction related to a transaction or information related to T data generated using the debtor as a creditor. The debtor information may be any information that identifies the debtor within the system, and a hash function is applied to the debtor's public key, a shortened version of the debtor's public key, and the debtor's public key. It may be what was done. The information related to the T data may be information related to the T data, and may be information specifying or referring to the T data or information specifying or referring to a part of the T data. For example, a transaction ID that is an ID of T data, or a transaction ID to which additional information is added may be used.

In the present specification, the debtor or creditor may be a corporation, an organization (including an organization with no legal personality), a private person, or an individual.

The recipient name (ID) is information relating to the creditor of the debt transaction related to the transaction. This information is the same as the information relating to the debtor in the sender name. In the embodiment of the present invention, in the transaction data generated at the time of multilateral netting or the data indicating the transaction, the creditor data generated at the time of transition indicates the relationship between the debtor or the creditor over time. Therefore, it does not always indicate creditors.

Amount is the amount related to debt. The amount may be in the original currency or the changed currency amount. Moreover, the amount of virtual currency may be used. When the information is held in the original currency, it is based on a certain currency (for example, yen, dollar, euro, etc.), but there is an advantage that this information can be put in without changing the currency denomination. Moreover, when changing a currency denomination, you may change a currency denomination by the agreement of the parties, etc. Further, information may be held in a virtual currency currency standard (such as satoshi).

The currency type is denominated in the currency used. Contains information on currencies such as yen, dollars, and euros. This may be a currency type or a currency unit. In the case of virtual currency, the type or unit of the virtual currency may be used.

The due date is the due date for debt transactions. For example, the date on which the transaction is performed, the date on which the contract is agreed, the date on which the transfer of the product related to the contract, the delivery, etc. are performed, or the scheduled date of settlement may be mentioned. These may determine what is input by the parties, or may be determined as the entire system.

A settlement method is a method for terminating a debt transaction. For example, bank transfer, renewal, liquidity lease, fixed term lease, etc. can be considered. Information indicating these is set. These set information may be changed later.

Special remarks are voluntary matters related to debt transactions. Here, any matter may be described. The remarks may have an agreement regarding each of the items described above. For example, the decision of the parties as to what value to enter for the due date may be specifically set.

Each transaction may hold information other than the information described above, or may hold a part of the information described above as shown in the following example.

The ID indicating the original transaction means an ID indicating a so-called specific transaction in the real world, and the ID may be determined in any form regarding the specific transaction.

The transaction ID history is a part of information related to the previous transaction. A transaction and other transactions may be related to each other due to the distribution of debt described below. Specifically, another transaction may exist before a certain transaction. In such a case, at least a part of information regarding the other transaction can be held as a history.

The obligor in the information indicating the obligor refers to the obligor related to the first transaction in the history when there is a history related to the transaction. Such information may be any information as long as it is information specifying the obligor.

FIG. 5 shows a data structure related to a transaction in an embodiment related to the present invention.
Each transaction has a transaction ID 503, a time stamp 504, a sender name (ID) 505, a recipient name (ID) 506, an amount 507, a currency type 508, a due date 509, or a settlement method 510, as in the transaction 501. 511 or the like.

In the embodiment in which each transaction is defined as described above, the original transaction ID 512, the transaction ID history 513, the original obligor 514, the currency type 515, and the settlement method 516 are managed outside the transaction as in the non-transaction 502. May be. In addition to the above, the information related to the parties, the information related to the contract, and the incidental information may all be information outside the transaction. In the present application, information outside a transaction is referred to as application data. The application data is recorded in the information processing apparatus according to an embodiment of the present invention.

3-1-1. Data structure alternative example 1
FIG. 6 shows a data structure relating to a transaction in another embodiment of the information processing system according to the present application. Each item is illustrated as an example stored in the transaction 601 and the transaction 602.

The description of each description item is the same as FIG. It should be noted that the amount (deposited in the original currency) indicates that the value of the amount holds information in the original currency.

Since the currency type and the settlement method are application data, if such information is lost, it must be restored by another method if necessary.

Since the amount is denominated in cost currency, a server may be prepared for each currency. That is, a server for each currency such as yen, dollar, and euro may be prepared, and each server corresponding to each currency may be configured to have T data processed in each currency.

As another method that does not use currency type information, the T data ID is assigned in a format indicating each currency (for example, 1 for the first digit for yen, 2 for the first digit for dollars, etc.). By doing so, the ID of each T data may be in a format that can substantially hold information of the currency type.

There is a possibility that the data structure shown in FIG. 6 can be used particularly when the source code of Bitcoin is used. In addition, when using the source code of bitcoin, there is a possibility that it can be a side chain of bitcoin.

3-1-2. Data structure alternative 2
FIG. 7 shows a data structure related to a transaction in another embodiment of the information processing system according to the present application. Each item is illustrated as an example of being stored in the intra-transaction 701 and the non-transaction 702.

In FIG. 7, you may have a currency classification, a date, and an obligor name as optional data. The obligor's name is information that can be found by transmitting the transaction, but it is one of the information that can be used by the holder of the receivable, so that the obligor's information can be easily accessed. This is the format that each transaction holds.

The data structure shown in FIG. 7 may be used particularly when the Etherium source code is used. In addition, when using the Etherium source code, there is a possibility of becoming an Etherium side chain.

3-1-3. Data structure alternative 3
FIG. 8 shows a data structure related to a transaction in another embodiment of the information processing system according to the present application. Each item is illustrated as an example stored in the intra-transaction 801 and the non-transaction 802.

In FIG. 8, the application data and the data related to the transaction are similar to those shown in FIG. However, the amount related to the debt is the amount (determined in cost currency) in FIG. 6, but is the amount (Satoshi) in FIG. In this case, the currency of the amount related to each transaction is unified as a virtual currency. However, since the relationship with the transaction performed in the real world is unknown, an exchange table between the original currency and the virtual currency is prepared as the application table. Based on the table, real world transactions are converted into virtual currency, and information is held.

Similarly to the data structure shown in FIG. 6, the data structure shown in FIG. 8 may be used when the source code of Bitcoin is used. In addition, when using the source code of bitcoin, there is a possibility that it can be a side chain of bitcoin.

Debt information is indicated by specific T data shown in the data structure relating to the above transaction. However, it goes without saying that whether or not the existence of the T data indicates the presence or absence of actual debt is subject to the laws of each country. The T data according to an embodiment of the present invention facilitates processing when a debt is present.

In addition, since the system calculates the nonce and the hash value with properties similar to a block chain, even if the system is a managed server, the integrity of the data is high.

Since the data is a debt, when the data exists, the sender A has a debt and the receiver B has a claim for A, but A is an actual commercial transaction. I do not have any value. In other words, as long as it is a debt, there is a risk that it will not be possible to recover the debt, and whether the debt is legally recognized depends on the legal system of each country.

3-2. Description method of transaction Next, a description method when referring to the data structures related to various transactions such as FIG. 5 to FIG. 8 in this specification will be described.

A simple description method including information such as ID, sender, recipient, amount, etc., which is information relating to the data structure, is as follows.

[ID: ** 1, sender: ** 2, recipient: "(** 3, ** 4, ** 5)" +, due date: ** 6]

In the above, the character string starting with “**” indicates the position where each piece of specific information is input. “** 1” contains an ID. The sender is entered in “** 2”. The recipient is entered in “** 3”. “** 4” contains the amount of the debt. “** 5” contains the currency type of the debt amount. However, “** 5” may be omitted. “** 6” is the date of the debt.

““ + ”Indicates that one or more things enclosed in double quotation marks (“ ”) are repeated. Therefore, “(**, **, **)” + may include “(**, **, **)” or “(**, **, **), (** , **, **) ".

For example, T data when the ID is ID1, the sender is A, the recipient is B, the amount is X, the currency is Yen, and the due date is D1 is described as follows based on this description method.

[ID: ID1, sender: A, recipient: (B, X, Yen), due date: D1]

Moreover, T data can also generate | occur | produce several persons as a creditor. T-data when ID is ID2, Sender is A, Yen-denominated amount X1 is B as creditor, Yen-denominated amount X2 is C as creditor, and the due date is D2, It is described as follows.

[ID: ID2, sender: A, recipient: (B, X1, yen) (C, X2, yen), due date: D2]

Here, the due date is described as one D2. However, a plurality of due dates may be set corresponding to a plurality of creditors. For example, in this case, D2B, D2C, and the like may be set as a plurality of due dates corresponding to the recipient.

Further, as described above, in addition to information relating to the sender itself, the sender name also allows information on the sender as a creditor. Therefore, when the above-described ID1 is distributed as described below, it is as follows.

[ID: ID3, sender: ID1, recipient: (C, X1, Yen), due date: D3]

As a sender, ID 1 of T data sent to B is referred to, and T data is generated for C.

Further, when T data is distributed, a plurality of persons may be generated as creditors. For example, the following T data is possible.

[ID: ID4, sender: ID3, recipient: (D, X1, Yen), (C, X2, Yen), due date: D4]

Here, T data ID3 distributed to C is generated as T data of T data for D and T data for C. And since the sender is C who is a creditor of ID3, C is generating T data of X2 yen toward C itself.

3-4. Transaction safety Transactions indicate debt, and transaction generation means that the debtor bears the debt, so transaction generation can only be generated by the debtor who bears the debt ( It can be generated only based on the instructions of the debtor who bears the debt). That is, a transaction is only generated based on instructions from a debtor or similar person. Here, a technique for preventing impersonation may be used to determine whether the person is a debtor or a similar person.

As the anti-spoofing technology, a public key cryptosystem may be used. In other words, it is assumed that the debtor has two keys, a public key and an encryption key, in the public key cryptosystem, discloses the public key, and keeps the encryption key secret. Then, the debtor encrypts the target transaction with the encryption key. When the third party can restore the encryption key with the public key, it can be seen that the debtor possessing the encryption key corresponding to the public key has realized the encryption. Thereby, the impersonation by persons other than a debtor can be prevented.

Further, as described above, the numerical value hashed by the hash function is held in the next transaction. Such transactions increase over time. For this reason, if the transaction is falsified, the hash value is also changed. Therefore, the one that hides the falsification of the transaction needs to change the hash value. However, since transactions increase at regular intervals, it becomes difficult to change the hash values of all transactions. In another embodiment, even if an increase in transactions is created by a certain limited server or the like, it must be created so that there is no hesitation in the relationship between the transactions by attacking and taking over such a server. Don't

In the above, the public key cryptosystem has been introduced based on the current implementation of the blockchain, but other systems may be used instead of the public key cryptosystem. In other words, a locking system that is used in a block chain and is composed of a cancellation condition and a script that solves the condition for use by a debtor who generates a transaction or a similar party may be used. According to this, the condition of the debtor generating the debt can be specified by a system other than the public key cryptosystem.

3-5. Functional example of block chain application (BC application) The flow of the block chain is the same as that of a well-known block chain system, but there are various implementation means. The blockchain system is briefly described below. Here, an example of a part of the BC application will be described below with reference to FIG.

3-5-1. T data construction means 902
The T data configuration unit 902 has a function of configuring T data. For example, the T data configuration unit 902 acquires information such as transaction ID, time stamp, sender name ID, recipient name ID, amount, currency type, due date, payment method, etc. T data can be constructed. The information is recorded in a storage unit in the BC application. Such information may be recorded in a database.

The T data configuration unit 902 may acquire information necessary for the configuration of the T data from the input unit of the information processing apparatus of the BC application, or may store the information in the storage unit of the information processing apparatus in the BC application. You may acquire based on the said information stored for the other objective. Furthermore, the T data configuration unit 902 may acquire information necessary for the configuration of T data from another information processing apparatus. Further, the T data configuration unit 902 may configure information necessary for the configuration of T data by the above combination. For example, the T data configuration unit 902 may obtain a part of information necessary for the configuration of the T data from the input unit of the information processing apparatus of the BC application, or other information necessary for the configuration of the T data. May be obtained based on information stored in the storage unit of the information processing device in the BC application for other purposes, or other information necessary for the configuration of the T data may be obtained from other information. You may acquire from a processing apparatus.

The means is executed in the BC application, but may be executed in the administrator application.

3-5-2. Block generation means 903
The block generation unit 903 has a function of generating a block. The block generation unit 903 generates a block using information of a plurality of transactions based on the information obtained by the information input unit. The block generation unit 903 may transmit the generated block to an information processing apparatus having another BC application having the block determination unit 904.

The means is executed in the BC application, but may be executed in the administrator application.

3-5-3. Block confirmation means 904
The block confirmation unit 904 has a function of confirming the generated block. This is because the block generation means 903 in the BC application on the network can generate a block, so that the block is connected next in the block chain whose order is uniquely determined from among the generated block candidates. In order to determine a block to be determined, the block determination unit 904 determines the order of the blocks.

The block determination unit 904 may be any unit as long as it is a unit that determines a block to be connected next from a plurality of candidates.
For example, the BC application or the information processing apparatus that executes the BC application may be prioritized, or one token is generated on the network and the block of the BC application having the token is prioritized. But you can. In addition, the calculation unit and the storage unit cooperate to change the value of the nonce described above, calculate the hash value until the specified value is obtained using the hash function provided in the storage unit, The block of the information processing apparatus that has found the hash value may be determined as the next block.
After the block confirmation unit 904 confirms the block, the information may be communicated to the block confirmation unit 904 of another BC application.

3-6. Example of flow chart of block chain generation The flow chart of a block chain according to an embodiment of the present invention is the same as that of a known block chain system, but there are various mounting means. As an embodiment, a flowchart of the block chain system will be briefly described below with reference to FIG.

First, in ST1001, the T data configuration unit 902 configures T data.

In ST1002, the T data construction unit 902 transmits the information to the block generation unit 903.

In ST1003, the block generation unit 903 forms a block when a predetermined number of T data that can form the block is acquired from the T data generation unit.

In ST1004, the block generation means 903 transmits the block information to the block confirmation means 904 and the block confirmation means 904 of another BC application.

In ST1005, the block determination means 904 determines the block by a predetermined means.

In ST1006, the block confirmation means 904 transmits information on the confirmed block to the block confirmation means 904 of another BC application.

3-7. Hardware geographic characteristic <br/> Figure 11 is a diagram showing an example of a geographical distribution of data T data and application data mentioned above. In FIG. 11, the number of information processing apparatuses 1101 is drawn more than the number of information processing apparatuses 1102.

In the client-server system according to one embodiment of the present invention, the relationship between various systems according to one embodiment of the present invention described above is described below. The information processing apparatus 1101 corresponds to a client, and the information processing apparatus 1102 Corresponds to a server.

In the P2P system according to an embodiment of the present invention, although there is no significant difference between the PCs, even in the P2P system, some information processing apparatuses can be configured to have a management function. In this case, the information processing apparatus 1101 corresponds to a P2P normal terminal, and the information processing apparatus 1102 corresponds to an information processing apparatus having a management function in P2P.

In the cloud system according to an embodiment of the present invention, the information processing apparatus 1101 corresponds to a terminal using the cloud, and the information processing apparatus 1102 corresponds to an information processing apparatus on the cloud.
In another cloud system according to an embodiment of the present invention, the information processing apparatus 1101 corresponds to one information processing apparatus on the cloud, and the information processing apparatus 1102 corresponds to another information processing apparatus on the cloud. .

In the fog computing system according to an embodiment of the present invention, the information processing apparatus 1101 corresponds to a terminal using the fog computing system, and the information processing apparatus 1102 corresponds to an information processing apparatus on the fog computing system. .

In short, the information processing apparatus 1101 is an information processing apparatus used by a user of a system according to an embodiment of the present invention, and the information processing apparatus 1102 is in an administrator position of the system according to an embodiment of the present invention. This is an information processing apparatus.

The information processing apparatus 1101 has T data, and the information processing apparatus 1102 has application data.
Further, the T data included in each information processing apparatus 1101 may not be completely the same. For example, the T data included in each information processing apparatus 1101 may not be the same data in the sense that the T data is not the same in the process of creating a block. However, in this sense, a majority of the information processing apparatuses 1101 have the same T data. Further, the T data included in each information processing apparatus 1101 may not include the same T data by omitting a part of the block chain.

The information processing apparatus 1101 may include application data. However, the information processing apparatus 1101 and the information processing apparatus 1102 may have different application data management methods. For example, the application data included in the information processing apparatus 1101 may be managed by a method that costs less than the application data included in the information processing apparatus 1102.

The application data included in the information processing apparatus 1102 may be managed by measures to improve the reliability of information. For example, the information processing apparatus 1102 may include a non-recommended power supply apparatus so that application data is not lost during a power failure. In addition, the information processing apparatus 1102 may use a RAID technology such as a mirror server, or measures such as installation in a plurality of different areas, to improve the maintenance of application data. Furthermore, in order to prevent falsification of application data, a firewall or the like may be provided to take known security measures such as increasing access restrictions on the information processing apparatus 1102. The information processing apparatus 1102 may have T data.

FIG. 11 is an example, and shows one of the characteristics of data relating to a transaction and application data. That is, the same data is held by a large number of information processing devices while application data is held by a smaller number of information processing devices than the data related to transactions. Therefore, even if the data related to the transaction can take measures to improve the above-mentioned reliability, the possibility that the reliability of the information may decrease due to the destruction of the server building, earthquake, or other destruction activities is Less than data.

In addition, even if the reliability of the information of T data and application data is the same level or higher in application data, the above measures are required to improve the reliability of application data, and thus costs are required. The T data information recording method has an advantage of low cost.

The ID indicating the original transaction, the history of the transaction ID, and the information indicating the obligor are also information that can be collected by other methods. Specifically, it is as follows.
In short, the ID indicating the original transaction specifies the transaction that is the basis of the transaction. Once you know the debtor, creditor, amount, date, and time, you can identify the transaction. Further, if the contents relating to other transactions are different, the data can be held in the special notes, so that it can be specified based on such information.

The history of transaction IDs can be specified by actually tracing the previous transaction from each transaction.
Furthermore, the information indicating the obligor can also be specified by actually tracing the previous transaction from each transaction.

Another method may be used as a method for organizing data related to transactions and application data. In this method, the data related to the transaction and the application data may be classified in any way depending on the viewpoint of reusing the software to be used or the viewpoint of the compatibility with other systems. As described above, if information is held as application data, there is a possibility or danger of data corruption as described above. However, as described above, there is information that can be derived based on other information, or the importance of the information in the first place. It can be treated as low.

4). Generation of debt The system according to an embodiment of the present invention may arbitrarily generate T data. Since T data relates to paying the creditor the amount related to the debt, the debtor itself does not need to have funds. In particular, unlike bit coins that can provide coins to others only when they have coins, the T data according to one embodiment of the present invention is when the self does not have any rights Can also be generated.
The advantage that T data can be generated freely has a great influence on the mechanism as a settlement means as described in Chapter 7 below.

In addition, the T data according to an embodiment of the present invention is obtained only after obtaining permission from another person (such as a manager of the system according to the embodiment of the present invention, a financial institution, a parent company, or a group company). May be configured to generate.

4-1. Generation of transaction by party First, a case where a party arbitrarily generates data related to a transaction will be described.
For example, T data when ID is ID1, debtor is A, creditor is B, amount is X, currency is Yen, and date is D1, is described as follows according to the description method.

[ID: ID1, sender: A, recipient: (B, X, Yen), due date: D1]

In this case, the generation unit 1205 described later is applied to generate data related to the transaction. In this specification, the “original debtor” is the debtor A in this case.
4-2. Generation of transaction by debt center A case where the debt center arbitrarily generates data related to a transaction will be described.
Here, the debt center is DC (Devt Center). For example, T data when the ID is ID1, the debtor is A, the creditor is B, the amount is X, the currency is yen, and the due date is D1 is described as follows.

[ID: ID1, sender: DC, recipient: (A, X, Yen), due date: D1]
[ID: ID2, sender: ID1, recipient: (B, X, Yen), due date: D1]

As described above, when the debt center is generated, the debtor first generates T data like a creditor to the debt center, and the debt data is generated to B which is an actual creditor. Take the step that will be. In particular, in the T2 data of ID2, it is displayed that the sender uses (distributes) the transaction generated by the debt center as ID1. The distribution using this transaction as the sender will be described next.
However, when the debt center applies the generation means 1205 to generate data relating to the transaction, the “original debtor” in this specification refers to the debtor A, and the debt center is not the primary debtor. . The distribution means 1505 to be described later generates information on the original debtor related to the T data in the application data from the debt center A, that is, from the debt center only when distributing the T data generated from the debt center. Information regarding the obligor when the T data is distributed for the first time.

4-3. Examples of Functions Related to T Data Generation Functions related to T data generation include a generation acquisition unit 1202, a generation communication unit 1203, a generation recording unit 1204, and a generation unit 1205, as shown in FIG. The BC application related to T data generation can have some or all of them.

4-3-1. Generation acquisition means 1202
The generation acquisition unit 1202 has a function of acquiring information. Examples of the information to be acquired include information about T data, information about application data, and the like.

Specifically, the generation and acquisition unit 1202 can acquire the creditor, the debtor, the date related to the debt, the amount of the debt, the currency, and other related information. Further, the generation / acquisition unit 1202 includes, as application data, information related to previous T data, for example, information in T data, information on relationships between T data, information related to contracts related to T data, and information on parties registered in the system. Information such as information may be acquired.

Such information may be acquired via the input unit, or may be acquired from the user application, the BC application, or the administrator application via the generation communication unit 1203. From the user application, there are cases where it is acquired based on an input from the user, or information stored in the user application may be acquired, and there is an advantage that new information can be acquired from the user. On the other hand, when acquiring information from the BC application or the administrator application, there is an advantage that the previous information can be reused to reduce the burden on the user. Furthermore, when the speed of the communication circuit between the BC application and the administrator application is higher than the speed of the communication circuit between the user application and the BC application or the administrator application, information is acquired at high speed. There is also an advantage that can be done.

The acquired information may be transmitted to another application via the generation communication unit 1203. For example, when the generation acquisition unit 1202 is executed on the BC application, information may be transmitted to the user application, or information may be transmitted to the administrator application. By this transmission, there is an advantage that information can be used while reducing the traffic when the user application or the administrator application uses related information next time.

4-3-2. Generation communication means 1203
The generation communication unit 1203 has a function of communicating with communication units of other applications.

4-3-3. Generation recording means 1204
The generation recording unit 1204 has a function of recording T data or application data.

4-3-4. Generation means 1205
The generation means 1205 has means for generating T data related to debt. This corresponds to the T-data configuration unit 902 of 3-5-1, but will be described more specifically here.

The generation unit 1205 generates T data based on the creditor, the debtor, the date related to the debt, the amount of the debt, the currency, and other related information obtained by the generation acquisition unit 1202. The created T data is recorded by the generation recording unit 1204.
For the setting of the T data, the information acquired by the generation acquisition unit 1202 is set as the T data structure in accordance with, for example, each item defined in FIGS.

First, a unique ID is set as the transaction ID. The unique ID setting method may be a well-known method.

The date and time when the T data is generated is set as the time stamp. The time stamp may be set in cooperation with other servers. A known method may be used to generate the time stamp.

The debtor information is set as the sender name. The debtor information uses, as information indicating the debtor, an obligor ID set in advance as application data, a public key indicating the debtor, information obtained by processing the public key indicating the debtor with a hash function, and the like. As the debtor information, already registered information may be used by the master registration described below.

Creditor information is set as the recipient name. Creditor information is the same as debtor information. There may be a plurality of recipient names. This is not only when multiple recipients are set for new T data generated when T data is distributed, but also when multiple recipients are set when T data is first generated. Alternatively, a plurality of recipients may be set in the T data generated in the case of renewal. In this case, the number of amounts set below is the same as the recipient name. Note that the same number may be set for the currency type or the due date.

The amount of debt is set as the amount. The currency may be changed. Whether or not the currency can be changed or its changing method may be recorded in the application data. When changing the currency, the amount in the changed currency may be set in cooperation with another server. The currency rate in the case of changing the currency amount may be a rate determined in advance by the party, or may be determined in accordance with a method for designating a currency rate date and time determined in advance by the party. When such a special agreement exists between the parties, the calculation method based on such an agreement is stored as application data in the storage unit, and based on the calculation of the storage unit, the amount of a specific currency is set. The

A currency is set as the currency type. If the currency changes and the amount of the debt changes due to the above party's agreement, the currency of the changed amount of debt is set.

In addition, if there are any special notes regarding the occurrence of the debt, it is set as a related matter.

In the case of generation of new T data in the generation or renewal of new T data, the generation unit 1205 uses the generation communication unit 1203 to transmit part or all of the above information to the administrator application. May record the information.

As an example, as shown in FIG. 13, even if a part or all of records such as the ID of the original transaction, the currency type, the obligor, the scheduled settlement date or the scheduled settlement method are set in the application data. Good. Other record formats may be the formats described in FIGS. 5 to 8. In other words, the transaction ID, time stamp, sender name, recipient name, amount, currency type, due date, settlement method, and special remarks that are specific contents of T data are included in the application data as data related to T data. It may be set.

The T data ID may also be set in association with the information. As a result, T data and contract information related to T data can be searched via the application data. In addition, when the obligor of each T data is also set, and when the distribution of T data described below occurs, it becomes clear that the obligor of T data does not need to trace the history of T data in the blockchain. To do.

The scheduled settlement date or the scheduled settlement method is described as unchanged in FIG. 13, but this is only an example, and may be changed by the setting of the parties or the consent of the parties concerned.

In addition, in FIG. 13, the history information may be held at a place (rewrite for each transaction). As a result, when a past history is required, it can be checked.

In this specification, the T data is described based on the description method described above. However, the T data explained by the description method can be generated by the generation unit 1205.

The generation unit 1205 described above is a data structure that supports a computer system that can easily generate T data indicating a debt and thus facilitate facilitation of debt trading activities. The method, terminal, server, information processing apparatus, or system using the above data structure can technically promote smoothing of such debt transaction activities.

4-3-5. The function related to the generation of the information processing apparatus T data that executes the generation related function has been described above as being in the BC application, but is set in the administrator application or the user application according to the application architecture. May be. For example, since the generation acquisition unit 1202 acquires information from user input, application data, or an administrator application, a part of the functions may be in the user application or the administrator application. A part of the function for instructing the generation unit 1205 may be in the administrator application or the user application. Further, the generation recording unit 1204 for recording the T data is in the BC application, but the generation recording unit 1204 for recording the application data may exist in the BC application or the administrator application. When the administrator application records application data, security measures for preventing falsification described in 3-4 may be taken.

4-4. In the flow example ST1401 of T data generation , the generation acquisition unit 1202 acquires information about T data.

In ST1402, the T data generation unit 1205 generates T data based on the T data information obtained from the generation acquisition unit 1202 or the BC application. Here, examples of information obtained from the BC application include a transaction ID, time stamp information, and currency information.

In ST1403, the generation communication unit 1203 transmits information associated with T data generation to the administrator application or the user application. In addition, as information accompanying T data generation, for example, information that becomes application data may be processed so that application data is fixed after a block is fixed by the determination unit 904. This is because the transaction is undecided until the block is decided, and the information that constitutes application data that is information associated with the corresponding T data generation is also undecided. Therefore, for example, information associated with T data generation is transmitted to the administrator application or user application and then held therein, and the information whose block is confirmed by the confirmation unit 904 is similarly transferred to the administrator application or user application. After being transmitted, the information may be processed as application data. In the following, the application data or the information to be application data may be processed so as to be confirmed as application data after the block is confirmed by the enlargement unit 904.

5. Distribution of debt
5-1. Purpose of circulation of debt When a plurality of parties have a debt-liability relationship, for example, the following cases can be considered. Suppose that A, B, and C, who are parties, A bears debt X on B. At this stage, when an embodiment according to the present invention is used, a data ID 1 relating to a transaction is generated for the debt.
([ID: ID1, sender: A, recipient: (B, X)]).

Then, suppose that C has a debt X or not. At this time, using one form of the information processing system according to the present application, data related to a new transaction indicating a debt X that B bears on C may be generated.

[ID: ID2, sender: B, recipient: (C, X)].

However, this ID2 becomes a debt completely unrelated to ID1. If A has more financial power than B and has a very low possibility of bankruptcy, C wants to have a claim for A rather than B. At this time, the distribution of debt utilizing data ID1 relating to a transaction that has already been created as data relating to a transaction indicating that C has a claim against A instead of B is shown below. In this case, in the debt between AB, B is exempted from A's debt, and assuming that A will assume B's debt to C, T data indicating that a debt relationship has been established between ACs is generated as follows: I will do it.

[ID: ID2 ', sender: ID1, recipient: (C, X)]

As shown, the sender is not B. This is because C has no debt to B between BCs. Instead, A takes the debt and uses ID1 which is the previous transaction data. Therefore, even if the data structure indicates the sender's party, T data is shown instead of the party. . By using the above data structure, C can have a credit for A which is more financial than B, and therefore has an advantage that transactions are more active.
That is, the function related to distribution in the system according to the embodiment of the present invention has a technical effect of promoting the transaction of debt.

Note that if A has less funding power than B, and C does not need to have a claim against A, and it is sufficient if C has a claim against B, then C As data indicating that it has a bond, B simply generates data relating to a new transaction.
That is, the technical effect of facilitating the transaction of debts, taking into account the status of the related parties, etc., by the function of providing options for the use or non-use of functions related to distribution in the system according to an embodiment of the present invention Have

According to the above method, B exempts A's debt, A accepts C's debt, and refers to the information of ID1 as in ID2 'above. The expression “T data” is “distributed” is used.

In addition, the above-mentioned circulation of debt may be considered when the amounts do not match. In other words, if it is a creditor of a debt that can be circulated for an amount that is greater than or equal to the amount of debt that it is expected to bear, it is possible to distribute a part of the debt. Dividing part of the debt in this way is called division. Specifically, it is as follows.

[ID: ID1, sender: A, recipient: (B, 100)]
[ID: ID2, sender: ID1, recipient: (C, 30)]
[ID: ID3, sender: ID1, recipient: (B, 70)]

In ID1, A generates T data for B with the amount of debt 100. ID2
B distributes ID1 to C for the amount of debt 30. In ID3, T data is generated for B, which is itself, for the amount of the remaining debt 70 of the amount of debt 30 used for distribution out of the amount of debt 100.

In other words, the data structure that allows two or more creditors (recipients) in the system according to an embodiment of the present invention can be distributed even when the amount of debt distributed and the amount of the recipient do not match. And has the technical effect of promoting the smooth facilitation of debt trading activities.

As can be seen from the above, the data structure that allows the above-mentioned debts to circulate promotes the fact that C in the above has more positive receivables against financially funded A, and thus facilitates smooth debt trading activities. It is a data structure that supports a computer system that can promote computerization.
Similarly, a method, a terminal, a server, an information processing apparatus, or a system that uses the above data structure can technically promote smoothing of such debt transaction activities.

In addition, in the above debt generation, instead of the data indicating the sender, the above data structure is matched as T data that the sender has as a creditor, and the generation of debt and the distribution of debt are unified by a common data structure. It has the technical effect of being realized as a system.

5-2. Examples of functions of debt distribution Functions related to the distribution of T data include distribution original debtor confirmation means 1501, distribution application data creation means 1502, distribution generation means 1503, distribution acquisition means 1504, distribution means 1505, as shown in FIG. There is a distribution communication means 1506. The distribution generation unit 1503, the distribution acquisition unit 1504, and the distribution communication unit 1506 are similar to the functions described in the generation unit 1205, the generation acquisition unit 1202, and the generation communication unit 1203, that is, the T data generation function and the T data, respectively. Information acquisition function and a function to communicate information with other applications.

5-2-1. Distribution obligor confirmation means 1501
Distribution obligor confirmation means 1501 has a function of confirming whether or not T data can be distributed when T data is distributed.

The distribution obligor confirmation unit 1501 in the BC application may directly inquire of the user application whether the T data can be distributed, or may inquire of the user application via the administrator application. When making the inquiry, the distribution obligor confirmation unit 1501 may transmit the contract information related to the T data to the user application.
If the BC app has information on the obligor, the method in which the distribution obligor confirmation means 1501 directly makes an inquiry to the obligor's user application based on the information is simple. There are certain advantages.

On the other hand, when the BC app does not hold the information of the obligor, the distribution obligor confirmation means 1501 inquires the app data of the user application, acquires the obligor information, and based on the information, You may contact the user's user app. When making the inquiry, the distribution obligor confirmation unit 1501 may transmit the contract information related to the T data to the manager application.

If the BC app does not have information on the obligor, the distribution obligor confirmation means 1501 makes an inquiry to the application data of the administrator application, and the administrator application makes an inquiry to the obligor's user application. Also good. Also when making the inquiry, the distribution obligor confirmation unit 1501 may transmit the contract information related to the T data to the manager application. Then, when the administrator application makes an inquiry to the user application, contract information related to the T data may be transmitted to the user application.

In the above description, it is assumed that there is a distribution obligor confirmation unit 1501 in the BC application. However, even when the unit is in the administrator application, the obligor can be determined by a similar inquiry.
In particular, when there is information of the obligor in the application data that the manager application has, the distribution obligor confirmation means 1501 may identify the obligor based on the application data and make an inquiry to the obligor.

The inquired user application of the obligor asks the user whether the T data can be distributed. At this time, the user application may display the contract information related to the T data via the display means.

Moreover, the format which confirms the information of the propriety judged beforehand about the propriety of T data distribution may be sufficient. The user applicability information, the BC app, or the administrator app may be stored in the information on whether or not the judgment is made in advance. The information is transmitted in advance by the user application to the BC application or the administrator application. Distribution obligor confirmation means 1501 may be configured to confirm this information.
The distribution obligor confirmation means 1501 described above has an effect of supporting the obligor's confirmation acquisition for the T data to be distributed and facilitating the smoothness of the debt transaction activity.

5-2-2. Distribution application data creation means 1502
Distribution application data creation means 1502 has a function of creating application data associated with distribution of T data.

The application data accompanying the distribution of T data is information such as the presence or absence of the obligor's consent regarding the distribution of T data, the relationship between previous T data and newly generated T data, and the like.

Distribution application data creation means 1502 acquires information associated with distribution of T data via the acquisition means.

Distribution application data creation means 1502 is based on information associated with the distribution of T data, information on the underlying debtor who permits the distribution of T data, information on the debtor whose debt is exempted, and information associated with the information on the T data A part or all of the above may be created. For example, FIG. 16 shows new T data 1600, original T data (T data to be distributed) 1601, debtor information 1602 exempt from debt, underlying debtor 1603, and contracts related to the T data. It is a table of information 1604. The obligor 1603 is set based on the information of the obligor in the original T data. As a result, the original obligor information is also found when the new T data is subsequently distributed. As a result, the information on the obligor is recorded in the recording table for each T data. Since the exemption obligor 1602 is a debtor of the T data to be distributed, if the exemption obligors when tracing the history of T data with the new T data and the original T data are listed, the obligor when the T data is distributed Becomes clear. When the T data generated at the debt center is distributed by the distribution means 1505, the original debtor is the debtor initially circulated from the debt center as described above. In this case, the exempt debtor 1602 is Even if it is blank, information specifying the debt center may be set. Note that the contract information may be described in more detail.

Further, the distribution application data creation unit 1502 may include information 1605 related to the end of the obligation when the obligation related to the T data ends.

Further, the distribution application data creation unit 1502 may create information that associates the information of the previous T data with the information of the newly generated T data based on the information associated with the distribution of the T data. For example, the ID of previous T data may be created as a history of newly generated T data. At this time, if the previous T data is distributed, the history related to the previous T data may be added as the history of the newly generated T data. For example, FIG. 17 shows an example of a history record 1701 of a conventional T data ID. In the figure, the maximum value of the history is 64 as an example, but it may be set so that T data can be distributed any number of times by taking a list or other data structure format.

Application data that associates T data to be distributed with T data generated at the time of distribution supports the above-described rapid distribution and has an effect of facilitating smoothing of debt transaction activities.

The distribution application data creation means 1502 has an advantage that application data can be easily created in the administrator application when it exists in the administrator application. On the other hand, when the distribution application data creation means 1502 exists in the BC application, the distribution means 1505 is in the BC application, so that there is an advantage that the cooperation with the BC application is easy.

5-2-3. Distribution means 1505
The distribution means 1505 has a function of using and controlling each of the above-described means as necessary while distributing T data.

Based on the distribution acquisition unit 1504, the distribution unit 1505 acquires information on T data to be distributed and information on T data generated in distribution.

The distribution means 1505 may confirm the obligor using the obligor confirmation means. However, if the obligor's confirmation is not necessary, this means need not be used. In this case, the distribution unit 1505 may determine whether or not the obligor's confirmation is necessary based on the application data of the administrator data.

The distribution unit 1505 generates new T data using the distribution generation unit 1503.
In the new T data, information between the original obligor and creditor after distribution is set in the T data. As for the information to be set specifically, corresponding information is set according to the T data structure, as described in the generation means.
However, in the distribution, information on the distributed T data is set as the sender name of the new T data. For example, a part of information related to creditors of T data to be distributed is set as a sender name of new T data. In addition, the ID of the T data to be distributed, information for identifying the T data, a part of the T data, or information on the creditor of the T data to be distributed is set as the sender name of the new T data. Also good.

On the other hand, the creation of application data is different from the generation of new T data. For example, when the T data and the application data are as shown in FIG. 13, the underlying debtor, currency type, scheduled settlement date, and scheduled settlement method set as the application data are not changed.
However, the ID of the original transaction may be updated with information on a contract related to distribution because a contract related to distribution may exist. Thereby, it becomes easy to access the contract information related to distribution from the T data information.

In the case of division, the distribution generation means 1503 sets information on a plurality of parties, which is the number to be divided, together with amounts for each of the plurality of parties as T credits (recipient).
For example, FIG. 18 is an example of two divisions. Along with the division, application data related to T data is copied.

The distribution unit 1505 may use the distribution application data creation unit 1502 to create application data different from the application data at the time of T data generation.
In the case of division, the distribution application data creation unit 1502 may duplicate the application data by the number of divisions. For example, FIG. 18 is an example of two divisions. Along with the division, the ID data history of T data is copied.

5-2-4. Information processing apparatus for executing distribution-related functions Distribution-related functions include functions deeply related to T data, functions deeply related to application data, and functions deeply related to users. Therefore, when the function exists in the same information processing apparatus as the BC application, there is an advantage that information can be exchanged with the BC application having the generation unit 1205 at high speed. When the function exists in the same information processing apparatus as the administrator application in which application data exists, there is an advantage that information can be exchanged with application data at high speed. When the function is in a user application that directly exchanges information with the user, there is an advantage that new information can be acquired from the user or information acquired and held from the user can be used.

Even if there is no such advantage, the function may exist in the same information processing apparatus as the BC application, may exist in the same information processing apparatus as the administrator application, It may exist in the same information processing apparatus.

5-3. Example of flow of debt distribution The flow of debt distribution will be described below with reference to FIG. Hereinafter, a procedure in which the T data distribution confirmation unit in the user application makes an inquiry to the user application based on the application data in the administrator application will be described as an example.

In ST1901, the distribution means 1505, via the acquisition means, information “Yes” for the distribution of debt, and information on newly generated T data (creditor, payment date, currency, amount, or other related information, etc. ) Is transmitted to the distribution original obligor confirmation means 1501.

In ST 1902, distribution obligor confirmation means 1501 provides information on the obligor of the T data to the administrator application together with at least information on the contract (creditor, payment date, currency, amount, and other related matters). Inquire.

In ST1903, the manager application specifies the obligor information of the T data based on the application data in the storage unit, and replies to the user application.

In ST1904, the distribution obligor confirmation unit 1501 makes an inquiry to the obligor's user application together with at least information on the contract (creditor, payment date, currency, amount, or other related matters).

In ST1905, the user application of the obligor confirms whether T data can be distributed. The confirmation may be confirmed to the user by a display screen. At this time, the user application may display information related to the contract on the display unit of the obligor.

In ST1906, when the user application obtains information from the original debtor's user application that T data cannot be distributed, the distribution means 1505 generates one T data or a plurality of T data. Determine whether it is a generation.

If one piece of T data is generated, the user application uses the generation unit 1205 to generate T data. If a plurality of T data is generated, the user application may generate a plurality of T data by using the generation unit 1205 a plurality of times.

When the user application acquires information indicating that T data cannot be distributed from the obligor's user application, the user application sends the obligor to the user via the display means. It may be displayed that the distribution of is not permitted.

In ST1907, when the distribution permission information is “Accept”, the user application may display information regarding generation of T data or generation of the T data via the display unit.

6). End of debt <br/> There are debts that have a deadline and those that do not have a deadline. In general, debts used in commercial transactions are specified at the time of contract and the deadline is reached. To fulfill the debt.

When the T data in one embodiment related to the present invention has a data structure related to the due date, it is possible to process the relationship between the T data and the due date.
At the end of the debt, there are 1) renewal (debt generation), 2) bank transfer processing, and 3) waiver of receivables.
Here, the renewal is to generate new T data instead of the previous T data.

The bank transfer process is a case where, as a bank process, the relationship between receivables and debts is canceled and no new receivables are generated.
In addition, due to various circumstances, it may be abandoned.

A combination of the above may be implemented. Specifically, a bank transfer process may be performed for a portion of the debt amount, and a credit / debt relationship may be generated for the remainder. In addition, in relation to claims and debts, a plurality of claims and debts may be generated. This may be the case when multiple receivables and debts with different deadlines are generated.

6-1. Examples of functions related to termination of debt As shown in FIG. 20, functions related to termination of debt include offsetting means 2001, renewal means 2002, payment preparation means 2003, and communication means. The communication means has a function of communicating with other communication means and has the same function as described above.

6-1-1. Offset means 2001
The canceling unit 2001 has a function of changing the amount of debt of the two T data. Two T data should just be the sum total of the number of the creditor and debtor which concerns on the said T data. You may count as 1 if it is the same corporation and the same base or branch. If they are the same corporation but have different locations or branches, the parties may decide whether to count this as 1. The amount of debt for the two T data need not be the same.

If certain T data and other T data are the reverse of the creditor and the debtor and the amount is the same, both T data can disappear. The T data may be discarded by the discarding unit 2004.

When the amount of certain T data is higher than the amount of other T data, the amount of the certain T data (the debt of the difference) is deducted from the normal amount of debt cancellation. It's okay. That is, the renewal means 2002 may be applied to the difference debt, or the payment preparation means 2003 may be applied. Note that the offsetting of a plurality of parties will be described later.

FIG. 21 is a diagram related to an example showing steps in the case of cancellation. First, the parties in FIG. 21 are X and Y, and can be offset because they are two parties. The arrow between X and Y indicates debt, the origin of the arrow is the debtor, the tip of the arrow is the creditor, and the number appended to the arrow is the debt amount. That is, an arrow means that it is necessary to pay the amount of money added to the arrow. A positive number indicates the amount of debt. For example, between 2101 X and Y there are multiple debts (3, 10, -4, 10). 4 is negative because X is a debtor in debts 3 and 10, whereas X is a creditor in debt 4 and debtors and creditors are opposite to other debts. Because there is. Moreover, although these debts are debts with no time limit, they can be considered similarly as debts with a time limit. In the subsequent similar drawings in this application, the above rules apply.

When these are added up, it becomes 19 as shown in 2103. The 19 may be paid at the bank as in 2102 or may be booked for liquidity lease as in 2104. Further, the renewal means 2002 may be applied and T data may be generated.

In the above, calculation is made for all debts between X and Y, but some calculations may be performed. This is because there is a case where it should be offset or not depending on the situation of the debt.
The headquarters in the present specification refers to a company's parent company, regional subsidiary, in-house bank, bank, bank subsidiary, investment company, post office, financial institution, etc. in the company group.

When the amount of T data is recorded in a virtual currency, for example, satoshi, the amount of each amount may be calculated because the amounts are common. This is one of the advantages of using a common currency when T data is input even when the original transaction is in another currency. The difference may be in the designated currency on the side that receives the amount, or may be paid in the currency that has been agreed to by both the paying side and the receiving side.

When the offset means 2001 is applied to a plurality of debts between two parties to reduce the amount, there is a technical significance of reducing the amount of data processing related to the debts. Further, when the offsetting means 2001 is applied to a high-priced debt that requires a high fee, there is an advantage of reducing the fee by reducing the amount. This means that money transactions are possible between affiliated companies without a fee.

6-1-2. Renewal means 2002
The renewal unit 2002 generates new T data based on the information of the previous T data and the new T data. When generating new T data, the generation unit 1205 may be used. The information of the previous T data can be acquired based on the information specifying the previous T data. For example, information specifying a T data ID or a contract related to T data can be given.

The information may be acquired from the user application, may be acquired from the BC application itself, or may be acquired from the administrator application.
Also, the new T data information may be newly acquired T data information, or, based on the data of a different portion of the T data components compared to the previous T data, Information may be configured.

The renewal unit 2002 uses the generation acquisition unit 1202 and the generation unit 1205 to create a new T data based on the information on the new T data or the information lacking in the information on the new T data based on the information on the previous T data. Generate data. Specifically, the information on the previous T data and the information on the new T data are T data, and thus are part or all of the information described with respect to the generation unit 1205.

Further, the renewal unit 2002 may generate one or more new T data for T data indicating a plurality of existing debts. For example, it is assumed that the debt amounts are 30, 50, 70 (a currency type is omitted) as a plurality of existing debts, and all are T data from the debtor A to the creditor B. In this case, the generation unit 1205 generates T data indicating the debt from the debtor A to the creditor B and having a debt amount of 150. The plurality of debts may be the same or different from each other. Moreover, the term of a debt may be the same or different. One or more T data may be generated. In the case of one, the generation unit 1205 is applied once in the renewal unit 2002 as in the above example. When a plurality of T data is generated, the generation unit 1205 is applied a plurality of times in the renewal unit 2002. In this case, information such as debtors, creditors, debt amounts, etc. for a plurality of T data to be generated is necessary, but this is generated and acquired in response to the generation means 1205 being applied a plurality of times. The means 1202 may be applied a plurality of times, or the generation acquisition means 1202 capable of acquiring information for generating a plurality of T data may be applied once.

Further, the renewal unit 2002 transmits information on the relationship between the newly generated T data or the relationship between the previous T data and the newly generated T data to the administrator application or the user application via the generation communication unit 1203. May be. For example, FIG. 22 is an example of a table showing the association between T data before renewal and T data after renewal. From this table, it can be seen that the ID of the T data before renewal is IDA, but the ID of the T data after renewal is related to IDX. Further, it can be seen from the table that the ID of the T data before renewal is IDB, and the ID of the T data after renewal is related to IDY. In the above table, the T data before the renewal and the T data after the renewal are shown as an example of a one-to-one relationship, but the present invention is not limited to this. For example, the table may be a one-to-many relationship in which one piece of new T data after renewal is associated with a plurality of pieces of T data before renewal. The table may be a many-to-one relationship table that associates new T data with each other, or may be a table with many-to-many relationship that associates a plurality of new T data after renewal with a plurality of T data before renewal. Good. In short, it is only necessary to associate the T data before renewal, which is the target, with the newly created T data after renewal. The data is generally recorded in the administrator application, but may be recorded in the BC application or the user application.

When the renewal means 2002 is applied to a large number of debts that have expired, there is an advantage that a plurality of debts can be collected and T data relating to the debts can be reduced. That is, there is an advantage that the management burden on the T data of the parties related to the system can be reduced. In addition, when a fee is required at a financial institution for the payment of the debt, by applying the renewal means 2002 to the T data that is the debt that has reached the deadline, new T data is generated, There is an advantage that becomes unnecessary.

6-1-3. Payment preparation means 2003
The payment preparation means 2003 has a function of preparing for payment. For example, the payment preparation means 2003 may generate financial institution processing materials for paying the contract based on the contract information related to the T data. Further, the payment preparation means 2003 may generate a material on liquidity lease with the controlling company, another party, or another affiliated company. The payment preparation means 2003 has a technical significance for promoting the circulation of information when data of a system according to an embodiment of the present invention is linked with another system.

The payment preparation means 2003 can be input with information related to the debt, such as information on the original debtor, debt amount, creditor, payment deadline, currency type, and the like. Further, the payment preparation means 2003 may receive T data as input or application data related to T data information.

Further, the payment preparation means 2003 sends information related to the payment via the communication means 2005 to another party, the parent company of the company, the regional base subsidiary, the in-house bank in the company group, the bank, the bank subsidiary, the investment company, the postal mail. You may contact a financial institution such as a bureau.

6-1-4. Disposal means 2004
The discarding unit 2004 has a function of discarding T data.
The discarding unit 2004 may generate T data in which information intended to be discarded is set as a recipient related to the T data. The information intended to be discarded may be any information as long as the system according to an embodiment of the present invention can be identified as discarded. For example, a discarded address, a discarded public key, a discarded secret key, and the like are set. May be. The information may be anywhere in the T data that is intended to be discarded, and may be set, for example, in the data column of the recipient, the money amount column, or the like. Also, any information other than the information set for the T data generated by applying the discarding unit 2004 may be set.
The discarding means 2004 may be applied to clarify that the T data does not indicate a currently existing debt, since the information set in the existing T data cannot be changed. However, instead of applying the discarding unit 2004 to the T data, or in combination with applying the discarding unit 2004, it is confirmed that the obligation indicated by the data is not valid for the data specifying the T data in the application data. Information to be shown may be set.
The discarding unit 2004 may be applied by the distribution unit 1505, the canceling unit 2001, the renewal unit 2002, the payment preparation unit 2003, the discarding unit 2004, or the like. Any means may be applied if the intended T data is to be discarded.

The discarding unit 2004 may be used for discarding unnecessary T data as post-processing after applying the offsetting unit 2001, the renewal unit 2002, and the payment preparation unit 2003 described above.

The discarding unit 2004 may append a record of discarding to the T data when the application data of the administrator application includes T data. When the T data is discarded by the discarding unit 2004, it becomes clear that the T data does not represent a debt.

6-1-5. Application for executing debt termination related functions The functions related to debt termination include a function deeply related to T data, a function deeply related to application data, and a function deeply related to users. Therefore, when the function exists in the same information processing apparatus as the BC application, there is an advantage that information can be exchanged with the BC application having the generation unit 1205 at high speed. When the function exists in the same information processing apparatus as the administrator application in which application data exists, there is an advantage that information can be exchanged with application data at high speed. When the function is in a user application that directly exchanges information with the user, there is an advantage that new information can be acquired from the user or information acquired and held from the user can be used.
However, even if the above advantages are not provided, the function may exist in the same information processing apparatus as the BC application, may exist in the same information processing apparatus as the administrator application, It may exist in the same information processing apparatus.

6-2. Example flow of debt termination
6-2-1. Example of flow related to cancellation Next, a flow related to cancellation will be described with reference to FIG.

In ST2301, the canceling unit 2001 acquires information on two pieces of T data.

In ST2302, the offsetting unit 2001 uses the same T-data creditor as the other T-data debtor, and the certain T-data debtor and the other T-data creditor are the same. If so, go to the next step.

In ST2303, the canceling unit 2001 compares the amounts of the two T data, and if they are the same, applies the discarding unit 2004 to both T data.

In ST2304, if the amounts of the two T data are different, the offsetting unit 2001 deducts the lower amount from the higher amount, and updates the remaining amount together with the creditor / debtor information of the higher amount of T data. The means 2002 or the payment preparation means 2003 is applied.

6-2-2. Example of flow related to renewal Next, the flow of renewal will be described with reference to FIG.

In ST2401, the generation acquisition unit 1202 acquires information.

In ST2402, if there is an instruction to update the T data in the acquired information, the generation acquisition unit 1202 transmits the previous T data information and the new T data information to the updating unit 2002.

In ST2403, the renewal unit 2002 applies the generation unit 1205 to generate new T data.

In ST2404, generation means 1205 transmits relevant information to renewal means 2002.

In ST2405, the renewal means 2002 transmits information related to the previous T data and the newly generated T data to the administrator application.

7). Multilateral netting In the offsetting of debt between parties, when offsetting between three or more parties, the relationship between offsets is complicated. Such an offset between three or more parties is called multilateral netting, and its specific processing has been considered complicated. More specifically, the debt is between the two parties where the debtor and creditor are identified, but according to multilateral netting, each party's debt or claim against a third party is calculated using a formula. There was a problem that the obligor or creditor was not clear.

In this section, a method for realizing multi-lateral netting in an embodiment relating to the present invention in which the parties to debts in the above-mentioned multi-lateral netting are clarified will be described. The creation of T data, the distribution of T data, the renewal of T data, and the disappearance of T data are realized by, for example, the above-described means.

In addition, multilateral netting requires a group in which three or more parties to be offset are set. Multilateral netting involves offsetting debt between parties within a group. A party may belong to multiple groups. However, if multiple items belong to multiple overlapping groups, it is necessary to determine which group will be offset as the debt. It is assumed that group information or information about which group is offset as debt is registered in the application data in advance. Note that the user application may have the information.

7-1. Multi-lateral netting with headquarters
7-1-1. Example FIG. 25 is a diagram illustrating a process of multilateral netting. In this figure, parties A, B, C, and D are multi-lateral netting groups. The same applies to multi-lateral netting without a headquarters described in 7-2 and 7-3 below.

In 2501, each debt is described without being offset, but if the offset can be easily executed between two parties within a plurality of parties, the offset may be made in advance between the two parties.

The debt that A bears on B in 2501 is expressed as follows. Note that T data exists for all arrows represented by 2501, but the description thereof is omitted here.

[ID: ID1, sender: A, recipient: (B, 3)]

At 2502, each debt is changed to one with each party and the controlling company as parties.
For example, the following two T data are generated for the ID1.

[ID: ID2, sender: ID1, recipient: (supervising company, 3)] (between A and the supervising company)
[ID: ID3, sender: managing company, recipient: (B, 3)] (between B and managing company)

Here, the T data ID1 is distributed, and the T data ID2 between the creditor A of the T data ID1 and the controlling company is generated. That is, the distribution means 1505 is applied to ID1 with A and the controlling company as parties.

On the other hand, a new T data ID 3 is generated between the managing company as the creditor and B as the debtor. That is, renewal means 2002 is applied to ID1 with B and the controlling company as parties.

Also, in FIG. 2501, the debt that B, which is the debt in the opposite direction between AB, bears on A is expressed as follows.

[ID: ID4, sender: B, recipient: (A, 2)]

As in the case of the above-mentioned 3 obligations, the processing moves to FIG.

[ID: ID5, sender: ID4, recipient: (supervising company, 2)] (between A and the supervising company)
[ID: ID6, sender: managing company, recipient: (B, 2)] (between B and managing company)

That is, the distribution means 1505 is applied to ID4 with A and the controlling company as parties. For ID4, the renewal means 2002 is applied with B and the controlling company as parties.

Similarly, such T data is created for data relating to other transactions.

In the step 2502, a plurality of T data exist between A and the controlling company. When the values are listed, there are data on 2, 3, 5, 3, 7 and 8 from the left side of the figure.

Since these are debts between the two parties, they can be offset by calculation. That is, the offsetting means 2001 is applied to the T data related to these debts. Specifically, it is 2-3 + 5-3 + 7-8, and the value of the calculation formula is −2. Here, since the supervising company calculated the debt to A as a positive value, as described above, a negative value of −2 means that A assumes a debt of 2 to the supervising company. This means that between A displayed in 2503 and the controlling company, the arrow is written as 2 from A to the controlling company. Note that the calculation formula may be calculated in the opposite direction, considering the parties to the debt in reverse.

Similarly, calculations are made for transactions between B, C, or D and the controlling company. That is, the canceling unit 2001 is applied. As a result, the values 12, 5, and 9 are calculated.

After this, the debt between the controlling company and each party is 6. Several options will be selected as described in Debt termination. Since there is a debt with the headquarters, it can also be treated as a liquidity lease with the headquarters. Credit can also be set up with the headquarters.

7-1-2. Example of flowchart Next, a flowchart of multilateral netting in the case where there is a supervising company will be described with reference to FIG.

In 2601, T data between each party and the controlling company is created based on the T data between the parties. Here, the T data between the parties may be distributed using the distribution means 1505, and the T data may be generated between the party on the debtor side of the T data and the controlling company. Further, based on the T data between the parties, the renewal means 2002 may be used to generate T data between the party on the creditor side of the T data and the controlling company.

In 2602, part or all of the T data between each party and the controlling company is canceled using the offsetting unit 2001.

In 2603, the payment preparation means 2003 is applied to a part or all of the T data between each party and the controlling company.

7-1-3. Example of flowchart of final processing FIG. 27 is a flowchart showing the final processing of multilateral netting including a supervising company.

The final process 2701 is registered in advance. The information may be recorded in the user application, or may be recorded in the BC application or the administrator application.

In the case of liquidity lease 2702 with the headquarters, a credit line may be defined. The information on the credit frame may be recorded in the user application or may be recorded in the administrator application.

At the stage of settlement date 2703, options for liquidity lease 2704, renewal of new debt 2707, and bank transfer 2708 are determined. In the case of the liquidity lease 2704, if it is within the credit limit 2705, the liquidity lease 2706 ends. On the other hand, if the debt exceeds the credit limit, the handling of the debt amount will be consulted outside the system according to one embodiment of the present invention, and the system according to one embodiment of the present invention is a new Supports 2707 renewal of debt instruments or bank transfer 2708. Specifically, when the generation to the new debt certificate is selected, the renewal means 2002 is applied to generate T data, and when the bank transfer is selected, the payment preparation means 2003 is applied.

In multilateral netting that handles debt relationships among multiple parties of three or more parties, the inclusion of an actual headquarters company has the advantage that each party can carry out debt transactions without exceeding actual debts. is there. In addition, when a credit line is established, there is an advantage that debts can be managed safely together with the controlling company. Furthermore, when debts remain between the parties and the financial institution that is the controlling company, there is an advantage that debt processing can be realized quickly.

Although FIG. 27 has been described above as a case of multilateral netting with a controlling company, the method of FIG. 27 is not limited to the above case. For example, the present invention can be applied to multi-lateral netting with temporary parents or parents who do not have a supervision company. In this case, since there is no supervising company, processing such as renewal to a new debt certificate (applying the renewal means 2002) or processing for bank transfer (applying the payment preparation means 2003) may be used.
Moreover, the method of FIG. 27 is applicable also in the multilateral netting between two parties. Also in this case, since there is no supervising company, processing such as renewal to a new debt certificate (applying the renewal means 2002) or processing for bank transfer (applying the payment preparation means 2003) may be used.

In the above description, 2701 information is registered in advance. However, the information may be changed by a command from a user application or an administrator application.

7-2. Multilateral netting without a controlling company Next, multilateral netting without a controlling company will be described. Multilateral netting without a headquarters, which is a form of the information processing system according to the present application, has the advantage that the fee required in relation to the headquarters is not required because the system does not go through the headquarters. It is a system that can promote transactions.
This embodiment will be described with reference to FIG. 28 using the same debt relationship as the numerical example of 7-1. That is, the debt relationship between A, B, C, and D, which are a plurality of parties, proceeds from 2801 to 2803 in the same manner as described in 7-1. However, the process proceeds with the temporary parent instead of the controlling company. That is, the data relating to the transaction has the same ID1 as described above, but has the following ID2 ′ and ID3 ′ instead of ID2 and ID3. Here, the information specifying or referring to the temporary parent as the party may be any information indicating the temporary parent in the system. It does not have to be information indicating a real party.

[ID: ID1, sender: A, recipient: (B, 3)]
[ID: ID2 ′, sender: ID1, recipient: (temporary parent, 3)] (between A and temporary parent)
[ID: ID3 ′, sender: temporary parent, recipient: (B, 3)] (between B and temporary parent)

Here, the T data ID1 is distributed, and a T data ID2 'between the creditor A of the Tdata ID1 and the temporary parent is generated. That is, the distribution means 1505 is applied to ID1 with A and the temporary parent as parties.

On the other hand, a new T data ID 3 ′ is generated between the temporary parent who is the creditor and B who is the debtor. That is, renewal means 2002 is applied to ID1 with B and the temporary parent as parties.

Next, as described above, the debt between the temporary parent and each party is offset. That is, the offsetting means 2001 is applied to the T data related to these debts. In this example, the values 2, 12, 5, 9 are calculated as described above.

Next, T data between the parties excluding the temporary parent is created based on the T data related to the temporary parent. The T data is created by applying distribution means 1505 and renewal means 2002.
In addition, the distribution means 1505 or the renewal means 2002 may be applied to the T data between the parties in descending order of the debt to the temporary parent and in the descending order of the debt of the temporary parent.

An example will be described with reference to FIGS. 29 and 30. FIG.

First, T data created in the step 2901 is shown below.
[ID: ID1, sender: A, recipient: (temporary parent 2)]
[ID: ID2, sender: B, recipient: (temporary parent, 12)]
[ID: ID3, sender: temporary parent, recipient: (D · 9)]
[ID: ID4, sender: temporary parent, recipient: (C / 5)]

By applying distribution means 1505, discarding means 2004, renewal means 2002, etc. to these T data, the next T data is generated.

[ID: ID5, sender: ID2, recipient: (D • 9), (temporary parent • 3)]
[ID: ID6, Sender: ID3, Recipient: (Discard Address / 9)]
[ID: ID7, sender: ID5, recipient: (C.3)]
[ID: ID8, Sender: ID4, Recipient: (Discard Address-3) (C-2)]
[ID: ID9, sender: ID1, recipient: (C.2)]
[ID: ID10, sender: ID8, recipient: (discard address / 2)]

This will be specifically described. First, as the amount of debt to a temporary parent, there are 12 between B and temporary parents and 2 between A and temporary parents. Since the debt amount 12 is larger than B-temporary parent 2 compared to A-temporary parent 2, T-data between B-temporary parents is specified as the payer maximum amount certificate. In addition, the amount of debt possessed by the temporary parent is 9 between the temporary parent and C when the 9 between the temporary parent and D is compared with 5 between the temporary parent and C. Specified as the maximum amount certificate.

Then, the debt amount 12 is larger when the payment side maximum amount certificate 12 is compared with the receiving side maximum amount certificate 9 and the payment side maximum amount certificate 12. Therefore, among the T data 12, 9 which is the debt amount of the receiving side maximum amount certificate is distributed from the temporary parent to D. Further, the amount obtained by subtracting 9 which is the debt amount of the receiving side maximum amount certificate T data from 12 of the payment side maximum amount certificate T data is distributed to the temporary parent using the division. That is, the distribution means 1505 is applied to the payment side maximum amount certificate 12, and the distribution generation means 1503 generates T data of the amount 9 and the amount 3. The data created by the means is ID5.

In addition, ID3, which is a debtor related to the receiving side maximum amount certificate, is sent to the discard address in order to exempt from the obligation of the receiving side maximum amount certificate for the temporary parent. That is, the discarding unit 2004 is applied to ID3, and ID6 is created.

Next, since there are 2 between the A-temporary parents and 3 between the B-temporary parents as the amount of debts to the temporary parents, 3 between the B-temporary parents, which is the maximum debt amount, becomes the payer maximum amount certificate.
In addition, as the amount of debt to the temporary parent, 5 between the temporary parent and C is the receiving side maximum amount certificate.
When 3 between B-temporary parent and 5 between temporary parent-C are compared, 5 between temporary parent-C is large, and therefore the maximum amount certificate on the receiving side becomes large.

Then, the payer maximum amount certificate is distributed to C, who is the debtor related to the receiver maximum amount certificate. That is, the distribution means 1505 is applied to the 3 T data between the B and the temporary parent, which is the payment side maximum amount certificate, and the distribution generation means 1503 generates the T data of the amount 3. The T data is ID7.

In addition, C, who is the debtor of the maximum amount certificate on the receiving side, is exempted from 3 which is the amount of the maximum amount on the receiving side of the temporary parent for the amount of the debt on the maximum amount on the payment side. 3 is discarded, and the remaining 2 is distributed to C, who is the debtor. That is, the distribution means 1505 is applied to ID4, and ID8 is created.

Finally, since there is 2 between the A-temporary parents as the amount of debt to the temporary parent, 2 between the A-temporary parents is the payer maximum amount certificate as the maximum debt amount.
In addition, as the amount of debt to the temporary parent party, 2 between the temporary parent and C is the receiving side maximum amount certificate.

Comparing 2 between B-temporary parents and 2 between temporary parents-C, the debt amount is the same. Therefore, the payment-side maximum amount certificate is distributed to C, who is the debtor associated with the receiving-side maximum amount certificate. That is, the distribution means 1505 is applied to the payment side maximum amount certificate 2, and the distribution generation means 1503 generates ID9 which is T data of the amount 2.

Further, C, who is a debtor related to the maximum amount certificate on the receiving side, exempts 2 which is the maximum amount on the receiving side of the temporary parent corresponding to the amount of the debt on the maximum amount on the payment side, and thus the T data is discarded.
That is, the discarding unit 2004 is applied to ID8, and ID10 is created.

As described above, one of the advantages of calculating in descending order of debt is that, in the case of calculating in descending order of debt, generally the party with the large debt uses a lot of the system according to one embodiment of the present invention. is there. In this case, as a usage fee for the system according to the embodiment of the present invention, there is a reasonable reason that a party with a large debt bears a large fee. In addition, there is an advantage that processing of a large debt can be performed with priority.

In the above description, processing is performed in descending order of debt, but processing may be performed in ascending order of debt on the receiving side debt certificate or paying side debt certificate. Further, as long as the distribution unit 1505 and the discard unit 2004 are appropriately applied, the processing order may be any order. That is, in FIG. 29, the maximum amount certificate on the payment side and the maximum amount certificate on the receiving side are only examples. In short, if the T data for the temporary parent and the T data possessed by the temporary parent are specified and the flowchart of FIG. Person becomes clear.

In the above embodiment, first, the debt amount 9 to D is indicated by T data of ID5, and since the ID5 is the distribution of ID2, the original ID B is the sender of B. It turns out that he is a debtor.
Further, the debt amount 3 to C is indicated by T data of ID11, the ID11 is obtained by distributing ID5, and the ID5 is obtained by distributing ID2. It can be seen that B, the sender of ID2, is the underlying debtor.
Finally, debt amount 2 to C is indicated by T data of ID13. Since ID13 is a distribution of ID1, A, the sender of ID1, is the underlying debtor. I understand that.

The above means has the technical effect of eliminating the obligor's opacity in multilateral netting by the clarity of the calculation process of multilateral netting.

As described above, after specifying the target T data to be processed, such as giving priority to the T data relating to the maximum debt amount to the temporary parent and the T data relating to the maximum debt amount possessed by the temporary parent, the distribution means 1505 or the discarding means The process using 2004 makes the underlying debtor clear.

As described above, by distributing T data in multilateral netting, T data representing the initial debt between the parties is temporarily distributed to other parties while the temporary parent is temporarily a creditor. From the above, it can be shown that the party after the multi-lateral netting has a debt relationship in the form that the original debtor has not changed and has inherited the original debt between the parties.

7-3. Multi-lateral netting <br/> without headquarters then, there is no headquarters, one of the parties to explain the multi-lateral netting of the type to be a parent. Unlike the above, there is an advantage that a calculation step is short because a temporary parent is not provided. However, since one of the parties plays the role of parent or supervising company, the other party is at risk of being unable to pay or postponing payment.

First, a parent is set. In 3101 of FIG. 31, the party A is the parent. The parent may be determined by any method. A parent may be determined by agreement between parties of multilateral netting, a parent may be set in order among the parties, or a specific party is determined by a random number in the information processing apparatus Etc. In short, any method may be used as long as one of the parties of multilateral netting is determined as a parent in the stage of executing multilateral netting. Data related to the parent may be set as application data.

Next, based on the T data between the parties, all T data between the parties and the parent is generated. For example, in 3101, debt 10 that B bears against D is changed to debt 10 that B bears on parent A and debt 10 that parent A bears on D. In this case, the debt 10 owed to D by B is circulated, B becomes debt 10 owed to parent A, and a new debt 10 owed by parent A to D is created.

[ID: ID1, sender: B, recipient: (D · 10)]
[ID: ID2, sender: ID1, recipient: (A · 10)]
[ID: ID3, sender: A, recipient: (D · 10)]

Specifically, the distribution means 1505 is applied to ID1, and ID1 is distributed to create ID2 of T data, which is debt 10 that B bears on parent A. Further, the renewal means 2002 is applied to ID1, and T data ID3, which is the debt 10 that parent A bears on D, is newly created.
In this way, T data relating to the parent and the parties is generated based on the T data not including the parent as a party.

Next, the offsetting unit 2001 is applied to some or all of the plurality of T data related to the parent and each party. In FIG. 31, cancellation means 2001 is applied to a plurality of T data 3102 between the parties, and T data between the parent A and each party is created.

In the above description, A has been described as a parent. However, a person skilled in the art of multilateral netting may be set as a parent in order. For example, in each month, a person skilled in the art of multilateral netting may become a parent in turn, or a parent of a person skilled in the art of multilateral netting may change in turn every two months.
Describing in 8-1 below, in the system according to an embodiment of the present invention in which a large number of company groups participate, the parent company of each company group may be the parent. When large-scale corporate groups use multi-lateral netting using a payment system, there may be a problem of who the parent is. In the system 7-3 according to an embodiment of the present invention, Using the described multilateral netting, the problem of setting up such a parent is technically solved by periodically changing the parent.

Flowchart example Next, the above flowchart example will be described with reference to FIG.

First, in ST3201, a parent is set.

In ST3202, T data between each party and the parent is generated based on T data between the parties.

In ST3203, a plurality of T data between the parent and each party are canceled.

7-4. Processing in multi-lateral netting FIG. 42 is an example of multi-lateral netting and bilateral netting options that cancel each other out. A includes bilateral netting and multilateral netting, and B includes a settlement processing method. For the liquidity lease with B1's headquarters, T data will be created between the parties and the headquarters. T-data is newly generated when renewing to the new debt certificate of B2. In FIG. 42, the settlement scheduled date is described, but this is an example, and the settlement scheduled date may not be present. The bank transfer of B3 may be to prepare for bank processing using the payment preparation means 2003.

In the lower part of FIG. 42, explanations for each option of A and B are described.

43 to 45 are examples of application data related to multilateral netting. By having the application data in the administrator application, an instruction for multilateral netting can be issued, but other BC applications or user applications may have these application data.

FIG. 43 depicts an example of a table that stores information regarding each netting group. Group A to group F are recorded as examples of netting groups. Of course, a larger number of groups may be recorded. As described above, multilateral netting includes a supervising company (7-1), a temporary parent type (7-2) without a supervising company, and a parent type (7-3). In the table of FIG. 43, the headquarters company, temporary parents, and parent columns are described in accordance with these. Each column records specific information corresponding to each group of netting.

For example, in the row of group A, company A is recorded as the controlling company. This means that Company A plays the role of the controlling company in Group A multi-lateral netting. In the row of group B, an administrator is recorded as a temporary parent. This means that in the group B multi-lateral netting, the administrator plays the role of a temporary parent. In the row of group C, virtual subject A is recorded as a temporary parent. This means that the virtual subject A plays the role of a temporary parent in the group C multi-lateral netting.

Similarly, in the row of group D, party X is recorded as a temporary parent. This means that in the multi-lateral netting of group D, the party X plays the role of temporary parent.
In the group E row, the party Y is recorded as a parent. This means that the party Y plays the role of the controlling company in the multi-lateral netting of the group D.
Further, in the group F row, company B is recorded as the controlling company. This means that in the multi-lateral netting of Group F, Company B plays the role of the controlling company.

FIG. 44 is an example of a table in which participants or members of each netting group are recorded. Participants are recorded for each group of netting groups. For example, in the group A, companies A to E participate. In Group B, companies X to Z participate. Thus, the number of participants in each group may be different. In group C, X, Y, and B participate. Companies X and Y participate in both groups B and C. Company B participates in groups A and C.

FIG. 45 shows an example of another table that stores information on a netting group. Party X belongs to group A and has a bilateral relationship with Z. Party Y belongs to group B and group C. In this way, the parties can belong to multiple groups. Party Z belongs to group B and has a bilateral relationship with X.

When performing the above-described multilateral netting, the administrator application refers to the table shown in FIG. 44, FIG. 45, or the like and acquires information on parties belonging to each group, and then executes multilateral netting. To do. At that time, the manager application refers to the table shown in FIG. 43 or the like, specifies the type of multilateral netting for each group, and executes the corresponding multilateral netting. In other words, if the type has a headquarters company, multi-lateral netting as in the example described in 7-1 is executed, and if there is no headquarters and there is a temporary parent type, the example described in 7-2 is executed. If the type is such that there is no supervising company and there is a parent, multi-lateral netting as in the example described in 7-3 is executed.

43 to 45 and the companies A to E, X to Z, the manager, the virtual subject A, and the parties X to Z described above may be any information as long as they indicate information. For example, a public key indicating these, a part of the public key, or a hash function applied to them may be used.

7-5. Multi-Lateral Netting Group The multi-lateral netting group can be set by ID as described above, which will be described in more detail. A group is a group capable of performing multi-lateral netting (including bilateral netting if two parties are included). In the system according to an embodiment of the present invention, IDs can be set, so that the parties can be freely set. Can be set.

Conventionally, netting has been performed in a hierarchical structure under the trust of the upstream hierarchy. For example, FIG. 48 shows a conventional netting example. In Figure 48, for the subsidiaries and grandchildren that do netting, the Asian headquarters and European / American headquarters first exist in the upper level, and the parent or financial subsidiary exists as the global headquarters in the upper level. Was. For this reason, it is not possible to freely set a group for settlement, and it is necessary to set such a hierarchical structure for each group for settlement. On the other hand, in the multi-netting of the system according to an embodiment of the present invention, such a hierarchical structure is not necessary, and the multi-lateral netting can be performed only by setting a group specifying the parties participating in the multi-lateral netting. There is an advantage that can be implemented.

For example, FIG. 49 is an example in which various multilateral netting groups are set. Each box is surrounded by 4900 and a square. A child / grandchild represents a subsidiary or a grandchild company, and examples of the parties surrounded by a square include a parent company, another company outside G (other companies outside the group), employees, and in-house restaurants. A thin oval circle of 4901, 4903, 4904, or 4905 indicates a set group. A thick circle of 4902 indicates a parent in the group. In the 4901 ellipse, the labor cost is described. This shows an example in which a multi-lateral netting group is set for the costs of incident costs of three children and grandchildren (the company) and personnel costs of the parent company. For example, in a group company in which the parent company has shares in the child / subsidiary company, personnel may be transferred.In this case, only in terms of labor costs, between each child / subsidiary company and the parent company, There are cases where multilateral netting is required. Therefore, this is an example of multilateral netting in which a group is set for the item of personnel expenses. Since the parent company that is one of the parties is the parent of 4902, this is an example of multi-lateral netting with a parent as described in 7-3. You may do. The background to this example is that information inside the group company, such as personnel expenses, is not preferred for exchange of information with companies outside the group company. In other words, in the case of expenses that only the closed party related to the corporate group, such as personnel expenses, wants to exchange information, the request is technically limited by limiting the parties of the multilateral netting group to the parties related to the corporate group. Can be realized.

Similarly, at 4903, an example of multilateral netting for goods or services is shown. In this case as well, there are cases where information exchange with companies outside the group company is not preferable, such as when specific conditions are attached to articles between affiliated companies. In other words, if it is an expense that only requires a closed party related to a corporate group to have a condition related to a specific goods / service, the request can be made by limiting the parties of the multilateral netting group to those related to the corporate group. It can be technically realized. In the 4903 multilateral netting group, one child / grandchild of the party is surrounded by a thick circle as a parent. As described above, a parent is not set and a temporary parent or a headquarters is set. May be. In addition, even if a parent company is included as one party of the group, the parent company may be a parent, or another child / grandchild may be a parent.

4904 is a multilateral netting group in which the parent company and two other non-G companies are parties. In the case of an article for which conditions for transactions outside the affiliated company are set, an example of setting with an article purchased from another company is conceivable. The parent is the same as described above.

4905 is an example regarding electronic money. This includes employees and in-house restaurants. For example, some rewards in a company are paid with electronic money, which can be used in an in-house restaurant. That is, in the system according to one embodiment of the present invention, T data is generated, and the T data is used in an in-house restaurant, so that in-house electronic money can be created at a low cost. It becomes.

Although multi-lateral netting for each item has been described, the item may be one or a plurality of items. Further, instead of or together with the expense item, it may be divided according to the headquarters, department, section in the company, or an organization with a similar name in the company. Further, in the case of a company system, it may be divided according to each in-house company or according to the headquarters, department, section in the in-house company, or an organization with a similar name in the company. For example, FIG. 50 is an example.

In FIG. 50, three netting groups 5001, 5002, and 5003 are set for the A, B, and C companies. 5001 includes the A1 business unit, the B1 business unit, the B1 term multiple unit, and the C1 business unit. This is an example of multilateral netting in the supply chain. In B company, it is considered that B1 purchasing department purchases parts from A1 division, B1 division manufactures products based on the parts, and the products are sold to C1 division. This is an example of a group of two multilateral nettings.
Reference numeral 5002 discloses an example in which the A2 business unit, the B2 business unit, and the C2 business unit form a multilateral netting group for different goods or services. Furthermore, the target of multilateral netting is not limited to goods or services. For example, the financial departments of each company belong to a multilateral netting group, and multilateral netting can be performed for financial related items. Good.

In the above description, it has been described that a group of multilateral netting can be freely set. However, a person who has the authority to set the group is restricted on the system according to the embodiment of the present invention, and only a specific person can be set. Also good. For example, a system administrator according to an embodiment of the present invention, a parent company, or a specific person with the consent of a plurality of parties may set the group.

8). Example between multiple parties
8-1. Background of debt processing among a plurality of parties An example in which a plurality of parties having a debt relationship have a certain relationship will be described below.
For example, FIG. 33 shows independent parties A3301, B3302, and C3303, D3304, and E3305, which are a collection of multiple organizations. A and B are independent corporations, and these are independent. On the other hand, C and D are corporation groups having a certain group. C1 is the parent company of the C group, C2 and C3 are subsidiaries, and C4 and C5 are grandchild companies. In addition, even within a corporation, actual accounting processing may be regional. Therefore, C4 may have C4 ′ that is the original method and C4 ″ that is the branch. These can be said to be overseas bases. A similar configuration is also illustrated in the corporation D. Further, the financial service company E may also have a configuration corresponding to the fact that a corporation forms a group company.

An actual company group has, for example, the above-described configuration, and each corporation, branch, etc. in the company group independently has a credit and debt relationship with a corporation inside and outside the company group. And about the payment place, not only a corporation unit but payment may be specified in a branch unit.

In the above-mentioned complicated relationship between the parties, there are cases where a large number of receivables and payables are generated, and each receivable and payable has a time limit. Therefore, it is important to appropriately process these receivables and payables.

If a financial institution processes the above-mentioned receivable-liability relationship, the fee increases and the procedure becomes complicated. It is preferable that the parties can realize processing related to claims and debts using the information processing apparatus in a simple, safe and low cost manner.

The system according to an embodiment of the present invention can realize the above-described processing related to claims and debts surrounding a complex group of companies. That is, a large number of receivables and debts relations are obtained through multilateral netting or bilateral netting between two parties, that is, the above-described generating means 1205, distribution means 1505, renewal means 2002, offsetting means 2001, payment preparation means 2003, or discarding means. By appropriately using each means such as 2004, the amount of receivables and payables can be reduced.

For example, by using the renewal means 2002, the number of receivables and payables can be reduced. As a result, even if payment is required for bank processing, the number of processing is reduced and the burden of bank processing is reduced. For example, even if the number of contracts between organizations is several hundreds or thousands, the amount of information processing apparatuses that support this can be reduced by reducing the number of contracts. In addition, for example, when the amount of receivables and payables is reduced by using the offsetting means 2001, a large amount of movement in inter-company transactions is reduced, so that the confirmation burden on the information processing apparatus that supports this is reduced. Or, fees for bank processing will decrease.

Further, when the system according to an embodiment of the present invention includes the distribution means 1505, it can be configured to pay the original debtor, which is different from the direct party having the credit / debt relationship. Explaining its technical meaning, if the system according to one embodiment of the present invention includes the distribution means 1505, the underlying debtor generating T data is assumed to be a large and reliable large company. Distribution of T data will be continued because of the trust in payability due to the financial power. Therefore, the cost is reduced and the transaction is promoted.

Furthermore, when the system according to an embodiment of the present invention includes the renewal means 2002, the T data that has reached the deadline is renewed by the renewal means 2002, so that the bank processing that is a typical payment means is not required. , Commissions can be reduced and transactions can be promoted.

In an example, a party may be a corporate group itself, a parent company, a subsidiary, a grandchild company, an affiliated company within a corporate group, or an affiliated company in addition to a single legal entity in a corporate or financial service company. Moreover, the original law, a branch, a base, etc. in one corporation may be sufficient, and the geographically different part in the same corporation, or an organizationally different part may be sufficient. Further, the party may be a netting center or a subnetting center. Further, as described above, the party may be a private person or a general individual.

FIG. 46 is a block diagram showing a part of an embodiment of the present invention including multilateral netting. In FIG. 46, a user application 4601, a BC application 4602, and an administrator application 4603 are disclosed, and a part of means included in each application is illustrated, and an example of a system according to an embodiment of the present invention is described below. To do. From the user application 4601, the user gives various instructions to the BC application or the administrator application. An example of a part of the user application will be described next. The BC application 4602 mainly takes charge of generation of T data by the generation unit, generates a block chain, and stores them in the storage unit. The administrator application 4603 stores application data associated with the generation of T data in a storage unit. Also, distribution means is applied to distribute T data. In addition, the T data is renewed by applying renewal means. Further, an offsetting unit is applied to cancel the T data. In these cases, new T data may be generated by applying the generation means in the BC application. Further, in multi-lateral netting, each means may be applied as described above, corresponding to the case where a supervising company is set, a temporary parent is set, or a parent is set. In these cases, the above-mentioned means may be applied as multilateral netting means for the head office, multilateral netting for temporary parent, and multilateral netting for parent. Note that a part of each means shown in FIG. 46 is omitted.
8-2. Functions of a system between a plurality of parties Each of the above-described generation means 1205, distribution means 1505, renewal means 2002, offsetting means 2001, payment preparation means 2003, discarding means 2004, etc. is one of the present invention. It is executed in the system according to the embodiment. Each of these means may be executed by an application trigger. Therefore, an application used by the administrator or a function related to the user application used by the user, and a display screen of the user application or the administrator application using the function will be described. This function is as disclosed in FIG.

8-2-1. Setup means 4100 (master registration)
The user application or the administrator application may have a function of recording and registering related parties in the system.

As described above, a related party may be a legal entity or a financial service company, in addition to a single legal entity, the corporate group itself, a parent company, a subsidiary, a grandchild company, a subsidiary company within an enterprise group, or an affiliated company. . Moreover, the original law, a branch, a base, etc. in one corporation may be sufficient, and the geographically different part in the same corporation, or an organizationally different part may be sufficient. Further, the party may be a netting center or a subnetting center.

The information for specifying these may be specified by a name, an address, a telephone number, etc., and an ID for uniquely specifying the ID may be given.

Netting center means the above-mentioned supervising company. Therefore, the user application or the administrator application may have information on financial institutions such as banks, investment companies, and post offices.

The base of the company may be a place where the system according to the embodiment of the present invention may be used. For example, a place where a corporation processes accounting, accounting, ordering, or the like.

Regarding a registered party, in the system according to an embodiment of the present invention, as a party in each of the above-described means such as the T data generation means 1205, the T data distribution means 1505, the renewal means 2002, etc. Used in example systems.

8-2-2. Formatting means 4101
The formatting means 4101 has a function of preparing information for displaying information at a location that accepts input from the input unit, based on information previously acquired via the input unit or information acquired from another information source.

The formatting means 4101 may display information from the stage where no input is made on the T data or application data input screen, or information based on the information after some preliminary information is input. It may be displayed. The latter preliminary information includes creditor, debtor, payment date, amount or currency.

The T data or application data related to the debt may be highly related to the content of the previous contract due to the renewal of the continuous contract or the previous contract. In such a case, the information entered in the previous contract may be reused. For example, if there is a rule for specifying the payment amount or setting the payment date, it may be displayed on the display screen as an initial value. Moreover, you may change the said information, when changing only in the debt.

The formatting means 4101 can be executed on the user application, but may be configured to be executed on the administrator application or the BC application and the result displayed on the user application.

8-2-3. T data list display means 4102
The T data list display unit 4102 has a function of displaying a T data list having a predetermined condition.
The information may be displayed based on application data in the administrator application, or may be displayed based on information acquired based on the block chain in the BC application.

The predetermined condition may be any condition as long as it is a condition related to an element of T data. For example, it may be a condition relating to a creditor, debtor, amount, payment date, currency, bilateral presence, multilateral netting group, or contract. Further, the predetermined condition may be a combination of these elements. Further, the target T data may be limited to those displaying debt. For example, when T data is distributed, T data generated after distribution is targeted, and the distributed T data may not be targeted. Further, when the T data is renewed, the T data created after the renewal is targeted, and the T data before the renewal may not be targeted. Further, the discard address that means that the T data is discarded may not be the target of the T data set in the recipient data. As a result, it is possible to search or display T data indicating a specific debt between the current parties.

In the above, whether or not T data is distributed may be determined by the administrator application by specifically tracing the block chain in the BC application, and referring to the table in FIG. Reference may be made to whether T data is distributed. Specifically, in the BC application, after searching for transactions in the blocks on the daisy chain and searching for the target T data, the T data is distributed and generated (ID of the T data or By confirming the presence or absence of new T data (generated by referring to a part of the T data), if there is new T data, the T data that is the source of distribution is searched or displayed. You can decide not to. In the case of the table of FIG. 16 as well, similarly, it is searched whether the ID of the target T data exists in the column of “original T data”, thereby distributing the target T data. Whether or not new T data has been generated is determined. If new T data has been generated, it is determined that the T data that has been distributed is not to be searched or displayed. Can do. The advantage of using the block chain (or the above-described data structure similar to the block chain) is high safety as described above, while the advantage of using the application data as shown in FIG. The information can be acquired by a simple method.

In the above description, the case of distribution has been described. Similarly, in the T data renewal, the administrator application may make a determination by searching the block chain (or the above-described data structure similar to the block chain). It may be determined by searching the table in the application data (for example, FIG. 22). Similarly, regarding the discarding of T data, the administrator application may make a determination by searching the block chain (or the above-described data structure similar to the block chain) or by searching the table in the application data. You may judge.

The displayed T data list may be composed of creditor, debtor, amount, payment date, currency, presence / absence of bilateral, multi-lateral netting group, or part or all of the contract. The T data list may be one T data.
When the information is recorded in the application data, a technique related to a known database may be used as a technique for recording or acquiring the information.

The T data list display unit 4102 may have a function of arranging information displayed on the display screen based on an instruction from the input unit of the user application. The T data list display unit 4102 may have a function of aligning items displayed on the display screen based on some index. As each item displayed on the display screen, for example, information such as a creditor, a debtor, an amount, a payment date, a currency, the presence / absence of bilateral or a group of multilateral netting may be mentioned. In addition, as an index for alignment, depending on each item, for example, in the case of creditors, debtors or currencies, the order of letters (in alphabetical order, alphabetical order, registration order) or frequently used You may have the function to align based on indices, such as order. Amounts or payment dates may be arranged in ascending or descending order.

8-3. User application screen example
8-3-1. Example of main screen Fig. 34 is an example of a display screen of a user application. Via the display screen, the acquisition means can acquire related information of the creditor 3401, the debtor 3402, the payment date 3403, the amount of debt 3404, the currency 3405, and the other 3406.

In the creditor 3401 and the debtor 3402, the parties can be input. These may be configured such that registered parties can be selected by a list button. Further, when selecting an unregistered party, the screen may be shifted to a screen for registering a party using a switch (not shown), and the setup means 4100 may be applied to register the party.

The currency 3406 displays a screen on which “yen” has already been entered. This is one example where the formatting means 4101 is applied to the main screen. That is, the formatting means 4101 may be set to display a specific input (for example, “circle” in this example) from the stage when the main screen is displayed.
The format means 4101 may display a specific currency, for example, “yen” or “dollar” with respect to the currency 3405 by receiving the input of the creditor 3401 or the debtor 3402.

In addition, “basic contract” is displayed as other 3406. This is also an example in which the basic format can be set to present such other items. The specific contents are displayed in 3409. As a result, other contents can be easily understood.

There is a bilateral netting setting 3407, and it is possible to specify a bilateral netting setting that offsets creditors and debtors. In this example, bilateral netting is not set. When the following multilateral netting is set, bilateral netting may be automatically given priority, or bilateral netting or multilateral netting will be given priority by another switch (not shown). A switch may be provided to define

For multi-lateral netting setting 3408, A, B, and C are displayed as groups, and currently set to group A. This is an example in which a plurality of multilateral nettings can be applied when a party belongs to a plurality of multilateral nettings. When the pointing device on the screen indicates a group of multi-lateral netting, a corporation, base, or financial institution belonging to the specific group is displayed, or a description of the specific group is displayed. You may make it do.

Trading contract list 3410 displays a list of related contracts. For example, when a creditor or a debtor is entered, either the creditor or the debtor may display a list of contracts with the creditor or creditor. In this way, it is possible to view related contract information simply by inputting a creditor or a debtor. Further, when the format unit 4101 receives information related to the corresponding contract in the transaction contract list 3410, the format unit 4101 inputs information such as the amount, currency, payment date, and the like, which are specific contents of the related contract. It may be displayed at a location. The display reduces the burden of information input for the user.

The user can select T data to be distributed based on the past T data list 3411. When distributing T data with the creditor as the creditor, the past T data list is displayed in the past T data list 3411. In this case, the T data list display unit 4102 may arrange and display part or all of the T data in the T data list 3411 from various viewpoints.

For example, the T data list display unit 4102 may preferentially display T data related to the underlying debtor who is likely to permit distribution. The T-data list display means 4102 is based on the number of T data permitted to be distributed in the past, the amount of T data permitted to be distributed, or the probability of allowing distribution, etc. May be displayed.

For example, it may be displayed in the order of the number of T data permitted to be distributed, the order of the amount related to the T data permitted to be distributed, the order of the probability of permitting distribution, or the mixture standard thereof. Good. This is because the T data that comes in the higher rank is highly likely to be distributed when displayed in alignment with these criteria. Further, these may be displayed preferentially, for example, displayed at the top, or a specific mark may be added. This is for the convenience of the user.

The user can select T data to be distributed from the displayed T data in the T data list 3411. The formatting means 4101 may display information such as creditor, debtor, amount, currency, payment date, etc. at each input location based on the selected T data. This display has an advantage that the user can reduce the burden of inputting information.

The user can select T data from the past T data list 3412 and designate renewal of the T data. In this case, the T data list display unit 4102 may arrange and display part or all of the T data in the T data list 3412 from various viewpoints.

For example, the T data list display unit 4102 may preferentially display T data that needs to be updated. The T data list display means 4102 may display the data based on criteria such as T data that is close to the payment date, or T data that is likely to be offset in the future with the same party.

The user can select T data to be updated from the displayed T data in the T data list 3412. The formatting means 4101 may display information such as creditor, debtor, amount, currency, payment date, etc. at each input location based on the selected T data. This display has the advantage that the user can reduce the burden of inputting information.

The T data generation 3413 is a button for generating T data.

In the above description, the description is based on the display screen of FIG. 34. However, the input information is transmitted to the user application, the BC application, or the administrator application, and T data is generated in the BC application based on the information. Or application data is generated in the administrator application. In this process, the input information may be recorded in a user application, BC application, administrator application table, or the like. When recorded in a table in the user application, there is an advantage that the information can be reused when the information is needed again.

In the above, the input screen dedicated to the system according to an embodiment of the present invention has been described, but this system is based on information input in another system such as an accounting system, a sales management system, or an order management system, You may comprise so that the information of the system concerning one Example of this invention may be input.

For example, information such as a business partner, order number or invoice number entered in the accounting system, amount (may include interest rate between parties), currency, contract occurrence date, payment date, etc. You may input and use for the system which concerns on an example. In the accounting system, there are, for example, accounts payable payment processing, bill receivable processing, and sorting information input. A sales management system purchasing management system, sales management system, transaction contract management system, order management system, order information system, bill receivable information system, sorting information input system, and the like may be used. Information obtained by these systems may be acquired by using acquisition means such as the generation acquisition means 1202 and the distribution acquisition means 1504 of the system according to an embodiment of the present invention. When linking with these other systems, there is an advantage that the system according to the embodiment of the present invention can be used by utilizing the information of the existing system. In other words, by newly generating T data of the system according to the embodiment of the present invention based on the input information of the existing debt, the advantage of the system according to the embodiment of the present invention can be enjoyed. Also, there is an advantage that the user can select the system to be used according to the circumstances of the project. For example, if the trading partner is a partner who is registered as a party in the system according to one embodiment of the present invention or a partner who has already introduced the system according to one embodiment of the present invention, one embodiment of the present invention. It is possible to select to use the system according to the above, and to use another system if it is not a layer.

For example, FIG. 51 is an example of cooperation with other systems. While showing an example of the structure of T data, the cooperation with the system in which the information regarding the existing accounting is recorded is shown. Here, 5101 to 5104 indicate generated T data in order. A to D indicate the parties concerned.
First, by transactions between the parties A and B, information on A's asset increase / accounts payable increase and B's receivable increase / inventory decrease is recorded in another system. Around this time, T data 5101 is generated.
Next, assume that parties B and C have made a transaction. Then, in the other system, B's asset increase / accounts payable increase is recorded, and C's receivable increase / inventory decrease is recorded. Then, when T data 5101 is distributed and T data 5102 is generated in the system according to the embodiment of the present invention, correspondingly (before and after), in other systems, first, B in A Accounts payable decrease / C monetary debt increase, B C payable decrease / A receivable decrease, B A monetary receivable increase / B receivable decrease in C are processed. In particular, as shown by 5105, after T data 5102 is generated, the above-mentioned A-B decrease in accounts payable to B / C-increase in monetary debt, A-B decrease in accounts payable in B / A- accounts receivable decrease, As shown by the three arrows, the information related to the increase in monetary claims to B and the decrease in accounts receivable to B is notified from the system according to one embodiment of the present invention to the other system, and the other system You may comprise so that a process may be performed. The legal configuration here is that recipient B exempts sender A's debt, recipient B becomes sender B, and A assumes B's debt to the next recipient C.
Next, it is assumed that the parties C and D have made a transaction. Then, similarly, the increase in assets of C / increase in accounts payable and the increase in accounts receivable in D / decrease in inventory are recorded in other systems. In the system according to an embodiment of the present invention, when T data 5103 is generated by distributing T data 5102, correspondingly (before and after), a decrease in monetary debt to C in A / money to D The increase in debt, the decrease in accounts payable to D at C, the decrease in monetary claims to A, and the increase in monetary claims to A in A / decrease in accounts receivable to C are processed. In particular, as indicated by 5106, after the T data 5103 is generated, the decrease in monetary debt to C / increase in monetary debt to A in the above, decrease in monetary debt to D, decrease in accounts payable to D in C / decrease in monetary claims to D, As indicated by the three arrows, the information related to the increase in monetary claims to A / decrease in accounts receivable to C is notified from the system according to an embodiment of the present invention to the other system. You may comprise so that the said process may be performed. The legal structure here is that recipient C exempts sender B's debt, recipient C becomes sender C, and A assumes C's debt to the next recipient D. .

8-3-2. T data search display screen FIG. 35 is an example of a T data search display screen.
The T data search / display screen has a function of displaying information related to T data to be distributed when T data is distributed instead of the past T data list 3411. In addition, the T data search display screen has a function of displaying information related to T data to be updated when T data is updated instead of the past T data list 3412.

The T data search display screen has a place where a search condition 3501 is set and a display 3502 place. In the search condition 3501, a search can be performed based on search items such as a creditor, a debtor, a currency, an amount, a payment date, or a netting condition. Further, for example, the amount can be searched with an upper limit or / and a lower limit, or can be searched with a specific amount. Further, the payment date can be set by a period, or can be searched by a specific payment date. Netting can also be specified as bilateral or in a group of multilateral nettings.

T data list display means 4102 is applied to the information and displayed on the display 3502. A display 3502 displays data related to T data such as a creditor, a debtor, a currency, an amount, a payment date, or netting. Further, when one piece of T data in the list is indicated by the pointing device, the content of the contract related to the T data may be displayed.

8-3-3. Cancellation screen FIG. 36 is an example of the cancellation screen. The offset screen has a function of displaying information related to T data to be offset. Information may be transmitted to the canceling unit 2001 via the canceling screen. Further, the offset display means may transmit to the payment preparation means 2003 the amount after offset and information relating to the debt of the amount, for example, creditor, debtor, payment date, currency, and the like.

Since the target of offsetting is a total of two users, that is, the user and other parties, the other party 3601 identifies other parties other than the user.

The T data list 3602 is a list of T data in which the user is a creditor and the other party is a debtor, or the T data of the T data of the user is a debtor and the other party is a creditor. The list is based on the condition that the user is a creditor and the other party is a debtor, or the user is a debtor and the other party is a creditor. Is displayed.

Further, the T data list creation means may create the T data list under the condition that it is lower than a certain amount. T-data lower than a certain amount is a small amount of debt, so there is a large amount and the party does not pay much attention. Because.

The T data list 3602 may be arranged by the T data list display unit 4102 from various viewpoints. For example, when the payment dates are arranged in the order of close payment dates, there is convenience in processing by giving priority to the latest T data in terms of time. Further, when the moneys are arranged in the order of small amounts, there is a convenience that can be uniformly offset as described above.

The user can determine whether or not the T data in the T data list 3602 is to be offset. In the T data list 3602, T data to be offset is specified by some means. For example, the T data to be offset is specified by a method such that a check is set for T data that is to be offset, or T data that is not to be offset is excluded from the list. Also good.

The post-processing amount 3603 displays the amount when the offset is executed. The amount may be displayed as an amount including positive and negative. In the case of positive, it is necessary to pay as a debtor, and in the case of negative, the amount can be acquired as a creditor. Moreover, the information regarding T data used as the basis may be displayed.

With respect to the correspondence list 3604, a display that can specify the next step may be displayed. Responses include banking, renewal and supervision. These are processing at a financial institution such as a bank, renewal processing of T data, and payment processing at a supervising company. Each amount can be adjusted and a correspondence to each amount can be set so that the total amount becomes a post-processing amount 3603. If the total amount of each amount is not the post-processing amount 3603, a message to that effect may be displayed. The payment preparation means 2003 may be applied to each amount entered on the screen and its correspondence.

When the cancellation execution 3605 is pushed down, the offsetting unit 2001 is applied and offset.

In the case of netting, there is a case where netting is performed at a predetermined time (for example, at 0:00 on the first day of every month, every midnight on Monday, every three months, etc.). In this case, a screen as shown in FIG. 36 is used. The target T data may be searched, or the target T data may be searched without using the screen as shown in FIG.

36, the input information is transmitted to the user application, the BC application, or the administrator application as in the main screen of FIG. 34, and T data is stored in the BC application based on the information. Generated or application data is generated in the administrator application. In this process, the input information may be recorded in a user application, BC application, administrator application table, or the like. When recorded in a table in the user application, there is an advantage that the information can be reused when the information is needed again.

8-3-4. Multi-Lateral Netting Screen FIG. 37 is similar to FIG. 36, but is an example of a multi-lateral netting screen.
A place different from FIG. 36 is a netting group 3701. Here, the netting group can be specified. Also, the execution of multilateral netting 3705 is different. In addition, the specification 3702 of the T data list to be netted, the post-processing amount 3703, and the correspondence list 3704 are the same as the offset screen. In addition, the input information is stored in the same manner as the screen of FIG. 36 or FIG.

In the case of netting, there are cases where netting is performed at a predetermined time (for example, at 0:00 on the first day of every month, every midnight on Monday, every three months, etc.). In this case, a screen as shown in FIG. 37 is used. Thus, the target T data may be searched, or the target T data may be searched without using the screen as shown in FIG.

8-4. T data monitoring notification
8-4-1. Monitoring notification means 4103
The monitoring notification unit 4103 has a function of monitoring a payment date related to T data and notifying related parties regarding T data satisfying a predetermined requirement. The monitoring notification unit 4103 may periodically monitor the payment date of the T data in the block chain as the payment date related to the T data, or may periodically check the payment date of the T data stored in the application data. You may monitor. Instead of or in addition to the regular monitoring, monitoring may be performed when requested by the user application.

The monitoring notification unit 4103 may use a predetermined condition regarding each item of T data as T data satisfying a predetermined requirement. Examples of each item of T data include information such as creditor, debtor, amount, payment date, currency, presence / absence of bilateral or multilateral netting group. In addition, the conditions for these items are T data that is 3 days before the date of judgment, T data that is 1 week ago, or 2 weeks before that the amount exceeds 1 million yen, etc. There may be conditions for each item. Such a condition may be set by the user in advance. That is, the condition may be registered in the administrator application via the user application.

The monitoring notification unit 4103 may notify various persons related to the T data as related parties. Such a person may be registered in advance in the administrator application. Examples of parties include parties such as debtors, debtor parent companies, debtor group companies, debtor financial institutions. Moreover, the person who cannot use the system which concerns on one Example of this invention as a party may be used.

Moreover, when performing these notifications, it may be configured to set whether or not the consent of the parties concerned is necessary. For example, it may be configured such that the consent of the debtor's parent company or group company is required for notification to the debtor's financial institution.

8-4-2. Example 1 of monitoring notification flowchart
An example of a monitoring notification flowchart will be described with reference to FIG.
In ST3801, the user application desired to be monitored, the monitoring time, and the monitoring target are registered in advance in the application data of the administrator application. Examples of the monitoring time include 0:00 every day, 0:00 every Monday, and 0:00 on the first day of every month. A plurality of monitoring periods may be defined. The monitoring target defines requirements to be monitored that can be handled by the monitoring notification unit 4103. These may be recorded as application data in a table as shown in FIG. In addition to the above, as a basic format, a system that reports the monitoring result to all user applications at a certain time may be used.

In ST3802, the monitoring notification unit 4103 searches for a monitoring target when the monitoring time comes. As the monitoring target, information related to T data recorded in the application data may be searched, or the T data itself may be searched.

In ST3803, the monitoring notification unit 4103 notifies the retrieved monitoring target to the user application that desires monitoring.

In ST3804, the user application displays the searched monitoring target via the display screen.

8-4-3. Example 2 of monitoring notification flowchart
The user application may store the conditions related to the monitoring target and notify the administrator application. In this case, when the user application comes to the monitoring time, the monitoring target is transmitted to the administrator application, and the administrator application searches for the monitoring target in a manner corresponding to this. If the monitoring target is T data, the BC application may search for the monitoring target. FIG. 40 is an example in which the user application notifies the administrator application at the monitoring time.

In ST4001, a monitoring time and a monitoring target are registered in the user application.

In ST4002, the monitoring notification means 4103 of the user application determines whether it is the monitoring time.

In ST4003, if the requirement of the monitoring time is satisfied, the monitoring notification means 4103 of the user application notifies the administrator application of the monitoring target corresponding to the monitoring time.

In ST4004, the administrator application retrieves the monitoring target from the application data, and transmits it to user application monitoring notification means 4103.

In ST4005, the monitoring notification means 4103 of the user application displays the monitoring target acquired from the monitoring application via the display screen.

8-5. Decrease in the number of T data 8-5-1. The number of T-data that indicates a decrease in existing debt at a particular time may decrease. For example, this is the case when the offsetting unit 2001, the renewal unit 2002, the payment preparation unit 2003, or the discarding unit 2004 is applied to T data.
In addition, the total number of data related to the debt amount of the T data indicating the existing debt may decrease. For example, this is the case when the offsetting unit 2001, the discarding unit 2004, etc. are applied to the T data.

Such a decrease in the number of T data or the total number of data related to the debt amount of T data (the number related to T data) may decrease sharply at a specific time. For example, when the debt transaction handled by the system according to the embodiment of the present invention is closed at the end of the month as a practice, the number related to the T data indicating the existing debt greatly decreases at the end of the month. In addition, for example, when a debt transaction handled by a system according to an embodiment of the present invention is closed in the quarter as a practice, the number related to T data indicating an existing debt can be greatly reduced every quarter. . As an example, FIG. 47 is given.

FIG. 47 shows an image of a graph drawn on the assumption that the movement of the total debt balance is substantially equal to the movement of the number of debt certificates, and that the value increases and decreases at a certain time. It shows the situation where the total balance of debt increases as a result of generation, rapidly increases and decreases rapidly at a certain time. For example, the generation and destruction of T data in multilateral netting are exaggerated in an easy-to-understand manner. That is, in multilateral netting, a large number of T data is generated and discarded in the process. For example, T data is generated by the generating means between the headquarters, the temporary parent, and the parent, and thereafter, the renewal means or the offsetting means is updated or offset. FIG. 47 shows a state where a large number of T data is first generated and then a large number of T data is discarded as an image. In the case of business debt transactions where customs are due at the end of the month, if a large number of debts are offset or renewed at the end of the month, the T data will not increase dramatically as shown in Fig. 47. It is possible that T data will decrease at the coming time.

8-5-2. Decreasing the number of T data in multilateral netting In multilateral netting, the transition of the number of T data has the following characteristics. Here, in multi-lateral netting composed of M parties, it is assumed that there are N pieces of T data indicating contracts and obligations between the parties. Here, it is assumed that the number of T data required only for discarding T data, that is, the number of T data generated by the discarding unit 2004 is not considered.

First, in the case of multi-lateral netting (7-1) where a controlling company exists.
In this case, it is assumed that the controlling company is not a party of multilateral netting (if the controlling company is a party of multilateral netting, this is a parent case described later). For each of the N original T data, N new T data are generated by quoting the T data, and a new N data between the party and the controlling company for the original T data. T data is generated. Furthermore, if there are multiple debts between each party and the controlling company, renew if necessary. For example, when there are a plurality of debts between the managing company and all of the M parties and they are renewed, newly renewed M pieces of data are required. Therefore, the number of new T data generated is 2N + M. In this case, since the first N pieces of T data and 2N pieces of T data generated in the middle are not necessary, 3N pieces of T data are discarded. On the other hand, if the debt between the headquarters and all M parties is all one, no renewal is necessary. Therefore, in this process, 2N new T data are generated. Further, since there is no T data discarded by the last renewal, 3N-M pieces are discarded.
As a result of the above examination, 3N-M to 3N pieces of data are discarded in the multilateral netting where the controlling company exists. In addition, 2N to 2N + M pieces of T data are newly generated.

Next, in the case of multilateral netting (7-2) where a temporary parent exists.
In this case, the generation and discarding of T data with the temporary parent is the same as the above calculation. From this point, the process of removing the temporary parent is performed. In this case, the T data is generated and discarded based on, for example, the process of FIG. 29 based on the size relationship of the debt amount of the T data between each party and the temporary parent. . Therefore, when the minimum generation number and minimum discard number of T data are calculated, in the case of multilateral netting (7-2) in which a temporary parent exists, at least 3N-M data is discarded and at least 2N T data is stored. Newly generated.

Finally, in the case of multilateral netting (7-3) where a parent exists.
Let N ′ be the number of T data indicating the debt in a contract that does not make the party to be the controlling company a party to the contract. Then, N 'is regarded as the above-mentioned N, and 2N' T data are generated first, and renewed according to whether the number of debts between the parties is singular or plural as in the above. Therefore, the maximum number of M-1 updates is made. Therefore, 2N ′ to 2N ′ + M−1 pieces of T data are generated. Further, considering the number of T data to be discarded in the same manner as described above, 3N′-M to 3N ′ T data are discarded.

Needless to say, the examples described in the embodiments of the present specification can be applied to various examples.
Further, the processes and procedures described in this specification can be realized not only by those explicitly described in the embodiment but also by software, hardware, or a combination thereof. Further, the processes and procedures described in this specification can be implemented as a computer program and executed by various computers.

1 System 11 Bus 12 Calculation Unit 13 Storage Unit 14 Input Unit 15 Display Unit 16 Communication IF
DESCRIPTION OF SYMBOLS 10 Information processing apparatus 20 Network 30 Information processing apparatus 31 Bus 32 Operation part 33 Storage part 34 Input part 35 Display part 36 Communication IF
40 Blockchain system 41A to 43A Block heading 41B to 43B Block body 41B1 to 41BN Transaction 501 Within transaction 502 Outside transaction 503 Transaction ID
504 Time stamp 505 Sender name (ID)
506 Recipient name (ID)
507 Amount 508 Currency type 509 Due date (Payment date, scheduled settlement date, etc.)
510 Settlement Method 511 Special Note 512 Original Transaction ID
513 Transaction ID History 514 Original Obligor 515 Currency Type 516 Settlement Method 902 T Data Constructing Unit 903 Block Generation Unit 904 Block Determination Unit 1202 Generation Acquisition Unit 1203 Generation Communication Unit 1204 Generation Recording Unit 1205 Generation Unit 1501 Distribution Obligor Confirmation Unit 1502 Distribution application data creation means 1503 Distribution generation means 1504 Distribution acquisition means 1505 Distribution means 1506 Distribution communication means 1600 New T data 1601 Original T data 1602 Exemption debtor 1603 Original debtor 1604 Related contract 1605 End of debt 2001 Offset means 2002 Renewal means 2003 Payment preparation means 2004 Discard means 2005 Communication means 4100 Setup means 4101 Format means 4102 T data list display means 4103 Monitoring notification means 41 4 communication means

Claims (15)

In transaction system using blockchain,
Means for retrieving first transaction data relating to the first debt;
Means for displaying information relating to the retrieved transaction data;
Selecting means for selecting whether to use the displayed information;
When the displayed information is selected,
Second debt amount data indicating an amount related to a second debt owed by a creditor of the first debt;
Creditor data indicating creditors of the second debt;
Data specifying the first transaction data or data specifying a part of the first transaction data;
Means for generating second transaction data relating to the second debt having:
Means for setting the obligor data relating to the first transaction as application obligor data relating to the second transaction data in application data outside the block chain;
A transaction system comprising: The transaction system according to claim 1, wherein the second transaction data indicates a debt that the debtor of the first debt has to the creditor of the second debt. The transaction system further includes a determination unit that determines whether to inquire whether or not distribution is possible to the user application of the obligor.
The generating means for generating the first transaction data can be distributed when it is confirmed in advance that distribution is possible when it is determined not to make the inquiry, or when it is determined that the inquiry is made. The transaction system according to claim 1, wherein the second transaction data is generated when an answer is received. The transaction system according to any one of claims 1 to 3, wherein the transaction system includes an information processing apparatus. The transaction system according to any one of claims 1 to 4, wherein the transaction system includes a storage device. Computer
In transaction system using blockchain,
Retrieving the first transaction data for the first debt;
Displaying information relating to the retrieved transaction data;
Obtaining selected information on whether to use the displayed information;
When the displayed information is selected,
Second debt amount data indicating an amount related to a second debt owed by a creditor of the first debt;
Creditor data indicating creditors of the second debt;
Data specifying the first transaction data or data specifying a part of the first transaction data;
Generating second transaction data relating to the second debt having:
Setting the obligor data relating to the first transaction as the obligor data relating to the second transaction data in application data outside the block chain; and
A transaction method characterized by comprising: The transaction method according to claim 6, wherein the second transaction data indicates a debt that the debtor of the first debt has to the creditor of the second debt. Further, the step of determining whether or not to inquire whether or not the original debtor's user application can be distributed;
The generating means for generating the first transaction data can be distributed when it is confirmed in advance that distribution is possible when it is determined not to make the inquiry, or when it is determined that the inquiry is made. If the answer is obtained, the step of generating the second transaction data;
The transaction method according to claim 6, further comprising: The transaction method according to claim 6, wherein the computer includes an information processing apparatus. The transaction method according to claim 6, wherein the computer includes a storage device. Computer
In transaction system using blockchain,
Means for retrieving first transaction data relating to the first debt;
Means for displaying information relating to the retrieved transaction data;
Means for obtaining information selected whether to use the displayed information;
When the displayed information is selected,
Second debt amount data indicating an amount related to a second debt owed by a creditor of the first debt;
Creditor data indicating creditors of the second debt;
Data specifying the first transaction data or data specifying a part of the first transaction data;
Means for generating second transaction data relating to the second debt comprising:
Means for setting the obligor data relating to the first transaction as application data outside the blockchain as the obligor data relating to the second transaction data;
A transaction program characterized by being operated as 12. The transaction program according to claim 11, wherein the second transaction data indicates a debt that the debtor of the first debt has to the creditor of the second debt. Further, means for determining whether or not to inquire whether or not the original debtor's user application can be distributed;
The generating means for generating the first transaction data can be distributed when it is confirmed in advance that distribution is possible when it is determined not to make the inquiry, or when it is determined that the inquiry is made. Means for generating the second transaction data when the answer is obtained,
The transaction program according to claim 11, comprising: The transaction program according to claim 11, wherein the computer includes an information processing apparatus. 15. The transaction program according to claim 11, wherein the computer has a storage device.

Images