A blockchain-based method and apparatus for digital asset synthesis

Abstract

Embodiments of the present application provide a kind of based on the digital asset synthesis method and device of blockchain, the method includes any blockchain node in detecting digital asset synthesis transaction, the gene sequence that k digital assets to be synthesized has is XOR operation, generates initial offspring gene sequence, when determining that initial offspring gene sequence exists on blockchain, based on the random gene sequence that is not used, the i th gene replacement is carried out to initial offspring gene sequence, generates the ordered offspring candidate set belonging to the i th gene replacement, if it is determined that j candidate gene sequences all exist in blockchain, the i+1 th gene replacement is carried out to initial offspring gene sequence, until after the n-1 th gene replacement is carried out to initial offspring gene sequence, so as to determine the gene sequence that new digital asset has.It is thus, the execution result that this scheme can effectively ensure that on different blockchain nodes for the gene sequence that new digital asset has is consistent.

Description

Technical Field

[0001] This invention relates to the field of financial technology (Fintech), and more particularly to a method and apparatus for synthesizing digital assets based on blockchain. Background Technology

[0002] With the development of computer technology, more and more technologies are being 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, higher demands are being placed on technology.

[0003] Digital assets are unique digital credentials generated using blockchain technology, corresponding to specific works of art. They protect digital copyrights and enable authentic and trustworthy digital issuance, purchase, collection, and use. Digital assets encompass a wide variety of forms, including but not limited to digital images, music, videos, 3D models, electronic tickets, and digital souvenirs. Therefore, to efficiently and promptly generate new digital assets of a particular type, one can synthesize one or two existing digital assets of that type from the blockchain. This synthesis of new digital assets requires the use of genetic algorithms.

[0004] However, existing genetic algorithms require the use of random numbers when generating new offspring populations. On the blockchain, since the execution results of each blockchain node need to be consistent, random numbers cannot be used (because each blockchain node is independent and generates different random numbers), which makes it impossible to apply existing genetic algorithms to the blockchain.

[0005] In summary, there is an urgent need for a blockchain-based digital asset synthesis method to effectively ensure that the execution results of the gene sequence of the newly generated digital asset are consistent across different blockchain nodes. This would solve the problem that existing genetic algorithms cannot be applied to blockchains due to the different random numbers generated by each blockchain node. Summary of the Invention

[0006] This invention provides a blockchain-based digital asset synthesis method and apparatus to effectively ensure that the execution results of the gene sequence of the newly generated digital asset are consistent across different blockchain nodes. This solves the problem that existing genetic algorithms cannot be applied to blockchains due to the different random numbers generated by each blockchain node.

[0007] In a first aspect, embodiments of the present invention provide a blockchain-based digital asset synthesis method, applicable to a blockchain network with m blockchain nodes, the method comprising:

[0008] For any blockchain node, when it 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 transaction to generate an initial offspring gene sequence. The digital asset synthesis transaction is determined by the client based on the gene sequences of the k digital assets to be synthesized and an unused random gene sequence generated by the client. Each gene sequence of the digital asset to be synthesized and the unused random gene sequence both include n genes.

[0009] When a blockchain node determines that the initial offspring gene sequence exists on the blockchain, it performs the i-th gene replacement on the initial offspring gene sequence based on the unused random gene sequence according to the set gene replacement method, generating an ordered offspring candidate set belonging to the i-th gene replacement; the ordered offspring candidate set belonging to the i-th gene replacement includes j candidate gene sequences.

[0010] If the blockchain node determines that all j candidate gene sequences exist in the blockchain, it performs the (i+1)th gene replacement on the initial offspring gene sequence based on the unused random gene sequence, until the initial offspring gene sequence is replaced for the (n-1)th time, thereby determining the gene sequence of the new digital asset generated for the k digital assets to be synthesized.

[0011] In the above technical solution, the present invention generates the same unused random gene sequence for each blockchain node through the client. This enables each blockchain node to perform gene replacement on the initial offspring gene sequence according to the same replacement method, thereby avoiding the situation where the gene sequences of the new digital assets generated by each blockchain node are inconsistent due to different generated random numbers, and effectively ensuring the uniqueness of the gene sequence of the generated new digital assets. Specifically, for any blockchain node, when it 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 to generate an initial offspring gene sequence. Then, if 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; if it is determined that the initial offspring gene sequence exists on the blockchain, it can perform the i-th gene replacement on the initial offspring gene sequence according to the set gene replacement method and based on the unused random gene sequence, generating an ordered offspring candidate set belonging to the i-th gene replacement. This can effectively determine whether there is a candidate gene sequence in the ordered offspring candidate set that does not exist on the blockchain. If it is determined that all candidate gene sequences in the ordered offspring candidate set exist on the blockchain, then based on unused random gene sequences, the initial offspring gene sequence can be replaced (i+1) times, until the initial offspring gene sequence is replaced (n-1) times. This allows the determination of the gene sequences of the new digital assets generated from k digital assets to be synthesized. Thus, this scheme effectively avoids conflicts between currently generated gene sequences and previously generated gene sequences because it can generate gene sequences for new digital assets within a defined search space. Furthermore, by determining whether the candidate gene sequences in the ordered offspring candidate set generated after a gene replacement exist on the blockchain, it effectively ensures that user response time does not exceed the limit. Furthermore, since this scheme generates the same unused random gene sequence for each blockchain node through the client, each blockchain node can perform gene replacement on the initial offspring gene sequence in the same way. Therefore, it can effectively ensure that the execution results of the gene sequence of the newly generated digital assets are consistent on different blockchain nodes. This can solve the problem that existing genetic algorithms cannot be applied to blockchains because the random numbers generated by each blockchain node are different.

[0012] Optionally, based on the unused random gene sequence, the initial progeny gene sequence is subjected to the i-th gene substitution to generate an ordered candidate set of progeny belonging to the i-th gene substitution, including:

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

[0014] The blockchain node swaps i genes from the unused random gene sequence with 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.

[0015] In the above technical solution, since the unused random gene sequence does not exist on the blockchain, by using genes at multiple positions in the unused random gene sequence to replace multiple genes at corresponding positions in the initial offspring gene sequence, the gene sequence that does not exist on the blockchain can be obtained to the greatest extent possible. That is, the gene sequence that the new digital asset has can be obtained. This can effectively ensure the uniqueness of the gene sequence of the generated new digital asset. At the same time, it can 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 its parent attributes is greater than that of random generation, so as to retain the scarce characteristics in the parent genes.

[0016] Optionally, it also includes:

[0017] If a blockchain node determines that any of the j candidate gene sequences does not exist in the blockchain, then the candidate gene sequence is identified as the gene sequence possessed by the new digital asset.

[0018] In the above technical solution, when it is determined that there is a candidate gene sequence in the ordered candidate set of offspring generated after replacement that does not exist on the blockchain, the candidate gene sequence can be used as the gene sequence of the new digital asset. This can effectively ensure the uniqueness of the gene sequence of the generated new digital asset, thereby effectively avoiding the possibility of conflict between offspring and achieving the purpose of generating the gene sequence of the new offspring by performing an XOR operation on the gene sequences of multiple parents.

[0019] Optionally, after performing the (n-1)th gene substitution on the initial progeny gene sequence, the method further includes:

[0020] If a blockchain node determines that all p candidate gene sequences included in the ordered candidate set of the (n-1)th gene replacement generated by the (n-1)th gene replacement for the initial offspring gene sequence exist in the blockchain, then the unused random gene sequence is determined as the gene sequence possessed by the new digital asset.

[0021] In the above technical solution, to avoid excessively long response times for user requests to generate gene sequences for new offspring, and to effectively ensure that the response time for user requests to generate gene sequences for new offspring does not exceed the timeout, the solution guarantees that gene sequences for new digital assets are generated within a defined search space. After performing the (n-1)th gene replacement on the initial offspring gene sequence, if no candidate gene sequence not existing on the blockchain is found, then an unused random gene sequence will be directly used as the gene sequence for the new digital asset, since the unused random gene sequence does not exist on the blockchain. This generates gene sequences for new digital assets, thereby effectively ensuring the uniqueness of the gene sequences for the generated new digital assets.

[0022] Optionally, the blockchain node swaps i genes from the unused random gene sequence with i genes at corresponding positions in the initial offspring gene sequence to generate an ordered offspring candidate set belonging to the i-th gene replacement, including:

[0023] The blockchain node determines at least one combination of gene position numbers for gene replacement based on the unused random gene sequence and n; each combination of gene position numbers includes at least one set of values ​​with an order of operation.

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

[0025] In the above technical solution, by using unused random gene sequences and the total number of genes n of the digital asset, corresponding calculations can be performed to generate at least one combination of gene position numbers for gene replacement. Thus, by using at least one combination of gene position numbers, multiple genes in the initial offspring gene sequence can be replaced with multiple genes at corresponding positions in the unused random gene sequence, thereby achieving effective replacement of the initial offspring gene sequence and providing support for the subsequent effective generation of gene sequences of new digital assets.

[0026] Optionally, the blockchain node determines at least one combination of gene position numbers for gene replacement based on the unused random gene sequence and n, including:

[0027] If the value of i is 1, the blockchain node will perform a modulo operation between the unused random gene sequence and n to determine the first value;

[0028] Based on the first value and n, the blockchain node determines n initial gene position numbers with an order of operation.

[0029] The blockchain node, according to the order of operations of the n initial gene position numbers, sequentially performs a modulo operation between the n initial gene position numbers and n, thereby determining n first gene position numbers with an operational order; the n first gene position numbers with an operational order are used to form a first gene position number combination; the n first gene position numbers with an operational order are used to assist gene replacement;

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

[0031] The blockchain node, according to the order of operations of the n first gene position numbers included in the first gene position number combination, sequentially replaces the genes corresponding to the n first gene position numbers in the initial offspring gene sequence with the genes corresponding to the n first gene position numbers in the unused random gene sequence, thereby generating an ordered offspring candidate set belonging to the i-th gene replacement.

[0032] In the above technical solution, when performing a gene replacement on the initial offspring gene sequence, an ordered sequence (i.e., the first value with a certain order of operation) can be generated by taking the remainder of an unused random gene sequence and n. Based on this ordered sequence, multiple candidate new offspring gene sequences with a certain degree of certainty can be generated. In this way, a unique new digital asset gene sequence can be determined from multiple candidate new offspring gene sequences with the highest probability. This allows each blockchain node to generate the same gene sequence and to judge in the same order whether there is a candidate new offspring gene sequence that does not exist on the blockchain.

[0033] Optionally, the blockchain node determines at least one combination of gene position numbers for gene replacement based on the unused random gene sequence and n, including:

[0034] If the value of i is greater than or equal to 2, the blockchain node determines the q second gene position numbers corresponding to each of the other i-1 genes (excluding the gene corresponding to the first gene replacement) based on the n first gene position numbers with the order of operation corresponding to the first gene replacement.

[0035] The blockchain node determines multiple combinations of second gene position numbers for gene replacement based on the n first gene position numbers with an order of operation and the q second gene position numbers with an order of operation corresponding to each of the i-1 genes.

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

[0037] For each combination of second gene position numbers, if at least one set of values ​​in the combination of second gene position numbers is an empty set, then the blockchain node does not perform gene replacement on the initial offspring gene sequence.

[0038] If none of the value sets in the second gene position sequence combination is empty, the blockchain node will sequentially replace the gene corresponding to at least one gene position sequence in the second gene position sequence combination in the initial offspring gene sequence with the gene corresponding to at least one gene position sequence in the unused random gene sequence, thereby generating an ordered offspring candidate set belonging to the i-th gene replacement.

[0039] In the above technical solution, when multiple gene replacements are performed on the initial offspring gene sequence, more candidate new offspring gene sequences are likely to be generated. This increases the number of gene sequences that the new offspring may have, and the more choices available. Therefore, it is highly likely that a unique gene sequence of a new digital asset can be determined from the more candidate new offspring gene sequences. This greatly increases the likelihood of generating a gene sequence of a new digital asset within a defined search space. As a result, each blockchain node can traverse all possible offspring and ensure that the traversal order of each blockchain node is consistent, thereby effectively ensuring that the gene sequences of the synthesized offspring are also consistent.

[0040] Optionally, after determining the genetic sequence of the new digital asset generated from the k digital assets to be synthesized, the method further includes:

[0041] 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 to the blockchain for storage.

[0042] In the above technical solution, in order to effectively avoid the possibility of conflicts between the subsequently generated offspring and the previously generated offspring, and in order to effectively ensure the uniqueness of the gene sequence of the newly generated digital asset, after the gene sequence of the new digital asset is generated, 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 to the blockchain, so that after the gene sequence of the new offspring is generated, the blockchain can be used to determine in a timely and accurate manner whether the gene sequence of the newly generated offspring exists on the blockchain.

[0043] Secondly, embodiments of the present invention also provide a blockchain-based digital asset synthesis device, suitable for a blockchain network with m blockchain nodes, the device comprising:

[0044] A generation unit is used to, for any blockchain node, upon detecting a digital asset synthesis transaction, perform 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 offspring gene sequence; the digital asset synthesis transaction is determined by the client based on the gene sequences of the k digital assets to be synthesized and an unused random gene sequence generated by the client; each gene sequence of the digital asset to be synthesized and the unused random gene sequence both include n genes;

[0045] The processing unit is configured to, upon determining that the initial offspring gene sequence exists on the blockchain, perform the i-th gene replacement on the initial offspring gene sequence based on the unused random gene sequence according to a set gene replacement method, generating an ordered offspring candidate set belonging to the i-th gene replacement; the ordered offspring candidate set belonging to the i-th gene replacement includes j candidate gene sequences; if it is determined that all j candidate gene sequences exist in the blockchain, then, based on the unused random gene sequence, perform the (i+1)-th gene replacement on the initial offspring gene sequence, until the initial offspring gene sequence has undergone the (n-1)-th gene replacement, thereby determining the gene sequence of the new digital asset generated for the k digital assets to be synthesized.

[0046] Optionally, the processing unit is specifically used for:

[0047] Select i genes from the unused random gene sequences as replacement genes for the initial offspring gene sequences;

[0048] The i genes in the unused random gene sequence are swapped with the i genes at the corresponding positions in the initial progeny gene sequence to generate an ordered progeny candidate set belonging to the i-th gene replacement.

[0049] Optionally, the processing unit is further configured to:

[0050] If it is determined that any of the j candidate gene sequences does not exist in the blockchain, then the candidate gene sequence is identified as the gene sequence possessed by the new digital asset.

[0051] Optionally, the processing unit is further configured to:

[0052] After performing the (n-1)th gene replacement on the initial progeny gene sequence, if it is determined that all p candidate gene sequences included in the ordered progeny candidate set generated by the (n-1)th gene replacement on the initial progeny gene sequence exist in the blockchain, then the unused random gene sequence is determined as the gene sequence possessed by the new digital asset.

[0053] Optionally, the processing unit is specifically used for:

[0054] Based on the unused random gene sequence and n, at least one combination of gene position numbers for gene replacement is determined; each combination of gene position numbers includes at least one set of values ​​with an order of operation.

[0055] Based on the i genes in the unused random gene sequence, and by combining at least one gene position number, the i genes at the corresponding positions in the initial offspring gene sequence are replaced, thereby generating an ordered offspring candidate set belonging to the i-th gene replacement.

[0056] Optionally, the processing unit is specifically used for:

[0057] If the value of i is 1, then the unused random gene sequence is moduloed by n to determine the first value;

[0058] Based on the first value and n, n initial gene position numbers with an order of operation are determined;

[0059] According to the order of operations of the n initial gene position numbers, the n initial gene position numbers are sequentially moduloed with n to determine the n first gene position numbers with the order of operations; the n 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.

[0060] The processing unit is specifically used for:

[0061] 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 replaced in turn with the genes corresponding to the n first gene position numbers in the unused random gene sequence, thereby generating an ordered offspring candidate set belonging to the i-th gene replacement.

[0062] Optionally, the processing unit is specifically used for:

[0063] If the value of i is greater than or equal to 2, based on the n first gene position numbers corresponding to the first gene replacement with the order of operation, determine the q second gene position numbers corresponding to each of the other i-1 genes besides the one gene corresponding to the first gene replacement with the order of operation.

[0064] Based on the n first gene position numbers with an operational order and the q second gene position numbers with an operational order corresponding to each of the other i-1 genes, multiple combinations of second gene position numbers for gene replacement are determined.

[0065] The processing unit is specifically used for:

[0066] For each combination of second gene position numbers, if at least one set of values ​​in the combination of second gene position numbers is an empty set, then no gene replacement is performed on the initial offspring gene sequence.

[0067] If none of the value sets in the second gene position sequence combination is empty, then the gene corresponding to at least one gene position sequence included in the second gene position sequence combination in the initial offspring gene sequence is replaced with the gene corresponding to at least one gene position sequence in the unused random gene sequence, thereby generating an ordered offspring candidate set belonging to the i-th gene replacement.

[0068] Optionally, the processing unit is further configured to:

[0069] 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 of the new digital asset marked as used is uploaded to the blockchain for storage.

[0070] Thirdly, 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 processor performs any of the blockchain-based digital asset synthesis methods described in the first aspect.

[0071] Fourthly, embodiments of the present invention provide a computer-readable storage medium storing a computer program executable by a computing device, wherein when the program is run on the computing device, the computing device performs any of the blockchain-based digital asset synthesis methods described in the first aspect. Attached Figure Description

[0072] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0073] Figure 1 A possible system architecture diagram provided for an embodiment of the present invention;

[0074] Figure 2 A schematic flowchart of a blockchain-based digital asset synthesis method provided in an embodiment of the present invention;

[0075] Figure 3 A schematic diagram of a blockchain-based digital asset synthesis device provided in an embodiment of the present invention;

[0076] Figure 4 This is a schematic diagram of the structure of a computing device provided in an embodiment of the present invention. Detailed Implementation

[0077] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings. Obviously, the described embodiments are merely some embodiments of this invention, and not all embodiments. Based on the embodiments of this invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this invention.

[0078] The following explanations will first clarify some of the terms used in the embodiments of the present invention to facilitate understanding by those skilled in the art.

[0079] (1) Blockchain: Blockchain is a distributed storage system maintained and trusted by multiple nodes. The underlying structure of a blockchain is a chain of blocks. Each block records not only its own data but also the hash value of the previous block, forming a chain-like data structure. A block consists of a header and a body. The header defines important fields such as the block height and the hash value of the previous block, while the body primarily stores transaction data. Blockchain uses cryptography to ensure the security of data transmission and access, and utilizes a chain structure to ensure that the data on the chain cannot be tampered with.

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

[0081] (3) Smart contract: A smart contract is a collection of code and data that runs on a blockchain system. The code is responsible for implementing the functions of the smart contract, and the data is responsible for storing the state of the smart contract. The smart contract can receive and send information.

[0082] (4) Transactions: In a blockchain, any operation (deploying a contract, calling a contract interface, etc.) is performed by sending a transaction. A transaction is initiated by the user and sent to the blockchain node through the client. After receiving the transaction, the blockchain node packages it into a block and executes it.

[0083] (5) Digital assets: Non-fungible assets with unique identifiers on the blockchain.

[0084] (6) Genetic Algorithm (GA): It is a computational model that simulates the biological evolution process of natural selection and genetic mechanism in Darwin's theory of biological evolution. It is a method to search for the optimal solution by simulating the natural evolution process.

[0085] The above describes some of the terms used in the embodiments of the present invention. The technical features involved in the embodiments of the present invention will be described below.

[0086] To facilitate understanding of the embodiments of the present invention, firstly... Figure 1 The example shown illustrates a possible system architecture for a blockchain-based digital asset synthesis system applicable to embodiments of the present invention. Figure 1 As shown, the system architecture may include a client 100 and a blockchain network 200. The blockchain network 200 may include at least one blockchain node, such as blockchain node 201, blockchain node 202, blockchain node 203, and blockchain node 204, etc., and any two of these blockchain nodes can communicate with each other. The client 100 can communicate with any blockchain node in the blockchain network 200 via a wired connection or via a wireless connection; this embodiment of the invention does not limit this.

[0087] For example, when a client needs to synthesize a new digital asset from multiple parent digital assets, an unused random gene sequence is generated. This unused random gene sequence and each parent digital asset have the same number of genes. Based on the unused random gene sequence and multiple parent digital assets, a digital asset synthesis transaction is generated. This transaction is then submitted to any blockchain node in the blockchain network 200 (e.g., blockchain node 201), or it can be submitted to any node in the blockchain network 200. Taking the submission of the digital asset synthesis transaction by any blockchain node in the blockchain network 200 (e.g., node blockchain 201) as an example, after receiving the transaction, blockchain node 201 will synchronize it with other blockchain nodes in the blockchain network 200. Each blockchain node will store the transaction in its own transaction pool. Then, the block-producing node packages the digital asset synthesis transaction into a block and initiates a consensus process for that block, such as using a Byzantine fault-tolerant algorithm or a proof-of-work consensus algorithm. After successful consensus on the block, it is uploaded to the blockchain. Each blockchain node executes the digital asset synthesis transaction in the block according to the same execution rules. The execution results of each blockchain node are then judged to be consistent, or the number of nodes reaching consensus meets a first set threshold (e.g., two-thirds of the blockchain nodes achieve consistent results). The execution result is then accepted. Finally, a gene sequence is confirmed as a gene sequence possessed by the new digital asset, and its usage status is marked as used. This used gene sequence is then uploaded to the blockchain.

[0088] It should be noted that the above Figure 1 The system architecture shown is merely an example, and the embodiments of the present invention are not limited thereto.

[0089] Based on the above description Figure 2 An exemplary embodiment of the present invention illustrates a process for a blockchain-based digital asset synthesis method, which can be executed by a blockchain-based digital asset synthesis device. The blockchain-based digital asset synthesis method in this embodiment is applicable to a blockchain network with m blockchain nodes. The blockchain-based digital asset synthesis device can be a service device or a component (such as a chip or integrated circuit) capable of supporting the service device in implementing the method, or other electronic devices with the functions required to implement the method. Here, m is an integer greater than 1.

[0090] like Figure 2 As shown, the process specifically includes:

[0091] 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 to generate an initial offspring gene sequence.

[0092] In this embodiment of the 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 and the unused random gene sequence both include n genes. Here, k is an integer greater than or equal to 1; n is an integer greater than or equal to 1.

[0093] When a user within the blockchain network needs to synthesize a new digital asset, that user generates an unused random gene sequence based on the genetic attributes of the digital asset using a client installed on a terminal device (such as a smartphone, tablet, laptop, or desktop computer). The number of genes in this unused random gene sequence is the same as the number of genes in the digital asset. This unused random gene sequence, generated by the client, ensures that, given the existence of initial offspring gene sequences generated by XOR operations on the blockchain, each blockchain node can generate the gene sequence of the new digital asset as likely as possible based on this unused random gene sequence. This avoids the inability to use random numbers on the blockchain and ensures that the execution results of synthesizing the new digital asset across different blockchain nodes are largely 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 transaction to any blockchain node in the blockchain network, or submits it to each blockchain node individually. Alternatively, the user can generate a digital asset synthesis request on a client device using an unused random gene sequence and the gene sequences of k digital assets to be synthesized. This request can then be sent as a transaction to any blockchain node in the blockchain network, or sent separately to each blockchain node. Upon receiving the digital asset synthesis transaction, any blockchain node can process it accordingly. For example, it can perform an XOR operation on the gene sequences of the k digital assets to be synthesized to generate initial offspring gene sequences. Alternatively, it can store the transaction in its local transaction pool. Then, a blockchain node is designated as the block-producing node (i.e., the master node). This node packages the digital asset synthesis transactions from its local transaction pool into a block and sends it to other blockchain nodes for consensus. Once consensus is successful, the block is added to the blockchain. In other words, during the consensus process for this block, each blockchain node will execute the block, which means executing the digital asset synthesis transaction in the block. For example, it will 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.

[0094] For example, taking the Fuhu digital asset as an example, each digital asset is unique on the blockchain and has its own unique number. Therefore, the unique number of the Fuhu digital asset can be used as the representation of the Fuhu digital asset's genetic sequence. Assuming that Fuhu has 6 attributes, each attribute has 16 possibilities, and a 32-bit positive integer is used to represent the unique number of each Fuhu, then 24 bits can be used as the 6 attributes of the tiger, as shown in Table 1, with each 4 bits representing one attribute.

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

[0096] When multiple "Lucky Tigers" need to be combined to create a new "Lucky Tiger," an algorithm is needed to generate a new, uniquely identified "Lucky Tiger" so that the new Tiger inherits some attributes from the original Tigers used in the combination. Since smart contracts cannot use random numbers, and to ensure user response times do not exceed limits, this combination algorithm also needs a defined search space and consistent results across different machines (or nodes). Therefore, a deterministic genetic algorithm can be used to generate an ordered set of offspring candidates, and the offspring in this set can be iterated through one by one until an offspring not found on the blockchain is identified.

[0097] Furthermore, assuming that the attributes of each digital asset are determined by N genes, and each gene has K possibilities, a new digital asset is synthesized using M parent digital assets. The probability of the synthesized digital asset inheriting the attributes of its parents must be greater than that of random generation. For example, using M = 3 Lucky Tigers to synthesize a new Lucky Tiger, each Lucky Tiger has N = 6 attributes, and each attribute has K = 16 possibilities. The unique identifier of a Lucky Tiger is composed of its 6 attributes. New synthesized Lucky Tigers can be generated by searching in the following manner. For example, the input consists of the gene sequences x1, x2, ..., xM of M parent digital assets and an unused random gene sequence G0. In this example, there are M = 3 parent tigers with the following attributes: x1 = 0001 0101 0110 0110 10110011, x2 = 0100 1110 1101 0011 1000 1000, and x3 = 1000 1010 0100 0010 1110 1011. The input unused random gene sequence G0 = 0010 1000 1100 0110 1010 1101. The output is the gene sequence of the new digital asset, such as the gene sequence of the new Lucky Tiger digital asset. Taking M=3 Lucky Tigers as an example, a user generates a digital asset synthesis transaction using a client installed on their terminal device, involving the 3 Lucky Tiger digital assets and an unused random gene sequence G0. This transaction is then submitted to any blockchain node. After synchronization, each node packages the transaction into a block and initiates a consensus process. Each node executes the digital asset synthesis transaction within the block, performing an XOR operation on the gene sequences of the 3 Lucky Tigers to generate gene sequence G1. If G1 does not exist on the blockchain, it represents the gene sequence of the newly synthesized offspring Lucky Tiger, and the deterministic genetic algorithm terminates. Here, XOR is chosen as the gene synthesis algorithm. XOR is essentially addition without carry, maximizing the acquisition of gene sequences related to all parents while preserving the rare characteristics of parent genes. Therefore, XORing the gene sequences of the 3 Lucky Tiger digital assets yields the initial offspring gene sequence.

[0098] Step 202: When the blockchain node determines that the initial offspring gene sequence exists on the blockchain, it performs the i-th gene replacement on the initial offspring gene sequence based on the unused random gene sequence according to the set gene replacement method, and generates an ordered offspring candidate set belonging to the i-th gene replacement.

[0099] Step 203: If the blockchain node determines that all j candidate gene sequences exist in the blockchain, it performs the (i+1)th gene replacement on the initial offspring gene sequence based on the unused random gene sequence, until the initial offspring gene sequence is replaced for the (n-1)th time, thereby determining the gene sequence of the new digital asset generated for the k digital assets to be synthesized.

[0100] In this embodiment of the invention, since unused random gene sequences do not exist on the blockchain, by replacing multiple genes at corresponding positions in the initial offspring gene sequence with genes at multiple positions in the unused random gene sequence, a gene sequence not existing on the blockchain can be obtained to the greatest extent possible. This means a gene sequence possessed by the new digital asset can be obtained, effectively ensuring the uniqueness of the gene sequence of the generated new digital asset. Simultaneously, the synthesized new digital asset can inherit parental attributes to the greatest extent possible, preserving the scarce characteristics of the parent genes. Specifically, for each blockchain node, after performing an XOR operation on the gene sequences of k digital assets to be synthesized, an initial offspring gene sequence is generated. Upon determining that the initial offspring gene sequence exists on the blockchain, at least one gene in the initial offspring gene sequence can be replaced accordingly. If the blockchain node determines that the initial offspring gene sequence does not exist on the blockchain, it can directly use the initial offspring gene sequence as the gene sequence of the new digital asset generated from the k digital assets to be synthesized. In other words, the blockchain node selects *i* genes from unused random gene sequences as replacement genes for the initial offspring gene sequence, and swaps the *i* genes from the unused random gene sequence with the corresponding *i* genes from the initial offspring gene sequence, thus generating the *i*th gene replacement. The ordered offspring candidate set for 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, then that candidate gene sequence can be identified as the gene sequence possessed by the new digital asset. If the blockchain node determines that all *j* candidate gene sequences exist in the blockchain, then the initial offspring gene sequence needs to undergo the (*i+1*th)th gene replacement based on the unused random gene sequences. Here, *i* is an integer greater than or equal to 1; *j* is an integer greater than or equal to 1.

[0101] The blockchain node, based on the unused random gene sequence and the total number of genes *n* in the digital asset, performs corresponding calculations to generate at least one combination of gene position numbers for gene replacement. This allows multiple genes in the initial offspring gene sequence to be replaced with corresponding genes from the unused random gene sequence using at least one combination of gene position numbers, thus achieving effective replacement of the initial offspring gene sequence and supporting the subsequent generation of gene sequences for new digital assets. Specifically, the blockchain node determines at least one combination of gene position numbers for gene replacement based on the unused random gene sequence and *n*, where each combination includes at least one set of values ​​with a specific order of operations. Then, based on *i* genes from the unused random gene sequence and using at least one combination of gene position numbers, *i* genes at corresponding positions in the initial offspring gene sequence are replaced, generating an ordered candidate set of offspring for the *i*th gene replacement. Specifically, when performing a gene replacement on the initial offspring gene sequence, an ordered sequence (i.e., a first value with a certain order of operations) can be generated by taking the remainder of an unused random gene sequence with n. Based on this ordered sequence, multiple candidate new offspring gene sequences with a certain degree of certainty can be generated. In this way, a unique gene sequence of a new digital asset can be determined from multiple candidate new offspring gene sequences, thus enabling each blockchain node to generate the same gene sequence. For example, if the value of i is 1, the blockchain node can take the remainder of an unused random gene sequence with n to determine the first value. Based on the first value and n, n initial gene position indices with a certain order of operations can be determined. Then, according to the order of operations of the n initial gene position indices, the remainder of each of the n initial gene position indices with n is taken sequentially to determine the n first gene position indices with a certain order of operations. Here, the n first gene position indices with an operational order are used to form the first gene position index combination; these n first gene position indices with an operational order are used to assist gene replacement. Finally, according to the operational order of the n first gene position indices included in the first gene position index combination, the genes corresponding to these n first gene position indices in the initial offspring gene sequence are replaced sequentially with the genes corresponding to these n first gene position indices in an unused random gene sequence, thereby generating an ordered offspring candidate set belonging to the i-th gene replacement. Here, n is an integer greater than or equal to 1.

[0102] Furthermore, when performing multiple gene replacements on the initial offspring gene sequence, it is highly likely to generate more candidate new offspring gene sequences. This increases the number of possible gene sequences that the new offspring may possess, thus increasing the choices available. Therefore, it is highly likely that a unique gene sequence possessed by a new digital asset can be identified from these candidate new offspring gene sequences. This significantly increases the likelihood of generating a gene sequence possessed by a new digital asset within a defined search space. Consequently, each blockchain node can traverse all possible offspring, ensuring that the traversal order of each blockchain node is consistent. For example, if the value of i is greater than or equal to 2, the blockchain node, based on the n first gene position indices with operational order corresponding to the first gene replacement, can determine the q second gene position indices with operational order corresponding to each of the i-1 genes other than the one corresponding to the first gene replacement. Then, based on the n first gene position indices with operational order and the q second gene position indices with operational order corresponding to each of the other i-1 genes, multiple combinations of second gene position indices used for gene replacement can be determined. Then, for each combination of second gene position indices, if at least one set of values ​​in the combination is empty, gene replacement is not required for the initial offspring gene sequence. If no set of values ​​in the combination is empty, then the gene corresponding to at least one gene position indice included in the combination of second gene position in the initial offspring gene sequence can be replaced sequentially with the gene corresponding to at least one gene position indice from an unused random gene sequence. This generates an ordered candidate set of offspring belonging to the i-th gene replacement. Here, q is an integer greater than or equal to 1.

[0103] Furthermore, it should be noted that, in order to avoid excessively long response times for user requests to generate gene sequences for new offspring, and to effectively ensure that the response time for user requests to generate gene sequences for new offspring does not exceed the time limit, it is guaranteed that gene sequences for new digital assets are generated within a defined search space. Therefore, after performing the (n-1)th gene replacement on the initial offspring gene sequence, if it is determined that all p candidate gene sequences included in the ordered offspring candidate set generated by the (n-1)th gene replacement exist in the blockchain, then the unused random gene sequence can be identified as the gene sequence for the new digital asset, thereby effectively ensuring the uniqueness of the gene sequence for the generated new digital asset. Furthermore, to effectively avoid potential conflicts between subsequently generated offspring and previously generated offspring, and to effectively ensure the uniqueness of the genetic sequences of the newly generated digital assets, after determining the genetic sequences of the new digital assets generated from k digital assets to be synthesized, the usage status of the genetic sequences of the new digital assets is marked as used, and the genetic sequences of the new digital assets marked as used are uploaded to the blockchain for storage. This allows for timely and accurate verification of the existence of the genetic sequence of the newly generated offspring on the blockchain after its generation. Here, p is an integer greater than or equal to 1.

[0104] For example, assuming an unused random gene sequence is G0, and assuming the initial offspring gene sequence G1 exists on the blockchain, a gene replacement can be performed on the initial offspring gene sequence G1. This involves selecting one gene from the unused random gene sequence G0 as the mutant gene of the initial offspring gene sequence G1, replacing the i1th gene in the initial offspring gene sequence G1 with the i1th gene from the unused random gene sequence G0, where i1 takes values ​​from {1, I+1, ..., I+N-1}%N, where I = G0%N, and there are a total of... This process generates an ordered candidate set of offspring for the first gene replacement. The sequence is traversed according to the values ​​of i1, checking if each candidate gene sequence in the ordered candidate set exists on the blockchain. If it doesn't exist, it represents the gene sequence possessed by the newly synthesized offspring digital asset, and the deterministic genetic algorithm terminates. Since smart contracts cannot generate uncertain random numbers, I = G0%N is used to generate an ordered sequence starting from I. Based on this ordered sequence, when N is 6, a deterministic sequence can be generated. A new offspring gene sequence is generated, enabling each blockchain node to produce the same gene sequence and check its availability in the same order. For example, continuing with the example of synthesizing a new lucky tiger from the three lucky tigers mentioned above, assuming the unused random gene sequence G0 = 0010 1000 1100 0110 1010 1101, and assuming the initial offspring gene sequence G1 = 1101 0001 1111 0111 1101 0000 exists on the blockchain, then we can calculate I = G0 % N = 0010 10001100 0110 1010 Since 1101%6 = 3, the value set of i1 is {3,4,5,0,1,2}. The i1th gene of G0 is used to replace the corresponding gene at position G1, with i1 taking the values ​​{3,4,5,0,1,2}. This generates the following ordered progeny candidate set for the first gene replacement. Each candidate gene sequence in the ordered progeny candidate set is checked sequentially to see if it already exists on the blockchain. If it does not exist, the candidate gene sequence is marked as existing (or marked as used) and returned. Simultaneously, the marked candidate gene sequence is uploaded to the blockchain. If all sequences exist, the next step continues. The generated ordered progeny candidate set for the first gene replacement is as follows: 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

[0111] For example, if a candidate gene sequence 11010001 1111 0111 1010 0000 in the ordered offspring candidate set belonging to the first gene replacement does not exist on the blockchain, then the candidate gene sequence 1101 0001 11110111 1010 0000 can be regarded as the gene sequence possessed by the Xinfuhu digital asset.

[0112] If none of the above candidate gene sequences exist on the blockchain, a second gene replacement can be performed on the initial progeny gene sequence G1. That is, two genes are selected from the unused random gene sequence G0 as mutant genes for the initial progeny gene sequence G1. The i1th and i2th genes in the initial progeny gene sequence G1 are replaced with the i1th and i2th genes from the unused random gene sequence G0, where i1 takes values ​​from {i, i+1, ..., i+N-1} % N, i = G0 % N, and i2 ∈ {i1+1, ..., N-1}, for a total of... This process generates an ordered candidate set of offspring for the second gene replacement. The algorithm iterates through the data in the order of i1 and i2, checking if each candidate gene sequence in the ordered candidate set exists on the blockchain. If it doesn't exist, it represents the gene sequence of the newly synthesized offspring digital asset, and the deterministic genetic algorithm terminates. This method requires each blockchain node to traverse all achievable offspring, ensuring a consistent traversal order for each node, thus guaranteeing that the synthesized offspring digital assets have the same gene sequence. For example, continuing with the example of synthesizing a new lucky tiger from three lucky tigers, assuming the unused random gene sequence G0 = 0010 1000 1100 0110 1010 1101, and assuming the initial offspring gene sequence G1 = 1101 0001 11110111 1101 0000 exists on the blockchain, then we can calculate I = G0%N = 0010 1000 1100 0110 10101101%6 = 3, so the value set of i1 is {3,4,5,0,1,2}, and i2 takes the value [i1+1,N-1]. Two genes from the unused random gene sequence G0 are used to replace the two genes at corresponding positions in the initial offspring gene sequence G1. Similarly, the i1th and i2th genes from the unused random gene sequence G0 are used to replace the two genes at corresponding positions in the initial offspring gene sequence G1. This generates the following ordered offspring candidate set. Each candidate gene sequence in the ordered offspring candidate set is checked sequentially to see if it already exists on the blockchain. If it does not exist, the candidate gene sequence is marked as existing (or marked as used) and returned. Simultaneously, the marked candidate gene sequence is uploaded to the blockchain. If all sequences exist, the next step continues. The generated ordered offspring candidate set belonging to the second gene replacement is as follows:

[0113] When i1 = 3 and the value set of i2 is {4, 5}, the candidate gene sequences formed after the substitution are: 1101 0001 1111 0110 1010 0000 1101 0001 1111 0110 1101 1101

[0116] When i1 = 4 and the value set of i2 is {5}, the candidate gene sequences formed after the substitution are: 1101 0001 1111 0111 1010 1101

[0118] If i1 = 5, the set of values ​​for i2 is an empty set {}, so there are no possible values.

[0119] When i1 = 0 and the value set of i2 is {1, 2, 3, 4, 5}, the candidate gene sequences formed after the substitution 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

[0125] When i1 = 1 and the value set of i2 is {2, 3, 4, 5}, the candidate gene sequences formed after the substitution 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

[0130] When i1 = 2 and the value set of i2 is {3, 4, 5}, the candidate gene sequences formed after the substitution are: 1101 0001 0110 0110 1101 0000 1101 0001 0110 0111 1010 0000 1101 0001 0110 0111 1101 1101

[0134] For example, assuming that a candidate gene sequence 11011000 1111 0110 1101 0000 in the ordered offspring candidate set belonging to the second gene replacement does not exist on the blockchain, then the candidate gene sequence 1101 1000 11110110 1101 0000 can be regarded as the gene sequence possessed by the Xinfuhu digital asset.

[0135] If none of the above candidate gene sequences exist on the blockchain, a third gene replacement can be performed on the initial progeny gene sequence G1. That is, the above operation is repeated until N-1 genes are selected from the unused random gene sequence G0 as the mutant genes of the initial progeny gene sequence G1. The i1, i2, ..., i(N-1) genes in the initial progeny gene sequence G1 are replaced by the i1, i2, ..., i(N-1) genes of the unused random gene sequence G0. Here, i1 takes the values ​​of {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}, and there are a total of One possibility is that this generates an ordered candidate set of offspring belonging to the third gene replacement. The algorithm iterates through the sequence of i1 values ​​to check if each candidate gene sequence in the ordered candidate set exists on the blockchain. If it doesn't exist, it represents the gene sequence of the newly synthesized offspring digital asset, and the deterministic genetic algorithm terminates. For example, three genes from an unused random gene sequence G0 replace the corresponding genes in the initial offspring gene sequence G1. Genes i1, i2, and i3 replace the corresponding genes in G1, where i1 is [3,4,5,0,1,2], i2 is [i1+1,5], and i3 is [i2+1,5]. This generates the following ordered candidate set of offspring. Each candidate gene sequence in the ordered candidate set is checked sequentially to see if it already exists on the blockchain. If it doesn't exist, the candidate gene sequence is marked as existing (or marked as used) and returned. Simultaneously, the marked candidate gene sequence is uploaded to the blockchain. If all sequences exist, the next step continues. The generated ordered candidate set of offspring belonging to the third gene replacement is as follows:

[0136] When i1 = 3, i2 = 4, and i3 = 5, the candidate gene sequences formed after the substitution are: 1101 0001 1111 0110 1010 1101

[0138] i1 = 4, i2 = 5, i3 = {}, where i3 is the empty set {}.

[0139] i1 = 5, i2 = {}, i3 = {}, where i2 and i3 are empty sets {}.

[0140] When i1=0, i2=1, i3={2,3,4,5}, the candidate gene sequences formed after the substitution 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

[0145] When i1=0, i2=2, i3={3,4,5}, the candidate gene sequences formed after the substitution are: 0010 0001 0110 0110 1101 0000 0010 0001 0110 0111 1010 0000 0010 0001 0110 0111 1101 1101

[0149] When i1=0, i2=3, i3={4,5}, the candidate gene sequences formed after the substitution are: 0010 0001 1111 0110 1010 0000 0010 0001 1111 0110 1101 1101

[0152] When i1 = 0, i2 = 4, and i3 = 5, the candidate gene sequences formed after the substitution are: 0010 0001 1111 0111 1010 1101

[0154] i1 = 0, i2 = 5, i3 = {}, where i3 is the empty set {}.

[0155] When i1=1, i2=2, i3={3,4,5}, the candidate gene sequences formed after the substitution are: 1101 1000 0110 0110 1101 0000 1101 1000 0110 0111 1010 0000 1101 1000 0110 0111 1101 1101

[0159] When i1=1, i2=3, i3={4,5}, the candidate gene sequences formed after the substitution are: 1101 1000 1111 0110 1010 0000 1101 1000 1111 0110 1101 1101

[0162] When i1 = 1, i2 = 4, and i3 = 5, the candidate gene sequences formed after the substitution are: 1101 1000 1111 0111 1010 1101

[0164] i1 = 1, i2 = 5, i3 = {}, where i3 is the empty set {}.

[0165] When i1=2, i2=3, i3={4,5}, the candidate gene sequences formed after the substitution are: 1101 0001 0110 0110 1010 0000 1101 0001 0110 0110 1101 1101

[0168] When i1=2, i2=4, and i3=5, the candidate gene sequences formed after the substitution are: 1101 0001 0110 0111 1010 1101

[0170] i1 = 2, i2 = 5, i3 = {}, where i3 is the empty set {}.

[0171] For example, if a candidate gene sequence 11011000 0110 0111 1010 0000 belonging to the ordered offspring candidate set of the third gene replacement does not exist on the blockchain, then the candidate gene sequence 1101 1000 01100111 1010 0000 can be regarded as the gene sequence possessed by the Xinfuhu digital asset.

[0172] If none of the above candidate gene sequences exist on the blockchain, a fourth gene replacement can be performed on the initial progeny gene sequence G1. This involves selecting four genes from the unused random gene sequence G0 as the mutant genes for the initial progeny gene sequence G1. In other words, four genes from the unused random gene sequence G0 are used to replace the corresponding genes in the initial progeny gene sequence G1. Specifically, the i1th, i2th, i3th, and i4th genes from the unused random gene sequence G0 are used to replace the corresponding genes in the initial progeny gene sequence G1. For the positional genes, i1 takes [3,4,5,0,1,2], i2 takes [i1+1,5], i3 takes [i2+1,5], and i4 takes [i3+1,5]. This generates the following ordered progeny candidate set belonging to the fourth gene replacement. Each candidate gene sequence in the ordered progeny candidate set is checked sequentially to see if it already exists on the blockchain. If it does not exist, the candidate gene sequence is marked as existing (or marked as used) and returned. Simultaneously, the marked candidate gene sequence is uploaded to the blockchain. If all sequences exist, the next step continues. The generated ordered progeny candidate set belonging to the fourth gene replacement is as follows:

[0173] i1 = 3, i2 = 4, i3 = 5, i4 is an empty set {}.

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

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

[0176] i1 = 5, i2, i3, i4 is an empty set {}.

[0177] When i1=0, i2=1, i3=2, i4={3,4,5}, the candidate gene sequences formed after the substitution are: 0010 1000 0110 0110 1101 0000 0010 1000 0110 0111 1010 0000 0010 1000 0110 0111 1101 1101

[0181] When i1=0, i2=1, i3=3, i4={4,5}, the candidate gene sequences formed after the substitution are: 0010 1000 1111 0110 1010 0000 0010 1000 1111 0110 1101 1101

[0184] When i1=0, i2=1, i3=4, i4=5, the candidate gene sequences formed after the substitution are: 0010 1000 1111 0111 1010 1101

[0186] When i1=0, i2=2, i3=3, i4={4,5}, the candidate gene sequences formed after the substitution are: 0010 0001 0110 0110 1010 0000 0010 0001 0110 0110 1101 1101

[0189] When i1=0, i2=2, i3=4, i4=5, the candidate gene sequences formed after the substitution are: 0010 0001 0110 0111 1010 1101

[0191] i1 = 0, i2 = 2, i3 = 5, i4 is an empty set {}.

[0192] When i1=0, i2=3, i3=4, i4=5, the candidate gene sequences formed after the substitution are: 0010 0001 1111 0110 1010 1101

[0194] i1 = 0, i2 = 4, i3, i4 are an empty set {}.

[0195] When i1=1, i2=2, i3=3, i4={4,5}, the candidate gene sequences formed after the substitution are: 1101 1000 0110 0110 1010 0000 1101 1000 0110 0110 1101 1101

[0198] When i1=1, i2=2, i3=4, i4=5, the candidate gene sequences formed after the substitution are: 1101 1000 0110 0111 1010 1101

[0200] When i1=1, i2=3, i3=4, i4=5, the candidate gene sequences formed after the substitution are: 1101 1000 1111 0110 1010 1101

[0202] When i1 = 2, i2 = 3, i3 = 4, and i4 = 5, the candidate gene sequences formed after the substitution are: 1101 0001 0110 0110 1010 1101

[0204] For example, assuming that a candidate gene sequence 00100001 1111 0110 1010 1101 in the ordered offspring candidate set belonging to the fourth gene replacement does not exist on the blockchain, then the candidate gene sequence 0010 0001 11110110 1010 1101 can be regarded as the gene sequence possessed by the Xinfuhu digital asset.

[0205] If none of the above candidate gene sequences exist on the blockchain, a fifth gene replacement can be performed on the initial progeny gene sequence G1. This involves selecting five genes from the unused random gene sequence G0 as the mutant genes for the initial progeny gene sequence G1. In other words, five genes from the unused random gene sequence G0 are used to replace the corresponding genes in the initial progeny gene sequence G1. Specifically, the i1th, i2th, i3th, i4th, and i5th genes from the unused random gene sequence G0 are used to replace the corresponding genes in the initial progeny gene sequence G1. Let i1 be [3,4,5,0,1,2], i2 be [i1+1,5], i3 be [i2+1,5], i4 be [i3+1,5], and i5 be [i4+1,5]. This will generate the following ordered progeny candidate set belonging to the fifth gene replacement. Each candidate gene sequence in the ordered progeny candidate set is checked sequentially to see if it already exists on the blockchain. If it does not exist, the candidate gene sequence is marked as existing (or marked as used) and returned. Simultaneously, the marked candidate gene sequence is uploaded to the blockchain. If all sequences exist, the next step continues. The generated ordered progeny candidate set belonging to the fifth gene replacement is as follows:

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

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

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

[0209] When i1=0, i2=1, i3=2, i4={3}, and i5={4,5}, the candidate gene sequences formed after the substitution are: 0010 1000 0110 0110 1010 0000 0010 1000 0110 0110 1101 1101

[0212] When i1=0, i2=1, i3=2, i4={4}, and i5={5}, the candidate gene sequences formed after the substitution are: 0010 1000 0110 0111 1010 1101

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

[0215] When i1=0, i2=1, i3=3, i4={4}, and i5={5}, the candidate gene sequences formed after the substitution are: 0010 1000 1111 0110 1010 1101

[0217] When i1=0, i2=2, i3=3, i4={4}, and i5={5}, the candidate gene sequences formed after the substitution are: 0010 0001 0110 0110 1010 1101

[0219] When i1=1, i2=2, i3=3, i4={4}, and i5={5}, the candidate gene sequences formed after the substitution are: 1101 1000 0110 0110 1010 1101

[0221] i1 = 2, i2 = 3, i3 = 4, i4 = 5, and i5 is an empty set {}.

[0222] For example, assuming a candidate gene sequence 00101000 0110 0110 1101 1101 belonging to the ordered offspring candidate set of the fifth gene replacement does not exist on the blockchain, then this candidate gene sequence 0010 1000 01100110 1101 1101 can be used as the gene sequence possessed by the Xinfuhu digital asset. If none of the candidate gene sequences in the ordered offspring candidate set of the fifth gene replacement generated above exist on the blockchain, then the unused random gene sequence G0 = 0010 1000 1100 0110 1010 1101 can be directly used as the gene sequence possessed by the Xinfuhu digital asset, because the unused random gene sequence does not exist on the blockchain. This generates a new gene sequence possessed by the digital asset, the deterministic genetic algorithm terminates, and the unused random gene sequence is marked as existing (or marked as used) and uploaded to the blockchain. Thus, this scheme can satisfy the requirement of generating the genetic sequence of new digital assets within a defined search space, and can effectively ensure the uniqueness of the genetic sequence of the generated new digital assets.

[0223] The above embodiments demonstrate that the technical solution of the present invention generates the same unused random gene sequence for each blockchain node through the client. This enables each blockchain node to perform gene replacement on the initial offspring gene sequence according to the same replacement method, thereby avoiding the situation where the gene sequences of the new digital assets generated by each blockchain node are inconsistent due to different generated random numbers, and effectively ensuring the uniqueness of the gene sequence of the generated new digital assets. Specifically, for any blockchain node, when it 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 to generate an initial offspring gene sequence. Then, if 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; if it is determined that the initial offspring gene sequence exists on the blockchain, it can perform the i-th gene replacement on the initial offspring gene sequence according to the set gene replacement method and based on the unused random gene sequence, generating an ordered offspring candidate set belonging to the i-th gene replacement. This can effectively determine whether there is a candidate gene sequence in the ordered offspring candidate set that does not exist on the blockchain. If it is determined that all candidate gene sequences in the ordered offspring candidate set exist on the blockchain, then based on unused random gene sequences, the initial offspring gene sequence can be replaced (i+1) times, until the initial offspring gene sequence is replaced (n-1) times. This allows the determination of the gene sequences of the new digital assets generated from k digital assets to be synthesized. Thus, this scheme effectively avoids conflicts between currently generated gene sequences and previously generated gene sequences because it can generate gene sequences for new digital assets within a defined search space. Furthermore, by determining whether the candidate gene sequences in the ordered offspring candidate set generated after a gene replacement exist on the blockchain, it effectively ensures that user response time does not exceed the limit. Furthermore, since this scheme generates the same unused random gene sequence for each blockchain node through the client, each blockchain node can perform gene replacement on the initial offspring gene sequence in the same way. Therefore, it can effectively ensure that the execution results of the gene sequence of the newly generated digital assets are consistent on different blockchain nodes. This can solve the problem that existing genetic algorithms cannot be applied to blockchains because the random numbers generated by each blockchain node are different.

[0224] Based on the same technological concept Figure 3An exemplary embodiment of the present invention provides a blockchain-based digital asset synthesis device that can execute a blockchain-based digital asset synthesis method. The blockchain-based digital asset synthesis method in this embodiment is applicable to a blockchain network with m blockchain nodes. The blockchain-based digital asset synthesis device can be a service device or a component (such as a chip or integrated circuit) that supports the functions required by the service device to implement the method, or other electronic devices with the functions required to implement the method. Here, m is an integer greater than 1.

[0225] like Figure 3 As shown, the device includes:

[0226] The generation unit 301 is used to, for any blockchain node, when a digital asset synthesis transaction is detected, perform 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 offspring gene sequence; the digital asset synthesis transaction is determined by the client based on the gene sequences of the k digital assets to be synthesized and an unused random gene sequence generated by the client; each gene sequence of the digital asset to be synthesized and the unused random gene sequence both include n genes;

[0227] Processing unit 302 is configured to, when it is determined that the initial offspring gene sequence exists on the blockchain, perform the i-th gene replacement on the initial offspring gene sequence according to a set gene replacement method, based on the unused random gene sequence, to generate an ordered offspring candidate set belonging to the i-th gene replacement; the ordered offspring candidate set belonging to the i-th gene replacement includes j candidate gene sequences; if it is determined that all j candidate gene sequences exist in the blockchain, then, based on the unused random gene sequence, perform the (i+1)-th gene replacement on the initial offspring gene sequence, until the initial offspring gene sequence has undergone the (n-1)-th gene replacement, thereby determining the gene sequence of the new digital asset generated for the k digital assets to be synthesized.

[0228] Optionally, the processing unit 302 is specifically used for:

[0229] Select i genes from the unused random gene sequences as replacement genes for the initial offspring gene sequences;

[0230] The i genes in the unused random gene sequence are swapped with the i genes at the corresponding positions in the initial progeny gene sequence to generate an ordered progeny candidate set belonging to the i-th gene replacement.

[0231] Optionally, the processing unit 302 is further configured to:

[0232] If it is determined that any of the j candidate gene sequences does not exist in the blockchain, then the candidate gene sequence is identified as the gene sequence possessed by the new digital asset.

[0233] Optionally, the processing unit 302 is further configured to:

[0234] After performing the (n-1)th gene replacement on the initial progeny gene sequence, if it is determined that all p candidate gene sequences included in the ordered progeny candidate set generated by the (n-1)th gene replacement on the initial progeny gene sequence exist in the blockchain, then the unused random gene sequence is determined as the gene sequence possessed by the new digital asset.

[0235] Optionally, the processing unit 302 is specifically used for:

[0236] Based on the unused random gene sequence and n, at least one combination of gene position numbers for gene replacement is determined; each combination of gene position numbers includes at least one set of values ​​with an order of operation.

[0237] Based on the i genes in the unused random gene sequence, and by combining at least one gene position number, the i genes at the corresponding positions in the initial offspring gene sequence are replaced, thereby generating an ordered offspring candidate set belonging to the i-th gene replacement.

[0238] Optionally, the processing unit 302 is specifically used for:

[0239] If the value of i is 1, then the unused random gene sequence is moduloed by n to determine the first value;

[0240] Based on the first value and n, n initial gene position numbers with an order of operation are determined;

[0241] According to the order of operations of the n initial gene position numbers, the n initial gene position numbers are sequentially moduloed with n to determine the n first gene position numbers with the order of operations; the n 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.

[0242] The processing unit 302 is specifically used for:

[0243] 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 replaced in turn with the genes corresponding to the n first gene position numbers in the unused random gene sequence, thereby generating an ordered offspring candidate set belonging to the i-th gene replacement.

[0244] Optionally, the processing unit 302 is specifically used for:

[0245] If the value of i is greater than or equal to 2, based on the n first gene position numbers corresponding to the first gene replacement with the order of operation, determine the q second gene position numbers corresponding to each of the other i-1 genes besides the one gene corresponding to the first gene replacement with the order of operation.

[0246] Based on the n first gene position numbers with an operational order and the q second gene position numbers with an operational order corresponding to each of the other i-1 genes, multiple combinations of second gene position numbers for gene replacement are determined.

[0247] The processing unit 302 is specifically used for:

[0248] For each combination of second gene position numbers, if at least one set of values ​​in the combination of second gene position numbers is an empty set, then no gene replacement is performed on the initial offspring gene sequence.

[0249] If none of the value sets in the second gene position sequence combination is empty, then the gene corresponding to at least one gene position sequence included in the second gene position sequence combination in the initial offspring gene sequence is replaced with the gene corresponding to at least one gene position sequence in the unused random gene sequence, thereby generating an ordered offspring candidate set belonging to the i-th gene replacement.

[0250] Optionally, the processing unit 302 is further configured to:

[0251] 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 of the new digital asset marked as used is uploaded to the blockchain for storage.

[0252] Based on the same technical concept, embodiments of the present invention also provide a computing device, such as... Figure 4 As shown, it includes at least one processor 401 and a memory 402 connected to at least one processor. In this embodiment of the invention, the specific connection medium between the processor 401 and the memory 402 is not limited. Figure 4 Taking the connection between processor 401 and memory 402 via a bus as an example, the bus can be divided into address bus, data bus, control bus, etc.

[0253] In this embodiment of the 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 perform the steps included in the aforementioned blockchain-based digital asset synthesis method.

[0254] The processor 401 is the control center of the computing device. It can connect to various parts of the computing device using various interfaces and lines, and performs data processing by running or executing instructions stored in the memory 402 and calling data stored in the memory 402. 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 handles the operating system, user interface, and applications, while the modem processor mainly handles issuing instructions. It is understood that the modem processor may not be integrated into the processor 401. In some embodiments, the processor 401 and the memory 402 may be implemented on the same chip; in some embodiments, they may be implemented on separate chips.

[0255] Processor 401 can be a general-purpose processor, such as a central processing unit (CPU), digital signal processor, application-specific integrated circuit (ASIC), field-programmable gate array or other programmable logic device, discrete gate or transistor logic device, or discrete hardware component, capable of implementing or executing the methods, steps, and logic block diagrams disclosed in the embodiments of this invention. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of the blockchain-based digital asset synthesis method can be directly manifested as being executed by a hardware processor, or executed by a combination of hardware and software modules within the processor.

[0256] Memory 402, as a non-volatile computer-readable storage medium, can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. Memory 402 may include at least one type of storage medium, such as flash memory, hard disk, multimedia card, card-type memory, random access memory (RAM), static random access memory (SRAM), programmable read-only memory (PROM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), magnetic storage, magnetic disk, optical disk, etc. Memory 402 can be any other medium capable of carrying or storing desired program code in the form of instructions or data structures that can be accessed by a computer, but is not limited thereto. In embodiments of the present invention, memory 402 may also be a circuit or any other device capable of implementing storage functions for storing program instructions and / or data.

[0257] Based on the same technical concept, embodiments of the present invention also provide a computer-readable storage medium storing a computer program executable by a computing device, which, when run on the computing device, causes the computing device to perform the steps of the above-described blockchain-based digital asset synthesis method.

[0258] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can 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.) containing computer-usable program code.

[0259] This 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 block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can 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, which execute via the processor of the computer or other programmable data processing device, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0260] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0261] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0262] Although preferred embodiments of the invention have been described, those skilled in the art, upon learning the basic inventive concept, can make other changes and modifications to these embodiments. Therefore, the appended claims are intended to be interpreted as including both the preferred embodiments and all changes and modifications falling within the scope of the invention.

[0263] Obviously, those skilled in the art can make various modifications and variations to this invention without departing from its spirit and scope. Therefore, if these modifications and variations fall within the scope of the claims of this application and their equivalents, this invention also intends to include these modifications and variations.

Claims

1. A method for synthesizing digital assets based on blockchain, characterized in that, Applicable to a blockchain network with m blockchain nodes, the method includes: For any blockchain node, when it 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 transaction to generate an initial offspring gene sequence. The digital asset synthesis transaction is determined by the client based on the gene sequences of the k digital assets to be synthesized and an unused random gene sequence generated by the client. Each gene sequence of the digital asset to be synthesized and the unused random gene sequence both include n genes. When a blockchain node determines that the initial offspring gene sequence exists on the blockchain, it performs the i-th gene replacement on the initial offspring gene sequence based on the unused random gene sequence according to the set gene replacement method, generating an ordered offspring candidate set belonging to the i-th gene replacement; the ordered offspring candidate set belonging to the i-th gene replacement includes j candidate gene sequences. If the blockchain node determines that all j candidate gene sequences exist in the blockchain, it performs the (i+1)th gene replacement on the initial offspring gene sequence based on the unused random gene sequence, until the initial offspring gene sequence is replaced for the (n-1)th time, thereby determining the gene sequence of the new digital asset generated for the k digital assets to be synthesized.

2. The method as described in claim 1, characterized in that, Based on the unused random gene sequence, the initial progeny gene sequence undergoes the i-th gene replacement to generate an ordered candidate set of progeny 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 sequences; The blockchain node swaps i genes from the unused random gene sequence with 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.

3. The method as described in claim 1, characterized in that, Also includes: If a blockchain node determines that any of the j candidate gene sequences does not exist in the blockchain, then the candidate gene sequence is identified as the gene sequence possessed by the new digital asset.

4. The method as described in claim 1, characterized in that, After performing the (n-1)th gene substitution on the initial progeny gene sequence, the process further includes: If a blockchain node determines that all p candidate gene sequences included in the ordered candidate set of the (n-1)th gene replacement generated by the (n-1)th gene replacement for the initial offspring gene sequence exist in the blockchain, then the unused random gene sequence is determined as the gene sequence possessed by the new digital asset.

5. The method as described in claim 2, characterized in that, The blockchain node swaps i genes from the unused random gene sequence with 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, including: The blockchain node determines at least one combination of gene position numbers for gene replacement based on the unused random gene sequence and n; each combination of gene position numbers includes at least one set of values ​​with an order of operation. The blockchain node replaces the i genes at corresponding positions in the initial offspring gene sequence based on the i genes in the unused random gene sequence and through at least one combination of gene position numbers, thereby generating an ordered offspring candidate set belonging to the i-th gene replacement.

6. The method as described in claim 5, characterized in that, The blockchain node determines at least one combination of gene position numbers for gene replacement based on the unused random gene sequence and n, including: If the value of i is 1, the blockchain node will perform a modulo operation between the unused random gene sequence and n to determine the first value; Based on the first value and n, the blockchain node determines n initial gene position numbers with an order of operation. The blockchain node, according to the order of operations of the n initial gene position numbers, sequentially performs a modulo operation between the n initial gene position numbers and n, thereby determining n first gene position numbers with an operational order; the n first gene position numbers with an operational order are used to form a first gene position number combination; the n first gene position numbers with an operational order are used to assist gene replacement; The blockchain node replaces the i genes at corresponding positions in the initial offspring gene sequence based on the i genes in the unused random gene sequence and through at least one combination of gene position indices, thereby generating an ordered offspring candidate set belonging to the i-th gene replacement, including: The blockchain node, according to the order of operations of the n first gene position numbers included in the first gene position number combination, sequentially replaces the genes corresponding to the n first gene position numbers in the initial offspring gene sequence with the genes corresponding to the n first gene position numbers in the unused random gene sequence, thereby generating an ordered offspring candidate set belonging to the i-th gene replacement.

7. The method as described in claim 6, characterized in that, The blockchain node determines at least one combination of gene position numbers 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 the q second gene position numbers corresponding to each of the other i-1 genes (excluding the gene corresponding to the first gene replacement) based on the n first gene position numbers with the order of operation corresponding to the first gene replacement. The blockchain node determines multiple combinations of second gene position numbers for gene replacement based on the n first gene position numbers with an order of operation and the q second gene position numbers with an order of operation corresponding to each of the other i-1 genes. The blockchain node replaces the i genes at corresponding positions in the initial offspring gene sequence based on the i genes in the unused random gene sequence and through at least one combination of gene position indices, thereby generating an ordered offspring candidate set belonging to the i-th gene replacement, including: For each combination of second gene position numbers, if at least one set of values ​​in the combination of second gene position numbers is an empty set, then the blockchain node does not perform gene replacement on the initial offspring gene sequence. If none of the value sets in the second gene position sequence combination is empty, the blockchain node will sequentially replace the gene corresponding to at least one gene position sequence in the second gene position sequence combination in the initial offspring gene sequence with the gene corresponding to at least one gene position sequence in the unused random gene sequence, thereby generating an ordered offspring candidate set belonging to the i-th gene replacement.

8. The method as described in claim 1, characterized in that, After determining the genetic sequence of the new digital assets generated from the k digital assets to be synthesized, the process further includes: 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 to the blockchain for storage.

9. A blockchain-based digital asset synthesis device, characterized in that, Suitable for a blockchain network with m blockchain nodes, the device includes: A generation unit is used to, for any blockchain node, upon detecting a digital asset synthesis transaction, perform 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 offspring gene sequence; the digital asset synthesis transaction is determined by the client based on the gene sequences of the k digital assets to be synthesized and an unused random gene sequence generated by the client; each gene sequence of the digital asset to be synthesized and the unused random gene sequence both include n genes; The processing unit is configured to, upon determining that the initial offspring gene sequence exists on the blockchain, perform the i-th gene replacement on the initial offspring gene sequence based on the unused random gene sequence according to a set gene replacement method, generating an ordered offspring candidate set belonging to the i-th gene replacement; the ordered offspring candidate set belonging to the i-th gene replacement includes j candidate gene sequences; if it is determined that all j candidate gene sequences exist in the blockchain, then, based on the unused random gene sequence, perform the (i+1)-th gene replacement on the initial offspring gene sequence, until the initial offspring gene sequence has undergone the (n-1)-th gene replacement, thereby determining the gene sequence of the new digital asset generated for the k digital assets to be synthesized.

10. A computing device, characterized in that, The method includes at least one processor and at least one memory, wherein the memory stores a computer program that, when executed by the processor, causes the processor to perform the method according to any one of claims 1 to 8.

11. A computer-readable storage medium, characterized in that, It stores a computer program executable by a computing device, which, when run on the computing device, causes the computing device to perform the method according to any one of claims 1 to 8.

Images