CN111488352A - Point exchange method and device based on business data block chain - Google Patents

Point exchange method and device based on business data block chain Download PDF

Info

Publication number
CN111488352A
CN111488352A CN202010271027.XA CN202010271027A CN111488352A CN 111488352 A CN111488352 A CN 111488352A CN 202010271027 A CN202010271027 A CN 202010271027A CN 111488352 A CN111488352 A CN 111488352A
Authority
CN
China
Prior art keywords
user
points
point
redemption
block chain
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.)
Withdrawn
Application number
CN202010271027.XA
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.)
Beijing Ruice Technology Co Ltd
Original Assignee
Beijing Ruice 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 Beijing Ruice Technology Co Ltd filed Critical Beijing Ruice Technology Co Ltd
Priority to CN202010271027.XA priority Critical patent/CN111488352A/en
Publication of CN111488352A publication Critical patent/CN111488352A/en
Withdrawn legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06QDATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce, e.g. shopping or e-commerce
    • G06Q30/02Marketing, e.g. market research and analysis, surveying, promotions, advertising, buyer profiling, customer management or rewards; Price estimation or determination
    • G06Q30/0207Discounts or incentives, e.g. coupons, rebates, offers or upsales
    • G06Q30/0208Trade or exchange of a good or service for an incentive
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2246Trees, e.g. B+trees
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2255Hash tables
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/62Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218Protecting 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
    • G06F21/6227Protecting 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 where protection concerns the structure of data, e.g. records, types, queries
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/64Protecting data integrity, e.g. using checksums, certificates or signatures
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/60Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources

Abstract

The application discloses a point exchange method and device based on a business data block chain, wherein the business data block chain comprises a plurality of block chain nodes, and the method comprises the following steps: the block chain node creates a first point in response to a first point creation operation by a first user; setting an initial redemption ratio of the first points and the second points in response to setting of a redemption ratio of the first points and the second points of the first user so as to facilitate initial redemption of the first points and the second points. According to the method and the device, real-time point exchange can be carried out on the block chain, and the experience of a user in using the block chain is improved.

Description

Point exchange method and device based on business data block chain
Technical Field
The invention relates to the technical field of internet big data, and discloses a point exchange method and device based on a business data block chain.
Background
Currently, the blockchain technology is a distributed stored ledger that uses technologies such as encryption algorithm and consensus mechanism. With the use of blockchain technology, more and more internet data is stored on the blockchain.
In the existing block chain, only transaction data can be stored, wherein the transaction data comprises a transfer party address, a receiving party address and a transfer amount; but various business data (e.g., internet-related data such as evidence-storing data, traceability data, financial data, travel data, search data, self-media data, research data, advertisement data, e-commerce data, community data, knowledge question and answer data, knowledge payment data, shared bicycle data, recruitment data, living service data, renting data, voting data, OTO data (also referred to as online-to-offline data), social data, praise data, evaluation data, and network appointment data) may be linked up.
After the service data is uplink, how to utilize the service data on the chain to improve the experience of the user using the block chain also becomes a problem to be solved.
The foregoing description is merely for convenience in understanding and is not to be construed as limiting the prior art to the present application.
Disclosure of Invention
Based on the problems, the method and the device for point exchange based on the business data block chain can carry out real-time point exchange on the block chain, and improve the experience of a user in using the block chain.
The application discloses a point exchange method based on a business data block chain, wherein the business data block chain comprises a plurality of block chain nodes, and the method comprises the following steps:
the block chain node creates a first point in response to a first point creation operation by a first user;
setting an initial redemption ratio of the first points and the second points in response to setting of a redemption ratio of the first points and the second points of the first user so as to facilitate initial redemption of the first points and the second points.
In one possible implementation, the method further includes: the block chain node determines the exchange proportion of the first point and the second point according to a preset rule, wherein the preset rule is set by the first user;
the preset rules comprise stock centralized bidding rules.
In one possible implementation, the method further includes: the block chain node responds to a redemption request of a second user, the redemption request is used for redeeming a first number of first points into second points, and the redemption request is used for requesting redemption with the first user;
exchanging the first number of first points into a second number of second points according to the real-time exchange proportion of the first points and the second points; wherein the content of the first and second substances,
and transferring a first number of first points from the user address of the second user to the user address of the first user and transferring a second number of second points from the user address of the first user to the user address of the second user through the smart contract.
In one possible implementation, the method further includes: the blockchain node receives a conversion transaction sent by a second user, wherein the conversion transaction comprises a signature of the second user, a first conversion proportion of the first point and the second point, a third number of first points and a fourth number of second points;
receiving a redemption transaction response sent by the first user, the redemption transaction response including the first user signature, the second user signature, a third number of first points, a fourth number of second points, and the first redemption ratio;
verifying the first user signature and the second user signature and verifying whether the third number of first points and the fourth number of second points satisfy the first redemption ratio;
after the verification is passed, transferring the third number of first integrals to the user address of the first user, and transferring the fourth number of second integrals to the user address of the second user;
and updating the initial exchange proportion to the first exchange proportion according to the first exchange proportion.
In one possible implementation, the method further includes: the blockchain node receives a redemption request of a second user, wherein the redemption request comprises an address of the second user for locking a fifth number of first points, a second redemption proportion of the first points to the second points, a sixth number of second points and a signature of the second user on the locked address; wherein the blockchain node stores the redemption request through a state tree of entity information;
receiving a redemption response sent by the first user, wherein the redemption response comprises a signature of the first user on the redemption request;
verifying the signature of the first user and the signature of the second user, verifying a fifth number of first integrals on the locking address, and verifying whether a sixth number of second integrals exist on the user address of the first user;
and after the verification is passed, the fifth amount of first scores in the redemption request are transferred to the user address of the second user from the locking address, and the sixth amount of second scores are pork anger from the user address of the second user to the user address of the first user.
In one possible implementation, the relationship tree stores the exchange proportion of the first points and the second points; wherein the content of the first and second substances,
storing the exchange proportion of the first point and the second point by a leaf node value in the relational tree in an array or hash table mode; or
The relationship tree leaf nodes store tree roots of relationship subtrees, values of the relationship subtree leaf nodes store exchange ratios of the first scores and the second scores, and the relationship tree or the relationship subtree is an MPT tree or a Mercker tree.
In a possible implementation manner, the exchange proportion of the first point and the second point is stored in the database supporting attribute query in the form of a data table, so that a user can query according to attribute fields in the data table; wherein, any row in the data table corresponds to a state; the database supporting attribute query comprises a relational database and a memory database; or
And storing the exchange proportion of the first point and the second point by adopting a KV database in a key value pair mode.
The second aspect of the application discloses a point exchange device based on a business data block chain, wherein the business data block chain comprises a plurality of block chain nodes, and the device is a block chain node; wherein the content of the first and second substances,
the block chain node creates a first point in response to a first point creation operation by a first user;
setting an initial redemption ratio of the first points and the second points in response to setting of a redemption ratio of the first points and the second points of the first user so as to facilitate initial redemption of the first points and the second points.
A third aspect of the present application provides a computer-readable storage medium, which stores computer instructions, and when the computer instructions are executed by a processor, the computer instructions implement any one of the above-mentioned technical solutions.
A fourth aspect of the present application provides an electronic device, which includes a processor configured to execute any one of the above technical solutions.
According to the method and the device, real-time point exchange can be carried out on the block chain, and the experience of a user in using the block chain is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic flow chart of a point redemption method based on a business data block chain disclosed in the present application;
fig. 2 is a schematic block head structure diagram of a service data block chain according to the present application;
fig. 3 is a schematic structural diagram of a point redemption device based on a service data block chain.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terms "first" and "second" in this application are used for convenience of understanding only, and are not to be construed as sequential or limiting in any way.
For the purpose of facilitating understanding of the embodiments of the present invention, the following description will be further explained with reference to specific embodiments, which are not to be construed as limiting the embodiments of the present invention.
Blockchains are generally divided into three types: public chain (Public Blockchain), private chain (PrivateBlockchain) and alliance chain (Consortium Blockchain). In addition, there are various types of combinations, such as private chain + federation chain, federation chain + public chain, and other different combinations. The most decentralized of these is the public chain. The public chain is represented by bitcoin and ether house, and the participators joining the public chain can read the data record on the chain, participate in transaction, compete for accounting right of new blocks, and the like.
Furthermore, each participant (i.e., node) is free to join and leave the network and perform related operations. Private chains are the opposite, with the network's write rights controlled by an organization or organization and the data read rights specified by the organization. Briefly, a private chain can be a weakly centralized system with strictly limited and few participating nodes. This type of blockchain is more suitable for use within a particular establishment.
Based on the basic characteristics of a blockchain, a blockchain is usually composed of several blocks. The time stamps corresponding to the creation time of the block are recorded in the blocks respectively, and all the blocks form a time-ordered data chain according to the time stamps recorded in the blocks strictly.
The real data generated by the physical world can be constructed into a standard transaction (transaction) format supported by a block chain, then is issued to the block chain, is identified by node equipment in the block chain, and is packed into a block by the node equipment serving as an accounting node in the block chain after the identification is achieved, and is subjected to persistent evidence storage in the block chain.
In the field of blockchain, an important concept is Account (Account); taking an ether house as an example, the ether house generally divides an account into an external account and a contract account; the external account is an account directly controlled by the user; and the contract account is created by the user through an external account, the account containing the contract code (i.e. the smart contract).
Of course, for some blockchain items derived based on the ethernet framework, the account types supported by the blockchain may be further expanded, and are not particularly limited in this specification.
For accounts in a blockchain, the account status of the account is usually maintained through a structure. When a transaction in a block is executed, the status of the account associated with the transaction in the block chain is also typically changed.
Taking etherhouses as an example, the structure of an account usually includes fields such as Balance, Nonce, Code, and storage. Wherein:
a Balance field for maintaining the current account Balance of the account;
a Nonce field for the number of transactions for the account; the counter is used for guaranteeing that each transaction can be processed only once, and replay attack is effectively avoided.
A code field for maintaining a contract code for the account; in practical applications, only the hash value of the contract code is typically maintained in the code field; thus, the code field is also commonly referred to as a codehash field. For external accounts, this field is null.
storage field to maintain the storage of the account (default to empty). In practical application, the storage field only maintains the root node of an MPT (Merkle Patricia Trie) tree constructed based on the storage content of the account; thus, the storage field is also commonly referred to as the storageRoot field.
Wherein, for the external account, the code field and storage field shown above are null values.
Most blockchain items typically use Merkle trees; alternatively, the data is stored and maintained based on the data structure of the Merkle tree. Taking etherhouses as an example, the etherhouses use MPT tree (a Merkle tree variation) as a data organization form for organizing and managing important data such as account status, transaction information, and the like.
The Etherhouse designs three MPT trees, namely an MPT state tree, an MPT transaction tree and an MPT receipt tree, aiming at data needing to be stored and maintained in a block chain.
The MPT state tree is an MPT tree organized by account state data (state) of all accounts in the block chain; the MPT transaction tree is transaction data (transaction) in a block and is organized into the MPT tree; the MPT receipt tree is an MPT tree organized by transaction receipts (receipts) corresponding to each transaction generated after the transaction in the block is completed. The hash values of the root nodes of the MPT state tree, MPT transaction tree, and MPT receipt tree shown above are all added to the block header.
Wherein the MPT transaction tree and the MPT receipt tree correspond to tiles, each tile having its own MPT transaction tree and MPT receipt tree. The MPT state tree is a global MPT tree, which does not correspond to a specific tile, but covers account state data of all accounts in the tile chain.
Based on this, the present specification will not specifically explain the hierarchical storage of the MPT transaction tree and the MPT receipt tree, but rather the hierarchical storage of the MPT status tree.
The above is a description of a storage structure in a conventional block chain, and the following is a description of a storage structure of a service data block chain in the present application.
The present specification discloses a point exchange method for a service data block chain, as shown in fig. 1, the implementation method is applied to a service data block chain system, and the service data block chain system includes a plurality of block chain nodes; the method includes S101-S102.
The entity information in the present specification refers to abstraction of objective objects and also refers to specific objective objects, the entity information includes associated attributes and non-associated attributes, and the associated attributes refer to that attribute values can be increased or decreased; the user information refers to description information of a user, and the user information comprises a user address; the point information is point information issued by the user, and is point information other than the original points on the block chain, and the point information includes the name and the total amount of the point.
S101, creating the first integral by the block chain node in response to the first integral creating operation of the first user.
And S102, responding to the setting of the exchange ratio of the first point and the second point of the first user, and setting the initial exchange ratio of the first point and the second point so as to facilitate the initial exchange of the first point and the second point.
In one example, the method further comprises: the block chain node determines the exchange proportion of the first point and the second point according to a preset rule, wherein the preset rule is set by the first user;
the preset rules comprise stock centralized bidding rules.
In one example, the method further comprises: the block chain node responds to a redemption request of a second user, the redemption request is used for redeeming a first number of first points into second points, and the redemption request is used for requesting redemption with the first user;
exchanging the first number of first points into a second number of second points according to the real-time exchange proportion of the first points and the second points; wherein the content of the first and second substances,
and transferring a first number of first points from the user address of the second user to the user address of the first user and transferring a second number of second points from the user address of the first user to the user address of the second user through the smart contract.
In one example, the method further comprises: the blockchain node receives a conversion transaction sent by a second user, wherein the conversion transaction comprises a signature of the second user, a first conversion proportion of the first point and the second point, a third number of first points and a fourth number of second points;
receiving a redemption transaction response sent by the first user, the redemption transaction response including the first user signature, the second user signature, a third number of first points, a fourth number of second points, and the first redemption ratio;
verifying the first user signature and the second user signature and verifying whether the third number of first points and the fourth number of second points satisfy the first redemption ratio;
after the verification is passed, transferring the third number of first integrals to the user address of the first user, and transferring the fourth number of second integrals to the user address of the second user;
and updating the initial exchange proportion to the first exchange proportion according to the first exchange proportion.
In one example, the method further comprises: the blockchain node receives a redemption request of a second user, wherein the redemption request comprises an address of the second user for locking a fifth number of first points, a second redemption proportion of the first points to the second points, a sixth number of second points and a signature of the second user on the locked address; wherein the blockchain node stores the redemption request through a state tree of entity information;
receiving a redemption response sent by the first user, wherein the redemption response comprises a signature of the first user on the redemption request;
verifying the signature of the first user and the signature of the second user, verifying a fifth number of first integrals on the locking address, and verifying whether a sixth number of second integrals exist on the user address of the first user;
and after the verification is passed, the fifth amount of first scores in the redemption request are transferred to the user address of the second user from the locking address, and the sixth amount of second scores are pork anger from the user address of the second user to the user address of the first user.
In one example, a relationship tree stores a redemption ratio of the first points to the second points; the leaf node value in the relational tree stores the exchange proportion of the first point and the second point in an array or hash table mode; or
The relationship tree leaf nodes store tree roots of relationship subtrees, values of the relationship subtree leaf nodes store exchange ratios of the first scores and the second scores, and the relationship tree or the relationship subtree is an MPT tree or a Mercker tree.
In one example, the exchange proportion of the first points and the second points is stored in the database supporting attribute query in the form of a data table, so that a user can query according to attribute fields in the data table; wherein, any row in the data table corresponds to a state; the database supporting attribute query comprises a relational database and a memory database; or
And storing the exchange proportion of the first point and the second point by adopting a KV database in a key value pair mode.
In the above, a lot of service data, that is, operation data of the user, is stored in the service data block chain. The user operation data is operation data of a user on the Internet, and the user operation data comprises one or more of evidence storage data, tracing data, financial data, tourism data, search data, self-media data, research data, advertisement data, e-commerce data, community data, knowledge question and answer data, knowledge payment data, shared bicycle data, recruitment data, life service data, renting data, voting data, online-offline data, social data, approval data, evaluation data and vehicle appointment data.
For example, the entity is a commodity of an internet e-commerce platform, and the user can initiate an operation of purchasing the commodity, namely, an operation of transferring the points corresponding to the commodity entity (namely, the points are transferred from the address of the operating user to the address of the operated user); the user can also initiate a comment or a praise operation for the commodity, namely a user operation for the commodity entity.
In one example, the state data stored by the on-chain state database comprises points, and the attribute types of the point data comprise associated attributes and non-associated attributes; and the attribute value of the associated attribute is automatically increased or decreased according to the user operation data.
In this case, the point is a point issued by the user, for example: after a user can pass the notarization and securitize the house, a point is issued on the block chain, and the point uniquely represents the house property on the block chain; alternatively, the house may be securitized, a predetermined number of points issued, possession of the point will have ownership of the house, and will have equal ownership of the house lease or change. In addition, the block chain is provided with native scores which can be used for restricting the operation of the user on the block chain, so that the user is prevented from using the resources of the block chain system without limit; for example: after the users on the blockchain are registered, the users are operated on the blockchain, and the native credits are required to be collated so as to uplink the user operation data.
In one example, the association stored in the on-chain association database includes an association of entity information and user information; wherein, one entity information corresponds to one or more user information.
For example: on an electronic commerce platform (such as Taobao, Tianmao and Jingdong shopping mall) of the Internet, a commodity is purchased by a plurality of different users; on a self-media platform (such as WeChat and microblog) on the Internet, one piece of self-media data is praised or commented by a plurality of users; the one-to-many relationship between such entities and users can be expressed by using the association relationship between the entity information and the user information. The method and the device facilitate chaining of the service data and query of the service data by the user.
In one example, the association stored in the on-chain association coefficient database includes an association of user information and point information; wherein one user information corresponds to one or more point information.
At this time, a user may have multiple points; for example: a user has both native credits on the blockchain and other types of credits. The incidence relation can describe the one-to-many relation between the user and the score, and meanwhile, the user can conveniently inquire. It should be noted that a user in the blockchain system at least has the native scores of the blockchain system; it is possible to have credits issued by other users or by themselves.
In one example, the association stored in the on-chain association coefficient database includes an association of entity information and point information; wherein one entity information corresponds to one or more integral information.
At this time, equivalently, on the block chain, the securitization of the entity is realized; for example: the ownership of a commodity corresponds to an integral, and the transfer of the integral corresponds to the transfer of the ownership of the commodity; the ownership of a set of houses corresponds to a predetermined number of points, the number of owned points corresponds to the ownership proportion of the houses, and namely, the houses are owned to sell or rent the prices in the same proportion.
As described above, any one of the user information (e.g., Account field), credit information (e.g., Asset field), entity information (e.g., Object field), entity information-user information (e.g., Object-Account field), user information-credit information (e.g., Account-Asset field), and entity information-credit information (e.g., Object-Asset field) may be implemented by using an MPT status tree, and the tree roots of various MPT status trees are stored in the block header. As shown in FIG. 2, the user Action of the tile store (e.g., the Action field), and the root of the MPT state tree of the Receipt information stored by the on-chain database (e.g., the Recept field) are also stored in the tile header.
It should be noted that the block in the blockchain system includes a block header and a block body, the block header stores summary information, and the block body stores transfer information (also called transaction information). In this specification, the user operation is stored in a block of the block, and a digest value (also referred to as a hash value) of the user operation is stored in a block header; the on-chain state database in this specification is also part of the storage of the blockchain system, and each blockchain node has the on-chain state database and the block to store the service data in this specification.
In one example, the on-chain database is a database supporting attribute query or a KV database, wherein the database supporting attribute query includes a relational database and an in-memory database.
In one example, the attribute types of the user information and/or the entity information include an associated attribute and a non-associated attribute; and the attribute value of the associated attribute is automatically increased or decreased according to the user operation data.
In one example, any one of the user information, the entity information, the point information, the entity information-user information, the user information-point information, and the entity information-point information is organized into an MPT state tree; the MPT state Tree is a merkel Tree Merkle variety of a Tree structure fused with a prefix Tree Trie, and the merkel Tree Merkle is a merkel Patricia Tree state Tree.
In one example, any one of the user information, the entity information, the point information, the user information-the point information, the entity information-the point information and the entity information-the user information is stored in the database supporting attribute query in the form of a data table, so that a user can query according to an attribute field in the data table; one kind of information corresponds to one data table, any line in any one data table corresponds to one piece of information, and one kind of information comprises a plurality of lines of information; the database supporting attribute query comprises a relational database and an in-memory database.
In one example, any one of the user information, the entity information, the point information, the user information-the point information, the entity information-the point information, and the entity information-the user information is stored in a KV database and stored in a key-value pair manner.
In one example, any one of the user information, the entity information, the point information, the entity information-user information, the user information-point information, and the entity information-point information is organized into an MPT state tree; wherein the root of any one of the MPT state trees is stored in the block header.
In one example, the value of a leaf node in the relationship tree stores one or more of user information-point information, entity information-point information, and entity information-user information in a hash table or array.
In one example, the value of a leaf node of the relationship tree is to store a tree root of a relationship sub-tree that stores one or more of user information-score information, entity information-score information, and entity information-user information, the relationship sub-tree being a merkel tree or an MPT tree.
In the above, the information is stored in the way of the MPT state tree, and the user can query through the address information; directly adopting a user address, a point address and an entity address message to inquire information aiming at user information, point information and entity information; and aiming at the entity information-user information, the user information-integral information and the entity information-integral information, respectively adopting an entity address, a user address and an entity address to carry out information inquiry.
In addition, the user address can be obtained by carrying out multiple times of hash operation according to the user public key; the point address or the entity address may be obtained by a user operation of creating a point or an entity, for example: and carrying out multiple times of hash operation on the user operation, and selecting characters with preset digits from the obtained hash value as integral addresses or entity addresses.
In one example, the on-chain database employs a database supporting attribute queries, wherein the on-chain database includes a relational database and an in-memory database. That is, any state information of user information, point information, entity information-user information, user information-point information, and entity information-point information is stored by using a database supporting attribute query, the relational database can be MySql, and the memory database can be MongoDB.
At this time, by using the database supporting attribute query, the user information, the point information, the entity information-user information, the user information-point information, and the entity information-point information can be queried by using corresponding attributes, and the query efficiency of attribute query is higher compared with the query by using an address on a block chain. Meanwhile, the MPT state tree root of the above information is stored in the chunk header, as shown in fig. 2. In actual use, if any of the MPT state trees is not used, the MPT state tree can be set to empty.
In the specification, any one of user information, point information, entity information-user information, user information-point information and entity information-point information is organized into a data structure of an MPT state tree, namely a data logic structure, the adopted storage structure can be a KV database, such as L evalDB database, and also can be a MySql and MongoDB database which support attribute query, and the databases are physical storage structures.
The present specification enables the business data to be uplink, and enables various association relationships of the business data to be uplink; the benefits of the business data uplink include, but are not limited to, true trustworthiness, traceability, personal attribution of data rights, etc.
In addition, various attributes of the service data can be stored on the block chain by storing user operation data in the blocks and storing state data and state associated data in the on-chain state database, so that the problem of chaining the service data is solved; in addition, the state data and the state associated data stored in the state database on the chain are convenient for the user to access.
According to the method and the device, real-time point exchange can be carried out on the block chain, and the experience of a user in using the block chain is improved.
The specification also discloses a credit exchange device based on the service data block chain, wherein the service data block chain system comprises a plurality of block chain nodes, and the advertisement system comprises the block chain nodes and the first user equipment.
The block chain node creates a first point in response to a first point creation operation by a first user;
setting an initial redemption ratio of the first points and the second points in response to setting of a redemption ratio of the first points and the second points of the first user so as to facilitate initial redemption of the first points and the second points.
According to the method and the device, real-time point exchange can be carried out on the block chain, and the experience of a user in using the block chain is improved.
The same or similar parts in the above device embodiments and the above method embodiments can be referred to each other, and are not described herein again.
The present specification also discloses a computer readable storage medium storing computer instructions which, when executed by a processor, implement any one of the above-mentioned technical solutions.
The present specification also discloses an electronic device comprising a processor configured to perform any of the above-described technical solutions.
Meanwhile, the application also provides an embodiment of the entity device.
Blockchain node, fig. 3 shows a schematic structural diagram of a computer device, which may include: a processor 310, a memory 320, an input/output interface 330, a communication interface 340, and a bus 350. Wherein the processor 340, the memory 320, the input/output interface 330, and the communication interface 340 are communicatively coupled to each other within the device via a bus 350.
The processor 310 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits, and is configured to execute related programs to implement the technical solutions provided in the embodiments of the present specification.
The Memory 320 may be implemented in the form of a ROM (Read Only Memory), a RAM (Random access Memory), a static storage device, a dynamic storage device, or the like. The memory 320 may store an operating system and other application programs, and when the technical solution provided by the embodiments of the present specification is implemented by software or firmware, the relevant program codes are stored in the memory 320 and called to be executed by the processor 310.
The input/output interface 330 is used for connecting an input/output module to realize information input and output. The i/o module may be configured as a component in a device (not shown) or may be external to the device to provide a corresponding function. The input devices may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output devices may include a display, a speaker, a vibrator, an indicator light, etc.
The communication interface 340 is used for connecting a communication module (not shown in the figure) to implement communication interaction between the present device and other devices. The communication module can realize communication in a wired mode (such as USB, network cable and the like) and also can realize communication in a wireless mode (such as mobile network, WIFI, Bluetooth and the like).
Bus 350 includes a path that transfers information between the various components of the device, such as processor 310, memory 320, input/output interface 330, and communication interface 340.
It should be noted that although the above-mentioned device only shows the processor 310, the memory 320, the input/output interface 330, the communication interface 340 and the bus 350, in a specific implementation, the device may also include other components necessary for normal operation. In addition, those skilled in the art will appreciate that the above-described apparatus may also include only those components necessary to implement the embodiments of the present description, and not necessarily all of the components shown in the figures.
Those of skill would further appreciate that the various illustrative components and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied in hardware, a software module executed by a processor, or a combination of the two. A software module may reside in Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are only illustrative of the present invention and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the scope of the present invention should be included in the scope of the present invention.

Claims (10)

1. The point exchange method based on the service data block chain is characterized in that the service data block chain comprises a plurality of block chain nodes, and the method comprises the following steps:
the block chain node creates a first point in response to a first point creation operation by a first user;
setting an initial redemption ratio of the first points and the second points in response to setting of a redemption ratio of the first points and the second points of the first user so as to facilitate initial redemption of the first points and the second points.
2. The integral relation storage method of claim 1, further comprising:
the block chain node determines the exchange proportion of the first point and the second point according to a preset rule, wherein the preset rule is set by the first user;
the preset rules comprise stock centralized bidding rules.
3. The integral relation storage method according to any one of claims 1 or 2, further comprising:
the block chain node responds to a redemption request of a second user, the redemption request is used for redeeming a first number of first points into second points, and the redemption request is used for requesting redemption with the first user;
exchanging the first number of first points into a second number of second points according to the real-time exchange proportion of the first points and the second points; wherein the content of the first and second substances,
and transferring a first number of first points from the user address of the second user to the user address of the first user and transferring a second number of second points from the user address of the first user to the user address of the second user through the smart contract.
4. The integral relation storage method according to any one of claims 1 or 2, further comprising:
the blockchain node receives a conversion transaction sent by a second user, wherein the conversion transaction comprises a signature of the second user, a first conversion proportion of the first point and the second point, a third number of first points and a fourth number of second points;
receiving a redemption transaction response sent by the first user, the redemption transaction response including the first user signature, the second user signature, a third number of first points, a fourth number of second points, and the first redemption ratio;
verifying the first user signature and the second user signature and verifying whether the third number of first points and the fourth number of second points satisfy the first redemption ratio;
after the verification is passed, transferring the third number of first integrals to the user address of the first user, and transferring the fourth number of second integrals to the user address of the second user;
and updating the initial exchange proportion to the first exchange proportion according to the first exchange proportion.
5. The integral relation storage method of claim 1, further comprising:
the blockchain node receives a redemption request of a second user, wherein the redemption request comprises an address of the second user for locking a fifth number of first points, a second redemption proportion of the first points to the second points, a sixth number of second points and a signature of the second user on the locked address; wherein the blockchain node stores the redemption request through a state tree of entity information;
receiving a redemption response sent by the first user, wherein the redemption response comprises a signature of the first user on the redemption request;
verifying the signature of the first user and the signature of the second user, verifying a fifth number of first integrals on the locking address, and verifying whether a sixth number of second integrals exist on the user address of the first user;
and after the verification is passed, the fifth amount of first scores in the redemption request are transferred to the user address of the second user from the locking address, and the sixth amount of second scores are pork anger from the user address of the second user to the user address of the first user.
6. The point relation storage method according to claim 1, wherein a relation tree stores exchange ratios of the first points and the second points; wherein the content of the first and second substances,
storing the exchange proportion of the first point and the second point by a leaf node value in the relational tree in an array or hash table mode; or
The relationship tree leaf nodes store tree roots of relationship subtrees, values of the relationship subtree leaf nodes store exchange ratios of the first scores and the second scores, and the relationship tree or the relationship subtree is an MPT tree or a Mercker tree.
7. The point relation storage method according to claim 3, wherein the exchange proportion of the first points and the second points is stored in the database supporting attribute query in the form of a data table, so that a user can query according to attribute fields in the data table; wherein, any row in the data table corresponds to a state; the database supporting attribute query comprises a relational database and a memory database; or
And storing the exchange proportion of the first point and the second point by adopting a KV database in a key value pair mode.
8. The point exchange device based on the business data block chain is characterized in that the business data block chain comprises a plurality of block chain nodes, and the device is a block chain node; wherein the content of the first and second substances,
the block chain node creates a first point in response to a first point creation operation by a first user;
setting an initial redemption ratio of the first points and the second points in response to setting of a redemption ratio of the first points and the second points of the first user so as to facilitate initial redemption of the first points and the second points.
9. A computer-readable storage medium, characterized in that the storage medium stores computer instructions which, when executed by a processor, implement the solution according to any of claims 1-7.
10. An electronic device, characterized in that the electronic device comprises a processor for performing any one of the claims 1-7.
CN202010271027.XA 2020-04-08 2020-04-08 Point exchange method and device based on business data block chain Withdrawn CN111488352A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010271027.XA CN111488352A (en) 2020-04-08 2020-04-08 Point exchange method and device based on business data block chain

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010271027.XA CN111488352A (en) 2020-04-08 2020-04-08 Point exchange method and device based on business data block chain

Publications (1)

Publication Number Publication Date
CN111488352A true CN111488352A (en) 2020-08-04

Family

ID=71798406

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010271027.XA Withdrawn CN111488352A (en) 2020-04-08 2020-04-08 Point exchange method and device based on business data block chain

Country Status (1)

Country Link
CN (1) CN111488352A (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106779805A (en) * 2016-11-24 2017-05-31 中国银行股份有限公司 Integration circulation method and device between a kind of different businessmans based on block chain
CN108197974A (en) * 2017-12-12 2018-06-22 北京瑞卓喜投科技发展有限公司 Integration processing method and device based on block chain technology
CN108230011A (en) * 2017-12-12 2018-06-29 北京瑞卓喜投科技发展有限公司 Integration processing method and device based on block chain technology
CN108846705A (en) * 2018-06-26 2018-11-20 李建欣 A kind of digital integration service system, method and electronic device
WO2019027093A1 (en) * 2017-07-31 2019-02-07 임종범 Electronic money transaction system and method
CN109670802A (en) * 2018-12-21 2019-04-23 百度在线网络技术(北京)有限公司 A kind of chain currency conversion method, apparatus, equipment and medium based on block chain

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106779805A (en) * 2016-11-24 2017-05-31 中国银行股份有限公司 Integration circulation method and device between a kind of different businessmans based on block chain
WO2019027093A1 (en) * 2017-07-31 2019-02-07 임종범 Electronic money transaction system and method
CN108197974A (en) * 2017-12-12 2018-06-22 北京瑞卓喜投科技发展有限公司 Integration processing method and device based on block chain technology
CN108230011A (en) * 2017-12-12 2018-06-29 北京瑞卓喜投科技发展有限公司 Integration processing method and device based on block chain technology
CN108846705A (en) * 2018-06-26 2018-11-20 李建欣 A kind of digital integration service system, method and electronic device
CN109670802A (en) * 2018-12-21 2019-04-23 百度在线网络技术(北京)有限公司 A kind of chain currency conversion method, apparatus, equipment and medium based on block chain

Similar Documents

Publication Publication Date Title
CN111488616A (en) Method and device for realizing preplan machine of service data block chain
CN111488396B (en) Data synchronization method and device for service data block chain
CN111737726A (en) Relation data query method and device based on business data block chain
CN111488615A (en) Cross-link realization method and device for service data block chain
CN111488614A (en) Digital identity storage method and device based on service data block chain
CN111488608A (en) Data verification method and device for service data block chain
CN111488343A (en) E-commerce data uplink method and device based on business data block chain
CN111488611B (en) Relation data storage method and device of business data block chain
CN111488349A (en) Data query method and device based on service data block chain
CN111488356A (en) Data storage method and device for service data block chain
CN111695136A (en) Method and system for realizing service data block chain
CN111488344A (en) User operation data uplink method and system based on service data block chain
CN111488352A (en) Point exchange method and device based on business data block chain
CN111488609A (en) Service data block link-based order receiving method and device
CN111476607A (en) Advertisement method and system based on business data block chain
CN111488606B (en) Data sharing method and device based on service data block chain
CN111488353A (en) Intelligent contract implementation method and device for business data block chain
CN111488358A (en) Data query method and device based on service data block chain
CN111488350A (en) Entity relation storage method and device of business data block chain
CN111488348A (en) Data storage method and device for service data block chain
CN111488359A (en) Relation data storage method and device of business data block chain
CN111488347A (en) Data query method and device based on service data block chain
CN111488613A (en) Data efficient query method and device for service data block chain
CN111488345A (en) Storage optimization method and device for service data block chain
CN111488354A (en) Data processing method and device based on service data 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
WW01 Invention patent application withdrawn after publication
WW01 Invention patent application withdrawn after publication

Application publication date: 20200804