Chaincode recommendation based on existing chaincodes

A system using machine learning and graph mining in blockchain networks dynamically recommends new smart contracts, addressing the inflexibility and security issues of traditional smart contracts, enhancing network adaptability and business opportunities.

JP7586605B2Active Publication Date: 2024-11-19INTERNATIONAL BUSINESS MACHINE CORPORATION
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
JP2022522975
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Priority Date
2019-10-16
Filing Date
2020-10-06
Publication Date
2024-11-19
Estimated Expiration
2040-10-06

AI Technical Summary

Technical Problem

Centralized databases face vulnerabilities such as single points of failure, network dependency, and limited accessibility, while traditional smart contracts in blockchain networks are inflexible and unable to adapt to changing business opportunities.

Method used

A system that identifies and recommends new smart contracts based on existing relationships within a blockchain network using machine learning and graph mining, allowing dynamic adaptation and expansion of business opportunities.

Benefits of technology

Enables dynamic changes in blockchain network terms, expanding business opportunities by suggesting new smart contracts that enhance flexibility and security, while maintaining network integrity.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007586605000003
    Figure 0007586605000003
  • Figure 0007586605000004
    Figure 0007586605000004
  • Figure 0007586605000005
    Figure 0007586605000005
Patent Text Reader

Abstract

Chaincode recommendation based on existing chaincodes In one embodiment, operations include storing one or more existing chaincode relationships between a group of blockchain peers in a blockchain network, identifying a new chaincode to implement for one or more peers among the group of blockchain peers in the blockchain network based on the existing chaincode relationships, and communicating a message to the one or more blockchain peers that includes a suggestion for implementing the new chaincode.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present invention relates generally to storing data on a blockchain, and more particularly to an apparatus capable of evaluating existing smart contracts between peers in a blockchain and recommending new smart contracts based thereon. [Background technology]

[0002] A centralized database stores and maintains data in a single database at a single location (e.g., a database server). This location is often a central computer, e.g., a desktop central processing unit (CPU), a server CPU, or a mainframe computer. Information stored in a centralized database is typically accessible from many different locations. Many users, or client workstations, can work simultaneously on the centralized database, e.g., based on a client / server configuration. A centralized database is easier to manage, maintain, and control, especially for security purposes, because it is a single location. In a centralized database, data redundancy is minimized as a single store of all data provides a data set with only one primary record.

[0003] However, centralized databases encounter significant drawbacks. For example, a centralized database has a single point of failure if no consideration is given to fault tolerance. Thus, if a hardware failure occurs (e.g., hardware, firmware, or software failure, or a combination of these), all data in the database is lost and all users are interrupted. In addition, centralized databases are highly dependent on network connectivity. As a result, the amount of time required for each database access increases as connections become slower. Another drawback is that a centralized database, due to its single location, creates a bottleneck when it experiences high traffic. Furthermore, a centralized database provides limited access since only a single copy of the data is maintained in the database.

[0004] Organizations have recently returned to blockchains as a means to securely store data that is not restricted by a central entity and is accessible from multiple points. To enforce the need for no central authority among blockchain members, smart contracts (also referred to herein as chaincodes) are developed, pre-negotiated, and executed within the blockchain network during transactions. Smart contracts are visible to multiple members and ensure that the parties to a transaction meet their obligations. Typically, smart contracts contain the business terms of the blockchain participants who join the blockchain at the time of initialization. The terms within a smart contract are “hard-cored,” so they do not change over time. With increased security, self-adaptation within the blockchain is also prevented, resulting in lost opportunities if a member has a business opportunity to transact but does not have a valid smart contract to create the terms. Therefore, a solution is needed that overcomes these shortcomings and limitations. Summary of the Invention

[0005] In one example embodiment, an apparatus is provided that includes one or more storages configured to store existing chaincode relationships between a group of blockchain peers in a blockchain network; a processor configured to identify a new chaincode to be implemented between the one or more groups of blockchain peers of the blockchain network based on the existing chaincode relationships; and a network interface configured to communicate a message to the one or more blockchain peers including a suggestion for implementing the new chaincode.

[0006] Preferably, the invention provides an apparatus, wherein the storage is configured to store identification values ​​of existing chaincodes as a first set of nodes on the graph, identification values ​​of each of the blockchain peers as a second set of nodes on the graph, and the processor is configured to connect with edges the first set of nodes corresponding to the existing chaincodes and the second set of nodes corresponding to the blockchain peers based on relationships of the existing chaincodes.

[0007] Preferably, the present invention provides an apparatus in which a processor is configured to identify new chaincode implementations based on chaincode patterns mined from existing chaincode relationships in a graph.

[0008] Preferably, the invention provides an apparatus wherein the processor is further configured to predict, via one or more machine learning algorithms, a set of attributes to be included in the new chaincode based on attributes included in existing chaincode relationships.

[0009] Preferably, the present invention provides an apparatus, wherein the new chaincode includes one or more changes to attributes of a chaincode relationship established between two blockchain peers.

[0010] Preferably, the present invention provides an apparatus in which the new chain code includes a new chain code relationship between two or more blockchain pianos that do not have a chain code relationship.

[0011] Preferably, the present invention provides an apparatus, wherein the processor is further configured to receive an offer to implement a new chaincode from one or more blockchain peers and in response activate the new chaincode within the blockchain network.

[0012] Preferably, the present invention provides an apparatus, wherein the processor is further configured to receive a rejection of the implementation of the new chaincode from one or more blockchain peers, and in response store information regarding the rejection of the new chaincode for future predictions.

[0013] Preferably, the present invention provides an apparatus, wherein the processor is further configured to receive modifications of one or more attributes of the new chaincode and activate the modified new chaincode in the blockchain network.

[0014] Viewed from a second aspect, the present invention provides a method including storing chaincode relationships that exist between a group of blockchain peers in a blockchain network; identifying a new chaincode for implementation for one or more blockchain peers among the group of blockchain peers of the blockchain network based on the chaincode relationships that exist between the group of blockchain peers; and communicating a message to the one or more blockchain peers including a suggestion for implementation of the new chaincode.

[0015] Preferably, the present invention provides a method wherein storing comprises storing an identification value of each of the existing chaincodes as a first set of nodes on the graph, and storing an identification value of each group of blockchain peers as a second set of nodes on the graph, and connecting with edges the first set of nodes corresponding to the existing chaincodes and the second set of nodes corresponding to the blockchain peers based on relationships of the existing chaincodes.

[0016] Preferably, the present invention provides a method for identifying new chaincode implementations based on chaincode patterns mined from existing chaincode relationships in a graph.

[0017] Preferably, the present invention further provides a method for predicting, via one or more machine learning algorithms, a set of attributes to be included in a new chaincode based on attributes included in existing chaincode relationships.

[0018] Preferably, the present invention provides a method, wherein the new chaincode includes changes to one or more attributes of a chaincode relationship established between two blockchain peers.

[0019] Preferably, the present invention provides a method in which the new chain code includes a new chain code relationship between two or more blockchain peers that do not have a chain code relationship.

[0020] Preferably, the present invention further provides a method for the processor to receive an offer to implement a new chaincode from one or more blockchain peers and, in response thereto, activate the new chaincode within the blockchain network.

[0021] Preferably, the present invention provides a method for receiving a rejection of a new chaincode implementation from one or more blockchain peers and, in response, storing information regarding the rejection of the new chaincode for future predictions.

[0022] Preferably, the present invention further provides a method for receiving modifications of one or more attributes of a new chaincode and activating the modified new chaincode in a blockchain network.

[0023] Viewed from a third aspect, the present invention provides a non-transient computer-readable medium including instructions that, when read by a processor, cause the processor to: store existing chaincode relationships of a group of blockchain peers in a blockchain network; identify a new chaincode implementation for one or more blockchain peers among the group of blockchain peers of the blockchain network based on the existing chaincode relationships between the group of blockchain peers; and communicate a message including a suggestion for the new chaincode implementation to one or more blockchain peers.

[0024] Preferably, the present invention further provides a non-transitive computer readable medium for predicting, via one or more machine learning algorithms, a set of attributes to be included in a new chaincode based on attributes included in existing chaincode relationships. [Brief description of the drawings]

[0025] [Figure 1] FIG. 1 illustrates a computing environment for recommending a new chain code, according to an example embodiment. [Figure 2A] FIG. 2A is a diagram illustrating a configuration of a blockchain architecture according to an example embodiment. [Figure 2B] FIG. 2B is a diagram illustrating a blockchain transaction flow, according to an example embodiment. [Figure 3A] FIG. 3A illustrates a permissioned blockchain network, according to an example embodiment. [Figure 3B] FIG. 3B is a diagram illustrating another permissioned blockchain network, according to an example embodiment. [Figure 3C] FIG. 3C illustrates a permissionless blockchain network, according to an example embodiment. [Figure 4A] FIG. 4A illustrates a process for indicating a new chaincode to blockchain peers according to an example embodiment. [Figure 4B] FIG. 4B is a diagram illustrating an existing chain code relationship graph, according to an example embodiment. [Figure 4C] FIG. 4C illustrates a newly supported chain code based on an existing chain code, according to an example embodiment. [Diagram 5] FIG. 13 illustrates a method for indicating a new chain code to peers in a blockchain network, according to an example embodiment. [Figure 6A] FIG. 6A illustrates an example system configured to perform one or more operations described herein, according to an example embodiment. [Figure 6B] FIG. 6B illustrates another example system configured to perform one or more operations described herein, according to an example embodiment. [Figure 6C] FIG. 6C illustrates a further example system configured to use smart contracts, according to an example embodiment. [Figure 6D] FIG. 6D is a diagram illustrating yet another example system configured to use blockchain, in accordance with an example embodiment. [Figure 7A] FIG. 7A illustrates the processing of a new block being added to a distributed ledger, according to an example embodiment. [Figure 7B] FIG. 7B is a diagram illustrating the contents of a new data block, according to an example embodiment. [Figure 7C] FIG. 7C illustrates a block chain for digital content, according to an example embodiment. [Figure 7D] FIG. 7D is a diagram illustrating a block that can indicate the structure of a block, according to an example embodiment. [Figure 8A] FIG. 8A illustrates an example blockchain storing machine learning (artificial intelligence) data according to an example embodiment. [Figure 8B] FIG. 8B is a diagram illustrating an example quantum secure blockchain, according to an example embodiment. [Figure 9] FIG. 9 illustrates an example system that may support one or more of the example embodiments. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0026] It will be readily understood that the components of the illustrated embodiments, as generally described in the figures herein, may be arranged and designed in different configurations. Thus, the following detailed description of at least one method, apparatus, non-transitory computer-readable medium, and system, as illustrated in the accompanying figures, is not intended to limit the scope of the present application as claimed, but is merely representative of selected embodiments.

[0027] Features, structures, or characteristics of the examples described throughout this specification may be combined or omitted in any suitable manner in one or more embodiments. For example, use of the phrase "example embodiment," "some embodiments," or other similar language throughout this specification refers to certain features, structures, or characteristics described in connection with the examples may be included in at least one embodiment. Thus, the phrase "example embodiment," "some embodiments," or other similar language does not necessarily refer to all of the same group of embodiments throughout this specification, and the described features, structures, or characteristics may be combined or omitted in any suitable manner in one or more embodiments. Additionally, in the drawings, any connections between elements may allow for one-way or two-way communication, or a combination thereof, even if the connections depicted are one-way or two-way arrows. Also, any devices depicted in the drawings may be different devices. For example, if a mobile device is depicted as sending information, a wired device could also be used to use the information.

[0028] Additionally, even though the term "message" is used in describing the embodiments, the application may be applicable to many types of networks and data, and even though certain types of connections, messages, and signaling are described in the exemplary embodiments, the application is not limited to the certain types of connections, messages, and signaling.

[0029] Example embodiments provide methods, systems, components, non-transient computer-readable media, devices, or networks, or combinations thereof, that can build and mine a graph of chaincode relationships between blockchain peers and recommend new chaincode relationships between one or more blockchain peers.

[0030] In one embodiment of the application, the application uses a decentralized database (such as a blockchain) that is a distributed storage system, which includes many nodes that communicate with each other. A decentralized database is an append-only, immutable data structure similar to a distributed ledger that allows records to be maintained among parties that do not trust each other. The untrusted parties are referred to herein as peers or peer nodes, each peer maintains a copy of the database record, and no single peer can modify the database record without a consensus reached among the distributed peers. For example, multiple peers can implement a consensus protocol to validate blockchain transactions, group storage transactions into blocks, and build a hash chain across the blocks. This protocol forms a ledger by ordering the storage transactions for consistency as necessary. In various embodiments, permissioned or permissionless blockchains, or both, can be used. In a public or permissioned blockchain, anyone can participate without specific identity. Public blockchains can include native cryptocurrencies and use consensus based on various protocols such as Proof of Work (PoW), while permissioned blockchain databases provide secure interactions between groups of entities such as funds, products, information, etc. that share a common goal but do not fully trust each other.

[0031] The application may use a blockchain that is optionally programmable logic, adapted to a decentralized storage scheme, and referred to as a “smart contract” or “chaincode”. In some cases, a specialized chaincode may exist to manage functions and parameters, referred to as a system chaincode. The application further uses smart contracts, which are trusted distributed applications, and an underlying agreement between nodes, referred to as an endorsement, or endorsement policy, that affects the tamper-proof properties of the blockchain database. Blockchain transactions related to the application may be “endorsed” before they are committed to the blockchain without consideration of unendorsed transactions. An endorsement policy allows the chaincode to specify endorsers for a transaction in the form of a set of peer nodes required for endorsement. If a client sends a transaction to a peer specified in the endorsement policy, the transaction is executed, validating the transaction. After validation, the transaction enters the ordering phase, where a consensus protocol is used to generate an ordered sequence of endorsed transactions that are grouped into blocks.

[0032] The application may use nodes, which are the communicating entities of a 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 refer to logical entities that are grouped within a trust domain and control them in different ways. Nodes may include different types, such as submitting client nodes, which submit transaction calls to clients or endorsers (e.g., peers) and broadcast transaction offers to an ordering service (e.g., ordering nodes). Another type of node is a peer node, which may receive client submitted transactions, commit transactions, and maintain a copy of the state and ledger of blockchain transactions. Peers may also have the role of endorser, but not required. An ordering service node or ordering agent is a node that runs a communication service for all nodes and implements delivery guarantees such as committing transactions and broadcasting them to each peer node in the system when they modify the global state of the blockchain, which is another name for the initial blockchain transaction that usually contains the control and setup information.

[0033] The application may use a ledger, which is a serialized, tamper-resistant record of transactions of the entire state of the blockchain. State transitions may result from chaincode invocations (i.e., transactions) submitted by participating parties (e.g., client nodes, ordering nodes, endorser nodes, peer nodes, etc.). Each participating party (e.g., peer node) may maintain a copy of the ledger. A transaction may provide a set of asset key-values ​​that are committed to the ledger as one or more operands, such as creation, update, etc. The ledger includes a blockchain (also referred to as a chain) that is used to store an immutable, sequential record of blocks. The ledger also includes a state database that maintains the current state of the blockchain.

[0034] The application can use a chain, which is a transaction log structured as hash-linked blocks, where each block contains a sequence of N transactions, where N is equal to 1 or more. The block header contains the hash of the block's transactions in addition to the header of the previous block. In this way, all transactions on the ledger can be serialized and cryptographically linked to each other. Therefore, it is not possible to tamper with the ledger data without breaking the hash links. The hash of the most recently added blockchain block represents all transactions on the chain that came before it, allowing all peer nodes to ensure that they are in a consistent and trusted state. The chain can be stored on the file system of the peer nodes (i.e. locally, attached storage, cloud, etc.).

[0035] The current state of the immutable ledger represents the latest values ​​for all keys contained in the chain 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 perform transactions against the data in the current state of the ledger. To make these chaincode interactions efficient, the latest values ​​of keys can be stored in a state database. The state database is simply an indexed view into the chain's transaction log, and it can therefore be generated from the chain at any point in time. The state database can be automatically recovered (or generated if necessary) upon peer node startup and before transactions are accepted.

[0036] In a blockchain network, a negotiation process occurs between blockchain participants (peers) to define business terms for asset transactions. Once defined, the business terms are typically hard-coded in smart contracts and cannot be changed to self-adapt for new opportunities. In addition, such loss of opportunity is more significant when participants have business opportunities to transact but cannot control such transactions.

[0037] Example embodiments address this problem using a system that can dynamically suggest new smart contracts (chaincodes) based on existing smart contract relationships and participant profiles that are curated and submitted by such participants. Once agreement is reached on the new smart contract by the peer nodes, the new smart contract is published and participants can transact under the new smart contract.

[0038] The system automatically suggests new smart contracts in the blockchain network based on patterns identified in the constructed knowledge base of transactions. Patterns can be identified using graph mining, which can implement artificial intelligence techniques such as mining the graph of chaincode associations to identify relationships and their attributes, and machine learning to identify patterns of attributes in existing smart contracts. Once the system suggests a smart contract containing new terms, it can be submitted for participant submission and published / activated upon submission. For example, machine learning such as recurrent neural networks (RNNs) can be used to predict smart contracts to suggest and attributes of the suggested smart contracts based on historical smart contracts among blockchain participants.

[0039] The system can model the relationships of smart contracts in a blockchain network as nodes on a graph. For example, a first set of nodes can represent blockchain peers in the network, and a second set of nodes can represent different smart contracts therein. Edges can connect peers to the smart contracts they participate in. The graph structure is mined by the system to pattern and recommend new smart contracts. When the system recommends a new smart contract, the system recommends new edges in the graph between existing blockchain peers. In some embodiments, the system can implement such things as governing peers among the blockchain peers. In another embodiment, the system can be installed and run on each peer or group of peers in the blockchain network. The system can analyze data and transactions from the blockchain and suggest new smart contracts with new attributes.

[0040] An example embodiment recommends a new smart contract between blockchain peers already in the system, and also recommends attributes of this new smart contract. Examples of new smart contracts include recommendations between supermarkets and producers, hospitals and laboratories, exporters and shipping companies, etc. These are merely examples, and it should be recognized that smart contracts can be recommended to different types of entities, including any supply chain, where new business terms (smart contracts) can be identified and recommended based on past transactions and needs (here, artificial intelligence could also play a role in the recommendation). For example, hospitals and laboratories that are in the network but are not connected can receive a recommendation to initiate a new smart contract if the system identifies that their connection would bring business benefits if they transact (e.g. price, deadline for service delivery, volume, etc.).

[0041] The attributes of the newly suggested smart contract can be determined through artificial intelligence (AI) or machine learning, or both, that can predict the type of attributes / contracts that should be recommended based on various factors including current smart contract attributes, market data, geographic data, changes to the entity, etc. For example, Recurrent Neural Networks (RNNs) are an example of a type of artificial intelligence that can be used to suggest smart contracts. RNNs are a class of artificial intelligence in which the connections between nodes form a form of directed graph that follows a time sequence. This allows RNNs to exhibit dynamic behavior over time. Unlike feed-forward neural networks, RNNs can use their internal state (memory) to process a sequence of inputs. Existing smart contracts and their attributes can be processed using RNNs to identify suggested smart contracts and their attributes.

[0042] For example, the system can monitor the network's transactions, their contracts and attributes (peer relationships). Peers and smart contracts can be graphed and represented with edges between them. The graph is mined for common patterns of behavior. Additionally, machine learning or artificial intelligence or both can be used to modify existing smart contract relationships and to suggest new smart contract relationships. Suggestions can be based on attributes such as price, delivery date, SLA, penalties, etc. In some embodiments, a new smart contract cannot be enabled until the involved peers have mutual agreement.

[0043] Some benefits of example embodiments include dynamic modification of the blockchain network contract after it is initiated. The system can identify new chain code relationships that are beneficial to one or more members of the blockchain and suggest new chain code (smart contracts) that govern the new chain code. Thus, business opportunities can be dynamically expanded / changed within the blockchain to support changes that require effort on the part of the parties.

[0044] FIG. 1 illustrates a blockchain network 100 including multiple blockchain peers 110, 120, 130, 140, 150, and 160. In this example, the blockchain network is a permissioned blockchain where the blockchain is private. Peers 110-160 may each store a replica / copy of the blockchain ledger including the blockchain and a state database. Peers 110-160 may be connected to each other through a network, such as the Internet, a private network, etc. Although not illustrated in FIG. 1, it should be appreciated that blockchain network 100 may include other entities, such as one or more ordering services, clients, off-chain storage entities, etc. In this example, any of peers 110-160 may function as a recommender peer to recommend new smart contracts. For purposes of the example, blockchain peer 120 is an administrative peer having a recommender system according to various embodiments installed and running therein.

[0045] In this embodiment, blockchain peers 110-160 can transact with each other in any number of fields and industries, such as supply chain, cold chain, finance, medical, distribution, manufacturing, etc. Individual peers can contract with each other to create different smart contracts in advance. These smart contracts are stored in the blockchain ledger, such as the genesis block. As new peers join the network, they can join one or more existing smart contracts.

[0046] According to various embodiments, the recommending peers (i.e., blockchain peers) 120 can also recommend new smart contracts (chaincodes) to peers 110-160 based on existing smart contract relationships, business profiles, etc. For example, the blockchain peers 120 can maintain a smart contract relationship graph 122 that stores existing smart contract relationships between blockchain peers 110-160. An example of the smart contract relationship graph 122 is shown in FIG. 4B, but the embodiment is not limited thereto. Any of the peers 110-160 can act as a recommending peer. Also, more than one peer can act as a recommending peer. In another embodiment, trusted off-chain entities, clients, etc. can create smart contracts if they have access to blockchain data.

[0047] In the example of FIG. 1, the recommending blockchain peer 120 identifies a new smart contract that can be implemented between the organizations corresponding to the peers 110 and 150 and sends a message to each of the peers 110 and 150 suggesting the new smart contract. If both peers 110 and 150 approve the new smart contract, the recommending peer 120 publishes such smart contract and activates it into the blockchain network 100. In another embodiment, if one of the peers 110 or 150, or both, rejects the smart contract, the reason for the rejection is provided by the respective peer and stored by the recommending peer 120 to enhance future recommendations. In another example, the peers 110 and 150 can modify one or more of the conditions / criteria of the newly suggested smart contract and reach an agreement after negotiation. Once an agreement is reached, the new smart contract can be published / issued in real time. Additionally, a proof of existence of a new smart contract or a graph used to imply a new smart contract, or both, can be stored on the blockchain as shown in the example of FIG. 7B.

[0048] FIG. 2A illustrates a blockchain architecture configuration 200 according to an example embodiment. Referring to FIG. 2A, the blockchain architecture 200 may include certain blockchain elements, such as a group of blockchain nodes 202. The blockchain nodes 202 include one or more nodes 204-210 (four of which are illustrated by way of example only). These nodes participate in a number of activities, such as blockchain transactions and the validation process (consensus). One or more of the blockchain nodes 204-210 may endorse transactions based on an endorsement policy and provide ordering services for all blockchain nodes in the architecture 200. A blockchain node may initiate validation of the blockchain and attempt to write to an immutable ledger of the blockchain stored in the blockchain layer 216, a copy of which may also be stored on the underlying physical infrastructure 214. The blockchain configuration can include one or more applications 224 linked to application programming interfaces (APIs) 222 for accessing and executing stored program / application code 220 (e.g., chaincode, smart contracts, etc.), which can be generated according to customized configurations obtained by participants and can maintain their own state, their own owned assets, and can receive external information, which can be arranged as transactions and via a distributed ledger attached to all blockchain nodes 204-210.

[0049] The blockchain base or platform 212 includes various layers of blockchain data, services (e.g., crypto asset services, virtual execution environments, etc.) and an underlying physical computer infrastructure that can be used to receive and store new transactions and provide access to auditors seeking access to data entries. The blockchain layer 216 provides access to the virtual execution environment necessary to process the program code and can expose interfaces that provide connectivity to the physical infrastructure 214. The crypto asset services 218 can be used to verify transactions, such as asset exchange transactions, and keep the information private.

[0050] The blockchain architecture of FIG. 2A can process and execute program / application code through one or more interfaces exposed and serviced by the blockchain platform 212. The code 220 can control assets of the blockchain. For example, the code 220 can store and transfer data and be executable by the nodes 204-210 in the form of smart contracts and associated chaincode along with other code elements that are subject to conditions or their execution. As a non-limiting example, smart contracts can be generated to implement reminders, updates, or other notifications that are subject to changes, updates, or any combination thereof. The smart contracts themselves can be used to identify permissions and access requirements and terms associated with use of the ledger. For example, data reads 226 are processed by one or more processing entities (e.g., virtual machines) included within the blockchain layer 216 to generate processing results to be written to the blockchain, including write data 228. The physical infrastructure 214 can be used to search for any data or information described herein.

[0051] A smart contract can be created via high-level application and programming languages ​​and then written into a block in the blockchain. A smart contract can contain executable code that can be registered, stored, and / or replicated in the blockchain (e.g., a distributed network of blockchain peers). A transaction is the execution of a smart contract's code that can be executed in response to a condition associated with the smart contract being satisfied. The existence of a smart contract can trigger a trusted modification(s) to the state of the digital blockchain ledger. Modification(s) to the blockchain ledger generated by the execution of a smart contract can be automatically replicated across a distributed network of blockchain peers through one or more consensus protocols.

[0052] A smart contract can write data in the form of key-value pairs to the blockchain. Additionally, a smart contract can read values ​​stored in the blockchain and use them in application operations. The code of a smart contract can write the output of various logical operations into the blockchain. The code can be used to generate temporary data structures in a virtual machine or other computing platform. Data written to the blockchain can be public, or kept private and encrypted, or both. The temporary data used / generated by the smart contract is kept in memory by the provided execution environment and then deleted once the required data has been identified for the blockchain.

[0053] Chaincode may include code interpretation of smart contracts. As described herein, chaincode may be program code deployed in a computing network, where it is executed and verified during the consensus process by a chain validator. The chaincode receives the hash and searches for the hash associated with the data template generated using a previously stored feature extractor from the blockchain. If the hash of the hash identifier and the hash generated from the stored identifier template match, then the chaincode delivers an authorization key for the requested service. The chaincode writes to the blockchain data with the encryption details.

[0054] FIG. 2B illustrates an example of a blockchain transaction between nodes of a blockchain, according to an example embodiment. With reference to FIG. 2B, the transaction flow may include a transaction proposal 291 sent by an application client node 260 to an endorsing peer node 281. The endorsing peer 281 may verify the client's signature and execute the chaincode to initiate the transaction. The output may include the result of the chaincode, a set of key / value versions read in the chaincode (the read set) and a set of keys / values ​​written into the chaincode (the write set). A response 292 to the proposal is sent back to the client 260 with a signature of the endorsement (if authenticated). The client 260 embeds the endorsement in a transaction payload 293 and broadcasts it to the ordering service node 284. The ordering service node 284 then distributes the instruction transaction as a block to all peers 281-283 on the channel. Before committing to the blockchain, each peer 281-283 validates the transaction. For example, a peer may check the endorsement policy to ensure that the exact contribution of the identified peer is signed in the result and that the signature on the transaction payload 293 is attested.

[0055] Referring again to FIG. 2B, a client node 260 initiates a transaction 291 by composing and sending a request to an endorser peer node 281. The client 260 may include an application that leverages a supported software development kit (SDK) to generate a transaction proposal using 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., writing a new key-value pair for an asset). The SDK acts as a shim to package the transaction proposal into a properly designed format (e.g., protocol buffers over remote procedure calls (RPC)) and can obtain the client's cryptographic credentials to generate a unique signature for the transaction proposal.

[0056] In response, the endorsing peer node 281 verifies that (a) the transaction proposal is well-formed, (b) the transaction has not already been submitted previously, (c) the signature is valid, and (d) the submitting vehicle (in an embodiment, the client 260) is properly authenticated to perform the proposed operation on the channel. The endorsing peer node 281 may input the transaction proposal as an assertion to the chaincode function that was invoked. The chaincode is then executed and generates a transaction result that includes the response value, a read set, and a write set for the current state of the database. However, no updates are made to the ledger at this point. At 292, the set of values, along with the signature of the endorsing peer node 381, is returned as a proposal response 292 to the client 260 SDK, which parses the payload for use by the application.

[0057] In response, the client 260 application checks / verifies the signature of the endorsing peer and compares the proposal response to determine whether the proposal responses are identical. If the chaincode only queried the ledger, the application checks the query response and typically does not submit the transaction to the ordering node service 284. If the client application intends to submit a transaction to the ordering node service 284 to update the ledger, the application determines whether the specified endorsement policy is complete before submitting (i.e., all peer nodes for the transaction endorse the transaction). Here, the client may comprise only one of many parties to the transaction. This architecture shows that even if the application chooses not to check the response or forwards an otherwise unendorsed transaction, the endorsement policy is still in effect by the peers and maintained in the validation phase of the commit.

[0058] After successful validation, in transaction 293, the client 260 incorporates the endorsement into a transaction and broadcasts the transaction proposal and response in a transaction message to the ordering node 284. The transaction may include a set of reads / writes, the signature of the endorsing peer, and the channel ID. The ordering node 284 does not need to validate the entire content of the transaction to perform this operation; instead, the ordering node 284 can simply receive transactions from all channels in the network, order them chronologically by channel, and generate a block of transactions per channel.

[0059] A block of transactions is distributed on the channel from the ordering node 284 to all peer nodes 281-283. The transactions 294 in the block are verified to ensure that any endorsement policies are in place and to ensure that the ledger state of the readset has been immutable since the readset was generated by the execution of the transactions. The transactions in the block are tagged as being valid or invalid. In addition, in step 295, each peer node 281-283 adds the block to the channel's chain and, for each valid transaction, the writeset is committed to its current state database. An event is emitted to immutably add the transaction (the invocation) to the chain in addition to notifying whether the transaction is valid or invalid.

[0060] FIG. 3A illustrates an embodiment of a permissioned blockchain network 300, featuring a distributed, decentralized peer-to-peer architecture. In this embodiment, blockchain users 302 can initiate transactions to a permissioned blockchain 304. In this embodiment, transactions can be placements, calls, or queries, and are issued through client-side applications, either influenced by an SDK or directly through an API. The network provides access to regulators 306, such as auditors. A blockchain network operator 308 manages member permissions, granting regulators 306 the role of “auditors” and blockchain users 302 the “clients.” Auditors are limited to only querying the ledger, while clients can be authorized to place, call, and query certain types of chaincode.

[0061] A blockchain developer 310 can write the chaincode and client-side applications. The blockchain developer 310 can deploy the chaincode directly to the network through an interface. To include certificates from traditional data sources 312 in the chaincode, the developer 310 can use an out-of-band connection to access the data. In this embodiment, a blockchain user 302 connects to a permissioned blockchain 304 through a peer node 314. Before proceeding with any transaction, the peer node 314 retrieves the user role and transaction certificate from a certificate authority 316 to manage the user role and permissions. In some embodiments, a blockchain user must possess these digital certificates to transact on the permissioned blockchain 304. While doing so, a user who is going to use the chaincode can be required to verify their certificate on the transaction data source 312. To authenticate the user's authority, the chaincode uses an out-of-band connection to this data through a traditional processing platform 318.

[0062] FIG. 3B illustrates another embodiment of a permissioned blockchain network 320, featuring a distributed, decentralized peer-to-peer architecture. In this example, blockchain users 322 submit transactions to a permissioned blockchain 324. In this example, transactions can be placements, invocations, or queries, and are issued through client-side applications, either influenced by an SDK or directly through an API. The network provides access to regulators 326, such as auditors. A blockchain network operator 328 manages member permissions, granting regulators 326 the role of “auditors” and blockchain users 322 the “clients.” Auditors are limited to only querying the ledger, while clients can be authorized to place, invoke, and query certain types of chaincode.

[0063] A blockchain developer 330 can write the chaincode and client-side applications. The blockchain developer 330 can deploy the chaincode directly to the network through an interface. To include certificates from traditional data sources 332 in the chaincode, the developer 330 can use an out-of-band connection to access the data. In this embodiment, a blockchain user 322 connects to the network through a peer node 334. Before proceeding with any transaction, the peer node 334 retrieves the user role and transaction certificate from a certificate authority 336 to manage the user's role and permissions. In some embodiments, a blockchain user must possess these digital certificates to transact on the permissioned blockchain 324. While doing so, a user who is going to use the chaincode can be required to verify their certificate on the transaction data source 332. To authenticate the user's authority, the chaincode uses an out-of-band connection to this data through a traditional processing platform 338.

[0064] In some embodiments, a blockchain herein may be a permissionless blockchain. In contrast to a permissioned blockchain, where permission is required to participate, anyone can participate in a permissionless blockchain. For example, to participate in a permissionless blockchain, a user can generate a personal address and begin interacting in the network by submitting transactions, thus beginning to add entries to the ledger. Additionally, all parties have the option of running nodes on the system and using a mining protocol to help verify transactions.

[0065] FIG. 3C illustrates a process 350 of a transaction processed by a permissionless blockchain 352 that includes multiple nodes 354. A sender 356 wishes to send a payment or some other form of value (e.g., a certificate, medical records, a contract, goods, services, or any other asset that can be encapsulated in a digital record) to a recipient 358 via the permissionless blockchain 352. In one embodiment, each of the sender device 356 and the recipient device 358 can have a digital wallet (associated with the blockchain 352) that provides a user interface with user interface controls and an indication of transaction parameters. In response, the transaction is broadcast throughout the blockchain 352 to the nodes 354. Depending on the network parameters of the blockchain 352, the nodes validate 360 ​​the transaction based on the rules (predetermined or dynamically assigned) established by the creator of the permissionless blockchain 352. For example, this can include validating the identification values, etc., of the parties involved. The transaction may be confirmed immediately, or it may be placed in a queue with other transactions and the node 354 determines if the transaction is valid according to network rules.

[0066] In structure 362, valid transactions are formed into blocks and verified with a lock (hash). This process is performed by mining nodes among nodes 354. Mining nodes may use specific additional software to mine and generate blocks for the permissionless blockchain 352. Each block may be identified by a hash (e.g., a 256-bit number) generated using an algorithm agreed upon by the network. Each block may contain a header, a pointer or reference to a hash of the header of the previous block in the chain, and to a group of valid transactions.

[0067] Before a block is added to the blockchain, it must be verified. Verification for a permissionless blockchain 352 can include Proof of Work (PoW) solving a puzzle derived from the block's header. Another process of verifying a block, not shown in the example of FIG. 3C, is Proof of Stake. Unlike Proof of Work, where an algorithm rewards miners for solving a mathematical problem, in Proof of Stake, the producer of a new block is selected in a deterministic manner depending on their assets, also defined as "stake". A similar proof is then performed by the selected / elected nodes.

[0068] In mining, nodes try to solve a block by incrementally changing one variable until the solution satisfies a network-wide target. This generates PoW, which guarantees a correct answer. In other words, a possible solution must prove that the computing resources are capable of solving the problem. In some types of permissionless blockchains, miners can be rewarded with value (e.g., coins) for digging blocks correctly.

[0069] Here, the PoW process, along with the chaining of blocks, makes it extremely difficult to modify the blockchain because an attacker must modify all subsequent blocks to modify one block that should be allowed. Furthermore, as new blocks are mined, the difficulty of modifying the block increases and the number of subsequent blocks increases. In decentralization 366, successfully verified blocks are distributed throughout the permissionless blockchain 352, and all nodes 354 add the block to the majority chain, which is an auditable ledger of the permissionless blockchain 352. Furthermore, the value in the transaction submitted by the sender 356 is deposited or transferred to a digital wallet on the recipient device 358.

[0070] Example embodiments introduce the concept of mapping blockchain peers to smart contracts using a graph structure. Additionally, the system enables the recommendation of new smart contracts among blockchain peers based on patterns mined from the graph structure. As described herein, a graph is a network of nodes and relationships (edges) between them that can be used to model the behavior of individuals or objects that interact with each other within a blockchain environment.

[0071] FIG. 4A illustrates a process 400A for suggesting a new chaincode to a blockchain peer according to an example embodiment, FIG. 4B illustrates a peer and chaincode graph 400B representing existing chaincode relationships according to an example embodiment, and FIG. 4C illustrates a graph 400C with a newly suggested chaincode 450 based on an existing chaincode according to an example embodiment.

[0072] In Fig. 4A-4C, each organization participating in the blockchain network has its own corresponding peer in the blockchain and receives services to execute business processes. Chaincode (also referred to as smart contract) is a business contract written in a programming language. Chaincode can run automatically without human intervention and without third-party control. The blockchain ledger is a continuous and inviolable record of all submitted transactions. It consists of a blockchain and a state database. Furthermore, the system executing the process 400A and generating the graphs 400B and 400C can be a peer node, a client, an entity outside the trusted chain, etc. The system can be referred to as a recommendation system that recommends new smart contracts with adaptive specifications based on the dynamic needs and changes of the participants of the blockchain network. The system and method use a knowledge base and artificial intelligence to match service contracts to businesses.

[0073] Referring to FIG. 4A, at 402, the system generates a graph 400B (shown in FIG. 4B) that maps the existing entities and smart contracts retrieved from storage. In this step, the system maps the inputs and outputs of the smart contracts to a common ontology concept. In this example, the graph 400B includes a first set of nodes 431 that represent the blockchain peers 430 included in the blockchain network and a second set of nodes 441 that represent the different chain codes currently present in the blockchain network. Additionally, edges 432 connect the blockchain peers to the smart contracts they participate in. Further, an example of attributes 442 of smart contract A is shown in FIG. 4B. The attributes include criteria to be managed by the smart contract, including terms, constraints and values ​​for the constraints, distribution requirements, output requirements, SLA agreements, etc.

[0074] For example, graph 400B can be stored in a knowledge database 418 used to store a graph mapping entities, smart contracts, and feedback from entities that do not accept the system suggestion of a new smart contract. Note that this last information is used for future recommendations to avoid recommending smart contracts that have already been rejected by one or more entities associated with the recommended smart contract.

[0075] Referring again to FIG. 4A, at 404, the system can mine the graph 400B to search for common smart contracts. In this example, the system can search for similar terms and assets that exist in multiple smart contracts. An example of an algorithm to be used in this step can include a support vector machine, which is a supervised learning model with learning algorithms that analyze data used for classification and regression analysis. An example of a new smart contract 450 identified from the relationships of existing smart contracts is shown in the graph 400 of FIG. 4C.

[0076] In the example of FIG. 4C, new smart contract 450 connects two peers / organizations that were not previously connected to each other (i.e., peer 3 and peer 7). New smart contract 450 can be identified / determined based on existing smart contracts between peer 3, peer 2, peer 7, and peer 9. Additionally, attributes 452 of smart contract 450 can be determined from a machine learning model or artificial intelligence or both (such as an RNN) that learns from existing smart contract relationships, participant profiles, etc. and generates suggested attributes 452 for new smart contract 450.

[0077] Referring to FIG. 4A, at 406, the system can dynamically suggest a new smart contract 450 to two or more organizations / peers (i.e., peer 3 and peer 7) in the blockchain network. For example, a message containing a suggestion to implement the new smart contract 450 can be sent from the managing peer to the peers included in the new smart contract. It should be understood that a new smart contract may be a new term between two or more peers of a blockchain network that have not already transacted with each other. As another example, a new smart contract may be an amendment or new term to an existing smart contract between two or more peers in the blockchain network.

[0078] In other words, based on the attributes of existing smart contracts, the system can suggest new smart contracts to already connected entities and even to unconnected entities. Examples of algorithms to be used in this step can include, but are not limited to, link predictions such as common neighbor or Jaccard coefficient.

[0079] At 408, the system can determine whether a proposal has been received from each peer to be included in the new smart contract 450. For example, simple conditions can be used to verify whether the proposal has been agreed to by all entities associated with the smart contract suggested by the system. This process can be completed automatically using a governing board or consensus of the network.

[0080] In response to receiving the agreement at 408, the system may publish the new smart contract at 410 and store it in a smart contract repository 416, which contains valid smart contracts and thus validates the smart contract. At this step, all entities associated with the new smart contract have received the terms present in the new smart contract (i.e., assets, terms(s)), and the system now publishes the new smart contract.

[0081] However, in response to receiving a rejection from one party at 408, the system may request feedback from the entities at 412. In the event that one or more entities do not agree with the suggested smart contract, the system may request feedback to avoid future similar suggestions to the entities that do not agree with the suggestions. Additionally, at 414, the system may register the entities' reasons for not agreeing. For example, the system may register feedback and flag the suggestions that were not agreed with, so that the system avoids future similar suggestions to the entities that do not agree with the suggestions.

[0082] Although not shown in FIG. 4A, one or more parties can also provide suggestions for making changes to the new smart contract 450. For example, one peer / organization can request to change one or more attributes. If both parties agree on the modified smart contract, it is then published and activated.

[0083] 5 illustrates a method 500 for suggesting a new chaincode to peers in a blockchain network, according to an example embodiment. Referring to FIG. 5, the method may include storing 510 an existing chaincode of a group of blockchain peers in the blockchain network. The chaincode relationships may include attributes of smart contracts operating in the blockchain network. The attributes may identify characteristics of the contract, values, conditions, constraints, etc., enforced between contracting parties.

[0084] The chaincode can be stored in a graph where each blockchain peer is represented using a first set of nodes and a smart contract, and each of the smart contracts is represented using a second set of nodes. Edges connect the blockchain peer nodes to the smart contracts and can be used to identify peers participating in the smart contract. These relationships represented in the graph can be mined using one or more predictive algorithms (e.g., graph mining, structure mining, pattern mining, etc.).

[0085] In some embodiments, the storing may include storing respective identifiers of the existing chaincodes as a first set of nodes on the graph, storing respective identifiers of a group of blockchain peers as a second set of nodes on the graph, and connecting with edges the first set of nodes corresponding to the existing chaincodes to the second set of nodes corresponding to the blockchain peers based on relationships of the existing chaincodes.

[0086] At 520, the method can include predicting to enforce a new chaincode for one or more blockchain peers among the group of blockchain peers of the blockchain network based on existing chaincode relationships among the group of blockchain peers. For example, machine learning algorithms or artificial intelligence or both (e.g., RNNs, etc.) can be performed to identify patterns, identify possible improvements, identify gaps, etc. based on the relationships between the peers and the attributes of the smart contracts between the peers. The system can process the graph using a graph mining process. For example, graph mining can be performed using various software tools that analyze the properties of the graph, predict how the structure and properties of the graph may affect the chaincode relationships, and develop new chaincodes that match the patterns of the graph.

[0087] In some embodiments, predicting can include predicting a set of attributes to be included in the new chaincode based on attributes included in the existing chaincode via one or more of machine learning and artificial intelligence. For example, artificial intelligence such as RNNs can be used to suggest smart contracts. The RNNs can be trained from historical smart contracts and attributes. In some embodiments, the new chaincode can include one or more changes to an existing chaincode relationship between one blockchain peer. In some embodiments, the new chaincode can include a new chaincode relationship between two or more blockchain peers that do not have an existing chaincode relationship.

[0088] At 530, the method can include sending a message to one or more blockchain peers with a suggestion to enforce the new chaincode. In some embodiments, the method can further include receiving an offer to enforce the new chaincode from one or more blockchain peers. In another embodiment, the method can include receiving a rejection of the enforcement of the new chaincode from one or more blockchain peers, and in response, storing information regarding the rejection of the new chaincode for future predictions. In another embodiment, the method can include receiving a modification to the new chaincode and enabling the modified new chaincode in the blockchain network.

[0089] FIG. 6A illustrates an example system 600 including a physical infrastructure 610 configured to perform various operations according to an example embodiment. Referring to FIG. 6A, the physical infrastructure 610 includes a module 612 and a module 614. The module 614 includes a smart contract 630 (which resides on the blockchain 620) that can perform any operational steps 608 (module 612) included in any of the blockchain 620 and example embodiments. The steps / operations 608 can include one or more of the embodiments described or illustrated and can represent output or written information read from or written to one or more smart contracts 630 or the blockchain 620 or both. The physical infrastructure 610, the module 612, and the module 614 can include one or more computers, servers, processors, memories, or wireless communication devices, or combinations thereof. Additionally, the module 612 and the module 614 can be the same module.

[0090] FIG. 6B illustrates another example system 640 configured to perform various operations according to example embodiments. Referring to FIG. 6B, system 640 includes module 612 and module 614. Module 614 includes smart contract 630 (which resides on blockchain 620) that can perform any operation steps 608 (module 612) included in either blockchain 620 and example embodiments. Steps / operations 608 can include one or more of the described or illustrated embodiments and can represent output or written information read from or written to one or more smart contracts 630 or blockchain 620 or both. Physical infrastructure 610, module 612, and module 614 can include one or more computers, servers, processors, memories, or wireless communication devices, or combinations thereof. Additionally, module 612 and module 614 can be the same module.

[0091] FIG. 6C illustrates an example system configured to use a smart contract configuration between contracting parties and a reconciliation server configured to validate the contract terms on a blockchain, according to an example embodiment. Referring to FIG. 6C, configuration 650 represents a communication session, asset transfer session, or process, or procedure driven by a smart contract 630 that explicitly identifies one or more user devices 652 or 656, or both. The execution, operation, and results of the execution of the smart contract are managed by a server 654. The content of the smart contract 630 may require electronic signatures by one or more of the user devices 652 and 656 participating in the smart contract transaction. The smart contract 630 resides on a blockchain 620, which may reside on one or more computers, servers, processors, memories, or wireless communication devices, or combinations thereof.

[0092] FIG. 6D illustrates a system 660 including a blockchain, according to an example embodiment. Referring to the example of FIG. 6D, an application programming interface (API) gateway 662 provides a common interface for accessing blockchain logic (e.g., smart contracts or other chain code) and data. In this example, the API gateway 662 is a common interface on the blockchain for performing transactions (calls, queries, etc.) by connecting one or more entities 652 and 656 to a blockchain peer (i.e., server 654). Here, server 654 is a peer component of the blockchain network that holds a copy of the world state and a distributed ledger that allows clients 652 and 656 to submit transactions to the blockchain network as well as query data on the world state, where depending on the smart contract 630 and the endorsement policy, the endorsing peer will run the smart contract 630.

[0093] The above-described embodiments may be implemented in hardware, in a computer program executed by a processor, in firmware, or in a combination of the above. The computer program may be embodied on a computer-readable medium, such as a recording medium. For example, the computer program may be embodied in a random access memory ("RAM"), a flash memory, a read-only memory ("ROM"), an erasable programmable read-only memory ("EEPROM") register, a hard disk, a removable disk, a compact disk read-only memory ("CD-ROM"), or any other recording medium known in the art.

[0094] An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. Alternatively, the storage medium may be integral to the processor. The processor and the storage medium may reside in an application specific integrated circuit ("ASIC"). Alternatively, the processor and the storage medium may reside as separate components.

[0095] FIG. 7A illustrates the process of a new block being added to the distributed ledger 720 according to an example embodiment, and FIG. 7B illustrates the contents of a new data block structure 730 for the blockchain according to an example embodiment. Referring to FIG. 7A, a client (not shown) can submit a transaction to blockchain nodes 711, 712, and 713. A client can be an instruction received from any source that specifies an activity on the blockchain 722. As an example, a client can be an application acting on behalf of a requester, such as a device, a person, or an entity to provide a transaction to the blockchain. Multiple blockchain peers (e.g., blockchain nodes 711, 712, and 713) can maintain a copy of the state of the blockchain network and the distributed ledger 720. Different types of blockchain nodes / peers can exist in a blockchain network, including endorsing peers that simulate and endorse transactions provided by clients, and committing peers that verify the endorsements, validate the transactions, and commit the transactions to the distributed ledger 720. In this embodiment, the blockchain nodes 711, 712, and 713 may perform the role of endorser nodes, committer nodes, or both.

[0096] The distributed ledger 720 includes a blockchain that is immutable and stores a sequential record of blocks and a state database 724 (current world state) that maintains the current state of the blockchain 722. One distributed ledger 720 can exist per channel, and each peer maintains its own copy of the distributed ledger 720 for each channel they are a member of. The blockchain 722 is a transaction log structured as hash-linked blocks, where each block contains a sequence of N transactions. Blocks can include various components as shown in FIG. 7B. Block links (represented by arrows in FIG. 7A) can be generated by appending a hash of the previous block's header into the block header of the current block. In this manner, all transactions in the blockchain 722 are sequenced and cryptographically linked to each other, preventing tampering with the blockchain data without breaking the hash links. Furthermore, because of the links, the latest block in the blockchain 722 represents all transactions that originated before it. The blockchain 722 only supports append-only blockchain workloads and can be stored on a peer's file system (local or attached storage).

[0097] The current state of the blockchain 722 and the distributed ledger 720 can be stored in a state database 724, where the current state data represents the latest values ​​for all keys contained in the blockchain 722 transaction log. Invocations of chaincode execute transactions against the current state in the state database 724. The state database 724 can contain an indexed view into the blockchain 722 transaction log, which can therefore be replayed from any point in time. The state database 724 can be automatically recovered (or generated if necessary) as soon as a peer starts up and before any transactions are accepted.

[0098] An endorsing node receives transactions from clients and endorses transactions based on the simulated results. An endorsing node holds a smart contract that simulates a transaction proposal. When an endorsing node endorses a transaction, it generates a transaction endorsement, which is a signed response from the endorsing node to the client node indicating the simulated transaction. The manner in which a transaction is endorsed depends on the endorsement policy, which 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 endorsed transaction is forwarded by the client application to the ordering service 710.

[0099] The ordering service 710 receives endorsed transactions, orders them into blocks, and distributes the blocks to committing peers. For example, the ordering service 710 can initiate a new block when a transaction threshold is reached, a timer times out, or otherwise. In the embodiment of FIG. 7A, blockchain node 712 is a committing peer that receives a new data block 730 of new data for storage in the blockchain 722. The first block in a blockchain can be referred to as a genesis block, which contains information about the blockchain, its members, the data stored within it, etc.

[0100] The ordering service 710 can be formed by a cluster of orderings. The ordering service 710 does not have transactions, smart contracts, or a shared ledger. Instead, the ordering service 710 receives endorsed transactions and determines the order in which those transactions are committed to the distributed ledger 720. The architecture of the blockchain network can be designed such that specific implementations of “ordering” (e.g., Solo, Kafka, BFT, etc.) are pluggable components.

[0101] 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 at the time of their commit to the network. Rather than as in cryptocurrency blockchains (such as Bitcoin) where ordering occurs through the solving of cryptographic puzzles or mining, in this embodiment, the parties to the distributed ledger 720 can choose the ordering mechanism that best suits their network.

[0102] When the ordering service 710 initiates a new data block 730, the new data block 730 can be broadcast to the committing peers (e.g., blockchain nodes 711, 712, 713). In response, each committing peer validates the transactions in the new data block 730 by checking to ensure that the read set and write set still match the current world state in the state database 724. In particular, the committing peers can determine whether the read data that existed at the time the endorser simulated the transaction is identical to the current world state in the state database 724. If the committing peers validate 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 from the read-write set. If a transaction fails, i.e., if a committing peer finds it to be inconsistent with the current world state in the read-write set state database 724, the transaction that was ordered into a block will still be included in that block, but it will be marked as invalid and the state database 724 will not be updated.

[0103] Referring to FIG. 7B, a new data block 730 (also referred to as a data block) stored on the blockchain 722 of the distributed ledger 720 can include a number of data segments, such as a block header 740, block data 750, and block metadata 760. It should be understood that the various illustrated blocks and their contents, such as the new data block 730, shown in FIG. 7B are merely illustrative and are not meant to be limitations of the example embodiment. The new data block 730 can store N transactions (or transactions) (e.g., 1, 10, 100, 500, 1000, 2000, 3000, etc.) in the block data 750. The new data block 730 can also include a link to a previous block (e.g., the blockchain 722 in FIG. 7A) in the block header 740. In particular, the block header 740 can include a hash of the header of the previous block. The block header 740 may also include a unique block number, a hash of the block data 750 of the new data block 730, etc. The block numbers of the new data block 730 are unique and may be assigned in various orderings, such as starting from zero and in incremental / sequential ordering.

[0104] The block data 750 may store transaction information for each transaction recorded in the new block 730. For example, the transaction data may include one or more of the transaction type, version, timestamp, distributed ledger 720 channel ID, transaction ID, epoch, payload visibility, chaincode path (placement tx), chaincode name, chaincode version, inputs (chaincode and function), client (generator) identifier such as public key and certificate, client signature, endorser identifier, endorser signature, provided hash, chaincode event, response status, namespace, read set (e.g., list of keys and versions read by the transaction), write set (e.g., list of keys and values), start key, end key, key list, Merkle tree query summary, etc.

[0105] According to various embodiments, the block data 750 may also store graph data 752 of existing chain code relationships between peers in the blockchain that support the new recommended chain code. The graph data 752 may include smart contracts represented as nodes with edges representing peers and relationships between them. The graph data 752 may include one or more steps, features, processes, or activities described or illustrated herein. Thus, the graph data 752 may be stored in an immutable log of blocks on the distributed ledger 720. Some of the benefits of storing the graph data 752 on the blockchain are referenced in various embodiments described and illustrated herein. In FIG. 7B, the graph data 762 is shown in the block data 750, but it may also be placed in the block header 740 or in the block metadata 760.

[0106] The block metadata 760 can store a number of fields of metadata (e.g., byte arrays, etc.). The metadata fields can include a signature, the last constituent block, a transaction filter that identifies valid and invalid transactions in the block, and an offset that persists to the end of the ordering service that ordered the block. The signature, last constituent block, and ordering metadata are added by the ordering service 710. Meanwhile, the committer of the block (blockchain node 712) adds a confirmation of valid / invalid, read / write set, etc. based on the endorsement policy. The transaction filter can include a byte array of size equal to the number of transactions in the block data 750 and a confirmation code that identifies whether the transaction is valid / invalid. In some embodiments, not shown in FIG. 7B, the block metadata 760 can store metadata of the recommended smart contract therein.

[0107] FIG. 7C illustrates an embodiment of a blockchain 770 for digital content, according to embodiments described herein. Digital content can include one or more files and associated information. Files can include media, images, video, audio, text, links, graphics, animations, web pages, documents, or other forms of digital content. The immutable append-only nature of the blockchain makes it suitable for use in legal proceedings, acting as a safeguard to protect the integrity, validity, and authority of digital content when admissibility rules apply, or when certification is considered, or when the presentation and use of digital information is otherwise valuable. In this case, the digital content can be referred to as a digital certificate.

[0108] A blockchain can be formed in a variety of ways. In one embodiment, digital content can be contained and accessed in the blockchain itself. For example, each block of the blockchain can store a hash value of reference information (e.g., headers, values, etc.) along with the associated digital content. The hash value and the associated digital content can then be encrypted together. Thus, 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 to reference previous blocks. This can be illustrated as follows: JPEG0007586605000001.jpg20153

[0109] In one embodiment, the digital content may not be included in the blockchain. For example, the blockchain may store an encrypted hash of each block that does not contain any digital content. The digital content may be stored in another storage area or memory address that is related to the hash value of the original file. 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 the value in the storage area that corresponds to the actual digital content. This operation may be performed, for example, by a database gatekeeper. This may be exemplified as follows: JPEG0007586605000002.jpg39153

[0110] In the embodiment of FIG. 7C, the blockchain 770 is made up of multiple cryptographically linked blocks 7781, 7782, ... 778 Nin an ordered sequence, where N >= 1. The cipher used to link the blocks 7781, 7782, ... 778N can be any number of keyed or unkeyed hash functions. In one embodiment, the blocks 7781, 7782, ... 778 N , 7781, 7782, ..., 7783, are subjected to a hash function that generates an n-bit alphabetic-numeric output (where n is 256 or some other 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 Secured Hash Algorithm) algorithms, Merkle-Damgard algorithms, HAIFA algorithms, Merkle tree algorithms, nonce-based algorithms, and non-collision resistant PRF algorithms. In another embodiment, blocks 7781, 7782, ..., 7784, are subjected to a hash function that generates an n-bit alphabetic-numeric output (where n is 256 or some other 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 Secured Hash Algorithm) algorithms, Merkle-Damgard N can be cryptographically linked by a function different from the hash function. For illustrative purposes, the following will be described with reference to the hash function SHA-2, for example.

[0111] Each block in the blockchain, 7781, 7782, ..., 778 N includes a header, a file version, and a value. The header and value are different for each block as a result of a hash in the blockchain. In one embodiment, the value can be included in the header. As described in more detail below, the file version can be the original file or a different version of the original file.

[0112] The first block 7781 of the blockchain is referred to as the genesis block and includes a header 7721, an original file 7741, and an initial value 7761. The hashing scheme used for the genesis block, and indeed all subsequent blocks, can vary. For example, all of the information in the first block 7781 can be hashed together in one go, or each or a portion of the information in the first block 7781 can be hashed separately, and then a hash of the separate hashed portions can be performed.

[0113] The header 7721 may include one or more initial parameters, such as a version number, a timestamp, a nonce, route information, difficulty level, consensus protocol, duration, media format, source, descriptive keywords, or other information related to the original file 7741. The header 7721 may be generated automatically (e.g., by blockchain network management software) or manually by a participant of the blockchain. Other blocks 7782, 7783 in the blockchain may also include a link to the original file 7741. N Instead, the header in the genesis block, 7721, does not reference any previous blocks, but this is simply because there are no blocks prior to it.

[0114] The original file 7741 in the genesis block can be data that has been captured by a device or that has not been processed prior to inclusion in the blockchain. The original file 7741 is received through an interface of the system from a device, media source, or node. The original file 7741 is accompanied by metadata, which can be generated, for example, by a user, device, or system processor, or a combination thereof, either manually or automatically. The metadata can be included in association with the original file 7741 in the first block 7781.

[0115] The value 7761 in the genesis 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 for the original file 7741, metadata about 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: 1) The SHA-2 hash value calculated for the original file 2) Original Device ID 3) The start timestamp of the original file 4) Initial location of original files 5) The blockchain network member ID for the software that currently controls the original file and associated metadata

[0116] Other blocks in the blockchain: 7782 to 778 N also has a header, a file, and a value. However, instead of the first block 7721, the headers 7721-7722 in the other blocks N Each of the remaining blocks contains the hash value of the previous block, which can just be the hash value of the header of the previous block, or the hash value of the entire previous block. By including the hash value of the preceding block in each of the remaining blocks, it becomes possible to perform a trace, as indicated by arrow 780, on a block-by-block basis from the Nth block back to the genesis block (and associated original files), establishing an auditable and immutable chain of protection.

[0117] Headers 7722 to 772 in other blocks NEach of the may also include, for example, a version number, a timestamp, a nonce, root information, a difficulty level, a consensus protocol, or other parameters or information associated with the corresponding file or blockchain in general, or both.

[0118] Files 7742-774 in other blocks N A block can be equal to the original file or can be a modified version of the original file in the genesis block, depending on, for example, the type of processing that has been performed. The type of processing that has been performed can vary from block to block. Processing can include any modification of the file in a previous block, such as preceding, reducing information or otherwise changing the content, removing information, or adding or attaching information to the file.

[0119] Additionally or alternatively, processing may include simply copying a file from a previous block, changing the 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 an action relative to the file on the blockchain or its associated metadata, or both.

[0120] Other blocks 7762~776 N are unique values, and all are different as a result of the operations performed. For example, the value of 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 is assigned. The value in the block therefore provides an identification of which operations were performed in the block, and also allows tracing through the blockchain back to the original file. This tracing enforces the chain of protection of the file across the blockchain.

[0121] For example, consider the case where portions of a file in a previous block have been shrunk, removed, or pixelated to protect the identity of individuals depicted in the file. In this case, the block containing the shrunk file would include metadata related to, for example, how the shrunk was performed, who performed the shrunk, a timestamp when the shrunk(s) occurred, etc. The metadata can be hashed to form a value. Because the metadata for the block is different from the information hashed to form the value in the previous block, the values ​​are different from each other and can be recovered when combined.

[0122] In one embodiment, the value of a previous block is updated (e.g., a new hash value is calculated) to form the value of a current block when one or more of the following occurs: In this embodiment, the new hash value may be calculated by hashing all or part of the information described below: a) A newly calculated SHA-2 hash value whenever a file is processed in any way (e.g., when the file is reduced, copied, replaced, accessed, or some other action is taken). b) The new storage location for the file c) any new metadata identified in association with the file; d) Transfer of access or control of a file from one blockchain participant to another blockchain participant.

[0123] FIG. 7D illustrates an example of a block that may represent the structure of a block in a blockchain 790 according to one embodiment. i Header 772 i , File 774 i , and the value 776 i Includes.

[0124] Header 772 icontains the hash value of the previous block, block i-1, and additional reference information, which can be any type of information (e.g., a header containing references, features, parameters, etc.) as discussed herein. Every block references the hash of the previous block, except of course for the genesis block. The hash value of the previous block can be just a hash of the header in the previous block, or a hash of all or part of the information in the previous block, including files and metadata.

[0125] File 774 i includes a number of data, successively Data1, Data2,...,DataN, which are metadata1, metadata2,..., metadataN that describe content or characteristics or both associated with the data. For example, the metadata for each data may include a timestamp of the data, keywords including data processing, personal or other content indicated within the data, or legality and other characteristics that may assist in establishing the content of the file as a whole, or a combination thereof, and in particular, information indicating its use as a digital certificate, for example, as described in connection with the embodiments described below. In addition to the metadata, each data may include a reference value, REF1, REF2,...,REF, to the previous data for anti-tampering, file differentiation, and sequential referencing through the file. N Can be tagged with.

[0126] Once metadata is assigned to data (e.g., a smart contract), it cannot be changed without changing the hash, which makes invalidation easily identifiable. The metadata therefore creates a data log of information that can be accessed for use by participants in the blockchain.

[0127] Value 776 iis a hash value, or other value calculated based on any of the types of information discussed previously. For example, for any given block, block i For a block, the value for that block may be updated to reflect operations performed on that block, such as a new hash value, a new storage location, new metadata for the associated file, a transfer of control or access, an identifier, or other actions or information that may be added. Although the values ​​in each block are shown to be separate from the metadata for the file's data, the values ​​may be based in part or entirely on this metadata in another embodiment.

[0128] Once the blockchain 770 is created, at any point in time, one can obtain an immutable chain of protection for a file by querying the blockchain for the transaction history of a value across blocks. This query, or tracking procedure, can be done by searching for the most recently introduced (e.g., last(N th ) block, and then continue to decrypt the values ​​of other blocks until the genesis block is reached and the original file is recovered. Decryption also involves decoding the header and file, and associated metadata, in each block.

[0129] Decryption is performed based on the type of encryption that occurred within each block. This can include the use of a private key, a public key, or a public-private key pair. For example, if non-asymmetric cryptography is used, blockchain participants, i.e., processors on the network, can generate a public key and a private key pair using a pre-determined relationship. The public and private keys are related to each other through some mathematical relationship. The public key can be widely distributed to act as an address, e.g., an IP address or a home address, to receive messages from other users. 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 only be assured that the sender sent this message.

[0130] Generating a key pair can be similar to creating an account on the blockchain, except that there does not need to be an actual registrant anywhere. Also, every transaction performed on the blockchain is digitally signed by the sender using their private key. This signature allows only the account owner to track and transact (if within the permissions determined by the smart contract) files on the blockchain.

[0131] 8A and 8B show additional embodiments of blockchain use cases that may be included and used herein. In particular, FIG. 8A shows an example 800 of a blockchain 810 that stores machine learning (artificial intelligence) data. Machine learning relies on vast amounts of historical data (or training data). Machine learning software (e.g., neural networks, etc.) can often shift through millions of records and discover non-intuitive patterns.

[0132] In the example of FIG. 8A, a host platform 820 builds and deploys machine learning models to predictively monitor assets 830, where the host platform 820 can be a cloud platform, an industrial server, a web server, a personal computer, a user device, etc. The assets 830 can be any type of asset (e.g., machinery or equipment, etc.), such as aircraft, locomotives, turbines, medical instruments and equipment, oil and gas equipment, boats, ships, vehicles, etc. As another example, the assets 830 can be non-transient assets, such as stocks, currencies, digital coins, etc.

[0133] The blockchain 810 can be used to significantly improve both the process of training 802 the machine learning models and the process of predicting 804 based on the trained machine learning models. For example, instead of requiring a data scientist / engineer or other user to collect the data at 802, the historical data can be stored on the blockchain 810 by the assets 830 themselves (or through an intermediary, not shown). This can significantly reduce the collection time required by the host platform 820 when performing training of the predictive model. For example, using smart contracts, the data can be transferred directly and easily straight from its original location to the blockchain 810. By using the blockchain 810 to ensure the security and ownership of the collected data, the smart contract allows the direct transmission of data from the assets to the individuals who will use it to build the machine learning models. This allows the data to be shared between the assets 830.

[0134] The collected data can be stored in the blockchain 810 based on a consensus mechanism. The consensus mechanism is configured to ensure that the recorded data is verified and accurate (permissioned nodes). The recorded data is time-stamped, cryptographically signed, and immutable. It is therefore auditable, transparent, and secure. In addition to IoT devices writing directly to the blockchain, in certain cases (i.e., supply chain, health care, transportation, etc.), both the frequency and accuracy of the data recorded is increasing.

[0135] Further, training of the machine learning model on the collected data may undergo iterative refinement and testing by the host platform 820. Each iteration may be based on additional data or data not previously considered to help expand the knowledge of the machine learning model. In 802, the different training and testing steps (and the associated data) may be stored on the blockchain 810 by the host platform 802. Each refinement of the machine learning model (e.g., changes to variables, weights, etc.) is stored on the blockchain 810. This provides a verifiable proof of how the model was trained and what data was used to train the model. Further, if the host platform 820 arrives at a final model, the resulting model may be stored in the blockchain 810.

[0136] After the model is trained, it can be deployed in a live environment where predictions / decisions can be made based on the implementation of the last trained machine learning model. For example, at 804, the machine learning model can be used for condition-based maintenance (CBM) of assets such as aircraft, wind turbines, health care equipment, etc. In this example, data fed back from the asset 830 can be input to the machine learning model and used to make event predictions such as failure events, error codes, etc. Decisions made by execution of the machine learning model on the host platform 820 are stored in the blockchain 810 to provide auditable / verifiable proof. As one non-limiting example, the machine learning model can predict future damage / failure of a part of the asset 830 and generate an alert or notification for replacement of the part. The data behind this decision is stored by the host platform 820 on the blockchain 810. In one embodiment, the features and / or activities described and / or illustrated herein can occur on or in connection with the blockchain 810.

[0137] New transactions to the blockchain can be collected into a new block and added to the existing hash value. This is then encrypted to generate a new hash for the new block. The result is a chain of blocks, each of which contains the hash values ​​of all previous blocks. The computers that store these blocks periodically compare their hash values ​​to ensure that they all match. Any that do not match will cause the record to be marked as problematic and discard the record. While this approach is not perfect, it is good at ensuring the tamper-resistance of the blockchain.

[0138] One way to play against the system is for a dishonest user to modify the list of transactions while leaving the hash unchanged in their preferences. This can be done by brute force, i.e. by modifying the record, encrypting the result, and checking if the hash value is identical. If not, it tries again, and again, and again, until the hash finds a match. The security of the blockchain is based on the belief that ordinary computers can only carry out this kind of brute force attack over completely unrealistic timescales, such as the lifetime of the universe. Quantum computers, in contrast, are faster (thousands of times faster) and thus pose a much greater threat.

[0139] 8B shows an embodiment 850 of a quantum secure blockchain 852 that implements quantum key distribution (QKD) to defend against quantum computing attacks. In this embodiment, users of the blockchain can verify each other's identity using QKD, which sends information using quantum particles such as photons that cannot be copied by eavesdropping without destroying them. In this way, senders and recipients through the blockchain can verify each other's identity.

[0140] In the embodiment of Figure 8B, there are four users 854, 856, 858, and 860. Each pair of 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, and therefore the QKD AB , QKD AC , QKD AD , QKD BC , QKD BD , and QKD CDSix different private keys 862 are used, including 1. Each pair can generate QKD by sending information using quantum particles, such as photons, that cannot be copied by eavesdropping without destroying them. In this way, each pair of users can verify the identity of the other.

[0141] The operation of the blockchain 852 is based on two steps (i) the creation of transactions, and (ii) the construction of blocks that aggregate new transactions. New transactions can be created in the same way as in a traditional blockchain network. Each transaction can contain the sender, the recipient, the time of creation, the amount (or value) to be transferred, and a list of reference transactions that justify the sender having the funds for the operation. This transaction is then sent to all other nodes, where it is placed in a pool of unconfirmed transactions. Now, two parties (i.e., a pair of users between 854-860) attest to the transaction by providing their shared private key 862 (QKD). This quantum proof can be attached to each transaction, making it extremely difficult to tamper with. Each node checks their entries against its local copy of the blockchain 852 to ensure that each transaction has sufficient funds. However, the transaction is still not confirmed.

[0142] Instead of performing a traditional mining process on a block, the block can be generated in a decentralized manner using a broadcast protocol. At a given time interval (e.g., seconds, minutes, hours, etc.), the network can apply the broadcast protocol to any unconfirmed transactions, thereby achieving Byzantine consensus on the correct version of the transaction. In a first round, the nodes communicate their secret values ​​to each other. In subsequent rounds, the nodes communicate the information they received in previous rounds from other nodes. Now, honest nodes can generate a complete set of transactions in a new block. This new block can be added to the blockchain 852. In one embodiment, the features and / or acts described and / or illustrated herein can occur on or in connection with the blockchain 852.

[0143] 9 illustrates an example system 900 that supports one or more example embodiments described and / or illustrated herein. System 900 includes a computer system / server 902 that operates in conjunction with numerous other general purpose or special purpose computing environments or configurations. Examples of well-known computing systems, environments, and / or configurations suitable for use with computer system / server 902 include, but are not limited to, personal computer systems, server computer systems, thin clients, thick clients, handheld or laptop devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronics devices, network PCs, minicomputer systems, mainframe computer systems, and distributed cloud computing environments that include any of the above-mentioned systems or devices.

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

[0145] 9, 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 coupling various system components including the system memory 906 and the processor 904.

[0146] A bus may represent any of several types of one or more bus structures, including a memory bus or memory controller, a peripheral bus, a graphics accelerator 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 Industry Standard Architecture (ISA) bus, Micro-Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Interconnect (PCI) bus.

[0147] The computer system / server 902 typically includes a variety of computer system readable media. Such media can be any available media accessible by the computer system / server 902, including volatile and non-volatile media, removable and non-removable media. The system memory 906, in one embodiment, implements the flow diagrams of the other figures. The system memory 906 can include computer system readable media in the form of volatile memory, such as random access memory (RAM) 910 or cache memory 912. The computer system / server 902 can also include other removable / non-removable, volatile / non-volatile, computer system storage media. By way of example only, a storage system 914 can be provided for reading from and writing to a non-removable, non-volatile magnetic medium (not shown, but typically referred to as a "hard drive"). Although not shown, a magnetic disk drive for reading from and writing to a removable non-volatile magnetic disk drive (e.g., a "floppy disk"), and an optical disk drive for reading from and writing to a CD-ROM, DVD-ROM, or other optical media, may be provided. In such an example, each may be connected to the bus by one or more data media interfaces. As further shown and described below, memory 906 may include at least one program product that includes a set (e.g., at least one) of program modules configured to perform the functions of various embodiments.

[0148] Programs / utilities 916 may include a set (at least one) of program modules 918, in addition to an operating system, one or more application programs, other program modules, and program data, stored in memory 906. One or more of the operating system, one or more application programs, other program modules, and program data, or some combination thereof, may each include an implementation of a network environment. Programs 918 generally perform the functions and / or methodologies of the various embodiments.

[0149] As will be appreciated by one of ordinary skill in the art, aspects of the present application may be embodied as a system, method, or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (such as firmware, resident software, microcode, etc.), or an embodiment combining software and hardware aspects, which may be generally referred to herein as a "circuit," "module," or "system." Additionally, aspects of the present application may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.

[0150] The computer system server 902 may also be capable of communicating with one or more external devices 920, such as a keyboard, pointing device, display 922, one or more devices that allow a user to interact with the computer system / server 902, or any device (e.g., a network card or modem) that allows the computer system / server 902 to communicate with one or more other computing devices, or any combination thereof. Furthermore, the computer system / server 902 may communicate with one or more networks, such as a local area network (LAN), a general wide area network (WAN), or a public network (Internet), or a combination thereof, via 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 other hardware and / or software components, not shown, could be used in combination with the computer system / server 902. Examples include, but are not limited to, microcode, device drivers, redundant processing units, and external disk drive arrays, RAID systems, tape drives, and data archive storage systems.

[0151] Although at least one example embodiment of the system, method, and non-transitory computer-readable medium has been illustrated in the attached drawings and described in the detailed description above, it will be understood that the present application is not limited to the disclosed embodiments, but rather that numerous rearrangements, modifications, and substitutions are possible, as defined above and in the following claims. For example, the capabilities of the systems of the various figures may be performed by one or more of the modules or components described herein or a distributed architecture, and may include pairs of transmitters, receivers, or both. For example, all or part of the functions performed by individual modules may be performed by one or more of those modules. Furthermore, the functions described herein may be performed at various times and at various events internal or external to the modules or components. Additionally, information sent between the various modules may be transmitted between the modules via at least one of: a data network, the Internet, a voice network, an Internet Protocol network, a wireless device, a wired device, or multiple protocols, or a combination thereof. Additionally, messages sent or received by any module may be sent or received directly or by one or more other modules or a combination thereof.

[0152] Those skilled in the art will recognize that the "system" may be embodied as a personal computer, a server, a console, a personal digital assistant (PDA), a cell phone, a tablet computing device, a smart phone, or any other suitable computing device or combination of devices. The presentation of the above functions performed by the "system" is not intended to limit the scope of the present application, but in any way to provide one embodiment of many embodiments. Indeed, the methods, systems, and apparatus described herein may be implemented in localized and distributed configurations consistent with computing technology.

[0153] It should be noted that some of the features of the system described herein have been presented as modules to more particularly emphasize their implementation independence. For example, the modules may be implemented as customized very large scale integrated (VLSI) circuits or gate arrays, off-the-shelf semiconductors such as logic chips, transistors, or other discrete components. The modules may also be implemented in field programmable gate arrays, programmable array logic, graphics processing units, and the like.

[0154] The modules may also be implemented, at least in part, in software for execution on various types of processors. The identified units of executable code may, for example, comprise one or more physical or logical blocks of computer instructions, which may be organized, for example, as an object, procedure, or function. Nevertheless, the executable nature of the identified modules may comprise disparate instructions stored in different locations that do not necessarily have to be physically located together, but which, when logically coupled together, constitute modules and achieve the purposes described above. Furthermore, the modules may be stored on a computer readable medium, such as a hard disk drive, a flash device, a random access memory (RAM), a tape, or any other medium used to store data.

[0155] Indeed, a module of executable code may be a single instruction or many instructions, and may even be distributed across several different code segments, among different programs and across several different memory devices. Similarly, operational data may be identified and described as being in a module, and may be embodied in any suitable form and organization in any suitable type of data structure. Operational data may be distributed across different locations, including in a single data set or across different storage devices, and may exist at least in part solely as electronic signals over a system or network.

[0156] The components of the application, as generally described herein and illustrated in the figures, could be arranged and designed in a wide variety of different configurations. Thus, the description of the embodiments is not intended to limit the scope of the application as claimed, but rather is merely representative, selected embodiments of the application.

[0157] Those skilled in the art will readily appreciate that the above may be implemented in a different sequence of steps, or with different configurations of hardware elements than those described, or both. Thus, while the present application has been described in accordance with preferred embodiments thereof, certain modifications, variations, and alternative configurations will be apparent to those skilled in the art.

[0158] Although preferred embodiments of the present application have been described, the described embodiments are merely exemplary, and the scope of the present application should be defined by the appended claims when considered along with the full scope of equivalents and modifications thereto (e.g., protocols, hardware devices, software platforms, etc.).

Claims

1. An apparatus comprising: a storage configured to store existing chaincode relationships between a group of blockchain peers in a blockchain network as a graph in which peers and existing chaincodes are represented by nodes having edges that represent relationships between said peers and said existing chaincodes; a processor configured to mine the graph to identify chain code relationships between the peers, run a machine learning model on the identified chain code relationships, and identify a new chain code for connecting two or more peers between the group of blockchain peers of the blockchain network that are not connected via an existing chain code; a network interface configured to communicate messages to one or more of the blockchain peers, the messages including suggestions for implementing the new chain code; An apparatus comprising:

2. the storage is configured to store an identifier of a chaincode that exists as a first set of nodes on the graph, an identifier of each of the group of blockchain peers that exists as a second set of nodes on the graph, and the processor is configured to join the first set of nodes corresponding to the existing chaincodes and the second set of nodes corresponding to the blockchain peers with edges based on relationships of the existing chaincodes.

2. The apparatus of claim 1.

3. the processor is configured to identify the new chain code based on chain code patterns mined from the chain code relationships present in the graph.

3. The apparatus of claim 2.

4. The processor is further configured to predict, based on attributes included in relationships of the existing chaincodes, a set of attributes to be included in the new chaincode via one or more machine learning algorithms of the machine learning model.

2. The apparatus of claim 1.

5. the new chaincode includes a change to one or more attributes of an established chaincode relationship between two blockchain peers; 2. The apparatus of claim 1.

6. the new chain code includes new chain code relationships between two or more blockchain peers corresponding to new edges in the graph; 2. The apparatus of claim 1.

7. The processor is further configured to receive an offer to implement the new chaincode from one or more of the blockchain peers.

2. The apparatus of claim 1.

8. The processor is further configured to receive a rejection to implement the new chaincode from one or more blockchain peers, and in response, store information about the rejection for the new chaincode for future predictions.

2. The apparatus of claim 1.

9. The processor is further configured to receive a modification of one or more attributes of the new chain code and activate the modified new chain code in the blockchain network.

2. The apparatus of claim 1.

10. 1. A computer-implemented method comprising: storing chaincode relationships that exist between a group of blockchain peers in a blockchain network as a graph in which peers and existing chaincodes are represented by nodes with edges that represent relationships between said peers and said existing chaincodes; mining the graph to identify chain code relationships between the peers; running a machine learning model on the identified chaincode relationships to identify a new chaincode for connecting two or more peers among the group of blockchain peers of the blockchain network that are not connected via an existing chaincode; communicating a message to one or more of the blockchain peers including suggestions for implementing the new chain code; The method includes:

11. The storing includes storing identifiers of existing chaincodes as a first set of nodes on the graph, storing identifiers of each of the group of existing blockchain peers as a second set of nodes on the graph, and connecting the first set of nodes corresponding to the existing chaincodes with the second set of nodes corresponding to the blockchain peers with edges based on relationships of the existing chaincodes; The method of claim 10.

12. identifying the new chain code includes identifying the new chain code based on chain code patterns mined from relationships of the chain codes present in the graph; The method of claim 11.

13. identifying the new chain code further includes predicting a set of attributes to be included in the new chain code via one or more machine learning algorithms of the machine learning model based on attributes included in existing chain code relationships; The method of claim 10.

14. the new chaincode includes a change to one or more attributes of an established chaincode relationship between two blockchain peers; The method of claim 10.

15. the new chain code includes new chain code relationships between two or more blockchain peers corresponding to new edges in the graph; The method of claim 10.

16. and receiving an offer to implement the new chain code from one or more of the blockchain peers. The method of claim 10, comprising:

17. and receiving a rejection to implement the new chaincode from one or more blockchain peers, and responsively storing information about the rejection for the new chaincode for future predictions. The method of claim 10, comprising:

18. and receiving a modification of one or more attributes of the new chain code and activating the modified new chain code in the blockchain network. The method of claim 10, comprising:

19. 1. A computer-readable medium containing instructions which, when read by a processor, cause the processor to perform a method, the method comprising: storing chaincode relationships that exist between a group of blockchain peers in a blockchain network as a graph in which peers and existing chaincodes are represented by nodes with edges that represent relationships between said peers and said existing chaincodes; mining the graph to identify chain code relationships between the peers; running a machine learning model on the identified chaincode relationships to identify a new chaincode for connecting two or more peers among the group of blockchain peers of the blockchain network that are not connected via an existing chaincode; communicating a message to one or more of the blockchain peers including suggestions for implementing the new chain code; A computer-readable recording medium comprising:

20. and identifying the new chain code further includes predicting a set of attributes to be included in the new chain code via one or more machine learning algorithms based on attributes included in existing chain code relationships.

20. The recording medium according to claim 19.

21. A computer program product for causing a computer to execute the method according to any one of claims 10 to 18.

Citation Information

Patent Citations

  • Systems and methods for secure smart contract execution via read-only distributed ledger

    US10333694B1

  • Application recommendation system

    US20130185292A1

  • Contextually-aware recommendations for assisting users with task completion

    US20190220438A1

  • Managing a smart contract in real-time

    WO2019159187A1