CN115880071A - Method for processing digital resources and nodes of block chain - Google Patents

Method for processing digital resources and nodes of block chain Download PDF

Info

Publication number
CN115880071A
CN115880071A CN202211602082.8A CN202211602082A CN115880071A CN 115880071 A CN115880071 A CN 115880071A CN 202211602082 A CN202211602082 A CN 202211602082A CN 115880071 A CN115880071 A CN 115880071A
Authority
CN
China
Prior art keywords
account
transaction
amount
digital resource
data
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
Application number
CN202211602082.8A
Other languages
Chinese (zh)
Inventor
王吉元
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Ant Love Technology Co ltd
Original Assignee
Hangzhou Ant Love Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Hangzhou Ant Love Technology Co ltd filed Critical Hangzhou Ant Love Technology Co ltd
Priority to CN202211602082.8A priority Critical patent/CN115880071A/en
Publication of CN115880071A publication Critical patent/CN115880071A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)

Abstract

The present specification provides a method for processing a digital resource and a node of a block chain, where information of a second digital resource corresponding to a target block unit is stored in the block chain, and the block chain includes first data, the first data includes a first amount of a third digital resource used for acquiring the second digital resource, and a current state of the first data is an active state, and a specific embodiment of the method includes: receiving a first transaction sent by a first account, wherein the first transaction comprises a second amount; when the second amount is determined to be larger than the first amount, changing the state of the first data into an invalid state, transferring a third digital resource of the second amount of the first account, storing second data corresponding to the first transaction in the information of the second digital resource, and recording the state of the second data as the valid state; and receiving a second transaction, updating the home account of the second digital resource to the first account when the second data is still in a valid state, and sending the second transaction when preset conditions are met.

Description

Method for processing digital resources and nodes of block chain
Technical Field
The embodiment of the specification belongs to the technical field of block chains, and particularly relates to a method for processing digital resources and a node of a block chain.
Background
The Blockchain (Blockchain) is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism, an encryption algorithm and the like. In the block chain system, data blocks are combined into a chain data structure in a sequential connection mode according to a time sequence, and a distributed account book which is not falsified and forged is guaranteed in a cryptology mode. Because the blockchain has the characteristics of decentralization, information non-tampering, autonomy and the like, the blockchain is also paid more and more attention and is applied by people. Digital resources can be generated based on Non-homogeneous Tokens (NFT) technology in the block chain, and the digital resources are usually characterized by irreplaceability, limitation, and the like and are not divisible. Different block chains may use different NFT protocol standards to generate the digital resource. The current mainstream protocol standards include ERC721, ERC1155, ERC998, and the like. The ERC721 is the most common NFT protocol standard, and under the ERC721 standard, each generated digital resource has a unique identifier, and different digital resources are not replaceable with each other. Under the ERC1155 standard, the resource identification does not correspond to one resource but corresponds to one type of resource, different types of resources are not replaceable, different resources in one type of resource are not different and can be replaced mutually, and the quantity of the types of the resources is finite. In the ERC998 standard, digital resources generated based on NFT technology may be bundled or combined with digital resources generated based on the homogenization certification (FT) technology, such as ETH coins.
It can be seen that NFT technology offers the possibility of tokenizing items, records, etc., for example, real world (or virtual space) land, houses, etc. can be mapped to digital resources. The resulting digital resource may be further processed as desired.
Disclosure of Invention
One or more embodiments of the present specification describe a method and a node of a blockchain for processing a digital resource.
According to a first aspect, a method for processing a digital resource is provided, which is applied to a node of a block chain, where information of a first digital resource corresponding to a virtual block is stored in the block chain, the virtual block includes a plurality of block units, information of a second digital resource corresponding to a target block unit is also stored in the block chain, the information of the second digital resource includes home account information and first data, the first data includes a first amount of a third digital resource used for acquiring the second digital resource, and a current state of the first data is an active state, the method includes: receiving a first transaction sent by a first account, wherein the first transaction comprises a resource identifier of the second digital resource and a second amount of the third digital resource used for acquiring the second digital resource; changing the state of the first data to an invalid state when it is determined that the second amount is larger than the first amount, transferring a third digital resource of the second amount to the first account according to the first transaction, storing second data corresponding to the first transaction in information of the second digital resource, and recording the state of the second data as a valid state; and receiving a second transaction, and updating the home account of the second digital resource to the first account when the second data is still in a valid state according to the second transaction, wherein the second transaction is sent when a preset condition is reached.
According to a second aspect, there is provided a node of a block chain, where information of a first digital resource corresponding to a virtual block is stored in the block chain, the virtual block includes a plurality of block units, the block chain further stores information of a second digital resource corresponding to a target block unit, the information of the second digital resource includes home account information and first data, the first data includes a first amount of a third digital resource used for acquiring the second digital resource, and a current state of the first data is a valid state, the node includes: a receiving module configured to receive a first transaction sent by a first account, where the first transaction includes a resource identifier of the second digital resource and a second amount of the third digital resource used to obtain the second digital resource; a transfer module configured to change a state of the first data to an invalid state when it is determined that the second amount is greater than the first amount, transfer a third digital resource of the second amount of the first account according to the first transaction, store second data corresponding to the first transaction in information of the second digital resource, and record the state of the second data as the valid state; and the updating module is configured to receive a second transaction, and update the home account of the second digital resource to the first account when the second data is determined to be still in a valid state according to the second transaction, wherein the second transaction is sent when a preset condition is reached.
According to a third aspect, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed in a computer, causes the computer to perform the method as described in any one of the implementations of the first aspect.
According to a fourth aspect, there is provided a node of a blockchain, comprising a memory and a processor, wherein the memory stores executable code, and the processor executes the executable code to implement the method as described in any implementation manner of the first aspect.
According to the method for processing digital resources and the node of the block chain provided by the embodiments of the present specification, the block chain stores information of a first digital resource corresponding to a virtual block, the virtual block includes a plurality of block units, the block chain also stores information of a second digital resource corresponding to a target block unit, the information of the second digital resource may include home account information and first data, the first data includes a first amount of a third digital resource used for acquiring the second digital resource, and a current state of the first data is a valid state. Based on this, first, a node of the blockchain may receive a first transaction sent by a first account, which may include an identification of a second digital resource and a second amount of a third digital resource for obtaining the second digital resource. And then, when the second amount is determined to be larger than the first amount, changing the state of the first data into an invalid state, transferring a third digital resource of the second amount of the first account according to the first transaction, storing second data corresponding to the first transaction in the information of the second digital resource, and recording the state of the second data as a valid state. And finally, receiving a second transaction, and updating the attribution account of the second digital resource to the first account when the second data is still in the valid state according to the second transaction, wherein the second transaction is sent when a preset condition is reached. Therefore, based on the interaction rule pre-stored in the block chain, the creator of the first digital resource corresponding to the virtual block interacts with other users according to the interaction rule, and the transfer of the second digital resource is realized.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, 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 described in the present disclosure, and it is obvious for a person skilled in the art to obtain other drawings based on these drawings without inventive labor.
FIG. 1 illustrates a block chain architecture diagram in one embodiment;
FIG. 2 shows a schematic diagram of one application scenario in which embodiments of the present description may be applied;
FIG. 3 illustrates a schematic diagram of creating digital resources corresponding to virtual parcel and digital resources corresponding to parcel units, according to one embodiment;
FIG. 4 is a diagram illustrating an example of an on-chain data structure for a first digital asset corresponding to a virtual parcel;
FIG. 5 is a diagram illustrating an example of an on-chain data structure for a digital resource corresponding to a block unit;
FIG. 6 is a diagram illustrating an example of an on-chain data structure for bidding corresponding data;
FIG. 7 shows a flow diagram of a method of processing a digital resource according to one embodiment;
fig. 8 shows a schematic block diagram of a node of a blockchain according to an embodiment.
Detailed Description
In order to make those skilled in the art better understand the technical solutions in the present specification, the technical solutions in the embodiments of the present specification will be clearly and completely described below with reference to the drawings in the embodiments of the present specification, and it is obvious that the described embodiments are only a part of the embodiments of the present specification, and not all of the embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments in the present specification without making any creative effort shall fall within the protection scope of the present specification.
The block chain technology is a special distributed database technology, is suitable for storing simple data which have precedence relationship and can be verified in a system, and guarantees that the data cannot be tampered and counterfeited by using cryptography and a consensus algorithm. To further illustrate the blockchain technique, FIG. 1 illustrates a blockchain architecture diagram in one embodiment. In the block chain architecture diagram shown in fig. 1, for example, 6 nodes are included in the block chain 100. The lines between the nodes schematically represent P2P (Peer to Peer) connections. The nodes may have stored thereon the full amount of ledgers, i.e. the status of all blocks and all accounts. Wherein each node in the blockchain can generate the same state in the blockchain by performing the same transaction, and each node in the blockchain can store the same state database. It is to be understood that although fig. 1 illustrates 6 nodes included in the blockchain, embodiments of the present specification are not limited thereto and may include other numbers of nodes. Specifically, the nodes included in the block chain can meet the Byzantine Fault Tolerance (BFT) requirement. The byzantine fault tolerance requirement can be understood as that byzantine nodes can exist in a block chain, and the block chain does not show the byzantine behavior to the outside. Generally, some Byzantine Fault-tolerant algorithms require the number of nodes to be larger than 3f +1, and f is the number of Byzantine nodes, such as Practical Byzantine Fault-tolerant algorithm PBFT (Practical Byzantine Fault Tolerance).
A transaction in the blockchain domain may refer to a unit of task that is performed in the blockchain and recorded in the blockchain. The transaction typically includes a send field (From), a receive field (To), and a Data field (Data). Where the transaction is a transfer transaction, the From field indicates the account address From which the transaction was initiated (i.e. the transfer task To another account was initiated), the To field indicates the account address From which the transaction was received (i.e. the transfer was received), and the Data field includes the transfer amount. In the case of a transaction calling an intelligent contract in a blockchain, the From field represents the account address From which the transaction was initiated, the To field represents the account address of the contract called by the transaction, and the Data field includes the name of the function in the calling contract, and Data such as incoming parameters To the function, for use in retrieving the code of the function From the blockchain and executing the code of the function when the transaction is executed.
The block chain may provide the functionality of an intelligent contract. An intelligent contract on a blockchain is a contract that can be executed by a transaction trigger on the blockchain system. An intelligent contract may be defined in the form of code. Calling the intelligent contract in the Ethernet workshop initiates a transaction pointing to the intelligent contract address, so that each node in the Ethernet workshop runs the intelligent contract code in a distributed mode. It should be noted that, in addition to the creation of the smart contracts by the users, the smart contracts may also be set by the system in the creation block. Such contracts are generally referred to as foundational contracts. In general, the data structure, parameters, attributes and methods of some blockchains may be set in the startup contract. Further, an account with system administrator privileges may create a contract at the system level, or modify a contract at the system level (simply referred to as a system contract). Wherein the system contract is usable to add data structures for different services in a blockchain.
In the scenario of contract deployment, for example, bob sends a transaction containing information to create an intelligent contract (i.e., a deployment contract) into the blockchain as shown in fig. 1, the data field of the transaction includes the code (e.g., bytecode or machine code) of the contract to be created, and the to field of the transaction is null to indicate that the transaction is for contract deployment. After the agreement is achieved among the nodes through a consensus mechanism, a contract address 0x6f8ae93 \ 8230of a contract is determined, each node adds a contract account corresponding to the contract address of the intelligent contract in a state database, allocates state storage corresponding to the contract account, and stores a contract code in the state storage of the contract, so that the contract is successfully created.
In the scenario of invoking a contract, for example, bob sends a transaction for invoking an intelligent contract into the blockchain as shown in fig. 1, the from field of the transaction is the address of the account of the transaction initiator (i.e., bob), "0x6f8ae93 \8230" in the to field, which represents the address of the intelligent contract being invoked, and the data field of the transaction includes the method and parameters for invoking the intelligent contract. After the transaction is identified in the blockchain, each node in the blockchain can execute the transaction respectively, so that the contract is executed respectively, and the state database is updated based on the execution of the contract.
In aspects of embodiments of the present specification, the intelligent contracts deployed in a blockchain may include NFT intelligent contracts, which may be code on the blockchain that enables NFT functionality. For example, the NFT function may include a coinage function, a transfer function, an inquiry function, and the like. Here, the coinage function may be used to create NFT resources in a blockchain, specifically, to document resource identification and attributes of NFT resources in a contracted state of an NFT smart contract in a blockchain. The transfer function may be used to transfer NFT resources from the current owner to another user. The query function may be used to query NFT resources for attribute information.
As previously mentioned, NFT technology provides the potential for tokenization of items, records, and the like. The resulting digital resource may be further processed as desired. Embodiments of the present specification provide a method of processing a digital resource. As an example, fig. 2 shows a schematic diagram of one application scenario in which embodiments of the present specification may be applied.
As shown in fig. 2, in the present application scenario, the information of the first digital resource corresponding to the virtual parcel, which includes a plurality of parcel units, is stored in the block chain 100, and the virtual parcel may correspond to an area on the metastic virtual ground, for example, and the parcel unit may correspond to a pixel on a map of the virtual ground. The block chain 100 further stores information of a second digital resource corresponding to the target block unit, where the information of the second digital resource may include home account information and first data, and the first data may include a bid of the account a that has successfully bid at the current time for obtaining the second digital resource corresponding to the target block unit, in this example, the bid of the account a is a third digital resource of the amount X. Here, the first digital resource and the second digital resource may be NFT (Non-homogeneous Token), and the third digital resource may be FT (homogeneous Token). The current state of the first data is the active state and the amount X is the active bid amount. Based on this, first, the node of the blockchain 100 receives a first transaction sent by the account B, the first transaction including the resource identification of the second digital resource and a third digital resource bid by the account B for the amount Y in order to obtain the bid of the second digital resource. And then, when the amount Y is determined to be larger than the amount X, changing the state of the first data into an invalid state, namely when the bid of the account B is higher than that of the account A, the bid of the account B is valid, the bid of the account B is successful, the bid of the account A fails, and at the moment, changing the state of the first data generated when the bid of the account A is successful into the invalid state. Meanwhile, the node of the blockchain 100 may transfer the third digital resource of the amount Y in the account B according to the first transaction, store second data corresponding to the first transaction in the information of the second digital resource, and record the state of the second data as an effective state. Finally, a second transaction is received, the second transaction being sent when a preset condition is reached, the preset condition may be a bid ending condition for the second digital resource. And when the second data is still in a valid state according to the second transaction, updating the home account of the second digital resource corresponding to the target block unit into an account B.
As an example, fig. 3 illustrates a schematic diagram of creating digital resources corresponding to virtual parcel and digital resources corresponding to parcel units, according to one embodiment. In the example shown in fig. 3, the following contents may be specifically included:
s301, the node of the block chain receives a transaction Tx1 sent by the account C for creating the first digital resource corresponding to the virtual block.
In this implementation, a node of the block chain may receive a transaction Tx1 sent by the account C, and this transaction Tx1 may be used to create a first digital resource corresponding to the virtual block. Here, the transaction Tx1 may include location information of the virtual parcel and metadata of the user. Taking a land parcel in which the virtual land parcel is a rectangular area as an example, the position information may include the length, width, and coordinate points of the lower left corner of the rectangular area. The metadata of the user may refer to data describing the user. Taking a user as an enterprise for example, the enterprise metadata may include an enterprise account, an enterprise name, an enterprise description, and so on. Taking the user as an individual who owns an intellectual property brand (IP brand), the individual metadata may include an individual account, an individual name, an individual description, and the like.
In this example, account C may be an account of a user (e.g., an enterprise user or an individual user) who wants to occupy a piece of virtual land on the metastic virtual ground. The user corresponding to account C may be a user who owns an intellectual property brand (IP brand). The user may send a transaction Tx1 to the node of the blockchain through the equipment used. Specifically, the user may select an area to be occupied based on the virtual ground of the metastic virtual space displayed by the used device, and transmit the transaction Tx1.
S302, based on the position information, a resource identifier of the first digital resource is generated.
In this implementation, the node of the blockchain may generate the resource identification of the first digital resource based on the location information included in the transaction Tx1. Here, the resource identifier of the first digital resource corresponding to the virtual parcel may be generated in various ways. For example, the location information included in the transaction Tx1 may be directly used as the resource identifier of the first digital resource corresponding to the virtual parcel. For another example, the hash operation may be performed on the location information included in the transaction Tx1, and the obtained hash value may be used as the resource identifier of the first digital resource corresponding to the virtual parcel. By the aid of the method and the device, the resource identifier can be generated based on the position information of the virtual parcel, and the resource identifier generated based on the position information is unique due to the uniqueness of the position information of the virtual parcel.
S303, storing information of the first digital resource in association with the resource identifier of the first digital resource in the blockchain.
In this implementation, information for the first digital asset may be stored in association with the asset identification for the first digital asset in the blockchain. In practice, the information of the first digital resource may be stored in a predetermined on-chain data structure.
As an example, fig. 4 shows a schematic diagram of an example of an on-chain data structure of a first digital resource corresponding to a virtual parcel, and in the example shown in fig. 4, the on-chain data structure of the first digital resource may include metadata information, location information, and user information. The metadata information may include, among other things, a parcel number, a parcel alias, a parcel length, a parcel width, etc. that describes various attributes of the virtual parcel. The location information may include a coordinate point of a lower left corner of the virtual parcel. The user information may include information of a user to which the virtual parcel belongs, and specifically may include a user account, a user name, a user description, and the like. For ease of understanding, the types of various information are also shown in fig. 4. It is to be understood that the data structure depicted in fig. 4 is only illustrative and not limiting of the data structure of the first digital resource, and in practice, different data structures may be defined for the first digital resource according to actual needs. The information of the first digital resource may also include data of a variety of data structures.
And S304, generating resource identifiers of the digital resources corresponding to the land parcel units based on the coordinate information of the land parcel units for a plurality of land parcel units contained in the virtual land parcel, and storing the information of the digital resources corresponding to the land parcel units in the block chain in association with the resource identifiers of the digital resources corresponding to the land parcel units.
In this implementation, the virtual parcel may include a plurality of parcel units, and one parcel unit may correspond to one pixel on the map of the virtual ground. In this way, the resource identifier of the digital resource corresponding to the block unit can be generated based on the coordinate information of the block unit. For example, the coordinate information of the parcel unit can be directly used as the resource identifier of the digital resource corresponding to the parcel unit. For example, the coordinate information of the block unit may be subjected to a hash operation, and the obtained hash value may be used as the resource identifier of the digital resource corresponding to the block unit. Thereafter, information of the digital resource corresponding to the parcel unit may be stored in association with the resource identification of the digital resource of the parcel unit in the blockchain.
In practice, the information of the digital resource corresponding to the block unit may include information of various on-chain data structures. As an example, fig. 5 is a schematic diagram illustrating an example of an on-chain data structure of a digital resource corresponding to a block unit, and in the example illustrated in fig. 5, the on-chain data structure of the digital resource corresponding to the block unit may include metadata information and basic information. The metadata information may include information describing various attributes of the parcel unit, such as associated users, user introductions (including enterprise user introductions and individual user introductions), tile heights, and the like. The basic information may include a number, a home account, and the like. It will be appreciated that the home account for the digital resource corresponding to a parcel unit is the user account of the user who created the virtual parcel at the time of initial creation. For ease of understanding, the types of various information are also shown in fig. 5. It is to be understood that the data structure depicted in fig. 5 is only illustrative and not limiting of the data structure of the digital resource corresponding to the parcel unit, and in practice, different data structures may be defined for the digital resource corresponding to the parcel unit according to actual needs.
For the digital resources corresponding to the parcel units in the virtual parcel created by the user owning the IP brand, the fan or supporter of the brand can obtain the digital resources by bidding, and the account for obtaining the digital resources can be recorded in the information owning the on-chain data structure shown in fig. 5 as the home account. Thus realizing an interaction between the brand party and the fans or supporters.
For example, one of the plot units is used as a target plot unit, each account can bid for the target plot unit, and a piece of data corresponding to the bid can be generated every time the bid is made. By way of example, fig. 6 is a schematic diagram illustrating an example of an on-chain data structure of bid-corresponding data, which in the example shown in fig. 6 may include, but is not limited to, bid information, last bid information, configuration information, and the like. The bidding information may include, among other things, the coding of the bidding parcel unit, the bid amount, the bid account, the number of bids, the time of the bid, the winning time of the bid, the status of the bid, etc. The bid number may refer to a bid number for a target parcel unit, the bid winning time may refer to a time when the current bid is determined to win, and the bid status may include an active status, an inactive status, and the like. The last bid information may include an order number, a bid amount, a bid account, a bid time, and the like. Each bid can be concluded with a order number for the winning account. The last bid information is overridden and thus invalidated, and by recording the last bid information in the data generated for each bid, the data for all bids for the same parcel unit can be correlated.
Here, the configuration information may refer to information configured by an operator of a virtual space in which the virtual parcel is located. By way of example, the configuration information may include a bid increase proportion, a return proportion, and the like. Wherein, the bid increase rate can refer to a minimum rate threshold value for the next bid to be higher than the current bid. The return proportion may refer to the proportion of returns available to the account that failed the bid. For example, assuming that the return proportion is 10%, the account E pays an amount of 100 for the digital resources corresponding to the target plot unit, and if the amount of 100 wins the bid, the current maximum bid is 100. If account F wins 150 and also bids on the numerical resource corresponding to the target parcel unit, the bid of account E is exceeded at 100, i.e., account F wins and account E fails to bid, where 10% can be added to account E based on the amount of 100, i.e., account E can obtain (100 +100 × 10%) =110 fund refund.
For ease of understanding, the types of various information are also shown in fig. 6. It is to be understood that the data structure depicted in fig. 6 is merely illustrative and not limiting of the information contained in the on-chain data structure corresponding to a bid, and in practice, different data structures may be defined for bids according to actual needs.
In practice, an initial amount may be set for each parcel and the current effective bid amount may be defaulted to the initial amount when an account is first billed for that parcel. That is, if the bid amount of the account that is bid for the first time for the block unit exceeds the initial amount, the account may bid successfully. It will be appreciated that the last bid information may be null in the data generated by the first bid. As an example, assuming that the initial amount corresponding to the parcel unit P is Q, the account M bids for the parcel unit P for the first time, the account M may send a transaction to a node of the blockchain, the transaction may include a bid amount Z, when Z > Q, transfer of a third digital resource of the amount Z in the account M is performed according to the transaction, data corresponding to the transaction is stored in information of the digital resource corresponding to the parcel unit P, a data structure of the data may refer to fig. 6, and a state of the data is recorded as a valid state. It can be understood that since the first bid does not have a previous bid corresponding thereto, the previous bid information in the data corresponding to the first bid may be null. The bidding process other than the first time may refer to the method described in fig. 7 below.
Based on the above process, the block chain may store information of a first digital resource corresponding to the virtual block and information of a second digital resource corresponding to the target block unit, where the information of the second digital resource may include home account information and first data corresponding to a bid in a valid state at the current time. The home account information is included in the data having the data structure shown in fig. 5, and the data structure of the first data is shown in fig. 6. The first data may include a first amount of a third digital resource for acquiring the second digital resource, and the current state of the first data is a valid state. Based on this, fig. 7 shows a flow diagram of a method of processing a digital resource according to one embodiment. The method may be applied to a node of a blockchain, which may be implemented as any device with computing, processing capabilities, server or cluster of devices, etc. As shown in fig. 7, the method for processing digital resources may include the following steps:
s701, receiving a first transaction sent by a first account.
In this embodiment, the first account may send a first transaction for a target parcel unit that wants to compete for in the virtual parcel. The first transaction may include a resource identification of a second digital resource corresponding to the target parcel unit and a second amount of a third digital resource for acquiring (or competing for) the second digital resource. Here, the third digital resource may be FT (homogeneous Token).
S702, when the second amount is determined to be larger than the first amount, changing the state of the first data into an invalid state, transferring a third digital resource of the second amount of the first account according to the first transaction, and storing second data corresponding to the first transaction in the information of the second digital resource, wherein the state of the second data is recorded as the valid state.
In this embodiment, if the second amount is greater than the first amount, it indicates that the bid of the first account for the target parcel unit is higher than the bid corresponding to the bid in the valid state at the current time, and the bid of the first account is valid, and at this time, the state of the first data may be changed to the invalid state. In addition, the node of the blockchain may transfer the second amount of the third digital resource to the first account in accordance with the first transaction. For example, transfer to a designated account may be possible. The node of the block chain may further store second data corresponding to the first transaction in the information of the second digital resource, where the second data may be data of a data structure shown in fig. 6, where the bid status of the second data is a valid status.
In some optional implementations, a bid increase rate may also be included in the first data. And the above S702 may be specifically performed as follows:
one), upon determining that the second amount is greater than the first amount, calculating a difference between the second amount and the first amount.
Two), the ratio of the difference to the first amount is determined.
Thirdly), when the ratio of the difference value to the first amount is larger than or equal to the bid increase proportion, the state of the first data is changed into an invalid state, the third digital resource of the second amount of the first account is transferred according to the first transaction, the second data corresponding to the first transaction is stored in the information of the second digital resource, and the state of the second data is recorded as a valid state. Through the implementation mode, the situation that the later bid wins out when the later bid is higher than the current effective bid by a preset bid increase ratio is determined.
In some alternative implementations, the first transaction may invoke a smart contract, and the information on the first digital resource and the information on the second digital resource may be stored in a contract state of the smart contract. And, the transferring of the second amount of the third digital resource to the first account according to the first transaction in S702 may specifically be performed as follows: and transferring the third digital resource with the second amount in the first account into the account of the intelligent contract according to the first transaction, and adding the second amount in the target amount corresponding to the target parcel unit.
In this implementation manner, the target amount corresponding to the target parcel unit may be recorded in the contract state of the intelligent contract, and when there is an account that bids on the target parcel unit and transfers funds corresponding to the bid amount to the account of the intelligent contract, the target amount may be correspondingly increased. For example, for a target parcel unit, account a transfers 100 to an account of the intelligent contract, then the target amount corresponding to the target parcel unit increases by 100.
And S703, receiving the second transaction, and updating the home account of the second digital resource to the first account when the second data is still in the valid state according to the second transaction.
In this embodiment, a condition for bid termination may be set in advance for a target parcel unit, and when the condition is satisfied, bidding may be stopped. And sending a second transaction to the node of the block chain, and updating the home account of the second digital resource to the first account when the second data is still in the valid state according to the second transaction, namely the first account finally obtains the target block unit. That is, the second transaction may be used to set the bid account in the data for which the bid status is valid as the home account for the second digital resource. In practice, the second transaction may be sent through the running body of virtual space, or the Chainlink Keepers. Chainlink Keepers are an decentralized transaction automation service that allows developers to automate intelligent contract functions using custom triggers. The operation main body of the virtual space or Chainlink Keepers can continuously check whether preset conditions are met or not under the chain, and when the conditions are met, a second transaction is automatically sent to trigger an intelligent contract on the chain.
In practice, various conditions for bid termination can be preset according to actual needs, for example, the preset conditions can include a duration of a bid, that is, when the duration of the bid for a plot unit reaches a preset duration, the bid is terminated. For another example, the preset condition may include an effective duration of the bidding data corresponding to the last bid, that is, after the last bid is completed, no other account is bid for the preset duration, and the bid is terminated.
In some optional implementations, the first data in the information of the second digital resource may further include a bid account and a return proportion corresponding to the first amount. And the method for processing digital resources can also comprise the following steps:
1) The third amount is determined based on the first amount and the return ratio included in the first data.
In this implementation, the first data may refer to data corresponding to a bid in an active state at the current time, and the first amount included in the first data may refer to a bid amount corresponding to the bid in the active state at the current time. In practice, to encourage each account to participate in bidding, an account that failed to bid may be given a certain rebate in addition to returning the principal, e.g., in proportion to its bid. For example, the amount returned to an account that fails to bid may be calculated according to the following formula: the first amount + the first amount × the return ratio = the third amount.
2) And transferring a third amount of third digital resources in the account of the intelligent contract to the bidding account corresponding to the first amount in the first data, and reducing the third amount in the target amount corresponding to the target plot unit.
By the implementation mode, the rebate of the account with the failed bidding can be realized, so that more accounts are encouraged to participate in the bidding, and the activity degree of the account is improved.
In some optional implementations, a trade rate may be stored in the block chain in advance, where the trade rate may refer to a proportion of money that needs to be paid to an operator of the virtual space after the bidding for one parcel unit is completed. And the method for processing digital resources can also comprise the following steps:
a) And determining a fourth amount based on the second amount and a pre-stored transaction rate when it is determined that the second data is still valid based on the second transaction. For example, the fourth amount may be the product of the second amount and the transaction rate.
b) And transferring a fourth amount of third digital resources in the account of the intelligent contract to the second account, and reducing the fourth amount in the target amount corresponding to the target parcel unit. Here, the second account may refer to an account of an operator of a virtual space in which the virtual parcel is located. The second account may include one account or a plurality of accounts, and when a plurality of accounts are included, the fourth amount of the third digital resource may be allocated among the plurality of accounts according to a preset allocation rule. Through the implementation mode, the operation main body of the virtual space can be awarded, so that the operation main body of the virtual space is encouraged to further promote operation service.
In some optional implementations, the method for processing the digital resource may further include: first, a third transaction sent by the second account is received, wherein the third transaction comprises a new bid increase proportion. The new bid increase proportion is then stored in the blockchain. Through the implementation mode, the operation main body of the virtual space where the virtual parcel is located can update the bid increase ratio stored in the parcel chain. It will be appreciated that the bid increase proportion first stored in the blockchain is also deployed by the second account through the send transaction.
In some optional implementations, the method for processing the digital resource may further include: first, a fourth transaction sent by a second account is received, wherein the fourth transaction comprises an account number of a newly added operation subject. Then, the account number of the newly added operation subject is used as one of the second accounts, and at least two second accounts can operate the virtual space through a multiple signature mechanism. Through the implementation mode, the virtual space where the virtual parcel is located can be operated by a plurality of accounts together.
In some optional implementations, the method for processing the digital resource may further include: first, a fifth transaction sent by the second account is received, where the fifth transaction may include a new proportion returned. The new return ratio is then stored in the blockchain. Through the implementation mode, the operation main body of the virtual space where the virtual land parcel is located can update the return proportion stored in the block chain. It will be appreciated that the return proportion stored first in the blockchain is also deployed by the second account through the send transaction.
Reviewing the above process, in the above embodiment of the present specification, the block chain stores information of the first digital resource corresponding to the virtual block, the virtual block includes a plurality of block units, the block chain also stores information of the second digital resource corresponding to the target block unit, the information of the second digital resource may include home account information and first data, the first data includes a first amount of the third digital resource for acquiring the second digital resource, and the current status of the first data is a valid status. Based on this, first, a node of the blockchain may receive a first transaction sent by a first account, which may include an identification of a second digital resource and a second amount of a third digital resource for obtaining the second digital resource. And then, when the second amount is determined to be larger than the first amount, changing the state of the first data into an invalid state, transferring a third digital resource of the second amount of the first account according to the first transaction, storing second data corresponding to the first transaction in the information of the second digital resource, and recording the state of the second data into the valid state. And finally, receiving a second transaction, and updating the attribution account of the second digital resource to the first account when the second data is still in the valid state according to the second transaction, wherein the second transaction is sent when a preset condition is reached. Therefore, based on the interaction rule pre-stored in the block chain, the creator of the first digital resource corresponding to the virtual block interacts with other users according to the interaction rule, and the transfer of the second digital resource is realized.
According to an embodiment of another aspect, a node of a blockchain is provided. The nodes of the blockchain may be implemented as any device having computing, processing capabilities, a server or cluster of devices, etc.
Fig. 8 shows a schematic block diagram of a node of a blockchain according to one embodiment. The method comprises the steps that information of a first digital resource corresponding to a virtual parcel is stored in a parcel chain, the virtual parcel comprises a plurality of parcel units, information of a second digital resource corresponding to a target parcel unit is also stored in the parcel chain, the information of the second digital resource comprises attribution account information and first data, the first data comprises a first amount of a third digital resource used for obtaining the second digital resource, and the current state of the first data is an effective state. As shown in fig. 8, the node 800 includes: a receiving module 801 configured to receive a first transaction sent by a first account, where the first transaction includes a resource identifier of the second digital resource and a second amount of the third digital resource used for acquiring the second digital resource; a transfer module 802, configured to change the state of the first data to an invalid state when it is determined that the second amount is greater than the first amount, perform transfer of a third digital resource of the second amount of the first account according to the first transaction, store second data corresponding to the first transaction in information of the second digital resource, and record the state of the second data as a valid state; the updating module 803 is configured to receive a second transaction, and update the home account of the second digital resource to the first account when it is determined that the second data is still in a valid state according to the second transaction, where the second transaction is sent when a preset condition is reached.
In some optional implementations of this embodiment, the first transaction invokes a smart contract, and the information on the first digital resource and the information on the second digital resource are stored in a contract state of the smart contract; and the transfer module 802 is further configured to: and transferring a second amount of third digital resources in the first account to the account of the intelligent contract according to the first transaction, and adding the second amount to the target amount corresponding to the target parcel unit.
In some optional implementations of this embodiment, the first data further includes a bid account and a return proportion corresponding to the first amount; and the node 800 further comprises: a first determining module (not shown in the figure) configured to determine a third amount according to the first amount and the return ratio included in the first data; a first transfer module (not shown in the figure) configured to transfer a third amount of a third digital resource in the account of the intelligent contract to the bidding account, and reduce the third amount in the target amount corresponding to the target parcel unit.
In some optional implementations of this embodiment, the node 800 further includes: a second determining module (not shown in the figure) configured to determine a fourth amount according to the second amount and a pre-stored transaction rate when it is determined that the second data is still valid according to the second transaction; a second transferring module (not shown in the figure), configured to transfer a fourth amount of a third digital resource in an account of the intelligent contract to a second account, and reduce the fourth amount in a target amount corresponding to the target parcel unit, where the second account is an account of an operation subject of a virtual space in which the virtual parcel is located.
In some optional implementations of this embodiment, the first data further includes a bid increase rate; and the transfer module 802 is further configured to: upon determining that said second amount is greater than said first amount, calculating a difference between said second amount and said first amount; determining a ratio of said difference to said first amount; and when the ratio is greater than or equal to the bid increase ratio, changing the state of the first data into an invalid state, transferring a third digital resource of a second amount of the first account according to the first transaction, storing second data corresponding to the first transaction in the information of the second digital resource, and recording the state of the second data into the valid state.
In some optional implementations of this embodiment, the node 800 further includes: a third transaction receiving module (not shown in the figure) configured to receive a third transaction sent by a second account, wherein the third transaction includes a new bid increase ratio, and the second account is an account of an operation subject of a virtual space in which the virtual parcel is located; a bid increase proportion storage module (not shown) configured to store the new bid increase proportion in the blockchain.
In some optional implementations of this embodiment, the node 800 further includes: a fourth transaction receiving module (not shown in the figure), configured to receive a fourth transaction sent by a second account, where the fourth transaction includes an account number of a newly added operating subject, and the second account is an account of an operating subject in a virtual space where the virtual parcel is located; and an account adding module (not shown in the figure) configured to use the account number of the added operation subject as one of the second accounts, wherein at least two of the second accounts operate the virtual space through a multiple signature mechanism.
In some optional implementations of this embodiment, the node 800 further includes: a fifth transaction receiving module (not shown in the figure), configured to receive a fifth transaction sent by a second account, where the fifth transaction includes a new return proportion, and the second account is an account of an operation subject of a virtual space where the virtual parcel is located; a return ratio storage module (not shown) configured to store the new return ratio in the block chain.
In some optional implementations of the embodiment, the preset condition includes a bid duration.
In some optional implementations of this embodiment, the node 800 further includes: a sixth transaction receiving module (not shown in the figure), configured to receive a sixth transaction sent by a third account and used for creating the first digital resource corresponding to the virtual parcel, where the sixth transaction includes location information; a first generating module (not shown in the figure) configured to generate a resource identifier of the first digital resource based on the location information; an association storage module (not shown in the figure) configured to store information of the first digital resource in association with the resource identifier of the first digital resource in the block chain; a second generating module (not shown in the figure) configured to generate, for a plurality of block units included in the virtual block, resource identifiers of digital resources corresponding to the block units based on the coordinate information of the block units, and store information of the digital resources corresponding to the block units in the block chain in association with the resource identifiers of the digital resources corresponding to the block units.
According to an embodiment of another aspect, there is also provided a computer-readable storage medium having stored thereon a computer program which, when executed in a computer, causes the computer to perform the method described in fig. 7.
According to another embodiment of the present invention, there is also provided a node of a blockchain, including a memory and a processor, wherein the memory stores executable code, and the processor executes the executable code to implement the method described in fig. 7.
In the 90 s of the 20 th century, improvements in a technology could clearly distinguish between improvements in hardware (e.g., improvements in circuit structures such as diodes, transistors, switches, etc.) and improvements in software (improvements in process flow). However, as technology advances, many of today's process flow improvements have been seen as direct improvements in hardware circuit architecture. Designers almost always obtain the corresponding hardware circuit structure by programming an improved method flow into the hardware circuit. Thus, it cannot be said that an improvement in the process flow cannot be realized by hardware physical modules. For example, a Programmable Logic Device (PLD), such as a Field Programmable Gate Array (FPGA), is an integrated circuit whose Logic functions are determined by programming the Device by a user. A digital system is "integrated" on a PLD by the designer's own programming without requiring the chip manufacturer to design and fabricate application-specific integrated circuit chips. Furthermore, nowadays, instead of manually manufacturing an Integrated Circuit chip, such Programming is often implemented by "logic compiler" software, which is similar to a software compiler used in program development and writing, but the original code before compiling is also written by a specific Programming Language, which is called Hardware Description Language (HDL), and HDL is not only one but many, such as ABEL (Advanced Boolean Expression Language), AHDL (alternate Hardware Description Language), traffic, CUPL (core universal Programming Language), HDCal, jhddl (Java Hardware Description Language), lava, lola, HDL, PALASM, rhyd (Hardware Description Language), and vhigh-Language (Hardware Description Language), which is currently used in most popular applications. It will also be apparent to those skilled in the art that hardware circuitry that implements the logical method flows can be readily obtained by merely slightly programming the method flows into an integrated circuit using the hardware description languages described above.
The controller may be implemented in any suitable manner, for example, the controller may take the form of, for example, a microprocessor or processor and a computer readable medium that stores computer readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, an Application Specific Integrated Circuit (ASIC), a programmable logic controller, and embedded microcontrollers, examples of which include, but are not limited to, the following microcontrollers: ARC 625D, atmel AT91SAM, microchip PIC18F26K20, and Silicone Labs C8051F320, the memory controller may also be implemented as part of the control logic for the memory. Those skilled in the art will also appreciate that, in addition to implementing the controller as pure computer readable program code, the same functionality can be implemented by logically programming method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Such a controller may thus be considered a hardware component, and the means included therein for performing the various functions may also be considered as a structure within the hardware component. Or even means for performing the functions may be regarded as being both a software module for performing the method and a structure within a hardware component.
The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. One typical implementation device is a server system. Of course, this application does not exclude that with future developments in computer technology, the computer implementing the functionality of the above described embodiments may be, for example, a personal computer, a laptop computer, a vehicle-mounted human-computer interaction device, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device or a combination of any of these devices.
Although one or more embodiments of the present description provide method operational steps as described in the embodiments or flowcharts, more or fewer operational steps may be included based on conventional or non-inventive approaches. The order of steps recited in the embodiments is merely one manner of performing the steps in a multitude of orders and does not represent the only order of execution. When an actual apparatus or end product executes, it may execute sequentially or in parallel (e.g., parallel processors or multi-threaded environments, or even distributed data processing environments) according to the method shown in the embodiment or the figures. The terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, the presence of additional identical or equivalent elements in a process, method, article, or apparatus that comprises the recited elements is not excluded. For example, if the terms first, second, etc. are used to denote names, they do not denote any particular order.
For convenience of description, the above devices are described as being divided into various modules by functions, and are described separately. Of course, when implementing one or more of the present description, the functions of each module may be implemented in one or more software and/or hardware, or a module implementing the same function may be implemented by a combination of multiple sub-modules or sub-units, etc. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The present invention has been described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of 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.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape disk storage, graphene storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
One skilled in the art will appreciate that one or more embodiments of the present description may be provided as a method, system, or computer program product. Accordingly, one or more embodiments of the present description may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, one or more embodiments of the present description 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.
One or more embodiments of the present description may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. One or more embodiments of the specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment. In the description of the specification, reference to the description of "one embodiment," "some embodiments," "an example," "a specific example," or "some examples" or the like means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the specification. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
The above description is merely exemplary of one or more embodiments of the present disclosure and is not intended to limit the scope of one or more embodiments of the present disclosure. Various modifications and alterations to one or more embodiments described herein will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement made within the spirit and principle of the present specification shall be included in the scope of the claims.

Claims (14)

1. A method for processing digital resources is applied to a node of a block chain, wherein information of a first digital resource corresponding to a virtual block is stored in the block chain, the virtual block comprises a plurality of block units, information of a second digital resource corresponding to a target block unit is also stored in the block chain, the information of the second digital resource comprises home account information and first data, the first data comprises a first amount of a third digital resource used for acquiring the second digital resource, and the current state of the first data is a valid state, and the method comprises the following steps:
receiving a first transaction sent by a first account, wherein the first transaction comprises a resource identifier of the second digital resource and a second amount of the third digital resource for acquiring the second digital resource;
when the second amount is determined to be larger than the first amount, changing the state of the first data into an invalid state, transferring a third digital resource of the second amount of the first account according to the first transaction, storing second data corresponding to the first transaction in the information of the second digital resource, and recording the state of the second data into a valid state;
and receiving a second transaction, and updating the home account of the second digital resource to the first account when the second data is still in a valid state according to the second transaction, wherein the second transaction is sent when a preset condition is reached.
2. The method of claim 1, wherein the first transaction invokes a smart contract, the information of the first digital resource and the information of the second digital resource being stored in a contract state of the smart contract; and
the transferring of the second amount of the third digital resource to the first account according to the first transaction comprises:
according to the first transaction, transferring a second amount of third digital resources in the first account to the account of the intelligent contract, and increasing the second amount in the target amount corresponding to the target parcel unit.
3. The method of claim 2, wherein the first data further comprises a bid account and a return proportion corresponding to the first amount; and
the method further comprises the following steps:
determining a third amount according to the first amount and the return proportion included in the first data;
transferring a third amount of a third digital resource in the account of the intelligent contract to the bidding account, and reducing the third amount in the target amount corresponding to the target parcel unit.
4. The method of claim 2, wherein the method further comprises:
when the second data is still in a valid state according to the second transaction, determining a fourth amount according to the second amount and a pre-stored transaction rate;
transferring a fourth amount of third digital resources in the account of the intelligent contract to a second account, and reducing the fourth amount in the target amount corresponding to the target parcel unit, wherein the second account is an account of an operation main body of a virtual space where the virtual parcel is located.
5. The method of claim 1, wherein the first data further comprises a bid increase rate; and
when it is determined that the second amount is greater than the first amount, changing the state of the first data to an invalid state, transferring a third digital resource of the second amount to the first account according to the first transaction, storing second data corresponding to the first transaction in information of the second digital resource, and recording the state of the second data as a valid state, includes:
upon determining that the second amount is greater than the first amount, calculating a difference between the second amount and the first amount;
determining a ratio of said difference to said first amount;
and when the ratio is larger than or equal to the bid increase proportion, changing the state of the first data into an invalid state, transferring a third digital resource of a second amount of the first account according to the first transaction, storing second data corresponding to the first transaction in the information of the second digital resource, and recording the state of the second data into the valid state.
6. The method of claim 1, wherein the method further comprises:
receiving a third transaction sent by a second account, wherein the third transaction comprises a new bid increase proportion, and the second account is an account of an operation subject of a virtual space in which the virtual parcel is located;
storing the new bid increase proportion in the blockchain.
7. The method of claim 1, wherein the method further comprises:
receiving a fourth transaction sent by a second account, wherein the fourth transaction comprises an account number of a newly added operation subject, and the second account is an account of an operation subject of a virtual space where the virtual parcel is located;
and taking the account number of the newly added operation subject as one of the second accounts, and operating the virtual space by at least two second accounts through a multiple signature mechanism.
8. The method of claim 1, wherein the method further comprises:
receiving a fifth transaction sent by a second account, wherein the fifth transaction comprises a new return proportion, and the second account is an account of an operation subject of a virtual space in which the virtual parcel is located;
storing the new return ratio in the blockchain.
9. The method of claim 1, wherein the preset condition comprises a bid duration.
10. The method of claim 1, wherein prior to said receiving the first transaction sent by the first account, the method further comprises:
receiving a sixth transaction sent by a third account and used for creating a first digital resource corresponding to the virtual parcel, wherein the sixth transaction comprises position information;
generating a resource identifier of the first digital resource based on the location information;
storing information of the first digital asset in the blockchain in association with an asset identification of the first digital asset;
and for a plurality of block units contained in the virtual block, generating resource identifiers of the digital resources corresponding to the block units based on the coordinate information of the block units, and storing the information of the digital resources corresponding to the block units in the block chain in association with the resource identifiers of the digital resources corresponding to the block units.
11. A node of a block chain, wherein information of a first digital resource corresponding to a virtual block is stored in the block chain, the virtual block comprises a plurality of block units, information of a second digital resource corresponding to a target block unit is also stored in the block chain, the information of the second digital resource comprises home account information and first data, the first data comprises a first amount of a third digital resource used for obtaining the second digital resource, and the current state of the first data is a valid state, the node comprises:
a receiving module configured to receive a first transaction sent by a first account, the first transaction including a resource identifier of the second digital resource and a second amount of the third digital resource for acquiring the second digital resource;
a transfer module configured to change a state of the first data to an invalid state when it is determined that the second amount is greater than the first amount, perform transfer of a third digital resource of the second amount of the first account according to the first transaction, store second data corresponding to the first transaction in information of the second digital resource, and record the state of the second data as a valid state;
and the updating module is configured to receive a second transaction, and update the home account of the second digital resource to the first account when the second data is still in a valid state according to the second transaction, wherein the second transaction is sent when a preset condition is reached.
12. The node of claim 11, wherein the first transaction invokes a smart contract, information of the first digital resource and information of the second digital resource being stored in a contract state of the smart contract; and
the transfer module is further configured to:
according to the first transaction, transferring a second amount of third digital resources in the first account to the account of the intelligent contract, and increasing the second amount in the target amount corresponding to the target parcel unit.
13. A computer-readable storage medium, on which a computer program is stored which, when executed in a computer, causes the computer to carry out the method of any one of claims 1-10.
14. A blockchain node comprising a memory having stored therein executable code and a processor that, when executing the executable code, implements the method of any of claims 1-10.
CN202211602082.8A 2022-12-14 2022-12-14 Method for processing digital resources and nodes of block chain Pending CN115880071A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211602082.8A CN115880071A (en) 2022-12-14 2022-12-14 Method for processing digital resources and nodes of block chain

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211602082.8A CN115880071A (en) 2022-12-14 2022-12-14 Method for processing digital resources and nodes of block chain

Publications (1)

Publication Number Publication Date
CN115880071A true CN115880071A (en) 2023-03-31

Family

ID=85767330

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211602082.8A Pending CN115880071A (en) 2022-12-14 2022-12-14 Method for processing digital resources and nodes of block chain

Country Status (1)

Country Link
CN (1) CN115880071A (en)

Similar Documents

Publication Publication Date Title
CN109636384A (en) A kind of parallelization executes the method, apparatus and system of block chain transaction
CN108958796A (en) service request processing method and device, service request processing system
CN111201754A (en) Apparatus for providing a collection of cryptographically protected and filtered and sorted transaction data sets of links of a blockchain
CN110766458A (en) Data processing method and device based on block chain
CN110263580B (en) Data processing method and device based on block chain and block chain link points
CN108777698A (en) Webpage storage method, system and block chain node device
CN108733457A (en) The implementation method and device of distributed transaction
WO2023160085A1 (en) Method for executing transaction, blockchain, master node, and slave node
CN114679457A (en) Node grouping method in block chain and block chain link point
CN114529417A (en) Method for executing transaction, block chain, main node and slave node
CN114936092A (en) Method for executing transaction in block chain and main node of block chain
CN114936094A (en) Method for executing transaction in block chain, master node and slave node of block chain
CN113034137A (en) Data processing method and device based on block chain and related equipment
CN114785800B (en) Cross-link communication method, device, storage medium and computing equipment
CN115150409B (en) Method for executing transaction in blockchain system, node and computer readable storage medium
CN114978686B (en) Digital asset chaining method and device
CN115237455B (en) Application management method and related equipment
CN115983997A (en) Block chain-based collection management method, block chain node and system
CN115860884A (en) Method and device for processing digital resources in block chain system
CN115098483A (en) Pre-execution cache data cleaning method and block link point
CN115880071A (en) Method for processing digital resources and nodes of block chain
CN115098114A (en) Block chain-based distributed application deployment method and device
CN112579343A (en) Block link point data recovery method and device
CN115063238A (en) Method for processing digital resources based on block chain and node of block chain
CN115757641A (en) Method and device for creating digital resource and node of block chain

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