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 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: 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: 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: A steering wheel cover includes an annular inner core having first and second flanks, a looped skin layer having first and second marginal zones, and first and second fasteners. The first marginal zone of the looped skin layer is fastened to an inner flank surface of the first flank by virtue of the first fastener. The second marginal zone of the looped skin layer is detachably fastened to an inner flank surface of the second flank by virtue of the second fastener.

Abstract: A steering wheel cover includes an annular resilient body having a C-shaped cross-section, defining an axis, and adapted for gripping onto an annular portion of a steering wheel. The resilient body includes opposite annular end portions and an annular connecting portion. The end portions are spaced apart from each other along the axis. The connecting portion interconnects radial outer ends of the end portions, and cooperates with the end portions to define a receiving space that is adapted to receive the annular portion of the steering wheel. At least one of the end portions and the connecting portion is formed with multiple angularly spaced-apart gaps that communicate the receiving space with the external environment.

Abstract: A steering wheel cover includes: a wheel sleeve having an inner wall that defines an inner space which is adapted to receive a steering wheel therein, the wheel sleeve further has a radial cross section that has first and second circumferential ends; and a plurality of anti-slip ribs formed on the inner wall of the wheel sleeve. Each of the anti-slip ribs extends from the first circumferential end to the second circumferential end of the radial cross section and radiates inwardly from the inner wall of the wheel sleeve into the inner space in the wheel sleeve.

Abstract: A steering wheel cover includes: an inner sleeve; an outer cover provided with a plurality of intersected stitching lines so as to form a plurality of recesses at intersections of the intersected stitching lines and a plurality of convex portions among the recesses, each of the convex portions protruding in a direction away from the inner sleeve; and a plurality of shape-retaining pieces, each of which is disposed securely in a respective one of the recesses in the outer cover and each of which engages the outer cover in such a manner so as to retain the shape of the respective one of the recesses.

Abstract: A self-attaching lighting device includes a transparent suction cup and a light source. The transparent suction cup has a cup portion for attachment to a surface, and a neck portion connected to the cup portion. The neck portion has one end remote from the cup portion and formed with a lamp recess. The light source includes a casing that is connected to the neck portion of the transparent suction cup, and a light emitting member that is mounted in the casing and that extends into the lamp recess in the neck portion of the transparent suction cup.