Freeride Node Identification for Blockchain

Abstract

Embodiments of the present disclosure relate to free-ride node identification for blockchain. An example embodiment provides a system comprising one or more network interfaces configured to collect system calls captured from multiple peer nodes of a blockchain that occurred during a predetermined time period, and a processor configured to perform one or more of the following actions: determining a subset of system calls among the received system calls corresponding to blockchain processes executed during the predetermined time period; detecting a free-ride peer node from the multiple peer nodes based on the identified subset of system calls relative to the free-ride peer node during the predetermined time period; and storing an indicator of the free-ride peer node.

Description

Technical Field

[0001] The present application relates generally to a system for storing data via a blockchain, and more particularly to a system that can identify free-riding nodes within a blockchain network that are not contributing as expected. Background Art

[0002] A centralized database stores and maintains data in a single database (e.g., a database server) at one location. A centralized database is easy to manage, maintain, and control due to its single location, especially for security purposes. However, centralized databases have significant disadvantages. For example, centralized databases have a single point of failure. Therefore, it is difficult to retrieve accidentally lost data from backup storage except by manual operation. In addition, centralized databases may be highly dependent on network connectivity. In addition, centralized databases only provide limited access to data when the database maintains only one copy of the data.

[0003] Recently, organizations have turned to blockchain as an improved storage system over traditional databases. Blockchain provides data redundancy, no single central authority, multiple access nodes, immutable ledgers, etc. Another benefit of blockchain is that transactions are approved fairly through endorsements and consensus. Therefore, untrusted parties can interact and share in the management of the blockchain. In particular, these untrusted parties usually manage nodes that assume roles such as storage of the blockchain, endorsement of transactions, etc.

[0004] An endorsement peer node in a blockchain network is responsible for verifying transaction proposals from clients before storing them on the blockchain. An endorsement peer can receive a transaction proposal, verify the client signature, and execute a chaincode function to initiate a transaction. If the transaction is successfully executed, a proposal response can be sent back to the client along with the endorsement signature. When the client receives a predetermined number of endorsement signatures (e.g., from at least half of the endorser nodes, etc.), the transaction is approved and will be stored on the blockchain. Endorsing nodes are typically compensated for their roles due to the necessity of computation, the security to be maintained, etc. However, there may be free-riding nodes among the endorsement nodes. A free-riding node does not perform all of its required duties as an endorser. Failures can go unnoticed (disguised). For example, a free-riding endorsement node can simply send an approval signature, use another node's read-write set, etc., without having to verify the work performed.

[0005] Therefore, a solution is needed that can identify free-riding nodes within the blockchain and overcome these shortcomings and limitations. Summary of the invention

[0006] An example embodiment provides a system comprising one or more network interfaces configured to collect system calls captured from a plurality of peer nodes of a blockchain that occurred during a predetermined time period, and a processor configured to perform one or more of the following actions: determining a subset of system calls among the received system calls corresponding to blockchain processes executed during the predetermined time period; detecting a free-riding peer node from the plurality of peer nodes based on the identified subset of system calls relative to the free-riding peer node during the predetermined time period; and storing an indicator of the free-riding peer node.

[0007] Another example embodiment provides a method comprising one or more of the following steps: receiving system calls captured from a plurality of peer nodes of a blockchain that occurred during a predetermined time period; determining a subset of system calls among the received system calls that correspond to blockchain processes executed during the predetermined time period; detecting a free-riding peer node from the plurality of peer nodes based on the identified subset of system calls relative to the free-riding peer node during the predetermined time period; and storing an indicator of the free-riding peer node.

[0008] Another example embodiment provides a computer-readable medium comprising instructions that, when read by a processor, cause the processor to perform one or more of the following steps: receiving system calls captured from a plurality of peer nodes of a blockchain that occurred during a predetermined time period; determining a subset of system calls among the received system calls that correspond to blockchain processes executed during the predetermined time period; detecting a free-riding peer node from the plurality of peer nodes based on the identified subset of system calls relative to the free-riding peer node during the predetermined time period; and storing an indicator of the free-riding peer node. BRIEF DESCRIPTION OF THE DRAWINGS

[0009] Figure 1 is a diagram illustrating a system for identifying free-ride nodes within a blockchain network according to an example embodiment.

[0010] Figure 2A is a diagram illustrating an example blockchain architecture configuration according to an example embodiment.

[0011] Figure 2B is a diagram illustrating a blockchain transaction flow between nodes according to an example embodiment.

[0012] Figure 3A is a diagram illustrating a permission network according to an example embodiment.

[0013] Figure 3B is a diagram illustrating another permission network according to example embodiments.

[0014] Figure 3C is a diagram illustrating an unlicensed network according to example embodiments.

[0015] Figure 4A is a diagram illustrating the architecture of a peer node in which a trace module runs according to an example embodiment.

[0016] Figure 4B is a diagram illustrating a process of generating a system call map from system calls of multiple nodes according to an example embodiment.

[0017] Figure 4C is a diagram illustrating a process of detecting a free-ride node based on a system call graph according to an example embodiment.

[0018] Figure 5 is a diagram illustrating a method of identifying a free-ride node within a blockchain network according to an exemplary embodiment.

[0019] Fig. 6A is a diagram illustrating an example system configured to perform one or more operations described herein according to an example embodiment.

[0020] Figure 6B is a diagram illustrating another example system configured to perform one or more operations described herein according to an example embodiment.

[0021] Figure 6C is a diagram illustrating another example system configured to utilize smart contracts according to an example embodiment.

[0022] Fig.6D is a diagram illustrating yet another example system configured to utilize blockchain according to an example embodiment.

[0023] Fig. 7A is a diagram illustrating a process of adding a new block to a distributed ledger according to an example embodiment.

[0024] Figure 7B is a diagram illustrating data content of a new data block according to an example embodiment.

[0025] Figure 7C is a diagram illustrating a blockchain for digital content according to an example embodiment.

[0026] Fig.7D is a diagram illustrating a block that may represent a structure of a block in a blockchain according to example embodiments.

[0027] Fig. 8Ais a diagram illustrating an example blockchain storing machine learning (artificial intelligence) data according to example embodiments.

[0028] Figure 8B is a diagram illustrating an example quantum-secure blockchain according to an example embodiment.

[0029] Fig. 9 is a diagram illustrating an example system supporting one or more example embodiments. DETAILED DESCRIPTION

[0030] It will be readily appreciated that the instant components, as generally described and illustrated in the figures herein, may be arranged and designed in a variety of different configurations. Therefore, the following detailed description of embodiments of at least one of the methods, devices, non-transitory computer-readable media, and systems, as illustrated in the figures, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments.

[0031] The instant features, structures or characteristics described throughout the specification may be combined or removed in any suitable manner in one or more embodiments. For example, the use of the phrases "exemplary embodiments", "some embodiments" or other similar language throughout the specification refers to the fact that a specific feature, structure or characteristic described in conjunction with the embodiment may be included in at least one embodiment. Therefore, the appearance of the phrases "exemplary embodiments", "in some embodiments", "in other embodiments" or other similar language throughout the specification does not necessarily all refer to the same set of embodiments, and in one or more embodiments, the described features, structures or characteristics may be combined or removed in any suitable manner. In addition, in the figures, even if the connection between the elements shown is a unidirectional or bidirectional arrow, unidirectional and / or bidirectional communication may be allowed. Moreover, any device depicted in the drawings may be a different device. For example, if a mobile device is shown sending information, a wired device may also be used to send information.

[0032] In addition, although the term "message" may have been used in the description of the embodiment, the application can be applied to various types of networks and data. In addition, although certain types of connections, messages and signaling can be depicted in exemplary embodiments, the application is not limited to certain types of connections, messages and signaling.

[0033] Example embodiments provide methods, systems, components, non-transitory computer-readable media, devices, and / or networks for identifying free-ride nodes within a blockchain network.

[0034] In one embodiment, the system deploys and configures a decentralized database (e.g., blockchain) as a distributed storage system, which includes multiple nodes that communicate with each other. The decentralized database includes an immutable data structure that can only be appended, similar to a distributed ledger, and can maintain records between mutually untrusted parties. Untrusted parties are referred to as peers or peer nodes in this article. Each peer maintains a copy of the database record, and no peer can modify the database record without reaching a consensus between the distributed peers. For example, peers can execute a consensus protocol to verify blockchain storage transactions, group storage transactions into blocks, and build hash chains on these blocks. In order to maintain consistency, this process forms an account book by sorting storage transactions. In various embodiments, a licensed and / or permissionless blockchain can be used. In a public or permissionless blockchain, anyone can participate without a specific identity. Public blockchains can involve native cryptocurrencies and can use consensus based on various protocols such as proof of work (PoW). On the other hand, permissioned blockchain databases provide secure interactions between a group of entities that share a common goal but do not fully trust each other, such as businesses exchanging funds, goods, information, etc.

[0035] Blockchains can run arbitrary, programmable logic that is adapted to a decentralized storage scheme and is referred to as a "smart contract" or "chaincode". In some cases, there may be a dedicated chaincode for managing functionality and parameters, referred to as a system chaincode. Applications can further leverage smart contracts for trusted distributed applications, taking advantage of the tamper-proof properties of the blockchain database and the underlying protocol between nodes, referred to as endorsements or endorsement policies. Blockchain transactions associated with an application can be "endorsed" before being submitted to the blockchain, while unendorsed transactions are ignored. An endorsement policy allows a chaincode to specify the endorsers of a transaction in the form of a set of peer nodes that are required for endorsement. When a client sends a transaction to the peers specified in the endorsement policy, the transaction is executed to validate the transaction. After validation, the transaction enters the ordering phase, where a consensus protocol is used to generate an ordered sequence of endorsed transactions grouped into blocks.

[0036] A blockchain may include nodes configured therein, which are communication entities of the blockchain system. A "node" may perform a logical function in the sense that multiple nodes of different types may run on the same physical server. Nodes are grouped in trust domains and are associated with logical entities that control them in various ways. Nodes may include different types, such as client or submitting client nodes, submitting transaction calls to signatories (e.g., peers), and broadcasting transaction proposals to ordering services (e.g., ordering nodes). Another type of node is a peer node, which may receive transactions submitted by clients, submit transactions, and maintain a copy of the state and blockchain transaction ledger. Although not required, peers may also act as endorsers. Ordering service nodes or orderers are nodes that run communication services for all nodes and implement delivery guarantees, such as broadcasting to every peer node in the system when submitting transactions and modifying the world state of the blockchain, which is another name for the initial blockchain transaction that typically contains control and setup information.

[0037] A blockchain may include a ledger, which is an ordered, tamper-proof record of all state transitions of the blockchain. State transitions may be caused by chaincode invocations (i.e., transactions) submitted by participants (e.g., client nodes, sorting nodes, endorser nodes, peer nodes, etc.). Each participant (e.g., peer node) may maintain a copy of the ledger. A transaction may result in a set of asset key-value pairs being submitted to the ledger as one or more operands (e.g., create, update, delete, etc.). The ledger includes a blockchain (also referred to as a chain) for storing immutable, ordered records in blocks. The ledger also includes a state database for maintaining the current state of the blockchain.

[0038] A chain (of a blockchain) is a transaction log structured as hash-linked blocks, and each block contains a sequence of N transactions, where N is equal to or greater than 1. The block header includes the hash of the block transaction, as well as the hash of the previous block header. In this way, all transactions on the ledger can be ordered and cryptographically linked together. Therefore, it is impossible to tamper with the ledger data without breaking the hash links. The hash of the most recently added blockchain block represents every transaction that occurred previously on the chain, thereby ensuring that all peer nodes are in a consistent and trustworthy state. The chain can be stored on the peer node file system (i.e. local, attached storage, cloud, etc.), effectively supporting the append-only nature of blockchain workloads.

[0039] The current state of the immutable ledger represents the latest values ​​of all keys included in the chain's transaction log. Because the current state represents the latest key values ​​known to the channel, it is sometimes referred to as the world state. Chaincode invocations execute transactions against the current state data of the ledger. In order for these chaincode interactions to be efficient, the latest values ​​of the keys can be stored in a state database. The state database may be just an indexed view of the chain's transaction log, so it can be regenerated from the chain at any time. The state database can be automatically restored (or generated on demand) when a peer node starts and before accepting transactions.

[0040] According to various embodiments, free-riding peer nodes that are not contributing properly to the blockchain network may be identified by tracing system calls. Within a permissioned blockchain network, peer nodes may be required to install and execute a tracing module that captures system calls between chaincode running on an endorsing peer node and the operating system of the peer node. At the same time, a trusted entity (e.g., a blockchain administrator, a pre-approved peer node, an arbitrator node, a pre-approved service, etc.) may execute a free-riding detection module (e.g., a chaincode) that receives system calls from an endorsing peer node. Here, the trusted entity may communicate with a trusted module stored on an endorsing peer node to ensure that the node is running the correct tracing module.

[0041] The free riding detection module may receive system calls and identify system calls that are commonly executed between endorsement nodes (e.g., in a majority or some other predetermined amount). The free riding detection module may graph the system calls and identify from the graph a set of system calls that are necessary to perform the endorsement process. Based on the set of required system calls, the free riding detection module may identify (based on its own system calls) an endorsement node that does not execute one or more of the required system calls and mark the node as a free riding node. In addition, the free riding detection module may output a warning or alert, thereby providing a mechanism to catch free riding peer nodes.

[0042] Blockchains are replicated execution systems where different subsets of participants (e.g., endorsing peer nodes for a given chaincode) execute the same functions across the entire blockchain network. By dynamically collecting evidence of task computations (such as endorsements) from all endorsing peer nodes and comparing them to each other, the system can predict bad behavior from any dishonest peer nodes. Example embodiments may be implemented in a peer-as-a-service (PAAS) system for a permissioned blockchain, where participants are monetaryly incentivized to run peers to enable non-peer owners to submit and vouch for transactions to the permissioned blockchain.

[0043] Some benefits of example embodiments include improved security and fraud prevention within blockchain networks, especially permissioned networks that share revenue based on tasks performed. Example embodiments enable fees to be fairly distributed based on actual work performed (proven), even in situations where nodes may collude with each other (e.g., one endorsing peer provides its read / write sets to another endorsing peer, etc.).

[0044] Figure 1 A system 100 for identifying a free-ride node within a blockchain network is shown according to an example embodiment. Figure 1 , the system 100 includes a plurality of endorsement peers 111-114, whose task is to endorse transactions from clients (not shown). Here, each of the endorsement peers 111-114 may include a common chain code that is executed during the endorsement process. Therefore, each of the endorsement peers 111-114 should execute the same system call during the endorsement process. In addition, the system 100 also includes an arbitrator node 120. The arbitrator node 120 may be another peer node, a blockchain administrator, a blockchain manager, etc. In some embodiments, the arbitrator node 120 may also be one of the endorser peer nodes, but this is not required.

[0045] The arbitrator node 120 may access a blockchain ledger 122 storing transactions endorsed by the endorser peers 111-114 to identify the endorser peers 111-114. In other words, not all peer nodes within the blockchain network need or are required to endorse transactions. In addition, each chain code function may include a different set of endorser nodes. In addition, the client may dynamically select a subset of endorser nodes. Thus, the arbitrator node 120 may determine which endorser peers from a larger pool of nodes (possible endorsers) are associated with a transaction from the blockchain ledger 122, which stores endorsement information (chain code, endorsement policy, node identifier, etc.).

[0046] According to various embodiments, a trace module may be installed on each of the endorser nodes 111-114 that captures system trace calls executed during a predetermined time period. The trace module may independently collect individual system calls executed by the respective endorser peers 111-114 and forward the collected system calls to the bad behavior detection chaincode implemented on the arbitrator node 120. The arbitrator node 120 may use the bad behavior detection chaincode to construct a system call graph of a subset of the system calls collected from each of the endorser peers 111-114.

[0047] For example, as referenced Figure 4BAs further described by the example of , the arbitrator node 120 can build a shared system call graph for each endorser peer 111-114 based on the system calls independently executed by the endorser peers 111-114, and identify which calls intersect between different endorser peers 111-114. When a predetermined number of endorser peers 111-114 execute the same system call within the time period, the system call can be determined as needed for the endorsement process. In other words, since all endorser peers 111-114 should execute the same chaincode, they should also be executing the same system call. Therefore, it can be reasonably inferred that if a majority (or some other number) of nodes execute the same system call, it is associated with the endorsement process.

[0048] The established graph may include only the set of system calls that are determined to be part of the endorsement process. If all endorser peer nodes behave appropriately, these system calls should be executed by them. The arbitrator 120 may compare each of the individual frequency graphs of the various endorser peers 111-114 with the established system call graph to identify any endorser peers that are misbehaving (not executing all necessary calls, etc.), wherein the established system call graph includes a set of system calls required for the endorsement process. In this example, endorser peer 114 is identified as a free-riding peer because it is not executing the necessary calls that other endorser peers 111-113 are executing. Warnings or alarms may be output to a display of the arbitrator node 120, as well as to other nodes, such as endorser nodes 111-114, clients (not shown), etc.

[0049] Figure 2A A blockchain architecture configuration 200 is shown according to an example embodiment. Figure 2A, the blockchain architecture 200 may include certain blockchain units, such as a set of blockchain nodes 202. The blockchain nodes 202 may include one or more nodes 204-210 (these four nodes are shown by way of example only). These nodes participate in a variety of activities, such as blockchain transaction addition and verification processes (consensus). One or more of the blockchain nodes 204-210 may endorse transactions based on endorsement policies and may provide sorting services for all blockchain nodes in the architecture 200. The blockchain node may initiate a blockchain endorsement and attempt to write a copy of the blockchain immutable ledger stored in the blockchain layer 216 that may also be stored on the underlying physical infrastructure 214. The blockchain configuration may include one or more applications 224, linked to an application programming interface (API) 222 to access and execute stored program / application code 220 (e.g., chain code, smart contracts, etc.) that can be created according to the customized configuration sought by the participants and can maintain its own state, control its own assets, and receive external information. It can be deployed as a transaction and installed on all blockchain nodes 204-210 by attaching it to the distributed ledger.

[0050] The blockchain foundation or platform 212 may include various layers of blockchain data, services (e.g., cryptographic trust services, virtual execution environments, etc.), and a foundation of physical infrastructure that may be used to receive and store new transactions and provide access to auditing parties seeking access to data entries. The blockchain layer 216 may expose interfaces that provide access to the virtual execution environment necessary to process program code and use the physical infrastructure 214. Cryptographic trust services 218 may be used to verify transactions such as asset exchange transactions and keep information private.

[0051] Figure 2A The blockchain architecture configuration can process and execute program / application code 220 via one or more interfaces exposed by the blockchain platform 212 and the services provided. Code 220 can control blockchain assets. For example, code 220 can store and transmit data and can be executed by nodes 204-210 in the form of smart contracts and related chain codes with their execution conditions or other code units. As a non-limiting example, smart contracts can be created to perform reminders, updates, and / or notifications of other changes, updates, etc. The smart contract itself can be used to identify rules related to authorization and access requirements and ledger usage. For example, read set 226 can be processed by one or more processing entities (e.g., virtual machines) included in the blockchain layer 216. Write set 228 can include the results of processing read set 226 via one or more smart contracts. Physical infrastructure 214 can be used to retrieve any data or information described herein.

[0052] Smart contracts can be created through high-level applications and programming languages ​​and then written to blocks in the blockchain. Smart contracts can include executable code that is registered, stored, and / or replicated by a blockchain (e.g., a distributed network of blockchain peers). A transaction is the execution of smart contract code that can be executed in response to the satisfaction of a condition associated with a smart contract. The execution of a smart contract can trigger trusted modifications to the state of a digital blockchain ledger. Modifications to the blockchain ledger caused by the execution of a smart contract can be automatically replicated throughout the distributed network of blockchain peers through one or more consensus protocols.

[0053] Smart contracts can write data to the blockchain in the format of key-value pairs. In addition, smart contract code can read values ​​stored in the blockchain and use them in application operations. Smart contract code can write the output of various logical operations to the blockchain. The code can be used to create temporary data structures in a virtual machine or other computing platform. The data written to the blockchain can be public and / or can be encrypted and kept private. Temporary data used / generated by smart contracts is kept in memory by the provided execution environment and deleted once the data is identified as needed for the blockchain.

[0054] Chaincode may include a code interpretation of a smart contract with additional features. As described herein, chaincode may be a program code deployed on a computing network that is executed on-chain and validated by a chain validator during a consensus process. The chaincode receives the hash and retrieves from the blockchain a hash associated with a data template created using a previously stored feature extractor. If the hash value of the hashed identifier matches the hash value created from the stored identifier template data, the chaincode sends the authorization key to the requesting service. The chaincode may write data associated with the cryptographic details to the blockchain.

[0055] Figure 2B An example of a blockchain transaction flow 250 between nodes of a blockchain according to an example embodiment is shown. Figure 2B, a transaction flow may include a transaction proposal 291 sent by an application client node 260 to an endorsing peer node 281. The endorsing peer node 281 may verify the client signature and execute the chaincode function to initiate the transaction. The output may include a chaincode result, a set of key / value versions read in the chaincode (read set), and a set of key / values ​​written in the chaincode (write set). If approved, a proposal response 292 is sent back to the client 260 along with the endorsement signature. The client 260 assembles the endorsement into a transaction payload 293 and broadcasts it to the sorting service node 284. The sorting service node 284 then delivers the sorted transaction as a block to all peers 281-283 on the channel. Each peer 281-283 may validate the transaction before committing to the blockchain. For example, a peer may check the endorsement policy to ensure that the correct assignment of the specified peer has signed the result and verified the signature against the transaction payload 293.

[0056] Reference again Figure 2B , the client node 260 initiates a transaction 291 by constructing a request and sending it to the peer node 281 acting as an endorser. The client 260 may include an application utilizing a supported software development kit (SDK) to generate a transaction proposal using the available APIs. The proposal is a request to invoke a chaincode function so that data can be read and / or written to the ledger (i.e., write a new key-value pair for an asset). The SDK may act as a shim, packaging the transaction proposal into an appropriate schema format (e.g., protocol buffers over remote procedure calls (RPCs)) and generating a unique signature for the transaction proposal using the client's cryptographic credentials.

[0057] In response, the endorsing peer node 281 may verify that (a) the transaction proposal is formatted correctly, (b) the transaction has not been submitted in the past (replay attack protection), (c) the signature is valid, and (d) the submitter (in this example, client 260) is properly authorized to perform the proposed operation on the channel. The endorsing peer node 281 may input the transaction proposal as a parameter to the invoked chaincode function. The chaincode is then executed against the current state database to produce a transaction result including a response value, a read set, and a write set. However, no updates have been made to the ledger at this point. In 292, the set of values ​​is passed back to the SDK of client 260 along with the signature of the endorsing peer node 281 as a proposal response 292, and the SDK of client 260 parses the payload for consumption by the application.

[0058] In response, the client 260 application checks / verifies the endorsed peer signature and compares the proposal response to determine if the proposal responses are the same. If the chaincode only queries the ledger, the application will check the query response and generally not submit the transaction to the ordering node service 284. If the client application intends to submit the transaction to the ordering node service 284 to update the ledger, the application determines whether the specified endorsement policy has been implemented (i.e., whether all peer nodes required for the transaction endorse the transaction) before submission. Here, the client may include only one of the multiple parties to the transaction. In this case, each client may have its own endorsing node, and each endorsing node needs to endorse the transaction. The architecture is such that even if the application chooses not to check the response or otherwise forward unendorsed transactions, the endorsement policy will still be enforced by the peers and maintained during the submission verification phase.

[0059] After successful checks, in step 293, client 260 assembles the endorsements into a transaction and broadcasts the transaction proposal and response within a transaction message to ordering node 284. The transaction may contain read / write sets, endorsement peer signatures, and channel IDs. Ordering node 284 does not need to check the entire contents of a transaction in order to perform its operations, but rather ordering node 284 can simply receive transactions from all channels in the network, sort them chronologically by channel, and create a transaction block for each channel.

[0060] The block of transactions is passed from the ordering node 284 to all peer nodes 281-283 on the channel. Transactions 294 within the block are validated to ensure that any endorsement policies are satisfied and that the ledger state of the read set variables has not changed since the transaction execution generated the read set. The transactions in the block are marked as valid or invalid. In addition, in step 295, each peer node 281-283 appends the block to the channel's chain and, for each valid transaction, commits the write set to the current state database. An event is emitted to notify the client application that the transaction (call) has been immutably attached to the chain and notifies whether the transaction was validated or invalid.

[0061] Figure 3A An example of a permissioned blockchain network 300 is shown, featuring a distributed, decentralized peer-to-peer architecture. In this example, a blockchain user 302 can initiate a transaction to a permissioned blockchain 304. In this example, a transaction can be a deployment, call, or query, and can be issued directly by a client application utilizing an SDK. The network can provide access to regulators 306 such as auditors. The blockchain network operator 308 manages member permissions, such as registering regulators 306 as "auditors" and registering blockchain users 302 as "clients." Auditors may be limited to querying the ledger, while clients may be authorized to deploy, call, and query certain types of chaincodes.

[0062] Blockchain developers 310 can write chaincodes and client applications. Blockchain developers 310 can deploy chaincodes directly to the network through an interface. In order to include credentials from traditional data sources 312 in the chaincode, developers 310 can use out-of-band connections to access the data. In this example, blockchain users 302 connect to the permissioned blockchain 304 through peer nodes 314. Before conducting any transactions, peer nodes 314 retrieve the user's registration and transaction certificates from the certificate authority 316 that manages user roles and permissions. In some cases, blockchain users must possess these digital certificates in order to conduct transactions on the permissioned blockchain 304. At the same time, users who attempt to use chaincodes may be required to verify their credentials on traditional data sources 312. In order to confirm the user's authorization, the chaincode can use an out-of-band connection to this data through a traditional processing platform 318.

[0063] Figure 3B Another example of a permissioned blockchain network 320 is shown, featuring a distributed, decentralized peer-to-peer architecture. In this example, a blockchain user 322 can submit a transaction to a permissioned blockchain 324. In this example, a transaction can be a deployment, call, or query, and can be issued directly through an API or the like by a client application utilizing an SDK. The network can provide access to regulators 326 such as auditors. The blockchain network operator 328 manages member permissions, such as registering regulators 326 as "auditors" and registering blockchain users 322 as "clients." Auditors may be limited to querying the ledger, while clients may be authorized to deploy, call, and query certain types of chaincodes.

[0064] Blockchain developers 330 write chaincodes and client applications. Blockchain developers 330 can deploy chaincodes directly to the network through an interface. To include credentials from a traditional data source 332 in the chaincode, developers 330 can use out-of-band connections to access the data. In this example, blockchain users 322 connect to the network through peer nodes 334. Before conducting any transactions, peer nodes 334 retrieve the user's registration and transaction certificates from certificate authorities 336. In some cases, blockchain users must possess these digital certificates in order to conduct transactions on the permissioned blockchain 324. At the same time, users attempting to use chaincodes may be required to verify their credentials on traditional data sources 332. To confirm the user's authorization, the chaincode can use an out-of-band connection to this data through a traditional processing platform 338.

[0065] In some embodiments, the blockchain herein may be a permissionless blockchain. In contrast to requiring permission to join a permissioned blockchain, anyone can join a permissionless blockchain. For example, to join a permissionless blockchain, a user can create a personal address and begin interacting with the network by submitting transactions and thereby adding entries to the ledger. In addition, all parties may choose to run nodes on the system and employ a mining protocol to help validate transactions.

[0066] Figure 3C A process 350 of a transaction being processed by a permissionless blockchain 352 including a plurality of nodes 354 is shown. A sender 356 wishes to send a payment or some other form of value (e.g., a deed, medical record, contract, good, service, or any other asset that can be encapsulated in a digital record) to a receiver 358 via the permissionless blockchain 352. In one embodiment, each of the sender device 356 and the receiver device 358 may have a digital wallet (a blockchain associated with the blockchain 352) that provides user interface controls and a display of transaction parameters. In response, the transaction is broadcast to the nodes 354 throughout the blockchain 352. Based on the network parameters of the blockchain 352, the nodes validate 360 ​​the transaction based on rules established by the creator of the permissionless blockchain 352 (which may be predefined or dynamically assigned). For example, this may include verifying the identities of the parties involved, etc. The transaction may be validated immediately, or it may be placed in a queue with other transactions, and the nodes 354 determine whether the transaction is valid based on a set of network rules.

[0067] In structure 362, valid transactions form a block and are sealed with a lock (hash). This process can be performed by a mining node among nodes 354. The mining node can utilize additional software specifically for mining and creating blocks for the permissionless blockchain 352. Each block can be identified by a hash (e.g., a 256-bit number, etc.) created using an algorithm agreed upon by the network. Each block may include a header, a pointer or reference to the hash of the previous block header in the chain, and a set of valid transactions. The reference to the previous block hash is associated with the creation of a secure independent blockchain.

[0068] Before a block can be added to the blockchain, it must be validated. Validation of the permissionless blockchain 352 may include proof of work (PoW), which is the solution to a puzzle derived from the block header. Figure 3C It is not shown in the example, but another process used to verify blocks is proof-of-stake. Unlike proof-of-work, the algorithm rewards miners who solve mathematical problems with proof-of-stake, and the creators of new blocks are selected in a deterministic manner based on their wealth (also known as "stake"). Then, similar proofs are performed by the selected nodes.

[0069] With mining 364, nodes attempt to solve the block by making incremental changes to a variable until the solution meets a network-wide goal. This creates PoW, which ensures the correct answer. In other words, a potential solution must prove that computational resources were expended on solving the problem. In some types of permissionless blockchains, miners may be rewarded with value (such as coins, etc.) for correctly mining a block.

[0070] Here, the PoW process, along with the chain of blocks, makes modification of the blockchain extremely difficult, as an attacker must modify all subsequent blocks in order for a modification to one block to be accepted. Furthermore, as new blocks are mined, the difficulty of modifying a block increases, and the number of subsequent blocks also increases. Successfully validated blocks are distributed through the permissionless blockchain 352 via distribution 366, and all nodes 354 add the block to the majority chain, which is the audit ledger of the permissionless blockchain 352. Additionally, the value in the transaction submitted by the sender 356 is deposited or otherwise transferred to the digital wallet of the recipient device 358.

[0071] Figure 4A FIG. 4 shows the architecture of a peer node 400 in which a trace collection module 406 is executed according to an example embodiment. Figure 4A , a privileged (protected) trace collection module 406 may be implemented and executed by each peer to collect traces of system calls from chaincodes 402 and 403 to the operating system as evidence of correct execution over a period of time. Here, the peer node 400 may include peer node software 401 for integration with the blockchain network, and chaincodes (e.g., chaincodes 402, 403, etc.) that may be called to access ledger data and execute any necessary business logic of the peer node 400. The peer node software 401 and chaincodes 402 and 403 may be executed within the runtime 404 of the peer node 400. The chaincodes 402 and 403 may request services (system calls) from the operating system kernel 405 of the operating system on which the chaincodes 402 and 403 are executed. The hardware layer 407 may include the physical components required to run the peer node software 401, the chaincodes 402 and 403, the operating system 405, and the trace collection module 406.

[0072] According to various embodiments, the trace collection module 406 can collect system calls made by the chaincodes 402 and 403 with respect to the operating system 405. The trace collection module 406 can be a small module on the peer node 400 that has hypervisor privileges to protect runtime integrity, captures chaincode information from the operating system 405, and collects system call traces from the chaincodes 402 and 403 at runtime during analysis. Figure 4ANot shown, but the hardware 407 may include a trusted platform module within the hardware 407 to ensure that the correct version of the operating system and the trace collection module 406 are running on the peer node 400.

[0073] The trace collection module 406 may be bound to a subsystem running on a peer node. Using this binding, the trace collection module 406 may collect all system calls made by the business logic of the chaincodes 402 and 403. The collected calls may include any system calls made by the chaincode container. Some non-limiting examples of system calls include access, alert, bind, break (brk), close, connect, create, poll (epoll), fdatasync, fork, listen, poll, read, etc., as well as get commands, set commands, etc.

[0074] The trace collection module 406 on each peer can independently collect call traces and then periodically submit encrypted copies of the traces to the bad behavior detection chaincode 412 executed on the arbitrator node 410 after a period of time (called a round). In each round, the trace collection module 406 can generate a random round key for encrypting the trace. The collected system calls are collected and encrypted. In addition, the trace collection module 406 can transmit the encrypted system calls along with the random round key to the bad behavior detection chaincode 412 (to decrypt the encrypted traces). This two-step process can be performed so that bad behavior peers cannot view traces submitted by other peers and cannot submit them as themselves, which prevents Sybil attacks.

[0075] The bad behavior detection chaincode 412 looks at each trace and creates a graph containing information about the number of times (frequency) each unique system call was executed by a specific peer. Figure 4B An example of a bad behavior detection chaincode 412 is shown that creates a system call graph 430. Here, four peers A, B, C, and D are part of a common endorsement process and a shared chaincode is used to implement such an endorsement process. Here, the trace collection module on each of the four peers sends system call traces 421, 422, 423, and 424 corresponding to system calls collected from peers A, B, C, and D during a predetermined time period including the endorsement process.

[0076] According to various embodiments, the bad behavior detection chaincode 412 may analyze the system calls within the traces 421, 422, 423, and 424, and identify which system calls are shared by a predetermined amount of peer nodes. For example, the bad behavior detection chaincode 412 may identify any system call executed by a majority of peer nodes as a required system call necessary to execute the endorsement process through the chaincode. The bad behavior detection chaincode 412 may establish a system call graph 430 that includes only the set of system calls associated with the endorsement process implemented through the shared chaincode between peers AD. Once the bad behavior detection chaincode 412 has created the system call graph 430, the bad behavior detection chaincode may use the system call graph 430 to identify any bad behavior nodes that do not execute the set of system calls.

[0077] For example, as a previous step, the arbitrator 410 (bad behavior detection chaincode 412) can identify endorser nodes (peers AD) from the blockchain ledger and receive system calls only from those nodes. For each separate set of transactions (performed by some of the same set of peers), the bad behavior detection chaincode 412 can establish a frequency graph (i.e., how many times each peer executed each system call to all peers executing that particular set of transactions). The bad behavior detection chaincode 412 can create a majority set that contains calls made by at least a majority (or other predetermined number) of the peers AD that executed transactions in each frequency graph. This majority set can be called a system call graph 430.

[0078] refer to Figure 4C , the bad behavior detection chaincode 412 can perform process 450 to detect whether any peer fails to fully contribute to the endorsement process. For example, if the system call graph 430 includes a true subset of the set of calls made by the peer, the peer must have executed the transaction and is therefore honest, otherwise it is lying. In this example, peers A, B, and C each include a system call within the system call graph 430. Therefore, these peers contribute honestly and completely. However, because peer D's system call 424 misses system call 432 from the system call graph 430, peer D is determined to be acting dishonestly (free riding). In response, the arbitrator 410 can generate a warning or alarm and send the alarm to a user interface 440 of a management device, client, peer node, etc. In addition, notifications of bad behavior peers can be stored in a blockchain, off-chain storage, etc.

[0079] Figure 5 A method 500 of identifying a free-ride node within a blockchain network is shown according to an example embodiment. Figure 5At 510, the method may include receiving system calls captured from a plurality of peer nodes of a blockchain that occurred within a predetermined time period. For example, the system calls may be independently captured by the plurality of peer nodes based on a chaincode trace that is typically run on the plurality of peer nodes. The system calls may be independently detected by corresponding trace modules on the peer nodes and forwarded to an aggregator system such as an arbitrator.

[0080] At 520, the method may include determining a subset of system calls among the received system calls that correspond to blockchain processes executed during a predetermined time period. For example, the determination may include determining a subset of system calls executed by more than a predetermined number (e.g., a majority, etc.) of peer nodes within the predetermined time period. In some embodiments, the determination may include generating a graph that identifies how many peer nodes executed each system call among the system calls, and identifying the subset of system calls based on the graph. In some embodiments, the identification may include identifying system calls executed by a majority of peer nodes as the subset of system calls.

[0081] In 530, the method may include detecting a free-riding peer node from the plurality of peer nodes based on a subset of identified system calls relative to the free-riding peer node's system calls within a predetermined time period, and in 540, the method may include storing an indicator of the free-riding peer node. Here, the system may compare the system call graph of the free-riding node with a graph generated from all nodes and identify one or more missing calls. In some embodiments, the method may also include generating and displaying an alert via a user interface in response to detecting the free-riding peer node. In some embodiments, the detection may include detecting the presence of the free-riding peer node in response to detecting a failure of the free-riding peer node to execute a system call from the subset of identified system calls. In some embodiments, detecting the free-riding peer node is performed via an identification chaincode of bad behavior.

[0082] Fig. 6A An example system 600 is shown including a physical infrastructure 610 configured to perform various operations according to an example embodiment. Fig. 6A, the physical infrastructure 610 includes a module 612 and a module 614. The module 614 includes a blockchain 620 and a smart contract 630 (which may reside on the blockchain 620), and may perform any operation step 608 (in the module 612) included in any example embodiment. The step / operation 608 may include one or more embodiments described, and may represent output or written information written or read from one or more smart contracts 630 and / or blockchain 620. The physical infrastructure 610, the module 612, and the module 614 may include one or more computers, servers, processors, memories, and / or wireless communication devices. In addition, the module 612 and the module 614 may be the same module.

[0083] Figure 6B Another example system 640 configured to perform various operations according to an example embodiment is shown. Figure 6B , system 640 includes module 612 and module 614. Module 614 includes blockchain 620 and smart contract 630 (which may be located on blockchain 620), and may perform any operation step 608 (in module 612) included in the example embodiment. Step / operation 608 may include one or more embodiments described, and may represent output or written information written or read from one or more smart contracts 630 and / or blockchain 620. Physical infrastructure 610, module 612, and module 614 may include one or more computers, servers, processors, memories, and / or wireless communication devices. In addition, module 612 and module 614 may be the same module.

[0084] Figure 6C An example system configured to utilize a smart contract between contracting parties and an intermediary server configured to enforce the terms of the smart contract on a blockchain are shown according to an example embodiment. Figure 6C , configuration 650 may represent a communication session, asset transfer session, or process driven by a smart contract 630, which explicitly identifies one or more user devices 652 and / or 656. The results of the smart contract execution may be managed by a server 654. The contents of the smart contract 630 may need to be digitally signed by one or more of the entities 652 and 656 that are parties to the smart contract transaction. The results of the smart contract execution may be written to the blockchain 620 as a blockchain transaction. The smart contract 630 resides on the blockchain 620, which may reside on one or more computers, servers, processors, memories, and / or wireless communication devices.

[0085] Fig.6D A system 660 including a blockchain is shown according to an example embodiment. Fig.6DIn the example of , an application programming interface (API) gateway 662 provides a public interface for accessing blockchain logic (e.g., smart contracts 630 or other chaincodes) and data (e.g., distributed ledgers, etc.). In this example, the API gateway 662 is a public interface for executing transactions (calls, queries, etc.) on the blockchain by connecting one or more entities 652 and 656 to blockchain peers (i.e., servers 654). Here, the server 654 is a blockchain network peer component that holds a copy of the world state and the distributed ledger, allowing clients 652 and 656 to query data about the world state and submit transactions to the blockchain network, where, depending on the smart contract 630 and the endorsement policy, the endorsement peer will run the smart contract 630.

[0086] The above embodiments may be implemented in hardware, a computer program executed by a processor, firmware, or a combination thereof. The computer program may be embodied on a computer-readable medium such as a storage medium, for example, the computer program may reside in a random access memory ("RAM"), flash memory, read-only memory ("ROM"), erasable programmable read-only memory ("EPROM"), electrically erasable programmable read-only memory ("EEPROM"), registers, a hard disk, a removable disk, a compact disk read-only memory ("CD-ROM"), or any other form of storage medium known in the art.

[0087] An exemplary storage medium may be coupled to a processor so that the processor can read information from the storage medium and write information to the storage medium. Alternatively, the storage medium may be integrated with the processor. The processor and the storage medium may reside in an application specific integrated circuit ("ASIC"). In an alternative, the processor and the storage medium may reside as discrete components.

[0088] Fig. 7A A process 700 for adding a new block to a distributed ledger 720 is shown according to an example embodiment, and Figure 7B The content of a new data block structure 730 for a blockchain according to an example embodiment is shown. Fig. 7A, a client (not shown) can submit a transaction to blockchain nodes 711, 712, and / or 713. A client can be an instruction received from any source for enacting an activity on blockchain 720. As an example, a client can be an application that proposes a transaction for a blockchain on behalf of a requester (e.g., a device, an individual, or an entity). Multiple blockchain peers (e.g., blockchain nodes 711, 712, and 713) can maintain the state of the blockchain network and a copy of the distributed ledger 720. Different types of blockchain nodes / peers can exist in the blockchain network, including endorsement peers that simulate and endorse transactions proposed by clients and submission peers that verify endorsements, verify transactions, and submit transactions to the distributed ledger 720. In this example, blockchain nodes 711, 712, and 713 can act as endorser nodes, submitter nodes, or both.

[0089] The distributed ledger 720 includes a blockchain that stores immutable, sequential records in blocks and a state database 724 (current world state) that maintains the current state of the blockchain 722. There can be one distributed ledger 720 per channel, and each peer maintains a copy of its own distributed ledger 720 for each channel it belongs to. The blockchain 722 is a transaction log structured as hash-linked blocks, where each block contains a sequence of N transactions. A block may include Figure 7B The various components shown. Block links ( Fig. 7A ) can be generated by adding the hash value of the previous block header in the block header of the current block. In this way, all transactions on the blockchain 722 are ordered and cryptographically linked together to prevent tampering with the blockchain data without breaking the hash link. In addition, due to the link, the latest block in the blockchain 722 represents every transaction that came before it. The blockchain 722 can be stored on a peer-to-peer file system (local or attached storage), which supports append-only blockchain workloads.

[0090] The current state of the blockchain 722 and the distributed ledger 722 may be stored in a state database 724. Here, the current state data represents the latest values ​​of all keys ever included in the chain transaction log of the blockchain 722. Chaincode invocations execute transactions against the current state in the state database 724. In order to make these chaincode interactions very efficient, the latest values ​​of all keys are stored in the state database 724. The state database 724 may include an indexed view into the transaction log of the blockchain 722, so it can be regenerated from the chain at any time. The state database 724 may be automatically restored (or generated when needed) at the initiation of a peer before accepting a transaction.

[0091] The endorsing node receives the transaction from the client and endorses the transaction based on the simulation results. The endorsing node holds the smart contract that simulates the transaction proposal. When the endorsing node endorses the transaction, the endorsing node creates a transaction endorsement that is a signed response from the endorsing node to the client application, indicating the endorsement of the simulated transaction. The method of endorsing the transaction depends on the endorsement policy that can be specified in the chaincode. An example of an endorsement policy is "a majority of endorsing peers must endorse the transaction". Different channels may have different endorsement policies. The client application forwards the endorsed transaction to the sorting service 710.

[0092] The ordering service 710 accepts endorsed transactions, orders them into a block, and delivers the blocks to commit peers. For example, when a transaction threshold has been reached, a timer has expired, or other conditions, the ordering service 710 may initiate a new block. Fig. 7A In the example of , blockchain node 712 is a submitting peer that has received new data new data block 730 for storage on blockchain 720. The first block in a blockchain can be called a genesis block, including information about the blockchain, its members, the data stored therein, etc.

[0093] The sorting service 710 may consist of a cluster of sorters. The sorting service 710 does not process transactions, smart contracts, or maintain a shared ledger. Instead, the sorting service 710 may accept endorsed transactions and specify the order in which these transactions are submitted to the distributed ledger 720. The architecture of the blockchain network may be designed to make the "sorting" (e.g., Solo, Kafka, BFT, etc.) a pluggable component.

[0094] Transactions are written to the distributed ledger 720 in a consistent order. The order of transactions is established to ensure that updates to the state database 724 are valid when submitted to the network. Unlike cryptocurrency blockchain systems (e.g., Bitcoin, etc.) where ordering is performed by solving cryptographic puzzles or mining, in this example, the parties to the distributed ledger 720 can choose the ordering mechanism that best suits the network.

[0095] When the ordering service 710 initializes a new data block 730, the new data block 730 may be broadcast to the committing peers (e.g., blockchain nodes 711, 712, and 713). In response, each committing peer verifies the transaction in the new data block 730 by checking to ensure that the read set and the write set still match the current world state in the state database 724. Specifically, the committing peer may determine whether the read data that existed when the endorser simulated the transaction is the same as the current world state in the state database 724. When the committing peer verifies the transaction, the transaction is written to the blockchain 722 on the distributed ledger 720, and the state database 724 is updated with the write data in the read-write set. If the transaction fails, that is, if the committing peer finds that the read-write set does not match the current world state in the state database 724, then the transaction ordered into the block will still be included in the block but it will be marked as invalid, and the state database 724 will not be updated.

[0096] Reference Figure 7B , a new data block 730 (also referred to as a data block) stored on the blockchain 722 of the distributed ledger 720 may include multiple data segments, such as a block header 740, block data 750, and block metadata 760. It should be understood that Figure 7B The various blocks and their contents shown in the figure, such as the new data block 730 and its contents, are merely examples and are not meant to limit the scope of the example embodiments. The new data block 730 may store transaction information for N transactions (e.g., 1, 10, 100, 500, 1000, 2000, 3000, etc.) within the block data 750. The new data block 730 may also include: a link to a previous block within the block header 740 (e.g., Fig. 7A In particular, the block header 740 may include a hash of a previous block header. The block header 740 may also include a unique block number, a hash of the block data 750 of the new data block 730, and the like. The block number of the new data block 730 may be unique and may be assigned in various sequences, such as increments / sequences starting from zero.

[0097] The block data 750 may store transaction information for each transaction recorded within the new data block 730. For example, the transaction data may include one or more of the following: type of transaction, version, timestamp, channel ID of the distributed ledger 720, transaction ID, epoch, payload visibility, chaincode path (deploy TX), chaincode name, chaincode version, inputs (chaincode and function), client (creator) and other identifying public keys and certificates, client signatures, identity of endorsers, endorser signatures, proposal hashes, chaincode events, response status, namespaces, read sets (keys and versions read by the transaction record, etc.), write sets (lists of keys and values, etc.), start keys, end keys, key lists, Merkle tree query digests, etc. The transaction data may be stored for each of the N transactions.

[0098] The block metadata 760 may store multiple fields of metadata (e.g., as a byte array, etc.). The metadata fields may include a signature at the time of block creation, a reference to the last configuration block, a transaction filter that identifies valid and invalid transactions within the block, the last offset duration of the sorting service that sorts the block, etc. The signature, the last configuration block, and the sorter metadata may be added by the sorting service 710. At the same time, the submitter of the block (e.g., blockchain node 712) may add validity / invalidity information based on endorsement policies, verification of read / write sets, etc. The transaction filter may include a byte array of size equal to the number of transactions in the block data 750 and a verification code that identifies whether the transaction is valid / invalid.

[0099] Figure 7C An embodiment of a blockchain 770 for digital content according to embodiments described herein is shown. Digital content may include one or more files and related information. Files may include media, images, video, audio, text, links, graphics, animations, web pages, documents, or other forms of digital content. The immutable, append-only aspect of the blockchain may serve as a safeguard to protect the integrity, validity, and authenticity of the digital content, making it suitable for use in legal proceedings where admissibility rules apply, or in other contexts where it is desirable to present and use digital information in cases where evidence is considered or otherwise available. In such cases, the digital content may be referred to as digital evidence.

[0100] The blockchain can be formed in a variety of ways. In one embodiment, digital content can be included in the blockchain and can be accessed from it. For example, each block of the blockchain can store a hash value of reference information (e.g., header, value, etc.) along with the associated digital content. The hash value and the associated digital content can then be encrypted together. Therefore, the digital content of each block can be accessed by decrypting each block in the blockchain, and the hash value of each block can be used as a basis for referencing the previous block. It can be illustrated as follows:

[0101]

[0102] In one embodiment, the digital content may not be included in the blockchain. For example, the blockchain may store a cryptographic hash of the content of each block without any digital content. The digital content may be stored in another storage area or memory address in association with the hash value of the original file. The other storage area may be the same storage device used to store the blockchain, or it may be a different storage area, or even a separate relational database. The digital content of each block may be referenced or accessed by obtaining or querying the hash value of the block of interest, and then looking up a value with a value in the storage area stored corresponding to the actual digital content. For example, a database gatekeeper may be implemented. It may be illustrated as follows:

[0103]

[0104] exist Figure 7C In the example embodiment of the present invention, the blockchain 770 includes a plurality of blocks 7781, 7782, ..., 7783 that are cryptographically linked in an ordered sequence. N , where N ≥ 1. Used to link blocks 7781, 7782, ..., 778 N The encryption of can be any one of a number of keyed or non-keyed hash functions. In one embodiment, blocks 7781, 7782, ..., 778 N Processing is performed using a hash function that produces an n-bit alphanumeric output (where n is 256 or another number) from an input based on the information in the block. Examples of such hash functions include, but are not limited to, SHA-type (SHA stands for Secure Hash Algorithm) algorithms, Merkle-Damgard algorithms, HAIFA algorithms, Merkle-tree algorithms, random number-based algorithms, and non-collision-resistant PRF algorithms. In another embodiment, blocks 7781, 7782, ..., 778 can be cryptographically linked by a function different from a hash function. N For purposes of illustration, the following description is made with reference to a hash function such as SHA-2.

[0105] Each block in the blockchain is 7781, 7782, ..., 778 N Includes a header, a file version, and a value. Due to the hashing operation in the blockchain, the header and value are different for each block. In one embodiment, the value may be included in the header. As described in more detail below, the version of the file may be the original file or a different version of the original file.

[0106] The first block 7781 in the blockchain is called the genesis block and includes a header 7721, an original file 7741, and an initial value 7761. The hashing scheme used in the genesis block and in fact in all subsequent blocks can vary. For example, all the information in the first block 7781 can be hashed together at once, or each piece of information or a portion of the information in the first block 7781 can be hashed separately, and then the separately hashed portions can be hashed.

[0107] The header 7721 may include one or more initial parameters, such as a version number, timestamp, random number, root information, difficulty level, consensus protocol, duration, media format, source, descriptive keywords, and / or other information related to the original file 7741 and / or the blockchain. The header 7721 may be generated automatically (e.g., by blockchain network management software) or may be manually generated by a blockchain participant. NUnlike the header in , header 7721 in the genesis block does not reference a previous block, simply because there is no previous block.

[0108] The original file 7741 in the origin block can be, for example, data captured by a device, which may or may not be processed before the device is included in the blockchain. The original file 7741 is received from a device, a media source, or a node through an interface of the system. The original file 7741 is associated with metadata, which can be manually or automatically generated by a user, a device, and / or a system processor, for example. The metadata can be included in the first block 7781 in association with the original file 7741.

[0109] The value 7761 in the origin block is an initial value generated based on one or more unique attributes of the original file 7741. In one embodiment, the one or more unique attributes may include a hash value of the original file 7741, metadata of the original file 7741, and other information associated with the file. In one embodiment, the initial value 7761 may be based on the following unique attributes:

[0110] 1) SHA-2 calculates the hash value of the original file

[0111] 2) Originating device ID

[0112] 3) The start timestamp of the original file

[0113] 4) The original storage location of the original file

[0114] 5) The blockchain network member ID for the software that currently controls the original file and associated metadata

[0115] Other blocks in the blockchain 7782 to 778 N It also has a header, a file, and a value. However, unlike the first block 7721, the headers 7722 to 772 N Each of the blocks includes the hash value of the immediately preceding block. The hash value of the preceding block may be just the hash of the header of the preceding block, or may be the hash value of the entire preceding block. By including the hash value of the preceding block in each of the remaining blocks, it is possible to go back from the Nth block to the origin block (and the associated original file) block by block, as shown by arrow 780, to establish an auditable and unchangeable chain of custody.

[0116] Headers 7722 to 772 in other blocks N Each of the may also include other information, such as a version number, a timestamp, a random number, root information, a difficulty level, a consensus protocol, and / or other parameters or information associated with the corresponding file and / or the general blockchain.

[0117] Files 7742 to 774 in other blocks NThe original file may be equal to the original file, or may be a modified version of the original file in the originating block, for example, depending on the type of processing performed. The type of processing performed may vary from block to block. The processing may include, for example, any modification of the file in a previous block, such as editing information or otherwise changing the contents of the file, taking information away from the file, or adding or appending information to the file.

[0118] Additionally or alternatively, processing may include merely copying a file from a previous block, changing a storage location of a file, analyzing a file from one or more previous blocks, moving a file from one storage or memory location to another, or performing operations relative to the blockchain file and / or its associated metadata. Processing involving analyzing a file may include, for example, appending, including, or otherwise associating various analytical, statistical, or other information associated with the file.

[0119] Each of the other blocks 7762 to 776 N The values ​​in a block are unique values ​​and are all different due to the processing performed. For example, the value in any one block corresponds to an updated version of the value in the previous block. The update is reflected in the hash of the block to which the value was assigned. The value of the block thus provides an indication of what processing was performed in the block and also allows tracing back to the original file through the blockchain. This trail confirms the chain of custody of the file throughout the blockchain.

[0120] For example, consider a situation where portions of a file in a previous block are redacted, masked, or pixelated to protect the identity of the person appearing in the file. In this case, the block that includes the redacted file will include metadata associated with the redacted file, such as how the redaction was performed, who performed the redaction, a timestamp of when the redaction was performed, etc. The metadata may be hashed to form a value. Because the metadata for this block is different than the information that was hashed to form the value in the previous block, the values ​​are distinct from one another and can be recovered upon decryption.

[0121] In one embodiment, when any one or more of the following occurs, the value of the previous block can be updated (e.g., a new hash value is calculated) to form the value of the current block. In this example embodiment, a new hash value can be calculated by hashing all or part of the information described below.

[0122] a) The new SHA-2 calculated hash value, if the file has been manipulated in any way (for example, if the file has been edited, copied, changed, accessed, or other actions have been taken)

[0123] b) New storage location for the file

[0124] c) Determine new metadata associated with the file

[0125] d) Transferring access to or control of a file from one blockchain participant to another

[0126] Fig.7D An embodiment of a block that can represent the structure of a block in blockchain 790 is shown according to one embodiment. i Including head 772 i 、File 774 i The sum is 776 i .

[0127] Head 772 i Including the previous block Blocki i-1 The hash value and additional reference information of the previous block, which can be any type of information discussed in this article (e.g., header information including references, features, parameters, etc.). Of course, all blocks except the origin block reference the hash of the previous block. The hash value of the previous block can be just the hash of the previous block header, or it can be the hash of all or part of the information in the previous block, including files and metadata.

[0128] File 774 i The system includes a plurality of data, such as data 1, data 2, ..., data N. The data are marked with metadata metadata 1, metadata 2, ..., metadata N, which describe the content and / or characteristics associated with the data. For example, the metadata of each data may include a timestamp indicating the data, processing data, keywords indicating a person or persons described in the data or other content, and / or other characteristics that may be helpful in determining the validity and content of the entire file, especially using digital evidence, for example, as described in the embodiments discussed below. In addition to the metadata, each data may be marked with reference REF1, REF2, ..., REF N Marking to previous data to prevent tampering, gaps in the file, and sequential reference through the file.

[0129] Once metadata is assigned to data (e.g., by a smart contract), it cannot be changed without changing the hash, which can be easily identified as invalid. Metadata thus creates a data log of information that can be accessed by participants in the blockchain for use.

[0130] Value 776 i is a hash value or other value calculated based on any of the types of information discussed previously. For example, for any given block i, the value of the block can be updated to reflect the processing performed on the block, such as a new hash value, a new storage location, new metadata for the associated file, a transfer of control or access rights, an identifier, or other operations or information to be added. Although the value in each block is shown separate from the metadata for the file and header data, in another embodiment, the value can be based in part or in whole on the metadata.

[0131] Once the blockchain 770 is formed, at any point in time, an immutable chain of custody for a file can be obtained by querying the blockchain for the transaction history of values ​​across blocks. The query or trace process can begin by decrypting the value of the currently included block (e.g., the last (Nth) block), and then continue to decrypt the values ​​of other blocks until the origin block is reached and the original file is restored. Decryption can also include decrypting the header and file and associated metadata at each block.

[0132] Decryption is performed based on the type of encryption that occurs in each block. This may involve the use of private keys, public keys, or public-private key pairs. For example, when asymmetric encryption is used, a blockchain participant or processor in the network can use a predetermined algorithm to generate a public and private key pair. The public and private keys are related to each other through some mathematical relationship. The public key can be publicly distributed to be used as an address to receive messages from other users, for example, an IP address or a home address. The private key is kept secret and is used to digitally sign messages sent to other blockchain participants. The signature is included in the message so that the recipient can verify it using the sender's public key. In this way, the recipient can be sure that only the sender can send this message.

[0133] Generating a key pair can be similar to creating an account on the blockchain, but without having to actually register anywhere. In addition, the sender uses the private key to digitally sign each transaction performed on the blockchain. The signature ensures that only the account owner can trace and process (if within the scope of permission determined by the smart contract) the blockchain file.

[0134] Fig. 8A and 8B Other examples of blockchain use cases that can be incorporated and used here are shown. In particular, Fig. 8A An example 800 of a blockchain 810 storing machine learning (artificial intelligence) data is shown. Machine learning relies on large amounts of historical data (or training data) to build predictive models to make accurate predictions about new data. Machine learning software (such as neural networks, etc.) can often sift through millions of records to mine non-intuitive patterns.

[0135] exist Fig. 8AIn the example of , host platform 820 builds and deploys a machine learning model for predictive monitoring of asset 830. Here, host platform 820 may be a cloud platform, an industrial server, a web server, a personal computer, a user device, etc. Asset 830 may be any type of asset (e.g., a machine or equipment, etc.), such as an airplane, a locomotive, a turbine, medical machinery and equipment, oil and gas equipment, a ship, a vessel, a vehicle, etc. As another example, asset 830 may be a non-tangible asset, such as a stock, currency, a digital coin, insurance, etc.

[0136] The blockchain 810 can be used to significantly improve the training process 802 of the machine learning model and the prediction process 804 based on the trained machine learning model. For example, in 802, instead of data being collected by data scientists / engineers or other users, historical data can be stored on the blockchain 810 by the asset 830 itself (or through an intermediary, not shown). This can significantly reduce the collection time required by the host platform 820 when performing predictive model training. For example, using smart contracts, data can be directly and reliably transmitted directly from its source location to the blockchain 810. By using the blockchain 810 to ensure the security and ownership of the collected data, the smart contract can send data directly from the smart contract. Individual assets that use this data to build machine learning models. This allows data to be shared between assets 830.

[0137] The collected data can be stored in the blockchain 810 based on a consensus mechanism. The consensus mechanism introduces (permitted nodes) to ensure that the recorded data is verified and accurate. The recorded data is time-stamped, cryptographically signed, and immutable. Therefore, it is auditable, transparent, and secure. In some cases (such as supply chain, healthcare, logistics, etc.), adding IoT devices that write directly to the blockchain can increase the frequency and accuracy of recorded data.

[0138] In addition, training the machine learning model on the collected data by the host platform 820 can be carried out for several rounds of improvement and testing. Each round can be based on additional data or data that was not previously considered to help expand the knowledge of the machine learning model. In 802, the host platform 820 can store the different training and testing steps (and the data associated therewith) on the blockchain 810. Each refinement of the machine learning model (e.g., changes in variables, weights, etc.) can be stored on the blockchain 810. This provides verifiable evidence about how the model was trained and what data was used to train the model. In addition, when the host platform 820 has obtained the final trained model, the resulting model can be stored on the blockchain 810.

[0139] After the model is trained, it can be deployed in a real environment, and predictions / decisions can be made based on the execution of the final trained machine learning model. For example, in 804, the machine learning model can be used for condition-based maintenance (CBM) of assets such as aircraft, wind turbines, healthcare machines, etc. In this example, data fed back from the asset 830 can be input into the machine learning model and used to make event predictions, such as failure events, error codes, etc. The determination made by executing the machine learning model on the host platform 820 can be stored on the blockchain 810 to provide auditable / verifiable evidence. As a non-limiting example, the machine learning model can predict a future failure / error of a part of the asset 830 and create an alert or notification to replace the part. The data behind the decision can be stored on the blockchain 810 by the host platform 820. In one embodiment, the features and / or actions described and / or depicted herein can occur on or with respect to the blockchain 810.

[0140] New transactions for a blockchain can be collected together into a new block and added to an existing hash. This is then encrypted to create a new hash for the new block. This is added to the next list of transactions after encryption, and so on. The result is a chain of blocks, with each block containing the hashes of all the previous blocks. The computers storing these blocks periodically compare their hashes to make sure they all agree. Any computer that disagrees will discard the record that caused the problem. This method is useful for ensuring that the blockchain is tamper-proof, but it is not perfect.

[0141] One way to game the system is for a dishonest user to change the transaction list to their liking, but keep the hash the same. This can be done by brute force, in other words, by changing the record, encrypting the result, and seeing if the hash is the same. If not, it is tried again and again until a matching hash is found. The security of the blockchain is based on the belief that ordinary computers can only perform such brute force attacks in completely unrealistic timescales (such as the age of the universe). In contrast, quantum computers are much faster (thousands of times faster) and therefore pose a much greater threat.

[0142] Figure 8B An example 850 of a quantum-safe blockchain 852 is shown, implementing quantum key distribution (QKD) to protect against quantum computing attacks. In this example, blockchain users can use QKD to verify each other's identities. It uses quantum particles such as photons to send information, which cannot be copied by an eavesdropper without destroying them. In this way, senders and receivers through the blockchain can be sure of each other's identities.

[0143] exist Figure 8BIn the example, there are four users 854, 856, 858, and 860. Each of the paired users can share a secret key 862 (i.e., QKD) between them. Since there are four nodes in this example, there are six pairs of nodes, so six different private keys 862 are used, including QKDAB, QKDAC, QKDAD, QKDBC, QKDBD, and QKDCD. Each pair can create a QKD by sending information using quantum particles (such as photons), which cannot be copied by an eavesdropper without destroying them. In this way, a pair of users can determine each other's identity.

[0144] The operation of blockchain 852 is based on two processes (i) creating transactions, and (ii) building blocks that aggregate new transactions. New transactions can be created similar to traditional blockchain networks. Each transaction can contain information about the sender, the receiver, the creation time, the amount (or value) to be transferred, a list of reference transactions that prove that the sender has sufficient funds for the operation, etc. This transaction record is then sent to all other nodes and entered into a pool of unconfirmed transactions. Here, two parties (i.e., a pair of users in 854-860) authenticate the transaction by providing their shared secret key 862 (QKD). This quantum signature can be attached to each transaction, making it difficult to tamper with. Each node checks its entries against its local copy of blockchain 852 to verify that each transaction has sufficient funds. However, the transaction has not yet been confirmed.

[0145] Instead of performing a traditional mining process on a block, a broadcast protocol can be used to create blocks in a decentralized manner. At a predetermined time period (e.g., seconds, minutes, hours, etc.), the network can apply the broadcast protocol to any unconfirmed transactions, thereby achieving Byzantine agreement (consensus) on the correct version of the transaction. For example, each node may have a private value (transaction data for that particular node). In the first round, private values ​​are passed between nodes. In subsequent rounds, nodes communicate the information they received from other nodes in the previous round. Here, honest nodes are able to create a complete set of transactions within a new block. New blocks can be added to blockchain 852. In one embodiment, the features and / or actions described and / or depicted herein can occur on or relative to blockchain 852.

[0146] Fig. 9An example system 900 is shown that supports one or more example embodiments described and / or depicted herein. System 900 includes a computer system / server 902 that can operate with many other general or special purpose computing system environments or configurations. Examples of well-known computing systems, environments, and / or configurations that may be suitable for computer system / server 902 include, but are not limited to, personal computer systems, server computer systems, thin clients, fat clients, handheld or portable devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronics, network PCs, minicomputer systems, mainframe computer systems, and distributed cloud computing environments that include any of the above systems or devices, and the like.

[0147] Computer system / server 902 may be described in the general context of computer system executable instructions (e.g., program modules) executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, etc. that perform specific tasks or implement specific abstract data types. Computer system / server 902 may be practiced in a distributed cloud computing environment where tasks are performed by remote processing devices that are linked through a communications network. In a distributed cloud computing environment, program modules may be located in local and remote computer system storage media including memory storage devices.

[0148] like Fig. 9 As shown, a computer system / server 902 in a cloud computing node 900 is shown in the form of a general-purpose computing device. Components of the computer system / server 902 may include, but are not limited to, one or more processors or processing units 904, a system memory 906, and a bus that couples various system components including the system memory 906 to the processor 904.

[0149] Bus refers to any one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example and not limitation, such architectures include an Industry Standard Architecture (ISA) bus, a Micro Channel Architecture (MCA) bus, an Enhanced ISA (EISA) bus, a Video Electronics Standards Association (VESA) local bus, and a Peripheral Component Interconnect (PCI) bus.

[0150] Computer system / server 902 generally includes various computer system readable media. Such media can be any available media accessible to computer system / server 902, and include volatile and non-volatile media, removable and non-removable media. In one embodiment, system memory 906 implements the flow charts of other figures. System memory 906 can include computer system readable media in the form of volatile memory, such as random access memory (RAM) 910 and / or cache memory 912. Computer system / server 902 can further include other removable / non-removable, volatile / non-volatile computer system storage media. As an example only, a storage system 914 can be provided for reading and writing non-removable non-volatile magnetic media (not shown and generally referred to as "hard drive"). Although not shown, a disk drive for reading and writing a removable non-volatile disk (such as a "floppy disk") and an optical disk drive for reading or writing a removable non-volatile optical disk can provide a disk such as a CD-ROM, DVD-ROM or other optical media. In this case, each can be connected to the bus through one or more data media interfaces. As will be further depicted and described below, memory 906 may include at least one program product having a set (eg, at least one) of program modules configured to perform the functions of various embodiments of the present application.

[0151] A program / utility 916 having a set (at least one) of program modules 918 and an operating system, one or more application programs, other program modules, and program data may be stored in the memory 906 by way of example and not limitation. Each of the operating system, one or more application programs, other program modules, and program data, or some combination thereof, may include an implementation of a networking environment. The program modules 918 generally perform the functions and / or methods of various embodiments of the present application as described herein.

[0152] As will be appreciated by those skilled in the art, various aspects of the present application may be embodied as a system, method or computer program product. Therefore, various aspects of the present application may take the following forms: a complete hardware embodiment, a complete software embodiment (including firmware, resident software, microcode, etc.) or an embodiment combining all software and hardware aspects that can be generally mentioned. Referred to herein as "circuit", "module" or "system". In addition, various aspects of the present application may take the form of a computer program product embodied in one or more computer-readable media on which a computer-readable program code is embodied.

[0153] The computer system / server 902 may also communicate with one or more external devices 920, such as a keyboard, a pointing device, a display 922, etc., one or more devices that enable a user to interact with the computer system / server 902, and / or any device that enables the computer system / server 902 to communicate with one or more other computing devices (e.g., a network card, a modem, etc.). Such communication may occur via an I / O interface 924. However, the computer system / server 902 may still communicate with one or more networks, such as a local area network (LAN), a general wide area network (WAN), and / or a public network (e.g., the Internet) through a network adapter 926. As shown, the network adapter 926 communicates with other components of the computer system / server 902 via a bus. It should be understood that, although not shown, other hardware and / or software components may be used in conjunction with the computer system / server 902. Examples include, but are not limited to, microcode, device drivers, redundant processing units, external disk drives, arrays, RAID systems, tape drives, and data archive storage systems.

[0154] Although exemplary embodiments of at least one of the systems, methods, and non-transitory computer-readable media are shown in the accompanying drawings and described in the foregoing detailed description, it should be understood that the present application is not limited to the disclosed embodiments, but can be rearranged, modified, and replaced as described and defined in the appended claims. For example, the capabilities of the systems of the various drawings can be performed by one or more of the modules or components described herein or in a distributed architecture, and can include a transmitter, a receiver, or both. For example, all or part of the functions performed by each module can be performed by one or more of these modules. In addition, the functions described herein can be performed at various times inside or outside a module or a module or component and in relation to various events. Moreover, the information sent between various modules can be sent between various modules and / or by multiple protocols via at least one of the following: data network, Internet, voice network, Internet protocol network, wireless device, wired device. Moreover, messages sent or received by any module can be sent or received directly and / or via one or more other modules.

[0155] Those skilled in the art will appreciate that a "system" may be embodied as a personal computer, server, console, personal digital assistant (PDA), cell phone, tablet computing device, smart phone, or any other suitable computing device or combination of devices. Presenting the above functions as being performed by a "system" is not intended to limit the scope of the present application in any way, but is intended to provide an example of many embodiments. In fact, the methods, systems, and apparatus disclosed herein may be implemented in local and distributed forms consistent with computing technology.

[0156] It should be noted that some of the system features described in this specification have been presented as modules in order to more specifically emphasize their implementation independence. For example, a module may be implemented as a hardware circuit, including a custom very large scale integrated circuit (VLSI) circuit or gate array, an off-the-shelf semiconductor such as a logic chip, a transistor, or other discrete components. A module may also be implemented in a programmable hardware device such as a field programmable gate array, a programmable array logic, a programmable logic device, a graphics processing unit, etc.

[0157] Modules may also be implemented at least in part in software to be executed by various types of processors. The executable code unit identified may, for example, include one or more physical or logical blocks of computer instructions, which may, for example, be organized as objects, processes, or functions. However, the executable files of the identified modules do not need to be physically located together, but may include different instructions stored in different locations, which, when logically combined together, include the modules and achieve the purpose of the modules. In addition, modules may be stored on a computer-readable medium, which may be, for example, a hard drive, a flash memory device, a random access memory (RAM), a magnetic tape, or any other such medium for storing data.

[0158] In practice, a module of executable code may be a single or multiple instructions, and may even be distributed across multiple different code segments, between different programs, and across multiple storage devices. Similarly, operational data may be identified and shown herein within a module, and may be embodied in any suitable form and may be organized within any suitable type of data structure. The operational data may be collected as a single data set, or may be distributed across different locations including different storage devices, and may exist, at least in part, only as electronic signals on a system or network.

[0159] It will be easily understood that the components of the present application can be arranged and designed in a variety of different configurations as generally described and shown in the drawings herein. Therefore, the detailed description of the embodiments is not intended to limit the scope of the claimed application, but only represents the selected embodiments of the present application.

[0160] Those skilled in the art will readily appreciate that the above content may be practiced with steps in a different order and / or with hardware elements in a configuration different from that disclosed. Therefore, although the present application has been described based on these preferred embodiments, it will be apparent to those skilled in the art that certain modifications, variations, and alternative constructions will be apparent.

[0161] Although preferred embodiments of the present application have been described, it should be understood that the described embodiments are merely exemplary and that the scope of the present application is limited solely by the appended claims when considering the scope of all equivalents and modifications (e.g., protocols, hardware devices, software platforms, etc.).

Claims

1. A method comprising: receiving system calls captured from a plurality of peer nodes of a blockchain that occurred during a predetermined time period; determining a subset of the received system calls corresponding to blockchain processes executed during the predetermined time period; detecting a freeriding peer node from the plurality of peer nodes based on the identified subset of system calls relative to the freeriding peer node's system calls during the predetermined time period; and An indicator of the free-riding peer node is stored.

2. The method of claim 1, wherein the system calls are independently captured by the plurality of peer nodes based on traces of chaincodes typically running on the plurality of peer nodes.

3. The method of claim 1, wherein the determining comprises determining a subset of system calls executed by more than a predetermined number of peer nodes within the predetermined time period.

4. The method of claim 1, wherein the determining comprises generating a graph that identifies how many peer nodes have executed each of the system calls, and identifying the subset of the system calls based on the graph.

5. The method of claim 4, wherein the identifying comprises identifying system calls executed by a majority of peer nodes as a subset of the system calls.

6. The method of claim 1, further comprising generating and displaying an alert via a user interface in response to detecting the free-ride peer node.

7. The method of claim 1, wherein the detecting comprises: In response to detecting a failure of the freeriding peer node to execute a system call in the identified subset of system calls, a presence of the freeriding peer node is detected.

8. The method of claim 1, wherein said detecting said freeriding peer node is performed via a bad behavior identification chaincode.

9. A computer system, comprising: a network interface configured to collect system calls captured from a plurality of peer nodes of a blockchain that occurred during a predetermined time period, and A processor is configured to: determine a subset of system calls among the received system calls corresponding to blockchain processes executed during the predetermined time period; detect a free-ride peer node from the plurality of peer nodes based on the identified subset of system calls relative to the free-ride peer node during the predetermined time period; and store an indicator of the free-ride peer node.

10. A computer system, comprising: one or more processors; one or more computer readable memories; as well as Program instructions stored on one or more computer-readable storage media for execution by at least one of one or more computer processors, the program instructions being executable by a processor of a computer to perform the method of any one of claims 1-8.

11. A computer program product, the computer program product comprising: one or more computer-readable storage media; as well as The program instructions stored on the one or more computer-readable storage media can be executed by a processor of a computer to perform the method of any one of claims 1-8.

12. A computer system comprising modules for executing the steps of the method according to any one of claims 1 to 8.

Images