CN111488346A - State data storage method and device for service data block chain - Google Patents

State data storage method and device for service data block chain Download PDF

Info

Publication number
CN111488346A
CN111488346A CN202010270306.4A CN202010270306A CN111488346A CN 111488346 A CN111488346 A CN 111488346A CN 202010270306 A CN202010270306 A CN 202010270306A CN 111488346 A CN111488346 A CN 111488346A
Authority
CN
China
Prior art keywords
data
user
state
tree
user operation
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
CN202010270306.4A
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 CN202010270306.4A priority Critical patent/CN111488346A/en
Publication of CN111488346A publication Critical patent/CN111488346A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2246—Trees, e.g. B+trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2255—Hash tables
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2455—Query execution
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G06F21/6227—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database where protection concerns the structure of data, e.g. records, types, queries
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Databases & Information Systems (AREA)
  • Computer Security & Cryptography (AREA)
  • Business, Economics & Management (AREA)
  • Data Mining & Analysis (AREA)
  • Health & Medical Sciences (AREA)
  • Computer Hardware Design (AREA)
  • Bioethics (AREA)
  • Finance (AREA)
  • General Health & Medical Sciences (AREA)
  • Accounting & Taxation (AREA)
  • Signal Processing (AREA)
  • Computational Linguistics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Strategic Management (AREA)
  • Technology Law (AREA)
  • General Business, Economics & Management (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The application discloses a method and a device for storing state data of a service data block chain, wherein a service data block chain system comprises a plurality of block chain nodes, and the method comprises the following steps: the method comprises the steps that a block chain node receives user operation data sent by a client, wherein the user operation data are operation of a user on service data; verifying the user operation data; after the verification is passed, updating the current state tree of the current block into a first state tree based on the state data operated by the user; wherein the value of the leaf node of the first state tree stores the state data after the user operation, and the state data after the user operation comprises one or more of an integral state, an entity state and a user state. The state tree can be updated, and the current and historical states after user operation can be checked after the state tree is used.

Description

State data storage method and device for service data block chain
Technical Field
The invention relates to the technical field of internet big data, and discloses a method and a device for storing state data of a service 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; for various service data (such as evidence storage 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 called online to offline data), social data, praise data, evaluation data, internet appointment data and other internet related data), not only the data per se but also the association relationship between the data on the block chain need to be expressed.
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 above problems, the present application discloses a method and a device for storing status data of a service data block chain, which can update a status tree and check the current and historical status after user operation after use.
A first aspect of the present application discloses a method for storing state data of a service data block chain, where a service data block chain system includes a plurality of block chain nodes, and the method includes:
the method comprises the steps that a block chain node receives user operation data sent by a client, wherein the user operation data are operation of a user on service data;
verifying the user operation data;
after the verification is passed, updating the current state tree of the current block into a first state tree based on the state data operated by the user; wherein the value of the leaf node of the first state tree stores the state data after the user operation, and the state data after the user operation comprises one or more of an integral state, an entity state and a user state.
In a possible implementation manner, the verifying the state data after the user operation by the block link point specifically includes:
the block link point checks one or both of a user signature of the user operation data and an operation logic of the user operation data.
In one possible implementation, the operation logic of the user operation data is checked, and the operation logic includes one or more of the following:
whether repeated operation exists in the operation logic of the user operation data or not is judged, and the repeated operation is judged whether the operation of the user on the same object exceeds a preset number of times or not;
whether the operation time sequence in the operation logic of the user operation data is correct or not;
whether the corresponding integral in the operation logic of the user operation data is sufficient or not;
whether a corresponding object exists in the operation logic of the user operation data;
and whether the user is allowed to operate in the operation logic of the user operation data comprises whether the user signs and whether the user is the owner of the operated object.
In one possible implementation, the object includes one or more of user information, entity information, and point information.
In one possible implementation, the first state Tree is an MPT Tree, which is a merkel Tree variation of a Tree structure that merges prefix trees, or a merkel Tree, which is a Merkle Patricia Tree.
In a second aspect of the application, a state data storage device for a service data blockchain is disclosed, the service data blockchain system comprising a plurality of blockchain nodes, the device being a blockchain node, wherein,
the method comprises the steps that a block chain node receives user operation data sent by a client, wherein the user operation data are operation of a user on service data;
verifying the user operation data;
after the verification is passed, updating the current state tree of the current block into a first state tree based on the state data operated by the user; wherein the value of the leaf node of the first state tree stores the state data after the user operation, and the state data after the user operation comprises one or more of an integral state, an entity state and a user state.
In a possible implementation manner, the verifying the state data after the user operation by the block link point specifically includes:
the block link point checks one or both of a user signature of the user operation data and an operation logic of the user operation data.
In one possible implementation, the operation logic of the user operation data is checked, and the operation logic includes one or more of the following:
whether repeated operation exists in the operation logic of the user operation data or not is judged, and the repeated operation is judged whether the operation of the user on the same object exceeds a preset number of times or not;
whether the operation time sequence in the operation logic of the user operation data is correct or not;
whether the corresponding integral in the operation logic of the user operation data is sufficient or not;
whether a corresponding object exists in the operation logic of the user operation data;
and whether the user is allowed to operate in the operation logic of the user operation data comprises whether the user signs and whether the user is the owner of the operated object.
In one possible implementation, the object includes one or more of user information, entity information, and point information.
In one possible implementation, the first state Tree is an MPT Tree, which is a merkel Tree variation of a Tree structure that merges prefix trees, or a merkel Tree, which is a Merkle Patricia Tree.
In a possible implementation manner, any one of the user state, the entity state and the integral state is stored in the database supporting attribute query in a form of a data table, so that a user can query according to an attribute field in the data table; the system comprises a data table, a plurality of rows of state information and a plurality of groups of data tables, wherein one type of state information corresponds to one data table, any row in any one data table corresponds to one piece of state information, and one type of state information comprises a plurality of rows of state information; the database supporting attribute query comprises a relational database and a memory database; or
And any state information of the user state, the entity state and the integral state is stored by adopting a KV database in a key value pair mode.
In one possible implementation, the user operation data is operation data of a user on the internet, and the user operation data includes one or more of evidence storage 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, rentals data, voting data, online-to-offline data, social data, praise data, evaluation data and online booking data.
In one possible implementation, the user operation data includes one or more of a timestamp, an operation user address, an operated address, an operation type, a value of an operation, a credit address, a signature of the user on the user operation data, and a hash value of the user operation data; the operation type comprises an operation of a user on an entity and an operation on the credit, and the operated address comprises an operation address on the entity and addresses of other operation users.
In one possible implementation manner, the attributes of the user operation data include an associated attribute and a non-associated attribute; wherein the attribute value of the associated attribute is automatically increased or decreased according to the data state after the user operation.
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.
The state tree can be updated, and the current and historical states after user operation can be checked after the state tree is used.
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 illustrating a method for storing state data of a service data block chain according to the present disclosure;
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 state data storage device of a service data block chain according to the present application.
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.
The present specification discloses a data operation method of a service data blockchain, as shown in fig. 1, the service data blockchain system includes a plurality of blockchain nodes; the method includes S101-S103.
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, receiving user operation data sent by a client by a block chain node, wherein the user operation data is operation of a user on service data.
And S102, verifying the user operation data.
S103, after the verification is passed, updating the current state tree of the current block into a first state tree based on the state data after the user operation; wherein the value of the leaf node of the first state tree stores the state data after the user operation, and the state data after the user operation comprises one or more of an integral state, an entity state and a user state.
In a possible implementation manner, the verifying the state data after the user operation by the block link point specifically includes: the block link point checks one or both of a user signature of the user operation data and an operation logic of the user operation data.
In one possible implementation, the operation logic of the user operation data is checked, and the operation logic includes one or more of the following:
whether repeated operation exists in the operation logic of the user operation data or not is judged, and the repeated operation is judged whether the operation of the user on the same object exceeds a preset number of times or not;
whether the operation time sequence in the operation logic of the user operation data is correct or not;
whether the corresponding integral in the operation logic of the user operation data is sufficient or not;
whether a corresponding object exists in the operation logic of the user operation data;
and whether the user is allowed to operate in the operation logic of the user operation data comprises whether the user signs and whether the user is the owner of the operated object.
In one possible implementation, the object includes one or more of user information, entity information, and point information.
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, a point transfer operation (point is transferred from the address of the operating user to the address of the operated user) for a point corresponding to the commodity entity; the user can also initiate a comment or a praise operation for the commodity, namely a user operation for the commodity entity.
Associated attributes in an attribute type, for example: the number of praise is automatically increased for the same commodity or the self-media (such as pictures, texts and small videos circled by WeChat friends) after praise is performed by different users. Non-associated attributes, such as: and after different users comment the comment content, the user searches the commodity on the block chain and can see the comments of the different users.
The points are user issued points, 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 possible implementation, the first state Tree is an MPT Tree, which is a merkel Tree variation of a Tree structure that merges prefix trees, or a merkel Tree, which is a Merkle Patricia Tree.
In one example, any one of the user state, the entity state and the integral state 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; the system comprises a data table, a plurality of rows of state information and a plurality of groups of data tables, wherein one type of state information corresponds to one data table, any row in any one data table corresponds to one piece of state information, and one type of state information comprises a plurality of rows of state information; the database supporting attribute query comprises a relational database and an in-memory database.
The relational database can adopt MySql, and the memory database adopts a MongoDB database.
In one example, any one of the user status, the entity status and the integration status is stored in a KV database and stored in a key-value pair manner.
In one example, 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, 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, life service data, house renting data, voting data, online-offline data, social data, praise data, evaluation data and net appointment data.
In one example, the user operation data includes one or more of a timestamp, an operation user address, an operated address, an operation type, a value of an operation, a credit address, a signature of the user on the user operation data, and a hash value of the user operation data; the operation type comprises an operation of a user on an entity and an operation on the credit, and the operated address comprises an operation address on the entity and addresses of other operation users.
In one example, the attributes of the user operation data include an associated attribute and a non-associated attribute; wherein the attribute value of the associated attribute is automatically increased or decreased according to the data state after the user operation.
As described above, any one of the user state (e.g., Account field), the point state (e.g., Asset field), and the entity state (e.g., Object field) can be implemented by using an MPT state tree or a Mercker tree, and the tree root of each MPT state tree is 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 status tree of the Receipt status of the on-chain database store (e.g., the Recept field) are also stored in the tile header.
In the above, the states are stored in an MPT state tree manner, and a user can query through address information; and directly adopting the user address, the integral address and the entity address to inquire the state aiming at the user state, the integral state and the entity state.
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.
The method and the device can update the state tree, and can check the current and historical states after user operation after use; and by adopting the database supporting attribute query, the user can conveniently access the database, and the query efficiency is improved.
In addition, the present specification discloses a data manipulation apparatus of a service data blockchain, and a service data blockchain system includes a plurality of blockchain nodes.
The method comprises the steps that a block chain node receives user operation data sent by a client, wherein the user operation data are operation of a user on service data;
verifying the user operation data;
after the verification is passed, updating the current state tree of the current block into a first state tree based on the state data operated by the user; wherein the value of the leaf node of the first state tree stores the state data after the user operation, and the state data after the user operation comprises one or more of an integral state, an entity state and a user state.
In one example, the verifying the state data after the user operation by the block link point specifically includes: the block link point checks one or both of a user signature of the user operation data and an operation logic of the user operation data.
In one example, the operation logic of the user operation data checks, including one or more of:
whether repeated operation exists in the operation logic of the user operation data or not is judged, and the repeated operation is judged whether the operation of the user on the same object exceeds a preset number of times or not;
whether the operation time sequence in the operation logic of the user operation data is correct or not;
whether the corresponding integral in the operation logic of the user operation data is sufficient or not;
whether a corresponding object exists in the operation logic of the user operation data;
and whether the user is allowed to operate in the operation logic of the user operation data comprises whether the user signs and whether the user is the owner of the operated object.
In one example, the object includes one or more of user information, entity information, and point information.
In one example, the first state Tree is an MPT Tree, which is a merkel Tree variation of a Tree structure that fuses prefix trees, or a merkel Tree, which is a Merkle Patricia Tree.
In one example, any one of the user state, the entity state and the integral state 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; the system comprises a data table, a plurality of rows of state information and a plurality of groups of data tables, wherein one type of state information corresponds to one data table, any row in any one data table corresponds to one piece of state information, and one type of state information comprises a plurality of rows of state information; the database supporting attribute query comprises a relational database and a memory database; or
And any state information of the user state, the entity state and the integral state is stored by adopting a KV database in a key value pair mode.
In one example, 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, 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, life service data, house renting data, voting data, online-offline data, social data, praise data, evaluation data and net appointment data.
In one example, the user operation data includes one or more of a timestamp, an operation user address, an operated address, an operation type, a value of an operation, a credit address, a signature of the user on the user operation data, and a hash value of the user operation data; the operation type comprises an operation of a user on an entity and an operation on the credit, and the operated address comprises an operation address on the entity and addresses of other operation users.
In one example, the attributes of the user operation data include an associated attribute and a non-associated attribute; wherein the attribute value of the associated attribute is automatically increased or decreased according to the data state after the user operation.
The state tree can be updated, and the current and historical states after user operation can be checked after the state tree is used.
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.
Fig. 3 shows a schematic 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. A method for storing state data of a service data blockchain, wherein a service data blockchain system comprises a plurality of blockchain nodes, the method comprising:
the method comprises the steps that a block chain node receives user operation data sent by a client, wherein the user operation data are operation of a user on service data;
verifying the user operation data;
after the verification is passed, updating the current state tree of the current block into a first state tree based on the state data operated by the user; wherein the value of the leaf node of the first state tree stores the state data after the user operation, and the state data after the user operation comprises one or more of an integral state, an entity state and a user state.
2. The method according to claim 1, wherein the verifying the user-operated status data by the block link point comprises:
the block link point checks one or both of a user signature of the user operation data and an operation logic of the user operation data.
3. The state data storage method according to claim 2, wherein the operation logic of the user operation data is verified, including one or more of:
whether repeated operation exists in the operation logic of the user operation data or not is judged, and the repeated operation is judged whether the operation of the user on the same object exceeds a preset number of times or not;
whether the operation time sequence in the operation logic of the user operation data is correct or not;
whether the corresponding integral in the operation logic of the user operation data is sufficient or not;
whether a corresponding object exists in the operation logic of the user operation data;
and whether the user is allowed to operate in the operation logic of the user operation data comprises whether the user signs and whether the user is the owner of the operated object.
4. The state data storage method according to claim 3, wherein the object includes one or more of user information, entity information, and point information.
5. The state data storage method according to claim 1, wherein the first state tree is an MPT tree which is a merkel tree variation of a tree structure in which a prefix tree is fused, or a merkel tree which is a MerklePatriciaTree tree.
6. State data storage means for a service data blockchain, characterized in that the service data blockchain system comprises a plurality of blockchain nodes, said means being blockchain nodes, wherein,
the method comprises the steps that a block chain node receives user operation data sent by a client, wherein the user operation data are operation of a user on service data;
verifying the user operation data;
after the verification is passed, updating the current state tree of the current block into a first state tree based on the state data operated by the user; wherein the value of the leaf node of the first state tree stores the state data after the user operation, and the state data after the user operation comprises one or more of an integral state, an entity state and a user state.
7. The apparatus according to claim 6, wherein the block link point verifies the user-operated status data, and comprises:
the block link point checks one or both of a user signature of the user operation data and an operation logic of the user operation data.
8. The state data storage device of claim 7, wherein the operational logic of the user operational data verifies that one or more of:
whether repeated operation exists in the operation logic of the user operation data or not is judged, and the repeated operation is judged whether the operation of the user on the same object exceeds a preset number of times or not;
whether the operation time sequence in the operation logic of the user operation data is correct or not;
whether the corresponding integral in the operation logic of the user operation data is sufficient or not;
whether a corresponding object exists in the operation logic of the user operation data;
and whether the user is allowed to operate in the operation logic of the user operation data comprises whether the user signs and whether the user is the owner of the operated object.
9. The state data storage device of claim 8, wherein the object comprises one or more of user information, entity information, and point information.
10. The state data storage device of claim 6, wherein the first state tree is an MPT tree that is a merkel tree variant of a tree structure that merges prefix trees or a merkel tree that is a MerklePatriciaTree tree.
CN202010270306.4A 2020-04-08 2020-04-08 State data storage method and device for service data block chain Pending CN111488346A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010270306.4A CN111488346A (en) 2020-04-08 2020-04-08 State data storage method and device for service data block chain

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010270306.4A CN111488346A (en) 2020-04-08 2020-04-08 State data storage method and device for service data block chain

Publications (1)

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

Family

ID=71791589

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010270306.4A Pending CN111488346A (en) 2020-04-08 2020-04-08 State data storage method and device for service data block chain

Country Status (1)

Country Link
CN (1) CN111488346A (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109933404A (en) * 2018-12-12 2019-06-25 阿里巴巴集团控股有限公司 A kind of decoding method and system based on block chain intelligence contract
CN110032865A (en) * 2019-03-28 2019-07-19 腾讯科技（深圳）有限公司 A kind of right management method, device and storage medium
CN110471985A (en) * 2019-07-31 2019-11-19 阿里巴巴集团控股有限公司 Electronic bill based on block chain cancels method and device, electronic equipment

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109933404A (en) * 2018-12-12 2019-06-25 阿里巴巴集团控股有限公司 A kind of decoding method and system based on block chain intelligence contract
CN110032865A (en) * 2019-03-28 2019-07-19 腾讯科技（深圳）有限公司 A kind of right management method, device and storage medium
CN110471985A (en) * 2019-07-31 2019-11-19 阿里巴巴集团控股有限公司 Electronic bill based on block chain cancels method and device, electronic equipment

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
知耻而后勇: "区块链验证过程", 《HTTPS://BLOG.CSDN.NET/U013252773/ARTICLE/DETAILS/103957223》 *

Similar Documents

Publication Publication Date Title
CN111488396B (en) Data synchronization 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
CN111737726A (en) Relation data query method and device based on business data block chain
CN111488349A (en) Data query method and device based on service data block chain
CN111695136A (en) Method and system for realizing service data block chain
CN111488610A (en) State data query method and device based on service data block chain
CN111488344A (en) User operation data uplink method and system based on service data block chain
CN111488611B (en) Relation data storage method and device of business data block chain
CN111488356A (en) Data storage method and device for service data block chain
CN111488345A (en) Storage optimization method and device for service data block chain
CN111488613A (en) Data efficient query method and device for service data block chain
CN111488343A (en) E-commerce data uplink method and device based on business data block chain
CN111737729A (en) Evaluation data storage method and system based on service data block chain
CN111523137A (en) Data recommendation method and device based on service data block chain
CN111695132A (en) Voting data storage method and system based on service data block chain
CN111488607A (en) Data processing method and device for service data block chain
CN111488346A (en) State data storage method and device for service data block chain
CN111488352A (en) Point exchange method and device based on business data block chain
CN111695137A (en) Travel data storage method and system based on business data block chain
CN111488606B (en) Data sharing method and device based on service data block chain
CN111488359A (en) Relation data storage method and device of business data block chain
CN111488348A (en) Data storage method and device for service data block chain
CN111488350A (en) Entity relation storage method and device of business data block chain
CN111488355A (en) User relation storage method and device of business 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