Abstract: The present disclosure provides systems, methods, and computer-readable storage media having functionality to prove immutability of blockchains without accessing user data. A user may submit data for storage to a data management server and the data management server may generate one or more data records corresponding to the data at a database and one or more blocks at a blockchain, each block corresponding to of the data records. Block information associated with the generated blocks may be transmitted to a remote computing device for storage at a database. Prior to storing the block information, the remote computing device may sign the data using a private key or other cryptographic technique. To validate a block, raw block information may be retrieved from the blockchain and compared to the signed block information. If the signed block information matches the raw block information, the block may be determined to be valid (e.g., unchanged).

Abstract: Embodiments provide systems, methods, and computer-readable storage media configured to leverage blockchain technologies to provide failsafe action and fault mitigation processing for autonomous systems. Such autonomous systems may include self-driving cars, logistics or manufacturing robots, or control processes in chemical manufacturing and processing facilities, or construction machinery or sites, and may utilize artificial intelligence (AI) and/or machine learning (ML) algorithms to control operations. These algorithms may be imperfect and subject to error. The disclosed blockchain-based techniques perform data analysis in a parallel and distributed manner (e.g., locally at the autonomous system and remotely at a node of a blockchain platform) to validate the information provided to the AI and/or ML algorithms, as well as the outputs of the algorithms.

Abstract: One example embodiment of the present invention is a method for conducting an imperative removal of at least one data record among peers to support ability to forget in blockchain. Each peer participating to a blockchain system has its own copy of a blockchain in a blockchain system. The method includes depositing the at least one data record to its designated data storage system by at least one peer; storing a cryptographic hashing pointer as a data item in a first block of its own copy of the blockchain by each peer; storing a deletion item in a second block of its own copy of the blockchain by each peer; and deleting the data record from the designated data storage system by each peer when the deletion item for the data record is found on the blockchain.

Abstract: Provided is a method of truncating one or more blocks in a blockchain (300) by an aging process executed by participating computer node (501, 502) of the blockchain. The method includes truncating one or more blocks (310, 320) with a time stamp (210) that is older than a pre-determined cut-off time (t1) by the computer node; creating a new block (360) in which one or more data packets of the new block capture essential data (312, 320) of blocks that are truncated; and appending the new block to the blockchain.

Abstract: Methods and systems are described for validating a block in a blockchain. The methods may include identifying a subset of nodes in a blockchain network as trusted nodes. The trusted nodes perform a voting process to validate a block for the blockchain, whereas those nodes that are not identified as trusted nodes may not engage in the validation process. The trusted nodes may be identified based on past participation in the blockchain, stake in the blockchain, based on an organization operating the node, or other factors. In some cases the trusted nodes may be grouped into one or more voting quorums, and quorum management software may direct the validation process.

Abstract: One example embodiment is a method of proving the immutability of digital records in a first entity. The method includes storing the digital records in a sequence of blocks by the first entity; regularly sending the hash value of the blocks by the first entity to the external party; computing a re-computed hash value of a specific block from the digital records stored at the first entity by a second entity; obtaining a retrieved hash value of the specific block from the external party by mapping a key index by the second entity; and proving that the digital records have not been changed up to the specific block if the re-computed hash value is the same as the retrieved hash value by the second entity.

Abstract: Embodiments provide systems, methods, and computer-readable storage media configured to leverage blockchain technologies to provide failsafe action and fault mitigation processing for autonomous systems. Such autonomous systems may include self-driving cars, logistics or manufacturing robots, or control processes in chemical manufacturing and processing facilities, or construction machinery or sites, and may utilize artificial intelligence (AI) and/or machine learning (ML) algorithms to control operations. These algorithms may be imperfect and subject to error. The disclosed blockchain-based techniques perform data analysis in a parallel and distributed manner (e.g., locally at the autonomous system and remotely at a node of a blockchain platform) to validate the information provided to the AI and/or ML algorithms, as well as the outputs of the algorithms.

Abstract: The present disclosure provides systems, methods, and computer-readable storage media having functionality to prove immutability of blockchains without accessing user data. A user may submit data for storage to a data management server and the data management server may generate one or more data records corresponding to the data at a database and one or more blocks at a blockchain, each block corresponding to of the data records. Block information associated with the generated blocks may be transmitted to a remote computing device for storage at a database. Prior to storing the block information, the remote computing device may sign the data using a private key or other cryptographic technique. To validate a block, raw block information may be retrieved from the blockchain and compared to the signed block information. If the signed block information matches the raw block information, the block may be determined to be valid (e.g., unchanged).

Abstract: One example embodiment is a method of proving the immutability of digital records in a first entity. The method includes storing the digital records in a sequence of blocks by the first entity; regularly sending the hash value of the blocks by the first entity to the external party; computing a re-computed hash value of a specific block from the digital records stored at the first entity by a second entity; obtaining a retrieved hash value of the specific block from the external party by mapping a key index by the second entity; and proving that the digital records have not been changed up to the specific block if the re-computed hash value is the same as the retrieved hash value by the second entity.

Abstract: Methods and systems are described for validating a block in a blockchain. The methods may include identifying a subset of nodes in a blockchain network as trusted nodes. The trusted nodes perform a voting process to validate a block for the blockchain, whereas those nodes that are not identified as trusted nodes may not engage in the validation process. The trusted nodes may be identified based on past participation in the blockchain, stake in the blockchain, based on an organization operating the node, or other factors. In some cases the trusted nodes may be grouped into one or more voting quorums, and quorum management software may direct the validation process.

Abstract: One example embodiment of the present invention is a method for conducting an imperative removal of at least one data record among peers to support ability to forget in blockchain. Each peer participating to a blockchain system has its own copy of a blockchain in a blockchain system. The method includes depositing the at least one data record to its designated data storage system by at least one peer; storing a cryptographic hashing pointer as a data item in a first block of its own copy of the blockchain by each peer; storing a deletion item in a second block of its own copy of the blockchain by each peer; and deleting the data record from the designated data storage system by each peer when the deletion item for the data record is found on the blockchain.

Abstract: Provided is a method of truncating one or more blocks in a blockchain (300) by an aging process executed by participating computer node (501, 502) of the blockchain. The method includes truncating one or more blocks (310, 320) with a time stamp (210) that is older than a pre-determined cut-off time (t1) by the computer node; creating a new block (360) in which one or more data packets of the new block capture essential data (312, 320) of blocks that are truncated; and appending the new block to the blockchain.