CN116383836A - Block generation method and block generation verification method applied to metauniverse - Google Patents
Block generation method and block generation verification method applied to metauniverse Download PDFInfo
- Publication number
- CN116383836A CN116383836A CN202211062916.0A CN202211062916A CN116383836A CN 116383836 A CN116383836 A CN 116383836A CN 202211062916 A CN202211062916 A CN 202211062916A CN 116383836 A CN116383836 A CN 116383836A
- Authority
- CN
- China
- Prior art keywords
- block
- meta
- target
- metauniverse
- hash value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 74
- 238000012795 verification Methods 0.000 title claims abstract description 54
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 21
- 239000004973 liquid crystal related substance Substances 0.000 claims description 7
- 238000004321 preservation Methods 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 11
- 238000004891 communication Methods 0.000 description 8
- 238000004590 computer program Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 6
- 238000012545 processing Methods 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 4
- 238000012797 qualification Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 238000013507 mapping Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 230000003993 interaction Effects 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000003190 augmentative effect Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 238000005065 mining Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
- 230000001131 transforming effect Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/604—Tools and structures for managing or administering access control systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/2141—Access rights, e.g. capability lists, access control lists, access tables, access matrices
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Health & Medical Sciences (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- Databases & Information Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a block generation method and a block generation verification method applied to metauniverse, and relates to the technical field of block chains. The method comprises the following steps: acquiring a plurality of first hash values stored in the candidate area block, and calculating a first numerical value according to the plurality of first hash values according to a preset algorithm; determining a target block with a block sequence number of a first value, and determining target meta-universe content stored in the target block and a second hash value corresponding to the target meta-universe content; determining whether the computing node itself stores the target meta-universe content and the second hash value; generating a new block according to the alternative block under the condition that the determination is yes; broadcasting a block generation message carrying the block information of the new block and the access link of the target block to the blockchain network, so that other participating nodes in the blockchain network verify the block generation message by using the access link, and recording the block information of the new block under the condition that the verification is passed. The method can increase the preservation rate of the meta-universe content.
Description
Technical Field
The invention relates to the technical field of blockchain, in particular to a block generation method and a block generation verification method applied to metauniverse.
Background
Metauniverse (Metaverse) is a virtual world that is linked and created by technological means, mapped and interacted with the real world, and has a digital living space of a novel social system. The metauniverse is essentially a process of virtualizing and digitizing the real world, in which a great deal of modification is required for content production, economic systems, user experience, and physical world content. But the development of the metauniverse is progressive, and is finally formed by continuous fusion and evolution of a plurality of tools and platforms under the support of shared infrastructure, standards and protocols. It provides an immersive experience based on the augmented reality technology, generates a real world image based on the digital twin technology, and allows each user to perform content production and world editing, thus necessarily requiring the metauniverse to be decentralised, so that the blockchain network can be applied in the metauniverse, and besides transactions in the metauniverse, since the content constituting the metauniverse is data constructed based on the digital technology, a large amount of data is necessarily brought in the process of producing the metauniverse content by each user.
Currently, meta-universe content is saved into the blockchain in such a way that: the meta-cosmic content is hashed to generate a hash value corresponding to the meta-cosmic content, and each node in the blockchain network only stores the hash value and does not store the meta-cosmic content, but in this way, each node in the blockchain network only stores the hash value of the meta-cosmic content in order to reduce the stored data amount, so that the finally actual meta-cosmic content is lost from the blockchain network.
Disclosure of Invention
Therefore, the invention provides a block generation method and a block generation verification method applied to metauniverse, which are used for solving the problem that in the prior art, each node in a block chain network does not store actual metauniverse content, and finally, the metauniverse content is lost in the block chain network.
To achieve the above object, in a first aspect, the present invention provides a block generation method applied to a metauniverse, the method being applied to any computing node of a blockchain network; a block in the block chain network stores a plurality of metauniverse contents and a plurality of hash values corresponding to the metauniverse contents one by one; the method comprises the following steps:
acquiring a plurality of first hash values stored in an alternative block, and calculating a first numerical value according to a preset algorithm according to the plurality of first hash values, wherein the first hash values comprise hash values corresponding to block heads of the alternative block and hash values corresponding to meta-space content stored in the alternative block;
Determining a target block with a block sequence number of the first value, and determining target meta-universe content stored in the target block and a second hash value corresponding to the target meta-universe content;
determining whether the computing node itself stores the target meta-universe content and the second hash value;
generating a new block according to the alternative block under the condition that the determination is yes;
broadcasting a block generation message carrying the block information of the new block and the access link of the target block to the blockchain network, so that other participating nodes in the blockchain network verify the block generation message by using the access link, and recording the block information of the new block under the condition that the verification is passed.
In some examples, the obtaining the plurality of first hash values stored in the candidate block, and calculating the first numerical value according to a preset algorithm according to the plurality of first hash values includes:
calculating a third hash value according to the first hash values;
dividing the third hash value by the block sequence number of the candidate block, and taking the remainder as the first numerical value.
In some examples, the generating a new block from the candidate block includes:
Calculating a fourth hash value according to the meta-universe content stored in the candidate block, the target meta-universe content stored in the target block and the random number;
comparing the fourth hash value with a preset difficulty value;
and generating a new block according to the alternative block under the condition that the fourth hash value is smaller than the preset difficulty value.
In some examples, before the obtaining the plurality of first hash values stored in the candidate block and calculating the first numerical value according to the preset algorithm according to the plurality of first hash values, the method further includes:
aiming at historical meta-universe content released by other participating nodes in any blockchain network, acquiring the historical meta-universe content and a hash value corresponding to the historical meta-universe content;
performing hash operation on the historical meta-universe content to generate a verification hash value;
verifying the hash value corresponding to the historical meta-universe content according to the verification hash value;
and in the case of passing the verification, storing the historical meta-universe content.
In a second aspect, the present invention provides a block generation verification method applied to a metauniverse, the method being applied to any participating node of a blockchain network; a block in the block chain network stores a plurality of metauniverse contents and a plurality of hash values corresponding to the metauniverse contents one by one; the method comprises the following steps:
Receiving a block generation message which is sent by a computing node and carries new block information of a new block generated by the computing node and an access link of a target block, wherein the block generation message is determined according to the method;
validating the block generation message using the access link;
and recording the block information of the new block under the condition that verification is passed.
In some examples, the validating the chunk generation message using the access link includes:
accessing the target block according to the access link, and acquiring target meta-universe content stored in the target block and a second hash value corresponding to the target meta-universe content;
and verifying whether the computing node stores the second hash value corresponding to the target meta-universe content and the target meta-universe content according to the target meta-universe content and the second hash value.
In a third aspect, the present invention provides a block generating apparatus applied to a metauniverse, the apparatus being applied to a blockchain network, blocks in the blockchain network storing a plurality of metauniverse contents and a plurality of hash values corresponding to the plurality of metauniverse contents one by one; the device comprises:
The acquisition module is used for acquiring a plurality of first hash values stored in the candidate block and calculating a first numerical value according to a preset algorithm according to the plurality of first hash values, wherein the first hash values comprise hash values of block heads corresponding to the candidate block and hash values corresponding to meta-universe content stored in the candidate block;
the determining module is used for determining a target block with a block serial number of the first value and determining target meta-universe content stored in the target block and a second hash value corresponding to the target meta-universe content;
the judging module is used for determining whether the computing node stores the target meta-universe content and the second hash value or not;
the generation module is used for generating a new block according to the alternative block under the condition that the determination is yes;
and the sending module is used for broadcasting the block generation message carrying the block information of the new block and the access link of the target block to the blockchain network so that other participating nodes in the blockchain network can verify the block generation message by using the access link, and the block information of the new block is recorded under the condition that the verification is passed.
In a third aspect, the present invention provides a block generation verification apparatus applied to a metauniverse, the apparatus being applied to a blockchain network, blocks in the blockchain network storing a plurality of metauniverse contents and a plurality of hash values corresponding to the plurality of metauniverse contents one by one; the device comprises:
a receiving module, configured to receive a block generation message sent by a computing node and carrying block information of a new block generated by the computing node and an access link of a target block, where the block generation message is determined according to the method of any one of claims 1-4;
the verification module is used for verifying the block generation message by using the access link;
and the recording module is used for recording the block information of the new block under the condition that the verification is passed.
In a fifth aspect, the present invention provides an electronic device, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein, the liquid crystal display device comprises a liquid crystal display device,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method described above.
In a sixth aspect, the present invention provides a non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the above-described method.
The invention has at least the following advantages:
according to the block generation method and the block generation verification method applied to the metauniverse, the target block is selected through the first hash value stored in the candidate block, whether the current computing node stores the metauniverse content and the hash value corresponding to the metauniverse content in the target block or not is verified, if the current computing node stores the metauniverse content and the corresponding hash value, the qualification of generating a new block is achieved, namely the accounting right is obtained, and in this way, the probability that the more the stored metauniverse content is obtained by the computing node is larger, so that the storing of the metauniverse content and the hash value of the metauniverse content by each computing node is encouraged, and the storing rate of the metauniverse content can be increased, and the possibility of losing the metauniverse content is effectively reduced.
Drawings
The accompanying drawings are included to provide a further understanding of the invention, and are incorporated in and constitute a part of this specification, illustrate the invention and together with the description serve to explain, without limitation, the invention.
FIG. 1 is a flowchart of a block generation method applied to a metauniverse according to the present invention;
FIG. 2 is a flowchart of a block generation verification method applied to a metauniverse according to the present invention;
FIG. 3 is a block chain network architecture diagram provided in accordance with the present invention;
FIG. 4 is a block generating apparatus applied to the meta-universe according to the present invention;
FIG. 5 is a block generation verification device applied to meta-universe according to the present invention;
fig. 6 is a schematic structural diagram of an electronic device according to the present invention.
Detailed Description
The present invention will be described in further detail below with reference to the drawings and detailed description for the purpose of better understanding of the technical solution of the present invention to those skilled in the art.
It is to be understood that the specific embodiments and figures described herein are merely illustrative of the invention, and are not limiting of the invention.
It is to be understood that the various embodiments of the invention and the features of the embodiments may be combined with each other without conflict.
It is to be understood that only the portions relevant to the present invention are shown in the drawings for convenience of description, and the portions irrelevant to the present invention are not shown in the drawings.
It should be understood that each unit and module in the embodiments of the present invention may correspond to only one physical structure, may be formed by a plurality of physical structures, or may be integrated into one physical structure.
It will be appreciated that, without conflict, the functions and steps noted in the flowcharts and block diagrams of the present invention may occur out of the order noted in the figures.
It is to be understood that the flowcharts and block diagrams of the present invention illustrate the architecture, functionality, and operation of possible implementations of systems, apparatuses, devices, methods according to various embodiments of the present invention. Where each block in the flowchart or block diagrams may represent a unit, module, segment, code, or the like, which comprises executable instructions for implementing the specified functions. Moreover, each block or combination of blocks in the block diagrams and flowchart illustrations can be implemented by hardware-based systems that perform the specified functions, or by combinations of hardware and computer instructions.
It should be understood that the units and modules related in the embodiments of the present invention may be implemented by software, or may be implemented by hardware, for example, the units and modules may be located in a processor.
In a first aspect, referring to fig. 1, fig. 1 shows a flowchart of a block generation method applied to a metauniverse, where the method is applied to any computing node of a blockchain network, and the blockchain network includes a plurality of computing nodes and participating nodes, and the blockchain network is applied in the metauniverse and is used for recording hash values corresponding to transactions generated by each user in the metauniverse, and recording hash values corresponding to metauniverse contents of the metauniverse.
The meta-universe content is data of any component element in the meta-universe, the meta-universe is interacted based on the meta-universe content, the meta-universe content is virtual model data and the like, and the meta-universe content can be the data of the component element or can be a link capable of accessing the component element. To store the meta-cosmic content in the blockchain network, firstly, the meta-cosmic content needs to be hashed to generate a hash value corresponding to the meta-cosmic content, then, a mapping relation between the meta-cosmic content and the hash value is generated, and a block in the blockchain network can only record the hash value and the mapping relation between the hash value and the meta-cosmic content, or can store the meta-cosmic content, the hash value of the meta-cosmic content and the mapping relation between the hash value and the meta-cosmic content, in other words, a block in the blockchain network stores a plurality of meta-cosmic contents and a plurality of hash values corresponding to the meta-cosmic contents one by one.
As shown in fig. 1, the method comprises the steps of:
s11, acquiring a plurality of first hash values stored in the candidate area block, and calculating a first numerical value according to the plurality of first hash values according to a preset algorithm.
The first hash value includes a hash value of a block header of the corresponding candidate block and a hash value corresponding to meta-universe content stored in the candidate block, and may further include a hash value corresponding to a transaction record. That is, the first hash value obtained by the computing node includes all hash values in the candidate block.
Prior to S11, the method further comprises:
step one, aiming at historical meta-universe contents issued by other participating nodes in any blockchain network, obtaining the historical meta-universe contents and hash values corresponding to the meta-universe contents.
All participating nodes in the blockchain network can publish meta-universe content, referred to herein as historical meta-universe content, on the blockchain network in the following manner: generating a hash value of the historical meta-universe content; generating a release content message carrying historical meta-universe content and hash values of the historical meta-universe content, and signing the release content message by using a private key of a participating node; and broadcasting the signed historical published content information to a blockchain network.
The participating nodes release the meta-universe content (i.e. the historical meta-universe content) to pay a certain fee, and the fee is proportional to the data size of the meta-universe content so as to prevent malicious release of the content. After any participating node issues the meta-universe content through the issued content message, the computing node which is to strive for the accounting right receives the issued content message and acquires the meta-universe content in the issued content message and the hash value corresponding to the meta-universe content.
And secondly, carrying out hash operation on the historical meta-universe content to generate a verification hash value.
The computing node carries out hash operation on the historical element universe content obtained in the step one according to a agreed hash algorithm (the hash algorithm which is the same as the hash algorithm for generating the hash value of the historical element universe content) to generate a new verification hash value.
And step three, verifying the hash value corresponding to the historical meta-universe content according to the verification hash value.
And judging whether the verification hash value is consistent with the hash value of the historical meta-universe content in the first substep.
And fourthly, under the condition that verification is passed, storing historical meta-universe content.
If the hash value is verified to be consistent with the hash value of the historical meta-universe content in the first step, the verification is passed, and the computing node can select and store the historical meta-universe content and the hash value corresponding to the historical meta-universe content. The more historical metauniverse content and hash values corresponding to the historical metauniverse content are saved by the computing nodes, the greater the probability of subsequently obtaining qualification of generating new blocks, so that each computing node can be encouraged to save real metauniverse content.
In some examples, S11 includes:
and step one, calculating a third hash value according to the first hash values.
After the computing node obtains all the first hash values encapsulated in the candidate block, hash operation is performed according to a agreed hash algorithm (the same hash algorithm as the hash algorithm for generating the first hash value), and a new third hash value is generated.
And step two, dividing the third hash value by the block sequence number of the alternative block, taking the remainder, and taking the remainder as a first numerical value.
Dividing the first hash value generated in the first sub-step by the block serial number of the candidate block, and then taking the remainder of the result to obtain a first value, wherein the first value is determined by adopting all the first hash values of the candidate block and the candidate block to the block serial number, so that the target block is random, and the target block can be random according to the first value, so that the reliability of the method is ensured.
S12, determining a target block with a block sequence number of a first value, and determining target meta-universe content stored in the target block and a second hash value corresponding to the target meta-universe content.
In the first and second steps, a random first value is determined for the block sequence number by using all the first hash values of the candidate block and the candidate block, then the first data is used as the block sequence number, the block with the block sequence number of the first value is searched for as the target block, then the target block is determined which target meta-universe contents are stored, and the second hash value corresponding to the target meta-universe contents is determined.
S13, determining whether the computing node stores the target meta-universe content and the second hash value.
In the blockchain network structure stored in the computing node, searching the second hash value corresponding to the target meta-universe content and the target meta-universe content in the S12, and if the second hash value corresponding to the same target meta-universe content and the target meta-universe content is searched, indicating that the computing node has saved the meta-universe content corresponding to the target block before (specifically, saving according to the steps one to three).
And S14, under the condition that the computing node is determined to store the target meta-universe content and the second hash value, generating a new block according to the alternative block.
After determining that the computing node stores the target meta-universe content and the second hash value of the target node, the computing node is preliminarily determined to be qualified for generating a new block, and further, verification of the difficulty value is required.
Specifically, S14 includes:
and step one, calculating a fourth hash value according to the meta-universe content stored in the candidate block, the target meta-universe content stored in the target block and the random number.
The meta-universe content stored in the candidate block and the target meta-universe content stored in the target block are obtained, a random number is randomly generated, a new fourth hash value is calculated by adopting the meta-universe content, the hash algorithm for calculating the fourth hash value can be consistent with the hash algorithm for generating the hash value of the block head of the candidate block.
And step two, comparing the fourth hash value with a preset difficulty value.
Each block has a difficulty value, the difficulty value determines how many times the computing node needs to perform hash operation to generate a legal block, and the computing node uses a hash function to perform hash operation by adjusting random numbers and continuously transforming the block head to find out the hash value of a specific specification. The difficulty value in the second substep is the difficulty value of the candidate block. Comparing the fourth hash value generated in sub-step one with the magnitude of the difficulty value.
And thirdly, generating a new block according to the alternative block under the condition that the fourth hash value is smaller than the preset difficulty value.
And under the condition that the fourth hash value is smaller than the preset difficulty value, determining that the generation of the new block is successful, namely, the calculation node obtains the accounting right, the calculation node changes the alternative block into the new block, and adds the new block into the chain structure of the blockchain network, and the calculation node obtains the corresponding mining rewards.
And S15, broadcasting a block generation message carrying the block information of the new block and the access link of the target block to the blockchain network, so that other participating nodes in the blockchain network verify the block generation message by using the access link, and recording the block information of the new block under the condition that the verification is passed.
The computing node generates a block generation message for the new block according to the generated block information (such as the hash value of the block header, the stored meta-universe content and the hash value of the meta-universe content) of the new block and the access connection of the target block, and signs the block generation message through the private key of the computing node; broadcasting the signed block generation message to a blockchain network.
After receiving the block generation message, other participating nodes in the blockchain network verify the signature of the block generation message by adopting the private key of the computing node, after the verification is passed, further, access the target block by adopting an access link in the block generation message, obtain the meta-universe content stored in the target block and the hash value (the second hash value) corresponding to the meta-universe content, verify whether the computing node stores the meta-universe content stored in the target block and the hash value corresponding to the meta-universe content, and if the computing node determines that the computing node stores the meta-universe content stored in the target block and the hash value corresponding to the meta-universe content, the verification is passed, and the new block generated at this time is determined to be valid, and then the block information of the new block is recorded.
It should be noted that, in the present method, each hash value (including the first to fifth hash values) is generated by using the same hash algorithm.
It should be noted that, in the method, for any computing node that is executing the method to generate a block, other nodes in the blockchain network may be referred to as participating nodes, where the participating nodes are functionally classified, and the participating nodes may be computing nodes or general nodes that only participate in voting and do not participate in accounting.
According to the block generation method applied to the metauniverse, the target block is selected through the first hash value stored in the candidate block, whether the current computing node stores the metauniverse content and the hash value corresponding to the metauniverse content in the target block or not is verified, if the current computing node stores the metauniverse content and the corresponding hash value, the qualification of generating a new block is achieved, namely, the billing right is obtained, in this way, the probability that the more the stored metauniverse content is obtained by the computing node is higher, and therefore the computing nodes are encouraged to store the metauniverse content and the hash value of the metauniverse content, and further the storage rate of the metauniverse content can be increased, and the possibility of losing the metauniverse content is effectively reduced.
In a second aspect, referring to fig. 2, fig. 2 shows a flowchart of a block generation verification method applied to the metauniverse, which is applied to any participating node of a blockchain network, provided by an embodiment of the present invention. A block in the blockchain network stores a plurality of metauniverse contents and a plurality of hash values corresponding to the plurality of metauniverse contents one by one.
As shown in fig. 2, the method comprises the steps of:
s21, receiving a block generation message which is sent by the computing node and carries the block information of the new block generated by the computing node and the access link of the target block.
The block generation message is determined according to the above S11-S15, and will not be described herein. The computing node generates a block generation message for the new block according to the generated block information (such as the hash value of the block header, the stored meta-universe content and the hash value of the meta-universe content) of the new block and the access connection of the target block, and signs the block generation message through the private key of the computing node; broadcasting the signed block generation message to a blockchain network.
S22, verifying the block generation message by using the access link.
After receiving the block generation message, other participating nodes in the blockchain network verify the signature of the block generation message by using the private key of the computing node, and after the verification is passed, S22 further includes:
and step one, accessing the target block according to the access link, and acquiring target meta-universe content stored in the target block and a second hash value corresponding to the target meta-universe content.
And secondly, verifying whether the computing node stores the target meta-universe content and a second hash value corresponding to the target meta-universe content according to the target meta-universe content and the second hash value.
The participating node accesses the target block by adopting the access link in the block generation message, acquires the meta-universe content stored in the target block and the second hash value corresponding to the meta-universe content, and verifies whether the computing node stores the meta-universe content stored in the target block and the second hash value corresponding to the meta-universe content.
S23, when the verification is passed, recording the block information of the new block.
If the fact that the computing node stores the meta-universe content stored in the target block and the hash value corresponding to the meta-universe content is confirmed, verification is passed, the fact that the new block generated at this time is valid is confirmed, and block information of the new block is recorded.
According to the block generation verification method applied to the metauniverse, the target block is selected through the first hash value stored in the candidate block, whether the current computing node stores the metauniverse content and the hash value corresponding to the metauniverse content in the target block or not is verified, if the current computing node stores the metauniverse content and the corresponding hash value, the qualification of generating a new block is achieved, namely the billing right is obtained, in this way, the probability that the more the stored metauniverse content is obtained by the computing node is larger, and therefore the storing rate of the metauniverse content and the hash value of the metauniverse content by each computing node is encouraged, and further the storing rate of the metauniverse content can be increased, and the possibility of losing the metauniverse content is effectively reduced.
In a third aspect, referring to FIG. 3, FIG. 3 illustrates an architecture diagram of an exemplary blockchain network to which the present invention may be applied. The blockchain network includes a compute node 01 and a participating node 02. A block in the blockchain network stores a plurality of metauniverse contents and a plurality of hash values corresponding to the plurality of metauniverse contents one by one. Fig. 4 shows an architecture diagram of a block generating apparatus applied to metauniverse according to the present invention, the apparatus includes:
the obtaining module 101 is configured to obtain a plurality of first hash values stored in an alternative block, and calculate a first numerical value according to a preset algorithm according to the plurality of first hash values, where the first hash values include a hash value of a block header corresponding to the alternative block and a hash value corresponding to meta-universe content stored in the alternative block;
a determining module 102, configured to determine a target block with a block sequence number of the first value, and determine target meta-universe content stored in the target block and a second hash value corresponding to the target meta-universe content;
a judging module 103, configured to determine whether the computing node itself stores the target meta-universe content and the second hash value;
a generating module 104, configured to generate a new block according to the candidate block if the determination is yes;
And a sending module 105, configured to broadcast a block generation message carrying the block information of the new block and the access link of the target block to the blockchain network, so that other participating nodes in the blockchain network use the access link to verify the block generation message, and record the block information of the new block if the verification passes.
In some examples, the acquisition module 101 is specifically configured to:
calculating a third hash value according to the first hash values;
dividing the third hash value by the block sequence number of the candidate block, taking the remainder, and taking the remainder as the first numerical value.
In some examples, the generation module class 104 is specifically for:
calculating a fourth hash value according to the meta-universe content stored in the candidate block, the target meta-universe content stored in the target block and the random number;
comparing the fourth hash value with a preset difficulty value;
and generating a new block according to the alternative block under the condition that the fourth hash value is smaller than the preset difficulty value.
In some examples, the apparatus further comprises:
the history acquisition module is used for acquiring the history meta-universe content and hash values corresponding to the history meta-universe content aiming at the history meta-universe content released by other participating nodes in any blockchain network;
The hash generation module is used for carrying out hash operation on the historical meta-universe content and generating a verification hash value;
the hash verification module is used for verifying the hash value corresponding to the historical meta-universe content according to the verification hash value;
and the storage module is used for storing the historical meta-universe content under the condition that the verification is passed.
In a fourth aspect, referring to fig. 5, fig. 5 shows an architecture diagram of a block generation verification apparatus applied to a meta-universe according to an embodiment of the present invention, where the apparatus includes:
a receiving module 201, configured to receive a block generation message sent by a computing node and carrying block information of a new block generated by the computing node and an access link of a target block, where the block generation message is determined according to the above method;
a verification module 202, configured to verify the block generation message using the access link;
and a recording module 203, configured to record the block information of the new block if the verification is passed.
In some examples, the verification module 202 is specifically to:
accessing the target block according to the access link, and acquiring target meta-universe content stored in the target block and a second hash value corresponding to the target meta-universe content;
And verifying whether the computing node stores the target meta-universe content and the second hash value corresponding to the target meta-universe content according to the target meta-universe content and the second hash value.
In a fifth aspect, the present invention provides an electronic device, comprising:
at least one processor. and
A memory communicatively coupled to the at least one processor. Wherein, the liquid crystal display device comprises a liquid crystal display device,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method described above.
In the technical scheme of the disclosure, the acquisition, storage, application and the like of the related user personal information all conform to the regulations of related laws and regulations, and the public sequence is not violated.
Referring to fig. 6, fig. 6 shows a schematic block diagram of an example electronic device 800 that may be used to implement embodiments of the present disclosure. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the disclosure described and/or claimed herein.
As shown in fig. 6, the apparatus 800 includes a computing unit 801 that can perform various appropriate actions and processes according to a computer program stored in a Read Only Memory (ROM) 802 or a computer program loaded from a storage unit 808 into a Random Access Memory (RAM) 803. In the RAM 803, various programs and data required for the operation of the device 800 can also be stored. The computing unit 801, the ROM 802, and the RAM 803 are connected to each other by a bus 804. An input/output (I/O) interface 805 is also connected to the bus 804.
Various components in device 800 are connected to I/O interface 805, including: an input unit 806, such as a keyboard, mouse, etc. An output unit 807 such as various types of displays, speakers, and the like. Storage unit 808, such as a magnetic disk, optical disk, etc. And a communication unit 809, such as a network card, modem, wireless communication transceiver, or the like. The communication unit 809 allows the device 800 to exchange information/data with other devices via a computer network such as the internet and/or various telecommunication networks.
The computing unit 801 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of computing unit 801 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, etc. The calculation unit 801 performs the respective methods and processes described above, for example, a block generation method applied to a metauniverse or a block generation verification method applied to a metauniverse. For example, in some embodiments, the methods described above may be implemented as a computer software program tangibly embodied on a machine-readable medium, such as the storage unit 808. In some embodiments, part or all of the computer program may be loaded and/or installed onto device 800 via ROM 802 and/or communication unit 809. When a computer program is loaded into RAM 803 and executed by computing unit 801, one or more steps of the above-described methods may be performed. Alternatively, in other embodiments, the computing unit 801 may be configured to perform the above-described methods by any other suitable means (e.g., by means of firmware).
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.
Program code for carrying out methods of the present disclosure may be written in any combination of one or more programming languages. These program code may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus such that the program code, when executed by the processor or controller, causes the functions/operations specified in the flowchart and/or block diagram to be implemented. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In a sixth aspect, the present invention provides a non-transitory computer readable storage medium storing computer instructions for causing a computer to perform a method according to the above.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user. And a keyboard and pointing device (e.g., a mouse or trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user. For example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback). And input from the user may be received in any form, including acoustic input, speech input, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), and the internet.
The computer system may include a client and a server. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server may be a cloud server, a server of a distributed system, or a server incorporating a blockchain network.
It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps recited in the present disclosure may be performed in parallel or sequentially or in a different order, provided that the desired results of the technical solutions of the present disclosure are achieved, and are not limited herein.
It is to be understood that the above embodiments are merely illustrative of the application of the principles of the present invention, but not in limitation thereof. Various modifications and improvements may be made by those skilled in the art without departing from the spirit and substance of the invention, and are also considered to be within the scope of the invention.
Claims (10)
1. A block generation method applied to a metauniverse, which is characterized in that the method is applied to any computing node of a blockchain network; a block in the block chain network stores a plurality of metauniverse contents and a plurality of hash values corresponding to the metauniverse contents one by one; the method comprises the following steps:
acquiring a plurality of first hash values stored in an alternative block, and calculating a first numerical value according to a preset algorithm according to the plurality of first hash values, wherein the first hash values comprise hash values corresponding to block heads of the alternative block and hash values corresponding to meta-space content stored in the alternative block;
determining a target block with a block sequence number of the first value, and determining target meta-universe content stored in the target block and a second hash value corresponding to the target meta-universe content;
determining whether the computing node itself stores the target meta-universe content and the second hash value;
generating a new block according to the alternative block under the condition that the determination is yes;
broadcasting a block generation message carrying the block information of the new block and the access link of the target block to the blockchain network, so that other participating nodes in the blockchain network verify the block generation message by using the access link, and recording the block information of the new block under the condition that the verification is passed.
2. The method of claim 1, wherein obtaining the plurality of first hash values stored in the candidate block and calculating the first value according to a predetermined algorithm from the plurality of first hash values comprises:
calculating a third hash value according to the first hash values;
dividing the third hash value by the block sequence number of the candidate block, and taking the remainder as the first numerical value.
3. The method of claim 1, wherein the generating a new block from the candidate block comprises:
calculating a fourth hash value according to the meta-universe content stored in the candidate block, the target meta-universe content stored in the target block and the random number;
comparing the fourth hash value with a preset difficulty value;
and generating a new block according to the alternative block under the condition that the fourth hash value is smaller than the preset difficulty value.
4. A method according to any one of claims 1-3, wherein before obtaining the plurality of first hash values stored in the candidate block and calculating the first value according to a preset algorithm from the plurality of first hash values, the method further comprises:
Aiming at historical meta-universe content released by other participating nodes in any blockchain network, acquiring the historical meta-universe content and a hash value corresponding to the historical meta-universe content;
performing hash operation on the historical meta-universe content to generate a verification hash value;
verifying the hash value corresponding to the historical meta-universe content according to the verification hash value;
and in the case of passing the verification, storing the historical meta-universe content.
5. A block generation verification method applied to a metauniverse, which is characterized in that the method is applied to any participating node of a blockchain network; a block in the block chain network stores a plurality of metauniverse contents and a plurality of hash values corresponding to the metauniverse contents one by one; the method comprises the following steps:
receiving a block generation message carrying new block information generated by a computing node and an access link of a target block, wherein the block generation message is determined according to any one of the methods of claims 1-4;
validating the block generation message using the access link;
and recording the block information of the new block under the condition that verification is passed.
6. The method of claim 5, wherein the validating the chunk generation message using the access link comprises:
accessing the target block according to the access link, and acquiring target meta-universe content stored in the target block and a second hash value corresponding to the target meta-universe content;
and verifying whether the computing node stores the second hash value corresponding to the target meta-universe content and the target meta-universe content according to the target meta-universe content and the second hash value.
7. The block generating device applied to the metauniverse is characterized by being applied to a block chain network, wherein a block in the block chain network stores a plurality of metauniverse contents and a plurality of hash values which are in one-to-one correspondence with the plurality of metauniverse contents; the device comprises:
the acquisition module is used for acquiring a plurality of first hash values stored in the candidate block and calculating a first numerical value according to a preset algorithm according to the plurality of first hash values, wherein the first hash values comprise hash values of block heads corresponding to the candidate block and hash values corresponding to meta-universe content stored in the candidate block;
The determining module is used for determining a target block with a block serial number of the first value and determining target meta-universe content stored in the target block and a second hash value corresponding to the target meta-universe content;
the judging module is used for determining whether the computing node stores the target meta-universe content and the second hash value or not;
the generation module is used for generating a new block according to the alternative block under the condition that the determination is yes;
and the sending module is used for broadcasting the block generation message carrying the block information of the new block and the access link of the target block to the blockchain network so that other participating nodes in the blockchain network can verify the block generation message by using the access link, and the block information of the new block is recorded under the condition that the verification is passed.
8. The block generation verification device applied to the metauniverse is characterized by being applied to a block chain network, wherein a block in the block chain network stores a plurality of metauniverse contents and a plurality of hash values which are in one-to-one correspondence with the plurality of metauniverse contents; the device comprises:
a receiving module, configured to receive a block generation message sent by a computing node and carrying block information of a new block generated by the computing node and an access link of a target block, where the block generation message is determined according to the method of any one of claims 1-4;
The verification module is used for verifying the block generation message by using the access link;
and the recording module is used for recording the block information of the new block under the condition that the verification is passed.
9. An electronic device, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein, the liquid crystal display device comprises a liquid crystal display device,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-4 or to perform the method of claim 5 or 6.
10. A non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1-4 or to perform the method of claim 5 or 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211062916.0A CN116383836A (en) | 2022-09-01 | 2022-09-01 | Block generation method and block generation verification method applied to metauniverse |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211062916.0A CN116383836A (en) | 2022-09-01 | 2022-09-01 | Block generation method and block generation verification method applied to metauniverse |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116383836A true CN116383836A (en) | 2023-07-04 |
Family
ID=86964327
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211062916.0A Pending CN116383836A (en) | 2022-09-01 | 2022-09-01 | Block generation method and block generation verification method applied to metauniverse |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116383836A (en) |
-
2022
- 2022-09-01 CN CN202211062916.0A patent/CN116383836A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108960797B (en) | Block generation and verification method, device, equipment and storage medium | |
| CN108933695B (en) | Method and apparatus for processing information | |
| JP7270691B2 (en) | Methods, apparatus, electronics, storage media and computer programs for labeling data | |
| CN114327803A (en) | Method, apparatus, device and medium for accessing machine learning model by block chain | |
| CN109325744B (en) | Payment processing method, payment processing device, payment processing medium and electronic equipment | |
| CN113824676B (en) | Method and device for determining attack chain aiming at loopholes | |
| CN115344841A (en) | Meta-universe access method based on block chain network and block chain network device | |
| CN114492854A (en) | Method and device for training model, electronic equipment and storage medium | |
| CN109858285B (en) | Block chain data processing method, device, equipment and medium | |
| CN113704004B (en) | Method, device, equipment and storage medium for realizing notification service | |
| CN113132400B (en) | Business processing method, device, computer system and storage medium | |
| CN116629379A (en) | Federal learning aggregation method and device, storage medium and electronic equipment | |
| CN113935069B (en) | Data verification method, device and equipment based on block chain and storage medium | |
| CN116383836A (en) | Block generation method and block generation verification method applied to metauniverse | |
| CN113609156B (en) | Data query and write method and device, electronic equipment and readable storage medium | |
| CN113487041B (en) | Transverse federal learning method, device and storage medium | |
| CN112416488B (en) | User portrait implementing method, device, computer equipment and computer readable storage medium | |
| CN113283891A (en) | Information processing method and device and electronic equipment | |
| CN114090247A (en) | Method, device, equipment and storage medium for processing data | |
| CN111949738A (en) | Block chain-based data storage deduplication method, terminal device and storage medium | |
| CN113626649A (en) | Data storage method, data storage device, storage medium and electronic equipment | |
| CN112835854A (en) | File storage method and device, electronic equipment and storage medium | |
| CN112861189A (en) | Signature generation method, signature verification device, signature verification equipment and medium | |
| CN116455997B (en) | STEP market multipath forwarding method, STEP market multipath forwarding device, STEP market multipath forwarding equipment and STEP market multipath forwarding medium | |
| CN115482422B (en) | Training method of deep learning model, image processing method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |