CN117812092A - Predicate-based block compression transmission method and apparatus, device and medium - Google Patents

Abstract

The embodiment of the disclosure discloses a predicate-based block compression transmission method, a predicate-based block compression transmission device, equipment and a predicate-based medium, wherein the predicate-based block compression transmission method comprises the following steps: the method comprises the steps that a client obtains a target predicate and a plurality of transmission time lengths for transmitting data between the client and each consensus node in a plurality of consensus nodes in a blockchain network respectively; the client determines a consensus node selection strategy according to the target predicate; the client determines a target consensus node according to a plurality of transmission time lengths and a consensus node selection strategy; and responding to the target consensus node meeting the preset block out condition, the target consensus node generating a compressed block of a new block corresponding to the client and broadcasting the compressed block to other consensus nodes so as to store the new block into a blockchain of the blockchain network, wherein the other consensus nodes are consensus nodes except the target consensus node in the blockchain network.

Description

Predicate-based block compression transmission method and apparatus, device and medium

Technical Field

The disclosure relates to the technical field of blockchain and the technical field of blockchain transmission, in particular to a predicate-based block compression transmission method, a predicate-based block compression transmission device, predicate-based block compression transmission equipment and predicate-based block compression transmission medium.

Background

In order to improve the transmission efficiency of the blocks in the blockchain network, a node in the blockchain network compresses the blocks to be transmitted, then the compressed blocks are transmitted to other nodes in the blockchain network, and then the other nodes recover the blocks to be transmitted according to the information in the compressed blocks and the transaction data in the transaction pool. However, in practical applications, the transaction pool often lacks the transaction corresponding to the compressed block, which makes it necessary to request the transaction data corresponding to the compressed block from the node that outputs the block, thereby increasing the data transmission workload of the blockchain network and affecting the data uplink efficiency.

Disclosure of Invention

In order to solve the problems, the embodiment of the disclosure provides a predicate-based block compression transmission method, a predicate-based block compression transmission device, predicate-based block compression transmission equipment and predicate-based block compression transmission medium.

In one aspect of the disclosed embodiments, a predicate-based block compression transmission method is provided, including:

the method comprises the steps that a client obtains a target predicate and a plurality of transmission time lengths for transmitting data between the client and a plurality of consensus nodes in a blockchain network, wherein the client and any one of the plurality of consensus nodes have one transmission time length; the client determines a consensus node selection strategy according to the target predicate; the client determines a target consensus node according to the transmission time lengths and the consensus node selection strategy; and responding to the target consensus node meeting a preset block out condition, generating a compressed block of a new block corresponding to the client by the target consensus node, and broadcasting the compressed block to other consensus nodes so as to store the new block into a blockchain of the blockchain network, wherein the other consensus nodes are consensus nodes except the target consensus node in the blockchain network.

In another aspect of the embodiments of the present disclosure, there is provided a predicate-based block compression transmission apparatus, the apparatus including: the system comprises an acquisition module, a control module and a control module, wherein the acquisition module is used for acquiring a target predicate and a plurality of transmission time lengths for transmitting data between the client and a plurality of consensus nodes in a blockchain network, wherein the client and any one of the plurality of consensus nodes have one transmission time length; the strategy determining module is used for determining a consensus node selection strategy according to the target predicate by the client; the target consensus node determining module is used for determining a target consensus node according to the plurality of transmission time lengths and the consensus node selection strategy by the client; and the first block transmission module is used for responding to the target consensus node meeting a preset block outlet condition, generating a compressed block of a new block corresponding to the client by the target consensus node, and broadcasting the compressed block to other consensus nodes so as to store the new block into a blockchain of the blockchain network, wherein the other consensus nodes are consensus nodes except the target consensus node in the blockchain network.

In another aspect of an embodiment of the present disclosure, there is provided an electronic device including: a memory for storing a computer program; and the processor is used for executing the computer program stored in the memory and realizing a predicate-based block compression transmission method when the computer program is executed.

In yet another aspect of the disclosed embodiments, a computer-readable storage medium is provided having a computer program stored thereon that, when executed by a processor, implements a predicate-based block compression transmission method.

In the embodiment of the disclosure, the target consensus node of the adaptive client is determined through the target predicate and the transmission time length of data between the client and each consensus node, and the target consensus node generates a new block of the client and transmits a compressed block of the new block to other consensus nodes of the blockchain network, so that each consensus node is ensured to receive transaction data of the client required for constructing the new block before constructing the new block through the compressed block, the operation that the consensus node pulls the transaction of the client required for constructing the new block from the target consensus node is reduced, the workload of data transmission in the blockchain network is further reduced, and the uplink efficiency of the new block is improved. In addition, through setting of the target predicate, bandwidth overhead and transmission delay of the consensus node can be effectively reduced, and robustness of the blockchain network is improved.

The technical scheme of the present disclosure is described in further detail below through the accompanying drawings and examples.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description, serve to explain the principles of the disclosure.

The disclosure may be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings in which:

FIG. 1 is a flow diagram of a predicate-based block compression transmission method provided by an exemplary embodiment of the present disclosure;

FIG. 2 is a schematic diagram of data transmission in a blockchain network provided by an exemplary embodiment of the present disclosure;

FIG. 3 is a flow diagram of a predicate-based block compression transmission method provided by another exemplary embodiment of the present disclosure;

FIG. 4 is a schematic diagram of a blockchain provided by an exemplary embodiment of the present disclosure;

FIG. 5 is a flow chart of step S140 provided by an exemplary embodiment of the present disclosure;

FIG. 6 is a flow diagram of a predicate-based block compression transmission method provided by another exemplary embodiment of the present disclosure;

FIG. 7 is a flow chart of a predicate-based block compression transmission method provided by another exemplary embodiment of the present disclosure;

FIG. 8 is a block diagram of a predicate-based block compression transmission device provided by an exemplary embodiment of the present disclosure;

Fig. 9 is a schematic structural diagram of an application embodiment of the electronic device of the present disclosure.

Detailed Description

Various exemplary embodiments of the present disclosure will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless it is specifically stated otherwise.

It will be appreciated by those of skill in the art that the terms "first," "second," etc. in embodiments of the present disclosure are used merely to distinguish between different steps, devices or modules, etc., and do not represent any particular technical meaning nor necessarily logical order between them.

It should also be understood that in embodiments of the present disclosure, "plurality" may refer to two or more, and "at least one" may refer to one, two or more.

It should also be appreciated that any component, data, or structure referred to in the presently disclosed embodiments may be generally understood as one or more without explicit limitation or the contrary in the context.

In addition, the term "and/or" in this disclosure is merely an association relationship describing an association object, and indicates that three relationships may exist, for example, a and/or B may indicate: a exists alone, A and B exist together, and B exists alone. In addition, the character "/" in the present disclosure generally indicates that the front and rear association objects are an or relationship.

It should also be understood that the description of the various embodiments of the present disclosure emphasizes the differences between the various embodiments, and that the same or similar features may be referred to each other, and for brevity, will not be described in detail.

Meanwhile, it should be understood that the sizes of the respective parts shown in the drawings are not drawn in actual scale for convenience of description.

The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the disclosure, its application, or uses.

Techniques, methods, and apparatus known to one of ordinary skill in the relevant art may not be discussed in detail, but are intended to be part of the specification where appropriate.

It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further discussion thereof is necessary in subsequent figures.

Embodiments of the present disclosure may be applicable to electronic devices such as terminal devices, computer systems, servers, etc., which may operate with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known terminal devices, computing systems, environments, and/or configurations that may be suitable for use with the terminal device, computer system, server, or other electronic device include, but are not limited to: personal computer systems, server computer systems, thin clients, thick clients, hand-held or laptop devices, microprocessor-based systems, set-top boxes, programmable consumer electronics, network personal computers, small computer systems, mainframe computer systems, and distributed cloud computing technology environments that include any of the foregoing, and the like.

Electronic devices such as terminal devices, computer systems, servers, etc. may be described in the general context of computer system-executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, etc., that perform particular tasks or implement particular abstract data types. The computer system/server may be implemented in a distributed cloud computing environment in which tasks are performed by remote processing devices that are linked through a communications network. In a distributed cloud computing environment, program modules may be located in both local and remote computing system storage media including memory storage devices.

In this embodiment:

the narrow Blockchain (Blockchain) technology is a distributed ledger that combines data blocks in a sequential manner into a chained data structure in time order, and that is cryptographically secured against tampering and counterfeiting. The generalized blockchain technology is a brand-new distributed infrastructure and calculation paradigm for verifying and storing data by utilizing a blockchain data structure, generating and updating the data by utilizing a distributed node consensus algorithm, ensuring the safety of data transmission and access by utilizing a cryptography mode, and programming and operating the data by utilizing an intelligent contract consisting of an automatic script code.

Blockchain technology is built on top of a network of blockchains that includes a plurality of nodes (nodes) that process and store data. Nodes in a blockchain network are generally referred to as computing devices in the blockchain network, that is, any computing device connected to the blockchain network is referred to as a node. The computing device may be a computer, a server, a smart phone, a tablet computer, a notebook, etc.

The alliance chain (Consortium Blockchain) refers to a blockchain used inside a certain group or organization, and has certain restrictions and requirements on the organization and units added. The federation chain internally designates a plurality of preselected nodes (called consensus nodes) as billboards, the generation of each block being determined jointly by all of the preselected nodes. The generation of each block is commonly decided and packaged by all pre-selected billing people, and other nodes on the chain can trade, but without billing rights.

The slicing technology is a technical scheme capable of improving the expandability of the block chain. The core idea of slicing is to divide and conquer according to certain rules in the face of all transactions submitted to the blockchain system. Unlike traditional approaches, where all transactions are processed by all blockchain nodes, the sharding technique divides blockchain nodes into different smaller committees (shards), each of which only needs to process a portion of the transactions.

Predicates generally refer to logically symbolized attributes or relationships in computer science. The predicate may be a relationship or a boolean function that corresponds to a characteristic function or an indicator function of the relationship.

The macro definition is also called macro substitution, macro replacement, which is called macro for short.

Fig. 1 is a flow chart of a predicate-based block compression transmission method according to an exemplary embodiment of the present disclosure. The embodiment can be applied to an electronic device, as shown in fig. 1, and includes the following steps:

in step S110, the client obtains a target predicate and a plurality of transmission durations for transmitting data between the client and a plurality of consensus nodes in the blockchain network. The predicate selected by the client is referred to as a target predicate in this embodiment.

Wherein the client has a transmission duration with each of the plurality of consensus nodes. The client is communicatively coupled to a blockchain network in which the client can conduct transactions. For example, the blockchain network may be a federated chain network. A plurality of consensus nodes may be included in the blockchain network, each of which may be used to process transactions and generate blocks. Wherein each consensus node in the blockchain network has a unique node Identification (ID), which may be a self-defined code or number, etc. The node identification of each consensus node may be mapped to a sequence number as the node index number for that node. When a client joins the blockchain network, an associated list of consensus nodes is obtained from an entry node of the blockchain network. Included in the relevant list are the IP (Internet Protocol, internetworking protocol), node index number, and region information of the deployment region for each consensus node in the blockchain network. In this embodiment, the area information may be province, or may be a geographical area dividing the consensus node with different granularity, such as a data center.

In one particular implementation, the blockchain network may further include a plurality of supernodes for storing all of the blockchain network blockdata and selecting consensus nodes in the blockchain network. The plurality of consensus nodes and the plurality of super nodes can be deployed in different areas, and the consensus nodes in the same area can be responsible for transmitting corresponding blocks and transaction data to the super nodes in the area.

In some alternative embodiments, the client may randomly choose one predicate as the target predicate, or the client may also choose the predicate that the blockchain network defaults to assign to the client as the target predicate.

The transmission duration of data between a client and each of the consensus nodes in the blockchain network may be understood as the duration that a client spends transmitting data to the consensus node a single time.

And step S120, the client determines a consensus node selection strategy according to the target predicate.

Wherein the consensus node selection policy may be determined based on the logical attributes or relationships represented by the target predicate. The consensus node selection policy may include which consensus nodes the client may select as target consensus nodes. For example, the consensus node selection policy may include a node identification that may be the target consensus node.

Illustratively, assume that the target predicate selected by the client is an EVE, which represents the maximum/minimum number of execution returns in a set of integers, i.e., the corresponding consensus node selection policy is: and selecting the consensus node with the longest transmission time length for transmitting data with the client as a target consensus node.

Step S130, the client determines a target consensus node according to the plurality of transmission durations and the consensus node selection policy.

The target consensus node is used for processing the transaction of the client and generating a block corresponding to the client, wherein the block corresponding to the client is transaction data of the client included in the block. The client can determine a target consensus node of the client from a plurality of consensus nodes in the blockchain network according to a plurality of transmission time lengths and a consensus node selection strategy of data transmitted between the client and each consensus node respectively. Wherein the client may have one or more target consensus nodes, and when the client has a plurality of target consensus nodes, the client may select one target consensus node to process the transaction at random or according to the data load of the target consensus node.

Further describing the example in step S120, assuming that the blockchain network includes three consensus nodes, the three consensus nodes are respectively a consensus node 1, a consensus node 2 and a consensus node 3, the transmission duration of data transmitted between the client and the consensus node 1 is 100 ms, the transmission duration of data transmitted between the client and the consensus node 2 is 110 ms, and the transmission duration of data transmitted between the client and the consensus node 3 is 97 ms, it may be determined that the consensus node 2 is the target consensus node of the client. At this time, when the consensus node 2 generates a new block of the client, both the consensus node 1 and the consensus node 3 have received the transaction request sent by the client.

In step S140, in response to the target consensus node meeting the preset block out condition, the target consensus node generates a compressed block of the newly added block corresponding to the client, and broadcasts the compressed block to other consensus nodes, so that the newly added block is stored in the blockchain of the blockchain network.

Wherein the other consensus nodes are consensus nodes in the blockchain network other than the target consensus node. The preset block out condition can be set according to actual requirements. For example, the preset block-out condition may be that the transaction data of the client is blocked once for each preset time period, or when the transaction data of the newly added client in the transaction pool of the target consensus node has reached the preset number, the transaction data of the client is blocked once. The new block corresponding to the client only comprises transaction data corresponding to the client.

In a specific implementation, when a client performs a transaction in a blockchain network, the client sends a transaction request to a target consensus node and other consensus nodes in the blockchain network, the target consensus node processes the transaction request of the client, generates corresponding transaction information of the client, and broadcasts the transaction information to the other consensus nodes, wherein the transaction information of the client and the transaction request form transaction data of the current transaction of the client.

In some optional embodiments, when the target consensus node monitors that the target consensus node has met a preset Block out condition, the target consensus node generates a new Block corresponding to a client according to transaction data of the client in a transaction pool of the target consensus node, and then compresses the new Block to obtain a compressed Block (Compact Block) of the new Block, where the compressed Block includes: the method comprises the steps of adding a block head of a block, first transaction data (Coinbase transaction) in the block and a transaction data summary list, wherein the transaction data summary list comprises hash values respectively corresponding to other transaction data except the first transaction data in the block. The target consensus node transmits the compressed block to other consensus nodes.

All the consensus nodes perform consensus on the validity of the compressed block, for example, the consensus nodes can verify whether the data structure grammar of the newly added block recorded in the block header is valid, whether the time stamp in the verification block header is earlier than the current time, whether the size of the newly added block recorded in the verification block header accords with the preset block size, and the like, so as to determine the validity of the compressed block.

When the number of the common node exceeding a preset number (for example, 2/3) determines that the compressed block is legal, then, for each common node, determining whether all transaction data corresponding to the hash value list are in the transaction pool of the common node, when all transaction data corresponding to the hash value list are in the transaction pool of the other common node, constructing a new block of the client by the block header, the first transaction data and the transaction data corresponding to the hash value list, when all transaction data corresponding to the hash value list are not in the transaction pool of the other common node, determining missing transaction data in the transaction pool of the other common node, pulling (Pull) the missing transaction data from the target common node, constructing a new block of the client by the block header, the first transaction data and the transaction data corresponding to the hash value list, and then, uplink the new block by each common node, namely, storing the new block into a block chain of the block chain network.

In the embodiment of the disclosure, the target consensus node of the adaptive client is determined through the target predicate and the transmission time length of data between the client and each consensus node, and the target consensus node generates a new block of the client and transmits a compressed block of the new block to other consensus nodes of the blockchain network, so that each consensus node is ensured to receive transaction data of the client required for constructing the new block before constructing the new block through the compressed block, the operation that the consensus node pulls the transaction of the client required for constructing the new block from the target consensus node is reduced, the workload of data transmission in the blockchain network is further reduced, and the uplink efficiency of the new block is improved. In addition, through setting of the target predicate, bandwidth overhead and transmission delay of the consensus node can be effectively reduced, and robustness of the blockchain network is improved.

In an alternative embodiment, step S110 in an embodiment of the present disclosure may include: for each consensus node in the blockchain network, the client determines the transmission duration of data transmission between the client and the consensus node based on the size of preset test data, the bandwidth and the delay of a communication line between the client and the consensus node.

The client may preset a preset test data, and send the preset test data to each consensus node to obtain the transmission duration. Specifically, for each consensus node, the transmission duration of data transmitted between the client and the consensus node can be obtained through formula (1);

t = lat +（x/ b）×1000（1）

wherein t is a transmission time length (ms) of data transmission between the client and the consensus node, x is a preset size (MB) of test data, lat is a delay (ms) of a communication line between the client and the consensus node, and b is a bandwidth (MB/s) of the communication line between the client and the consensus node.

Illustratively, fig. 2 is a schematic diagram of data transmission in a blockchain network provided by an exemplary embodiment of the present disclosure. As shown in fig. 2, it is assumed that 4 consensus nodes are included in the blockchain network, and the 4 consensus nodes are a consensus node 1, a consensus node 2, a consensus node 3, and a consensus node 4, respectively. Wherein, consensus node 1, consensus node 2, consensus node 3 and consensus node 4 are deployed at L, S, X and G, respectively, and client a is deployed at G. Wherein L, S, X and G represent different regions, respectively.

The transmission duration of the data transmission between the client a and the consensus nodes deployed at L, S, X and G, respectively, is obtained according to equation (1). The bandwidth and delay of the communication line between the client a and the consensus nodes deployed at L, S, X and G, respectively, and the transmission duration of the data transmitted by the client a before the consensus nodes deployed at L, S, X and G, respectively, are detailed in table 1.

In fig. 2, 1, 2, 3, and 4 represent a consensus node 1, a consensus node 2, a consensus node 3, and a consensus node 4, respectively, and a represents a client a;

TABLE 1

In an alternative embodiment, step S110 in the embodiment of the present disclosure may further include: the client acquires the corresponding relation between predicates and consensus node selection strategies from the blockchain network; and then, the client determines a target predicate based on the corresponding relation between the predicate and the consensus node selection policy.

The corresponding relation between the predicate and the consensus node selection policy can be preset, and can be stored in the blockchain network in a list form. The correspondence between predicates and consensus node selection policies may include a plurality of predicates, and a consensus node selection policy to which each predicate corresponds.

In an alternative embodiment, the target predicate in an embodiment of the present disclosure includes: operating parameters and defined parameters. The operating parameter is an operator, or predicate, and the qualifying parameter is a macro, variable, or function.

In one specific implementation, the form of the target predicate may be as shown in equation (2);

p=O（y）

O∈{ ONE，EVE，BFT_MAJ，…POS_MAJ } （2）

where p is the target predicate, y is the list of parameters, and O is the operating parameter. Wherein y may include a plurality of defined parameters for defining an operating range of the operating parameter, which may be a macro, a variable or a function. The operating parameters may be operators, or predicates.

In practical applications, operands may be added prior to defining parameters and operating parameters to form operand fields to enable the program to execute a list of defined parameters and operating parameters after the operands. For example, the operand field may be in the form of "", wherein" # "indicates a node index number or a node identification of the consensus node," -j->"means that defined parameters or operating parameters are to be performed thereafter. I.e. the operand field will finally correspond to the actually calculated value, e.g. for example in fig. 2, the node index number deployed at the consensus node of G is 1,/->It becomes the transmission time period of 38 ms required for the client a to transmit a predetermined test data to the consensus node deployed at G in fig. 2.

EVE is an operator and EVE is an abbreviation for everyone. EVE represents the maximum/minimum number returned in a set of integers.The output of (a) represents a slowest consensus node, i.e. the corresponding consensus node selects the strategy for selecting the consensus node with the longest transmission duration, whereby each of the remaining nodes receives the message when the node is able to receive the message.

ONE is an operator, meaning ONE is similar to EVE,the output result of (a) represents the fastest common node, i.e. the corresponding common node selection strategy is the shortest transmission time And consensus nodes.

Bft_maj is an operator that represents returning a number of consensus nodes in a set of integers that are more than the majority of members (consensus nodes) in the list of defined parameters, e.g. "vast majority" in a federated chain network refers to a number of consensus nodes that is more than 2/3.

Pos_maj is an operator. Pos_maj has a similar meaning to bft_maj, but pos_maj is used in POS (Proof of status) based blockchain networks. In a PoS-based blockchain network, the voting rights are not averaged by each consensus node, but rather are determined by the individual consensus node mortgage limits, i.e., one mortgage value for each consensus node. Accordingly, pos_maj represents a number returned from a set of integers that is greater than most members of the list of defined parameters in size and requires a node corresponding to the number and a co-node with a cumulative mortgage value less than or equal to the co-node corresponding to the number that exceeds a mortgage value of 2/3. If a number is a number exceeding 2/3, but the number corresponds to an insufficient mortgage value for the consensus node, then a number needs to be extended backward. For example, among the four consensus nodes, the number corresponding to each of the four consensus nodes is {1,2,3,4}, and the mortgage value is {1, 3}, and the consensus node corresponding to the number 3 cannot be selected as the output, because it cannot meet the requirement exceeding the 2/3 mortgage value with the previous two consensus nodes.

In this particular implementation, the operating parameters may be predicates, i.e., predicates may be nested with one another, in addition to the operators and operators listed above.

In this specific implementation, a plurality of macros may also be preset, so that the client may select from the preset macros. For example, the macro may beOr->Wherein->Represented as all consensus nodes in the blockchain network, i.e. it can be extended to a list of all consensus nodes, +.>Representing all consensus nodes that are in the same area as the client, i.e. it can be extended to a list of all consensus nodes that are in the same area as the client.

Likewise, a plurality of variables may be set in advance so that the client can select among the plurality of variables set in advance. For example, the variables may be in the form ofOr->. Wherein (1)>Index number of finger node or common node with node identification of #, +.>For indicating a province&A set of consensus nodes in the network. For example, the node is identified as a common node in Guangzhou, whose corresponding variable is +.>All the consensus node corresponding variables deployed in Shandong are。

Also, a plurality of functions may be preset, so that the client may select among a plurality of variables set in advance. For example, the functional form may be a binary operator "-", which means that a difference set between two sets of consensus nodes is calculated. For example, if the client wants to select a target consensus node from the consensus nodes deployed in other areas than the area in which the client is located, then it is That is, the formula representsA set of consensus nodes in other areas than the area in which the client is located.

Illustratively, the set target predicates and corresponding consensus node selection policies are shown in Table 2;

TABLE 2

Fig. 3 is a flow chart of a predicate-based block compression transmission method provided in another exemplary embodiment of the present disclosure. In some alternative embodiments, as shown in fig. 3, the following steps are included before step S110:

step S210, performing a slicing process on the block chain network to obtain a plurality of service domains.

Wherein each of the plurality of service domains includes a plurality of consensus nodes.

In one particular implementation, a blockchain network may be partitioned into a plurality of service domains by a sharding technique, each service domain including all of the consensus nodes in the blockchain network.

In step S220, each service domain in the plurality of service domains determines a consensus node among the plurality of consensus nodes in the service domain as a block-out node for generating a block.

Wherein the out-block nodes of each service domain in the blockchain network are not identical. One consensus node may be designated in each service domain as an out-block node for that service domain, and one consensus node may only be designated as an out-block node for one service domain. The blocks generated by each service domain are respectively connected with the generated blocks of the block chain network to form a piece of block chain, and the piece chain of each service domain forms a complete block chain.

In one particular implementation, for each service domain, a newly added block and a compressed block of the newly added block are generated by a block-out node of the service domain, and the validity of the compressed block is determined by all consensus nodes of the service domain. Specifically, when the block-out node of the service domain generates a new block and a compressed block of the new block, the block-out node sends the compressed block to other consensus nodes except the block-out node in the service domain, all the consensus nodes of the service domain perform consensus on the validity of the compressed block, when the consensus result is that the consensus node exceeding 2/3 in the service domain verifies that the compressed block has validity, the compressed block is determined to be legal, then the other consensus nodes of the service domain recover to obtain the new block according to the compressed block and transaction data in the transaction pool thereof, and then each consensus node of the service domain uplinks the new block to a fragment chain of the service domain.

Illustratively, FIG. 4 is a schematic diagram of a blockchain provided by an exemplary embodiment of the present disclosure. As shown in fig. 4, the blockchain network includes 4 service domains, namely service domain a, service domain B, service domain C, and service domain D. The 4 service domains may generate blocks in parallel, with one shard chain for each service domain. Any fragment chain comprises an originating block and a block generated by any service domain.

In the embodiment of the disclosure, the blockchain network is subjected to slicing processing so as to form a plurality of service domains in the blockchain network, so that a plurality of consensus nodes in the blockchain network can simultaneously output blocks, and the block output efficiency of the blockchain network is greatly improved.

Fig. 5 is a flowchart illustrating step S140 according to an exemplary embodiment of the present disclosure. In an alternative embodiment, as shown in fig. 5, step S140 includes the steps of:

step S141, the target consensus node generates a compressed block of the new block corresponding to the client.

When the target consensus node meets the preset block out condition, the target consensus node generates a new added block and a compressed block corresponding to the client.

In step S142, the validity of the compressed block is commonly recognized by a plurality of common nodes in the target service domain with the target common node as the block-out node.

In this embodiment, the service domain in which the target consensus node is the egress node is referred to as a target service domain. The block-out node in the target service domain is responsible for generating a new block corresponding to the client and a compressed block of the new block, and each consensus node in the target service domain performs consensus on the validity of the compressed block.

In step S143, in response to the consensus result of the validity of the compressed block indicating that the compressed block is valid, the plurality of consensus nodes in the target service domain store the newly added block corresponding to the client into the blockchain according to the compressed block.

In a specific implementation, when the legal consensus result of the compressed block is that the consensus node exceeding 2/3 in the target service domain verifies that the compressed block has legal validity, determining that the compressed block is legal, then recovering other consensus nodes except the block node in the target service domain according to the compressed block and transaction data in the transaction pool thereof to obtain a new block corresponding to the client, and then each consensus node in the target service domain uplinks the new block corresponding to the client to a fragment chain of the target service domain.

Fig. 6 is a flow chart of a predicate-based block compression transmission method according to another exemplary embodiment of the present disclosure. In some alternative embodiments, as shown in fig. 6, the predicate-based block compression transmission method further includes the steps of:

and step S310, in response to the blockchain network detecting that the target consensus node exceeds the preset time period, a new block corresponding to the client is not generated, and the client determines to update the target predicate.

The preset time length can be set according to actual requirements.

In one embodiment, when the target consensus node meets a preset block-out condition, detecting the time length of generating a new block by the target consensus node, when the target consensus node fails to generate the new block corresponding to the client beyond the preset time length, feeding back a block-out failure message to the client by the target consensus node, and after the client receives the block-out failure message, re-determining the target predicate, and determining the re-determined target predicate as an updated target predicate.

And step S320, the client determines an updating consensus node selection strategy according to the updating target predicate.

The method for determining the update of the consensus node selection policy by the client according to the update target predicate is the same as the method for determining the consensus node selection policy by the client according to the target predicate, and is not described herein.

In step S330, the client determines an update target consensus node according to the plurality of transmission and update consensus node selection policies.

The method for determining the updated target consensus node by the client is the same as the method for determining the target consensus node by the client, and will not be described herein.

It should be noted that, the updated target consensus node determined by the client and the original target consensus node of the client are different consensus nodes.

Step S340, the updating target consensus node generates a compressed block of the new block corresponding to the client, and broadcasts the compressed block to other consensus nodes, so that the new block corresponding to the client is stored in the blockchain of the blockchain network.

The method includes that a target consensus node is updated to generate a compressed block of a new block corresponding to a client, and the compressed block is broadcast to other consensus nodes so that the new block is stored in a blockchain, and the method of updating the target consensus node to generate the compressed block of the new block corresponding to the client, and the compressed block is broadcast to other consensus nodes so that the new block is stored in the blockchain, which is not repeated herein.

In the embodiment of the disclosure, the time length of generating the newly added block by detecting the target consensus node, and when the target consensus node fails to generate the newly added block within the preset time, the client reforms the updating target predicate, obtains the updating target consensus node of the client according to the updating target predicate, and takes charge of generating the newly added block corresponding to the client by the updating target consensus node, thereby solving the problem that the target consensus node affects the transaction data of the client to block when in downtime or suffering from attack, and improving the block-out stability of the blockchain network.

Fig. 7 is a flowchart illustrating a predicate-based block compression transmission method according to still another exemplary embodiment of the present disclosure. In some alternative embodiments, as shown in fig. 7, the following steps are further included after step S130:

in step S410, the client sends a target consensus node selection request for the target consensus node to a plurality of consensus nodes of the blockchain network.

Wherein the target consensus node selection request comprises signature information. In one particular implementation, the target consensus node selection request may further include a node identification or node index number of the target consensus node.

The signature information is obtained by signing preset information by the client through a public key and a private key of the public key pair of the client. The preset information may include, for example, but is not limited to: client Identification (ID) of the client, node identification of the target consensus node, etc. The public and private key pair of the client includes a public key and a private key. The public-private key pair private key of the client is used for signing data or information, and the public-private key pair public key of the client is used for verifying the signature generated by the public-private key pair private key of the client. The public-private key pair of the client may be generated by the client using a cryptographic (SM 2 or SM 4) algorithm, a symmetric encryption algorithm, an asymmetric encryption algorithm, or the like.

In one embodiment, the client may send a target consensus node selection request to any one of the consensus nodes in the blockchain network that sends selection information to other consensus nodes in the blockchain network than the any one of the consensus nodes.

In step S420, the plurality of consensus nodes verify the signature information by using the public key in the client public-private key pair, respectively.

In one embodiment, a client may send the client's public key to each consensus node in the blockchain network when joining the blockchain network.

In step S430, in response to the signature information passing verification result of the number of consensus nodes exceeding the preset number, the plurality of consensus nodes store the consensus node selection policy into the blockchain.

The preset number can be set according to actual requirements.

When the signature information passes verification, each consensus node performs uplink processing on the consensus node selection policy, that is, stores the consensus node selection policy into the blockchain, and meanwhile, each consensus node can set the consensus node corresponding to the consensus node selection policy as the target consensus node of the client.

Fig. 8 is a block diagram of a predicate-based block compression transmission device according to an exemplary embodiment of the present disclosure. As shown in fig. 8, the predicate-based block compression transmission device includes:

the obtaining module 500 is configured to obtain a target predicate and a plurality of transmission durations for transmitting data between the client and a plurality of consensus nodes in a blockchain network, where the client and any one of the plurality of consensus nodes have one transmission duration;

a policy determining module 510, configured to determine a consensus node selection policy according to the target predicate by the client;

a target consensus node determining module 520, configured to determine a target consensus node according to the plurality of transmission durations and the consensus node selection policy by the client;

and the first block transmission module 530 is configured to, in response to the target consensus node meeting a preset block out condition, generate a compressed block of a new block corresponding to the client, and broadcast the compressed block to other consensus nodes, so that the new block is stored in a blockchain of the blockchain network, where the other consensus nodes are consensus nodes in the blockchain network except for the target consensus node.

In some optional examples, the obtaining module 500 in the foregoing embodiments of the present disclosure is specifically configured to, for each of the plurality of consensus nodes, determine, by the client, a transmission duration of data transmitted between the client and the consensus node based on a size of preset test data, a bandwidth and a delay of a communication line between the client and the consensus node.

In some optional examples, the acquisition module 500 in the above embodiments of the disclosure is further specifically configured to:

the client acquires a corresponding relation between predicates and a consensus node selection strategy from the blockchain network;

the client determines the target predicate based on a correspondence between the predicate and a consensus node selection policy.

In some optional examples, the target predicate in the above embodiments of the disclosure includes an operation parameter and a limitation parameter, wherein the operation parameter is an operator, or a predicate, and the limitation parameter is a macro, a variable, or a function.

In some optional examples, the predicate-based block compression transmission apparatus in the above embodiments of the present disclosure further includes:

the segmentation module is used for carrying out segmentation processing on the block chain network to obtain a plurality of service domains, wherein each service domain in the plurality of service domains respectively comprises the plurality of consensus nodes;

The block-out node determining module is used for determining a common node in a plurality of common nodes in the service domains as a block-out node for generating a block, wherein the block-out nodes of the service domains are different.

In some optional examples, the first block transfer module 530 in the above embodiments of the disclosure is further configured to:

generating a compressed block of the newly added block corresponding to the client by the target consensus node;

the target consensus node is used as a plurality of consensus nodes in a target service domain of the block outlet node to carry out consensus on the validity of the compressed block;

and responding to the consensus result of the validity of the compressed block to indicate that the compressed block is legal, and storing the new block into the blockchain according to the compressed block by a plurality of consensus nodes in the target service domain.

In some optional examples, the predicate-based block compression transmission apparatus in the above embodiments of the present disclosure further includes:

the detection module is used for determining to update a target predicate in response to the blockchain network detecting that the target consensus node exceeds a preset duration and the newly added block is not generated;

The first updating module is used for determining an updating consensus node selection strategy according to the updating target predicate by the client;

the second updating module is used for determining an updating target consensus node by the client according to the plurality of transmissions and the updating consensus node selection strategy;

and the second block transmission module is used for generating a compressed block of the newly added block corresponding to the client by the updating target consensus node and broadcasting the compressed block to the other consensus nodes so as to store the newly added block into the block chain.

In some optional examples, the predicate-based block compression transmission apparatus in the above embodiments of the present disclosure further includes:

the client sends a target consensus node selection request for the target consensus node to the plurality of consensus nodes, wherein the target consensus node selection request comprises signature information, and the signature information is obtained by signing preset information by the client through a public key and a private key of the client;

the verification module is used for verifying the signature information by the plurality of consensus nodes by using the public key and the public key of the public-private key pair of the client;

And the uplink module is used for responding to the verification result of the consensus nodes exceeding the preset number to verify the signature information, and each consensus node stores the consensus node selection strategy into the blockchain.

In the predicate-based block compression transmission device of the present disclosure, various optional embodiments, optional implementations and optional examples of the disclosure may be flexibly selected and combined according to needs, so as to achieve corresponding functions and effects, which are not listed in one-to-one.

The predicate-based block compression transmission device of the present disclosure corresponds to the embodiments of each predicate-based block compression transmission method of the present disclosure, and the relevant contents may be referred to each other, which is not described herein again.

Advantageous technical effects corresponding to the exemplary embodiments of the predicate-based block compression transmission apparatus of the present disclosure may refer to corresponding advantageous technical effects of the above-described exemplary method section, and will not be described herein.

In addition, the embodiment of the disclosure also provides an electronic device, which comprises:

a memory for storing a computer program;

and the processor is used for executing the computer program stored in the memory, and realizing the predicate-based block compression transmission method according to any one of the embodiments of the disclosure when the computer program is executed.

Fig. 9 is a schematic structural diagram of an application embodiment of the electronic device of the present disclosure. Next, an electronic device according to an embodiment of the present disclosure is described with reference to fig. 9. The electronic device may be either or both of the first device and the second device, or a stand-alone device independent thereof, which may communicate with the first device and the second device to receive the acquired input signals therefrom.

As shown in fig. 9, the electronic device includes one or more processors and memory.

The processor may be a Central Processing Unit (CPU) or other form of processing unit having data processing and/or instruction execution capabilities, and may control other components in the electronic device to perform the desired functions.

The memory may include one or more computer program products that may include various forms of computer-readable storage media, such as volatile memory and/or non-volatile memory. The volatile memory may include, for example, random Access Memory (RAM) and/or cache memory (cache), and the like. The non-volatile memory may include, for example, read Only Memory (ROM), hard disk, flash memory, and the like. One or more computer program instructions may be stored on the computer readable storage medium that can be executed by a processor to implement the predicate-based block compression transmission method and/or other desired functions of the various embodiments of the present disclosure described above.

In one example, the electronic device may further include: input devices and output devices, which are interconnected by a bus system and/or other forms of connection mechanisms (not shown).

In addition, the input device may include, for example, a keyboard, a mouse, and the like.

The output device may output various information including the determined distance information, direction information, etc., to the outside. The output devices may include, for example, a display, speakers, a printer, and a communication network and remote output devices connected thereto, etc.

Of course, only some of the components of the electronic device relevant to the present disclosure are shown in fig. 9 for simplicity, components such as buses, input/output interfaces, and the like being omitted. In addition, the electronic device may include any other suitable components depending on the particular application.

In addition to the methods and apparatus described above, embodiments of the present disclosure may also be a computer program product comprising computer program instructions which, when executed by a processor, cause the processor to perform the steps in a predicate-based block compression transmission method according to various embodiments of the present disclosure described in the above section of the specification.

The computer program product may write program code for performing the operations of embodiments of the present disclosure in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device, partly on a remote computing device, or entirely on the remote computing device or server.

Further, embodiments of the present disclosure may also be a computer-readable storage medium having stored thereon computer program instructions that, when executed by a processor, cause the processor to perform the steps in a predicate-based block compression transmission method according to various embodiments of the present disclosure described in the above section of the present description.

The computer readable storage medium may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may include, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium would include the following: an electrical connection having one or more wires, a portable disk, a hard disk, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

Those of ordinary skill in the art will appreciate that: all or part of the steps for implementing the above method embodiments may be implemented by hardware associated with program instructions, where the foregoing program may be stored in a computer readable storage medium, and when executed, the program performs steps including the above method embodiments; and the aforementioned storage medium includes: various media that can store program code, such as ROM, RAM, magnetic or optical disks.

The basic principles of the present disclosure have been described above in connection with specific embodiments, however, it should be noted that the advantages, benefits, effects, etc. mentioned in the present disclosure are merely examples and not limiting, and these advantages, benefits, effects, etc. are not to be considered as necessarily possessed by the various embodiments of the present disclosure. Furthermore, the specific details disclosed herein are for purposes of illustration and understanding only, and are not intended to be limiting, since the disclosure is not necessarily limited to practice with the specific details described.

In this specification, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different manner from other embodiments, so that the same or similar parts between the embodiments are mutually referred to. For system embodiments, the description is relatively simple as it essentially corresponds to method embodiments, and reference should be made to the description of method embodiments for relevant points.

The block diagrams of the devices, apparatuses, devices, systems referred to in this disclosure are merely illustrative examples and are not intended to require or imply that the connections, arrangements, configurations must be made in the manner shown in the block diagrams. As will be appreciated by one of skill in the art, the devices, apparatuses, devices, systems may be connected, arranged, configured in any manner. Words such as "including," "comprising," "having," and the like are words of openness and mean "including but not limited to," and are used interchangeably therewith. The terms "or" and "as used herein refer to and are used interchangeably with the term" and/or "unless the context clearly indicates otherwise. The term "such as" as used herein refers to, and is used interchangeably with, the phrase "such as, but not limited to.

The methods and apparatus of the present disclosure may be implemented in a number of ways. For example, the methods and apparatus of the present disclosure may be implemented by software, hardware, firmware, or any combination of software, hardware, firmware. The above-described sequence of steps for the method is for illustration only, and the steps of the method of the present disclosure are not limited to the sequence specifically described above unless specifically stated otherwise. Furthermore, in some embodiments, the present disclosure may also be implemented as programs recorded in a recording medium, the programs including machine-readable instructions for implementing the methods according to the present disclosure. Thus, the present disclosure also covers a recording medium storing a program for executing the method according to the present disclosure.

It is also noted that in the apparatus, devices and methods of the present disclosure, components or steps may be disassembled and/or assembled. Such decomposition and/or recombination should be considered equivalent to the present disclosure.

The previous description of the disclosed aspects is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects without departing from the scope of the disclosure. Thus, the present disclosure is not intended to be limited to the aspects shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

The foregoing description has been presented for purposes of illustration and description. Furthermore, this description is not intended to limit the embodiments of the disclosure to the form disclosed herein. Although a number of example aspects and embodiments have been discussed above, a person of ordinary skill in the art will recognize certain variations, modifications, alterations, additions, and subcombinations thereof.

Claims (11)

1. A predicate-based block compression transmission method, the method comprising:

The method comprises the steps that a client obtains a target predicate and a plurality of transmission time lengths for transmitting data between the client and a plurality of consensus nodes in a blockchain network, wherein the client and any one of the plurality of consensus nodes have one transmission time length;

the client determines a consensus node selection strategy according to the target predicate;

the client determines a target consensus node according to the transmission time lengths and the consensus node selection strategy;

and responding to the target consensus node meeting a preset block out condition, generating a compressed block of a new block corresponding to the client by the target consensus node, and broadcasting the compressed block to other consensus nodes so as to store the new block into a blockchain of the blockchain network, wherein the other consensus nodes are consensus nodes except the target consensus node in the blockchain network.

2. The method of claim 1, wherein the client obtains a plurality of transmission durations for transmitting data between the client and a plurality of consensus nodes in a blockchain network, comprising:

for each of the plurality of consensus nodes, the client determines a transmission duration of data between the client and the consensus node based on a size of preset test data, a bandwidth and a delay of a communication line between the client and the consensus node.

3. The method of claim 1, wherein the client obtains a target predicate, comprising:

the client acquires a corresponding relation between predicates and a consensus node selection strategy from the blockchain network;

the client determines the target predicate based on a correspondence between the predicate and a consensus node selection policy.

4. A method according to any of claims 1-3, wherein the target predicate includes an operation parameter and a limitation parameter, wherein the operation parameter is an operator, or predicate and the limitation parameter is a macro, variable, or function.

5. The method of any of claims 1-3, further comprising, prior to the client obtaining the target predicate and a plurality of transmission durations for transmitting data between the client and a plurality of consensus nodes in a blockchain network:

performing slicing processing on the block chain network to obtain a plurality of service domains, wherein each service domain in the plurality of service domains respectively comprises the plurality of consensus nodes;

and each service domain in the service domains respectively determines one consensus node from a plurality of consensus nodes in the service domains as a block-out node for generating a block, wherein the block-out nodes of each service domain are different.

6. The method of claim 5, wherein the target consensus node generates a compressed block of a new block corresponding to the client and broadcasts the compressed block to other consensus nodes to cause the new block to be stored in a blockchain of the blockchain network, comprising:

generating a compressed block of the newly added block corresponding to the client by the target consensus node;

the target consensus node is used as a plurality of consensus nodes in a target service domain of the block outlet node to carry out consensus on the validity of the compressed block;

and responding to the consensus result of the validity of the compressed block to indicate that the compressed block is legal, and storing the new block into the blockchain according to the compressed block by a plurality of consensus nodes in the target service domain.

7. A method according to any of claims 1-3, wherein said responding to said target consensus node meeting a preset out-block condition further comprises:

in response to the blockchain network detecting that the target consensus node does not generate the newly added block for more than a preset time period, the client determines to update a target predicate;

the client determines an updating consensus node selection strategy according to the updating target predicate;

The client determines an updating target consensus node according to the plurality of transmissions and the updating consensus node selection strategy;

and generating a compressed block of the new block corresponding to the client by the updating target consensus node, and broadcasting the compressed block to the other consensus nodes so as to store the new block into the blockchain.

8. A method according to any of claims 1-3, wherein the client, after determining a target consensus node according to the plurality of transmission durations and the consensus node selection policy, further comprises:

the client sends a target consensus node selection request for the target consensus node to the plurality of consensus nodes, wherein the target consensus node selection request comprises signature information, and the signature information is obtained by signing preset information by the client by utilizing a public key and a private key of the client;

the plurality of consensus nodes verify the signature information by utilizing the public key in the public-private key pair of the client side respectively;

and responding to the verification result of the consensus nodes exceeding the preset number to verify the signature information, wherein the plurality of consensus nodes store the consensus node selection strategy into the blockchain.

9. A predicate-based block compression transmission device, the device comprising:

the system comprises an acquisition module, a control module and a control module, wherein the acquisition module is used for acquiring a target predicate and a plurality of transmission time lengths for transmitting data between the client and a plurality of consensus nodes in a blockchain network, wherein the client and any one of the plurality of consensus nodes have one transmission time length;

the strategy determining module is used for determining a consensus node selection strategy according to the target predicate by the client;

the target consensus node determining module is used for determining a target consensus node according to the plurality of transmission time lengths and the consensus node selection strategy by the client;

and the first block transmission module is used for responding to the target consensus node meeting a preset block outlet condition, generating a compressed block of a new block corresponding to the client by the target consensus node, and broadcasting the compressed block to other consensus nodes so as to store the new block into a blockchain of the blockchain network, wherein the other consensus nodes are consensus nodes except the target consensus node in the blockchain network.

10. An electronic device, comprising:

A memory for storing a computer program;

a processor for executing a computer program stored in the memory, and which when executed implements the predicate-based block compression transmission method of any of the preceding claims 1-8.

11. A computer readable storage medium having stored thereon a computer program, which when executed by a processor, implements the predicate-based block compression transmission method of any of the preceding claims 1-8.