Abstract: A processor may analyze each instance of digital assets. The processor may identify, respectively, one or more rules that are applicable to each of the digital assets. The determination of the one or more rules is identified by a compliance mechanism. The processor may validate the one or more rules against each of the digital assets in context of a first user and a second user. The processor may endorse the transfer of the multi-asset digital wallet with a compliance mechanism signature.

Abstract: An example operation may include one or more of connecting, by an asset server, to a source blockchain configured to store a digital asset of an asset owner, enciphering and locking, by the asset server, the asset in the source blockchain, manifesting, by the asset server, the asset as a linked asset in a target blockchain, tracking, by the asset server, a life cycle of the asset, detecting, by the asset server, an end of the life cycle of the asset, reflecting, by the asset server, the end of the life cycle of the asset in the source blockchain, and creating, by the asset server, the asset in the target blockchain.

Abstract: A computer-implemented system and method provide a privacy preserving token generation protocol. The method comprises initiating an order request, where the order request includes order public information and order private information. The method further comprises generating an address in a blockchain network that includes encrypting the address using a private key, and generating a hash of data incorporating the order private information and a signature of the hash. The signature of the hash is generated using the private key. The method further comprises transmitting the order request with the address, hash, and signature to a transport associated with the order, and identifying that the transport fulfilled the order request. The method further comprises validating that the transport fulfilled the order, calculating a token value associated with the transport, where the token value is related to a carbon emission footprint of the transport, and assigning the token value to the address.

Abstract: An example operation may include one or more of identifying a new member (M1) to a permissioned database, creating a new group including the new member and one or more previously identified members (MP), modifying a world state of the permissioned database to identify a set of members in the new group with access to the permissioned database, and responsive to the new member (M1) being identified, creating a new entry (TX1) to the permissioned database using an encryption key (K1) associated with the new member (M1).

Abstract: An example operation may include one or more of identifying a blockchain transaction, storing the blockchain transaction in a blockchain, assigning the blockchain transaction a transaction number and a block number, hashing a portion of blockchain transaction data associated with the blockchain transaction, and updating a blockchain index based on the hashed portion of the blockchain transaction.

Abstract: An example operation may include one or more of generating, by a block generator, modified blocks for source ledgers, receiving a merge request to merge a plurality of source ledgers into a merged ledger, identifying the plurality of source ledgers, generating a genesis block from modified blocks of the identified source ledgers, ordering blocks, by a committer node or peer, in the merged ledger based on the genesis block, and validating a block order in the merged ledger.

Abstract: An example operation may include one or more of generating evidence for a set of transactions, wherein the generating of the evidence comprises identifying one or more blocks containing one or more of the transactions in the set of transactions, and generating a branch of a hash tree of the set of transactions for each of the one or more blocks.

Abstract: An example operation may include one or more of a method for providing a one-step transaction submission in a blockchain network, comprising sending a transaction proposal, by a client node, to one or more peers of a plurality of peers, simulating a transaction associated with the transaction proposal, by at least one peer of the plurality of peers, evaluating, by an endorser peer, whether an endorsement policy has been fulfilled, and when the endorsement policy has been fulfilled, sending the transaction to at least one orderer node to be committed to a ledger, by the endorser peer.

Abstract: A processor may receive a request for storage in a blockchain network. The request may include information as to a specific storage that is required. The processor may commit the request to the blockchain network. The processor may provide the request to one or more proposing entities. The processor may receive, from the one or more proposing entities, respective proposals in response to the request for storage. The processor may determine which of the respective proposals best match the information included in the request. The processor may automatically accept the best matched proposal.

Abstract: An example operation may include one or more of: receive a first set of annotation information, determine a first approval decision for the first set of annotation information, record the first approval decision in a blockchain, retrieve a first set of approval decisions from the blockchain, generate a consensus based on the first set of approval decisions, and record the consensus in the blockchain.

Abstract: An example operation may include one or more of obtaining a machine-readable code from a first document among a set of documents, extracting a probabilistic data structure from the machine-readable code which includes probabilistic hashes accumulated from the set of documents, determining whether a document hash of a second document is included within the probabilistic data structure, and in response to a determination that the document hash is included within the probabilistic data structure, outputting a notification indicating the second document is included in the set of documents.

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: An example operation may include one or more of storing an object across a plurality of shards of a database, generating a sequence of local hash values from the plurality of shards based on respective object content stored locally within the plurality of shards, converting the sequence of local hash values from the plurality of shards into a global hash value for the database, and storing an identifier of the object paired with the global hash value in the database.

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: 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 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 processor may receive a request for storage in a blockchain network. The request may include information as to a specific storage that is required. The processor may commit the request to the blockchain network. The processor may provide the request to one or more proposing entities. The processor may receive, from the one or more proposing entities, respective proposals in response to the request for storage. The processor may determine which of the respective proposals best match the information included in the request. The processor may automatically accept the best matched proposal.

Abstract: An example operation may include one or more of receiving, by a committer node or peer of a blockchain network, a block comprising a lock request that locks a partial state of a smart contract, the lock request comprising a submitter identifier and a lock delay, the committer node or peer configured to process blocks of transactions, the method further comprising, validating the lock request, committing transactions comprising the submitter identifier with no delay, and committing transactions not comprising the submitter identifier after the lock delay.

Abstract: A method, computer system, and a computer program product for communicating between a bicycle and a vehicle to prevent vehicle open door accidents is provided. The present invention may include determining, by a bicycle device, a bicycle is in a stationary state. The present invention may then include sending, by the bicycle device, a request to a user to confirm that the bicycle is in the stationary state. The present invention may further include receiving, from the user, a response to the sent request, wherein the user confirms that the bicycle is in an active state.

Abstract: An example operation may include one or more of receiving, by a broadcast server node, data from a plurality of data provider nodes; and executing, by the broadcast server node, a smart contract to: encrypt the data with encryption keys; generate a broadcast queue based on the encrypted data; and assign a subset of consumer nodes authorized to receive the encrypted data of the broadcast queue.