Abstract: The present disclosure provides a blockchain sharding method, system, and server based on locally repairable system codes. The blockchain sharding system includes k original shards and n?k encoding shards. In each round of consensus, each original shard and m corresponding encoding shards form a local verification group (m<<n?k), and each encoding shard and t original shards participating in generation of the encoding shard form local recovery groups (t<<k). The local verification group is responsible for verifying whether a to-be-verified transaction is legitimate. When a single shard in the verification group is corrupted, the remaining m shards can reach a consistent verification result. According to the principle that the minority is subordinate to the majority, the verification group can still correctly verify the legitimacy of the transaction.

Abstract: The present disclosure provides a security protection method for a sharded blockchain system, and the sharded blockchain system includes one core shard and multiple common shards. A node in the common shard can additionally store historical blocks of other shards in addition to storing historical blocks of the shard in which the node is located. When a single shard in the system is corrupted, the corrupted shard cannot provide a valid verification result for a transaction that the corrupted shard is responsible for verifying. In this case, honest nodes that store historical blocks of the corrupted shard can submit reports on a transaction verification result to the core shard. The core shard confirms validity of the report, and the system performs reward or punishment on the node submitting the report according to whether the report is valid.

Abstract: The present disclosure provides a blockchain sharding method, system, and server based on locally repairable system codes. The blockchain sharding system includes k original shards and n?k encoding shards. In each round of consensus, each original shard and m corresponding encoding shards form a local verification group (m<<n?k), and each encoding shard and t original shards participating in generation of the encoding shard form local recovery groups (t<<k). The local verification group is responsible for verifying whether a to-be-verified transaction is legitimate. When a single shard in the verification group is corrupted, the remaining m shards can reach a consistent verification result. According to the principle that the minority is subordinate to the majority, the verification group can still correctly verify the legitimacy of the transaction.

Abstract: A method and a system for managing voting of an alliance chain based on variable strategies are provided. The method specifically includes: 1) classifying channel strategies into an implicit strategy and a strategy based on signature; 2) specifically implementing the variable strategies: initiating, by a user, a proposal request for modifying a strategy; detecting whether a content of the strategy meets a format requirement on the condition that a target strategy is a strategy based on signature; sending a voting invitation or a signature invitation to an organization requiring auditing according to a present channel strategy or a present network strategy; voting or signing by the invited organization; analyzing a result to determine whether the result meets a requirement of the present channel strategy; if so, modifying the present channel strategy to a target channel strategy; otherwise, failing in modification.