Abstract: A method, computer system, and a computer program product for blockchain enabled crowdsourcing is provided. The present invention may include receiving an asset from a content provider. The present invention may also include deploying a smart contract based on the received asset, wherein the deployed smart contract includes a plurality of compensation rules. The present invention then may include partitioning the received asset into a plurality of fragments based on the deployed smart contract. The present invention may further include releasing the partitioned plurality of fragments into a blockchain network. The present invention may also include tracking each fragment within the released plurality of fragments using the smart contract.

Abstract: An example operation may include one or more of receiving a request associated with a key-value pair stored in a database, determining whether a state of the key-value pair has changed since a most recently received request, and in response to a determination that the state of the key-value pair has changed, generating a data block that includes a changed state of the key-value pair and adding the generated data block to a hash-linked chain of data blocks.

Abstract: An example operation may include one or more of storing a data block that is included within a sequential chain of data blocks and which comprises a probabilistic data structure stored therein, receiving a request to verify another data block, determining whether a probabilistic hash of the other data block is included within the probabilistic data structure of the stored data block, and in response to a determination that the hash of the other data block is included within the probabilistic data structure, storing an indicator that the other data block is included within the sequential chain of data blocks.

Abstract: Disclosed are a computer-hosted database system providing cryptographic verifiability and comprising an immutable key-value data store and cryptographic proof data (which may be stored in a Merkle Hash Tree). The logical structure of a data record is defined by a rich data model and comprises a first field and a second field. Disclosed is a method that comprises receiving an instruction requesting retrieval of first field data and returning the data stored in the first field and cryptographic proof data sufficient to prove data originality of the first field data without knowledge of the data in the second field. The rich data model may be a relational data model or a document data model.

Abstract: An example operation may include one or more of generating, by a first blockchain client, a transaction to a blockchain network to transfer a document, transferring over a private channel, by a second blockchain client, a first key to the first blockchain client, the private channel providing a point-to-point connection between the first and second blockchain clients, encrypting the document using a shared key, transferring, by the first blockchain client, the encrypted document over the private channel, generating, by the second blockchain client, a transaction to acknowledge receipt of the encrypted document, and transferring the shared key encrypted with the first key.

Abstract: An example operation may include one or more of receiving an asset from an asset owner, initiating an integrity of the asset and entering the asset into a primary chain of genesis, signing the asset and locking the asset in the primary chain of genesis, manifesting the asset as a linked asset in a derivative chain of genesis, detecting a timeout of the asset in the primary chain of genesis, ending a life cycle of the asset in the primary chain of genesis, and creating a new asset in the derivative chain of genesis based on the asset.

Abstract: An example operation may include one or more of storing a broadcast encryption tree comprising a set of cryptographic keys disposed in a hierarchical tree format, distributing a partial set of keys from the broadcast encryption tree to each respective peer from among a group of peers included in a blockchain network, receiving, from a user device, an identification of at least one peer included in the group of peers for processing a blockchain transaction, selecting a subset of keys from among the set of cryptographic keys in the broadcast encryption tree which enables at least one peer to decrypt transactions and doesn't enable the remaining peers included in the group of peers to decrypt transactions, and transmitting broadcast encryption information about the selected subset of keys to the user device for performing encryption of the transactions.

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.