Abstract: Provided is a method for communication, which includes steps of: receiving a first information from a first node via a first connection with the first node; and transmitting a first information to at least one other node. A connection initiator of the first connection is the first node. The first information includes an address of the first node within a target network domain, the target network domain is a network domain in which the at least one other node is located, and the at least one other node is a node other than a second node in a network partition to be joined by the first node. The address of the first node within the target network domain is used by the first node to establish a connection with the at least one other node.

Abstract: Disclosed are an interactive aggregate signature method, and a device and a storage medium, which relate to the technical field of data encryption. The method comprises: S101, generating a challenge number according to random numbers of all participating terminals, and respectively sending the random numbers corresponding to the participating terminals, the challenge number and a proposal message to corresponding participating terminals; S102, receiving a message from the participating terminals, and if partial signatures are included in the message, recording the partial signatures; S103, determining whether the number of recorded partial signatures reaches a number required for passing of the proposal message; if so, proceeding to S104, involving generating an aggregate signature by means of the partial signatures; and if not, outputting that the proposal message fails to be passed and an aggregate signature cannot be generated, or repeating steps S101 to S103.

Abstract: A method for data processing, a database system, computer equipment and a storage medium. The method includes: by a first device, obtaining global page identifiers of n target data nodes to which a data modification set needs to be distributed, generating n pieces of mapping information corresponding to the n target data nodes, and sending the same to a management module; by the management module, generating n pieces of data modification information corresponding to the n pieces of mapping information, and sending data modification tasks in the n pieces of data modification information to second devices identified by second device identifiers in the n pieces of data modification information, so as to instruct the second devices to update data nodes.

Abstract: Provided is a method for communication, which includes steps of: receiving a first information from a first node via a first connection with the first node; and transmitting a first information to at least one other node. A connection initiator of the first connection is the first node. The first information includes an address of the first node within a target network domain, the target network domain is a network domain in which the at least one other node is located, and the at least one other node is a node other than a second node in a network partition to be joined by the first node. The address of the first node within the target network domain is used by the first node to establish a connection with the at least one other node.

Abstract: Provided are a consensus method and apparatus for a blockchain, a server and a storage medium. A checkpoint round is designed without waiting for transaction execution results of all nodes in each consensus round so as to reduce the impact of transaction execution on consensus and improve consensus stability. A newly created block comprises an execution result and status of a preorder block of the blockchain. Only the consistency of the newly created block is verified to avoid wasting memory resources and computing resources. The checkpoint round can be customized to improve the scalability of consensus algorithms.

Abstract: The present application provides a pipeline-friendly signature and verification method, a device and a storage medium. The method includes the following steps: generating, by the Witness node, a public-private key pair including a private key and a public key, through a basic signature algorithm, and sending the public key to other Witness nodes; selecting, by the Witness node, a random number, and sending V to a Leader node; receiving C sent by the Leader node; calculating a message digest through the basic signature algorithm and a message hash algorithm, according to the C and the public key, and then calculating ps, and sending the ps to the Leader node.

Abstract: Disclosed are an interactive aggregate signature method, and a device and a storage medium, which relate to the technical field of data encryption. The method comprises: S101, generating a challenge number according to random numbers of all participating terminals, and respectively sending the random numbers corresponding to the participating terminals, the challenge number and a proposal message to corresponding participating terminals; S102, receiving a message from the participating terminals, and if partial signatures are included in the message, recording the partial signatures; S103, determining whether the number of recorded partial signatures reaches a number required for passing of the proposal message; if so, proceeding to S104, involving generating an aggregate signature by means of the partial signatures; and if not, outputting that the proposal message fails to be passed and an aggregate signature cannot be generated, or repeating steps S101 to S103.