Information processing method, information processing device, and information processing program

Abstract

The information processing apparatus of the present invention includes a processor that performs the following processing: determining the timing for adding a transaction to the blockchain based on historical records of transaction fees related to transactions for writing evidence to the blockchain and historical records of transactions for writing evidence to the blockchain.

Description

Technical Field

[0001] The disclosed technology relates to an information processing method, an information processing device, and an information processing program. Background Technology

[0002] Japanese Patent Application Publication No. 2021-136031 describes a method in which a historical record benchmark is determined based on the actual transaction fee of existing block transaction requests within the blockchain. If the actual transaction fee of a transaction request is above the historical record benchmark, the result is determined to meet the transaction execution conditions. If the actual transaction fee of a transaction request is below the historical record benchmark, the time order in which the transaction requests meet the transaction execution conditions is determined based on the processing capacity of the initiating node.

[0003] Japanese Patent Application Publication No. 2022-25720 discloses a credit granting device and system capable of calculating the processing fees required for information processing of digital currencies in a blockchain network. Specifically, it describes a method in which the processing fees are calculated according to fee request rules, and transaction history records corresponding to specific information addresses of digital currency users are collected from the blockchain network and used as transaction information.

[0004] Japanese Patent Publication No. 2022-542168 describes an asset trading system that ensures transparency of purchase history to prevent forgery / alteration when conducting online transactions of high-priced assets. Specifically, it describes a method in which the sale conditions, such as the quantity and amount of tokens for sale requested by the seller, are matched with the purchase conditions, such as the quantity and amount of tokens for purchase requested by the buyer. When the seller's and buyer's conditions match, a transaction is conducted for the corresponding tokens for the subdivided ownership. Upon completion of each transaction, the transaction details are appended to or reflected in the ledger of the corresponding asset registered in the transaction history information database.

[0005] Japanese Patent Application Publication No. 2021-33360 describes a method in which blockchain data including multiple transaction history records of virtual currencies is obtained, chart data showing the price changes of virtual currencies in a time series is obtained, and a portion of the multiple transaction history records contained in the blockchain data and the chart data showing the price changes of virtual currencies within a specified period are displayed on a screen.

[0006] Japanese Patent Application Publication No. 2021-18514 discloses a technology for proving that data collected by enterprises, etc., has not been tampered with. In particular, it describes a method of sending a transaction to the blockchain, calculating a referral fee for instantly confirming the writing of the transaction to the blockchain, and calculating the cost based on the referral fee and the number of transactions. Summary of the Invention

[0007] -The technical problem that the invention aims to solve-

[0008] Here, the utilization cost (Gas fee) of a public blockchain becomes a dynamically determined mechanism based on the congestion situation at the time of transaction confirmation or the price of the public blockchain's token itself, and its fluctuations are also significant. Therefore, when enterprises utilize public blockchains, there is a challenge in estimating the overall system operating costs over a period of time.

[0009] Depending on the type of blockchain, one approach is to specify the gas fee at the time of a transaction and wait until it is confirmed, thus stabilizing transaction fees. However, this approach makes it impossible to determine when a transaction will be confirmed, and if no writes to the blockchain occur for an extended period, it can lead to reduced reliability issues related to transaction execution.

[0010] In one aspect, the objective is to provide an information processing method, information processing apparatus, and information processing program that can determine the timing of transaction execution by taking into account transaction fees related to the transaction and reliability related to the execution of the transaction.

[0011] -Means used to solve technical problems-

[0012] The first aspect of the present invention is an information processing method, wherein,

[0013] The timing of adding a transaction to the blockchain is determined based on the historical records of transaction fees associated with transactions used to write evidence to the blockchain and the historical records of transactions written to the blockchain.

[0014] The second aspect of the present invention is an information processing device, which includes a processor, the processor performing the following processing:

[0015] The timing of adding a transaction to the blockchain is determined based on the historical records of transaction fees associated with transactions used to write evidence to the blockchain and the historical records of transactions written to the blockchain.

[0016] The third aspect of the present invention is an information processing program that causes a computer to perform the following processing: determining the timing of adding a transaction to the blockchain based on the historical records of transaction fees related to transactions for writing evidence to the blockchain and the historical records of transactions for writing evidence to the blockchain.

[0017] -Invention Effects-

[0018] In one aspect, the timing of transaction execution can be determined by considering transaction fees associated with the transaction and the reliability associated with the execution of the transaction. Attached Figure Description

[0019] Figure 1 This is an explanatory diagram showing an example of the structure of an information processing system.

[0020] Figure 2 This is a schematic block diagram of an example of a computer that functions as a server and user terminal in this embodiment.

[0021] Figure 3 This is a block diagram illustrating the structure of the server in this embodiment.

[0022] Figure 4 This is a flowchart illustrating the execution timing determination processing routine in the server of this embodiment.

[0023] Figure 5 This is a flowchart illustrating the transaction execution process in the server according to this embodiment. Detailed Implementation

[0024] Hereinafter, an example of an embodiment of the present invention will be described with reference to the accompanying drawings. Furthermore, in each drawing, the same or equivalent components and parts are labeled with the same reference numerals. Also, the dimensions in the drawings may be exaggerated for ease of explanation and may differ from the actual dimensions.

[0025] In the following embodiments, "A and / or B" has the same meaning as "at least one of A and B". That is, "A and / or B" can mean only A, only B, or a combination of A and B. Furthermore, in this specification, when three or more cases are connected by "and / or", the same consideration as "A and / or B" can be applied.

[0026] <System Architecture>

[0027] Figure 1 This is an explanatory diagram showing an example of the structure of information processing system 2. In this embodiment, information processing system 2 that performs transactions for writing and storing evidence will be described. Information processing system 2 includes server 10 and user terminal 20. Server 10 and user terminal 20 are connected via network N. Server 10 is an example of an information processing device.

[0028] Server 10 is, for example, a server computer capable of performing various information processing and information sending and receiving. However, the device equivalent to server 10 is not limited to a server computer; it can be, for example, a personal computer. In this embodiment, server 10 functions as an information processing device that determines the execution timing of a transaction to be written into the storage record and executes the transaction according to the determined execution timing.

[0029] User terminal 20 is a general-purpose computer such as a personal computer. In this embodiment, user terminal 20 functions as a device for requesting server 10 to write evidence to the blockchain.

[0030] Furthermore, in this embodiment, the server 10 determines the timing of transaction execution or executes the transaction, but the local user terminal 20 can also determine the timing of transaction execution or execute the transaction. That is, the distinction between the two is convenient, and a series of processes can be performed by a single computer.

[0031] <Structure of the server involved in this embodiment>

[0032] Figure 2 This is a block diagram illustrating the hardware structure of the server 10 in this embodiment.

[0033] like Figure 2 As shown, server 10 includes a CPU (Central Processing Unit) 11, ROM (Read Only Memory) 12, RAM (Random Access Memory) 13, storage device 14, input unit 15, display unit 16, and communication interface (I / F) 17. All components are interconnected via bus 19.

[0034] CPU 11 is the central processing unit, executing various programs or controlling various parts. Specifically, CPU 11 reads programs from ROM 12 or storage device 14 and executes the programs using RAM 13 as its working area. CPU 11 performs control and various arithmetic operations on the aforementioned structures according to the programs stored in ROM 12 or storage device 14. In this embodiment, ROM 12 or storage device 14 stores an information processing program for determining the timing of transaction execution or executing a transaction. The information processing program can be a single program or a group of programs or modules.

[0035] ROM12 stores various programs and data. RAM13 serves as a temporary storage area for programs or data. Storage device 14 is composed of HDD (Hard Disk Drive) or SSD (Solid State Drive) and stores various programs and data, including the operating system.

[0036] The input unit 15 includes a mouse and other pointing devices and a keyboard for various input operations.

[0037] The display unit 16 is, for example, a liquid crystal display (LCD) that displays various information. The display unit 16 may also function as an input unit 15 using a touch panel.

[0038] Communication interface 17 is an interface for communicating with other devices, such as using standards such as Ethernet (registered trademark), FDDI, and Wi-Fi (registered trademark).

[0039] Next, the functional structure of server 10 will be explained. Figure 3 This is a block diagram illustrating an example of the functional structure of server 10.

[0040] In terms of function, such as Figure 3 As shown, the server 10 is configured to include a first model generation unit 110, a second model generation unit 112, an execution timing determination unit 114, and a transaction execution unit 116.

[0041] The first model generation unit 110 creates a first stochastic process model for predicting transaction fees based on historical records of transaction fees associated with transactions used to write evidence to the blockchain 50.

[0042] Specifically, the historical transaction fees are retrieved from a transaction fee history database 40, which stores historical transaction fees related to past transactions, and then grouped (f1, t) based on past transaction fee quotes f and time t. p，1 (f2,t) p，2 ), ... (f n , t p，n Regression was performed to create a first stochastic process model.

[0043] Here, the transaction fee history stored in the transaction fee history database 40 includes, for example, charts of publicly available transaction fee quotes or records of transaction fees paid for past record-keeping.

[0044] Furthermore, blockchain 50 is constructed from a blockchain network comprising multiple computer terminals, and is formed by linking blocks 51 containing evidence in a time sequence. Whenever evidence is written, server 10 prevents tampering with the evidence by writing it into block 51 on blockchain 50.

[0045] The second model generation unit 112 creates a second stochastic process model for predicting the timing of the evidence storage write request in the user terminal 20 based on the historical records of evidence storage write requests generated in the user terminal 20 to the blockchain 50.

[0046] Specifically, the second model generation unit 112 retrieves the historical records of past evidence storage write requests from the write occurrence history database 42, which stores historical records of past evidence storage write requests generated in the user terminal 20 to the blockchain 50. The second model generation unit 112 can determine the time t when the evidence storage write request was made in the past.r，1 , t r，2 , ..., t r，n Assuming that the exponential distribution and other distributions are related to the time of occurrence, a second stochastic process model is created.

[0047] The historical records of the evidence writing requests that were generated are stored in the write occurrence history database 42, for example, the historical records of the times when evidence writing requests were generated in the user terminal 20 in the past.

[0048] The timing determination unit 114 determines the timing for adding a transaction to the blockchain 50 based on the first stochastic process model and the second stochastic process model.

[0049] Specifically, the execution timing determination unit 114 determines the execution timing of the additional transaction in a manner that optimizes the objective function. The objective function is represented by: the timing of the evidence write predicted by the second stochastic process model; and the transaction fee for the execution timing of the additional transaction corresponding to the timing of the evidence write, predicted by the first stochastic process model.

[0050] More specifically, the objective function is represented by the following: the expected value of the transaction fee at the time of execution of the append transaction; the standard deviation (variance) of the transaction fee at the time of execution of the append transaction; and the waiting time from the time of the write of the certificate of deposit to the time of execution of the append transaction.

[0051] In the optimization calculation of this objective function, it is defined as a multi-objective optimization problem that optimizes three aspects: (i) the standard deviation (variance) of the total transaction fees, (ii) the expected value of the total transaction fees, and (iii) the waiting time from the occurrence of the notarization write to the actual issuance transaction. At this point, there is usually no solution that simultaneously optimizes all objective functions, but a Pareto optimal curve can be obtained. At the actual execution of the execution plan, a point is selected based on the predetermined weighted sums on the curves.

[0052] (i) The standard deviation (variance) of the total transaction fees is in a trade-off with (iii) the standby time. When the write frequency is low (once a month), the standard deviation (variance) of transaction fees is smaller, but the standby time is longer. If the write frequency is high, the standard deviation (variance) is larger, and the standby time is shorter.

[0053] (ii) Regarding the expected value of the total transaction fees, if a large amount is specified as the transaction fee, it will be written immediately, but in this case, the waiting time is shorter and the standard deviation (variance) is smaller. Conversely, if a small amount is specified as the transaction fee, the waiting time is longer and the standard deviation (variance) is larger.

[0054] As an example of (iii) standby time, if transactions occur 3 times within 1 second (short time) (high frequency), the write is expected to continue for a period of time. On the other hand, if it occurs once every hour (long time) (low frequency), the standby time is expected to be longer.

[0055] For example, the objective function can be expressed as follows.

[0056]

[0057] Among them, F t Let t be the transaction fee predicted at time t based on the first stochastic process model. i Let it be the first i The moment when the transaction is executed to write to the blockchain. (τ) j Let s be the time when user terminal 20 makes its j-th write request to the blockchain, as predicted by the first stochastic process model. i Let C1, C2, and C3 be the earliest transaction number when the i-th write to the blockchain is performed in the execution set. Furthermore, C1, C2, and C3 are weighting constants used when selecting a solution from the Pareto solutions. For example, let C1 > C2 > C3.

[0058] The decision variable obtained through optimization of this objective function is the time t, which represents the timing of the actual write transaction to the blockchain. i Let k represent the number of transactions that ultimately write to the blockchain.

[0059] By optimizing this objective function, the moment t, representing the execution timing of the transaction that actually writes to the blockchain, is determined. i Let k represent the number of transactions that ultimately write to the blockchain. Then, time t is determined by ensuring that the expected value of the transaction fee at the time of appending the transaction is small, the variance of the transaction fee at the time of appending the transaction is small, and the waiting time from the time of the notarization write to the time of appending the transaction is short. i And variable k.

[0060] In the optimization of the objective function, for example, for each value of k (k=1, 2, 3, ...), the time t representing the actual timing of the transaction to be written to the blockchain is calculated. i The optimal value of the objective function is determined by minimizing the value of k. The determined value of k and the time t at that value of k are then compared. i The variables are determined as the objective function for optimization.

[0061] Furthermore, in modeling, optimal control theory methods can be used instead of objective function optimization methods. And in objective function optimization, it can be solved as an optimization problem with equivalent decision variables, or heuristics such as Monte Carlo methods can be used. Moreover, the weight constants C1, C2, and C3 can be fixed values, manually adjusted each time, or dynamically changed through an algorithm. Furthermore, the first and second stochastic process models can be parametric models defined by operations on the decision variables, or they can be implemented through regression based on nonparametric models such as regression trees.

[0062] The transaction execution unit 116 executes the transaction to be added to the blockchain 50 according to the execution timing determined by the execution timing determination unit 114.

[0063] <Structure of the user terminal involved in this embodiment>

[0064] The above Figure 2 This is a block diagram illustrating the hardware structure of the user terminal 20 in this embodiment.

[0065] As mentioned above Figure 2 As shown, the user terminal 20, like the server 10, has a CPU 11, ROM 12, RAM 13, storage device 14, input unit 15, display unit 16, and communication interface (I / F) 17. All these components are interconnected via a bus 19.

[0066] The ROM 12 or storage device 14 stores a program for requesting the server 10 to write the certificate. This program can be a single program or a group of programs or modules.

[0067] Input section 15 accepts evidence to be written to blockchain 50. For example, it accepts evidence related to medical data or inventory data.

[0068] If the certificate to be written to blockchain 50 is accepted, CPU11 requests the certificate to be written to server 10.

[0069] <The function of server 10 in this embodiment>

[0070] Next, the function of the server 10 involved in this embodiment will be explained.

[0071] First, the CPU 11 reads the information processing program from the ROM 12 or storage device 14, expands it in the RAM 13, and executes it. Figure 4 The execution timing determination process is shown. In the case of multiple user terminals 20, the execution timing determination process is performed for each user terminal 20.

[0072] First, in step S100, CPU11, as the first model generation unit 110, retrieves the transaction fee history records from the transaction fee history database 40.

[0073] In step S102, CPU11, as the first model generation unit 110, updates the first stochastic process model used to predict transaction fees based on the historical records of transaction fees.

[0074] In step S104, CPU11, acting as the second model generation unit 112, retrieves the historical records of evidence writing requests that occurred on the user terminal 20 from the write occurrence history database 42.

[0075] In step S106, CPU11, acting as the second model generation unit 112, creates a second stochastic process model for predicting the timing of a document storage write request in the user terminal 20 based on the acquired historical records of document storage write requests.

[0076] In step S108, CPU 11, acting as execution timing determination unit 114, determines the execution timing of the additional transaction in a manner that optimizes the objective function. Here, the execution timing of the additional transaction is determined to be longer than the standby time described later. The objective function is represented by: the timing of the evidence storage write request predicted by the second stochastic process model; and the transaction fee for the execution timing of the additional transaction corresponding to the timing of the evidence storage write request, predicted by the first stochastic process model.

[0077] In step S110, CPU11, acting as execution timing determination unit 114, determines the execution plan of the transaction based on the execution timing of the additional transaction determined in step S108 above.

[0078] In step S112, CPU11 determines whether a preset standby time (e.g., several hours, 24 hours, or 1 week) has elapsed. If it is determined that the standby time has elapsed, it returns to the above steps S100 and S104.

[0079] Thus, the timing of execution is determined by solving an optimization problem with random variables and a regression problem of a stochastic process that predicts the decision variable in stages.

[0080] Next, the CPU 11 reads the information processing program from the ROM 12 or the storage device 14, expands it into the RAM 13, and executes it, thereby performing... Figure 5 The transaction execution process is shown. Furthermore, it is assumed that a written request for proof of existence is input from user terminal 20 to server 10 at any time.

[0081] First, in step S120, CPU11, acting as transaction execution unit 116, reads the execution plan of the transaction obtained in the above-mentioned execution timing determination process.

[0082] In step S122, CPU11, acting as transaction execution unit 116, determines whether the execution conditions specified in the execution plan are met. For example, if the current time is the execution opportunity specified in the execution plan and a new evidence storage write request is received, it is determined that the execution conditions are met, and the process proceeds to step S124. On the other hand, if the current time is not the execution opportunity specified in the execution plan or no new evidence storage write request is received, it is determined that the execution conditions are not met, and the process proceeds to step S126.

[0083] In step S124, CPU11, acting as transaction execution unit 116, executes an additional transaction to write the evidence according to the new evidence writing request received from user terminal 20.

[0084] In step S126, CPU 11 determines whether it is an opportunity to update the execution plan. For example, if a predetermined standby time has elapsed, it is determined that the execution plan has been updated in the execution timing determination process, and returns to step S120. On the other hand, if the predetermined standby time has not elapsed, it is determined that the execution plan has not been updated in the execution timing determination process, and returns to step S122.

[0085] Alternatively, step S126 can be omitted in the above transaction execution process. In this case, whenever the transaction execution process is repeated, the execution plan of the transaction obtained in the above execution timing determination process can be read in step S120.

[0086] Based on the above, and according to the information processing system of this embodiment, the timing for executing an append transaction to the blockchain is determined based on the historical records of transaction fees and the historical records of requests for evidence storage. Therefore, the timing of transaction execution can be determined by considering both transaction fees and the reliability related to transaction execution. Furthermore, the timing of append transaction execution can be controlled while maintaining a balance between transaction fees and reliability, taking into account the trade-off between transaction fees and the reliability related to transaction execution.

[0087] Furthermore, the variables that are optimized in the objective function include the timing of the execution of transactions that aggregate writes to the blockchain, and these transactions are executed according to the solution obtained from the optimization calculation. This ensures the stability of transaction fee payments.

[0088] <Variation Example>

[0089] Furthermore, the present invention is not limited to the above-described embodiments, and various modifications or applications can be made without departing from the spirit of the present invention.

[0090] For example, in the above implementation, the case where a transaction execution plan is pre-calculated from past historical records, and a write request for proof of evidence is generated, the transaction is executed with reference to the transaction execution plan is described as an example, but it is not limited to this. For example, it can also be set to include not only past historical records but also currently standby transactions, and the transaction execution plan can be calculated through the optimization calculation of the objective function.

[0091] Furthermore, when the long-term trend of transaction fees is predictable, optimizing the objective function over a long period would increase the number of variables in the optimization object, potentially making it difficult to find the optimal solution. In this case, firstly, the variables in the optimization object can be determined by optimizing the objective function corresponding to the long-term trend. Then, a multi-stage optimization can be performed, iteratively optimizing the objective function over a relatively short period.

[0092] In the above embodiments, various processes can also be executed by various processors other than the CPU, which read in the software (program). Examples of processors in this case include FPGAs (Field-Programmable Gate Arrays) and PLDs (Programmable Logic Devices) whose circuit structure can be changed after manufacturing, as well as ASICs (Application Specific Integrated Circuits) and other processors with circuit structures specifically designed for performing specific processes, i.e., dedicated circuits.

[0093] Furthermore, the execution timing of processing and transaction execution can be determined by one of these various processors, or it can be executed by a combination of two or more processors of the same or different types (e.g., multiple FPGAs and combinations of CPUs and FPGAs). More specifically, the hardware structure of these various processors is a circuit composed of circuit elements such as semiconductor components.

[0094] Furthermore, while the above embodiments describe the information processing program being pre-stored (installed) in the storage device 14, this is not a limitation. The program may also be provided in a non-transitory storage medium such as a CD-ROM (Compact Disk Read Only Memory), DVD-ROM (Digital Versatile Disk Read Only Memory), or USB (Universal Serial Bus) memory. Additionally, the program may be configured to be downloaded from an external device via a network.

[0095] It should be considered that the embodiments disclosed herein are exemplary in all respects and not restrictive. The scope of the invention is not defined by the foregoing meaning, but by the claims, and is intended to include all modifications within the meaning and scope equivalent to the claims.

[0096] The following notes are also disclosed regarding the above implementation methods.

[0097] (Note 1)

[0098] An information processing method, wherein,

[0099] The timing of adding a transaction to the blockchain is determined based on the historical records of transaction fees associated with transactions used to write evidence to the blockchain and the historical records of transactions written to the blockchain.

[0100] (Note 2)

[0101] According to the information processing method described in Appendix 1, wherein,

[0102] The timing of the additional transaction is determined based on a stochastic process model of transaction fees derived from the historical transaction fee records and / or a stochastic process model of the timing of evidence writing derived from the historical records of evidence writing.

[0103] (Note 3)

[0104] According to the information processing method described in Appendix 2, wherein,

[0105] The timing of the additional transaction is determined by optimizing the objective function, which is represented by: the timing of the evidence writing estimated by a stochastic process model of the evidence writing timing; and the transaction fee estimated by a stochastic process model of the transaction fee corresponding to the timing of the additional transaction execution.

[0106] (Note 4)

[0107] According to the information processing method described in Appendix 3, wherein,

[0108] The objective function is represented as follows:

[0109] The expected value of the transaction fee for the estimated timing of the additional transaction execution;

[0110] The standard deviation of the transaction fees for the estimated timing of the additional transaction execution; and

[0111] The standby time from the time the evidence is written to the time when the estimated additional transaction is executed.

[0112] (Note 5)

[0113] An information processing device, wherein,

[0114] Information processing devices include processors,

[0115] The processor performs the following processing:

[0116] The timing of adding a transaction to the blockchain is determined based on the historical records of transaction fees associated with transactions used to write evidence to the blockchain and the historical records of transactions written to the blockchain.

[0117] (Note 6)

[0118] An information processing program that causes a computer to perform the following processing:

[0119] The timing of adding a transaction to the blockchain is determined based on the historical records of transaction fees associated with transactions used to write evidence to the blockchain and the historical records of transactions written to the blockchain.

[0120] The entire contents of the disclosure of Japanese Patent Application 2023-203245 are incorporated herein by reference.

[0121] All documents, patent applications and technical standards described in this specification may be referenced in this specification to the same extent as the specific and individually described instances of reference to each document, patent application and technical standard.

Claims

1. An information processing method, wherein, The timing of adding a transaction to the blockchain is determined based on the historical records of transaction fees associated with transactions used to write evidence to the blockchain and the historical records of transactions written to the blockchain.

2. The information processing method according to claim 1, wherein, The timing of the additional transaction is determined based on a stochastic process model of transaction fees derived from the historical transaction fee records and / or a stochastic process model of the timing of evidence writing derived from the historical records of evidence writing.

3. The information processing method according to claim 2, wherein, The timing of the additional transaction is determined by optimizing the objective function, which is represented by: the timing of the evidence writing estimated by a stochastic process model of the evidence writing timing; and the transaction fee estimated by a stochastic process model of the transaction fee corresponding to the timing of the additional transaction execution.

4. The information processing method according to claim 3, wherein, The objective function is represented as follows: The expected value of the transaction fee for the estimated timing of the additional transaction execution; The standard deviation of the transaction fees for the estimated timing of the additional transaction execution; and The standby time from the time the evidence is written to the time when the estimated additional transaction is executed.

5. An information processing device, wherein, Information processing devices include processors, The processor performs the following processing: The timing of adding a transaction to the blockchain is determined based on the historical records of transaction fees associated with transactions used to write evidence to the blockchain and the historical records of transactions written to the blockchain.

6. An information processing program that causes a computer to perform the following processing: The timing of adding a transaction to the blockchain is determined based on the historical records of transaction fees associated with transactions used to write evidence to the blockchain and the historical records of transactions written to the blockchain.

Images