CN115048462A

CN115048462A - Block chain-based digital asset synthesis method and device

Info

Publication number: CN115048462A
Application number: CN202210762540.8A
Authority: CN
Inventors: 李辉忠; 白兴强; 陈宇杰; 莫楠; 石翔; 张开翔; 范瑞彬
Original assignee: WeBank Co Ltd
Current assignee: WeBank Co Ltd
Priority date: 2022-06-29
Filing date: 2022-06-29
Publication date: 2022-09-13
Also published as: WO2024000897A1

Abstract

The embodiment of the invention provides a digital asset synthesis method and a device based on a block chain, wherein the method comprises the steps that when any block chain node detects digital asset synthesis transaction, exclusive-OR operation is carried out on gene sequences of k digital assets to be synthesized to generate initial filial generation gene sequences, when the initial filial generation gene sequences exist on the block chain, the ith gene replacement is carried out on the initial filial generation gene sequences based on unused random gene sequences to generate an ordered filial generation candidate set belonging to the ith gene replacement, and if j candidate gene sequences are determined to exist in the block chain, the (i + 1) th gene replacement is carried out on the initial filial generation gene sequences until the (n-1) th gene replacement is carried out on the initial filial generation gene sequences, so that the gene sequences of new digital assets are determined. In this way, the scheme can effectively ensure that the execution results of the gene sequences for the generated new digital assets are consistent at different block link points.

Description

Block chain-based digital asset synthesis method and device

Technical Field

The embodiment of the invention relates to the field of financial technology (Fintech), in particular to a block chain-based digital asset synthesis method and device.

Background

With the development of computer technology, more and more technologies are applied in the financial field, and the traditional financial industry is gradually changing to financial technology, but due to the requirements of the financial industry on safety and real-time performance, higher requirements are also put forward on the technologies.

The digital assets are unique digital certificates generated by using a block chain technology, correspond to specific works and artworks, and realize real and credible digital distribution, purchase, collection and use on the basis of protecting the digital copyright of the works and the artworks. The digital assets are rich in categories, including but not limited to digital pictures, music, videos, 3D models, electronic tickets, digital souvenirs, and the like. Based on this, for a certain type of digital assets, in order to be able to derive a new type of digital assets timely and effectively, the new type of digital assets can be synthesized by selecting one or two existing digital assets of the type from the block chain, and then if a new digital asset of the type is to be synthesized, the new digital asset of the type needs to be synthesized by means of a genetic algorithm.

However, the existing genetic algorithm needs to use random numbers when generating a new offspring population, and since the execution results of each blockchain link point are required to be consistent on the blockchain, the random numbers cannot be used (the generated random numbers are different because each blockchain node is independent), so that the existing genetic algorithm cannot be applied on the blockchain.

In summary, there is a need for a block chain-based digital asset synthesis method for effectively ensuring that the execution results of the gene sequences of the generated new digital asset at different block chain nodes are consistent, so as to solve the problem in the prior art that the conventional genetic algorithm cannot be applied to the block chain due to the difference of the random numbers generated by the block chain nodes.

Disclosure of Invention

The embodiment of the invention provides a block chain-based digital asset synthesis method and device, which are used for effectively ensuring that execution results of gene sequences of generated new digital assets on different block chain link points are consistent, so that the problem that the conventional genetic algorithm cannot be applied to a block chain due to different random numbers generated by the block chain link points in the prior art can be solved.

In a first aspect, an embodiment of the present invention provides a method for synthesizing a digital asset based on a blockchain, which is applicable to a blockchain network having m blockchain nodes, and the method includes:

aiming at any block chain node, when detecting the digital asset synthesis transaction, the block chain node performs exclusive OR operation on gene sequences of k digital assets to be synthesized in the digital asset synthesis transaction to generate an initial filial generation gene sequence; the digital asset synthesis transaction is determined by the client based on the gene sequences of k digital assets to be synthesized and an unused random gene sequence generated by the client; each digital asset to be synthesized has a gene sequence comprising n genes and the unused random gene sequence;

when the block chain node determines that the initial filial generation gene sequence exists on the block chain, performing ith gene replacement on the initial filial generation gene sequence based on the unused random gene sequence according to a set gene replacement mode to generate an ordered filial generation candidate set belonging to the ith gene replacement; the ordered progeny candidate set belonging to the ith gene replacement comprises j candidate gene sequences;

and if the block chain node determines that the j candidate gene sequences are all in the block chain, performing gene replacement for the initial filial generation gene sequence for the (i + 1) th time based on the unused random gene sequence until the initial filial generation gene sequence is subjected to the (n-1) th time of gene replacement, so as to determine the gene sequence of the new digital asset generated aiming at the k digital assets to be synthesized.

In the technical scheme, the same unused random gene sequence is generated for each block chain link point through the client, so that each block chain link point can perform gene replacement aiming at the initial filial gene sequence in the same replacement mode, the condition that the gene sequences of the new digital assets generated by each block chain link point are inconsistent due to different generated random numbers can be avoided, and the uniqueness of the gene sequences of the generated new digital assets can be effectively ensured. Specifically, for any blockchain node, when the blockchain node detects a digital asset synthesis transaction, the blockchain node performs exclusive or operation on gene sequences of k digital assets to be synthesized in the digital asset synthesis transaction, so as to generate an initial progeny gene sequence. Then, when the initial filial generation gene sequence does not exist on the block chain, taking the initial filial generation gene sequence as the gene sequence of the new digital asset; when the initial filial generation gene sequence exists on the block chain, the ith gene replacement can be carried out on the initial filial generation gene sequence according to a set gene replacement mode and based on the unused random gene sequence, and an ordered filial generation candidate set belonging to the ith gene replacement is generated, so that whether a certain candidate gene sequence does not exist on the block chain in the ordered filial generation candidate set can be effectively judged. If all candidate gene sequences in the ordered offspring candidate set are judged to exist on the block chain, the gene replacement for the (i + 1) th time can be carried out on the initial offspring gene sequence based on the unused random gene sequence until the gene replacement for the (n-1) th time is carried out on the initial offspring gene sequence, so that the gene sequence of a new digital asset generated aiming at k digital assets to be synthesized can be determined. Therefore, the scheme can meet the requirement that the gene sequences of the new digital assets are generated in a determined search space, and whether the candidate gene sequences in the ordered descendant candidate set exist on the block chain or not is judged aiming at the ordered descendant candidate set generated by a certain gene replacement, so that the problem that the currently generated gene sequences and the previously generated gene sequences conflict can be effectively avoided, and the user response time can be effectively ensured not to be overtime. In addition, according to the scheme, as the same unused random gene sequence is generated for each block chain link point through the client, each block chain link point can perform gene replacement on the initial filial gene sequence according to the same replacement mode, the execution results of the gene sequences of the generated new digital assets on different block chain link points can be effectively ensured to be consistent, and the problem that the existing genetic algorithm cannot be applied to the block chain due to the fact that the random numbers generated by each block chain link point are different in the prior art can be solved.

Optionally, performing an ith gene replacement on the initial progeny gene sequence based on the unused random gene sequence, generating an ordered set of progeny candidates belonging to the ith gene replacement, comprising:

the block chain node selects i genes from the unused random gene sequence as replacement genes of the initial filial generation gene sequence;

the blockware nodes interchange i genes in the unused random gene sequence with i genes at corresponding positions in the initial progeny gene sequence, thereby generating an ordered progeny candidate set belonging to the ith gene replacement.

In the above technical solution, because the unused random gene sequence does not exist in the block chain, the gene sequences that do not exist in the block chain can be obtained as much as possible by replacing a plurality of genes at corresponding positions in the initial offspring gene sequence with genes at a plurality of positions in the unused random gene sequence, that is, the gene sequences that the new digital asset has can be obtained, so that the uniqueness of the gene sequences that the generated new digital asset has can be effectively ensured, and at the same time, the synthesized new digital asset can inherit the parent attribute to the greatest extent, that is, the probability that the synthesized new digital asset inherits the parent attribute is required to be greater than that of random generation, so as to retain the scarce characteristic in the parent gene.

Optionally, the method further comprises:

and if the block chain node determines that any candidate gene sequence in the j candidate gene sequences does not exist in the block chain, determining the candidate gene sequence as the gene sequence of the new digital asset.

In the technical scheme, when the candidate gene sequence does not exist on the block chain in the ordered offspring candidate set generated after replacement is judged, the candidate gene sequence can be used as the gene sequence of the new digital asset, so that the uniqueness of the gene sequence of the generated new digital asset can be effectively ensured, the possibility of conflict between the offspring and the offspring can be effectively avoided, and the purpose of generating the gene sequence of the new offspring by carrying out exclusive-or operation on the gene sequences of a plurality of parents can be realized.

Optionally, after the n-1 gene replacement of the initial progeny gene sequence, further comprising:

and if the blockchain node determines that p candidate gene sequences included in the ordered descendant candidate set which belongs to the (n-1) th gene replacement and is generated by performing the (n-1) th gene replacement on the initial descendant gene sequence exist in the blockchain, determining the unused random gene sequence as the gene sequence of the new digital asset.

In the above technical solution, in order to avoid that the response time of the user requesting to generate the gene sequence of the new descendant is too long, that is, in order to effectively ensure that the response time of the user requesting to generate the gene sequence of the new descendant is not overtime, thus ensuring that the gene sequence that a new digital asset has is generated within a defined search space, then after the (n-1) th gene replacement for the initial progeny gene sequence, if no candidate gene sequence is found, the unused random gene sequence is directly used as the gene sequence of the new digital asset, because the unused random gene sequence is not existed on the block chain, so as to generate the gene sequence possessed by new digital asset, therefore, the uniqueness of the gene sequence of the generated new digital asset can be effectively ensured.

Optionally, the block linked point interchanges i genes in the unused random gene sequence with i genes at corresponding positions in the initial progeny gene sequence to generate an ordered progeny candidate set belonging to the ith gene replacement, comprising:

the block chain node determines at least one gene position sequence number combination for gene replacement based on the unused random gene sequence and the n; each gene position sequence number combination comprises at least one value set with operation sequence;

and the block chain node replaces i genes at corresponding positions in the initial filial generation gene sequence according to the i genes in the unused random gene sequence and through at least one gene position sequence number combination, so that an ordered filial generation candidate set belonging to the ith gene replacement is generated.

In the technical scheme, based on the unused random gene sequence and the total number n of the genes of the digital assets, corresponding operation can be carried out to generate at least one gene position sequence number combination for gene replacement, so that a plurality of genes in the initial filial generation gene sequence can be replaced by a plurality of genes in corresponding positions in the unused random gene sequence through the at least one gene position sequence number combination, and effective replacement of the initial filial generation gene sequence can be realized, thereby providing support for the subsequent effective generation of the gene sequence of a new digital asset.

Optionally, the determining, by the blockchain node, at least one combination of gene position indices for gene replacement based on the unused random gene sequence and the n, includes:

if the value of i is 1, the block link node performs remainder operation on the unused random gene sequence and the n to determine a first numerical value;

the block chain link points determine n initial gene position serial numbers with operation sequence based on the first numerical value and the n;

the block chain link points sequentially carry out remainder operation on the n initial gene position serial numbers and the n according to the operation sequence of the n initial gene position serial numbers, so that n first gene position serial numbers with the operation sequence are determined; the n first gene position sequence numbers with operation sequence are used for forming a first gene position sequence number combination; the n first gene position serial numbers with operation sequence are used for assisting gene replacement;

the block chain node replaces i genes at corresponding positions in the initial filial generation gene sequence according to the i genes in the unused random gene sequence and through at least one gene position sequence number combination, so as to generate an ordered filial generation candidate set belonging to the ith gene replacement, and the method comprises the following steps:

and the block chain node sequentially replaces the genes corresponding to the n first gene position serial numbers in the initial filial gene sequence with the genes corresponding to the n first gene position serial numbers in the unused random gene sequence according to the operation sequence of the n first gene position serial numbers in the first gene position serial number combination, so as to generate an ordered filial generation candidate set belonging to the ith gene replacement.

In the above technical solution, when performing a gene replacement for an initial offspring gene sequence, an ordered sequence (i.e., a first numerical value having a certain operation sequence) can be generated through a random gene sequence that is not used and a remainder operation of n, and a plurality of candidate new offspring gene sequences having a certain certainty can be generated based on the ordered sequence, so that a gene sequence of a new digital asset having uniqueness can be determined as much as possible from the plurality of candidate new offspring gene sequences, so that each block link point can generate the same gene sequence, and whether a candidate new offspring gene sequence does not exist in the block links in the plurality of candidate new offspring gene sequences can be determined according to the same order.

if the value of i is greater than or equal to 2, determining q second gene position sequence numbers with operation sequence order corresponding to i-1 genes except for one gene corresponding to the 1 st gene replacement based on the n first gene position sequence numbers with operation sequence order corresponding to the 1 st gene replacement by the block link point;

the block chain node determines a plurality of second gene position sequence number combinations for gene replacement according to the n first gene position sequence numbers with the operation precedence order and q second gene position sequence numbers with the operation precedence order corresponding to the i-1 genes;

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

if any value set does not exist in the second gene position sequence number combination and is an empty set, the block chain node sequentially replaces the gene corresponding to at least one gene position sequence number included in the second gene position sequence number combination in the initial filial generation gene sequence with the gene corresponding to at least one gene position sequence number in the unused random gene sequence, and therefore an ordered filial generation candidate set belonging to the ith gene replacement is generated.

In the above technical solution, when gene replacement is performed for an initial child gene sequence for multiple times, more candidate new child gene sequences may be generated, so that the number of gene sequences that new children may have is increased, and the selectivity is increased, so that it is highly possible to determine a gene sequence that a new digital asset having uniqueness has from the more candidate new child gene sequences, and thus it is highly possible to generate a gene sequence that a new digital asset has in a determined search space, so that each block chain node may traverse all the generated children, and the traversal order of each block chain node may be ensured to be consistent, thereby effectively ensuring that the gene sequences of the synthesized children are also consistent.

Optionally, after determining the gene sequences of the new digital assets generated for the k digital assets to be synthesized, the method further includes:

and marking the use state of the gene sequence of the new digital asset as used, and uploading the gene sequence of the new digital asset marked as used to the block chain for storage.

In the above technical solution, in order to effectively avoid the possibility of collision between the subsequently generated offspring and the previously generated offspring, and to effectively ensure the uniqueness of the gene sequence of the generated new digital asset, after the gene sequence of the new digital asset is generated, the use state 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 block chain, so that whether the gene sequence of the generated new offspring exists on the block chain can be timely and accurately determined by the block chain after the gene sequence of the new offspring is generated.

In a second aspect, an embodiment of the present invention further provides a device for synthesizing digital assets based on blockchains, which is suitable for a blockchain network having m blockchain nodes, and the device includes:

the generation unit is used for carrying out exclusive OR operation on gene sequences of k digital assets to be synthesized in the digital asset synthesis transaction to generate an initial filial generation gene sequence when the digital asset synthesis transaction is detected aiming at any block chain node; the digital asset synthesis transaction is determined by the client based on the gene sequences of k digital assets to be synthesized and an unused random gene sequence generated by the client; each digital asset to be synthesized has a gene sequence comprising n genes and the unused random gene sequence;

the processing unit is used for carrying out ith gene replacement on the initial filial generation gene sequence based on the unused random gene sequence according to a set gene replacement mode when the initial filial generation gene sequence exists on the block chain, and generating an ordered filial generation candidate set belonging to the ith gene replacement; the ordered progeny candidate set belonging to the ith gene replacement comprises j candidate gene sequences; if j candidate gene sequences are determined to be present in the block chain, performing gene replacement for the initial filial generation gene sequence for the (i + 1) th time based on the unused random gene sequence until the initial filial generation gene sequence is subjected to the gene replacement for the (n-1) th time, so as to determine the gene sequence of a new digital asset generated aiming at the k digital assets to be synthesized.

Optionally, the processing unit is specifically configured to:

selecting i genes from the unused random gene sequences as replacement genes of the initial progeny gene sequences;

interchanging i genes in the unused random gene sequence with i genes at corresponding positions in the initial progeny gene sequence, thereby generating an ordered progeny candidate set belonging to the ith gene replacement.

Optionally, the processing unit is further configured to:

and if any candidate gene sequence in the j candidate gene sequences is determined not to exist in the block chain, determining the candidate gene sequence as the gene sequence of the new digital asset.

Optionally, the processing unit is further configured to:

after the initial progeny gene sequence is subjected to the (n-1) th gene replacement, if it is determined that p candidate gene sequences included in the ordered progeny candidate set belonging to the (n-1) th gene replacement generated by the (n-1) th gene replacement performed on the initial progeny gene sequence are all present in the blockchain, determining the unused random gene sequence as the gene sequence possessed by the new digital asset.

Optionally, the processing unit is specifically configured to:

determining at least one gene position number combination for gene replacement based on the unused random gene sequence and the n; each gene position sequence number combination comprises at least one value set with operation sequence;

and replacing i genes at corresponding positions in the initial filial generation gene sequence according to the i genes in the unused random gene sequence and through at least one gene position sequence number combination, thereby generating an ordered filial generation candidate set belonging to the ith gene replacement.

Optionally, the processing unit is specifically configured to:

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

determining n initial gene position serial numbers with operation sequence based on the first numerical value and the n;

according to the operation sequence of the n initial gene position serial numbers, carrying out remainder operation on the n initial gene position serial numbers and the n in sequence, thereby determining n first gene position serial numbers with the operation sequence; the n first gene position sequence numbers with operation sequence are used for forming a first gene position sequence number combination; the n first gene position serial numbers with operation sequence are used for assisting gene replacement;

the processing unit is specifically configured to:

and sequentially replacing the genes corresponding to the n first gene position sequence numbers in the initial filial generation gene sequence with the genes corresponding to the n first gene position sequence numbers in the unused random gene sequence according to the operation sequence of the n first gene position sequence numbers in the first gene position sequence combination, thereby generating an ordered filial generation candidate set belonging to the ith gene replacement.

Optionally, the processing unit is specifically configured to:

if the value of i is more than or equal to 2, determining q second gene position serial numbers with operation sequence respectively corresponding to i-1 genes except for one gene corresponding to the 1 st gene replacement based on the n first gene position serial numbers with operation sequence corresponding to the 1 st gene replacement;

determining a plurality of second gene position sequence number combinations for gene replacement according to the n first gene position sequence numbers with operation precedence order and the q second gene position sequence numbers with operation precedence order corresponding to the other i-1 genes;

the processing unit is specifically configured to:

for each second gene position sequence number combination, if at least one value set in the second gene position sequence number combination is an empty set, not performing gene replacement for the initial filial generation gene sequence;

if any value set does not exist in the second gene position sequence number combination and is an empty set, replacing the gene corresponding to at least one gene position sequence number included in the second gene position sequence number combination in the initial filial generation gene sequence with the gene corresponding to at least one gene position sequence number in the unused random gene sequence in sequence, so as to generate an ordered filial generation candidate set belonging to the ith gene replacement.

Optionally, the processing unit is further configured to:

after determining the gene sequences of the new digital assets generated for the k digital assets to be synthesized, marking the use states of the gene sequences of the new digital assets as used, and uploading the gene sequences of the new digital assets marked as used to the block chain for saving.

In a third aspect, an embodiment of the present invention provides a computing device, including at least one processor and at least one memory, where the memory stores a computer program, and when the program is executed by the processor, the processor is caused to execute the method for block chain-based digital asset synthesis according to any of the first aspect.

In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium storing a computer program executable by a computing device, when the program is run on the computing device, the program causing the computing device to execute the method for block chain based digital asset synthesis according to any of the first aspects.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

FIG. 1 is a schematic diagram of a possible system architecture according to an embodiment of the present invention;

fig. 2 is a schematic flow chart of a block chain-based digital asset synthesis method according to an embodiment of the present invention;

fig. 3 is a schematic structural diagram of a block chain-based digital asset synthesis apparatus according to an embodiment of the present invention;

fig. 4 is a schematic structural diagram of a computing device according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention clearer, the present invention will be described in further detail with reference to the accompanying drawings, and it is apparent that the described embodiments are only a part of the embodiments of the present invention, not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

In the following, some terms related to the embodiments of the present invention are first explained to facilitate understanding by those skilled in the art.

(1) Block chains: a blockchain is a distributed storage system that is commonly maintained and trusted by multiple nodes. The block chain bottom layer is a chain formed by a series of blocks, each block records the hash value of the block besides the data of the block, and the chained data structure is formed in this way. A chunk consists of a chunk header and a chunk body, where the chunk header definition includes important fields such as the height of the chunk, the hash value of the last chunk, and the chunk body primarily stores transaction data. The block chain guarantees the safety of data transmission and access in a cryptographic mode, and guarantees that data on the chain cannot be tampered by using a chain structure.

(2) And (3) node: in the blockchain, a node refers to a participant with a unique identity, and the node has a complete copy of the ledger and has the capability of participating in the network consensus and maintaining the ledger of the blockchain.

(3) Intelligent contract: an intelligent contract is a collection of code and data that runs on top of a blockchain system, where the code is responsible for implementing the functionality of the intelligent contract and the data is responsible for storing the state of the intelligent contract, which can receive and send information.

(4) Trading: in blockchains, any operation (deploying a contract, invoking a contract interface, etc.) is done by sending a transaction. The transaction is initiated by the user and sent to the blockchain node through the client. After receiving the transaction, the blockchain node packs the transaction into blocks and executes the blocks.

(5) Digital assets: a non-homogeneous asset having a unique identification on a blockchain.

(6) Genetic Algorithm (Genetic Algorithm, GA): the method is a calculation model of the biological evolution process for simulating natural selection and genetic mechanism of Darwinian biological evolution theory, and is a method for searching an optimal solution by simulating the natural evolution process.

As described above, some terms related to the embodiments of the present invention are described, and the technical features related to the embodiments of the present invention are described below.

To facilitate understanding of the embodiments of the present invention, a block chain based digital asset synthesis system architecture suitable for the embodiments of the present invention will be described first by taking one possible system architecture shown in fig. 1 as an example. As shown in fig. 1, the system architecture may include a client 100 and a blockchain network 200. The block chain network 200 may include at least one block chain node, such as a block chain node 201, a block chain link point 202, a block chain link point 203, a block chain link point 204, and the like, where any two block chain link points in the at least one node may be communicatively connected; the client 100 and any blockchain node in the blockchain network 200 may be communicatively connected in a wired manner, or may be communicatively connected in a wireless manner, which is not limited in the embodiment of the present invention.

Illustratively, when there is a need for a client to synthesize a new digital asset from a plurality of parent digital assets, an unused random genetic sequence is generated, the unused random genetic sequence and each parent digital asset have the same number of genes, and a digital asset synthesis transaction is generated based on the unused random genetic sequence and the plurality of parent digital assets, and then the digital asset synthesis transaction is submitted to any blockchain node (e.g., blockchain node 201) in blockchain network 200, or the digital asset synthesis transaction may be submitted to nodes in blockchain network 200. Taking the example of any blockchain node (such as node blockchain 201) in the blockchain network 200 submitting the digital asset composite transaction, after receiving the digital asset composite transaction, the blockchain link point 201 synchronizes the digital asset composite transaction with other blockchain nodes in the blockchain network 200, and each blockchain link point stores the digital asset composite transaction in its own transaction pool. Then, the block-out node packages the digital asset synthesis transaction into a block, and initiates a consensus process for the block, for example, using a byzantine fault-tolerant algorithm or a workload certification consensus algorithm, and links the block after the block consensus succeeds. Each block chain node executes the digital asset synthesis transaction in the block according to the same digital asset synthesis transaction execution rule, and then, when judging whether the execution results of the block chain nodes for the digital asset synthesis transaction are consistent or whether the agreed number meets a first set number threshold (for example, the execution results of two-thirds of the block chain nodes are consistent), the execution result can be approved. And finally, confirming a certain gene sequence as a gene sequence of the new digital asset, marking the use state of the gene sequence as used, and uploading the gene sequence marked as used to the block chain.

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

Based on the above description, fig. 2 exemplarily shows a flow of a block chain-based digital asset synthesis method according to an embodiment of the present invention, which may be performed by a block chain-based digital asset synthesis apparatus. The digital asset synthesis method based on the block chain is suitable for a block chain network with m block chain nodes; the block chain-based digital asset synthesis apparatus may be a service device or a component (such as a chip or an integrated circuit) capable of supporting the service device to implement the functions required by the method, or may be other electronic devices having the functions required by the method. Wherein m is an integer greater than 1.

As shown in fig. 2, the process specifically includes:

step 201, aiming at any block chain node, when the block chain node detects a digital asset synthesis transaction, performing exclusive or operation on gene sequences of k digital assets to be synthesized in the digital asset synthesis transaction to generate an initial filial generation gene sequence.

In the 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 has a gene sequence comprising n genes, as well as an unused random gene sequence. Wherein k is an integer greater than or equal to 1; n is an integer of 1 or more.

When a user belonging to a block chain network has a requirement for synthesizing a new digital asset, the user generates an unused random gene sequence through a client installed on a terminal device (such as a smart phone, a tablet computer, a notebook computer, a desktop computer, and the like) based on the gene attribute of the digital asset, wherein the number of genes of the unused random gene sequence is the same as the number of genes of the digital asset, so that when an initial filial gene sequence generated by exclusive-or operation exists on a block chain, each block chain node can generate a gene sequence of the new digital asset based on the unused random gene sequence to the maximum extent, thereby avoiding that random numbers cannot be used on the block chain, and simultaneously ensuring that each block chain node on the block chain basically keeps one block chain node for the execution result of synthesizing the new digital asset Thus, the method can be used for the treatment of the tumor. Then, the client generates a digital asset synthesis transaction based on the unused random gene sequences and the gene sequences of the k digital assets to be synthesized, and submits the digital asset synthesis transaction to any blockchain node in the blockchain network, or may submit the digital asset synthesis transaction to each blockchain node in the blockchain network, respectively. Alternatively, the user may generate a digital asset synthesis request on a client of the terminal device based on the unused random gene sequences and the gene sequences of the k digital assets to be synthesized, and send the digital asset synthesis request to any blockchain node in the blockchain network in a transaction form through the client of the terminal device, or send the digital asset synthesis request to each blockchain node in the blockchain network in a transaction form, respectively. After receiving the digital asset synthesis transaction, any blockchain node may perform corresponding processing on the digital asset synthesis transaction, for example, an exclusive or operation may be performed on gene sequences of k digital assets to be synthesized in the digital asset synthesis transaction to generate an initial offspring gene sequence, or the digital asset synthesis transaction may be stored in a local transaction pool, then, a certain blockchain node in the blockchain network is determined to be a block node (i.e., a master node), the blockchain node packs the digital asset synthesis transaction in the local transaction pool into a block, and sends the block to other blockchain nodes in the blockchain network except the blockchain node for consensus, and the block is linked after it is determined that the block consensus is successful. That is, in the process of identifying the block, each block link point executes the block, i.e., executes the digital asset synthesis transaction in the block, for example, performs an exclusive or operation on the gene sequences of k digital assets to be synthesized in the digital asset synthesis transaction, thereby generating the initial child gene sequences.

Illustratively, in the case of the fugu digital assets, each digital asset is unique on the blockchain, with its own unique number. Therefore, the unique number of the tiger digital asset can be used as the representation of the gene sequence of the tiger digital asset, and if the tiger has 6 attributes, each attribute has 16 possibilities, and the unique number of each tiger is represented by a positive integer of 32 bits, 24 bits of the unique number can be used as the 6 attributes of the tiger, as shown in table 1, and every 4 bits represent one attribute.

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

Others

16 kinds of

256

In order for a newly generated slot to inherit some of the attributes of the multiple slots used for composition, an algorithm is required to generate a new uniquely numbered slot when the multiple slots need to be combined to generate a new slot. Since random numbers cannot be used in smart contracts, and in order to ensure that user response time does not time out, such a synthesis algorithm also needs to have a certain search space and perform result consistency on different machines (or nodes). Thus, an ordered candidate set of children may be generated by a deterministic genetic algorithm, traversing children in the ordered candidate set of children one by one until children not on the blockchain are found.

In addition, assuming that the attribute of each digital asset is determined by N genes, each of which has K possibilities, synthesizing a new digital asset using M parent digital assets requires that the probability of the synthesized new digital asset inheriting the parent attribute be greater than that of random generation. For example, if M ═ 3 tigers are used to synthesize new tigers, each tiger has N ═ 6 attributes, each attribute has K ═ 16 possibilities, and the unique number of a tiger is composed of its 6 attributes, then the new synthesized tiger can be searched and generated in the following manner. Such as the input: gene sequences of M ancestor digital assetsx1, x2, …, xM and an unused random gene sequence G0, which corresponds to the example where M is 3 parent tigers with x 1-000101010110011010110011, x 2-010011101101001110001000, x 3-100010100100001011101011, respectively, and the incoming unused random gene sequence G0-001010001100011010101101. And (3) outputting: the new digital assets have gene sequences, such as the new fuger digital assets. Taking M ═ 3 foggs as an example, a certain user generates a digital asset synthesis transaction aiming at 3 foggs digital assets and unused random gene sequences G0 through a client installed on a used terminal device, and submits the digital asset synthesis transaction to any block chain node of a block chain network, after synchronizing any block chain node aiming at the digital asset synthesis transaction, a block node packs the digital asset synthesis transaction into blocks, and after starting a consensus process aiming at the blocks, each block chain node can execute the digital asset synthesis transaction in the blocks, namely, the xor operation is performed on the gene sequences of the 3 foggs, so that a gene sequence G1 can be generated, if G1 does not exist on the block chain, G1 is the gene sequence of a newly synthesized descendant of the foggs, and the deterministic genetic algorithm is terminated; the exclusive-or operation is selected as a synthesis algorithm of the genes, the exclusive-or operation corresponds to addition without carry, gene sequences associated with all parents can be obtained to the maximum extent through the exclusive-or operation, and the scarce characteristics in the genes of the parents are reserved. Then using the gene sequences of 3 tiger digital assets to make XOR operation so as to obtain the initial filial generation gene sequence

Step 202, when determining that the initial filial gene sequence exists on the block chain, the block chain node performs ith gene replacement on the initial filial gene sequence based on the unused random gene sequence according to a set gene replacement mode, and generates an ordered filial candidate set belonging to the ith gene replacement.

Step 203, if the block chain node determines that the j candidate gene sequences all exist in the block chain, performing i +1 th gene replacement on the initial progeny gene sequence based on the unused random gene sequence until performing n-1 th gene replacement on the initial progeny gene sequence, thereby determining a gene sequence of a new digital asset generated for the k digital assets to be synthesized.

In the embodiment of the invention, because the unused random gene sequence does not exist on the block chain, the gene sequences which do not exist on the block chain can be obtained to the maximum extent by replacing a plurality of genes at corresponding positions in the initial filial gene sequence with the genes at a plurality of positions in the unused random gene sequence, namely the gene sequences of the new digital assets can be obtained, so that the uniqueness of the gene sequences of the generated new digital assets can be effectively ensured, and the synthesized new digital assets can inherit the parent attributes to the maximum extent so as to keep the scarce characteristics in the parent genes. Specifically, for each blockchain node, the blockchain node may generate an initial progeny gene sequence after performing an exclusive or operation on gene sequences of k digital assets to be synthesized, and may correspondingly replace at least one gene in the initial progeny gene sequence after determining that the initial progeny gene sequence exists on the blockchain. If the block chain link point determines that the initial filial generation gene sequence does not exist on the block chain, the initial filial generation gene sequence can be directly used as the gene sequence of a new digital asset generated by k digital assets to be synthesized. That is, the block segment point selects i genes from the unused random gene sequences as the replacement genes of the initial progeny gene sequences, and the i genes in the unused random gene sequences are exchanged with the i genes at the corresponding positions in the initial progeny gene sequences, so as to generate the i-th gene replacement. Wherein the ordered progeny candidate set belonging to the ith gene replacement comprises j candidate gene sequences. If the block chain node determines that any candidate gene sequence in the j candidate gene sequences does not exist in the block chain, the candidate gene sequence can be determined as the gene sequence of the new digital asset. If the blockchain node determines that j candidate gene sequences are all present in the blockchain, i +1 th gene replacement of the initial progeny gene sequence based on the unused random gene sequence is required. Wherein i is an integer greater than or equal to 1; j is an integer of 1 or more.

The block chain link point can be correspondingly operated based on the unused random gene sequence and the total number n of the genes of the digital assets to generate at least one gene position sequence number combination for gene replacement, so that a plurality of genes in the initial filial generation gene sequence can be replaced by a plurality of genes at corresponding positions in the unused random gene sequence through the at least one gene position sequence number combination, and effective replacement of the initial filial generation gene sequence can be realized, thereby providing support for the subsequent effective generation of the gene sequence of the new digital assets. That is, the block chain node determines at least one gene position sequence number combination for gene replacement based on the unused random gene sequence and n, and each gene position sequence number combination comprises at least one value set with operation sequence. And then, according to i genes in the unused random gene sequence, replacing i genes at corresponding positions in the initial filial generation gene sequence through at least one gene position sequence number combination, thereby generating an ordered filial generation candidate set belonging to the ith gene replacement. Specifically, when gene replacement is performed for an initial progeny gene sequence, an ordered sequence (i.e., a first numerical value with a certain operation sequence) can be generated through the unused random gene sequence and the remainder operation of n, and a plurality of candidate new progeny gene sequences with certain certainty can be generated based on the ordered sequence, so that a gene sequence of a new unique digital asset can be determined as much as possible from the plurality of candidate new progeny gene sequences, and each block node can generate the same gene sequence. For example, if the value of i is 1, the block link point may perform a remainder operation on the unused random gene sequence and n, that is, may determine a first value, and based on the first value and n, may determine n initial gene position sequence numbers having an operation sequence. Then, according to the operation sequence of the n initial gene position sequence numbers, the n initial gene position sequence numbers and n are subjected to remainder operation in sequence, and therefore the n first gene position sequence numbers with the operation sequence can be determined. Wherein, the n first gene position sequence numbers with the operation precedence order are used for forming a first gene position sequence number combination; the n first gene position sequence numbers with operation sequence are used for assisting gene replacement. And finally, according to the operation sequence of the n first gene position sequence numbers in the first gene position sequence number combination, sequentially replacing the genes corresponding to the n first gene position sequence numbers in the initial filial generation gene sequence with the genes corresponding to the n first gene position sequence numbers in the unused random gene sequence, thereby generating the ordered filial generation candidate set belonging to the ith gene replacement. Wherein n is an integer of 1 or more.

In addition, when the gene replacement is performed for the initial offspring gene sequence for multiple times, more candidate new offspring gene sequences may be generated, so that the number of the gene sequences that new offspring may have is increased, and the selectivity is also increased, so that it is highly possible to determine a gene sequence that a new digital asset having uniqueness has from the more candidate new offspring gene sequences, and thus it is highly possible to generate a gene sequence that a new digital asset has in a determined search space, so that each blockchain node may traverse all the producible offspring, and it may be ensured 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 block chain node point may determine, based on the 1 st gene replacement, the corresponding n first gene position sequence numbers with the operation precedence order, q second gene position sequence numbers with the operation precedence order, which correspond to each of i-1 genes other than the gene corresponding to the 1 st gene replacement, and may determine a plurality of combinations of the second gene position sequence numbers for gene replacement, according to the n first gene position sequence numbers with the operation precedence order and the q second gene position sequence numbers with the operation precedence order, which correspond to each of the other i-1 genes. Then, for each second gene position sequence number combination, if at least one value set exists in the second gene position sequence number combination as an empty set, the gene replacement can not be performed on the initial filial generation gene sequence, and if any value set does not exist in the second gene position sequence number combination as an empty set, the gene corresponding to at least one gene position sequence number included in the second gene position sequence number combination in the initial filial generation gene sequence can be sequentially replaced by the gene corresponding to at least one gene position sequence number in the unused random gene sequence, so that an ordered filial generation candidate set belonging to the ith gene replacement can be generated. Wherein q is an integer of 1 or more.

Furthermore, it should be noted that, in order to avoid the response time of the user requesting to generate the gene sequence of the new descendant to be too long, that is, in order to effectively ensure that the response time of the user requesting to generate the gene sequence of the new descendant is not overtime, thus ensuring that the gene sequence that a new digital asset has is generated within a defined search space, then after the (n-1) th gene replacement of the initial progeny gene sequence, if it is determined that p candidate gene sequences included in the ordered progeny candidate set belonging to the (n-1) th gene replacement generated by the (n-1) th gene replacement for the initial progeny gene sequence are all present in the blockchain, the unused random gene sequence may be determined as the gene sequence that the new digital asset has, therefore, the uniqueness of the gene sequence of the generated new digital asset can be effectively ensured. In addition, in order to effectively avoid the possibility of collision between the subsequently generated offspring and the previously generated offspring and effectively ensure the uniqueness of the gene sequence of the generated new digital asset, after determining the gene sequences of the new digital assets generated for the k digital assets to be synthesized, the use 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 block chain for storage, so that whether the gene sequence of the generated new offspring exists on the block chain can be accurately judged in time through the block chain after the gene sequence of the new offspring is generated. Wherein p is an integer of 1 or more.

Exemplarily, assuming that the unused random gene sequence is G0 and assuming that the initial progeny gene sequence G1 exists on the blockchain, one gene replacement may be performed on the initial progeny gene sequence G1 in advance, i.e., 1 gene from the unused random gene sequence G0 is selected as the mutant gene of the initial progeny gene sequence G1, and the I1 gene of the initial progeny gene sequence G1 is replaced with the I1 gene of the unused random gene sequence G0, wherein I1 takes each value of { I, I +1, …, I + N-1 }% N, I ═ G0% N, and all together have

If the candidate gene sequences are not the gene sequences of the newly synthesized offspring digital assets, the deterministic genetic algorithm is terminated; since indeterminate random numbers cannot be generated in smart contracts, I-G0% N is used to generate an ordered sequence starting from I, on the basis of which, when N is 6, a deterministic sequence can be generated

New progeny genes, such that each block dot is capable of producing the same gene sequence, and checking whether progeny gene sequences are available in the same order. For example, continuing the example of synthesizing a new fuger from the above-mentioned 3 fugers, assuming that the unused random gene sequence G0 is 001010001100011010101101 and the initial child gene sequence G1 is 110100011111011111010000, it is possible to calculate that I0% N001010001100011010101101% 6% 3, so that the value set of I1 is {3,4,5,0,1,2}, replace the corresponding position gene of G1 with the I1 th gene of G0, and take {3,4,5,0,1,2} for I14,5,0,1,2}, generating an ordered progeny candidate set belonging to the first gene replacement, sequentially checking whether each candidate gene sequence in the ordered progeny candidate set already exists on the blockchain, if not, marking the candidate gene sequence as existing (or marked as used) and returning, and simultaneously uploading the marked candidate gene sequence to the blockchain, and if all the candidate gene sequences exist, continuing the next step. Wherein the ordered set of progeny candidates resulting that belong to the first gene replacement is:

1101 0001 1111 0110 1101 0000

1101 0001 1111 0111 1010 0000

1101 0001 1111 0111 1101 1101

0010 0001 1111 0111 1101 0000

1101 1000 1111 0111 1101 0000

1101 0001 0110 0111 1101 0000

for example, assuming that one candidate gene sequence 110100011111011110100000 in the ordered candidate set of descendants belonging to the first gene replacement does not exist on the blockchain, that candidate gene sequence 110100011111011110100000 can be considered to be the gene sequence possessed by the new tiger digital asset.

If none of the candidate gene sequences exists on the blockchain, 2 nd gene replacement can be performed on the initial progeny gene sequence G1, that is, 2 genes are selected from the unused random gene sequence G0 as mutant genes of the initial progeny gene sequence G1, and the I1 th and I2 th genes in the initial progeny gene sequence G1 are replaced by the I1 th and I2 th genes of the unused random gene sequence G0, wherein I1 takes the values of { I, I +1, …, I + N-1 }% N, I is G0% N, I2 is e { I1+1, …, N-1}, and the I is G0% N, and the I is E

This generates an ordered candidate set of progeny that belong to the second gene replacement. Traversing according to the value sequence of i1 and i2, checking whether each candidate gene sequence in the ordered offspring candidate set exists on the blockchain, and if not, determining that the candidate gene sequence is the newly synthesized offspring digital assetHaving a gene sequence, deterministic genetic algorithm termination; the selection of the value mode needs that each blockchain node traverses all the producible descendants, and needs to ensure that the traversal order of each node is consistent, so that the gene sequences of the finally synthesized descendant digital assets are consistent. For example, continuing the example of synthesizing a new fuger from the above-mentioned 3 fugers, assuming that the unused random gene sequence G0 is 001010001100011010101101 and the initial child gene sequence G1 is 110100011111011111010000, it is possible to calculate that I0% N001010001100011010101101% 6% 3, so the value set of I1 is {3,4,5,0,1,2}, and I2 is [ I1+1, N-1}]The method comprises the steps of replacing two genes at corresponding positions of an initial filial gene sequence G1 by two genes in an unused random gene sequence G0, replacing two genes at corresponding positions of an initial filial gene sequence G1 by an i1 gene and an i2 gene in an unused random gene sequence G0, generating an ordered filial candidate set, sequentially checking whether each candidate gene sequence in the ordered filial candidate set exists on a block chain, marking the candidate gene sequence as existing (or used) and returning if the candidate gene sequence does not exist, uploading the marked candidate gene sequence to the block chain, and continuing the next step if the candidate gene sequence exists. Wherein the ordered progeny candidate set generated that belongs to the second gene replacement is:

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

1101 0001 1111 0110 1010 0000

1101 0001 1111 0110 1101 1101

when i1 is 4, and the value set of i2 is {5}, the candidate gene sequences formed after substitution include:

1101 0001 1111 0111 1010 1101

i1 is 5, the value set of i2 is the empty set, in which case no value is available.

When i1 is equal to 0 and the value set of i2 is {1,2,3,4,5}, the candidate gene sequences formed after substitution include:

0010 1000 1111 0111 1101 0000

0010 0001 0110 0111 1101 0000

0010 0001 1111 0110 1101 0000

0010 0001 1111 0111 1010 0000

0010 0001 1111 0111 1101 1101

when i1 is 1, and the value set of i2 is {2,3,4,5}, the candidate gene sequences formed after substitution include:

1101 1000 0110 0111 1101 0000

1101 1000 1111 0110 1101 0000

1101 1000 1111 0111 1010 0000

1101 1000 1111 0111 1101 1101

when i1 is 2, and the value set of i2 is {3,4,5}, the candidate gene sequences formed after substitution include:

1101 0001 0110 0110 1101 0000

1101 0001 0110 0111 1010 0000

1101 0001 0110 0111 1101 1101

for example, assuming that one candidate gene sequence 110110001111011011010000 in the ordered candidate set of descendants belonging to the second gene replacement does not exist on the blockchain, that candidate gene sequence 110110001111011011010000 can be considered as the gene sequence possessed by the new tiger digital asset.

If none of the candidate gene sequences is present on the blockchain, the 3 rd gene replacement can be performed for the initial progeny gene sequence G1, i.e., the above-described operation is repeated until N-1 genes are selected from the random gene sequence G0 that has not been used as the mutant genes of the initial progeny gene sequence G1, and the I1, I2, …, I (N-1) genes in the initial progeny gene sequence G1 are replaced with the I1, I2, …, I (N-1) genes of the random gene sequence G0 that has not been used, wherein I1 takes the respective values of { I, I +1, …, I + N-1 }% N, I2 ∈ 1+1, …, N-1}, …, I (N-1) { I (N-2) +1, …, N-1}, and there is a total of { I ∈ (N-2) +1, N-1}

In this way, an ordered candidate set of descendants belonging to the third gene replacement can be generated, wherein the values are taken in the order of i1And traversing, so as to check whether each candidate gene sequence in the ordered offspring candidate set exists on the block chain, and if the candidate gene sequence does not exist, namely the gene sequence of the newly synthesized offspring digital asset, terminating the deterministic genetic algorithm. For example, 3 genes in the unused random gene sequence G0 are used to replace the corresponding position gene of the initial progeny gene sequence G1, the i1, i2 and i3 genes are used to replace the corresponding position gene of G1, and i1 is taken as [3,4,5,0,1,2]]I2 is [ i1+1,5]]I3 is [ i2+1,5]]The ordered candidate set of descendants is generated, whether each candidate gene sequence in the ordered candidate set of descendants already exists on the blockchain is checked in sequence, if not, the candidate gene sequence is marked as existing (or marked as used) and returned, meanwhile, the marked candidate gene sequence is uploaded to the blockchain, and if all the candidate gene sequences exist, the next step is continued. Wherein the ordered set of progeny candidates resulting that belong to the third gene replacement is:

when i1 is 3, i2 is 4, and i3 is 5, the sequences of the candidate genes formed after the substitution are as follows:

1101 0001 1111 0110 1010 1101

i1 ═ 4, i2 ═ 5, i3 { }, and i3 is empty set { }.

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

When i1 is 0, i2 is 1, and i3 is {2,3,4,5}, the sequences of candidate genes formed after 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

when i1 is 0, i2 is 2, and i3 is {3,4,5}, the sequences of candidate genes formed after substitution are as follows:

0010 0001 0110 0110 1101 0000

0010 0001 0110 0111 1010 0000

0010 0001 0110 0111 1101 1101

when i1 is 0, i2 is 3, and i3 is {4,5}, the sequences of candidate genes formed after substitution are as follows:

0010 0001 1111 0110 1010 0000

0010 0001 1111 0110 1101 1101

when i1 is 0, i2 is 4, and i3 is 5, the sequences of the candidate genes formed after the substitution are as follows:

0010 0001 1111 0111 1010 1101

i1 ═ 0, i2 ═ 5, i3 { }, and i3 is empty set { }.

When i1 is 1, i2 is 2, and i3 is {3,4,5}, the sequences of candidate genes formed after substitution are as follows:

1101 1000 0110 0110 1101 0000

1101 1000 0110 0111 1010 0000

1101 1000 0110 0111 1101 1101

when i1 is 1, i2 is 3, and i3 is {4,5}, the sequences of candidate genes formed after substitution are as follows:

1101 1000 1111 0110 1010 0000

1101 1000 1111 0110 1101 1101

when i1 is 1, i2 is 4, and i3 is 5, the sequences of the candidate genes formed after the substitution are as follows:

1101 1000 1111 0111 1010 1101

i1 ═ 1, i2 ═ 5, i3 { }, and i3 is empty set { }.

When i1 is 2, i2 is 3, and i3 is {4,5}, the sequences of candidate genes formed after substitution are as follows:

1101 0001 0110 0110 1010 0000

1101 0001 0110 0110 1101 1101

when i1 is 2, i2 is 4, and i3 is 5, the sequences of the candidate genes formed after the substitution are as follows:

1101 0001 0110 0111 1010 1101

i1 ═ 2, i2 ═ 5, i3 { }, and i3 is an empty set { }.

For example, assuming that one candidate gene sequence 110110000110011110100000 in the ordered candidate set of descendants belonging to the third gene replacement does not exist on the blockchain, that candidate gene sequence 110110000110011110100000 can be considered to be the gene sequence possessed by the new tiger digital asset.

If none of the candidate gene sequences exists on the block chain, 4 th gene replacement can be performed on the initial progeny gene sequence G1, that is, 4 genes are selected from the unused random gene sequence G0 as mutant genes of the initial progeny gene sequence G1, that is, 4 genes in the unused random gene sequence G0 are used to replace corresponding position genes in the initial progeny gene sequence G1, i1, i2, i3, i4 genes of the unused random gene sequence G0 are used to replace corresponding position genes in the initial progeny gene sequence G1, i1 is taken to [3,4,5,0,1,2], i2 is taken to [ i1+1,5], i3 is taken to [ i2+1,5], i4 is taken to [ i3+1,5], thus generating a fourth-time gene-replaced ordered progeny candidate set, and whether each candidate gene in the ordered progeny gene set has a block chain on the candidate chain already exists in order is checked, if not, the candidate gene sequence is marked as existing (or marked as used) and returned, and the marked candidate gene sequence is uploaded to a block chain, and if all the candidate gene sequences exist, the next step is continued. Wherein the ordered set of progeny candidates resulting that belong to the fourth gene replacement is:

i1 { } 3, i2 { (4), i3 { (5), and i4 { }.

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

i 1-4, i 2-5, i3, i4 are both empty sets { }.

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

When i1 is 0, i2 is 1, i3 is 2, and i4 is {3,4,5}, the sequences of candidate genes formed after replacement are:

0010 1000 0110 0110 1101 0000

0010 1000 0110 0111 1010 0000

0010 1000 0110 0111 1101 1101

when i1 is 0, i2 is 1, i3 is 3, and i4 is {4,5}, the sequences of candidate genes formed after the substitution are:

0010 1000 1111 0110 1010 0000

0010 1000 1111 0110 1101 1101

when i1 is 0, i2 is 1, i3 is 4, and i4 is 5, the sequences of the candidate genes formed after the substitution are as follows:

0010 1000 1111 0111 1010 1101

when i1 is 0, i2 is 2, i3 is 3, and i4 is {4,5}, the sequences of candidate genes formed after the substitution are as follows:

0010 0001 0110 0110 1010 0000

0010 0001 0110 0110 1101 1101

when i1 is 0, i2 is 2, i3 is 4, and i4 is 5, the sequences of the candidate genes formed after the substitution are as follows:

0010 0001 0110 0111 1010 1101

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

When i1 is 0, i2 is 3, i3 is 4, and i4 is 5, the sequences of candidate genes formed after substitution are as follows:

0010 0001 1111 0110 1010 1101

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

When i1 is 1, i2 is 2, i3 is 3, and i4 is {4,5}, the sequences of candidate genes formed after the substitution are as follows:

1101 1000 0110 0110 1010 0000

1101 1000 0110 0110 1101 1101

when i1 is 1, i2 is 2, i3 is 4, and i4 is 5, the sequences of the candidate genes formed after the substitution are as follows:

1101 1000 0110 0111 1010 1101

when i1 is 1, i2 is 3, i3 is 4, and i4 is 5, the sequences of the candidate genes formed after the substitution are as follows:

1101 1000 1111 0110 1010 1101

when i1 is 2, i2 is 3, i3 is 4, and i4 is 5, the sequences of the candidate genes formed after the substitution are as follows:

1101 0001 0110 0110 1010 1101

for example, assuming that one candidate gene sequence 001000011111011010101101 in the ordered candidate set of descendants that belongs to the fourth gene replacement does not exist on the blockchain, that candidate gene sequence 001000011111011010101101 can be considered to be the gene sequence possessed by the new tiger digital asset.

If none of the candidate gene sequences exists on the block chain, 5 th gene replacement can be performed on the initial progeny gene sequence G1, that is, 5 genes are selected from the unused random gene sequence G0 as mutant genes of the initial progeny gene sequence G1, that is, 5 genes in the unused random gene sequence G0 are used to replace corresponding position genes in the initial progeny gene sequence G1, i1, i2, i3, i4, i5 genes of the unused random gene sequence G0 are used to replace corresponding position genes in the initial progeny gene sequence G1, i1 is taken [3,4,5,0,1,2], i2 is taken [ i1+1,5], i3 is taken [ i2+1,5], i4 is taken [ i3+1,5], i5 is taken [ i4+1,5], that is the following five times of ordered progeny gene replacement candidate sets belonging to the fifth gene replacement, and sequentially checking whether each candidate gene sequence in the ordered descendant candidate set exists on the block chain, if not, marking the candidate gene sequence as existing (or marked as used) and returning, meanwhile, uploading the marked candidate gene sequence to the block chain, and if all the candidate gene sequences exist, continuing the next step. Wherein the ordered progeny candidate set resulting for the fifth gene replacement is:

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

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

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

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

0010 1000 0110 0110 1010 0000

0010 1000 0110 0110 1101 1101

when i1 is 0, i2 is 1, i3 is 2, i4 is {4}, i5 is {5}, the sequences of candidate genes formed after replacement are as follows:

0010 1000 0110 0111 1010 1101

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

When i1 is 0, i2 is 1, i3 is 3, i4 is {4}, i5 is {5}, the sequences of candidate genes formed after replacement are as follows:

0010 1000 1111 0110 1010 1101

when i1 is 0, i2 is 2, i3 is 3, i4 is {4} and i5 is {5}, the sequences of candidate genes formed after replacement are as follows:

0010 0001 0110 0110 1010 1101

when i1 is 1, i2 is 2, i3 is 3, i4 is {4} and i5 is {5}, the sequences of candidate genes formed after replacement are as follows:

1101 1000 0110 0110 1010 1101

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

For example, assuming that one candidate gene sequence 001010000110011011011101 in the ordered candidate set of descendants belonging to the fifth gene replacement does not exist on the blockchain, that candidate gene sequence 001010000110011011011101 can be considered to be the gene sequence possessed by the new tiger digital asset. If none of the candidate gene sequences in the generated ordered progeny candidate set belonging to the fifth gene replacement exists on the blockchain, the unused random gene sequence G0 ═ 001010001100011010101101 can be directly used as the gene sequence possessed by the new fuger digital asset, because the unused random gene sequence does not exist on the blockchain, thereby generating the gene sequence possessed by the new digital asset, the deterministic genetic algorithm is terminated, and the unused random gene sequence is marked as existing (or marked as used) and uploaded to the blockchain. In this way, the scheme can meet the requirement of generating the gene sequence of the new digital asset in a determined search space, and can effectively ensure the uniqueness of the gene sequence of the generated new digital asset.

The above embodiment shows that, in the technical scheme of the present invention, the same unused random gene sequence is generated for each block link point by the client, that is, each block link point can perform gene replacement for the initial progeny gene sequence in the same replacement manner, so that the situation that the gene sequences of the new digital assets generated by each block link point are inconsistent due to different generated random numbers can be avoided, and the uniqueness of the gene sequences of the generated new digital assets can be effectively ensured. Specifically, for any blockchain node, when the blockchain node detects a digital asset synthesis transaction, the blockchain node performs exclusive or operation on gene sequences of k digital assets to be synthesized in the digital asset synthesis transaction, so as to generate an initial progeny gene sequence. Then, when the initial filial generation gene sequence does not exist on the block chain, taking the initial filial generation gene sequence as the gene sequence of the new digital asset; when the initial filial generation gene sequence exists on the block chain, the ith gene replacement can be carried out on the initial filial generation gene sequence according to a set gene replacement mode and based on the unused random gene sequence, and an ordered filial generation candidate set belonging to the ith gene replacement is generated, so that whether a certain candidate gene sequence does not exist on the block chain in the ordered filial generation candidate set can be effectively judged. If all candidate gene sequences in the ordered offspring candidate set are judged to exist on the block chain, the gene replacement for the (i + 1) th time can be carried out on the initial offspring gene sequence based on the unused random gene sequence until the gene replacement for the (n-1) th time is carried out on the initial offspring gene sequence, so that the gene sequence of a new digital asset generated aiming at k digital assets to be synthesized can be determined. Therefore, the scheme can meet the requirement that the gene sequences of the new digital assets are generated in a determined search space, and whether the candidate gene sequences in the ordered descendant candidate set exist on the block chain or not is judged aiming at the ordered descendant candidate set generated by a certain gene replacement, so that the problem that the currently generated gene sequences and the previously generated gene sequences conflict can be effectively avoided, and the user response time can be effectively ensured not to be overtime. In addition, according to the scheme, as the same unused random gene sequence is generated for each block chain link point through the client, each block chain link point can perform gene replacement on the initial filial gene sequence according to the same replacement mode, the execution results of the gene sequences of the generated new digital assets on different block chain link points can be effectively ensured to be consistent, and the problem that the existing genetic algorithm cannot be applied to the block chain due to the fact that the random numbers generated by each block chain link point are different in the prior art can be solved.

Based on the same technical concept, fig. 3 exemplarily illustrates a block chain-based digital asset synthesis apparatus that can perform the flow of a block chain-based digital asset synthesis method according to an embodiment of the present invention. The digital asset synthesis method based on the block chain is suitable for a block chain network with m block chain nodes; the block chain-based digital asset synthesis apparatus may be a service device or a component (such as a chip or an integrated circuit) capable of supporting the service device to implement the functions required by the method, or may be other electronic devices having the functions required by the method. Wherein m is an integer greater than 1.

As shown in fig. 3, the apparatus includes:

a generating unit 301, configured to perform, for any blockchain node, when a digital asset synthesis transaction is detected, an exclusive or operation on gene sequences of k digital assets to be synthesized in the digital asset synthesis transaction, so as to generate an initial progeny gene sequence; the digital asset synthesis transaction is determined by the client based on the gene sequences of k digital assets to be synthesized and an unused random gene sequence generated by the client; each digital asset to be synthesized has a gene sequence comprising n genes and the unused random gene sequence;

a processing unit 302, configured to, when it is determined that the initial progeny gene sequence exists on the blockchain, perform, according to a set gene replacement manner, an ith gene replacement on the initial progeny gene sequence based on the unused random gene sequence, and generate an ordered progeny candidate set belonging to the ith gene replacement; the ordered progeny candidate set belonging to the ith gene replacement comprises j candidate gene sequences; if j candidate gene sequences are determined to be present in the block chain, performing gene replacement for the initial filial generation gene sequence for the (i + 1) th time based on the unused random gene sequence until the initial filial generation gene sequence is subjected to the gene replacement for the (n-1) th time, so as to determine the gene sequence of a new digital asset generated aiming at the k digital assets to be synthesized.

Optionally, the processing unit 302 is specifically configured to:

Optionally, the processing unit 302 is further configured to:

Optionally, the processing unit 302 is specifically configured to:

the processing unit 302 is specifically configured to:

Optionally, the processing unit 302 is specifically configured to:

determining a plurality of second gene position sequence number combinations for gene replacement according to the n first gene position sequence numbers with the operation precedence order and the q second gene position sequence numbers with the operation precedence order corresponding to the other i-1 genes;

the processing unit 302 is specifically configured to:

Optionally, the processing unit 302 is further configured to:

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

In an embodiment of the present invention, the memory 402 stores instructions executable by the at least one processor 401, and the at least one processor 401 may perform the steps included in the aforementioned method for synthesizing digital assets based on a blockchain by executing the instructions stored in the memory 402.

The processor 401 is a control center of the computing device, and may be connected to various parts of the computing device through various interfaces and lines, and may perform data processing by executing 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, and the processor 401 may integrate an application processor and a modem processor, where the application processor mainly processes an operating system, a user interface, an application program, and the like, and the modem processor mainly processes an issued instruction. It will be appreciated that the modem processor described above may not be integrated into the processor 401. In some embodiments, processor 401 and memory 402 may be implemented on the same chip, or in some embodiments, they may be implemented separately on separate chips.

The processor 401 may be a general-purpose processor, such as a Central Processing Unit (CPU), a digital signal processor, an Application Specific Integrated Circuit (ASIC), a field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof, configured to implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present invention. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the disclosed method in connection with the blockchain-based digital asset synthesis method embodiment may be embodied directly in a hardware processor, or in a combination of hardware and software modules within the processor.

Memory 402, which is a non-volatile computer-readable storage medium, may be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. The Memory 402 may include at least one type of storage medium, and may include, for example, a flash Memory, a hard disk, a multimedia card, a card-type Memory, a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Programmable Read Only Memory (PROM), a Read Only Memory (ROM), a charge Erasable Programmable Read Only Memory (EEPROM), a magnetic Memory, a magnetic disk, an optical disk, and so on. The memory 402 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to such. The memory 402 of embodiments of the present invention may also be circuitry or any other device capable of performing a storage function to store program instructions and/or data.

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

As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present 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 flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present application and their equivalents, the present invention is also intended to include such modifications and variations.

Claims

1. A blockchain-based digital asset synthesis method, adapted to a blockchain network having m blockchain nodes, the method comprising:

2. The method of claim 1, wherein performing an ith gene replacement on the initial progeny gene sequence based on the unused random gene sequence to generate an ordered set of progeny candidate that belong to the ith gene replacement comprises:

3. The method of claim 1, further comprising:

4. The method of claim 1, further comprising, after the n-1 gene replacement of the initial progeny gene sequence:

5. The method of claim 2, wherein the blockware dots interchange i genes in the unused random gene sequence with i genes at corresponding positions in the initial progeny gene sequence to generate an ordered progeny candidate set belonging to an i-th gene replacement, comprising:

6. The method of claim 5, wherein the blockchain node determining at least one gene location sequence number combination for gene replacement based on the unused random gene sequence and the n, comprises:

7. The method of claim 6, wherein the blockchain node determining at least one gene location sequence number combination for gene replacement based on the unused random gene sequence and the n, comprises:

the block chain node determines a plurality of second gene position sequence number combinations for gene replacement according to the n first gene position sequence numbers with operation precedence order and the q second gene position sequence numbers with operation precedence order corresponding to the other i-1 genes;

8. The method of claim 1, after determining the gene sequences that new digital assets generated for the k digital assets to be synthesized have, further comprising:

9. A blockchain-based digital asset synthesis apparatus adapted to a blockchain network having m blockchain nodes, the apparatus comprising:

10. A computing device comprising 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 of any 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 program, when run on the computing device, causes the computing device to carry out the method of any one of claims 1 to 8.