WO2024000897A1 - Blockchain-based digital asset synthesis method and apparatus - Google Patents

Abstract

A blockchain-based digital asset synthesis method and apparatus. The method comprises: any blockchain node, when detecting a digital asset synthesis transaction, performing an XOR operation on gene sequences of k digital assets to be synthesized, generating an initial filial-generation gene sequence (201); when it is determined that the initial filial-generation gene sequence exists on the blockchain, on the basis of an unused random gene sequence, performing ith gene replacement on the initial filial-generation gene sequence, generating an ordered filial-generation candidate set belonging to the ith gene replacement (202); if it is determined that j candidate gene sequences are all present in the blockchain, then performing ith+1 gene replacement on the initial filial-generation gene sequence and continuing until nth-1 gene replacement is performed on the initial filial-generation gene sequence, thereby determining the gene sequence of the new digital asset (203). It is thus possible to effectively ensure that execution results on different blockchain nodes are consistent for gene sequences of newly generated digital assets.

Description

A blockchain-based digital asset synthesis method and device

Cross-references to related applications

This application requires the priority of a Chinese patent application submitted to the China Patent Office on June 29, 2022, with the application number 202210762540.8 and the application name "A blockchain-based digital asset synthesis method and device", and its entire content has been approved This reference is incorporated into this application.

Technical field

Embodiments of the present invention relate to the field of financial technology (Fintech), and in particular to a blockchain-based digital asset synthesis method and device.

Background technique

With the development of computer technology, more and more technologies are applied in the financial field. The traditional financial industry is gradually transforming into financial technology. However, due to the security and real-time requirements of the financial industry, it also places higher requirements on technology.

Digital assets are unique digital certificates generated using blockchain technology, corresponding to specific works and artworks. On the basis of protecting their digital copyrights, they can realize authentic and credible digital issuance, purchase, collection and use. Among them, there are various types of digital assets, including but not limited to digital pictures, music, videos, 3D models, electronic tickets, digital souvenirs and other forms. Based on this, for a certain type of digital assets, in order to derive new digital assets of this type in a timely and effective manner, one or two existing digital assets of this type can be selected from the blockchain for synthesis, then , if you want to synthesize new digital assets of this type, you need to use genetic algorithms to achieve it.

However, existing genetic algorithms need to rely on random numbers when generating new offspring populations. On the blockchain, since the execution results of each blockchain node are required to be consistent, random numbers cannot be used (because each blockchain node are independent, and the random numbers generated are different), resulting in the existing genetic algorithm being unable to be applied to the blockchain.

In summary, there is an urgent need for a blockchain-based digital asset synthesis method to effectively ensure that the execution results of the genetic sequences of the new digital assets generated on different blockchain nodes are consistent, so that Solve the problem in the existing technology that the existing genetic algorithm cannot be applied to the blockchain due to the different random numbers generated by each blockchain node.

Contents of the invention

Embodiments of the present invention provide a blockchain-based digital asset synthesis method and device to effectively ensure that the execution results of the gene sequences of new digital assets generated on different blockchain nodes are consistent, so as to This can solve the problem in the existing technology that the existing genetic algorithm cannot be applied to the blockchain due to the different random numbers generated by each blockchain node.

In a first aspect, embodiments of the present invention provide a blockchain-based digital asset synthesis method, which is suitable for a blockchain network with m blockchain nodes. The method includes:

For any blockchain node, when the blockchain node detects a digital asset synthesis transaction, it performs an XOR operation on the gene sequences of the k digital assets to be synthesized in the digital asset synthesis transaction to generate an initial sub- generation gene sequence; the digital asset synthesis transaction is determined by the client based on the gene sequences of k digital assets to be synthesized and an unused random gene sequence generated by the client; each digital asset to be synthesized Both the existing gene sequence and the unused random gene sequence include n genes;

When the blockchain node determines that the initial progeny gene sequence exists on the blockchain, it will perform the initial progeny gene sequence on the set gene replacement method based on the unused random gene sequence. The i-th gene replacement generates an ordered progeny candidate set belonging to the i-th gene replacement; the ordered progeny candidate set belonging to the i-th gene replacement includes j candidate gene sequences;

If the blockchain node determines that the j candidate gene sequences all exist in the blockchain, then based on the unused random gene sequence, the i+1th process is performed on the initial offspring gene sequence. times of gene replacement until the n-1th gene replacement is performed on the initial offspring gene sequence, thereby determining the gene sequence of the new digital asset generated for the k digital assets to be synthesized.

Among the above technical solutions, the technical solution in the present invention generates the same unused random gene sequence for each blockchain node through the client, so that each blockchain node can perform genetic modification on the initial offspring gene sequence according to the same replacement method. Replacement can avoid the situation where the genetic sequence of the new digital assets generated by each blockchain node is inconsistent due to the different random numbers generated, and can effectively ensure the uniqueness of the genetic sequence of the new digital assets generated. Specifically, for any blockchain node, when the blockchain node detects a digital asset synthesis transaction, it can perform an XOR operation on the gene sequences of the k digital assets to be synthesized in the digital asset synthesis transaction, so as to This generates the initial progeny gene sequence. Then, when it is determined that the initial offspring gene sequence does not exist on the blockchain, the initial offspring gene sequence is used as the gene sequence of the new digital asset; when it is determined that the initial offspring gene sequence exists on the blockchain, the initial offspring gene sequence can be used as Based on the set gene replacement method, and based on the unused random gene sequence, the i-th gene replacement is performed on the initial offspring gene sequence to generate an ordered offspring candidate set belonging to the i-th gene replacement, which can effectively Determine whether a certain candidate gene sequence in the ordered descendant candidate set does not exist on the blockchain. If it is determined that each candidate gene sequence in the ordered offspring candidate set exists on the blockchain, then the i+1th gene replacement can be performed on the initial offspring gene sequence based on the unused random gene sequence until the initial After the n-1 gene replacement of the offspring gene sequence, the gene sequence of the new digital asset generated for the k digital assets to be synthesized can be determined. In this way, this scheme can generate the gene sequence of a new digital asset within a certain search space, and judge the candidate genes in the ordered descendant candidate set based on the ordered descendant candidate set generated by a certain gene replacement. Whether the sequence exists on the blockchain, this can effectively avoid the problem of conflicts between the currently generated gene sequence and the previously generated gene sequence, thus effectively ensuring that the user response time will not time out. In addition, because the client generates the same unused random gene sequence for each blockchain node, this solution enables each blockchain node to perform gene replacement for the initial offspring gene sequence according to the same replacement method, so it can effectively Ensure that the execution results of the genetic sequences of the new digital assets generated on different blockchain nodes are consistent. This can solve the problem of existing genetic algorithms caused by different random numbers generated by each blockchain node in the existing technology. Problems that cannot be applied to the blockchain.

Optionally, based on the unused random gene sequence, perform the i-th gene replacement on the initial progeny gene sequence to generate an ordered progeny candidate set belonging to the i-th gene replacement, including:

The blockchain node selects i genes from the unused random gene sequences as replacement genes for the initial offspring gene sequence;

The blockchain node exchanges the i genes in the unused random gene sequence with the i genes at the corresponding positions in the initial offspring gene sequence, thereby generating the i genes belonging to the i-th gene replacement. The set of sequential descendant candidates.

In the above technical solution, since the unused random gene sequence does not exist on the blockchain, the genes at multiple positions in the unused random gene sequence are used to replace the corresponding positions in the initial offspring gene sequence. Multiple genes can obtain the gene sequence that does not exist on the blockchain to the greatest extent possible, that is, the gene sequence of the new digital asset can be obtained, and then the gene sequence of the generated new digital asset can be effectively ensured. The uniqueness of the new digital asset can also enable the synthesized new digital asset to inherit the attributes of the parent to the greatest extent, that is, the probability of the synthesized new digital asset inheriting the attributes of the parent is greater than random generation, so as to retain the scarce characteristics of the parent's genes.

Optionally, also includes:

If the blockchain node determines that any candidate gene sequence among the j candidate gene sequences does not exist in the blockchain, it will determine the candidate gene sequence as the gene sequence of the new digital asset.

In the above technical solution, when it is determined that a candidate gene sequence in the ordered descendant candidate set generated after replacement does not exist on the blockchain, the candidate gene sequence can be used as the gene sequence of the new digital asset, so that it can Effectively ensure the uniqueness of the gene sequence of the new digital assets generated, which can effectively avoid the possibility of conflicts between offspring and offspring, and can realize the XOR of the gene sequences of multiple parents. The purpose of the operation is to generate a new offspring with a genetic sequence.

Optionally, after performing the n-1th gene replacement on the initial progeny gene sequence, it also includes:

If the blockchain node determines that the p candidate gene sequences included in the ordered offspring candidate set belonging to the n-1th gene replacement generated by performing the n-1th gene replacement on the initial offspring gene sequence are all exists in the blockchain, the unused random gene sequence is determined as the gene sequence of the new digital asset.

In the above technical solution, in order to avoid the response time of the user's request to generate the gene sequence of the new offspring being too long, that is, to effectively ensure that the response time of the user's request to generate the gene sequence of the new offspring does not time out, it will be ensured that in There is a certain search space to generate the gene sequence of a new digital asset, then after the n-1th gene replacement of the initial offspring gene sequence, if a candidate gene sequence that does not exist on the blockchain is still not found, then The unused random gene sequence will be directly used as the gene sequence of the new digital asset, because the unused random gene sequence does not exist on the blockchain, thereby generating the gene sequence of the new digital asset. This can effectively ensure the uniqueness of the genetic sequence of the new digital assets generated.

Optionally, the blockchain node exchanges i genes in the unused random gene sequence with i genes at corresponding positions in the initial offspring gene sequence, thereby generating the i-th An ordered set of progeny candidates for gene replacement, including:

The blockchain node determines at least one gene position sequence number combination for gene replacement based on the unused random gene sequence and the n; each gene position sequence number combination includes at least one value with an operation sequence. gather;

The blockchain node replaces the i genes at the corresponding positions in the initial offspring gene sequence based on the i genes in the unused random gene sequence and through at least one gene position number combination, thereby Generate an ordered set of offspring candidates belonging to the i-th gene replacement.

In the above technical solution, based on the unused random gene sequence and the total number of genes n owned by the digital asset, corresponding calculations can be performed to generate at least one gene position sequence number combination for gene replacement, so that at least one gene position number combination can be generated. A gene position sequence number combination replaces multiple genes in the initial progeny gene sequence with multiple genes at corresponding positions in the unused random gene sequence, so that effective replacement of the initial progeny gene sequence can be achieved. Provide support for subsequent effective generation of genetic sequences for new digital assets.

Optionally, the blockchain node determines at least one gene position sequence number combination for gene replacement based on the unused random gene sequence and n, including:

If the value of i is 1, then the blockchain node performs a remainder operation on the unused random gene sequence and n to determine the first value;

The blockchain node determines n initial gene position numbers with operational order based on the first value and n;

The blockchain node performs a remainder operation on the n initial gene position numbers and n in sequence according to the order of operations of the n initial gene position numbers, thereby determining the n first gene positions in the order of operations. Serial number; the n first gene position serial numbers with operational order are used to form a first gene position serial number combination; the n first gene position serial numbers with operational order are used to assist gene replacement;

The blockchain node replaces the i genes at the corresponding positions in the initial offspring gene sequence based on the i genes in the unused random gene sequence and through at least one gene position number combination, thereby Generate an ordered set of offspring candidates belonging to the i-th gene replacement, including:

The blockchain node sequentially adds the n first gene position numbers in the initial offspring gene sequence according to the order of operation of the n first gene position numbers included in the first gene position number combination. The corresponding genes are replaced with genes corresponding to the n first gene position numbers in the unused random gene sequence, thereby generating an ordered descendant candidate set belonging to the i-th gene replacement.

In the above technical solution, when performing a gene replacement for the initial offspring gene sequence, an ordered sequence (i.e., the first numerical value with a certain order of operations) can be generated through the remainder operation of the unused random gene sequence and n. ), and based on this ordered sequence, multiple candidate new progeny gene sequences can be generated with a certain degree of certainty. In this way, a unique new progeny gene sequence can be determined to the greatest possible extent from multiple candidate new progeny gene sequences. Digital assets have gene sequences that enable each blockchain node to generate the same gene sequence and determine whether there is a candidate new child gene sequence among multiple candidate new child gene sequences in the same order. Does not exist on the blockchain.

Optionally, the blockchain node determines at least one gene position sequence number combination for gene replacement based on the unused random gene sequence and n, including:

If the value of i is greater than or equal to 2, the blockchain node determines, based on the n first gene position numbers with operational order corresponding to the first gene replacement, except one gene corresponding to the first gene replacement. The other i-1 genes each correspond to the q second gene position numbers in the order of operation;

The blockchain node determines a plurality of genes for use based on the n first gene position numbers with operational order and the q second gene position numbers with operational order corresponding to each of the i-1 genes. The second gene position sequence number combination of gene replacement;

The blockchain node replaces the i genes at the corresponding positions in the initial offspring gene sequence based on the i genes in the unused random gene sequence and through at least one gene position number combination, thereby Generate an ordered set of offspring candidates belonging to the i-th gene replacement, including:

For each second gene position sequence number combination, if at least one value set in the second gene position sequence number combination is an empty set, the blockchain node does not perform gene replacement for the initial offspring gene sequence;

If there is no value set in the second gene position sequence number combination that is an empty set, the blockchain node will sequentially add at least one value set included in the second gene position sequence number combination in the initial offspring gene sequence. The gene corresponding to the gene position number is replaced with the gene corresponding to at least one gene position number in the unused random gene sequence, thereby generating an ordered descendant candidate set belonging to the i-th gene replacement.

In the above technical solution, when multiple gene replacements are performed on the initial progeny gene sequence, it is very likely that more candidate new progeny gene sequences will be generated, so that the new progeny may have more gene sequences and be selective. also increases, then it will be very likely to determine the gene sequence of a unique new digital asset from more candidate new offspring gene sequences, so it will be very likely to be within a certain search space. Generate the genetic sequence of a new digital asset, so each blockchain node can traverse all the descendants that can be generated, and ensure that the traversal order of each blockchain node is consistent, thus effectively ensuring synthesis The offspring that come out have the same genetic sequence.

Optionally, after determining the gene sequence of the new digital asset generated for the k digital assets to be synthesized, it also includes:

Mark the usage status of the gene sequence of the new digital asset as used, and upload the gene sequence of the new digital asset marked as used to the blockchain for storage.

In the above technical solution, in order to effectively avoid the possibility of conflicts between subsequently generated offspring and previously generated offspring, and in order to effectively ensure the uniqueness of the genetic sequence of the generated new digital assets, it is necessary to generate new After the genetic sequence of the digital asset is obtained, the usage status of the genetic sequence of the new digital asset will be marked as used, and the genetic sequence of the new digital asset marked as used will be uploaded to the blockchain for subsequent generation. After the gene sequence of the new offspring is determined in a timely and accurate manner through the blockchain, whether the gene sequence of the generated new offspring exists on the blockchain.

In a second aspect, embodiments of the present invention also provide a blockchain-based digital asset synthesis device, which is suitable for a blockchain network with m blockchain nodes. The device includes:

The generation unit is used for any blockchain node, when a digital asset synthesis transaction is detected, to perform an XOR operation on the gene sequences of the k digital assets to be synthesized in the digital asset synthesis transaction, and generate an initial offspring. Gene sequence; the digital asset synthesis transaction is determined by the client based on the gene sequences of k digital assets to be synthesized and an unused random gene sequence generated by the client; each digital asset to be synthesized has The gene sequence and the unused random gene sequence include n genes;

A processing unit configured to perform a third process on the initial offspring gene sequence based on the unused random gene sequence according to the set gene replacement method when it is determined that the initial offspring gene sequence exists on the blockchain. The i-th gene replacement generates an ordered progeny candidate set belonging to the i-th gene replacement; the ordered progeny candidate set belonging to the i-th gene replacement includes j candidate gene sequences; if the j candidate genes are determined If the sequences all exist in the blockchain, then based on the unused random gene sequence, the i+1th gene replacement is performed on the initial offspring gene sequence until the initial offspring gene sequence is After the n-1th gene replacement, the gene sequence of the new digital asset generated for the k digital assets to be synthesized is determined.

In a third aspect, embodiments of the present invention provide a computing device, including at least one processor and at least one memory, wherein the memory stores a computer program, and when the program is executed by the processor, the processing The server executes any of the blockchain-based digital asset synthesis methods described in the first aspect above.

In a fourth aspect, embodiments of the present invention provide a computer-readable storage medium that stores a computer program that can be executed by a computing device. When the program is run on the computing device, the computing device executes the above-mentioned first step. The blockchain-based digital asset synthesis method described in any aspect.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following will briefly introduce the drawings needed to describe the embodiments. Obviously, the drawings in the following description are only some embodiments of the present invention. Those of ordinary skill in the art can also obtain other drawings based on these drawings without exerting creative efforts.

Figure 1 is a schematic diagram of a possible system architecture provided by an embodiment of the present invention;

Figure 2 is a schematic flow chart of a blockchain-based digital asset synthesis method provided by an embodiment of the present invention;

Figure 3 is a schematic structural diagram of a blockchain-based digital asset synthesis device provided by an embodiment of the present invention;

Figure 4 is a schematic structural diagram of a computing device provided by an embodiment of the present invention.

Detailed ways

In order to make the purpose, technical solutions and advantages of the present invention clearer, the present invention will be described in further detail below in conjunction with the accompanying drawings. Obviously, the described embodiments are only some of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts fall within the scope of protection of the present invention.

Some terms involved in the embodiments of the present invention are first explained below to facilitate understanding by those skilled in the art.

(1) Blockchain: Blockchain is a distributed storage system that is jointly maintained and trusted by multiple nodes. The bottom layer of the blockchain is a chain composed of a series of blocks. In addition to recording the data of the current block, each block also records the hash value of the previous block. In this way, a chain-like data structure is formed. A block consists of a block header and a block body. The block header definition includes important fields such as the height of the block and the hash value of the previous block. The block body mainly stores transaction data. Blockchain uses cryptography to ensure the security of data transmission and access, and uses a chain structure to ensure that the data on the chain cannot be tampered with.

(2) Node: In the blockchain, a node refers to a participant with a unique identity. This node has a complete copy of the ledger and has the ability to participate in the consensus of the blockchain network and maintain the ledger.

(3) Smart contract: A smart contract is a collection of code and data running on the blockchain system. The code is responsible for realizing the functions of the smart contract, the data is responsible for storing the status of the smart contract, and the smart contract can receive and send information.

(4) Transaction: In the blockchain, any operation (deploying a contract, calling a contract interface, etc.) is performed by sending a transaction. Transactions are initiated by users and sent to blockchain nodes through the client. After receiving the transaction, the blockchain node will package the transaction into a block and execute it.

(5) Digital assets: non-homogeneous assets with unique identifiers on the blockchain.

(6) Genetic Algorithm (GA): It is a computational model of the biological evolution process that simulates the natural selection and genetic mechanisms of Darwin's biological evolution theory. It is a method of searching for optimal solutions by simulating the natural evolution process.

As mentioned above, some terms involved in the embodiments of the present invention are introduced, and the technical features involved in the embodiments of the present invention are introduced below.

In order to facilitate understanding of the embodiments of the present invention, first, a possible system architecture shown in Figure 1 is taken as an example to illustrate the blockchain-based digital asset synthesis system architecture applicable to the embodiments of the present invention. As shown in Figure 1, the system architecture may include a client 100 and a blockchain network 200. Among them, the blockchain network 200 may include at least one blockchain node, such as blockchain node 201, blockchain node 202, blockchain node 203, blockchain node 204, etc., and any two zones in at least one node Blockchain nodes can be communicated and connected; the client 100 and any blockchain node in the blockchain network 200 can be communicated and connected through wired means, or can be communicated and connected through wireless means, which is not limited in the embodiment of the present invention. .

For example, when the client needs to synthesize new digital assets from multiple parent digital assets, an unused random gene sequence will be generated, and the unused random gene sequence and each parent digital asset will be generated. All have the same number of genes, and based on the unused random gene sequence and multiple parent digital assets, a digital asset synthesis transaction is generated, and then, to any blockchain node in the blockchain network 200 (such as the district The blockchain node 201) submits the digital asset synthesis transaction, or may submit the digital asset synthesis transaction to each node in the blockchain network 200. Taking any blockchain node (such as node blockchain 201) in the blockchain network 200 to submit the digital asset synthesis transaction as an example, after receiving the digital asset synthesis transaction, the blockchain node 201 will Other blockchain nodes in the blockchain network 200 synchronize the digital asset synthesis transaction, and each blockchain node stores the digital asset synthesis transaction in its own transaction pool. Then, the block-producing node will package the digital asset synthetic transaction into a block and initiate a consensus process for the block, such as using a Byzantine fault-tolerant algorithm or a proof-of-work consensus algorithm, etc., and after the block consensus is successful, The block is uploaded to the chain. Among them, each blockchain node will execute the digital asset synthesis transaction in the block according to the same digital asset synthesis transaction execution rules, and then determine whether the execution results of each blockchain node for the digital asset synthesis transaction are consistent or reach an agreement. When the consistent number meets the first set quantity threshold (for example, two-thirds of the blockchain nodes have consistent execution results), the execution result can be recognized. Finally, a certain gene sequence can be confirmed as a new digital asset, and the usage status of the gene sequence can be marked as used, and the gene sequence marked as used can be uploaded to the blockchain.

It should be noted that the system architecture shown in FIG. 1 is only an example, and the embodiment of the present invention is not limited thereto.

Based on the above description, Figure 2 exemplarily shows the process of a blockchain-based digital asset synthesis method provided by an embodiment of the present invention. This process can be executed by a blockchain-based digital asset synthesis device. Among them, the blockchain-based digital asset synthesis method in the embodiment of the present invention is suitable for a blockchain network with m blockchain nodes; the blockchain-based digital asset synthesis device may be a service device or may be a capable The components (such as chips or integrated circuits) that support the service device to implement the functions required by the method may of course also be other electronic devices with the functions required to implement the method. Among them, m is an integer greater than 1.

As shown in Figure 2, the process specifically includes:

Step 201, for any blockchain node, when the blockchain node detects a digital asset synthesis transaction, it performs an XOR operation on the gene sequences of the k digital assets to be synthesized in the digital asset synthesis transaction, Generate initial progeny gene sequences.

In the embodiment of the present invention, the digital asset synthesis transaction is determined by the client based on the gene sequences of k digital assets to be synthesized and an unused random gene sequence generated by the client; each digital asset to be synthesized has The gene sequence and the unused random gene sequence include n genes. Among them, k is an integer greater than or equal to 1; n is an integer greater than or equal to 1.

Among them, when a user within the blockchain network has the need to synthesize a new digital asset, the user will use a certain terminal device (such as a smartphone, tablet, laptop, etc.) based on the genetic attributes of the digital asset. The client installed on a desktop computer, etc.) generates an unused random gene sequence. The number of genes of the unused random gene sequence is the same as the number of genes of the digital asset. In this way, the number of genes generated by the client is Unused random gene sequences can be used when there is an initial descendant gene sequence generated by an XOR operation on the blockchain, so that each blockchain node can generate new digital assets based on the unused random gene sequence to the greatest extent possible. The genetic sequence can avoid the inability to use random numbers on the blockchain, and at the same time ensure that the execution results of each blockchain node on the blockchain for synthesizing new digital assets are basically consistent. Then, the client generates a digital asset synthesis transaction based on the unused random gene sequence and the gene sequences of k digital assets to be synthesized, and submits the digital asset synthesis transaction to any blockchain node in the blockchain network, or Digital asset synthesis transactions can be submitted to each blockchain node in the blockchain network. Alternatively, the user can generate a digital asset synthesis request on the client of the terminal device based on an unused random gene sequence and the gene sequences of k digital assets to be synthesized, and use the client of the terminal device to generate the digital asset synthesis request. The asset synthesis request is sent to any blockchain node in the blockchain network in the form of a transaction, or the digital asset synthesis request is sent to each blockchain node in the blockchain network in the form of a transaction. After receiving the digital asset synthesis transaction, any blockchain node can process the digital asset synthesis transaction accordingly. For example, it can perform an XOR operation on the gene sequences of the k digital assets to be synthesized in the digital asset synthesis transaction. , to generate the initial offspring gene sequence, or the digital asset synthetic transaction can be stored in the local transaction pool. Then, a certain blockchain node in the blockchain network is determined as the block producing node (that is, the main node), the blockchain node will package the digital asset synthetic transactions in the local transaction pool into blocks, and send the blocks to other blockchains in the blockchain network other than the blockchain node. The nodes carry out consensus, and after confirming that the block consensus is successful, the block will be uploaded to the chain. That is to say, in the consensus process for the block, each blockchain node will execute the block, that is, execute the digital asset synthesis transaction in the block, such as for k pending digital asset synthesis transactions. The gene sequence of the synthesized digital asset is XORed to generate the initial offspring gene sequence.

Illustratively, taking Fuhu Digital Assets as an example, each digital asset is unique on the blockchain and has its own unique number. Therefore, the unique number of Fuhu digital assets can be used as the representation of the gene sequence of Fuhu digital assets. Assume that Fuhu has 6 attributes, each attribute has 16 possibilities, and a 32-bit positive integer is used to represent each Fuhu. The unique number, then 24 bits can be used as the tiger's 6 attributes. As shown in Table 1, every 4 bits represent an attribute.

0-3	4-7	8-11	12-15	16-19	20-23	24-32
Property 1	Property 2	Property 3	Property 4	Property 5	Property 6	other
16 kinds	16 kinds	16 kinds	16 kinds	16 kinds	16 kinds	256

When multiple Fuhus need to be synthesized to produce a new Fuhu, in order for the newly generated Fuhu to inherit some attributes of the multiple Fuhus used for synthesis, an algorithm is needed to generate a new unique number. Fuhu. Since random numbers cannot be used in smart contracts, and in order to ensure that the user response time does not time out, this synthetic algorithm also needs to have a determined search space and consistent execution results on different machines (or nodes). Therefore, an ordered descendant candidate set can be generated by a deterministic genetic algorithm, and the descendants in the ordered descendant candidate set can be traversed one by one until a descendant that is not on the blockchain is found.

In addition, assuming that the attributes of each digital asset are determined by N genes, each gene has K possibilities, using M digital assets of the parent to synthesize a new digital asset, it is required that the synthesized new digital asset inherits the attributes of the parent. The probability is greater than random generation. For example, use M = 3 Fuhu to synthesize a new Fuhu. Each Fuhu has a total of N = 6 attributes, and each attribute has K = 16 possibilities. The unique number of the Fuhu is composed of its 6 attributes, then You can search for new synthetic Fuhu as follows. For example, input: M gene sequences x1, x2,..., xM of parent digital assets and an unused random gene sequence G0. Corresponding to the example, there are M = 3 parent tigers whose attributes are x1 = 0001 0101 0110. 0110 1011 0011, x2 = 0100 1110 1101 0011 1000 1000, X3 = 1000 1010 0100 0010 1110 1011, the unused random gene sequence G0 = 0010 1000 1100 0110 1010 1101. Output: The genetic sequence of the new digital asset, such as the genetic sequence of the new Fuhu digital asset. Among them, taking M = 3 Fuhu as an example, a user generates a digital asset synthesis transaction for the 3 Fuhu digital assets and the unused random gene sequence G0 through the client installed on the terminal device used, and The digital asset synthesis transaction is submitted to any blockchain node in the blockchain network. After any blockchain node synchronizes the digital asset synthesis transaction, the block producing node packages the digital asset synthesis transaction into a block. , and after initiating the consensus process for the block, each blockchain node will execute the digital asset synthesis transaction in the block, that is, perform an XOR operation on the gene sequences of the three Fu tigers to generate the gene sequence G1. If If G1 does not exist on the blockchain, then G1 is the gene sequence of the newly synthesized offspring Fuhu, and the deterministic genetic algorithm terminates; here, the XOR operation is selected as the gene synthesis algorithm, and the XOR operation is equivalent to no carry The addition, through the XOR operation, can obtain the gene sequences related to all parents to the greatest extent, retaining the scarce characteristics of the genes of the parents. Then use the gene sequences of the three Fuhu digital assets to perform an XOR operation to get the initial offspring gene sequence.

Step 202: When the blockchain node determines that the initial offspring gene sequence exists on the blockchain, it will replace the initial offspring with the unused random gene sequence in accordance with the set gene replacement method. The gene sequence undergoes the i-th gene replacement to generate an ordered set of offspring candidates belonging to the i-th gene replacement.

Step 203: If the blockchain node determines that the j candidate gene sequences all exist in the blockchain, then based on the unused random gene sequence, the initial offspring gene sequence is processed for the first time. i+1 gene replacements, until the n-1th gene replacement is performed on the initial offspring gene sequence, thereby determining the gene sequence of the new digital asset generated for the k digital assets to be synthesized. .

In the embodiment of the present invention, since the unused random gene sequence does not exist on the blockchain, the corresponding positions in the initial offspring gene sequence are replaced by genes at multiple positions in the unused random gene sequence. Multiple genes can obtain the gene sequence that does not exist on the blockchain to the greatest extent, that is, the gene sequence of the new digital asset can be obtained, and then the gene sequence of the new digital asset generated can be effectively ensured. The uniqueness of the sequence can also enable the synthesized new digital assets to inherit the attributes of the parent to the greatest extent, so as to retain the scarce characteristics of the parent's genes. Specifically, for each blockchain node, after performing an XOR operation on the gene sequences of k digital assets to be synthesized, the blockchain node can generate the initial offspring gene sequence, and determine the blockchain After the initial progeny gene sequence exists on the original progeny gene sequence, at least one gene in the initial progeny gene sequence can be replaced accordingly. If the blockchain node determines that the initial offspring gene sequence does not exist on the blockchain, the initial offspring gene sequence can be directly used as the gene sequence of the new digital asset generated by the k digital assets to be synthesized. That is, the blockchain node selects i genes from the unused random gene sequence as replacement genes for the initial offspring gene sequence, and combines i genes from the unused random gene sequence with the initial offspring The i genes at corresponding positions in the gene sequence are exchanged, thereby generating the i-th gene replacement. Among them, the ordered offspring candidate set belonging to the i-th gene replacement includes j candidate gene sequences. If the blockchain node determines that any of the j candidate gene sequences does not exist in the blockchain, the candidate gene sequence can be determined as the gene sequence of the new digital asset. If the blockchain node determines that j candidate gene sequences all exist in the blockchain, it is necessary to perform the i+1th gene replacement on the initial offspring gene sequence based on unused random gene sequences. Among them, i is an integer greater than or equal to 1; j is an integer greater than or equal to 1.

Among them, the blockchain node can perform corresponding calculations based on the unused random gene sequence and the total number of genes n possessed by the digital asset to generate at least one gene position sequence number combination for gene replacement, so that it can Through at least one combination of gene position numbers, multiple genes in the initial progeny gene sequence are replaced with multiple genes at corresponding positions in the unused random gene sequence, so that effective replacement of the initial progeny gene sequence can be achieved. This provides support for the subsequent effective generation of genetic sequences for new digital assets. That is, the blockchain node determines at least one gene position sequence number combination for gene replacement based on the unused random gene sequence and n. Each gene position sequence number combination includes at least one value set with an operation sequence. . Then, based on the i genes in the unused random gene sequence and at least one combination of gene position numbers, the i genes at the corresponding positions in the initial offspring gene sequence are replaced, thereby generating the i-th gene replacement. An ordered set of descendant candidates. Specifically, when performing a gene replacement for the initial offspring gene sequence, an ordered sequence (i.e., the first value with a certain order of operations) can be generated through the remainder operation of the unused random gene sequence and n. And based on this ordered sequence, multiple candidate new progeny gene sequences can be generated with a certain degree of certainty. In this way, a unique new digital asset can be determined to the greatest extent possible from multiple candidate new progeny gene sequences. With the genetic sequence, each blockchain node can produce the same genetic sequence. For example, if the value of i is 1, the blockchain node can perform a remainder operation on the unused random gene sequence and n to determine the first value, and based on the first value and n, n can be determined An initial gene position sequence number with a sequence of operations. Then, according to the order of operation of the n initial gene position numbers, the n initial gene position numbers and n are sequentially subjected to a remainder operation, so that n first gene position numbers with the order of operation can be determined. Among them, the n first gene position numbers with operation order are used to form a first gene position number combination; the n first gene position numbers with operation order are used to assist gene replacement. Finally, according to the order of operations of the n first gene position numbers included in the first gene position number combination, the genes corresponding to the n first gene position numbers in the initial offspring gene sequence are sequentially replaced with the n The first gene position sequence number corresponds to the gene in the unused random gene sequence, so that an ordered descendant candidate set belonging to the i-th gene replacement can be generated. Among them, n is an integer greater than or equal to 1.

In addition, when multiple gene replacements are performed on the initial progeny gene sequence, it is very likely that more candidate new progeny gene sequences will be generated, making the new progeny likely to have more gene sequences and more selectivity. Then it will be very likely to determine the gene sequence of a unique new digital asset from more candidate new offspring gene sequences, so it will be very likely to generate new numbers within a certain search space. The genetic sequence of the asset allows each blockchain node to traverse all the descendants that can be generated, and ensures that the traversal order of each blockchain node is consistent. For example, if the value of i is greater than or equal to 2, then the blockchain node can determine the n first gene position numbers in the order of operation based on the n corresponding to the first gene replacement, except the one corresponding to the first gene replacement. The i-1 genes other than the gene each correspond to q second gene position numbers in the order of operation, and based on the n first gene position numbers in the order of operation and the q corresponding to each of the other i-1 genes A plurality of second gene position sequence numbers with operational sequence can be used to determine multiple second gene position sequence number combinations for gene replacement. Then, for each second gene position sequence number combination, if at least one value set in the second gene position sequence number combination is an empty set, gene replacement may not be performed for the initial offspring gene sequence. If the second gene position sequence number If there is no value set in the combination and is an empty set, the gene corresponding to at least one gene position number included in the second gene position number combination in the initial offspring gene sequence can be replaced with an unused random gene sequence. The gene corresponding to the sequence number of the at least one gene in the gene can be generated, thereby generating an ordered descendant candidate set belonging to the i-th gene replacement. Among them, q is an integer greater than or equal to 1.

Furthermore, it should be noted that in order to avoid the response time of the user's request to generate the gene sequence of the new offspring being too long, that is, to effectively ensure that the response time of the user's request to generate the gene sequence of the new offspring does not time out, therefore It will ensure that the gene sequence of the new digital asset will be generated within a certain search space. Then, after the n-1th gene replacement of the initial offspring gene sequence, if it is determined that the n-1th gene replacement of the initial offspring gene sequence will be performed If the p candidate gene sequences included in the ordered progeny candidate set belonging to the n-1th gene replacement generated by gene replacement all exist in the blockchain, then the unused random gene sequences can be determined as new digital assets. It has a genetic sequence, which can effectively ensure the uniqueness of the generated new digital asset. In addition, in order to effectively avoid the possibility of conflict between subsequently generated offspring and previously generated offspring, and in order to effectively ensure the uniqueness of the genetic sequence of the generated new digital assets, then after determining the k After the gene sequence of the new digital asset generated from the digital asset to be synthesized, the usage status of the gene sequence of the new digital asset is marked as used, and the gene sequence of the new digital asset marked as used is uploaded. Save it to the blockchain so that after the gene sequence of the new offspring is generated, it can be timely and accurately determined through the blockchain whether the gene sequence of the generated new offspring exists on the blockchain. Among them, p is an integer greater than or equal to 1.

For example, assuming that the unused random gene sequence is G0, and assuming that the initial descendant gene sequence G1 exists on the blockchain, a gene replacement can be performed on the initial descendant gene sequence G1, that is, it has never been used. Select one gene from the used random gene sequence G0 as the mutant gene of the initial offspring gene sequence G1, and replace the i1th gene in the initial offspring gene sequence G1 with the i1th gene of the unused random gene sequence G0. , where i1 takes each value in {I, I+1,...,I+N-1}%N, I=G0%N, there are

This is a possibility, so that an ordered descendant candidate set belonging to the first gene replacement can be generated. Among them, traversal is performed in the order of i1 values to check whether each candidate gene sequence in the ordered descendant candidate set is in the region. exists on the blockchain. If it does not exist, it is the genetic sequence of the newly synthesized offspring digital assets, and the deterministic genetic algorithm terminates; here, since uncertain random numbers cannot be generated in smart contracts, I=G0%N is used. Generate an ordered sequence starting from I. Based on this ordered sequence, when N is 6, a certain

A new progeny gene enables each blockchain node to generate the same gene sequence and check whether the progeny gene sequence is available in the same order. For example, continue to use the above three Fuhu to synthesize new Fuhu as an example. Assume that the unused random gene sequence G0=0010 1000 1100 0110 1010 1101, and assume that the initial offspring gene sequence G1=1101 0001 1111 0111 1101 0000 in exists on the blockchain, you can calculate I=G0%N=0010 1000 1100 0110 1010 1101%6=3, so the value set of i1 is {3,4,5,0,1,2}, using the G0th i1 genes replace the corresponding genes of G1, and i1 takes {3,4,5,0,1,2} to generate the following ordered offspring candidate set belonging to the first gene replacement, and check the ordered offspring in order Whether each candidate gene sequence in the candidate set already exists on the blockchain, if not, mark the candidate gene sequence as existing (or mark as used) and return, and upload the marked candidate gene sequence to Blockchain, if all exist continue to the next step. Among them, the resulting ordered set of offspring candidates belonging to the first gene replacement is:

1101 0001 1111 0110 1101 0000

1101 0001 1111 0111 1010 0000

1101 0001 1111 0111 1101 1101

0010 0001 1111 0111 1101 0000

1101 1000 1111 0111 1101 0000

1101 0001 0110 0111 1101 0000

For example, assuming that a candidate gene sequence 1101 0001 1111 0111 1010 0000 belonging to the ordered offspring candidate set of the first gene replacement does not exist on the blockchain, the candidate gene sequence 1101 0001 1111 0111 1010 0000 can be used as a new Fuhu digital assets have the genetic sequence.

If none of the above candidate gene sequences exist on the blockchain, the second gene replacement can be performed on the initial offspring gene sequence G1, that is, two genes are selected from the unused random gene sequence G0 as the initial offspring. The mutant gene of the generation gene sequence G1 is replaced by the i1th and i2th genes in the initial offspring gene sequence G1 with the i1th and i2th genes of the unused random gene sequence G0, where i1 is {I,I +1,…,I+N-1}%N, I=G0%N, i2∈{i1+1,…,N-1}, there are a total of

possibility, so that an ordered set of offspring candidates belonging to the second gene replacement can be generated. Among them, traverse in the order of values of i1 and i2, and check whether each candidate gene sequence in the ordered descendant candidate set exists on the blockchain. If it does not exist, it is the gene sequence of the newly synthesized descendant digital asset. , the deterministic genetic algorithm terminates; choosing this value method here requires each blockchain node to traverse all the descendants that can be generated, and it is necessary to ensure that the traversal order of each node is consistent, so that the final synthesized descendants Digital assets have the same genetic sequence. For example, continue to use the above three Fuhu to synthesize new Fuhu as an example. Assume that the unused random gene sequence G0=0010 1000 1100 0110 1010 1101, and assume that the initial offspring gene sequence G1=1101 0001 1111 0111 1101 0000 in exists on the blockchain, you can calculate I=G0%N=0010 1000 1100 0110 1010 1101%6=3, so the value set of i1 is {3,4,5,0,1,2}, i2 takes [i1 +1, N-1], use the two genes in the unused random gene sequence G0 to replace the two genes at the corresponding positions of the initial descendant gene sequence G1, and use the unused random gene sequence G0 to replace the two genes at the corresponding positions. The i1 gene and the i2-th gene are used to replace the two genes at the corresponding positions of the initial descendant gene sequence G1. In this way, the following ordered descendant candidate set can be generated, and each candidate in the ordered descendant candidate set is checked in order. Whether the gene sequence already exists on the blockchain, if not, mark the candidate gene sequence as existing (or mark as used) and return, and upload the marked candidate gene sequence to the blockchain. If all If it exists, continue to the next step. Among them, the resulting ordered set of offspring candidates belonging to the second gene replacement is:

When i1=3 and the value set of i2 is {4,5}, the candidate gene sequences formed after replacement are:

1101 0001 1111 0110 1010 0000

1101 0001 1111 0110 1101 1101

When i1=4 and the value set of i2 is {5}, the candidate gene sequences formed after replacement are:

1101 0001 1111 0111 1010 1101

i1=5, the value set of i2 is the empty set {}, and there is no value to take in this case.

When i1=0 and the value set of i2 is {1,2,3,4,5}, the candidate gene sequences formed after replacement are:

0010 1000 1111 0111 1101 0000

0010 0001 0110 0111 1101 0000

0010 0001 1111 0110 1101 0000

0010 0001 1111 0111 1010 0000

0010 0001 1111 0111 1101 1101

When i1=1 and the value set of i2 is {2,3,4,5}, the candidate gene sequences formed after replacement are:

1101 1000 0110 0111 1101 0000

1101 1000 1111 0110 1101 0000

1101 1000 1111 0111 1010 0000

1101 1000 1111 0111 1101 1101

When i1=2 and the value set of i2 is {3,4,5}, the candidate gene sequences formed after replacement are:

1101 0001 0110 0110 1101 0000

1101 0001 0110 0111 1010 0000

1101 0001 0110 0111 1101 1101

For example, assuming that a candidate gene sequence 1101 1000 1111 0110 1101 0000 that belongs to the ordered offspring candidate set of the second gene replacement does not exist on the blockchain, the candidate gene sequence 1101 1000 1111 0110 1101 0000 can be used as a new Fuhu digital assets have the genetic sequence.

If none of the above candidate gene sequences exist on the blockchain, the third gene replacement can be performed on the initial descendant gene sequence G1, that is, the above operations are repeated until N is selected from the unused random gene sequence G0 -1 gene is used as the mutant gene of the initial descendant gene sequence G1, and the i1, i2,...,i(N-1)th gene in the initial descendant gene sequence G1 is used as the unused random gene sequence G0. i1,i2,…,i(N-1) gene substitutions, where i1 takes each value in {I,I+1,…,I+N-1}%N, I=G0%N, i2∈ {i_1+1,…,N-1},…,i(N-1)∈{i(N-2)+1,…,N-1}, there are

This is a possibility, so that an ordered descendant candidate set belonging to the third gene replacement can be generated. Among them, traversal is performed in the order of i1 values to check whether each candidate gene sequence in the ordered descendant candidate set is in the region. exists on the blockchain. If it does not exist, it is the genetic sequence of the newly synthesized offspring digital asset, and the deterministic genetic algorithm terminates. For example, use 3 genes in the unused random gene sequence G0 to replace the corresponding position genes of the initial descendant gene sequence G1. The i1, i2, and i3th genes replace the corresponding position genes of G1. i1 takes [3,4, 5,0,1,2], i2 takes [i1+1,5], and i3 takes [i2+1,5], the following ordered descendant candidate set can be generated, and the ordered descendant candidate set is checked in order Whether each candidate gene sequence already exists on the blockchain, if not, mark the candidate gene sequence as existing (or mark as used) and return, and upload the marked candidate gene sequence to the block. chain, if all exist continue to the next step. Among them, the generated candidate set of ordered offspring belonging to the third gene replacement is:

When i1=3, i2=4, and i3=5, the candidate gene sequences formed after replacement are:

1101 0001 1111 0110 1010 1101

i1=4, i2=5, i3={}, i3 is the empty set {}.

i1=5, i2={}, i3={}, i2 and i3 are empty sets {}.

When i1=0, i2=1, i3={2,3,4,5}, the candidate gene sequences formed after replacement are:

0010 1000 0110 0111 1101 0000

0010 1000 1111 0110 1101 0000

0010 1000 1111 0111 1010 0000

0010 1000 1111 0111 1101 1101

When i1=0, i2=2, i3={3,4,5}, the candidate gene sequences formed after replacement are:

0010 0001 0110 0110 1101 0000

0010 0001 0110 0111 1010 0000

0010 0001 0110 0111 1101 1101

When i1=0, i2=3, i3={4,5}, the candidate gene sequences formed after replacement are:

0010 0001 1111 0110 1010 0000

0010 0001 1111 0110 1101 1101

When i1=0, i2=4, and i3=5, the candidate gene sequences formed after replacement are:

0010 0001 1111 0111 1010 1101

i1=0, i2=5, i3={}, i3 is the empty set {}.

When i1=1, i2=2, i3={3,4,5}, the candidate gene sequences formed after replacement are:

1101 1000 0110 0110 1101 0000

1101 1000 0110 0111 1010 0000

1101 1000 0110 0111 1101 1101

When i1=1, i2=3, i3={4,5}, the candidate gene sequences formed after replacement are:

1101 1000 1111 0110 1010 0000

1101 1000 1111 0110 1101 1101

When i1=1, i2=4, and i3=5, the candidate gene sequences formed after replacement are:

1101 1000 1111 0111 1010 1101

i1=1, i2=5, i3={}, i3 is the empty set {}.

When i1=2, i2=3, i3={4,5}, the candidate gene sequences formed after replacement are:

1101 0001 0110 0110 1010 0000

1101 0001 0110 0110 1101 1101

When i1=2, i2=4, and i3=5, the candidate gene sequences formed after replacement are:

1101 0001 0110 0111 1010 1101

i1=2, i2=5, i3={}, i3 is the empty set {}.

For example, assuming that a candidate gene sequence 1101 1000 0110 0111 1010 0000 belonging to the ordered offspring candidate set of the third gene replacement does not exist on the blockchain, the candidate gene sequence 1101 1000 0110 0111 1010 0000 can be used as a new Fuhu digital assets have the genetic sequence.

If none of the above candidate gene sequences exist on the blockchain, the fourth gene replacement can be performed on the initial offspring gene sequence G1, that is, 4 genes are selected from the unused random gene sequence G0 as the initial offspring. The mutant gene of the generation gene sequence G1, that is, using 4 genes in the unused random gene sequence G0 to replace the corresponding position genes in the initial offspring gene sequence G1, using the unused random gene sequence G0 The i1, i2, i3, and i4th genes are used to replace the corresponding position genes of the initial offspring gene sequence G1. i1 takes [3,4,5,0,1,2], i2 takes [i1+1,5], and i3 Taking [i2+1,5] and taking [i3+1,5] for i4, the following ordered descendant candidate set belonging to the fourth gene replacement can be generated. Each of the ordered descendant candidate sets is checked in order. Whether the candidate gene sequence already exists on the blockchain, if not, mark the candidate gene sequence as existing (or mark as used) and return, and upload the marked candidate gene sequence to the blockchain. If If all exist, continue to the next step. Among them, the resulting ordered set of offspring candidates belonging to the fourth gene replacement is:

i1=3, i2=4, i3=5, i4 is the empty set {}.

i1=3, i2=5, i3 and i4 are both empty sets {}.

i1=4, i2=5, i3 and i4 are both empty sets {}.

i1=5, i2, i3, i4 are empty sets {}.

When i1=0, i2=1, i3=2, i4={3,4,5}, the candidate gene sequences formed after replacement are:

0010 1000 0110 0110 1101 0000

0010 1000 0110 0111 1010 0000

0010 1000 0110 0111 1101 1101

When i1=0, i2=1, i3=3, i4={4,5}, the candidate gene sequences formed after replacement are:

0010 1000 1111 0110 1010 0000

0010 1000 1111 0110 1101 1101

When i1=0, i2=1, i3=4, i4=5, the candidate gene sequences formed after replacement are:

0010 1000 1111 0111 1010 1101

When i1=0, i2=2, i3=3, i4={4,5}, the candidate gene sequences formed after replacement are:

0010 0001 0110 0110 1010 0000

0010 0001 0110 0110 1101 1101

When i1=0, i2=2, i3=4, i4=5, the candidate gene sequences formed after replacement are:

0010 0001 0110 0111 1010 1101

i1=0, i2=2, i3=5, i4 is the empty set {}.

When i1=0, i2=3, i3=4, i4=5, the candidate gene sequences formed after replacement are:

0010 0001 1111 0110 1010 1101

i1=0, i2=4, i3, i4 are empty sets {}.

When i1=1, i2=2, i3=3, i4={4,5}, the candidate gene sequences formed after replacement are:

1101 1000 0110 0110 1010 0000

1101 1000 0110 0110 1101 1101

When i1=1, i2=2, i3=4, i4=5, the candidate gene sequences formed after replacement are:

1101 1000 0110 0111 1010 1101

When i1=1, i2=3, i3=4, and i4=5, the candidate gene sequences formed after replacement are:

1101 1000 1111 0110 1010 1101

When i1=2, i2=3, i3=4, i4=5, the candidate gene sequences formed after replacement are:

1101 0001 0110 0110 1010 1101

For example, assuming that a candidate gene sequence 0010 0001 1111 0110 1010 1101 belonging to the ordered offspring candidate set of the fourth gene replacement does not exist on the blockchain, the candidate gene sequence 0010 0001 1111 0110 1010 1101 can be used as a new Fuhu digital assets have the genetic sequence.

If none of the above candidate gene sequences exist on the blockchain, the fifth gene replacement can be performed on the initial offspring gene sequence G1, that is, 5 genes are selected from the unused random gene sequence G0 as the initial offspring. The mutated gene of the generation gene sequence G1, that is, using 5 genes in the unused random gene sequence G0 to replace the corresponding position genes in the initial offspring gene sequence G1, using the unused random gene sequence G0 The i1, i2, i3, i4, and i5th genes are used to replace the corresponding position genes of the initial offspring gene sequence G1. i1 takes [3,4,5,0,1,2], and i2 takes [i1+1,5]. , i3 takes [i2+1,5], i4 takes [i3+1,5], and i5 takes [i4+1,5], the following ordered offspring candidate set belonging to the fifth gene replacement can be generated, Check in order whether each candidate gene sequence in the ordered descendant candidate set already exists on the blockchain. If it does not exist, mark the candidate gene sequence as existing (or marked as used) and return, and at the same time, mark the following The candidate gene sequences are uploaded to the blockchain, and if all exist, continue to the next step. Among them, the generated candidate set of ordered offspring belonging to the fifth gene replacement is:

i1=3, i2=4, i3=5, i4 and i5 are empty sets {}.

i1=4, i2=5, i3, i4, and i5 are all empty sets {}.

i1=5, i2, i3, i4, and i5 are all empty sets {}.

When i1=0, i2=1, i3=2, i4={3}, i5={4,5}, the candidate gene sequences formed after replacement are:

0010 1000 0110 0110 1010 0000

0010 1000 0110 0110 1101 1101

When i1=0, i2=1, i3=2, i4={4}, i5={5}, the candidate gene sequences formed after replacement are:

0010 1000 0110 0111 1010 1101

i1=0, i2=1, i3=2, i4={5}, i5 is the empty set {}.

When i1=0, i2=1, i3=3, i4={4}, i5={5}, the candidate gene sequences formed after replacement are:

0010 1000 1111 0110 1010 1101

When i1=0, i2=2, i3=3, i4={4}, i5={5}, the candidate gene sequences formed after replacement are:

0010 0001 0110 0110 1010 1101

When i1=1, i2=2, i3=3, i4={4}, i5={5}, the candidate gene sequences formed after replacement are:

1101 1000 0110 0110 1010 1101

i1=2, i2=3, i3=4, i4=5, i5 is the empty set {}.

For example, assuming that a candidate gene sequence 0010 1000 0110 0110 1101 1101 belonging to the ordered offspring candidate set of the fifth gene replacement does not exist on the blockchain, the candidate gene sequence 0010 1000 0110 0110 1101 1101 can be used as a new The genetic sequence of Fuhu digital assets. If each candidate gene sequence in the ordered descendant candidate set generated above for the fifth gene replacement does not exist on the blockchain, the unused random gene sequence G0=0010 1000 1100 0110 1010 1101 can be directly used as The gene sequence of the new Fuhu digital asset, because the unused random gene sequence does not exist on the blockchain, is used to generate the gene sequence of the new digital asset. The deterministic genetic algorithm terminates and the unused gene sequence is The used random gene sequence is marked as present (or marked as used) and uploaded to the blockchain. In this way, this solution can meet the requirement of generating the genetic sequence of a new digital asset within a certain search space, and can effectively ensure the uniqueness of the genetic sequence of the generated new digital asset.

The above embodiments show that the technical solution in the present invention generates the same unused random gene sequence for each blockchain node through the client, so that each blockchain node can perform genetic modification on the initial offspring gene sequence according to the same replacement method. Replacement can avoid the situation where the genetic sequence of the new digital assets generated by each blockchain node is inconsistent due to the different random numbers generated, and can effectively ensure the uniqueness of the genetic sequence of the new digital assets generated. Specifically, for any blockchain node, when the blockchain node detects a digital asset synthesis transaction, it can perform an XOR operation on the gene sequences of the k digital assets to be synthesized in the digital asset synthesis transaction, so as to This generates the initial progeny gene sequence. Then, when it is determined that the initial offspring gene sequence does not exist on the blockchain, the initial offspring gene sequence is used as the gene sequence of the new digital asset; when it is determined that the initial offspring gene sequence exists on the blockchain, the initial offspring gene sequence can be used as Based on the set gene replacement method, and based on the unused random gene sequence, the i-th gene replacement is performed on the initial offspring gene sequence to generate an ordered offspring candidate set belonging to the i-th gene replacement, which can effectively Determine whether a certain candidate gene sequence in the ordered descendant candidate set does not exist on the blockchain. If it is determined that each candidate gene sequence in the ordered offspring candidate set exists on the blockchain, then the i+1th gene replacement can be performed on the initial offspring gene sequence based on the unused random gene sequence until the initial After the n-1 gene replacement of the offspring gene sequence, the gene sequence of the new digital asset generated for the k digital assets to be synthesized can be determined. In this way, this scheme can generate the gene sequence of a new digital asset within a certain search space, and judge the candidate genes in the ordered descendant candidate set based on the ordered descendant candidate set generated by a certain gene replacement. Whether the sequence exists on the blockchain, this can effectively avoid the problem of conflicts between the currently generated gene sequence and the previously generated gene sequence, thus effectively ensuring that the user response time will not time out. In addition, because the client generates the same unused random gene sequence for each blockchain node, this solution enables each blockchain node to perform gene replacement for the initial offspring gene sequence according to the same replacement method, so it can effectively Ensure that the execution results of the genetic sequences of the new digital assets generated on different blockchain nodes are consistent. This can solve the problem of existing genetic algorithms caused by different random numbers generated by each blockchain node in the existing technology. Problems that cannot be applied to the blockchain.

Based on the same technical concept, Figure 3 exemplarily shows a blockchain-based digital asset synthesis device provided by an embodiment of the present invention. The device can execute the process of the blockchain-based digital asset synthesis method. Among them, the blockchain-based digital asset synthesis method in the embodiment of the present invention is suitable for a blockchain network with m blockchain nodes; the blockchain-based digital asset synthesis device may be a service device or may be a capable The components (such as chips or integrated circuits) that support the service device to implement the functions required by the method may of course also be other electronic devices with the functions required to implement the method. Among them, m is an integer greater than 1.

As shown in Figure 3, the device includes:

The generation unit 301 is used for any blockchain node, when a digital asset synthesis transaction is detected, to perform an XOR operation on the gene sequences of k digital assets to be synthesized in the digital asset synthesis transaction, and generate an initial sub- generation gene sequence; the digital asset synthesis transaction is determined by the client based on the gene sequences of k digital assets to be synthesized and an unused random gene sequence generated by the client; each digital asset to be synthesized Both the existing gene sequence and the unused random gene sequence include n genes;

The processing unit 302 is configured to, when it is determined that the initial offspring gene sequence exists on the blockchain, perform a genetic modification on the initial offspring gene sequence based on the unused random gene sequence according to the set gene replacement method. The i-th gene replacement generates an ordered set of offspring candidates belonging to the i-th gene replacement; the ordered set of offspring candidates belonging to the i-th gene replacement includes j candidate gene sequences; if the j candidates are determined If all gene sequences exist in the blockchain, then based on the unused random gene sequence, the i+1th gene replacement is performed on the initial offspring gene sequence until the initial offspring gene sequence is Until the n-1th gene replacement is performed, the gene sequence of the new digital asset generated for the k digital assets to be synthesized is determined.

Optionally, the processing unit 302 is specifically used to:

Select i genes from the unused random gene sequences as replacement genes for the initial offspring gene sequence;

The i genes in the unused random gene sequence are exchanged with the i genes at corresponding positions in the initial offspring gene sequence, thereby generating an ordered offspring candidate set belonging to the i-th gene replacement.

Optionally, the processing unit 302 is also used to:

If it is determined that any candidate gene sequence among the j candidate gene sequences does not exist in the blockchain, then the candidate gene sequence is determined to be the gene sequence possessed by the new digital asset.

Optionally, the processing unit 302 is also used to:

After the n-1th gene replacement is performed on the initial progeny gene sequence, if it is determined that the n-1th gene replacement generated on the initial progeny gene sequence belongs to the n-1th gene replacement. If the p candidate gene sequences included in the descendant candidate set all exist in the blockchain, then the unused random gene sequence is determined to be the gene sequence of the new digital asset.

Optionally, the processing unit 302 is specifically used to:

Based on the unused random gene sequence and the n, determine at least one gene position sequence number combination for gene replacement; each gene position sequence number combination includes at least one value set with an operation sequence;

According to the i genes in the unused random gene sequence, and through at least one gene position number combination, the i genes at the corresponding positions in the initial offspring gene sequence are replaced, thereby generating the i-th gene An ordered set of descendant candidates for replacement.

Optionally, the processing unit 302 is specifically used to:

If the value of i is 1, perform a remainder operation on the unused random gene sequence and n to determine the first value;

Based on the first numerical value and the n, determine n initial gene position numbers with operational order;

According to the order of operation of the n initial gene position numbers, the n initial gene position numbers and the n are sequentially subjected to a remainder operation, thereby determining n first gene position numbers with the order of operation; the n The first gene position numbers with the order of operations are used to form the first gene position number combination; the n first gene position numbers with the order of operations are used to assist gene replacement;

The processing unit 302 is specifically used to:

According to the order of operation of the n first gene position numbers included in the first gene position number combination, the genes corresponding to the n first gene position numbers in the initial offspring gene sequence are sequentially replaced with The n first gene position numbers correspond to genes in the unused random gene sequence, thereby generating an ordered set of offspring candidates belonging to the i-th gene replacement.

Optionally, the processing unit 302 is specifically used to:

If the value of i is greater than or equal to 2, based on the n first gene position numbers with operational order corresponding to the first gene replacement, determine other i-1 except the one gene corresponding to the first gene replacement. The q second gene position numbers corresponding to each gene have the order of operation;

According to the n first gene position numbers with operation order and the q second gene position numbers with operation order corresponding to the other i-1 genes, a plurality of second gene position numbers for gene replacement are determined. Gene position sequence number combination;

The processing unit 302 is specifically used to:

For each second gene position sequence number combination, if at least one value set in the second gene position sequence number combination is an empty set, gene replacement will not be performed for the initial offspring gene sequence;

If there is no value set in the second gene position sequence number combination and is an empty set, then the sequence corresponding to at least one gene position sequence number included in the second gene position sequence number combination in the initial offspring gene sequence is The gene is replaced with a gene corresponding to the position number of the at least one gene in the unused random gene sequence, thereby generating an ordered descendant candidate set belonging to the i-th gene replacement.

Optionally, the processing unit 302 is also used to:

After determining the gene sequence of the new digital asset generated for the k digital assets to be synthesized, the usage status of the gene sequence of the new digital asset is marked as used, and the gene sequence is marked as used. The genetic sequence of the new digital asset is uploaded to the blockchain for storage.

Based on the same technical concept, an embodiment of the present invention also provides a computing device, as shown in Figure 4, including at least one processor 401 and a memory 402 connected to the at least one processor. The processing is not limited in the embodiment of the present invention. The specific connection medium between the processor 401 and the memory 402 is as follows. In Figure 4, the processor 401 and the memory 402 are connected through a bus as an example. The bus can be divided into address bus, data bus, control bus, etc.

In this embodiment of the present invention, the memory 402 stores instructions that can be executed by at least one processor 401. By executing the instructions stored in the memory 402, at least one processor 401 can execute the aforementioned blockchain-based digital asset synthesis method. steps included.

Among them, the processor 401 is the control center of the computing device. It can use various interfaces and lines to connect various parts of the computing device, and implement data by running or executing instructions stored in the memory 402 and calling data stored in the memory 402. deal with. Optionally, the processor 401 may include one or more processing units. The processor 401 may integrate an application processor and a modem processor. The application processor mainly processes the operating system, user interface, application programs, etc., and the modem processor The debugging processor mainly handles issuing instructions. It can be understood that the above modem processor may not be integrated into the processor 401. In some embodiments, the processor 401 and the memory 402 can be implemented on the same chip, and in some embodiments, they can also be implemented on separate chips.

The processor 401 may be a general processor, such as a central processing unit (CPU), a digital signal processor, an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array or other programmable logic devices, discrete gates or transistors Logic devices and discrete hardware components can implement or execute the methods, steps and logical block diagrams disclosed in the embodiments of the present invention. A general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the method disclosed in conjunction with the embodiments of the blockchain-based digital asset synthesis method can be directly implemented by a hardware processor, or executed by a combination of hardware and software modules in the processor.

As a non-volatile computer-readable storage medium, the memory 402 can be used to store non-volatile software programs, non-volatile computer executable programs and modules. The memory 402 may include at least one type of storage medium, for example, may include flash memory, hard disk, multimedia card, card-type memory, random access memory (Random Access Memory, RAM), static random access memory (Static Random Access Memory, SRAM), Programmable Read Only Memory (PROM), Read Only Memory (ROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Magnetic Memory, Disk , CD, etc. Memory 402 is, but is not limited to, any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. The memory 402 in the embodiment of the present invention can also be a circuit or any other device capable of realizing a storage function, used to store program instructions and/or data.

Based on the same technical concept, embodiments of the present invention also provide a computer-readable storage medium that stores a computer program that can be executed by a computing device. When the program is run on the computing device, the computing device causes the computing device to Execute the steps of the blockchain-based digital asset synthesis method described above.

Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Thus, the invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.

The invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to the invention. It will be understood that each process and/or block in the flowchart illustrations and/or block diagrams, and combinations of processes and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing device to produce a machine, such that the instructions executed by the processor of the computer or other programmable data processing device produce a use A device for realizing the functions specified in one process or multiple processes of the flowchart and/or one block or multiple blocks of the block diagram.

These computer program instructions may also be stored in a computer-readable memory that causes a computer or other programmable data processing apparatus to operate in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction means, the instructions The device implements the functions specified in a process or processes of the flowchart and/or a block or blocks of the block diagram.

These computer program instructions may also be loaded onto a computer or other programmable data processing device, causing a series of operating steps to be performed on the computer or other programmable device to produce computer-implemented processing, thereby executing on the computer or other programmable device. Instructions provide steps for implementing the functions specified in a process or processes of a flowchart diagram and/or a block or blocks of a block diagram.

Although the preferred embodiments of the present invention have been described, those skilled in the art will be able to make additional changes and modifications to these embodiments once the basic inventive concepts are apparent. Therefore, it is intended that the appended claims be construed to include the preferred embodiments and all changes and modifications that fall within the scope of the invention.

Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the invention. In this way, if these modifications and variations of the present invention fall within the scope of the claims of this application and equivalent technologies, the present invention is also intended to include these modifications and variations.

Claims (11)

1. A blockchain-based digital asset synthesis method, characterized in that it is suitable for a blockchain network with m blockchain nodes, and the method includes:

   For any blockchain node, when the blockchain node detects a digital asset synthesis transaction, it performs an XOR operation on the gene sequences of the k digital assets to be synthesized in the digital asset synthesis transaction to generate an initial sub- generation gene sequence; the digital asset synthesis transaction is determined by the client based on the gene sequences of k digital assets to be synthesized and an unused random gene sequence generated by the client; each digital asset to be synthesized Both the existing gene sequence and the unused random gene sequence include n genes;

   When the blockchain node determines that the initial progeny gene sequence exists on the blockchain, it will perform the initial progeny gene sequence on the set gene replacement method based on the unused random gene sequence. The i-th gene replacement generates an ordered progeny candidate set belonging to the i-th gene replacement; the ordered progeny candidate set belonging to the i-th gene replacement includes j candidate gene sequences;

   If the blockchain node determines that the j candidate gene sequences all exist in the blockchain, then based on the unused random gene sequence, the i+1th process is performed on the initial offspring gene sequence. times of gene replacement until the n-1th gene replacement is performed on the initial offspring gene sequence, thereby determining the gene sequence of the new digital asset generated for the k digital assets to be synthesized.
2. The method according to claim 1, characterized in that, based on the unused random gene sequence, the i-th gene replacement is performed on the initial progeny gene sequence to generate an ordered gene belonging to the i-th gene replacement. The set of proxy candidates includes:

   The blockchain node selects i genes from the unused random gene sequences as replacement genes for the initial offspring gene sequence;

   The blockchain node exchanges the i genes in the unused random gene sequence with the i genes at the corresponding positions in the initial offspring gene sequence, thereby generating the i genes belonging to the i-th gene replacement. The set of sequential descendant candidates.
3. The method of claim 1, further comprising:

   If the blockchain node determines that any candidate gene sequence among the j candidate gene sequences does not exist in the blockchain, it will determine the candidate gene sequence as the gene sequence of the new digital asset.
4. The method according to claim 1, characterized in that, after performing the n-1th gene replacement on the initial progeny gene sequence, it further includes:

   If the blockchain node determines that the p candidate gene sequences included in the ordered offspring candidate set belonging to the n-1th gene replacement generated by performing the n-1th gene replacement on the initial offspring gene sequence are all exists in the blockchain, the unused random gene sequence is determined as the gene sequence of the new digital asset.
5. The method of claim 2, wherein the blockchain node compares i genes in the unused random gene sequence with i genes at corresponding positions in the initial offspring gene sequence. Interchange, thereby generating an ordered set of offspring candidates belonging to the i-th gene replacement, including:

   The blockchain node determines at least one gene position sequence number combination for gene replacement based on the unused random gene sequence and the n; each gene position sequence number combination includes at least one value with an operation sequence. gather;

   The blockchain node replaces the i genes at the corresponding positions in the initial offspring gene sequence based on the i genes in the unused random gene sequence and through at least one gene position number combination, thereby Generate an ordered set of offspring candidates belonging to the i-th gene replacement.
6. The method of claim 5, wherein the blockchain node determines at least one gene position sequence number combination for gene replacement based on the unused random gene sequence and n, including:

   If the value of i is 1, then the blockchain node performs a remainder operation on the unused random gene sequence and n to determine the first value;

   The blockchain node determines n initial gene position numbers with operational order based on the first value and n;

   The blockchain node performs a remainder operation on the n initial gene position numbers and n in sequence according to the order of operations of the n initial gene position numbers, thereby determining the n first gene positions in the order of operations. Serial number; the n first gene position serial numbers with operational order are used to form a first gene position serial number combination; the n first gene position serial numbers with operational order are used to assist gene replacement;

   The blockchain node replaces the i genes at the corresponding positions in the initial offspring gene sequence based on the i genes in the unused random gene sequence and through at least one gene position number combination, thereby Generate an ordered set of offspring candidates belonging to the i-th gene replacement, including:

   The blockchain node sequentially adds the n first gene position numbers in the initial offspring gene sequence according to the order of operation of the n first gene position numbers included in the first gene position number combination. The corresponding genes are replaced with genes corresponding to the n first gene position numbers in the unused random gene sequence, thereby generating an ordered descendant candidate set belonging to the i-th gene replacement.
7. The method of claim 6, wherein the blockchain node determines at least one gene position sequence number combination for gene replacement based on the unused random gene sequence and n, including:

   If the value of i is greater than or equal to 2, the blockchain node determines, based on the n first gene position numbers with operational order corresponding to the first gene replacement, except one gene corresponding to the first gene replacement. The other i-1 genes each correspond to the q second gene position numbers in the order of operation;

   The blockchain node determines a plurality of user genes based on the n first gene position numbers in the order of operations and the q second gene position numbers in the order of operations corresponding to the other i-1 genes. Second gene position sequence number combination based on gene replacement;

   The blockchain node replaces the i genes at the corresponding positions in the initial offspring gene sequence based on the i genes in the unused random gene sequence and through at least one gene position number combination, thereby Generate an ordered set of offspring candidates belonging to the i-th gene replacement, including:

   For each second gene position sequence number combination, if at least one value set in the second gene position sequence number combination is an empty set, the blockchain node does not perform gene replacement for the initial offspring gene sequence;

   If there is no value set in the second gene position sequence number combination that is an empty set, the blockchain node will sequentially add at least one value set included in the second gene position sequence number combination in the initial offspring gene sequence. The gene corresponding to the gene position number is replaced with the gene corresponding to at least one gene position number in the unused random gene sequence, thereby generating an ordered descendant candidate set belonging to the i-th gene replacement.
8. The method according to claim 1, characterized in that, after determining the gene sequence of the new digital asset generated for the k digital assets to be synthesized, it further includes:

   Mark the usage status of the gene sequence of the new digital asset as used, and upload the gene sequence of the new digital asset marked as used to the blockchain for storage.
9. A digital asset synthesis device based on blockchain, which is characterized in that it is suitable for a blockchain network with m blockchain nodes. The device includes:

   The generation unit is used for any blockchain node, when a digital asset synthesis transaction is detected, to perform an XOR operation on the gene sequences of the k digital assets to be synthesized in the digital asset synthesis transaction, and generate an initial offspring. Gene sequence; the digital asset synthesis transaction is determined by the client based on the gene sequences of k digital assets to be synthesized and an unused random gene sequence generated by the client; each digital asset to be synthesized has The gene sequence and the unused random gene sequence include n genes;

   A processing unit configured to perform a third process on the initial offspring gene sequence based on the unused random gene sequence according to the set gene replacement method when it is determined that the initial offspring gene sequence exists on the blockchain. The i-th gene replacement generates an ordered progeny candidate set belonging to the i-th gene replacement; the ordered progeny candidate set belonging to the i-th gene replacement includes j candidate gene sequences; if the j candidate genes are determined If the sequences all exist in the blockchain, then based on the unused random gene sequence, the i+1th gene replacement is performed on the initial offspring gene sequence until the initial offspring gene sequence is After the n-1th gene replacement, the gene sequence of the new digital asset generated for the k digital assets to be synthesized is determined.
10. A computing device, characterized by comprising at least one processor and at least one memory, wherein the memory stores a computer program, which when executed by the processor causes the processor to execute claim 1 The method described in any one of to 8.
11. A computer-readable storage medium, characterized in that it stores a computer program that can be executed by a computing device, and when the program is run on the computing device, the computing device executes any one of claims 1 to 8 the method described.

Images