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 balancing a cross-domain broadcast network load of a blockchain includes is provided. By evenly distributing the load of cross-domain broadcasting to multiple cross-domain nodes, a utilization rate of a blockchain system can be increased, and ability of processing transactions in the blockchain can be improved. A computer device and a non-transitory computer-readable storage medium are further provided.

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: A method and an apparatus for upgrading a blockchain system, and a terminal. This method includes: determining a first target support version number of the blockchain system after an initial binary program is updated to a target binary program by participant nodes in the system; calculating a first target upgrade version number shared by the participant nodes in the system according to the first target support version number; and upgrading a system version of an initial operation version number currently operated on the system to a system version of the first target upgrade version number when a voting result of the participant nodes on a system upgrade proposal transaction is passed. According to the present application, a problem that the system cannot reach a consensus or the whole system is unavailable in an upgrading process of the system can be solved, and an upgrade efficiency of the system can be improved.

Abstract: A method for upgrading a blockchain system, and a terminal device are provided. This method includes: determining a first target support version number of the blockchain system after an initial binary program is updated to a target binary program by participant nodes in the blockchain system; determining a first target upgrade version number shared by the participant nodes in the blockchain system according to the first target support version number; and upgrading a system version of an initial operation version number currently operated on the blockchain system to a system version of the first target upgrade version number when a voting result of the participant nodes on a system upgrade proposal transaction is passed. According to the present application, a problem that the blockchain system cannot reach a consensus or the whole blockchain system is unavailable in an upgrading process of the blockchain system can be solved.

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: The embodiments of the disclosure are applicable to the technical field of blockchain and provide a consensus trusted cluster changing method, a computer device and a computer-readable storage medium. The method is applicable to a blockchain and includes: determining a current epoch of a newly added validator node of the consensus trusted cluster in the blockchain and a target epoch of the consensus trusted cluster; requesting target status information and proof of target cluster change from a target validator node in the target epoch; verifying the target status information according to the proof of target cluster change; and updating, in case where the target status information has been verified, status information of the newly added validator node according to the target status information to complete change of the consensus trusted cluster. Through the above method, a trusted synchronization target status may be determined.

Abstract: A method for active failure recovery of a single node improved based on PBFT algorithm is disclosed. The abnormal node first initiates a view change request, if (2f+1) view change requests containing the same view value cannot be received within a specified period of time, the abnormal node enters a state to be recovered, and the node to be recovered initiates a recovery request to all nodes of the whole network, waits for replies from normal nodes and counts the number of replies, calculates a height of stable checkpoint of the whole network after receiving replies contain the same view value from (2f+1) nodes, and update the state thereof to finally complete the recovery. This method solves an inherent problem in the PBFT algorithm that a failure in a single node cannot be recovered autonomously, so that a practicability of the PBFT algorithm is greatly improved.

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: A blockchain data index method, a blockchain data storage method and a device are provided. This method first persists a block into a block file, persists an index data layer into an index database, then obtains a matching transaction location according to a query condition, and finally obtains a complete transaction from the block file. In the present application, through expanding the process of the blockchain data storage processing, the blockchain index data is stored in an independent index database and transaction atomicity of multi-database is guaranteed, and a data index mechanism, in which business information is customized in a transaction note field, and then a transaction is associated with the business information through the customized transaction note index field and finally the complete transaction is acquired based on key transaction information, is established.

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 active failure recovery of a single node improved based on PBFT algorithm is disclosed. The abnormal node first initiates a view change request, if (2f+1) view change requests containing the same view value cannot be received within a specified period of time, the abnormal node enters a state to be recovered, and the node to be recovered initiates a recovery request to all nodes of the whole network, waits for replies from normal nodes and counts the number of replies, calculates a height of stable checkpoint of the whole network after receiving replies contain the same view value from (2f+1) nodes, and update the state thereof to finally complete the recovery. This method solves an inherent problem in the PBFT algorithm that a failure in a single node cannot be recovered autonomously, so that a practicability of the PBFT algorithm is greatly improved.

Abstract: A method for balancing a cross-domain broadcast network load of a blockchain includes is provided. By evenly distributing the load of cross-domain broadcasting to multiple cross-domain nodes, a utilization rate of a blockchain system can be increased, and ability of processing transactions in the blockchain can be improved. A computer device and a non-transitory computer-readable storage medium are further provided.