JP2020035214A - Program, information processing system, and information processing method - Google Patents

Abstract

To provide a program, an information processing system, and an information processing method, capable of tracing information of transactions recorded in blockchains.SOLUTION: A program causes a computer which records transactions using a blockchain in response to requests from terminals, to execute processing for: registering a key identifying one transaction amongst a series of a plurality of transactions and transaction identification information corresponding to the key, outside a block configuring the blockchain; and registering trace information expressing descriptions and sequences of the plurality of transactions or a hash value of the trace information, a key, a key expressing an immediately preceding transaction or the transaction identification information expressing the immediately preceding transaction, within the block.SELECTED DRAWING: Figure 12

Description

  The present invention relates to a program, an information processing system, and an information processing method.

  In the blockchain, transaction information is recorded continuously from the beginning to the end, and it is difficult for the recorded data to be falsified. It has been studied to make it possible to trace information on product quality by utilizing the characteristics of such a block chain.

  If the transaction on the blockchain can be traced, for example, the producer can prove that there is no problem in the quality of the provided product, and the consumer can know whether the raw materials and parts of the purchased product are safe. Can be.

JP 2018-55203 A Japanese Patent No. 6247737 JP-A-2017-222018

  Hyperledger Fabric, which offers an open source blockchain, does not provide traceability features. Therefore, in order to trace transactions, it is necessary to implement a traceability function using a chain code (in other words, “smart contract”).

  However, it is not easy to realize a recursive trace that associates each piece of information on the blockchain.

  In one aspect, it is an object of the present invention to enable information of a transaction recorded in a block chain to be traced.

  The program stores, in a computer that records transactions using the blockchain in response to a request from the terminal, a key specifying one of a series of multiple transactions, and transaction identification information corresponding to the key, The trace information or the hash value of the trace information indicating the contents and the order of the plurality of transactions, the key, the key indicating the immediately preceding transaction, and / or the immediately preceding transaction registered outside the blocks constituting the block chain. Is registered in the block, and the process is executed.

  In one aspect, information on transactions recorded on the blockchain can be traced.

It is a block diagram explaining registration processing of transaction information in a related example. It is a block diagram explaining registration processing of transaction information in a related example. It is a table showing an example of transaction information in a related example. FIG. 4 is a block diagram illustrating a detailed example of a transaction information registration process illustrated in FIG. 3. FIG. 4 is a block diagram illustrating a detailed example of a transaction information registration process illustrated in FIG. 3. FIG. 4 is a block diagram illustrating a detailed example of a transaction information registration process illustrated in FIG. 3. FIG. 1 is a block diagram schematically illustrating a block chain system according to an example of an embodiment. FIG. 8 is a block diagram illustrating an outline of a trace process in the block chain system illustrated in FIG. 7. FIG. 9 is a diagram illustrating a peer command and a Client SDK shown in FIG. 8. FIG. 9 is a block diagram schematically illustrating a hardware configuration of the peer illustrated in FIGS. 7 and 8. FIG. 11 is a block diagram schematically illustrating a functional configuration of the peer illustrated in FIG. 10. FIG. 8 is a diagram illustrating a transaction information registration process in the blockchain system illustrated in FIG. 7. FIG. 8 is a diagram illustrating a transaction information registration process in the blockchain system illustrated in FIG. 7. 8 is a table showing a detailed example of a transaction information registration process in the blockchain system shown in FIG. 7. FIG. 8 is a block diagram illustrating a detailed example of a transaction information registration process in the blockchain system illustrated in FIG. 7. FIG. 8 is a block diagram illustrating a detailed example of a transaction information registration process in the blockchain system illustrated in FIG. 7. FIG. 8 is a block diagram illustrating a detailed example of a transaction information registration process in the blockchain system illustrated in FIG. 7. FIG. 8 is a block diagram illustrating a detailed example of a transaction information registration process in the blockchain system illustrated in FIG. 7. FIG. 8 is a block diagram illustrating a detailed example of a transaction information registration process in the blockchain system illustrated in FIG. 7. 8 is a flowchart illustrating a registration process of transaction information in the blockchain system illustrated in FIG. 7.

  Hereinafter, an embodiment will be described with reference to the drawings. However, the embodiment described below is merely an example, and there is no intention to exclude various modified examples and applications of technology not explicitly described in the embodiment. That is, the present embodiment can be implemented with various modifications without departing from the spirit thereof.

  In addition, each drawing is not intended to include only the components illustrated in the drawings, but may include other functions and the like.

  Hereinafter, the same reference numerals in the drawings denote the same parts, and a description thereof will be omitted.

[A] Related Example FIGS. 1 and 2 are block diagrams illustrating a registration process of transaction information in a related example.

  As shown in FIG. 1, transaction # 1 is a transaction from company A to company B (see symbol A1), transaction # 2 is a transaction from company B to company C (see symbol A2), and transaction # 3. Is a transaction from the company C to the company D (see symbol A3).

  In the block chain 62, a plurality of pieces of transaction information (which may be referred to as “transactions”) are collected and registered in each block 621. In the example shown in FIG. 1, three transactions are registered in each block 621. In the block chain 62, the blocks 621 are managed in a daisy chain (in other words, "tied in a line").

  As shown by reference numerals A1 and A2, after the transaction from Company A to Company B shown by Tx1, a transaction from Company B to Company C shown by Tx4 occurs. Further, as shown by reference numerals A2 and A3, after the transaction from Company B to Company C shown by Tx4, a transaction from Company C to Company D shown by Tx7 occurs.

  However, since a plurality of transactions other than the transactions indicated by reference numerals A1 to A3 are recorded in each block 621 of the block chain 62, the continuity of transactions between adjacent blocks 621 is unknown (reference numeral A4). reference).

  Therefore, the order of the transactions is stored in a database called a world state 63 by the chain code 61. In the example shown in FIG. 1, in the world state 63, the order of transactions is: transaction # 1 from company A to company B, transaction # 2 from company B to company C2, transaction # 3 from company C to company D Is recorded (see A5).

  As shown in FIG. 2, the same transaction is doubly managed by the block chain 62 and the world state 63. For example, the blockchain 62 manages Tx1 indicating the transaction content from Company A to Company B, and the world state 63 manages transaction # 1 indicating the transaction content from Company A to Company B (reference numeral). B1). This increases the amount of data recorded in the system.

  Further, the transaction contents recorded in the world state 63 may be rewritten. In the example shown in FIG. 2, transaction # 3 from company C to company D is changed to transaction # 4 from company C to company E (in other words, "falsification") (see reference numeral B2).

  FIG. 3 is a table showing an example of transaction information in a related example.

  The registration information shown in FIG. 3 includes values of event, UserID, UserName, Operation, SrcResourceID, ResourceID, ResourceGroup, ResourceName, Owner, Hash, CreatedDate, RegisteredDate, and key information.

  In the table illustrated in FIG. 3, values are registered for “data registration”, “data purchase”, and “learned model creation” corresponding to transactions # 1 to # 3, respectively.

  4 to 6 are block diagrams illustrating a detailed example of the transaction information registration process shown in FIG.

  In FIG. 4, in transaction # 1, an event of teacher data registration occurs (see reference numeral C1). In the registration information of this event, the user ID is executed by Ken specified by US0001, and the resource ID indicating the teacher data is data0001. In the registration information, the type of data to be registered is teacher data, and there is no original data. Further, the registration information may include a hash value and a creation date and time of the teacher data.

  In FIG. 4, transactions # 1 to # 3 are registered in block # 1 together with the hash value of the immediately preceding block. In the illustrated example, transaction # 1 is registered in transaction # 3 (see reference numeral C2).

  In transaction # 3, an event of teacher data registration executed by Ken whose user ID is specified by US0001 and whose resource ID indicating teacher data is data0001 is registered (see reference numeral C3). In the registration information, the type of data to be registered is teacher data, and there is no original data. Furthermore, the registration information may include the registration date and time of the transaction # 3 in the block # 1 in addition to the hash value and the creation date and time of the teacher data.

  In the transaction, a “previous key” indicating the immediately preceding transaction and a “key” indicating the transaction are registered. In the example shown in FIG. 4, the previous key is NULL, and the key is US0001 + data0001 (see reference numeral C4). The “previous key” may be, for example, a “previous transaction ID” or a “previous key and previous transaction ID”.

  In the world state 63, transaction ID management and traceability management are performed.

  In the transaction ID management, a key is associated with a transaction ID. In the example shown in FIG. 4, Tx3 is registered as the transaction ID for the key US0001 + data0001 (see reference numeral C5).

  In the traceability management, a transaction ID is associated with a child transaction and a parent transaction. Here, the child transaction indicates a transaction immediately after the transaction indicated by the transaction ID, and the parent transaction indicates a transaction immediately before the transaction indicated by the transaction ID. In the example illustrated in FIG. 4, neither the child transaction nor the parent transaction with the transaction ID Tx3 exists (see reference numeral C6).

  In FIG. 5, in transaction # 2, an event of purchasing teacher data occurs (see reference numeral D1). In the registration information of this event, the user ID is executed by Mike specified by US0002, and the resource ID indicating the teacher data is data0001. In the registration information, the type of data to be purchased is teacher data, and the original data (in other words, “purchase target”) is registered by Ken whose user ID is specified by US0001, and the resource ID is data0001. Is the teacher data specified by. Further, the registration information may include a hash value of the teacher data.

  In FIG. 5, in addition to the block # 1 shown in FIG. 4, in the block # 2, transactions # 4 to # 7 are registered together with the hash value of the immediately preceding block. In the illustrated example, the transaction # 2 is registered in the transaction # 5 (see reference numeral D2).

  In transaction # 5, an event of teacher data purchase, which is executed by Mike whose user ID is specified by US0002 and whose resource ID indicating teacher data is data0001, is registered (see reference sign D3). The type of data purchased in the registration information is teacher data, and the original data is teacher data registered by Ken whose user ID is specified by US0001 and whose resource ID is specified by data0001. Further, the registration information may include a hash value of the teacher data.

  In the transaction, a “previous key” indicating the immediately preceding transaction and a “key” indicating the transaction are registered. In the example shown in FIG. 5, the previous key is US0001 + data0001, and the key is US0002 + data0001 (see reference sign D4). The “previous key” may be, for example, a “previous transaction ID” or a “previous key and previous transaction ID”.

  In the transaction ID management, a key is associated with a transaction ID. In the example shown in FIG. 5, Tx3 is registered as a transaction ID for the key US0001 + data0001, and Tx5 is registered as a transaction ID for the key US0002 + data0001 (see reference numeral D5).

  In the traceability management, a transaction ID is associated with a child transaction and a parent transaction. In the example shown in FIG. 5, the child transaction with the transaction ID Tx3 is Tx5, and there is no parent transaction. Further, there is no child transaction ID of the transaction ID Tx5, and the parent transaction is Tx3 (refer to the symbol D6).

  In FIG. 6, in transaction # 3, an event for creating a learned model occurs (see reference numeral E1). In the registration information of this event, the user ID is executed by Mike specified by US0002, and the resource ID indicating the learned model is mdl0001. In the registration information, the type of data to be created is a learned model, and the original data is teacher data purchased by Mike whose user ID is specified by US0002 and whose resource ID is specified by data0001. Further, the registration information may include a hash value of the learned model.

  In FIG. 6, in addition to the blocks # 1 and # 2 shown in FIG. 5, in the block # 3, transactions # 8 to # 10 are registered together with the hash value of the immediately preceding block. In the illustrated example, in transaction # 9, transaction # 3 is registered (see reference numeral E2).

  In transaction # 9, an event of a learned model creation executed by Mike whose user ID is specified by US0002 and whose resource ID indicating the learned model is mdl0001 is registered (see reference numeral E3). The type of data purchased in the registration information is a trained model, and the original data is teacher data purchased by Mike whose user ID is specified by US0002 and whose resource ID is specified by data0001. Further, the registration information may include a hash value of the learned model.

  In the transaction, a “previous key” indicating the immediately preceding transaction and a “key” indicating the transaction are registered. In the example shown in FIG. 6, the previous key is US0002 + data0001 and the key is US0002 + mdl0001 (see reference numeral E4). The “previous key” may be, for example, a “previous transaction ID” or a “previous key and previous transaction ID”.

  In the transaction ID management, a key is associated with a transaction ID. In the example shown in FIG. 6, Tx3 is registered as a transaction ID for key US0001 + data0001, Tx5 is registered as a transaction ID for key US0002 + data0001, and a transaction ID is registered for key US0002 + mdl0001. Tx9 is registered (see reference sign E5).

  In the traceability management, a transaction ID is associated with a child transaction and a parent transaction. In the example shown in FIG. 6, the child transaction with the transaction ID Tx3 is Tx5, and there is no parent transaction. The child transaction ID of the transaction ID Tx5 is Tx9, and the parent transaction is Tx3. Further, there is no child transaction with the transaction ID Tx9, and the parent transaction is Tx5 (see symbol E6).

  Here, if the data is falsified in the traceability management of the world state 23, the transaction cannot be traced correctly, and the validity of the data may not be proved.

[B] Example of Embodiment [B-1] Example of System Configuration FIG. 7 is a block diagram schematically illustrating a block chain system 100 according to an example of the embodiment.

  The blockchain system 100 is an example of an information processing system, and includes a blockchain platform 101 and a client application 102. The blockchain platform 101 and the client application 102 are communicably connected via a network.

  The client application 102 deploys, for example, the web browser 5. The user may input information on the transaction content via the web browser 5. Note that the client application 102 may input information to the server application 4 using a curl command.

  The blockchain platform 101 deploys the Hyperledger Fabric 10 and the server application 4.

  The server application 4 is executed by a client 40 described later with reference to FIG.

  The Hyperledger Fabric 10 develops a peer 1, an ordering service 2, and a Certificate Authority (CA) 3.

  The ordering service 2 orders the transactions and ensures the consistency of the transactions.

  CA3, as a membership service provider, issues IDs for issuing and managing certificates.

  The peer 1 is an example of an information processing device, and executes transaction approval and commit. Further, the peer 1 verifies the transaction and synchronizes a ledger 1012 described later.

  As shown in FIG. 7, the peer 1 includes a chain code 21 (in other words, “smart contract”) and a ledger 1012.

  The chaincode 21 is an application installed on the peer 1 and has a function for automating transactions.

  The ledger 1012 is a database that functions as the blockchain 22 (may be referred to as “transaction record”) and the world state 23. The block chain 22 records the details of the transaction. The world state 23 stores a transaction in a traceable state.

  FIG. 8 is a block diagram illustrating an outline of a trace process in the block chain system 100 illustrated in FIG.

  The client 40 executes a function call to the peer 1 of the Hyperledger Fabric 10 using the peer command 41. The peer command 41 will be described later with reference to FIG. In the client 40, a Client Software Development Kit (Client SDK) 42 is used. The Client SDK 42 will be described later with reference to FIG.

  In the chain code 21 of the peer 1, the function 1111 for recording the trace data calls the registration function to the traceability function library 1113 by the function call using the peer command 41 from the client 40. Also. The function 1112 that refers to the trace result makes a reference function call to the traceability function library 1113 by a function call from the client 40. Note that a call may be executed for a function directly written in the chaincode 21.

  FIG. 9A is a diagram for explaining the peer command 41, and FIG. 9B is a diagram for explaining the Client SDK 42.

  The peer command 41 is a tool used when an administrator performs a specific task on the peer 1. The peer command 41 executes the chaincode 21 according to the description shown in FIG. 9A, for example.

  As shown in FIG. 9B, the Client SDK 42 is a set of programs and tools for developing an application (App) 43 corresponding to the Hyperleadger Fabric 10 on the client 40 side.

  FIG. 10 is a block diagram schematically illustrating a hardware configuration of the peer 1 illustrated in FIGS. 7 and 8.

  The peer 1 includes a Central Processing Unit (CPU) 11, a memory 12, a display control unit 13, a storage device 14, an input interface (I / F) 15, a read / write processing unit 16, and a communication I / F 17.

  The memory 12 is an example of a storage unit, and is, for example, a storage device including a Read Only Memory (ROM) and a Random Access Memory (RAM). A program such as a Basic Input / Output System (BIOS) may be written in the ROM of the memory 12. The software program in the memory 12 may be read and executed by the CPU 11 as appropriate. Further, the RAM of the memory 12 may be used as a primary recording memory or a working memory.

  The display control unit 13 is connected to the display device 130 and controls the display device 130. The display device 130 is a liquid crystal display, an Organic Light-Emitting Diode (OLED) display, a Cathode Ray Tube (CRT), an electronic paper display, or the like, and displays various information for an operator or the like. The display device 130 may be combined with an input device, and may be, for example, a touch panel.

  The storage device 14 is, for example, a device that stores data in a readable and writable manner. For example, a hard disk drive (HDD), a solid state drive (SSD), and a storage class memory (SCM) may be used.

  The input I / F 15 is connected to input devices such as a mouse 151 and a keyboard 152, and controls input devices such as a mouse 151 and a keyboard 152. The mouse 151 and the keyboard 152 are examples of input devices, and the operator performs various input operations via these input devices.

  The read / write processing unit 16 is configured so that the recording medium 160 can be mounted. The read / write processing unit 16 is configured to be able to read information recorded on the recording medium 160 when the recording medium 160 is mounted. In this example, the recording medium 160 has portability. For example, the recording medium 160 is a flexible disk, an optical disk, a magnetic disk, a magneto-optical disk, a semiconductor memory, or the like.

  The communication I / F 17 is an interface for enabling communication with an external device.

  The CPU 11 is a processing device that performs various controls and calculations, and realizes various functions by executing an Operating System (OS) and programs stored in the memory 12.

  The device by which the CPU 11 controls the entire operation of the peer 1 is not limited to the CPU 11, and may be, for example, any one of an MPU, a DSP, an ASIC, a PLD, and an FPGA. Further, the device for controlling the operation of the entire peer 1 may be a combination of two or more of CPU, MPU, DSP, ASIC, PLD, and FPGA. Note that MPU is an abbreviation for Micro Processing Unit, DSP is an abbreviation for Digital Signal Processor, and ASIC is an abbreviation for Application Specific Integrated Circuit. PLD is an abbreviation for Programmable Logic Device, and FPGA is an abbreviation for Field Programmable Gate Array.

  FIG. 11 is a block diagram schematically showing the functional configuration of the peer 1 shown in FIG.

  The peer 1 has a function as the processing unit 110. As illustrated in FIG. 11, the processing unit 110 functions as a first registration processing unit 111, a second registration processing unit 112, and a determination unit 113.

  A program for implementing the functions of the first registration processing unit 111, the second registration processing unit 112, and the determination unit 113 is provided, for example, in a form recorded on the recording medium 160 described above. Then, the computer reads the program from the recording medium 160 via the read / write processing unit 16, transfers the program to an internal storage device or an external storage device, and uses the program. In addition, the program may be recorded on a storage device (recording medium) such as a magnetic disk, an optical disk, and a magneto-optical disk, and provided to the computer from the storage device via a communication path.

  When implementing the functions of the first registration processing unit 111, the second registration processing unit 112, and the determination unit 113, a program stored in an internal storage device is executed by a microprocessor of a computer. At this time, the program recorded on the recording medium 160 may be read and executed by a computer. In the present embodiment, the internal storage device is the memory 12, and the microprocessor is the CPU 11.

  The first registration processing unit 111 registers a transaction ID (may be referred to as “transaction identification information”) corresponding to a key specifying a transaction in the world state 23. In other words, the first registration processing unit 111 stores a key identifying one of a plurality of transactions in a series of transactions and a transaction ID corresponding to the key outside the block 221 constituting the block chain 22. Register with.

  The second registration processing unit 112 registers the trace information and the transaction ID in a block 221 of the block chain 22 (described later with reference to FIGS. 12 and 13). In other words, the second registration processing unit 112 indicates the trace information indicating the contents and order of the plurality of transactions or the hash value of the trace information, the key, the key indicating the immediately preceding transaction, and / or the last transaction. The transaction ID is registered in the block 221.

  When the transaction is generated, the determination unit 113 compares the latest association information stored in the world state 23 with the latest association information included in the past transaction stored in the block 221 and determines In this case, it is determined that tampering has occurred. In other words, when registering the trace information, the latest transaction ID stored in the data set outside the block 221 and the latest transaction ID included in a plurality of transactions stored in the block 221 are registered. By comparison, if they differ, it is determined that the data set outside the block 221 has been tampered with.

  FIG. 12 and FIG. 13 are diagrams illustrating the registration processing of the transaction information in the blockchain system 100 shown in FIG.

  As shown in FIG. 12, transaction # 1 is a transaction from company A to company B (see reference F1), transaction # 2 is a transaction from company B to company C (see reference F2), and transaction # 3. Is a transaction from the company C to the company D (see reference F3).

  In the block chain 22, a plurality of pieces of transaction information (which may be referred to as “transactions”) are collected and registered in each block 221. In the example shown in FIG. 12, three transactions are registered in each block 221. In the block chain 22, each block 221 is managed by being connected in a rosary (in other words, "connected in a row").

  In other words, in the block chain 22, trace information indicating the contents and order of a plurality of transactions and a transaction ID are registered in the block 221.

  As shown by reference numerals F1 and F2, after the transaction from company A to company B shown by Tx1, a transaction from company B to company C shown by Tx4 occurs. Further, as shown by reference numerals F2 and F3, after the transaction from Company B to Company C shown by Tx4, a transaction from Company C to Company D shown by Tx7 occurs.

  In the world state 23, a key for specifying a transaction (for example, transactions # 1 to # 3) and a transaction ID (for example, Tx1, Tx4, and Tx7) corresponding to the key are registered in the order of occurrence of transactions. As a result, the block chain 22 and the world state 23 are associated with each other (see reference numeral F4), and the data of the transaction registered in the block 221 can be analyzed to obtain information.

  As shown in FIG. 13, transaction contents indicating a transaction source, a business partner, and the like are acquired from the block 221 (see reference numeral G1). As a result, the transaction content is not registered in the world state 23, but is registered only in the block 221. Therefore, the data amount can be reduced.

  Further, the starting point of the trace can be determined by designating a key for specifying the transaction (see reference numeral G2). Thus, tracing can be started from an arbitrary transaction, and the tracing process of the blockchain 22 can be speeded up.

  Further, even when the world state 23 has been tampered with, information necessary for tracing is not registered in the world state 23 (see reference numeral G3). In the example shown in FIG. 13, Tx7 corresponding to transaction # 3 has been altered to Tx10 corresponding to transaction # 4, but the source and supplier are not registered in world state 23. Thereby, even if the information of the world state 23 is falsified, it can be detected, and the reliability in the blockchain system 100 can be improved.

  FIG. 14 is a table showing a detailed example of a transaction information registration process in the blockchain system 100 shown in FIG.

  The registration information shown in FIG. 14 includes values of No, transaction, event, UserID, UserName, Operation, SrcResourceID, ResourceID, ResourceGroup, ResourceName, Owner, Hash, CreatedDate, RegisteredDate, and key information.

  In the table illustrated in FIG. 14, respective values are registered for “data registration”, “data purchase”, “learned model creation”, and “data purchase” corresponding to transactions A to D, respectively.

  15 to 19 are block diagrams illustrating a detailed example of a transaction information registration process in the block chain system 100 illustrated in FIG.

  In FIG. 15, in transaction A, an event of teacher data registration occurs (see reference numeral H1). In the registration information of this event, the user ID is executed by Ken specified by US0001, and the resource ID indicating the teacher data is data0001. In the registration information, the type of data to be registered is teacher data, and there is no original data. Further, the registration information may include a hash value and a creation date and time of the teacher data.

  In FIG. 16, transactions # 1 to # 3 are registered in the block # 1 together with the hash value of the immediately preceding block. In the illustrated example, the transaction A is registered in the transaction # 3 (see reference numeral I1).

  In transaction # 3, an event of teacher data registration executed by Ken whose user ID is specified by US0001 and whose resource ID indicating teacher data is data0001 is registered (see reference numeral I2). In the registration information, the type of data to be registered is teacher data, and there is no original data. Furthermore, the registration information may include the registration date and time of the transaction # 3 in the block # 1 in addition to the hash value and the creation date and time of the teacher data.

  In the transaction, a “previous key” indicating the immediately preceding transaction and a “key” indicating the transaction are registered. In the example shown in FIG. 16, the previous key is NULL, and the key is US0001 + data0001 (see reference numeral I3). The “previous key” may be, for example, a “previous transaction ID” or a “previous key and previous transaction ID”.

  In the world state 23, transaction ID management is performed.

  In the transaction ID management, a key is associated with a transaction ID. In the example shown in FIG. 16, Tx3 is registered as the transaction ID for the key US0001 + data0001, and Tx3 is registered as the latest transaction (see reference numeral I4).

  The determination unit 113 compares whether the key US0001 + data0001 corresponding to the latest transaction ID Tx3 in the world state 23 matches the key US0001 + data0001 registered in the block 221. Thereby, it is possible to guarantee that there is no tampering in the world state 23.

  In FIG. 15, in transaction B, an event of purchasing teacher data occurs (see reference numeral H2). In the registration information of this event, the user ID is executed by Mike specified by US0002, and the resource ID indicating the teacher data is data0001. In the registration information, the type of data to be purchased is teacher data, and the original data (in other words, “purchase target”) is registered by Ken whose user ID is specified by US0001, and the resource ID is data0001. Is the teacher data specified by. Further, the registration information may include a hash value of the teacher data.

  In FIG. 17, in addition to the block # 1 shown in FIG. 16, in the block # 2, transactions # 4 to # 7 are registered together with the hash value of the immediately preceding block. In the illustrated example, the transaction B is registered in the transaction # 5 (see reference numeral J1).

  In transaction # 5, an event of teacher data purchase, which is executed by Mike whose user ID is specified by US0002 and whose resource ID indicating teacher data is data0001, is registered (see reference numeral J2). The type of data purchased in the registration information is teacher data, and the original data is teacher data registered by Ken whose user ID is specified by US0001 and whose resource ID is specified by data0001. Further, the registration information may include a hash value of the teacher data.

  In the transaction, a “previous key” indicating the immediately preceding transaction and a “key” indicating the transaction are registered. In the example shown in FIG. 17, the previous key is US0001 + data0001, and the key is US0002 + data0001 (see reference numeral J3). The “previous key” may be, for example, a “previous transaction ID” or a “previous key and previous transaction ID”.

  Further, trace information is recorded in the transaction. In the example shown in FIG. 17, trace information indicating that US0002 + data0001 (Tx5) has occurred after US0001 + data0001 (Tx3) is recorded (see reference numeral J4). The recorded trace information may be, for example, “key”, “transaction ID”, or “key and transaction ID”. Further, instead of the trace information, a hash value of the trace information may be registered in each transaction of the block 221. When the hash value of the trace information is registered in the transaction, the trace information is registered in the world state 23. Thus, when the trace information registered in the world state 23 is falsified, the falsification can be detected by comparing the falsified trace information with the hash value of the transaction.

  In the transaction ID management of the world state 23, a key is associated with a transaction ID. In the example shown in FIG. 17, Tx3 is registered as the transaction ID for the key US0001 + data0001, and Tx3 is changed to Tx5 as the latest transaction. In addition, Tx5 is registered as the transaction ID for the key US0002 + data0001, and Tx5 is registered as the latest transaction (see reference numeral J5).

  The determination unit 113 compares the key US0002 + data0001 corresponding to the latest transaction ID Tx5 in the world state 23 with the key US0002 + data0001 registered in the block 221 to determine whether the key US0002 + data0001 matches. Thereby, it is possible to guarantee that there is no tampering in the world state 23.

  In FIG. 15, in transaction C, an event for creating a learned model occurs (see reference numeral H3). In the registration information of this event, the user ID is executed by Mike specified by US0002, and the resource ID indicating the learned model is mdl0001. In the registration information, the type of data to be created is a learned model, and the original data is teacher data purchased by Mike whose user ID is specified by US0002 and whose resource ID is specified by data0001. Further, the registration information may include a hash value of the learned model.

  In FIG. 18, in addition to the blocks # 1 and # 2 shown in FIG. 17, in the block # 3, transactions # 8 to # 10 are registered together with the hash value of the immediately preceding block. In the illustrated example, the transaction C is registered in the transaction # 9 (see the symbol K1).

  In transaction # 9, an event of a learned model creation that is executed by Mike whose user ID is specified by US0002 and whose resource ID indicating the learned model is mdl0001 is registered (see reference numeral K2). The type of data purchased in the registration information is a trained model, and the original data is teacher data purchased by Mike whose user ID is specified by US0002 and whose resource ID is specified by data0001. Further, the registration information may include a hash value of the learned model.

  In the transaction, a “previous key” indicating the immediately preceding transaction and a “key” indicating the transaction are registered. In the example shown in FIG. 18, the previous key is US0002 + data0001, and the key is US0002 + mdl0001 (see reference sign K3). The “previous key” may be, for example, a “previous transaction ID” or a “previous key and previous transaction ID”.

  Further, trace information is recorded in the transaction. In the example shown in FIG. 17, trace information indicating that US0002 + data0001 (Tx5) occurs after US0001 + data0001 (Tx3), and that US0002 + mdl0001 (Tx9) occurs after US0002 + data0001 (Tx5). Recorded (see code K4). The recorded trace information may be, for example, “key”, “transaction ID”, or “key and transaction ID”. Further, instead of the trace information, a hash value of the trace information may be registered in each transaction of the block 221. When the hash value of the trace information is registered in the transaction, the trace information is registered in the world state 23. Thus, when the trace information registered in the world state 23 is falsified, the falsification can be detected by comparing the falsified trace information with the hash value of the transaction.

  In the transaction ID management of the world state 23, a key is associated with a transaction ID. In the example shown in FIG. 6, Tx3 is registered as the transaction ID for the key US0001 + data0001, and Tx5 is changed to Tx9 as the latest transaction. Also, Tx5 is registered as a transaction ID for the key US0002 + data0001, and Tx5 is changed to Tx9 as the latest transaction. Further, Tx9 is registered as the transaction ID for the key US0002 + mdl0001, and Tx9 is registered as the latest transaction (see the symbol K5).

  The determination unit 113 compares the key US0002 + mdl0001 corresponding to Tx9, which is the latest transaction ID in the world state 23, with the key US0002 + mdl0001 registered in the block 221 to see if they match. Thereby, it is possible to guarantee that there is no tampering in the world state 23.

  In FIG. 15, in transaction D, an event of purchasing teacher data occurs (see reference numeral H4). In the registration information of this event, the user ID is executed by Nancy specified by US0005, and the resource ID indicating the teacher data is data0001. In the registration information, the type of data to be registered is teacher data, and the original data (in other words, “purchase target”) is registered by Ken whose user ID is specified by US0001, and the resource ID is data0001 Is the teacher data specified by. Further, the registration information may include a hash value of the teacher data.

  In FIG. 19, in addition to blocks # 1 to # 3 shown in FIG. 18, in block # 4, transactions # 11 to # 13 are registered together with the hash value of the immediately preceding block. In the illustrated example, the transaction D is registered in the transaction # 13 (see reference numeral L1).

  In transaction # 13, an event of a teacher data purchase executed by Nancy specified by the user ID of US0005 and having a resource ID of data 0001 indicating teacher data is registered (see reference numeral L2). The type of data purchased in the registration information is teacher data, and the original data is teacher data registered by Ken whose user ID is specified by US0001 and whose resource ID is specified by data0001. Further, the registration information may include a hash value of the teacher data.

  In the transaction, a “previous key” indicating the immediately preceding transaction and a “key” indicating the transaction are registered. In the example shown in FIG. 19, the previous key is US0001 + data0001, and the key is US0005 + data0001 (see reference numeral L3). The “previous key” may be, for example, a “previous transaction ID” or a “previous key and previous transaction ID”.

  Further, trace information is recorded in the transaction. In the example shown in FIG. 19, trace information indicating that US0002 + data0001 (Tx5) occurs after US0001 + data0001 (Tx3), and that US0002 + mdl0001 (Tx9) occurs after US0002 + data0001 (Tx5). Has been recorded. In the example shown in FIG. 19, trace information indicating that US0005 + data0001 (Tx13) has occurred after US0001 + data0001 (Tx3) is recorded (see reference numeral L4). The recorded trace information may be, for example, “key”, “transaction ID”, or “key and transaction ID”. Further, instead of the trace information, a hash value of the trace information may be registered in each transaction of the block 221. When the hash value of the trace information is registered in the transaction, the trace information is registered in the world state 23. Thus, when the trace information registered in the world state 23 is falsified, the falsification can be detected by comparing the falsified trace information with the hash value of the transaction.

  In the transaction ID management of the world state 23, a key is associated with a transaction ID. In the example shown in FIG. 17, Tx3 is registered as the transaction ID for the key US0001 + data0001, and Tx13 is registered as the latest transaction. In addition, Tx5 is registered as the transaction ID for the key US0002 + data0001, and Tx13 is registered as the latest transaction. Further, Tx9 is registered as the transaction ID for the key US0002 + mdl0001, and Tx13 is registered as the latest transaction. In addition, Tx13 is registered as the transaction ID for the key US0005 + data0001, and Tx13 is registered as the latest transaction (see reference numeral L5).

  The determination unit 113 compares the key US0005 + data0001 corresponding to Tx13, which is the latest transaction ID in the world state 23, with the key US0005 + data0001 registered in the block 221 to see if they match. Thereby, it is possible to guarantee that there is no tampering in the world state 23.

[B-2] Operation Example The transaction information registration processing in the block chain system 100 shown in FIG. 7 will be described with reference to the flowchart (steps S1 to S9) shown in FIG.

  The first registration processing unit 111 adds data of the transaction to be added this time to the world state 23 (step S1).

  The second registration processing unit 112 records the previous key for the transaction to be added (step S2).

  The second registration processing unit 112 determines whether there is original data (step S3).

  If there is no original data (see No route in step S3), the second registration processing unit 112 creates the transaction to be added this time as new trace information (step S4). Then, the process proceeds to step S8.

  On the other hand, if there is the original data (see the Yes route in step S3), the second registration processing unit 112 acquires the latest transaction transaction ID of the original data from the world state 23 (step S5).

  The second registration processing unit 112 acquires trace information from the transaction with the latest transaction transaction ID (step S6).

  The second registration processing unit 112 creates new trace information by adding the association of the transaction to be added this time to the trace information (step S7).

  The second registration processing unit 112 records the trace information in the transaction to be added (Step S8).

  The second registration processing unit 112 updates the latest transaction transaction ID in the world state 23 with the transaction ID to be added this time for each data of the trace information (step S9). Then, the transaction information registration process ends.

[B-3] Effects According to the block chain system 100 in an example of the above-described embodiment, for example, the following effects can be obtained.

  The first registration processing unit 111 registers a key for specifying one of a series of transactions and a transaction ID corresponding to the key, outside the block 221 configuring the block chain 22. In addition, the second registration processing unit 112 stores trace information indicating the contents and order of a plurality of transactions or a hash value of the trace information, a key, a key indicating the immediately preceding transaction, and / or a transaction ID indicating the immediately preceding transaction. Is registered in the block 221.

  This makes it possible to trace transaction information recorded in the blockchain 22 starting from an arbitrary transaction, and to speed up the tracing process. That is, the blockchain system 100 having the traceability function can be provided.

  When registering the trace information, the determination unit 113 compares the latest key stored in the data set outside the block 221 with the latest key included in a plurality of transactions stored in the block 221. If they are different, it is determined that the data set outside the block 221 has been tampered with.

  Thereby, even if the information of the world state 23 is tampered, the occurrence of tampering can be detected, and the reliability of the blockchain system 100 can be improved.

  Outside the block 221, the first registration processing unit 111 does not register the contents of a plurality of transactions.

  As a result, the trace information indicating the contents and order of the transactions is registered only in the block 221 of the block chain 22, so that the data amount in the block chain system 100 can be reduced.

[C] Others The disclosed technology is not limited to the above-described embodiment, and can be implemented with various modifications without departing from the spirit of the present embodiment. Each configuration and each process of the present embodiment can be selected as needed, or can be appropriately combined.

  In the example of the above-described embodiment, “Hyperledger Fabric” is described as the blockchain base, but the present invention is not limited to this. In the embodiment, various blockchain bases can be adopted.

[D] Supplementary notes The following supplementary notes are further disclosed with respect to the above embodiment.

(Appendix 1)
Computer that records transactions using blockchain in response to requests from terminals,
Registering a key specifying one of a plurality of transactions in a series of transactions and transaction identification information corresponding to the key outside of the blocks constituting the block chain,
The trace information indicating the contents and order of the plurality of transactions or the hash value of the trace information and the key are registered in the block with the key indicating the immediately preceding transaction and / or the transaction identification information indicating the immediately preceding transaction. ,
A program that executes a process.

(Appendix 2)
When registering the trace information, comparing the latest key stored in the data set outside the block with the latest key included in the plurality of transactions stored in the block, If the data set outside the block is determined to have been tampered with,
The program according to claim 1, wherein the program causes the computer to execute a process.

(Appendix 3)
Outside the block, do not register the content of the plurality of transactions,
3. The program according to claim 1, wherein the program causes the computer to execute a process.

(Appendix 4)
An information processing system comprising an information processing device and a terminal, wherein the information processing system records a transaction using a blockchain in response to a request from the terminal,
The information processing device,
A first registration processing unit that registers a key that specifies one of a plurality of transactions in a series of transactions and transaction identification information corresponding to the key, out of the blocks configuring the block chain;
Registering, in the block, trace information indicating the contents and order of the plurality of transactions or a hash value of the trace information, the key, a key indicating a previous transaction, and / or transaction identification information indicating a previous transaction. A second registration processing unit,
An information processing system comprising:

(Appendix 5)
When registering the trace information, comparing the latest key stored in the data set outside the block with the latest key included in the plurality of transactions stored in the block, The information processing system according to claim 4, further comprising: a determination unit that determines that the data set outside the block has been tampered with in that case.

(Appendix 6)
The first registration processing unit does not register the contents of the plurality of transactions outside the block.
An information processing system according to attachment 4 or 5.

(Appendix 7)
An information processing method for recording a transaction using a blockchain in response to a request from a terminal,
Registering a key specifying one of a plurality of transactions in a series of transactions and transaction identification information corresponding to the key outside of the blocks constituting the block chain,
Registering, in the block, trace information indicating the content and order of the plurality of transactions or a hash value of the trace information, the key, a key indicating a previous transaction, and / or transaction identification information indicating a previous transaction. Do
Information processing method.

(Appendix 8)
When registering the trace information, comparing the latest key stored in the data set outside the block with the latest key included in the plurality of transactions stored in the block, If the data set outside the block is determined to have been tampered with,
The information processing method according to supplementary note 7.

(Appendix 9)
Outside the block, do not register the content of the plurality of transactions,
An information processing method according to attachment 7 or 8.

100: Blockchain system 10: Hyperledger Fabric
101: blockchain platform 1012: ledger 102: client application 1111: function 1112 for recording trace data: function 1113 for referring to trace results: traceability function library 1: peer 110: processing unit 11: CPU
111: first registration processing unit 112: second registration processing unit 113: determination unit 12: memory 13: display control unit 130: display device 14: storage device 15: input I / F
151: mouse 152: keyboard 16: read / write processing unit 160: recording medium 17: communication I / F
2: Ordering service 4: Server application 5: Web browser 21, 61: Chain code 22, 62: Block chain 221, 621: Block 23, 63: World state 40: Client 41: Peer command 42: Client SDK
43: Application

Claims (5)

Computer that records transactions using blockchain in response to requests from terminals,
Registering a key specifying one of a plurality of transactions in a series of transactions and transaction identification information corresponding to the key outside of the blocks constituting the block chain,
Registering, in the block, trace information indicating the contents and order of the plurality of transactions or a hash value of the trace information, the key, a key indicating a previous transaction, and / or transaction identification information indicating a previous transaction. Do
A program that executes a process. When registering the trace information, comparing the latest key stored in the data set outside the block with the latest key included in the plurality of transactions stored in the block, If the data set outside the block is determined to have been tampered with,
The program according to claim 1, wherein the program causes the computer to execute a process. Outside the block, do not register the content of the plurality of transactions,
The program according to claim 1, wherein the program causes the computer to execute a process. An information processing system comprising an information processing device and a terminal, wherein the information processing system records a transaction using a blockchain in response to a request from the terminal,
The information processing device,
A first registration processing unit that registers a key that specifies one of a plurality of transactions in a series of transactions and transaction identification information corresponding to the key, out of the blocks configuring the block chain;
Registering, in the block, trace information indicating the content and order of the plurality of transactions or a hash value of the trace information, the key, a key indicating a previous transaction, and / or transaction identification information indicating a previous transaction. A second registration processing unit,
An information processing system comprising: An information processing method for recording a transaction using a blockchain in response to a request from a terminal,
Registering a key specifying one of a plurality of transactions in a series of transactions and transaction identification information corresponding to the key outside of the blocks constituting the block chain,
Registering, in the block, trace information indicating the contents and order of the plurality of transactions or a hash value of the trace information, the key, a key indicating a previous transaction, and / or transaction identification information indicating a previous transaction. Do
Information processing method.

Images