Abstract: An example operation may include one or more of generating, by a data management node, a profile token based on a data profile of a data provider (DP) node, receiving, by the data management node, a transaction request from a service provider (SP) node to access data from the DP node over a blockchain, acquiring, by the data management node, consent of the SP node based on the profile token, generating, by the data management node, a consent token based the consent of the SP node, and allowing access to data of the DP node by the SP node based on a verification of the consent token.

Abstract: An example operation may include one or more of determining, by a first blockchain peer, a chaincode transaction execution needs to be offloaded, receiving bids from one or more second blockchain peers to execute the chaincode transaction, selecting a bid corresponding to a second blockchain peer, executing, by the second blockchain peer corresponding to the selected bid, the chaincode transaction, receiving, by the first blockchain peer, executed chaincode transaction results, and updating a reputation for the second blockchain peer corresponding to the selected bid.

Abstract: An example system may include a processor and memory, wherein the processor is configured to perform one or more of gather hashed commitments inputs from a plurality of user peers until a current time of a blockchain network equals to a hashed commitments inputs end time (t1), collect plain text inputs until the current time of the blockchain network equals to a plain text inputs collection end time (t2), wherein the t2 is greater than the t1, and execute a chaincode of the smart contract to: compare generated hashes of the plain text inputs against previously stored hashes, in response to a match, store the plain text inputs into an input array, and perform a compute function on the input array.

Abstract: A method is provided for building calling context trees of an application to identify a thread or a device affecting a throughput of a transaction relating to the application. The method obtains profiles of call stacks of multiple threads. The method obtains wake-up profiles which are the call stacks of a notifier thread and a waiter thread, from among the multiple threads, in a case that the waiter thread leaves from a sleep state. The method builds the calling context trees to indicate transitions of methods tracing callee relations and wake-up relations based on the profiles of the call stacks and the wake-up profiles, wherein each method is represented by a node having an average thread number. The method extracts and displays tree portions which are transitively reachable from a calling context tree for the transaction and which include the thread or device affecting throughput.

Abstract: An example operation may include one or more of receiving, by a full storage peer of a blockchain network, a blockchain transaction, executing chaincode to create a new world state for a blockchain, transferring, in response to the blockchain transaction, partial Merkle tree hashes to one or more partial storage peers, the partial Merkle tree hashes corresponding to the blockchain transaction, verifying a current world state hash with the partial Merkle tree hashes, receiving, by the one or more partial storage peers, chaincode arguments, executing chaincode on the chaincode arguments to generate a new world state, calculating a new world state hash, and performing consensus, by the full storage peer and the one or more partial storage peers, on the new world state hash.

Abstract: An example operation may include one or more of generating, by a data management node, a profile token based on a data profile of a data provider (DP) node, receiving, by the data management node, a transaction request from a service provider (SP) node to access data from the DP node over a blockchain, acquiring, by the data management node, consent of the SP node based on the profile token, generating, by the data management node, a consent token based the consent of the SP node, and allowing access to data of the DP node by the SP node based on a verification of the consent token.

Abstract: An example system may include a processor and memory, wherein the processor is configured to perform one or more of gather hashed commitments inputs from a plurality of user peers until a current time of a blockchain network equals to a hashed commitments inputs end time (t1), collect plain text inputs until the current time of the blockchain network equals to a plain text inputs collection end time (t2), wherein the t2 is greater than the t1, and execute a chaincode of the smart contract to: compare generated hashes of the plain text inputs against previously stored hashes, in response to a match, store the plain text inputs into an input array, and perform a compute function on the input array.

Abstract: An example operation may include one or more of storing a user profile in a blockchain by an authorized member of the blockchain, receiving a request by another authorized member of the blockchain to access the user profile, identifying the request for the user profile is from the another authorized member of the blockchain, creating a signed message that includes consent to share the user profile with the another authorized member of the blockchain, and transmitting the signed message to the another authorized member of the blockchain, and wherein an exchange of the user profile between the blockchain members is performed without revealing blockchain member identities of the authorized member of the blockchain and the another authorized member of the blockchain to any of the blockchain members.

Abstract: An example operation may include one or more of receiving, by a full storage peer of a blockchain network, a blockchain transaction, executing chaincode to create a new world state for a blockchain, transferring, in response to the blockchain transaction, partial Merkle tree hashes to one or more partial storage peers, the partial Merkle tree hashes corresponding to the blockchain transaction, verifying a current world state hash with the partial Merkle tree hashes, receiving, by the one or more partial storage peers, chaincode arguments, executing chaincode on the chaincode arguments to generate a new world state, calculating a new world state hash, and performing consensus, by the full storage peer and the one or more partial storage peers, on the new world state hash.

Abstract: An example operation may include one or more of determining, by a first blockchain peer, a chaincode transaction execution needs to be offloaded, receiving bids from one or more second blockchain peers to execute the chaincode transaction, selecting a bid corresponding to a second blockchain peer, executing, by the second blockchain peer corresponding to the selected bid, the chaincode transaction, receiving, by the first blockchain peer, executed chaincode transaction results, and updating a reputation for the second blockchain peer corresponding to the selected bid.

Abstract: A method is provided for building calling context trees of an application to identify a thread or a device affecting a throughput of a transaction relating to the application. The method obtains profiles of call stacks of multiple threads. The method obtains wake-up profiles which are the call stacks of a notifier thread and a waiter thread, from among the multiple threads, in a case that the waiter thread leaves from a sleep state. The method builds the calling context trees to indicate transitions of methods tracing callee relations and wake-up relations based on the profiles of the call stacks and the wake-up profiles, wherein each method is represented by a node having an average thread number. The method extracts and displays tree portions which are transitively reachable from a calling context tree for the transaction and which include the thread or device affecting throughput.

Abstract: An example operation may include one or more of storing a user profile in a blockchain by an authorized member of the blockchain, receiving a request by another authorized member of the blockchain to access the user profile, identifying the request for the user profile is from the another authorized member of the blockchain, creating a signed message that includes consent to share the user profile with the another authorized member of the blockchain, and transmitting the signed message to the another authorized member of the blockchain, and wherein an exchange of the user profile between the blockchain members is performed without revealing blockchain member identities of the authorized member of the blockchain and the another authorized member of the blockchain to any of the blockchain members.

Abstract: Systems and method relating generally to data processing, and more particularly to systems and methods for modifying symbols in a data set prior to re-processing.

Abstract: A system includes a memory device including a plurality of blocks and a controller suitable for controlling the memory device. The controller creates a k-dimensional array from the plurality of the blocks, where k is greater than 2, and selects best candidate blocks from the k-dimensional array with respect to the k metrics. The k-dimensional array includes 2-dimensional linked list arrays.

Abstract: Systems and method relating generally to data processing, and more particularly to systems and methods for decoding information. Some disclosed systems include a first data decoding circuit, a second data decoding circuit, and a data output circuit. The second data decoding circuit is coupled to the first data decoding circuit and the data output circuit. The second data decoding circuit is operable to apply a finite alphabet iterative decoding algorithm to the first decoded output to yield a second decoded output.

Abstract: Methods are systems for calculating log-likelihood ratios for a decoder utilized in an electronic non-volatile computer storage apparatus are disclosed. A log-likelihood ratio handler is configured to provide an input log-likelihood ratio to the decoder, wherein the input log-likelihood ratio is one of: a uniform input log-likelihood ratio for all bits calculated based on an estimated raw bit error rate for a particular data unit, or a bit-based input log-likelihood ratio for each bit calculated based on a confidence value for a cell containing said each bit. The decoder of the electronic non-volatile computer storage apparatus is configured to decode encoded data at least partially based on the input log-likelihood ratio from the log-likelihood ratio handler.

Abstract: An apparatus for decoding data includes a decoder circuit operable to apply a decoding algorithm to a decoder input to yield a codeword, a convergence detection circuit operable to determine whether parity checks are satisfied by the decoder input and to identify unsatisfied parity checks in the decoder circuit, and a symbol flipping controller operable to change values of at least one symbol in the decoder input based on information about the unsatisfied parity checks. The decoder circuit is restarted to process the decoder input with the changed values. The information about the unsatisfied parity checks is obtained at each of a number of local decoding iterations in the decoder circuit.

Abstract: The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for protecting portions of data sets during data processing.

Abstract: The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for protecting portions of data sets during data processing.

Abstract: Methods are systems for calculating log-likelihood ratios for a decoder utilized in an electronic non-volatile computer storage apparatus are disclosed. A log-likelihood ratio handler is configured to provide an input log-likelihood ratio to the decoder, wherein the input log-likelihood ratio is one of: a uniform input log-likelihood ratio for all bits calculated based on an estimated raw bit error rate for a particular data unit, or a bit-based input log-likelihood ratio for each bit calculated based on a confidence value for a cell containing said each bit. The decoder of the electronic non-volatile computer storage apparatus is configured to decode encoded data at least partially based on the input log-likelihood ratio from the log-likelihood ratio handler.