Abstract: An example operation includes one or more of receiving a request associated with a software library, identifying metadata of the software library, determining, via chaincode, whether data of the software library has been previously stored on a blockchain, and in response to a determination that the software library has not been previously stored, storing the identified metadata of the software library and a notarization value generated by the chaincode within the blockchain.

Abstract: Aspects create a tree data structure that indexes a collection of documents present in a data repository at a point in time. The tree data structure includes a plurality of nodes. For each such node, a respective root hash value of that node is determined. The root hash value of a leaf node is determined from hash value(s) for element(s) of that node that are keyed to documents in the collection. The root hash value of a parent node is determined from a root hash value for each of its child nodes. For a given document that is purported to be a target document present in the data repository at the point in time, processing is performed that uses the tree data structure in facilitating verification that the given document is the target document. This includes providing a cryptographic proof to demonstrate whether the given document is the target document.

Abstract: An example operation may include one or more of receiving, from a client, a pruned data structure that comprises a plurality of fields and a plurality of hash values, respectively, identifying a schema associated with the pruned data structure, determining whether the pruned data structure is a valid based on the plurality of fields in the data structure and the identified schema associated with the client, and in response to a determination that the pruned data structure is valid, committing the pruned data structure to a blockchain.

Abstract: An example operation may include one or more of selecting, by a peer, a block from a blockchain based on a selected smart contract of a plurality of smart contracts, requesting, by the peer, transactions associated with the selected smart contract, confirming, by the peer, that received transactions associated with the selected smart contract belong to the selected block, verifying, by the peer, that all of the requested transactions associated with the selected smart contract have been received, and synchronizing, by the peer, the selected smart contract based on the received transactions.

Abstract: The processor may collect, from a first peer, a first data set associated with a channel. The channel may include one or more assets associated with a first peer. The channel may link the first peer to a second peer. The processor may analyze the first data set to determine a first status for the one or more assets. The processor may provide the first status of the one or more assets in a viewable channel to the blockchain network.

Abstract: A member of a group in a blockchain network may generate a public key and a private key, request a blockchain network group certificate, associated with the private key, from a blockchain network certificate authority, and distribute a private key to members of the group.

Abstract: An example operation may include one or more of receiving a storage request which comprises respective data sets generated by a plurality of endorser peers via simulation of a blockchain request, detecting that a key value of a data set generated by a first endorser peer is different than a respective key value of a data set generated by a second endorser peer, and committing the storage request to a data block of a blockchain in response to verifying that the detected different key values generated by the first and second endorser peers correspond to a multi-value key of the blockchain request.

Abstract: A computer-implemented system and related method process a smart contract. The method uses a processor for processing a smart contract that receives a transaction proposal (TP) from a blockchain client. The processor determines a pre-endorsement result (PER) that is associated with the TP, analyzes, according to a pre-endorsement agreement logic, the PER to produce an agreed result, and endorses the agreed result. The processor sends, to the blockchain client, the endorsed agreed result.

Abstract: An example operation may include one or more of sending a transmission process from a client with an application, the application coupled to the client, receiving the transmission process from the client via a multistate peer network, the multistate peer network includes a ledger, an endorsement policy, and a smart contract, generating, from the transmission process, a multistate endorsement based ledger process, establishing a threshold state logic and a final state logic via the smart contract, the threshold state logic is set by the minimum number of endorsements required to commit to the ledger set by the endorsement policy, a commitment to the ledger triggers the final state logic, and executing post-settlement processes via the final state logic.

Abstract: An example operation may include one or more of splitting a session key into a plurality of partial shares, distributing the plurality partial shares to a plurality of content providers, respectively, where each content provider receives a different partial share of the session key, encrypting a stream of media content based on the session key, and transmitting the encrypted stream of digital content to a user device which has one or more partial shares among the plurality of partial shares.

Abstract: An example operation may include one or more of receiving, from a client, a pruned data structure that comprises a plurality of fields and a plurality of hash values, respectively, identifying a schema associated with the pruned data structure, determining whether the pruned data structure is a valid based on the plurality of fields in the data structure and the identified schema associated with the client, and in response to a determination that the pruned data structure is valid, committing the pruned data structure to a blockchain.

Abstract: An example operation may include one or more of storing data within a temporary memory structure, transferring the stored data from the temporary memory structure into a set of files of a log-structured merge-tree, generating a respective sequence of hashes within each file of the set of files, where the respective sequence of hashes provides proof of a sequential order in which data values are stored within the respective file, and storing the sequences of hashes in storage.

Abstract: A node in a blockchain network may agree, on an authority accept a compliance module from the authority, accept the compliance module. The node may also receive an operation, verify a compliance of the operation based on the compliance module, add the verified operation to a ledger on the blockchain network.

Abstract: An example operation may include one or more of splitting a session key into a plurality of partial shares, distributing the plurality partial shares to a plurality of content providers, respectively, where each content provider receives a different partial share of the session key, encrypting a stream of media content based on the session key, and transmitting the encrypted stream of digital content to a user device which has one or more partial shares among the plurality of partial shares.

Abstract: A computer-implemented method for configuring a blockchain network, a computer program product for integrating device identity into a permissioning framework of a blockchain network, and a blockchain network. One embodiment may comprise registering a device at a delineate node of a blockchain network, creating, by a processor of the delineate node based on the registering, a profile for the device; an performing, by the processor of the delineate node, a pass-through service for the device. The registering may include receiving, by a network interface, an immutable device identity from the device.

Abstract: A plurality of ledger nodes within a blockchain infrastructure is continuously updated via a set of conduit nodes. The set of conduit nodes share a secure provision ledger. The secure provision ledger includes a set of updates for the blockchain infrastructure. Each conduit node within the set propagates the set of updates to a subset of the plurality of ledger nodes.

Abstract: Device configuration based on predicting a health affliction. A process acquires measurements of conditions that a user is experiencing. The process predicts, based on the measurements, whether the user will experience a particular health affliction. Based on predicting that the user will experience the particular health affliction, the process configures devices of an environment in which the user is present to reduce effects of the devices on symptoms of the particular health affliction. The configuring includes adjusting a respective at least one state of each device of the devices.

Abstract: A node in a blockchain network may receive an endorsed operation for a blockchain network, apply the operation; include a list comprising the operation in a subsequent block, and commit the subsequent block to a ledger of the blockchain network.

Abstract: A scheduler node in a blockchain network may receive data associated with a machine learning model. The scheduler node may measure a drift of the machine learning model for a first aspect of the data. The scheduler node may determine if the drift of the machine learning model is greater than a threshold. The scheduler node may schedule, in response to the drift being greater than the drift threshold, a retraining transaction for the machine learning model.

Abstract: An example operation may include one or more of receiving a request to store a data block on a hash-linked chain of data blocks, dynamically selecting a subset of non-consecutive data blocks which have been previously stored within the hash-linked chain of data blocks, generating a linking hash based on a hash value of the data block to be stored and an accumulation of hash values from the subset of non-consecutive data blocks, and adding the data block to the hash-linked chain of data blocks, wherein the added data block includes the linking hash stored therein.