Abstract: A cross-chain transaction method based on hash locking and a sidechain technology is provided. The cross-chain transaction method comprises the following steps: establishing a hash-locking-based atomic exchange data transmission mechanism for a first terminal and a second terminal; establishing a cross-chain data transfer mechanism based on an SPV pegging mode; and realizing, by the first terminal and the second terminal, a hash-locking-based atomic exchange data transmission under a supervision state of the SPV pegging mode. The cross-chain transaction method, by utilizing the sidechain technology, solves the defect of the hash locking technology that only asset exchange can be realized but asset transfer cannot be realized, and thus the cross-chain asset transfer can be realized by utilizing the hash locking technology without additionally adding a sidechain or a relay chain.

Abstract: A covert channel construction method in a blockchain network includes: sharing, by a first terminal and a second terminal, a secret key and transaction information, and generating a blockchain network address by using the secret key and a standard public key address generation algorithm, wherein the transaction information comprises a permutation mapping table and an information capacity of a single transaction; sending, by the first terminal, information by using an information hiding method, and performing simultaneously, by the first terminal and the second terminal, transaction recording; and monitoring, by the first terminal and the second terminal, whether an account transaction of the blockchain network address exists in a blockchain, if yes, extracting, by the second terminal, the information by using an information extraction method, and after extracting the information, replying to the information by using the information hiding method, thereby enabling communication parties to safely transmit infor

Abstract: A covert channel construction method in a blockchain network includes: sharing, by a first terminal and a second terminal, a secret key and transaction information, and generating a blockchain network address by using the secret key and a standard public key address generation algorithm, wherein the transaction information comprises a permutation mapping table and an information capacity of a single transaction; sending, by the first terminal, information by using an information hiding method, and performing simultaneously, by the first terminal and the second terminal, transaction recording; and monitoring, by the first terminal and the second terminal, whether an account transaction of the blockchain network address exists in a blockchain, if yes, extracting, by the second terminal, the information by using an information extraction method, and after extracting the information, replying to the information by using the information hiding method, thereby enabling communication parties to safely transmit infor

Abstract: A shareable battery pack for a portable ultrasonic apparatus, a trolley, a power supply system, and a portable ultrasonic system. The trolley can be connected to the portable ultrasonic apparatus and/or the shareable battery pack to supply power so as to extend operation time. Alternatively, the trolley is used to support the portable ultrasonic apparatus and/or the shareable battery pack without supplying power to extend operation time. In an embodiment, the shareable battery pack can be removed from the trolley, and then be fixedly connected to the portable ultrasonic apparatus to form an integral unit and serve as an external battery for the portable ultrasonic apparatus. Such design enables the portable ultrasonic apparatus to have extended operation time without relying on the trolley and requires only one shareable battery pack in special situations, thereby enhancing convenience of use.

Abstract: A method for blockchain payment channel network multi-path routing based on a genetic algorithm includes: S1, constructing a directed graph according to a structure of a payment channel network; S2, based on the payment channel network, generating an initial population; S3, taking a total fee charge of the k payment paths corresponding to the each individual as an adaptability, and selecting a parent based on the adaptability; S4, based on the adaptability, performing a cross operation and a mutation operation on the parent; S5, when a population converges or a number of iterations reaches a preset threshold, determining the total fee charge for the each individual in a last-generation population, and selecting an individual with the smallest total fee charge as an optimal solution under a current k value; and, S6, selecting a target payment path from a plurality of selected payment paths.